{"meta":{"query_hash":"db7b57e9a4f9","filters":{"venue":"IEEE Transactions on Communications"},"cohort_total":879,"direct_labels_cover":0,"predictions_cover":879,"exported":879,"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/db7b57e9a4f9","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Communications"},"results":[{"id":"W1423052447","doi":"10.1109/tcomm.2015.2502954","title":"Hybrid Block Diagonalization for Massive Multiuser MIMO Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":382,"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":"Precoding; MIMO; Baseband; Electronic engineering; Telecommunications link; Rayleigh fading; Computer science; Block (permutation group theory); Antenna (radio); Fading; Channel (broadcasting); Multi-user MIMO; Telecommunications; Engineering; Mathematics; Bandwidth (computing)","score_opus":0.04356902100349175,"score_gpt":0.27359293536154305,"score_spread":0.2300239143580513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1423052447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038277262,0.0005545967,0.99482775,0.00018031232,0.0009053568,0.0010161868,0.00023601507,0.00063942943,0.0012575607],"genre_scores_gemma":[0.9740732,0.00028465185,0.023384742,0.00002539022,0.000053612694,0.0013084845,0.00010558747,0.00008550296,0.0006788727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902475,0.00007871757,0.00038103055,0.00017237946,0.00013402043,0.00020910626],"domain_scores_gemma":[0.99805105,0.00026150738,0.000073047006,0.0011403922,0.00033838034,0.0001356395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014976677,0.00018835471,0.00019438769,0.0001800026,0.0002521712,0.000055415017,0.00041417798,0.00008528208,0.0000049461],"category_scores_gemma":[0.000016930999,0.00021459302,0.00008103043,0.00023511931,0.000054695054,0.00029532996,0.0000024996812,0.00018103521,0.000070224334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009158542,0.00008016432,0.000002614912,0.0000344976,0.00005409255,2.1822348e-7,0.00027825133,0.9961811,0.00037699883,0.00047993063,0.0015897284,0.0009132883],"study_design_scores_gemma":[0.0008002147,0.000046842906,0.000002469272,0.00006915371,0.00006006192,0.000010332631,0.00030181263,0.97237325,0.0040006205,0.00015911464,0.021911237,0.0002648778],"about_ca_topic_score_codex":0.000030536175,"about_ca_topic_score_gemma":0.00005623685,"teacher_disagreement_score":0.9736904,"about_ca_system_score_codex":0.00026903546,"about_ca_system_score_gemma":0.00004496061,"threshold_uncertainty_score":0.87508494},"labels":[],"label_agreement":null},{"id":"W1487935471","doi":"10.1109/tcomm.2015.2438832","title":"Centralized and Game Theoretical Solutions of Joint Source and Relay Power Allocation for AF Relay Based Network","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Stackelberg competition; Computer science; Transmitter power output; Mathematical optimization; Node (physics); Game theory; Geometric programming; Computer network; Optimization problem; Power (physics); Key (lock); Mathematics; Engineering; Computer security","score_opus":0.0771996307057762,"score_gpt":0.2892104417411179,"score_spread":0.21201081103534167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487935471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013358346,0.0011959533,0.9842684,0.011831894,0.00013959143,0.00049447175,0.000012797679,0.0001274684,0.0005935791],"genre_scores_gemma":[0.9024068,0.0011368307,0.095813185,0.0003469026,0.00001014418,0.0001583351,0.000009423154,0.000015750997,0.000102606755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839973,0.00048596322,0.00041734093,0.00026759383,0.000167477,0.00026189865],"domain_scores_gemma":[0.9965762,0.000877434,0.0001378411,0.0018602457,0.0003546387,0.00019364941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090241147,0.00016108663,0.00022854967,0.00012990998,0.0006201658,0.00008935514,0.00078908633,0.00009771676,0.000014425037],"category_scores_gemma":[0.00006851591,0.00016177354,0.00008631705,0.00045250932,0.00054217246,0.00024316077,0.00004535762,0.00030169467,0.0000043389227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010474263,0.00076091784,0.00003771048,0.000023075037,0.00011581991,2.111701e-7,0.0042822203,0.064578585,0.0013783624,0.8915964,0.0017865519,0.035335455],"study_design_scores_gemma":[0.0016630758,0.00027490422,0.0002470447,0.00012353239,0.000064704436,0.000010493822,0.00016844062,0.9774351,0.0008867532,0.0051173507,0.013720716,0.0002878827],"about_ca_topic_score_codex":0.000008414174,"about_ca_topic_score_gemma":0.0000613584,"teacher_disagreement_score":0.9128565,"about_ca_system_score_codex":0.00006512149,"about_ca_system_score_gemma":0.00014349798,"threshold_uncertainty_score":0.6596933},"labels":[],"label_agreement":null},{"id":"W1519108428","doi":"10.1109/tcomm.2015.2429127","title":"Successive Interference Mitigation in Multiuser MIMO Channels","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Interference (communication); MIMO; Decoding methods; Set (abstract data type); Computer science; Interference alignment; Sequence (biology); Simple (philosophy); Transmission (telecommunications); Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Computer network; Telecommunications; Beamforming; Channel (broadcasting)","score_opus":0.04222010473372995,"score_gpt":0.28226395182882735,"score_spread":0.2400438470950974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519108428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035966458,0.0001916459,0.99208546,0.0002619482,0.0005912694,0.00033945977,0.000023961213,0.00033806934,0.00257152],"genre_scores_gemma":[0.9900026,0.00017945953,0.009200808,0.000026672375,0.000016460295,0.00029931826,0.00002160979,0.00003556441,0.00021753972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918795,0.000090161506,0.00031778525,0.00014169296,0.00009327763,0.00016911316],"domain_scores_gemma":[0.9986639,0.00016154101,0.0000439273,0.00090994587,0.00012769185,0.00009302105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121275945,0.00014457403,0.00014518635,0.0002597404,0.00009330623,0.000034197394,0.00044075114,0.00009292414,0.000016007803],"category_scores_gemma":[0.00001778138,0.00016769629,0.000038170903,0.00047621145,0.0000638994,0.00043391273,0.0000032288788,0.00032362374,0.00011064641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066772873,0.00008641161,0.0000203539,0.000010988819,0.000014045693,5.27559e-7,0.0016744694,0.9939518,0.00073701795,0.00014935147,0.00008518386,0.0032632034],"study_design_scores_gemma":[0.0007996712,0.000043186563,0.000033683806,0.00017109816,0.00001535347,0.0000048725938,0.00092125934,0.9836839,0.012979455,0.00039907446,0.00065967045,0.00028876078],"about_ca_topic_score_codex":0.00008098307,"about_ca_topic_score_gemma":0.00081563677,"teacher_disagreement_score":0.9864059,"about_ca_system_score_codex":0.000253131,"about_ca_system_score_gemma":0.000031307267,"threshold_uncertainty_score":0.68384564},"labels":[],"label_agreement":null},{"id":"W1554369138","doi":"10.1109/tcomm.2015.2451648","title":"On the Deployment of Energy Sources in Wireless-Powered Cellular Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":41,"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":"Base station; Telecommunications link; Wireless; Energy harvesting; Information transfer; Computer network; Computer science; Duplex (building); Beacon; Signal-to-noise ratio (imaging); Electronic engineering; Spectral efficiency; Energy (signal processing); Efficient energy use; Electrical engineering; Engineering; Telecommunications; Channel (broadcasting); Physics","score_opus":0.030259516526165892,"score_gpt":0.22414016401227677,"score_spread":0.19388064748611086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554369138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10387275,0.0011020304,0.8848739,0.0006364875,0.0005820377,0.00020416,0.000014114537,0.0004067096,0.008307793],"genre_scores_gemma":[0.99819523,0.0008282154,0.0005265651,0.000080488164,0.000021148793,0.00016342965,0.00000841446,0.00005092289,0.00012558643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989086,0.0002015836,0.0003564785,0.00012987273,0.00018482948,0.00021868422],"domain_scores_gemma":[0.9974531,0.0008125975,0.00005905974,0.0015387302,0.000055626,0.0000809117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025886876,0.00017064897,0.00018397413,0.00013959156,0.00013761164,0.00002291569,0.0008206618,0.000117296266,0.000017734135],"category_scores_gemma":[0.000007690939,0.00015154263,0.00007554321,0.00048311858,0.0001529785,0.000064429856,0.000006173026,0.000492186,0.000008234369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009450011,0.00016319258,0.000019578445,0.0000035965154,0.000040628598,6.076375e-7,0.00021170925,0.9889384,0.0003119724,0.006987515,0.00033973352,0.0029736545],"study_design_scores_gemma":[0.0003895438,0.00006958009,0.00004746859,0.00017572008,0.00002628497,0.0000017726687,0.00016731919,0.98276454,0.013384345,0.00066113163,0.0020913887,0.00022093172],"about_ca_topic_score_codex":0.00018474068,"about_ca_topic_score_gemma":0.001138751,"teacher_disagreement_score":0.89432245,"about_ca_system_score_codex":0.00011868489,"about_ca_system_score_gemma":0.000028701805,"threshold_uncertainty_score":0.61797285},"labels":[],"label_agreement":null},{"id":"W1575827797","doi":"10.1109/tcomm.2010.03.080238","title":"Two-user opportunistic scheduling using hierarchical modulations in wireless networks with heterogenous average link gains","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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; Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Scheduling (production processes); Computer science; Spectral efficiency; Wireless; Algorithm; Computer network; Real-time computing; Mathematics; Channel (broadcasting); Telecommunications; Mathematical optimization","score_opus":0.02981871467635826,"score_gpt":0.2724712433676104,"score_spread":0.24265252869125215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575827797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08631775,0.000039362974,0.9118598,0.00017882649,0.00030792225,0.00040592047,0.000030277823,0.00042892477,0.00043122744],"genre_scores_gemma":[0.8681286,0.00034855085,0.13107891,0.000044927077,0.00006786296,0.00013384719,0.00006433071,0.00010858375,0.00002438561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985583,0.00010219022,0.00046759265,0.00027459263,0.00017966499,0.00041768822],"domain_scores_gemma":[0.9977464,0.0003226591,0.00007254009,0.0015901075,0.00009762719,0.00017063586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014633899,0.00028972578,0.00026802009,0.00032733014,0.00058685493,0.000075908894,0.0005531813,0.00019050433,0.000033578654],"category_scores_gemma":[0.00000474279,0.00032470012,0.00007698193,0.0008194064,0.00021455118,0.0003457256,0.0000076776705,0.0018545489,0.000008813106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014697991,0.00014392279,0.00008715922,0.000008773034,0.00004152982,0.000004236083,0.00015906677,0.9891127,0.0029138217,0.0011014432,9.657903e-7,0.0064117196],"study_design_scores_gemma":[0.00059720234,0.000025424199,0.00009695883,0.00008832709,0.000039079307,0.00003075818,0.000029443758,0.9981873,0.0003712673,0.000114576425,0.00008096585,0.00033870887],"about_ca_topic_score_codex":0.000048217204,"about_ca_topic_score_gemma":0.0023319747,"teacher_disagreement_score":0.7818108,"about_ca_system_score_codex":0.00015785523,"about_ca_system_score_gemma":0.0000783662,"threshold_uncertainty_score":0.9999205},"labels":[],"label_agreement":null},{"id":"W1626906177","doi":"10.1109/tcomm.2015.2493063","title":"Degraded Gaussian Diamond–Wiretap Channel","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Qatar National Research Fund","keywords":"Randomness; Relay; Channel (broadcasting); Gaussian; Secrecy; Upper and lower bounds; Computer science; Topology (electrical circuits); Relay channel; Channel code; Encoder; Coding (social sciences); Constraint (computer-aided design); Computer network; Decoding methods; Algorithm; Mathematics; Combinatorics; Statistics; Physics; Computer security","score_opus":0.07075431771036544,"score_gpt":0.28243073572356403,"score_spread":0.2116764180131986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626906177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045288834,0.0017910099,0.9340579,0.0045660227,0.0005880034,0.00073961366,0.00012773328,0.005199724,0.048401143],"genre_scores_gemma":[0.9866385,0.001682425,0.010688802,0.00012722136,0.000019104995,0.00046359995,0.000030961844,0.00007515292,0.00027423073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877346,0.00016724512,0.0003791295,0.00017064606,0.00023787288,0.00027165227],"domain_scores_gemma":[0.9958606,0.0001891489,0.00004951282,0.003526764,0.00013099432,0.00024301717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024284574,0.00023647738,0.00022621625,0.00029727566,0.0003123537,0.00006851266,0.0016173432,0.00016308266,0.000034880657],"category_scores_gemma":[0.000009695505,0.0002689266,0.00012162657,0.0005765176,0.00019827914,0.0003032441,0.000011221877,0.00072013156,0.0002779731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022753069,0.009059298,0.0002066284,0.00041753743,0.002329735,0.000023795079,0.074549206,0.35110974,0.02279048,0.0530047,0.12385664,0.36242473],"study_design_scores_gemma":[0.0026872328,0.0003683215,0.0005597018,0.00036780737,0.00027015925,0.00008725168,0.0028414647,0.65792257,0.15601467,0.013886495,0.16238284,0.002611477],"about_ca_topic_score_codex":0.00008175628,"about_ca_topic_score_gemma":0.0003629702,"teacher_disagreement_score":0.9821096,"about_ca_system_score_codex":0.0002134006,"about_ca_system_score_gemma":0.000053389398,"threshold_uncertainty_score":0.9999763},"labels":[],"label_agreement":null},{"id":"W1760638340","doi":"10.1109/tcomm.2015.2431259","title":"Asymptotic Performance of Energy Detector in Fading and Diversity Reception","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Fading; Moment-generating function; Probability density function; Detector; Energy (signal processing); Random variable; Diversity gain; Mathematics; Metric (unit); Signal-to-noise ratio (imaging); Interference (communication); Applied mathematics; Algorithm; Computer science; Channel (broadcasting); Statistics; Telecommunications; Engineering","score_opus":0.04367925550076344,"score_gpt":0.24460448747679936,"score_spread":0.20092523197603593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760638340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.305716,0.0001127954,0.69275194,0.00033389786,0.00010253736,0.00005232142,0.0000017056391,0.000039702845,0.0008890803],"genre_scores_gemma":[0.9926734,0.0006436076,0.0066047953,0.00003464758,0.00000548098,0.000004367573,6.6173385e-7,0.0000037353714,0.000029320485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994081,0.000104443534,0.00014317024,0.00013002919,0.0001075117,0.00010671697],"domain_scores_gemma":[0.99911624,0.00015208189,0.00004670535,0.0005589903,0.00006853579,0.000057452016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017775907,0.00006717334,0.00010036816,0.00017283834,0.00025330426,0.000021870137,0.00039547178,0.00003637195,0.0000018819869],"category_scores_gemma":[0.000004252933,0.00007409276,0.000026728114,0.00040663645,0.00007947856,0.00028520354,0.000025181018,0.00014294064,0.0000021542457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009494543,0.0007764135,0.007849225,0.000027999384,0.00007960539,0.0000031521818,0.008625191,0.039568957,0.0026311425,0.009872312,0.000055644396,0.9304154],"study_design_scores_gemma":[0.00068923086,0.00023725064,0.009282148,0.00011470412,0.000017832763,0.000019377834,0.0001481235,0.98290133,0.0052416436,0.0009270349,0.00022056054,0.00020076752],"about_ca_topic_score_codex":0.00018155576,"about_ca_topic_score_gemma":0.0007681446,"teacher_disagreement_score":0.9433324,"about_ca_system_score_codex":0.000078614044,"about_ca_system_score_gemma":0.00003061424,"threshold_uncertainty_score":0.3021415},"labels":[],"label_agreement":null},{"id":"W1917463349","doi":"10.1109/tcomm.2015.2456093","title":"Millimeter Wave Cellular Networks: A MAC Layer Perspective","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":405,"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":"European Commission; York University; Vetenskapsrådet; Stiftelsen för Strategisk Forskning; New York University","keywords":"Computer network; Computer science; Physical layer; Radio resource management; Cellular network; Wireless; Scheduling (production processes); Base station; Handover; Synchronization (alternating current); Wireless network; Electronic engineering; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.09565613722390491,"score_gpt":0.2706013469799129,"score_spread":0.17494520975600797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917463349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024148545,0.0011739752,0.9822142,0.0004990226,0.0005111498,0.00025737158,0.000028299739,0.00045302673,0.012448085],"genre_scores_gemma":[0.9863934,0.0006877689,0.011939566,0.00017439136,0.000045455366,0.00012935058,0.000014934851,0.000056687608,0.00055846886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990308,0.000105406005,0.00027486266,0.00018164654,0.00016715247,0.00024011274],"domain_scores_gemma":[0.9982152,0.00010366667,0.000030706906,0.0012516911,0.00021532968,0.00018338815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018714526,0.00019245296,0.00016650923,0.00018864032,0.00023599091,0.00005302989,0.00036198657,0.00010803491,0.00009880379],"category_scores_gemma":[0.0000058217115,0.00020475473,0.00012720146,0.00031267255,0.00007637596,0.00016103145,0.000004968052,0.0004837625,0.00019479178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024383999,0.00028011904,0.0000022608563,0.000011991683,0.00025926696,0.0000029263094,0.0034942336,0.9706798,0.013163912,0.0004155306,0.00214198,0.009523591],"study_design_scores_gemma":[0.00045892096,0.00005302811,0.0000023676464,0.000028072796,0.00007682554,0.000009147507,0.0009705792,0.95452297,0.03807829,0.0006794501,0.004821079,0.0002992994],"about_ca_topic_score_codex":0.000056640056,"about_ca_topic_score_gemma":0.00009917735,"teacher_disagreement_score":0.9839785,"about_ca_system_score_codex":0.00024024215,"about_ca_system_score_gemma":0.000033504057,"threshold_uncertainty_score":0.8349655},"labels":[],"label_agreement":null},{"id":"W1941179672","doi":"10.1109/tcomm.2015.2472012","title":"On Lossy Joint Source-Channel Coding in Energy Harvesting Communication Systems","year":2015,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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","keywords":"Computer science; Lossy compression; Transmitter; Gaussian; Channel (broadcasting); Binary number; Topology (electrical circuits); Decoding methods; Control theory (sociology); Electronic engineering; Telecommunications; Mathematics; Physics; Electrical engineering; Engineering","score_opus":0.06005247262184767,"score_gpt":0.25314948716233887,"score_spread":0.1930970145404912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1941179672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00681834,0.004708515,0.9646145,0.00044985907,0.002409964,0.0006981648,0.0001685976,0.0022166113,0.017915465],"genre_scores_gemma":[0.98899114,0.0054105604,0.002985169,0.00006467927,0.00008716414,0.0011546625,0.00022730067,0.00024539456,0.00083393167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654573,0.0007685945,0.0011850666,0.00051834015,0.00043322783,0.00054901204],"domain_scores_gemma":[0.9924011,0.0013232776,0.0003112677,0.005477384,0.00025290978,0.0002340489],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0009066538,0.0006601278,0.00072887854,0.0008482753,0.0005225884,0.00031219758,0.0022148362,0.00075669895,0.000010664905],"category_scores_gemma":[0.00006117843,0.00081877323,0.00021356481,0.00063184917,0.00024126576,0.00020494733,0.000082914354,0.0034762672,0.000048449067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008996235,0.0002197949,0.0000027018857,0.00011023755,0.00010937752,0.0000019947213,0.00061404763,0.9918809,0.00006156934,0.0027555234,0.0007561872,0.003478687],"study_design_scores_gemma":[0.00041076032,0.000037611877,0.000019554087,0.003408596,0.00006621259,0.000013049908,0.00021228696,0.99116015,0.0003252023,0.0015309259,0.0021085173,0.00070715253],"about_ca_topic_score_codex":0.0022606307,"about_ca_topic_score_gemma":0.0027296487,"teacher_disagreement_score":0.9821728,"about_ca_system_score_codex":0.0011780106,"about_ca_system_score_gemma":0.00015299498,"threshold_uncertainty_score":0.9994263},"labels":[],"label_agreement":null},{"id":"W1964527706","doi":"10.1109/tcomm.2013.061913.110585","title":"Improved Low-Complexity Soliton-Like Network Coding for a Resource-Limited Relay","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Linear network coding; Relay; Computer science; Decoding methods; Coding (social sciences); Computer network; Erasure; Luby transform code; Degree distribution; Encoding (memory); Theoretical computer science; Algorithm; Block code; Mathematics; Concatenated error correction code; Network packet; Complex network","score_opus":0.07585027634728102,"score_gpt":0.2960460330290131,"score_spread":0.22019575668173208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964527706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004534745,0.0003133239,0.9839987,0.010235853,0.00042639524,0.0012677668,0.000017295202,0.00057021173,0.0027169443],"genre_scores_gemma":[0.8328765,0.0010364837,0.16119348,0.0019563562,0.00007106937,0.0015117222,0.000032959528,0.00004022681,0.0012812127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977538,0.00047581008,0.0005846517,0.00046297658,0.00018755355,0.00053523073],"domain_scores_gemma":[0.9929391,0.0013829395,0.00019389822,0.0048546186,0.0004236063,0.00020580208],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005322283,0.00028208064,0.000295625,0.00019124869,0.002450662,0.0003848867,0.0036893634,0.00013500047,0.00009075558],"category_scores_gemma":[0.000028070837,0.00029483967,0.00023857527,0.0010265135,0.00027494077,0.000634465,0.000077216355,0.00066669803,0.00012340517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013769421,0.0034218251,0.000040628263,0.00012676134,0.0006113735,0.0000011888131,0.0072657075,0.053360272,0.017070528,0.27227542,0.07321837,0.57247025],"study_design_scores_gemma":[0.00082863704,0.00013003725,0.00017446124,0.00011351413,0.000030872223,0.0000072159523,0.00009915472,0.9477838,0.0010687916,0.0022869543,0.04701383,0.00046273225],"about_ca_topic_score_codex":0.00004743999,"about_ca_topic_score_gemma":0.0003100734,"teacher_disagreement_score":0.89442354,"about_ca_system_score_codex":0.00015965739,"about_ca_system_score_gemma":0.000105564344,"threshold_uncertainty_score":0.99995035},"labels":[],"label_agreement":null},{"id":"W1964584888","doi":"10.1109/tcomm.2009.09.070583","title":"Sum-rate analysis of multiuser MIMO system with zero-forcing transmit beamforming","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Beamforming; Ergodic theory; MIMO; Precoding; Control theory (sociology); Channel (broadcasting); Transmitter power output; Mathematics; Computer science; Topology (electrical circuits); Telecommunications; Mathematical optimization; Transmitter; Mathematical analysis; Combinatorics","score_opus":0.015621025747745189,"score_gpt":0.23769495010548222,"score_spread":0.22207392435773704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964584888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006765552,0.00015402246,0.99018115,0.000066118344,0.00007427532,0.00034456706,0.000073968054,0.0005006087,0.0018397217],"genre_scores_gemma":[0.9636048,0.0001875687,0.035962895,0.000014697777,0.0000052503483,0.00007172598,0.00003057498,0.000037736067,0.000084749045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889016,0.00007381722,0.00051031524,0.00017516132,0.00013458554,0.00021594111],"domain_scores_gemma":[0.9980455,0.00017840773,0.000104841405,0.0014569248,0.00013884527,0.00007546402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016323652,0.0002102362,0.0003875207,0.0006181164,0.00027456263,0.000024018933,0.0004367325,0.000094340896,0.000009847294],"category_scores_gemma":[0.0000020948346,0.00020946181,0.00016789243,0.0016683335,0.00005798332,0.00033202927,9.626907e-7,0.00026655613,0.00000775473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000141367345,0.00007478729,0.00001740507,0.00004263466,0.00048417356,4.0626443e-7,0.00070096727,0.9909891,0.0043262574,0.00031118703,0.0000038089004,0.0030351658],"study_design_scores_gemma":[0.00045267495,0.00006968766,0.00024239306,0.00021183374,0.0009556751,0.0000047532235,0.00052269717,0.9867078,0.010456475,0.000009819108,0.00009988253,0.00026628937],"about_ca_topic_score_codex":0.000100358455,"about_ca_topic_score_gemma":0.00071737263,"teacher_disagreement_score":0.95683926,"about_ca_system_score_codex":0.00017352203,"about_ca_system_score_gemma":0.000019787807,"threshold_uncertainty_score":0.8541605},"labels":[],"label_agreement":null},{"id":"W1966874787","doi":"10.1109/tcomm.2010.05.080299","title":"On the design of LDPC code ensembles for BIAWGN channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Additive white Gaussian noise; Node (physics); Algorithm; Computer science; Code (set theory); Variable (mathematics); Upper and lower bounds; Channel (broadcasting); Mathematics; Decoding methods; Theoretical computer science; Engineering","score_opus":0.09466371076810175,"score_gpt":0.31983875124568273,"score_spread":0.22517504047758097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966874787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012730309,0.000015280673,0.9896214,0.0067248195,0.00055218954,0.0007219162,0.000024764446,0.0003980558,0.0006685238],"genre_scores_gemma":[0.8041051,0.00004982517,0.19491126,0.00024556447,0.000010166225,0.00048042307,9.140823e-7,0.000016295586,0.0001804659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989464,0.00021417419,0.0002706298,0.00021786314,0.00016856453,0.000182325],"domain_scores_gemma":[0.9917783,0.0043586297,0.0001354423,0.0034769403,0.00020522214,0.00004545056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357165,0.00013836075,0.00014388116,0.0001814915,0.00066973164,0.00006552618,0.003025875,0.0000915898,0.000013242724],"category_scores_gemma":[0.000084142615,0.00011160101,0.00012452558,0.00042564856,0.00017715541,0.00015308455,0.000013212156,0.0005216721,0.000018767798],"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.00009809363,0.0025407854,0.0000050508097,0.000039174636,0.00018930438,6.623955e-7,0.0063873404,0.028107677,0.22522055,0.628308,0.0097998055,0.09930358],"study_design_scores_gemma":[0.00030222017,0.00048720752,0.000013835908,0.00009177249,0.000037920418,0.000013266359,0.00009239951,0.40099254,0.5458926,0.047349606,0.004414804,0.0003118483],"about_ca_topic_score_codex":0.000042340205,"about_ca_topic_score_gemma":0.00020946981,"teacher_disagreement_score":0.80283207,"about_ca_system_score_codex":0.000024701645,"about_ca_system_score_gemma":0.00008273957,"threshold_uncertainty_score":0.56228787},"labels":[],"label_agreement":null},{"id":"W1966992373","doi":"10.1109/tcomm.2012.062512.100568","title":"On the Benefits of Multichannel/Wideband Spectrum Sensing with Non-Uniform Channel Sensing Durations for Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Cognitive radio; Narrowband; Wideband; Interference (communication); Computer science; Channel (broadcasting); Convex optimization; Optimization problem; Electronic engineering; Throughput; Transmission (telecommunications); Constraint (computer-aided design); Algorithm; Computer network; Regular polygon; Telecommunications; Mathematics; Wireless; Engineering","score_opus":0.0305796731900877,"score_gpt":0.2511619792142153,"score_spread":0.2205823060241276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966992373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00937381,0.00016198042,0.98418057,0.0038632075,0.00037799665,0.0009368058,0.00004146186,0.000106040396,0.00095812074],"genre_scores_gemma":[0.9791667,0.0002553501,0.019960837,0.00035608545,0.00011807373,0.000028951694,0.000013079471,0.00003909946,0.00006183411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983369,0.0001810243,0.00039154838,0.00030256002,0.00024232338,0.00054564833],"domain_scores_gemma":[0.9942918,0.0036596535,0.00023425696,0.0013702095,0.00030291575,0.00014116793],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004677601,0.00028785568,0.00030135963,0.00023021123,0.0017272361,0.00012628557,0.00055824284,0.00010139191,0.0000045532333],"category_scores_gemma":[0.00002965185,0.00022610374,0.0001759007,0.0008084783,0.00026511063,0.00043572506,0.0000145213635,0.0005203211,0.0000066476377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005081606,0.0019741468,0.000022850694,0.000047986876,0.0011598086,0.0000038099367,0.016675713,0.76479197,0.0007778824,0.056850195,0.00045502489,0.15673244],"study_design_scores_gemma":[0.0008380645,0.00027826658,0.00022664534,0.00041227377,0.00014584417,0.00007109279,0.0005840201,0.98664075,0.009719267,0.00069806573,0.000050760966,0.00033496864],"about_ca_topic_score_codex":0.00008407461,"about_ca_topic_score_gemma":0.0007878932,"teacher_disagreement_score":0.9697929,"about_ca_system_score_codex":0.000096679454,"about_ca_system_score_gemma":0.000067238005,"threshold_uncertainty_score":0.9995724},"labels":[],"label_agreement":null},{"id":"W1969231301","doi":"10.1109/tcomm.2014.2367020","title":"Optimized Distributed Inter-Cell Interference Coordination (ICIC) Scheme Using Projected Subgradient and Network Flow Optimization","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Huawei Technologies (Canada); Carleton University","funders":"","keywords":"Subgradient method; Mathematical optimization; Scheduling (production processes); Interference (communication); Linear programming; Computer science; Computational complexity theory; Optimization problem; Single antenna interference cancellation; Polynomial; Mathematics; Algorithm; Channel (broadcasting); Decoding methods","score_opus":0.018901272718236946,"score_gpt":0.23589502661857137,"score_spread":0.21699375390033443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969231301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012618758,0.00017164815,0.99653673,0.00015382971,0.00035649212,0.00049349805,0.000050531682,0.00052057527,0.00045480626],"genre_scores_gemma":[0.61417574,0.0005485041,0.38490584,0.000014633218,0.000026759402,0.000099791825,0.00014895818,0.000045770346,0.000033982054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987334,0.00016693781,0.00041650597,0.00026635057,0.00011949981,0.0002973321],"domain_scores_gemma":[0.99810886,0.0002331634,0.00014311481,0.0012253992,0.00018787774,0.0001016011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018599117,0.00026921876,0.0002730196,0.00016589399,0.00074416795,0.00013227148,0.0004869908,0.0001441057,0.000023445811],"category_scores_gemma":[0.000020146565,0.000313742,0.00006548465,0.00045625586,0.00016082313,0.00042927428,0.000013660927,0.00042575176,0.000005307415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023816978,0.00008951711,0.0000118937505,0.000022303626,0.00003589287,1.3330087e-7,0.00013653233,0.99367243,0.00043482232,0.00007372494,0.0000690492,0.0054298616],"study_design_scores_gemma":[0.00074562064,0.00004945628,0.000016184182,0.00014895068,0.000060744514,0.000004441685,0.000032961525,0.9976499,0.0006063763,0.00006238139,0.00033139327,0.00029158345],"about_ca_topic_score_codex":0.00001844899,"about_ca_topic_score_gemma":0.000051160587,"teacher_disagreement_score":0.61291385,"about_ca_system_score_codex":0.00020541067,"about_ca_system_score_gemma":0.0000232438,"threshold_uncertainty_score":0.99993145},"labels":[],"label_agreement":null},{"id":"W1969312047","doi":"10.1109/tcomm.2002.801465","title":"Analytical level crossing rates and average fade durations for diversity techniques in Nakagami fading channels","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 British Columbia","funders":"","keywords":"Fading; Nakagami distribution; Fade; Diversity combining; Maximal-ratio combining; Rayleigh fading; Channel (broadcasting); Statistics; Diversity gain; Diversity scheme; Fading distribution; Level crossing; Telecommunications; Envelope (radar); Channel state information; Computer science; Mathematics; Algorithm; Wireless; Engineering","score_opus":0.08259165893051813,"score_gpt":0.2958363710545022,"score_spread":0.2132447121239841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969312047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00335597,0.00016969594,0.9943424,0.00032206657,0.000104903775,0.00048535469,0.00009850858,0.00031641393,0.0008046965],"genre_scores_gemma":[0.971319,0.0004940784,0.027631534,0.000023811612,0.000014183575,0.00018506066,0.000011784642,0.000027707547,0.00029281183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992759,0.000043395274,0.00027165693,0.00015681719,0.00006588545,0.00018633925],"domain_scores_gemma":[0.99903715,0.0002913768,0.00003457953,0.0005180102,0.000062672036,0.000056231616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011014559,0.0001415696,0.0001633305,0.00027379868,0.001023839,0.00009432289,0.00024109207,0.000099940946,0.000017219481],"category_scores_gemma":[0.00001449324,0.00017110606,0.000053083302,0.00034527862,0.00012595084,0.00041125005,0.000008798517,0.0002477709,0.000005819383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008126619,0.00019730681,0.00012144108,0.000067989014,0.000059122583,8.824098e-7,0.004024759,0.97933054,0.0022493224,0.0007878049,0.00015147288,0.013001259],"study_design_scores_gemma":[0.00033642564,0.00002332657,0.00011512999,0.00008378253,0.000025360147,0.000006345724,0.00016756689,0.99235266,0.0059697414,0.00023031907,0.00048271666,0.00020664936],"about_ca_topic_score_codex":0.00003386095,"about_ca_topic_score_gemma":0.0002143252,"teacher_disagreement_score":0.96796304,"about_ca_system_score_codex":0.00015865384,"about_ca_system_score_gemma":0.0000072841676,"threshold_uncertainty_score":0.7874645},"labels":[],"label_agreement":null},{"id":"W1969403520","doi":"10.1109/tcomm.2006.885084","title":"Frequency-Domain Channel Estimation for SC-FDE in UWB Communications","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 Victoria","funders":"","keywords":"SC-FDE; Estimator; Frequency domain; Channel (broadcasting); Minimum mean square error; Equalization (audio); Transmission (telecommunications); Algorithm; Ultra-wideband; Mean squared error; Computer science; Upper and lower bounds; Channel state information; Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics; Wireless","score_opus":0.020601408733283,"score_gpt":0.2542858328345232,"score_spread":0.2336844241012402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969403520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00573888,0.0013818656,0.9699242,0.0065980484,0.00022194612,0.0012757644,0.00025636147,0.0013579087,0.013245034],"genre_scores_gemma":[0.82973015,0.001067364,0.16608544,0.00007003596,0.000012328237,0.0026348373,0.00020852411,0.000073960095,0.00011732503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982081,0.00016515875,0.0007587478,0.00025712023,0.00014951343,0.00046135834],"domain_scores_gemma":[0.99284667,0.00094002165,0.00009765868,0.005917477,0.00013361001,0.000064571446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037062643,0.0002995689,0.00031183803,0.0007224963,0.00082461705,0.000061446095,0.0027825155,0.00027832994,0.000023031555],"category_scores_gemma":[0.000020219693,0.00036978675,0.00016554944,0.0010797471,0.00040326075,0.00032674373,0.000020153357,0.00080683205,0.000091103335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000548893,0.0053370474,0.00026910938,0.00019542078,0.00040268296,0.0000020571642,0.0027989007,0.56420255,0.03866126,0.31470475,0.0045299283,0.068841435],"study_design_scores_gemma":[0.0026349842,0.0001553942,0.0011660156,0.00026970435,0.0001570886,0.000038592003,0.00085973303,0.7365099,0.013061096,0.22809094,0.015728988,0.0013275127],"about_ca_topic_score_codex":0.00041348906,"about_ca_topic_score_gemma":0.007957079,"teacher_disagreement_score":0.8239913,"about_ca_system_score_codex":0.00038218428,"about_ca_system_score_gemma":0.000066896864,"threshold_uncertainty_score":0.9998754},"labels":[],"label_agreement":null},{"id":"W1971124947","doi":"10.1109/tcomm.2013.071013.120521","title":"A Max-Flow Design Approach for Improved Service Availability in Multi-Ring ERP Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Failover; Computer network; Computer science; Network topology; Synchronous optical networking; Ring network; Ethernet flow control; Service (business); Distributed computing; Optical mesh network; Ethernet; Network planning and design; Wireless mesh network; Telecommunications","score_opus":0.05484207719999598,"score_gpt":0.26116356316212486,"score_spread":0.20632148596212888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971124947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038446637,0.0002554595,0.99583125,0.00047639315,0.00009893088,0.0016372597,0.000018578463,0.0010311741,0.00026647758],"genre_scores_gemma":[0.41536057,0.0002913165,0.5820283,0.00005211784,0.0000056472177,0.0021848672,0.000009578093,0.000037669895,0.000029881397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998876,0.000065330394,0.00037418466,0.00024283356,0.000055528773,0.00038615128],"domain_scores_gemma":[0.997401,0.00066007714,0.000032697953,0.0017333402,0.00010431775,0.000068561436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018657905,0.00021603912,0.0002312774,0.00013114081,0.00023351578,0.00004449674,0.00084415305,0.00021663177,0.000019961755],"category_scores_gemma":[0.00001920579,0.00023394363,0.000078085664,0.00061968353,0.000114621944,0.0002764628,0.000009870193,0.00071190635,0.000026489764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008380264,0.00021657995,0.0000036928898,0.000025610305,0.00002599875,3.4482586e-8,0.00007441761,0.9626024,0.00070623594,0.000041381587,0.000042247673,0.036253046],"study_design_scores_gemma":[0.00049508625,0.000028201177,0.00008628749,0.000024124069,0.000018036375,0.0000011972124,0.00013038212,0.99793375,0.00046604415,0.00041551577,0.00017246706,0.00022893205],"about_ca_topic_score_codex":0.000053404077,"about_ca_topic_score_gemma":0.00031125546,"teacher_disagreement_score":0.41497612,"about_ca_system_score_codex":0.00018409514,"about_ca_system_score_gemma":0.000014454117,"threshold_uncertainty_score":0.95399445},"labels":[],"label_agreement":null},{"id":"W1972053034","doi":"10.1109/tcomm.2008.060117","title":"Mobility Enhanced Smart Antenna Adaptive Sectoring for Uplink Capacity Maximization in CDMA Cellular Network","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Telecommunications link; Cellular network; Computer science; Femtocell; Capacity planning; Computer network; Real-time computing; Base station","score_opus":0.0981226239586824,"score_gpt":0.2891847913057321,"score_spread":0.1910621673470497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972053034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009448421,0.00022376492,0.9867902,0.0011707811,0.0003037636,0.001129044,0.000016264077,0.00027779362,0.00063997565],"genre_scores_gemma":[0.8412193,0.0009485345,0.15654814,0.00007493589,0.000032522894,0.0009816963,0.000015050353,0.000026792824,0.00015301777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738896,0.0006221909,0.00061537145,0.0005153979,0.0003179603,0.0005401072],"domain_scores_gemma":[0.99319667,0.001421861,0.00016628682,0.0046398775,0.00042927358,0.00014600599],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00083256385,0.00024351504,0.00031527286,0.00028142135,0.0014333944,0.00007896626,0.0033275068,0.00017340177,0.00001544358],"category_scores_gemma":[0.000032931035,0.0002810435,0.00017476005,0.0017001459,0.00032847177,0.0006531384,0.000058543286,0.0008833493,0.00002983781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002340463,0.003637736,0.00041398988,0.000060034916,0.000189639,0.0000035961325,0.0062139905,0.91864634,0.012571302,0.021179227,0.0003617027,0.03648838],"study_design_scores_gemma":[0.00076960237,0.00012693404,0.0011459962,0.00008464101,0.0000098202845,0.0000061499836,0.00005031807,0.98537695,0.008917016,0.0026881313,0.0004919948,0.00033241964],"about_ca_topic_score_codex":0.0002300529,"about_ca_topic_score_gemma":0.0009979131,"teacher_disagreement_score":0.8317709,"about_ca_system_score_codex":0.00036652782,"about_ca_system_score_gemma":0.00020069933,"threshold_uncertainty_score":0.9999642},"labels":[],"label_agreement":null},{"id":"W1973323421","doi":"10.1109/tcomm.2014.010914.130249","title":"Free-Space Optical Communication with Nonzero Boresight Pointing Errors","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":400,"is_retracted":false,"has_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":"Fading; Probability density function; Free-space optical communication; Jitter; Bit error rate; Log-normal distribution; Optics; Cumulative distribution function; Optical communication; Nakagami distribution; Electronic engineering; Time diversity; Mathematics; Physics; Computer science; Statistics; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.013823083471176457,"score_gpt":0.22404120163205266,"score_spread":0.2102181181608762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973323421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006154772,0.00082974625,0.9306058,0.010966815,0.000108236236,0.0004529626,0.000042630094,0.0032680852,0.04757095],"genre_scores_gemma":[0.85850096,0.0020068209,0.13886525,0.00008895599,0.00000846788,0.00028372282,0.000021015565,0.00008403327,0.00014077788],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983916,0.00021311127,0.00046785388,0.00025053282,0.0002924796,0.00038440182],"domain_scores_gemma":[0.9906596,0.001240616,0.000084513485,0.007710903,0.00016676392,0.00013759876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033992354,0.00031987176,0.0003127678,0.00029893516,0.0007802109,0.000112905116,0.0032997956,0.00022921954,0.000048880927],"category_scores_gemma":[0.00005883637,0.0003125131,0.00010866635,0.0007482969,0.0006909678,0.00034738853,0.000044307228,0.001261269,0.00013988918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014655985,0.0023068814,0.00013506276,0.00020464064,0.0008372907,0.000002533623,0.0020196452,0.2035598,0.008742679,0.3622855,0.004556335,0.4152031],"study_design_scores_gemma":[0.0028026733,0.0005199678,0.000917656,0.00062261027,0.00025545896,0.000050780145,0.0015480716,0.8059504,0.10702562,0.009848584,0.06847091,0.0019872484],"about_ca_topic_score_codex":0.000036907728,"about_ca_topic_score_gemma":0.0004951122,"teacher_disagreement_score":0.8523462,"about_ca_system_score_codex":0.0001543311,"about_ca_system_score_gemma":0.000029171144,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W1974016518","doi":"10.1109/tcomm.2014.2361337","title":"Lattice-Reduction-Aided Conditional Detection for MIMO Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Lattice reduction; Orthogonality; MIMO; Detector; Algorithm; Fading; Computational complexity theory; Lattice (music); Mathematics; Reduction (mathematics); Decoding methods; Computer science; Channel (broadcasting); Topology (electrical circuits); Theoretical computer science; Telecommunications; Combinatorics","score_opus":0.027701495235057216,"score_gpt":0.2748324164135937,"score_spread":0.24713092117853647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974016518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089772715,0.00020947211,0.9933669,0.00033798045,0.00053483475,0.0006939648,0.00012625703,0.0016128343,0.002220003],"genre_scores_gemma":[0.9690322,0.0005557362,0.027697686,0.000034768254,0.000058309255,0.0022109465,0.00007986934,0.00007079241,0.00025965215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889296,0.0001351891,0.00042083563,0.0001854416,0.00014856084,0.00021703528],"domain_scores_gemma":[0.99701697,0.0006304364,0.00008255887,0.0019772453,0.000206581,0.00008623025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022651507,0.00020296485,0.00020650956,0.00026147978,0.0007046305,0.00006017421,0.00071563985,0.00014275505,0.000019564497],"category_scores_gemma":[0.000015628215,0.00024357713,0.00013053638,0.0003137729,0.0001570292,0.00030647952,0.0000038201297,0.00040522873,0.000065819324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043028114,0.0004915615,0.0000022999118,0.00017512082,0.00027106574,8.187593e-8,0.00038294776,0.799154,0.061603304,0.037157223,0.0013758028,0.09934357],"study_design_scores_gemma":[0.00070253905,0.00013134601,0.00003522434,0.0000856664,0.000090091096,0.000027399123,0.0002190471,0.7999085,0.11824955,0.0068723727,0.07316917,0.00050907035],"about_ca_topic_score_codex":0.000022678476,"about_ca_topic_score_gemma":0.00006492318,"teacher_disagreement_score":0.9681345,"about_ca_system_score_codex":0.00019277298,"about_ca_system_score_gemma":0.000018579538,"threshold_uncertainty_score":0.99327874},"labels":[],"label_agreement":null},{"id":"W1974190285","doi":"10.1109/tcomm.2013.092813.130126","title":"Uniform Approximations for Wireless Performance in Fading Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Moment-generating function; Fading; Rayleigh fading; Maximal-ratio combining; Probability density function; Signal-to-noise ratio (imaging); Mathematics; Cumulative distribution function; Channel (broadcasting); Algorithm; Topology (electrical circuits); Computer science; Statistics; Telecommunications","score_opus":0.06295867897916722,"score_gpt":0.2874495964671314,"score_spread":0.22449091748796418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974190285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062709283,0.000091296875,0.9829036,0.005838108,0.00022630449,0.00096798345,0.0000066643124,0.00020835277,0.0034867425],"genre_scores_gemma":[0.9493665,0.0015167025,0.046100277,0.0002787794,0.000012648991,0.00197609,0.000008897925,0.000015990814,0.0007240833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880046,0.00013318376,0.0003927096,0.0002512526,0.000130196,0.0002921736],"domain_scores_gemma":[0.9967662,0.000496632,0.00009046873,0.0023245867,0.00023752174,0.000084577936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003063702,0.00016369528,0.00017457236,0.0003510502,0.0009411629,0.00020343212,0.0023422523,0.00007262627,0.00004160743],"category_scores_gemma":[0.000008614237,0.00017243516,0.00008693975,0.0009997679,0.000096739284,0.0010596365,0.000028662334,0.00037287417,0.00011768066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105855015,0.0012624307,0.00009325145,0.000060352562,0.00006667706,1.9350223e-7,0.0064167064,0.054299265,0.002191477,0.13827129,0.00058401603,0.79674375],"study_design_scores_gemma":[0.00045862267,0.00006123568,0.00035570163,0.00007929297,0.0000049207347,0.0000033446056,0.000105592626,0.98997855,0.0021896178,0.0010790158,0.0054535735,0.0002305531],"about_ca_topic_score_codex":0.000020361174,"about_ca_topic_score_gemma":0.00015752915,"teacher_disagreement_score":0.9430956,"about_ca_system_score_codex":0.00013761714,"about_ca_system_score_gemma":0.00007366478,"threshold_uncertainty_score":0.72387594},"labels":[],"label_agreement":null},{"id":"W1977865278","doi":"10.1109/tcomm.2014.2315612","title":"Understanding the Benefits of Successive Interference Cancellation in Multi-Rate Multi-Hop Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Single antenna interference cancellation; Scheduling (production processes); Wireless network; Computer network; Network performance; Greedy algorithm; Network topology; Transmission (telecommunications); Computational complexity theory; Wireless; Distributed computing; Mathematical optimization; Channel (broadcasting); Algorithm; Mathematics; Telecommunications","score_opus":0.17759528154483173,"score_gpt":0.32021710654508617,"score_spread":0.14262182500025444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977865278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017149393,0.00033354622,0.9946581,0.002303462,0.00022108995,0.00029301707,0.0000046684872,0.000076472716,0.00039466238],"genre_scores_gemma":[0.989326,0.0029772988,0.0072955037,0.00019013973,0.000008010673,0.000094751806,0.000003991781,0.000012726345,0.00009155255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981105,0.00084865344,0.0004526786,0.000250431,0.00012332498,0.00021443391],"domain_scores_gemma":[0.99565756,0.0015303602,0.0002171628,0.0023529348,0.00018702904,0.00005497556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069790555,0.00016506258,0.0002017856,0.00019927815,0.00070493546,0.00010095438,0.0025661788,0.00007874202,0.000009876194],"category_scores_gemma":[0.000026154072,0.0001437541,0.00007475946,0.0010321238,0.00022812023,0.00034145638,0.00005241738,0.00057196105,0.000007160024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018279936,0.00056472165,0.00025508666,0.000011061478,0.00004618991,1.5249259e-7,0.005933737,0.81060255,0.00090735155,0.07904996,0.00003094376,0.10257995],"study_design_scores_gemma":[0.000510125,0.00003644842,0.0015044159,0.0001685722,0.0000092699065,9.211689e-7,0.00020285111,0.9963865,0.00080281694,0.00013482453,0.00009167886,0.00015157311],"about_ca_topic_score_codex":0.00008790772,"about_ca_topic_score_gemma":0.0093429275,"teacher_disagreement_score":0.9876111,"about_ca_system_score_codex":0.00018253284,"about_ca_system_score_gemma":0.00005838722,"threshold_uncertainty_score":0.5862122},"labels":[],"label_agreement":null},{"id":"W1979802120","doi":"10.1109/tcomm.2012.122112.110805","title":"Error Rate Estimation of Low-Density Parity-Check Codes Decoded by Quantized Soft-Decision Iterative Algorithms","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University; Advanced Micro Devices (Canada)","funders":"","keywords":"Algorithm; Computer science; Low-density parity-check code; Turbo code; Decoding methods; Mathematics","score_opus":0.03332396291760937,"score_gpt":0.3172709810086092,"score_spread":0.2839470180909998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979802120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02199876,0.000056549656,0.9742757,0.0017321586,0.0002728842,0.0007113562,0.000045661578,0.00070885103,0.00019808965],"genre_scores_gemma":[0.6763334,0.000105061765,0.32306248,0.0001170161,0.0000035550233,0.00020361276,0.000016849184,0.000017786882,0.00014022691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976938,0.00057529344,0.00069064397,0.0004318959,0.00033055863,0.00027782435],"domain_scores_gemma":[0.99415684,0.0018193114,0.00034048595,0.0029932102,0.00056762673,0.00012250453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006739549,0.00026867155,0.00037659425,0.0002897945,0.0006910887,0.00021235464,0.0021324123,0.00017852007,0.000041646963],"category_scores_gemma":[0.000107544656,0.00024887684,0.00015762883,0.00079128455,0.00023573787,0.0011438589,0.00004116326,0.0006200857,0.00013442534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013791067,0.0054538506,0.00010576178,0.00012196052,0.00037047005,0.0000028340935,0.011030027,0.025656985,0.12047958,0.005046277,0.012264276,0.8193301],"study_design_scores_gemma":[0.00043531106,0.00014874488,0.0002743649,0.00014506221,0.000027645112,0.000008249859,0.000097469936,0.8552675,0.13714476,0.0060310764,0.00012349547,0.00029629585],"about_ca_topic_score_codex":0.00070502475,"about_ca_topic_score_gemma":0.00031156797,"teacher_disagreement_score":0.8296105,"about_ca_system_score_codex":0.00012625956,"about_ca_system_score_gemma":0.00010252851,"threshold_uncertainty_score":0.99999636},"labels":[],"label_agreement":null},{"id":"W1981907634","doi":"10.1109/tcomm.2013.020413.120070","title":"On the Capacity of Duplication Channels","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Gene duplication; Channel capacity; Channel (broadcasting); Probability density function; Upper and lower bounds; Mathematics; Series (stratigraphy); Representation (politics); Computer science; Algorithm; Topology (electrical circuits); Combinatorics; Statistics; Telecommunications","score_opus":0.04739777772552795,"score_gpt":0.2642986101064345,"score_spread":0.21690083238090657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981907634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8836029,0.00004853001,0.10708034,0.004575927,0.00011105425,0.00039210278,0.000020076914,0.00002456059,0.004144485],"genre_scores_gemma":[0.99844825,0.00010368851,0.00060600607,0.0004350993,0.000017749842,0.00012049788,0.000011741323,0.0000060649445,0.00025087903],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945617,0.00011571178,0.00014961211,0.00012285006,0.00006138563,0.000094284616],"domain_scores_gemma":[0.9986204,0.00014575035,0.000062091145,0.001048842,0.00009417835,0.000028763856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117552176,0.00007587608,0.00006608129,0.000024723624,0.00024752473,0.000014048642,0.0004950841,0.0000730522,0.00006429577],"category_scores_gemma":[0.000020260339,0.000050914285,0.00007815692,0.00010609455,0.00015820113,0.00000286751,0.0000064863125,0.00014368656,0.00006217017],"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.00002361265,0.0007312381,0.000036174388,0.0000072941607,0.00008434309,2.5287733e-8,0.00012197993,0.0026399852,0.9693171,0.0077724126,0.001804043,0.017461829],"study_design_scores_gemma":[0.00033500444,0.00073042326,0.0017113454,0.000041810217,0.000030858966,0.000004453918,0.00016640518,0.0065489667,0.9760614,0.0050420836,0.009039382,0.00028785088],"about_ca_topic_score_codex":0.000052196912,"about_ca_topic_score_gemma":0.000014910349,"teacher_disagreement_score":0.11484535,"about_ca_system_score_codex":0.0000074145037,"about_ca_system_score_gemma":0.000011587058,"threshold_uncertainty_score":0.20762244},"labels":[],"label_agreement":null},{"id":"W1983459476","doi":"10.1109/tcomm.2012.050912.110380","title":"Training and Decodings for Cooperative Network with Multiple Relays and Receive Antennas","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Decoding methods; Relay; Transmitter; Computer science; Channel (broadcasting); Bit error rate; Channel state information; Relay channel; Algorithm; Space–time code; Electronic engineering; Antenna (radio); List decoding; Maximal-ratio combining; Telecommunications; Fading; Wireless; Engineering; Block code; Concatenated error correction code","score_opus":0.08999971044700875,"score_gpt":0.30364295564536475,"score_spread":0.213643245198356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983459476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027787357,0.0018679753,0.99046546,0.0029854681,0.00012062789,0.0006493924,0.000012204297,0.00014383264,0.0009762802],"genre_scores_gemma":[0.85756177,0.004437933,0.13695446,0.00042799822,0.000026351729,0.00041581658,0.000004941956,0.000016372005,0.000154383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892145,0.00020504332,0.00022616738,0.00023824141,0.00008870257,0.00032037968],"domain_scores_gemma":[0.99696714,0.0014338107,0.000086391396,0.0011645219,0.00018272169,0.00016540835],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00044934973,0.00017505258,0.00019960864,0.00009172366,0.0016193534,0.00013940521,0.00066798227,0.000062272615,0.000005422794],"category_scores_gemma":[0.000025236342,0.00015834365,0.00003797841,0.00043150375,0.00023887382,0.0006891634,0.000028899387,0.00032817473,0.0000039955394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001528266,0.0008549551,0.0013641905,0.00003400144,0.00041233574,6.7577406e-7,0.052799303,0.0047190115,0.001943782,0.16449137,0.0010843036,0.77214324],"study_design_scores_gemma":[0.004312671,0.0011181032,0.0047599594,0.0005869012,0.00019812214,0.00018891438,0.0032358181,0.83825684,0.0023787068,0.0012700406,0.14211895,0.001575001],"about_ca_topic_score_codex":0.0000061642872,"about_ca_topic_score_gemma":0.00031974725,"teacher_disagreement_score":0.854783,"about_ca_system_score_codex":0.000039387163,"about_ca_system_score_gemma":0.00004775051,"threshold_uncertainty_score":0.9996804},"labels":[],"label_agreement":null},{"id":"W1984363480","doi":"10.1109/tcomm.2013.042313.120629","title":"Fourth-Order Statistics for Blind Classification of Spatial Multiplexing and Alamouti Space-Time Block Code Signals","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Blind Source Separation Techniques","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":"Defence Research and Development Canada; Memorial University of Newfoundland","funders":"","keywords":"Space–time block code; Block code; Algorithm; Fading; Spatial multiplexing; Nakagami distribution; Multiplexing; Computer science; Orthogonal frequency-division multiplexing; Antenna (radio); Electronic engineering; Channel (broadcasting); Telecommunications; MIMO; Decoding methods; Engineering","score_opus":0.056353214200314555,"score_gpt":0.31224299428634233,"score_spread":0.2558897800860278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984363480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025123402,0.000031601074,0.99112934,0.0045324396,0.000054391436,0.0010448613,0.00020026653,0.00020696581,0.00028779425],"genre_scores_gemma":[0.5783812,0.00007511611,0.4209163,0.00007274154,0.000005983357,0.00030807895,0.000017839335,0.000013351587,0.00020939595],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986992,0.00020670706,0.0004532264,0.00027086723,0.00019244116,0.00017759047],"domain_scores_gemma":[0.9964488,0.0011420443,0.0002422611,0.0014909283,0.00058841397,0.00008756147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033102653,0.00015839747,0.0002070126,0.0002407322,0.00039467536,0.00014498673,0.0008555331,0.00011463064,0.000032183518],"category_scores_gemma":[0.00004198285,0.00016972372,0.00006270955,0.00030373785,0.00018945268,0.0004333397,0.000015819733,0.00023609208,0.000031735046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001851829,0.0048073935,0.00019948762,0.00022881739,0.0006742062,6.908135e-7,0.019252729,0.066597916,0.4403114,0.11424007,0.0082325665,0.34526953],"study_design_scores_gemma":[0.0006629036,0.00016194744,0.00052624417,0.00003284119,0.00003065504,0.0000037267544,0.00007591177,0.9650154,0.02840279,0.0036851803,0.0011981722,0.00020423887],"about_ca_topic_score_codex":0.00023097944,"about_ca_topic_score_gemma":0.00029510615,"teacher_disagreement_score":0.8984175,"about_ca_system_score_codex":0.00003771987,"about_ca_system_score_gemma":0.00010257121,"threshold_uncertainty_score":0.6921132},"labels":[],"label_agreement":null},{"id":"W1985952244","doi":"10.1109/tcomm.2011.121611.110181","title":"Diversity Gain and Outage Probability for MIMO Free-Space Optical Links with Misalignment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":119,"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":"Fading; Diversity gain; MIMO; Fading distribution; Signal-to-noise ratio (imaging); Diversity combining; Channel (broadcasting); Maximal-ratio combining; Electronic engineering; Channel state information; Computer science; Transmitter; Telecommunications; Wireless; Engineering; Rayleigh fading","score_opus":0.059146595102558916,"score_gpt":0.2361440594475078,"score_spread":0.1769974643449489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985952244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03123246,0.0002513387,0.9588611,0.002570807,0.00006047587,0.0008717647,0.00010045208,0.0011106465,0.0049409606],"genre_scores_gemma":[0.82074904,0.00056151976,0.1782623,0.000024749292,0.0000023752139,0.00030930593,0.0000038832313,0.000023696068,0.00006314694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920654,0.000049275102,0.00021431099,0.00019244722,0.00012058719,0.00021686117],"domain_scores_gemma":[0.99658024,0.000446702,0.000031597352,0.0027599244,0.000083802384,0.000097729026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001699261,0.00017697811,0.00018390702,0.00009476559,0.0008462311,0.000021901684,0.0011685368,0.00020806023,0.00002334253],"category_scores_gemma":[0.000022720435,0.00017083519,0.000063012885,0.00018389929,0.00052805885,0.00014298462,0.00007807459,0.0006009018,0.000008769847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013754707,0.014488773,0.0042971913,0.001506698,0.0034289006,0.000009363492,0.047376733,0.057481162,0.0098709315,0.5829209,0.002721735,0.27452213],"study_design_scores_gemma":[0.011239559,0.0036789028,0.009780274,0.00075433264,0.0013503162,0.00006243016,0.010546103,0.415944,0.4149439,0.11110074,0.015648413,0.0049509928],"about_ca_topic_score_codex":0.000038841412,"about_ca_topic_score_gemma":0.00037985397,"teacher_disagreement_score":0.78951657,"about_ca_system_score_codex":0.00010484981,"about_ca_system_score_gemma":0.00001590196,"threshold_uncertainty_score":0.6966457},"labels":[],"label_agreement":null},{"id":"W1987532191","doi":"10.1109/tcomm.2015.2404777","title":"Energy Harvesting Wireless Communications With Energy Cooperation Between Transmitter and Receiver","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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 Victoria","funders":"","keywords":"Transmitter; Energy harvesting; Rayleigh fading; Energy (signal processing); Wireless; Electronic engineering; Transmitter power output; Computer science; Fading; Additive white Gaussian noise; Electrical engineering; Engineering; Telecommunications; Channel (broadcasting); Mathematics","score_opus":0.04103937744648119,"score_gpt":0.23714233213533525,"score_spread":0.19610295468885408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987532191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009643026,0.0007411199,0.9799573,0.001059349,0.00014699753,0.00012324976,0.000049706978,0.0007959133,0.0074833343],"genre_scores_gemma":[0.97999287,0.0020879537,0.016597012,0.00017350262,0.00005648185,0.0002611629,0.00010170901,0.00010537258,0.0006239508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848646,0.00027992105,0.00043225236,0.0002669964,0.00021897731,0.0003153965],"domain_scores_gemma":[0.9965057,0.0005909311,0.000059534017,0.0023617172,0.00021561651,0.00026654534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021345301,0.00031282034,0.00029553496,0.00021068576,0.0006170835,0.00013867095,0.0009773675,0.00018882386,0.0000087021745],"category_scores_gemma":[0.0000041373,0.00032346728,0.000053197622,0.0005922648,0.00044785038,0.00046985585,0.000013261176,0.00055944023,0.000009062188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047271158,0.00041157586,0.0005848784,0.000049945527,0.000594395,0.0000041029243,0.002211235,0.5558566,0.0015116675,0.011756217,0.0012051538,0.42576697],"study_design_scores_gemma":[0.0015107194,0.00022024607,0.0003002803,0.00038095808,0.00027255944,0.000053421092,0.00026588378,0.9325576,0.006599958,0.00034590438,0.056479562,0.0010129152],"about_ca_topic_score_codex":0.0006762654,"about_ca_topic_score_gemma":0.0047464427,"teacher_disagreement_score":0.97034985,"about_ca_system_score_codex":0.00014117575,"about_ca_system_score_gemma":0.000074002746,"threshold_uncertainty_score":0.99992174},"labels":[],"label_agreement":null},{"id":"W1988384836","doi":"10.1109/tcomm.2015.2396916","title":"Queue-Aware Transmission Scheduling for Cooperative Wireless Communications","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Dynamic priority scheduling; Mathematical optimization; Fair-share scheduling; Round-robin scheduling; Scheduling (production processes); Rate-monotonic scheduling; Queue; Computer network; Mathematics; Quality of service","score_opus":0.13224458012143012,"score_gpt":0.3476252542649352,"score_spread":0.21538067414350506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988384836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016034329,0.0011308027,0.974417,0.019797921,0.00028018298,0.00091944076,0.00004102151,0.0005240696,0.0027292534],"genre_scores_gemma":[0.82749534,0.003880562,0.16624483,0.0007730963,0.000023735816,0.0008548306,0.000050329425,0.00003727988,0.00063998264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753636,0.00072372484,0.0006064185,0.00045427572,0.00030337364,0.00037585557],"domain_scores_gemma":[0.99060357,0.001106095,0.00016912617,0.0067081633,0.0010638856,0.0003491434],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007986386,0.00031335646,0.0003342785,0.00028444143,0.0021134845,0.0002916004,0.0061979354,0.00015376859,0.000017108498],"category_scores_gemma":[0.00003117578,0.00032225423,0.00020619883,0.0011517962,0.0003473673,0.00082108227,0.000088286324,0.00073381286,0.00008790977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001081919,0.0027335575,0.000012870347,0.00003736001,0.0002837596,0.0000011669996,0.010827418,0.027899476,0.004162681,0.27692243,0.0032198962,0.67379117],"study_design_scores_gemma":[0.0013461321,0.00022258317,0.000008708222,0.00014516903,0.00004319875,0.000011523195,0.0005549458,0.9183315,0.0056651607,0.0017509058,0.071438424,0.00048174727],"about_ca_topic_score_codex":0.000023657733,"about_ca_topic_score_gemma":0.00026638698,"teacher_disagreement_score":0.890432,"about_ca_system_score_codex":0.00024684364,"about_ca_system_score_gemma":0.00047586087,"threshold_uncertainty_score":0.99992293},"labels":[],"label_agreement":null},{"id":"W1989889906","doi":"10.1109/tcomm.2014.2360852","title":"Source-Channel Coding for Fading Channels With Correlated Interference","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":2,"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; Computer science; Channel state information; Transmitter; Channel (broadcasting); Upper and lower bounds; Algorithm; Decoding methods; Topology (electrical circuits); Electronic engineering; Telecommunications; Mathematics; Wireless; Engineering","score_opus":0.03337097799345879,"score_gpt":0.25657922920778325,"score_spread":0.22320825121432447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989889906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002665092,0.00007615529,0.9918873,0.000519745,0.00018537662,0.0004933886,0.000028581917,0.0016061116,0.0025382906],"genre_scores_gemma":[0.98422885,0.00045022796,0.014198193,0.00007879008,0.000016637145,0.0007513952,0.000025519768,0.000079865116,0.00017053245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990273,0.00009984286,0.00032113207,0.00018082822,0.000113503585,0.0002573995],"domain_scores_gemma":[0.9969636,0.00075862755,0.00006672168,0.0019700972,0.00015120926,0.000089724475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024303334,0.00022046932,0.00022827466,0.00025798831,0.0005490173,0.000079451915,0.0011168574,0.00012918684,0.000017618837],"category_scores_gemma":[0.000012643304,0.00023273731,0.00008890756,0.0003511597,0.00014886819,0.0002098123,0.000008420062,0.00055207027,0.000030825016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108451735,0.0006037765,0.000019218067,0.00019662737,0.00042764435,2.181402e-7,0.0090942085,0.88797826,0.009026483,0.011021099,0.0011974628,0.080326565],"study_design_scores_gemma":[0.0004732115,0.00015395871,0.000007655724,0.00027357868,0.00005363894,0.000009815154,0.0002310176,0.95952296,0.029549468,0.0006516894,0.008710583,0.0003624365],"about_ca_topic_score_codex":0.000024654193,"about_ca_topic_score_gemma":0.00010656061,"teacher_disagreement_score":0.98156375,"about_ca_system_score_codex":0.00010889585,"about_ca_system_score_gemma":0.000016041779,"threshold_uncertainty_score":0.9490752},"labels":[],"label_agreement":null},{"id":"W1991079262","doi":"10.1109/tcomm.2003.815083","title":"Iterative threshold decoding without interleaving for convolutional self-doubly orthogonal codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Convolutional code; Serial concatenated convolutional codes; Decoding methods; Turbo code; Sequential decoding; Interleaving; Computer science; Algorithm; Encoder; Concatenated error correction code; List decoding; Error detection and correction; Block code","score_opus":0.05423382058004998,"score_gpt":0.323706578886975,"score_spread":0.269472758306925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991079262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002582465,0.00012034359,0.991123,0.0010517724,0.00044103377,0.0005518106,0.00003103659,0.001080757,0.0030177312],"genre_scores_gemma":[0.619749,0.000054861823,0.37947696,0.00015213771,0.000009240658,0.00037214215,0.00000360624,0.000017410855,0.00016460317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984387,0.00021994201,0.0004002882,0.00040346285,0.00022386317,0.0003137094],"domain_scores_gemma":[0.9966671,0.0009652773,0.00014926172,0.0017721127,0.0003460108,0.00010023039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005788753,0.00022620407,0.00021945285,0.00027226578,0.0011847237,0.00019595245,0.001628867,0.00009965697,0.000017876451],"category_scores_gemma":[0.000034538738,0.00024459788,0.00018340752,0.00046924897,0.0001304966,0.0006248386,0.000016145508,0.00049522787,0.000022967488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005643424,0.001949779,0.001323161,0.00006290019,0.0004018719,0.0000021705175,0.0080908695,0.0033557066,0.0060932357,0.96410674,0.0016047091,0.012952423],"study_design_scores_gemma":[0.0020103368,0.00069301046,0.00027252993,0.00052407867,0.00017113758,0.00022527014,0.00039430664,0.853051,0.0692034,0.04553733,0.026390433,0.0015271408],"about_ca_topic_score_codex":0.00001575894,"about_ca_topic_score_gemma":0.00038484708,"teacher_disagreement_score":0.9185694,"about_ca_system_score_codex":0.00021999022,"about_ca_system_score_gemma":0.00021162008,"threshold_uncertainty_score":0.99744123},"labels":[],"label_agreement":null},{"id":"W1995345730","doi":"10.1109/tcomm.2014.2367014","title":"Flexible Symmetric Multiple Description Lattice Vector Quantizer With <inline-formula> <tex-math notation=\"TeX\">$L\\geq 3$</tex-math></inline-formula> Descriptions","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"","keywords":"Mathematics; Decoding methods; Lattice (music); Algorithm; Erasure; Notation; Discrete mathematics; Arithmetic; Computer science","score_opus":0.04422991991100132,"score_gpt":0.28563133392587653,"score_spread":0.2414014140148752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995345730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012786462,0.0007566419,0.97593427,0.0024432123,0.0009229304,0.0019098311,0.00053641887,0.003147376,0.0015628574],"genre_scores_gemma":[0.62018114,0.0012419792,0.37547362,0.00044888424,0.000092385926,0.0009478124,0.0003123651,0.00014379823,0.0011579749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99278307,0.00085115916,0.0019056298,0.0016235291,0.0015329522,0.0013036663],"domain_scores_gemma":[0.98581916,0.0022510334,0.000965277,0.008780629,0.0015363496,0.0006475523],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013104235,0.001145944,0.0010566876,0.0019421191,0.0032410142,0.00083929434,0.0057508894,0.0005464908,0.00006131669],"category_scores_gemma":[0.0003539474,0.0010933437,0.0005173173,0.0048109,0.0006159079,0.004730111,0.00023719687,0.0016003362,0.000674467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039148857,0.008057734,0.00016095932,0.00036268894,0.00072458596,0.00001786728,0.0033457286,0.042412966,0.13607141,0.67240226,0.0046476177,0.13140465],"study_design_scores_gemma":[0.0028376335,0.0008479338,0.0016419583,0.00069409795,0.00038032324,0.00014271603,0.00009949595,0.8348776,0.022307087,0.0044453773,0.12984598,0.0018797914],"about_ca_topic_score_codex":0.00018401252,"about_ca_topic_score_gemma":0.0016233145,"teacher_disagreement_score":0.7924646,"about_ca_system_score_codex":0.00071931165,"about_ca_system_score_gemma":0.00046059414,"threshold_uncertainty_score":0.9996285},"labels":[],"label_agreement":null},{"id":"W1997394709","doi":"10.1109/tcomm.2012.081512.110408","title":"Using the Wireless and PLC Channels for Diversity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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 Calgary","funders":"","keywords":"Subcarrier; Wireless; Diversity combining; Computer science; Signal-to-noise ratio (imaging); Maximal-ratio combining; Electronic engineering; Narrowband; Orthogonal frequency-division multiplexing; Throughput; Diversity scheme; Bit error rate; Computer network; Fading; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.10528708014022488,"score_gpt":0.3005666736421725,"score_spread":0.19527959350194762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997394709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061354678,0.0016244485,0.9335828,0.00090620015,0.00050878,0.00044357943,0.00009939346,0.00021987811,0.0012602556],"genre_scores_gemma":[0.99302685,0.0012343216,0.0054512434,0.000058223253,0.000028214283,0.00009775334,0.0000049650084,0.000019609519,0.00007878823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995234,0.000052271716,0.00012761122,0.000059778507,0.000058038582,0.0001789231],"domain_scores_gemma":[0.99830073,0.00033840284,0.000021442575,0.0012291316,0.000041622574,0.00006865983],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00018903236,0.000098628756,0.00008970343,0.00006770579,0.0013972647,0.000027215598,0.0005701182,0.00004930912,0.000011606738],"category_scores_gemma":[0.000002559608,0.00008733571,0.000059709084,0.00016174914,0.000121423145,0.00019524334,0.00002033581,0.00021726696,0.0000059472172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002608679,0.006836866,0.002993456,0.00064741843,0.0033508758,6.9719493e-7,0.089863785,0.40954646,0.058471747,0.06931732,0.014034063,0.34467643],"study_design_scores_gemma":[0.00094826706,0.0000520172,0.00075264426,0.00008008614,0.00035994817,0.000022920385,0.001580474,0.913356,0.0108049335,0.0007925947,0.07061866,0.00063143007],"about_ca_topic_score_codex":0.000043392523,"about_ca_topic_score_gemma":0.000056431658,"teacher_disagreement_score":0.9316722,"about_ca_system_score_codex":0.000046485475,"about_ca_system_score_gemma":0.000008223564,"threshold_uncertainty_score":0.9999028},"labels":[],"label_agreement":null},{"id":"W1998050154","doi":"10.1109/tcomm.2013.102313.110741","title":"Coding Opportunity Densification Strategies for Instantly Decodable Network Coding","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Goodput; Linear network coding; Network packet; Erasure; Coding (social sciences); Computer science; Monotonic function; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics; Computer network; Telecommunications; Wireless; Throughput","score_opus":0.11632450337673955,"score_gpt":0.317877816346718,"score_spread":0.20155331296997847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998050154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005155793,0.00027515332,0.98342806,0.006372391,0.00036244566,0.00094598753,0.000012022226,0.00044945802,0.0076389066],"genre_scores_gemma":[0.89787495,0.0030244226,0.096629724,0.0008420689,0.000037187594,0.0009917585,0.000022059918,0.000025274927,0.0005525312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810386,0.00035450468,0.00054567336,0.00037242568,0.00019780814,0.0004257274],"domain_scores_gemma":[0.9945217,0.0011324916,0.00020782046,0.0033252276,0.00059799297,0.00021481913],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005870255,0.00024203994,0.00024928892,0.00019072398,0.0024354565,0.0006811095,0.0026907371,0.00011089036,0.00011133705],"category_scores_gemma":[0.000034018005,0.0002590115,0.00014883504,0.0008874408,0.00016280283,0.0015561756,0.000042488253,0.00046634607,0.00011771394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014409908,0.0005371994,0.000019776493,0.000029290093,0.00012836045,3.8547805e-7,0.001673662,0.01760429,0.0054379464,0.739955,0.009886073,0.22471362],"study_design_scores_gemma":[0.0007962028,0.00015962435,0.00035265688,0.00016961701,0.000048333364,0.000013538017,0.0008215153,0.93136334,0.0020164817,0.021297853,0.042275533,0.0006853033],"about_ca_topic_score_codex":0.000044841243,"about_ca_topic_score_gemma":0.00037993255,"teacher_disagreement_score":0.91375905,"about_ca_system_score_codex":0.00015450513,"about_ca_system_score_gemma":0.00031485484,"threshold_uncertainty_score":0.99998623},"labels":[],"label_agreement":null},{"id":"W1998710728","doi":"10.1109/tcomm.2014.2338856","title":"Performance Analysis of Relay-Based Cooperative Spectrum Sensing in Cognitive Radio Networks Over Non-Identical Nakagami-<named-content content-type=\"math\" xlink:type=\"simple\"> <inline-formula> <tex-math notation=\"TeX\">$m$</tex-math></inline-formula></named-content> Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Nakagami distribution; Cognitive radio; Fading; Relay; False alarm; Computer science; Channel (broadcasting); Algorithm; Bandwidth (computing); Spectral efficiency; Topology (electrical circuits); Mathematics; Electronic engineering; Wireless; Telecommunications; Engineering; Artificial intelligence","score_opus":0.040413240420220986,"score_gpt":0.2738888044175049,"score_spread":0.23347556399728392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998710728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44329745,0.0007559766,0.55029446,0.0016212162,0.0012077915,0.001727309,0.00021580019,0.00036133963,0.0005186884],"genre_scores_gemma":[0.9827197,0.0026262242,0.011519963,0.0010502296,0.0003533767,0.00015846829,0.0007723169,0.00021756742,0.00058215426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98871994,0.0014332976,0.003706102,0.002147704,0.0018128923,0.0021800809],"domain_scores_gemma":[0.98604167,0.004063166,0.0016500683,0.0043158955,0.0031035403,0.0008256379],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002637927,0.0017053325,0.0027836848,0.0023643388,0.0025125435,0.0008342224,0.0027116893,0.0008677915,0.00007984361],"category_scores_gemma":[0.00048864784,0.001723903,0.0014174107,0.0067594424,0.001276075,0.0021239335,0.00021299602,0.002559748,0.00013953967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00246034,0.0077670664,0.0018237026,0.00033699523,0.008602587,0.0002362933,0.01314262,0.79654765,0.039968353,0.043352094,0.00050654745,0.08525576],"study_design_scores_gemma":[0.004634601,0.0009224407,0.010702659,0.0011496996,0.0018123882,0.000114878516,0.0003195173,0.9744762,0.002881199,0.00014671776,0.0011363127,0.0017033702],"about_ca_topic_score_codex":0.00036812425,"about_ca_topic_score_gemma":0.009348727,"teacher_disagreement_score":0.5394223,"about_ca_system_score_codex":0.0011746685,"about_ca_system_score_gemma":0.0007723933,"threshold_uncertainty_score":0.9997414},"labels":[],"label_agreement":null},{"id":"W1998929580","doi":"10.1109/tcomm.2009.11.070095","title":"On the design of raptor codes for binary-input gaussian channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Ottawa","funders":"","keywords":"Raptor code; Computer science; EXIT chart; Additive white Gaussian noise; Binary number; Channel (broadcasting); Forward error correction; Decoding methods; Turbo code; Code (set theory); Algorithm; Binary code; Telecommunications; Concatenated error correction code; Block code; Mathematics; Arithmetic","score_opus":0.07119583108889162,"score_gpt":0.3137383782324997,"score_spread":0.24254254714360812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998929580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032670968,0.000048333168,0.9818938,0.015493102,0.00021835827,0.00080913247,0.00001500501,0.00042650718,0.00076905335],"genre_scores_gemma":[0.850339,0.00010377523,0.14853826,0.00053869374,0.000009178802,0.00027536746,0.000001351868,0.000011641724,0.00018272547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998797,0.00030126306,0.0002906918,0.00023092465,0.0001786008,0.00020149136],"domain_scores_gemma":[0.9944778,0.0021979057,0.00013998168,0.002986867,0.0001475928,0.000049832004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943779,0.00015610195,0.00017261239,0.00021674814,0.00068533455,0.000064561835,0.0027270191,0.000075667616,0.00000875469],"category_scores_gemma":[0.000039303337,0.00012470459,0.00014221239,0.00054853933,0.00012015305,0.00018475066,0.0000074424343,0.0003093606,0.000013372355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002468825,0.00505327,0.0000025176046,0.00003703921,0.00022924821,0.0000016178577,0.008778759,0.084226325,0.058246184,0.6443351,0.015847174,0.18299592],"study_design_scores_gemma":[0.0005805841,0.0026845303,0.000055358312,0.0002854382,0.000062793035,0.000013073855,0.00016917443,0.64539856,0.27862763,0.0692944,0.0023123918,0.0005160683],"about_ca_topic_score_codex":0.000018947301,"about_ca_topic_score_gemma":0.000013549458,"teacher_disagreement_score":0.8500123,"about_ca_system_score_codex":0.00005852634,"about_ca_system_score_gemma":0.000074757,"threshold_uncertainty_score":0.5271109},"labels":[],"label_agreement":null},{"id":"W1999062841","doi":"10.1109/tcomm.2013.070213.120570","title":"Energy-Efficient Cooperative Routing in Wireless Sensor Networks: A Mixed-Integer Optimization Framework and Explicit Solution","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Mathematical optimization; Wireless sensor network; Relay; Node (physics); Optimization problem; Integer programming; Transmission (telecommunications); Broadcasting (networking); Distributed computing; Computer network; Power (physics); Engineering; Algorithm; Mathematics; Telecommunications","score_opus":0.029147007911218943,"score_gpt":0.262162192802152,"score_spread":0.2330151848909331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999062841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016703398,0.00033931463,0.99226266,0.004178513,0.00021897965,0.0004188082,0.0000031569978,0.0002204934,0.00068773935],"genre_scores_gemma":[0.93810374,0.0035270413,0.05723009,0.0004931657,0.000019013463,0.0004715678,0.000008811342,0.000021486474,0.00012510561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788487,0.0006804956,0.0004967505,0.00041520962,0.00018177273,0.00034090126],"domain_scores_gemma":[0.99657494,0.0008759989,0.00013720764,0.0019687014,0.0003155059,0.0001276206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003342996,0.00024608948,0.00024651046,0.00028766994,0.0010306636,0.0003280417,0.0012115181,0.00015198189,0.00004718651],"category_scores_gemma":[0.000021461534,0.000254919,0.000068248555,0.001260966,0.00014693898,0.0005252743,0.00006872441,0.00066414534,0.000024114608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006020511,0.00041043552,0.000023136014,0.0000029616185,0.000028253378,4.6919902e-7,0.0015520564,0.8716273,0.000286368,0.07003667,0.00009075559,0.055935614],"study_design_scores_gemma":[0.0002818943,0.000043614633,0.00011891997,0.00015994113,0.000008725538,0.000006854572,0.0002577339,0.9982163,0.000368534,0.00014406024,0.00013052576,0.00026289703],"about_ca_topic_score_codex":0.00013632643,"about_ca_topic_score_gemma":0.000353983,"teacher_disagreement_score":0.9364334,"about_ca_system_score_codex":0.0001750211,"about_ca_system_score_gemma":0.00005958177,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W1999499117","doi":"10.1109/tcomm.2013.032713.120654","title":"On the Ergodic Capacity of Amplify-and-Forward Relay Channels with Interference in Nakagami-m Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Nakagami distribution; Fading; Ergodic theory; Relay; Interference (communication); Computer science; Signal-to-noise ratio (imaging); Topology (electrical circuits); Channel capacity; Electronic engineering; Channel (broadcasting); Co-channel interference; Independent and identically distributed random variables; Single antenna interference cancellation; Telecommunications; Mathematics; Power (physics); Engineering; Physics; Electrical engineering; Random variable; Statistics","score_opus":0.06422410717492637,"score_gpt":0.2668053767185139,"score_spread":0.20258126954358752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999499117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0591225,0.00012000604,0.92885023,0.00907995,0.000087935616,0.00048753363,0.0000046220316,0.00007931477,0.00216793],"genre_scores_gemma":[0.99289155,0.0010748479,0.005231355,0.0003819679,0.0000032414653,0.00028496017,0.0000010593862,0.000009369325,0.00012167163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875784,0.00041499847,0.00029855358,0.00021329946,0.00013970576,0.00017557564],"domain_scores_gemma":[0.9960264,0.0013200422,0.00010586085,0.002345057,0.00014073467,0.000061919985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034110682,0.00014626939,0.00017182578,0.00020261768,0.00049109745,0.00010795731,0.0019049965,0.00005532604,0.000050334733],"category_scores_gemma":[0.000021692009,0.00010547136,0.000043019423,0.0007045703,0.0002943604,0.0003358792,0.000038541297,0.0006608742,0.000039583305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007016252,0.0020607165,0.00031989778,0.000041708532,0.00024621864,0.0000011917083,0.03054808,0.038422707,0.008600398,0.7262627,0.00084204733,0.1925842],"study_design_scores_gemma":[0.001905193,0.0010845279,0.0047135097,0.0015170337,0.00005145589,0.000040408817,0.0013964864,0.95211834,0.022428613,0.011829259,0.0018245623,0.0010905929],"about_ca_topic_score_codex":0.0001191085,"about_ca_topic_score_gemma":0.00055432564,"teacher_disagreement_score":0.93376905,"about_ca_system_score_codex":0.00006239254,"about_ca_system_score_gemma":0.000042591455,"threshold_uncertainty_score":0.43009973},"labels":[],"label_agreement":null},{"id":"W2000852639","doi":"10.1109/tcomm.2013.032013.120322","title":"Resource Allocation for Selective Relaying Based Cellular Wireless System with Imperfect CSI","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Telecommunications link; Karush–Kuhn–Tucker conditions; Probabilistic logic; Resource allocation; Quality of service; Mathematical optimization; Power control; Transmitter power output; Optimization problem; Fading; Channel state information; Channel (broadcasting); Computer network; Wireless; Power (physics); Mathematics; Algorithm; Telecommunications; Transmitter","score_opus":0.030046302312631026,"score_gpt":0.2506374002990045,"score_spread":0.22059109798637347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000852639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015446615,0.00015789381,0.9885526,0.0046997895,0.00008631823,0.0012771065,0.000007733092,0.00051668216,0.0031572455],"genre_scores_gemma":[0.94732237,0.000095237316,0.04995067,0.0003265635,0.00001621304,0.0019414976,0.000019700668,0.000033136144,0.0002946189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823195,0.00048954255,0.00036043156,0.0004002974,0.00021871082,0.00029907233],"domain_scores_gemma":[0.99479777,0.0010271177,0.00016329685,0.003307078,0.0005814474,0.00012332236],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004099834,0.00023120115,0.00022288668,0.00024059784,0.0017244786,0.00026484646,0.002130942,0.000094810755,0.000010238372],"category_scores_gemma":[0.000009339313,0.00021687109,0.000118841046,0.0009805257,0.00012524851,0.000549968,0.00001891085,0.0004404278,0.00006541212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022321253,0.002962903,0.00010559059,0.00031675908,0.0007842281,0.000002473922,0.008930406,0.13114613,0.0846969,0.26245174,0.0071639996,0.50121564],"study_design_scores_gemma":[0.0008123901,0.00023916863,0.000071798626,0.00019372294,0.00003928372,0.0000071812274,0.00032230705,0.9669553,0.026863962,0.00005518191,0.0040901364,0.0003495876],"about_ca_topic_score_codex":0.000056512323,"about_ca_topic_score_gemma":0.00015229764,"teacher_disagreement_score":0.9457777,"about_ca_system_score_codex":0.0002896287,"about_ca_system_score_gemma":0.00017121101,"threshold_uncertainty_score":0.99957514},"labels":[],"label_agreement":null},{"id":"W2001178040","doi":"10.1109/tcomm.2013.020413.120457","title":"Delay-Optimal Distributed Scheduling in Multi-User Multi-Relay Cellular Wireless Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of Manitoba","funders":"","keywords":"Computer science; Relay; Scheduling (production processes); Computer network; Time division multiple access; RSS; Base station; Telecommunications link; Wireless; Transmission (telecommunications); Markov process; Wireless network; Real-time computing; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.054840833267975446,"score_gpt":0.2892029471408835,"score_spread":0.23436211387290806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001178040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010742304,0.00076134386,0.98468053,0.0024516408,0.0002624588,0.0006319358,0.000011510719,0.0003401176,0.00011815328],"genre_scores_gemma":[0.8254053,0.0020927254,0.17135605,0.00026427695,0.000010663444,0.00046091832,0.0000287727,0.000026673131,0.00035463343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766016,0.00059840904,0.00062930305,0.00044468787,0.0001974953,0.00046996036],"domain_scores_gemma":[0.99514633,0.000507186,0.00014578948,0.003707722,0.0003041568,0.00018881363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038198434,0.00029741222,0.0002896255,0.00028595488,0.0010009566,0.00030161763,0.0034713112,0.00018096885,0.00008348675],"category_scores_gemma":[0.000014412118,0.00031721103,0.00015338603,0.0013997642,0.00020028616,0.0008442242,0.000088049164,0.0011886361,0.00023947787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007083882,0.0017025517,0.00021292739,0.000006217386,0.00007160063,0.0000029342189,0.0011549811,0.947853,0.0023403284,0.004812858,0.0001515485,0.041683957],"study_design_scores_gemma":[0.00091065076,0.00003136496,0.00088287913,0.000083701736,0.000012331621,0.000004819645,0.00011520448,0.99519044,0.000914644,0.000013253607,0.0014992972,0.00034140775],"about_ca_topic_score_codex":0.00014132127,"about_ca_topic_score_gemma":0.0009773945,"teacher_disagreement_score":0.814663,"about_ca_system_score_codex":0.0001973106,"about_ca_system_score_gemma":0.00008754737,"threshold_uncertainty_score":0.999928},"labels":[],"label_agreement":null},{"id":"W2003480200","doi":"10.1109/tcomm.2014.2359875","title":"Limiting Properties of Overloaded Multiuser Wireless Systems With Throughput-Optimal Scheduling","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Maximum throughput scheduling; Scheduling (production processes); Computer science; Queue; Round-robin scheduling; Wireless; Throughput; Mathematical optimization; Proportionally fair; Distributed computing; Buffer overflow; Job shop scheduling; Fair-share scheduling; Dynamic priority scheduling; Computer network; Mathematics; Quality of service","score_opus":0.025701760114796916,"score_gpt":0.2210854360386223,"score_spread":0.19538367592382538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003480200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10752545,0.00032110943,0.89049655,0.000047780282,0.00016120076,0.00030595265,0.000009928119,0.00042882768,0.0007032008],"genre_scores_gemma":[0.9520606,0.000522451,0.047078643,0.000011159602,0.00002728369,0.00017372964,0.000007132531,0.00007256982,0.00004644016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989714,0.00009716985,0.00037350255,0.00016166318,0.00017606418,0.00022020597],"domain_scores_gemma":[0.99838114,0.0001838713,0.00009840377,0.0011363192,0.00014459636,0.00005567925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011473232,0.00019809847,0.00025299535,0.00012309565,0.0002993351,0.00003723458,0.00041848922,0.00009489993,0.0000042938555],"category_scores_gemma":[0.0000051963325,0.00018764067,0.000056305213,0.00037033332,0.00015837727,0.0003065858,0.000003980332,0.00036723434,0.00001183307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001786886,0.00008203721,0.000012462424,0.00008317362,0.00006724526,8.85808e-8,0.00059667265,0.9871282,0.008722849,0.00030328755,0.000004177887,0.0029819089],"study_design_scores_gemma":[0.0004013718,0.00005231775,0.000017018425,0.0005087843,0.000042970496,0.000004775935,0.0003415513,0.9687041,0.029547662,0.0000040809946,0.00016314858,0.00021223583],"about_ca_topic_score_codex":0.000034312812,"about_ca_topic_score_gemma":0.000062914114,"teacher_disagreement_score":0.8445351,"about_ca_system_score_codex":0.00007818538,"about_ca_system_score_gemma":0.00002112087,"threshold_uncertainty_score":0.7651765},"labels":[],"label_agreement":null},{"id":"W2007380483","doi":"10.1109/tcomm.2012.072612.110143","title":"On Raptor Code Design for Inactivation Decoding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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; Raptor code; Degree (music); Computer science; Fountain code; Set (abstract data type); Code (set theory); Block (permutation group theory); Block code; Degree distribution; Algorithm; Theoretical computer science; Mathematics; Linear code; Combinatorics; Physics","score_opus":0.12737220143933028,"score_gpt":0.3467728440012235,"score_spread":0.2194006425618932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007380483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006686278,0.000042674128,0.9942344,0.0017725681,0.00056578097,0.0006471445,0.000011599573,0.0008693231,0.001187905],"genre_scores_gemma":[0.6363006,0.000041569718,0.36276838,0.00023746582,0.000017234366,0.00048479257,0.0000021559827,0.000017447954,0.00013034567],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998813,0.0002334905,0.00025756093,0.00022384759,0.00017027353,0.00030187768],"domain_scores_gemma":[0.9951391,0.0023276755,0.00012146481,0.0021822234,0.00013163223,0.000097898825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065265346,0.00015981772,0.00013748086,0.0002862434,0.0008248358,0.00007899318,0.001502405,0.00009367805,0.000009119504],"category_scores_gemma":[0.000062803694,0.00017128549,0.00010835648,0.00046321962,0.000053197444,0.0007095237,0.000009578961,0.00033475473,0.000051276085],"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.00024065831,0.0058946307,0.0000619098,0.000060049726,0.00026678533,4.9406714e-7,0.010366453,0.020663148,0.05392053,0.39530984,0.01585713,0.49735838],"study_design_scores_gemma":[0.0008943665,0.0007435002,0.00015300594,0.00019107634,0.00007051233,0.000020569732,0.00017654277,0.40844053,0.5601101,0.01593743,0.012421851,0.00084051135],"about_ca_topic_score_codex":0.000016979617,"about_ca_topic_score_gemma":0.000024752042,"teacher_disagreement_score":0.635632,"about_ca_system_score_codex":0.00023154182,"about_ca_system_score_gemma":0.00005807942,"threshold_uncertainty_score":0.698482},"labels":[],"label_agreement":null},{"id":"W2008359784","doi":"10.1109/tcomm.2014.2378257","title":"On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memory","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Algorithm; Block code; Queue; Hamming distance; Binary number; Mathematics; Fading; Sequential decoding; Hamming code; Computer science; Theoretical computer science; Computer network; Arithmetic","score_opus":0.049836312430617154,"score_gpt":0.2807018596210243,"score_spread":0.23086554719040714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008359784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122665055,0.00023909316,0.95829207,0.027982283,0.00008647778,0.0005565345,0.000016340686,0.00010029726,0.0004603942],"genre_scores_gemma":[0.9770377,0.00071104517,0.020984191,0.00085718627,0.00001754434,0.00032059167,0.0000041641315,0.000016708349,0.00005082416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987559,0.0003258609,0.00023166435,0.0003211242,0.00014334689,0.00022213944],"domain_scores_gemma":[0.99344397,0.0030266666,0.00013270267,0.0031590909,0.00013622557,0.00010136798],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005765845,0.00018463892,0.00018345362,0.000101754784,0.002315914,0.00028681263,0.0019802565,0.000054613225,0.0000042148754],"category_scores_gemma":[0.000043732365,0.00014256133,0.000047889083,0.00024242348,0.00034918988,0.00027963976,0.00005397904,0.0003232744,0.0000036623626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025029315,0.0008566455,0.00041956824,0.00011524891,0.00021752882,9.2443327e-7,0.0039581414,0.0040426403,0.0024213584,0.23219714,0.0008093049,0.7547112],"study_design_scores_gemma":[0.0020569204,0.00095830456,0.0011303731,0.00057240215,0.00008059667,0.0000052981636,0.00019973902,0.97452694,0.004474528,0.012227647,0.0031840699,0.00058319466],"about_ca_topic_score_codex":0.000010284183,"about_ca_topic_score_gemma":0.00017998526,"teacher_disagreement_score":0.97048426,"about_ca_system_score_codex":0.000043022428,"about_ca_system_score_gemma":0.00004675216,"threshold_uncertainty_score":0.9989829},"labels":[],"label_agreement":null},{"id":"W2010692329","doi":"10.1109/tcomm.2013.021413.110555","title":"Inter-Session Network Coding with Strategic Users: A Game-Theoretic Analysis of the Butterfly Network","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Price of anarchy; Nash equilibrium; Computer science; Game theory; Bottleneck; Network packet; Computer network; Pairwise comparison; Non-cooperative game; Mathematical optimization; Packet forwarding; Price of stability; Mathematical economics; Mathematics","score_opus":0.04708077613640651,"score_gpt":0.2783337920222419,"score_spread":0.23125301588583538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010692329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010796829,0.00027050287,0.98138404,0.0039566103,0.00019423374,0.00049191574,0.0000050966014,0.00014324345,0.0027575097],"genre_scores_gemma":[0.9838845,0.0011129074,0.014056842,0.0005022609,0.0000192853,0.00019989851,0.000005265179,0.000016785165,0.00020222152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783146,0.00080068153,0.00048824138,0.00029977702,0.00025308251,0.0003267526],"domain_scores_gemma":[0.99383783,0.00076062564,0.00028310786,0.0046994314,0.00032322467,0.00009577271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039126584,0.0002189344,0.0003285218,0.00020275499,0.0009814259,0.00022235718,0.0036728408,0.00007637024,0.00015543029],"category_scores_gemma":[0.000005825097,0.00015559491,0.00024107509,0.0041430146,0.0003697286,0.00040919683,0.000083370986,0.0005891492,0.000027343045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035408666,0.00081170886,0.0017656574,0.000021834876,0.0018640482,6.235164e-7,0.00330054,0.72668874,0.0009403787,0.2213442,0.0010691715,0.04215768],"study_design_scores_gemma":[0.00042770588,0.00014510244,0.0048136674,0.00038604587,0.0005209903,0.000005828847,0.00026431165,0.9876571,0.00045093725,0.0041658934,0.0007898802,0.00037248817],"about_ca_topic_score_codex":0.00005715194,"about_ca_topic_score_gemma":0.0008788268,"teacher_disagreement_score":0.9730877,"about_ca_system_score_codex":0.00008088203,"about_ca_system_score_gemma":0.000096413794,"threshold_uncertainty_score":0.7548433},"labels":[],"label_agreement":null},{"id":"W2011095555","doi":"10.1109/tcomm.2011.071111.100351","title":"On the Performance of an Automatic Frequency Control Loop in Dissimilar Fading Channels in the Presence of Interference","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Rician fading; Fading; Nakagami distribution; Rayleigh fading; Fading distribution; Interference (communication); Electronic engineering; Control theory (sociology); Computer science; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Control (management)","score_opus":0.04454456056660241,"score_gpt":0.2713567143844337,"score_spread":0.2268121538178313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011095555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7936982,0.00013927538,0.20291628,0.00029531066,0.00005665607,0.0007377753,0.000030451223,0.00015692509,0.0019691142],"genre_scores_gemma":[0.99507135,0.00063926383,0.0037770094,0.00003100226,0.0000012991644,0.00045812855,0.0000017493145,0.000016500055,0.0000036838721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988991,0.000316675,0.00044082885,0.00009047034,0.000119762146,0.00013316482],"domain_scores_gemma":[0.9965349,0.0009683538,0.00009389061,0.0023396143,0.00004399008,0.000019291238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040901187,0.00012261955,0.00017376927,0.0002061143,0.0001087928,0.000007768127,0.0020070889,0.000055392797,0.00003466497],"category_scores_gemma":[0.000020289059,0.0000913215,0.000043110937,0.00043869796,0.0002289324,0.0002571932,0.0000058593664,0.0005378074,0.0000029979403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011217454,0.0041592363,0.001301705,0.0003916198,0.00015523475,0.0000018395687,0.07726376,0.740804,0.03340376,0.03977356,0.000027237247,0.10260588],"study_design_scores_gemma":[0.00025764853,0.00019519184,0.0021007336,0.0004906241,0.000013963672,0.000002225621,0.0008069117,0.92640543,0.06702437,0.0025531726,0.000003936429,0.00014576972],"about_ca_topic_score_codex":0.00009894057,"about_ca_topic_score_gemma":0.0002681463,"teacher_disagreement_score":0.20137314,"about_ca_system_score_codex":0.000048938142,"about_ca_system_score_gemma":0.000017158369,"threshold_uncertainty_score":0.37297037},"labels":[],"label_agreement":null},{"id":"W2012158206","doi":"10.1109/tcomm.2011.122111.100197a","title":"Adaptive Power Loading for Multi-Relay OFDM Regenerative Networks with Relay Selection","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Orthogonal frequency-division multiplexing; Bit error rate; Computer science; Selection (genetic algorithm); Relay channel; Electronic engineering; Power (physics); Multiplexing; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.12782066954455967,"score_gpt":0.30019273838400484,"score_spread":0.17237206883944517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012158206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030843285,0.00032787016,0.9955446,0.0005547564,0.00021550946,0.00055172463,0.000008589928,0.0002971778,0.002191318],"genre_scores_gemma":[0.6559148,0.000499772,0.3423581,0.00021156423,0.000009913951,0.00045963432,0.00000449693,0.000023007253,0.0005187249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.00035148207,0.0003310077,0.00038535026,0.00014388426,0.00030119452],"domain_scores_gemma":[0.9968891,0.00037949247,0.00017015082,0.0019907346,0.00044853712,0.000121988785],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033540427,0.00022977657,0.00019034167,0.00020079558,0.0016331063,0.00009896317,0.001652443,0.00011816489,0.000053213866],"category_scores_gemma":[0.000010461801,0.00022182234,0.00012529573,0.00088898133,0.00018600447,0.0005774032,0.000026059872,0.0005774085,0.000026206346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006744541,0.0047594695,0.00013287431,0.000018275712,0.0013211687,0.0000038750563,0.03395426,0.37998226,0.0025750308,0.41524804,0.0024992756,0.15883105],"study_design_scores_gemma":[0.0008047815,0.00053937495,0.00013212478,0.0000812028,0.000044233566,0.00001557247,0.00020907732,0.9896912,0.0065265954,0.000057258767,0.001556556,0.00034205403],"about_ca_topic_score_codex":0.000025503916,"about_ca_topic_score_gemma":0.0008264122,"teacher_disagreement_score":0.6556063,"about_ca_system_score_codex":0.0001280995,"about_ca_system_score_gemma":0.00011282272,"threshold_uncertainty_score":0.99966663},"labels":[],"label_agreement":null},{"id":"W2012217633","doi":"10.1109/tcomm.2015.2389255","title":"Distance Statistics of the Communication Best Neighbor in a Poisson Field of Nodes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Fading; Poisson distribution; Node (physics); Path loss; Attenuation; Statistics; Mathematics; k-nearest neighbors algorithm; Topology (electrical circuits); Computer science; Algorithm; Wireless; Telecommunications; Physics; Combinatorics; Artificial intelligence; Decoding methods","score_opus":0.029770531393956044,"score_gpt":0.2820368421103502,"score_spread":0.25226631071639416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012217633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002286427,0.0005170429,0.99427736,0.0003358802,0.00012514867,0.00026076028,0.00013019927,0.00004236064,0.0020248464],"genre_scores_gemma":[0.9675623,0.00062425237,0.03159051,0.000014026331,0.0000024353146,0.00006251057,0.000009027983,0.000018662204,0.000116277515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922293,0.00011482196,0.00039645488,0.00006569382,0.00011186446,0.00008820346],"domain_scores_gemma":[0.997715,0.00038979403,0.00010654292,0.0016043483,0.00015357026,0.000030762403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013610141,0.0000897706,0.00015202453,0.000097654425,0.000069143876,0.0000063509024,0.0006391184,0.00006235435,0.0000069186863],"category_scores_gemma":[0.000028853116,0.00008552066,0.0000367816,0.00046609185,0.00010864829,0.00012825677,0.0000060181374,0.0002432541,0.000003755823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019494688,0.00029812934,0.0004204297,0.0000662143,0.000033750977,6.698327e-8,0.0021148662,0.98540187,0.0013537981,0.0038903165,0.00020423275,0.0061968123],"study_design_scores_gemma":[0.0020252955,0.00019860757,0.0011067342,0.0011648089,0.00015708462,0.000006527938,0.0034591758,0.92009103,0.06435444,0.005043452,0.0018456506,0.00054718263],"about_ca_topic_score_codex":0.00041538704,"about_ca_topic_score_gemma":0.003227255,"teacher_disagreement_score":0.9652759,"about_ca_system_score_codex":0.00009801035,"about_ca_system_score_gemma":0.00003903386,"threshold_uncertainty_score":0.34874314},"labels":[],"label_agreement":null},{"id":"W2014285456","doi":"10.1109/tcomm.2011.012012.100426","title":"Aggregate Interference Modeling in Cognitive Radio Networks with Power and Contention Control","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Engineering and Physical Sciences Research Council","keywords":"Interference (communication); Power control; Cognitive radio; Node (physics); Computer science; Transmission (telecommunications); Computer network; Power (physics); Carrier sense multiple access with collision avoidance; Co-channel interference; Topology (electrical circuits); Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Wireless; Throughput; Electrical engineering; Physics","score_opus":0.03783821846480506,"score_gpt":0.2614185490077743,"score_spread":0.22358033054296922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014285456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03055235,0.0010068608,0.9663383,0.0006465254,0.00014129582,0.00028092435,0.000005043005,0.00008756717,0.00094117865],"genre_scores_gemma":[0.9949707,0.0006514425,0.0040695234,0.00019942189,0.000015036779,0.000048481837,0.0000022232414,0.000013063607,0.000030149162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889815,0.00021075066,0.00023481001,0.00022651373,0.00010707638,0.00032269536],"domain_scores_gemma":[0.9986407,0.00043780246,0.00007136033,0.00062010234,0.000114617294,0.00011539893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002781914,0.00015986792,0.00018902887,0.00017687892,0.00033949016,0.000110329325,0.00036242278,0.00006406539,0.000007194539],"category_scores_gemma":[0.0000059471163,0.00014937128,0.00004844651,0.0003963924,0.00013307683,0.00066597515,0.000008369884,0.00048021608,0.000004551041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009023761,0.0035398214,0.0043722666,0.00002644767,0.0008178393,0.00002535572,0.015510281,0.31462693,0.0007015133,0.026417878,0.00004262902,0.63301665],"study_design_scores_gemma":[0.0010946747,0.00011040216,0.0007757408,0.00025529746,0.000033925684,0.0000523286,0.00026413065,0.9969927,0.000078546494,0.00012717875,0.000017654138,0.00019740526],"about_ca_topic_score_codex":0.00006678049,"about_ca_topic_score_gemma":0.0004835364,"teacher_disagreement_score":0.9644183,"about_ca_system_score_codex":0.00006270749,"about_ca_system_score_gemma":0.000025872712,"threshold_uncertainty_score":0.6091184},"labels":[],"label_agreement":null},{"id":"W2016530058","doi":"10.1109/tcomm.2003.816972","title":"Effective bandwidth of multiclass Markovian traffic sources and admission control with dynamic buffer partitioning","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Quality of service; Computer science; Bandwidth (computing); Markov process; Admission control; Buffer overflow; Statistical time division multiplexing; Partition (number theory); Multiplexing; Markov chain; Packet loss; Queueing theory; Computer network; Bandwidth allocation; Buffer (optical fiber); Call Admission Control; Network packet; Real-time computing; Mathematics; Telecommunications; Statistics","score_opus":0.0076939997439488565,"score_gpt":0.23032366538541754,"score_spread":0.2226296656414687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016530058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46834797,0.00020562421,0.52746594,0.0009205864,0.00006747353,0.00064810866,0.000015794001,0.00017918824,0.0021493428],"genre_scores_gemma":[0.99748015,0.00004559362,0.002054567,0.00014554491,0.000008411648,0.000117249285,0.0000063374937,0.000024192865,0.000117922886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991967,0.00012051571,0.00021972616,0.00019031373,0.000121881174,0.00015086688],"domain_scores_gemma":[0.99854195,0.00048455785,0.00016876252,0.0006545541,0.00012787635,0.000022272206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813156,0.00015193186,0.00021364985,0.00023926995,0.00059691194,0.000057909914,0.00020875156,0.000050345952,0.00008065024],"category_scores_gemma":[0.00003867534,0.00013329233,0.00007306052,0.00043783858,0.00023549491,0.00043214313,0.0000029806345,0.00021728124,0.000013270036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012208801,0.0029998831,0.0025191202,0.00043081533,0.0013603871,0.0000056624235,0.0014510043,0.8416738,0.010597548,0.023345223,0.000045413322,0.114350304],"study_design_scores_gemma":[0.008255199,0.00027839286,0.005658751,0.00086667883,0.002483477,0.000021402762,0.0031380735,0.9576077,0.005169477,0.005622709,0.009649886,0.0012482434],"about_ca_topic_score_codex":0.000039697206,"about_ca_topic_score_gemma":0.00045164407,"teacher_disagreement_score":0.52913225,"about_ca_system_score_codex":0.000033793032,"about_ca_system_score_gemma":0.000014662404,"threshold_uncertainty_score":0.5435504},"labels":[],"label_agreement":null},{"id":"W2018334863","doi":"10.1109/tcomm.2014.2359885","title":"Coexistence Analysis of H2H and M2M Traffic in FiWi Smart Grid Communications Infrastructures Based on Multi-Tier Business Models","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"McGill University; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer network; Computer science; Ethernet; Quality of service; Bottleneck; Wireless; Real-time computing; Telecommunications; Embedded system","score_opus":0.035831972914116196,"score_gpt":0.2658957280288074,"score_spread":0.2300637551146912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018334863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08442189,0.00146911,0.90331894,0.002183627,0.0002987552,0.00083641155,0.00087050296,0.0005197993,0.0060809636],"genre_scores_gemma":[0.96827114,0.0022630445,0.028938994,0.00010764543,0.0000049297405,0.00020438616,0.00014542943,0.00003848525,0.000025922045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984524,0.00031511334,0.0006247501,0.00022551388,0.0001555294,0.00022668127],"domain_scores_gemma":[0.9933624,0.0010283907,0.00010642419,0.0052114143,0.0001889996,0.00010231777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033378424,0.00026093668,0.00044339386,0.0011369868,0.00036841942,0.00004177573,0.0016645525,0.00014086711,0.000028174278],"category_scores_gemma":[0.000027793265,0.0002819077,0.00015443651,0.0022911336,0.00040820715,0.00021238263,0.000023117233,0.0006085722,0.0000054476536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014034672,0.0005229382,0.000098513854,0.000024604455,0.00017297799,7.973379e-8,0.0005469236,0.9899404,0.00023702701,0.00052210834,0.000042998985,0.007877393],"study_design_scores_gemma":[0.00062471937,0.000034111887,0.011099003,0.0000892112,0.00033626077,8.456115e-7,0.00009599379,0.98599553,0.00018810519,0.000097745746,0.0011871215,0.00025134545],"about_ca_topic_score_codex":0.0002429378,"about_ca_topic_score_gemma":0.0051132157,"teacher_disagreement_score":0.88384926,"about_ca_system_score_codex":0.00007999207,"about_ca_system_score_gemma":0.000045294248,"threshold_uncertainty_score":0.9999633},"labels":[],"label_agreement":null},{"id":"W2019099392","doi":"10.1109/tcomm.2006.869806","title":"M-ary NCFSK with S+N selection combining in Rician fading","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Fading; Fading distribution; Multipath propagation; Algorithm; Diversity combining; Independent and identically distributed random variables; Mathematics; Phase-shift keying; Signal-to-noise ratio (imaging); Bit error rate; Electronic engineering; Telecommunications; Statistics; Computer science; Rayleigh fading; Engineering; Random variable; Decoding methods; Estimator","score_opus":0.013685941574819747,"score_gpt":0.24205160887983726,"score_spread":0.2283656673050175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019099392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009193803,0.00029066057,0.9692922,0.0003333284,0.000061859355,0.00034571928,0.000012674077,0.001568557,0.01890118],"genre_scores_gemma":[0.95919764,0.0005675286,0.039607916,0.000040809424,0.000008977688,0.00036466768,0.000018607558,0.000060714043,0.000133133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999043,0.000093755574,0.00034408164,0.00015450844,0.00013061683,0.00023404337],"domain_scores_gemma":[0.99835694,0.00022966179,0.00005285147,0.0012523857,0.000059414368,0.000048721373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011805874,0.00018665845,0.00017826112,0.00042835943,0.00035272478,0.000035818306,0.00062011246,0.00009671444,0.000024945759],"category_scores_gemma":[0.0000023833056,0.00021100829,0.000047419886,0.00093726884,0.00010816961,0.00032553493,0.0000042273537,0.00069336116,0.000023156917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020985412,0.0004883226,0.0003370178,0.000021985477,0.000042263317,0.0000013153792,0.00040026073,0.9423825,0.011207036,0.004356545,0.0002177791,0.040523995],"study_design_scores_gemma":[0.0021426983,0.00028257628,0.0040460913,0.0006675612,0.000089495945,0.00006534534,0.0007042781,0.76772684,0.20146279,0.00552125,0.015707148,0.0015839149],"about_ca_topic_score_codex":0.00022176269,"about_ca_topic_score_gemma":0.002854779,"teacher_disagreement_score":0.95000386,"about_ca_system_score_codex":0.00028063252,"about_ca_system_score_gemma":0.000028288989,"threshold_uncertainty_score":0.86046684},"labels":[],"label_agreement":null},{"id":"W2019936054","doi":"10.1109/tcomm.2012.12.100562","title":"Gaussian Multiple Description Coding with Low-Density Generator Matrix Codes","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Generator matrix; Gaussian; Coding (social sciences); Algorithm; Quadratic equation; Quantization (signal processing); Mathematics; Computer science; Discrete mathematics; Topology (electrical circuits); Combinatorics; Decoding methods; Physics","score_opus":0.02837938316599134,"score_gpt":0.2673096130151183,"score_spread":0.23893022984912696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019936054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02889449,0.0006115822,0.96698385,0.00021637448,0.0001604941,0.000368551,0.00005458186,0.0016103277,0.0010997233],"genre_scores_gemma":[0.9046138,0.0016570734,0.09311896,0.00005332509,0.00002125926,0.0003235869,0.000031394793,0.000070604154,0.00010997899],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892014,0.0001305289,0.00031142015,0.0001403832,0.00016869277,0.00032882742],"domain_scores_gemma":[0.99718493,0.00023456763,0.000066954985,0.0022840502,0.000100242105,0.00012922318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017357727,0.00023494668,0.0002096386,0.00020622216,0.00064708275,0.00005458078,0.0006962163,0.00016101453,0.00003569311],"category_scores_gemma":[0.0000061111623,0.00024157317,0.00007485341,0.0004037969,0.00017095741,0.00067192357,0.000008224433,0.0007597054,0.000084234285],"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.00022659892,0.003984388,0.003450885,0.00041211897,0.00089966407,0.0000031780276,0.007323985,0.25614908,0.6034371,0.021103315,0.0021773863,0.100832246],"study_design_scores_gemma":[0.0012081497,0.00011670247,0.0025514257,0.00038451573,0.00018321951,0.00006338948,0.0007353929,0.20973466,0.76883304,0.00033470796,0.014488199,0.0013665856],"about_ca_topic_score_codex":0.0000398743,"about_ca_topic_score_gemma":0.00028653312,"teacher_disagreement_score":0.8757193,"about_ca_system_score_codex":0.00024030328,"about_ca_system_score_gemma":0.000020339292,"threshold_uncertainty_score":0.98510677},"labels":[],"label_agreement":null},{"id":"W2020661221","doi":"10.1109/tcomm.2013.021513.100278","title":"Energy-Aware Power Allocation in Cooperative Communication Systems with Imperfect CSI","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transmitter power output; Computer science; Relay; Power budget; Channel state information; Quality of service; Computer network; Communications system; Power (physics); Transmission (telecommunications); Signal-to-noise ratio (imaging); Efficient energy use; Energy (signal processing); Wireless; Imperfect; Electronic engineering; Channel (broadcasting); Telecommunications; Power control; Engineering; Electrical engineering; Transmitter; Mathematics","score_opus":0.025986993013217587,"score_gpt":0.2581110792061994,"score_spread":0.23212408619298183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020661221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023485573,0.0011937224,0.98248535,0.006243257,0.00013976543,0.00080381654,0.000007728551,0.00032243185,0.0064553735],"genre_scores_gemma":[0.98703927,0.0041572847,0.0060111373,0.00048494068,0.000006943815,0.0015700583,0.000027774073,0.000030905067,0.0006717155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732697,0.0010843956,0.00055266166,0.0004112501,0.000290408,0.00033429379],"domain_scores_gemma":[0.99334997,0.0006838985,0.00017722261,0.005000738,0.0006498607,0.00013830385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038436014,0.00029867096,0.00029592685,0.00041879615,0.0009689401,0.00046505156,0.0031729303,0.00012491009,0.00008875132],"category_scores_gemma":[0.0000070255924,0.00027400866,0.00007475706,0.0016268321,0.00023562011,0.0014015653,0.000055572404,0.00065272575,0.00016358832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117226075,0.006408582,0.00048707137,0.000053182714,0.00063420547,0.0000065720074,0.017520437,0.18828501,0.0072086616,0.45868802,0.006838479,0.31375253],"study_design_scores_gemma":[0.001313255,0.0003507172,0.0009475549,0.00037053906,0.00002354506,0.00003354017,0.0009389036,0.9856468,0.0019232159,0.00038004477,0.0073153037,0.00075660984],"about_ca_topic_score_codex":0.0005390433,"about_ca_topic_score_gemma":0.0019002791,"teacher_disagreement_score":0.98469067,"about_ca_system_score_codex":0.00028064055,"about_ca_system_score_gemma":0.00017758184,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W2021672277","doi":"10.1109/tcomm.2013.032013.120601","title":"Analysis of the Generalized DF-CF for Gaussian Relay Channels: Decode or Compress?","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Relay; Rayleigh fading; Topology (electrical circuits); Mathematics; Gaussian; Asymptotic analysis; Channel (broadcasting); Bounded function; Signal-to-noise ratio (imaging); Fading; Relay channel; Node (physics); Decoding methods; Computer science; Algorithm; Telecommunications; Power (physics); Statistics; Combinatorics; Engineering; Mathematical analysis","score_opus":0.08890690206518086,"score_gpt":0.3245589423044543,"score_spread":0.23565204023927344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021672277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024288897,0.0002737162,0.9847478,0.010353216,0.00028360655,0.0007402305,0.000033737902,0.000113984686,0.0010248189],"genre_scores_gemma":[0.95374393,0.001387828,0.04176375,0.00059691764,0.000010394938,0.00075971877,0.000010588089,0.000013943835,0.0017129481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984215,0.00046318313,0.00047434482,0.00024931095,0.00018064847,0.00021101459],"domain_scores_gemma":[0.9937092,0.0009215842,0.00020404463,0.0047308044,0.00035206025,0.00008228015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027469613,0.00016158995,0.00029602778,0.00030841812,0.0011035713,0.00013980275,0.004039789,0.00007298939,0.00017334417],"category_scores_gemma":[0.000022834693,0.00011573567,0.00035369868,0.002237014,0.00018903549,0.0003281727,0.000056656514,0.00028226298,0.000020559688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110912544,0.0036641567,0.00029624673,0.000059899605,0.0055032573,3.5630987e-7,0.0129264975,0.47297764,0.01096944,0.12304058,0.012682646,0.35776836],"study_design_scores_gemma":[0.00048535294,0.000053055945,0.0009301279,0.000040274732,0.00027617696,0.0000015427696,0.00007290922,0.9809121,0.0030115328,0.00028235262,0.013739451,0.00019513817],"about_ca_topic_score_codex":0.0000900199,"about_ca_topic_score_gemma":0.0013383126,"teacher_disagreement_score":0.95131505,"about_ca_system_score_codex":0.00006058824,"about_ca_system_score_gemma":0.00008767993,"threshold_uncertainty_score":0.848789},"labels":[],"label_agreement":null},{"id":"W2021991420","doi":"10.1109/tcomm.2015.2397885","title":"Distributed Uplink Power Control for Multi-Cell Cognitive Radio Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Power control; Telecommunications link; Cognitive radio; Transmitter power output; Computer science; Interference (communication); Constraint (computer-aided design); Signal-to-noise ratio (imaging); Power (physics); Computer network; Channel (broadcasting); Real-time computing; Algorithm; Transmitter; Telecommunications; Mathematics; Wireless","score_opus":0.05111441690243437,"score_gpt":0.2907075591421324,"score_spread":0.23959314223969805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021991420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015930552,0.0006914096,0.9949544,0.0017803969,0.0005433859,0.0007827137,0.00014288854,0.00028969158,0.0006557939],"genre_scores_gemma":[0.96060544,0.00019482004,0.038347125,0.00043819597,0.00003854738,0.00011983323,0.000042839976,0.000026764259,0.00018646066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850214,0.0002204689,0.0003440196,0.00037295287,0.00016195462,0.00039848275],"domain_scores_gemma":[0.9966252,0.0011406031,0.00012726277,0.0013433663,0.0005061907,0.0002573778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037521275,0.00022867776,0.00026778204,0.00012925112,0.0007022318,0.00018067386,0.0010412711,0.0001258068,0.0000068284558],"category_scores_gemma":[0.000021695543,0.00023905511,0.00020632484,0.0005351108,0.00016402901,0.00031512076,0.000008270249,0.00047187696,0.000031996602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012548538,0.014990674,0.00016137438,0.000046174664,0.0018637714,0.000041306754,0.010141641,0.50605136,0.0006021896,0.028238699,0.014857713,0.42175025],"study_design_scores_gemma":[0.003604021,0.00021655846,0.000073268464,0.00004131504,0.000080076206,0.000015210379,0.00014600778,0.9928708,0.00031821447,0.00030775327,0.0020334714,0.0002932899],"about_ca_topic_score_codex":0.00002384734,"about_ca_topic_score_gemma":0.000103271865,"teacher_disagreement_score":0.9604461,"about_ca_system_score_codex":0.00012620828,"about_ca_system_score_gemma":0.00012335698,"threshold_uncertainty_score":0.97483844},"labels":[],"label_agreement":null},{"id":"W2022582029","doi":"10.1109/tcomm.2005.861683","title":"A fast trellis-based rate-allocation algorithm for robust transmission of progressively coded images over noisy channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"Carleton University","funders":"","keywords":"Trellis (graph); Algorithm; Viterbi algorithm; Computer science; Soft output Viterbi algorithm; Space–time trellis code; Transmission (telecommunications); Channel (broadcasting); Binary number; Trellis modulation; Set (abstract data type); Viterbi decoder; Decoding methods; Mathematics; Fading; Sequential decoding; Error floor; Telecommunications; Block code","score_opus":0.028492406471890722,"score_gpt":0.29817121432877536,"score_spread":0.26967880785688464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022582029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006339262,0.0002035144,0.99614567,0.0013813629,0.00013086386,0.0010851787,0.00033544833,0.0005109843,0.00014357992],"genre_scores_gemma":[0.182246,0.00012538531,0.81612283,0.00007692092,0.000017218219,0.0009535607,0.00012058325,0.000032286396,0.00030519822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982142,0.00022752634,0.0005776508,0.0004357824,0.00027017825,0.00027467444],"domain_scores_gemma":[0.9962486,0.0005915846,0.0003169988,0.002358861,0.00039834582,0.00008561475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028555936,0.00025592803,0.00028499748,0.0003524936,0.0005600675,0.00009288709,0.0020179665,0.00013174677,0.000015789248],"category_scores_gemma":[0.0000064272012,0.0002502645,0.00019064553,0.0006923477,0.00022071505,0.00072330615,0.000014320188,0.00027790462,0.0000051138404],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056414883,0.0023282103,0.0000021079247,0.00005995204,0.000043317505,8.7205956e-7,0.0001811681,0.11049149,0.04946047,0.0025419495,0.0013810425,0.833453],"study_design_scores_gemma":[0.0007827565,0.00019098131,0.000057128338,0.00015174971,0.000033408938,0.0000019826716,0.000012438769,0.68817025,0.30603015,0.0015792876,0.0027574007,0.00023242521],"about_ca_topic_score_codex":0.00009734363,"about_ca_topic_score_gemma":0.00002507374,"teacher_disagreement_score":0.8332206,"about_ca_system_score_codex":0.000081983846,"about_ca_system_score_gemma":0.00013285634,"threshold_uncertainty_score":0.99999493},"labels":[],"label_agreement":null},{"id":"W2022963826","doi":"10.1109/tcomm.2006.877945","title":"Length-constrained MAP decoding of variable-length encoded Markov sequences","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Decoding methods; Maximum a posteriori estimation; Markov chain; Directed acyclic graph; Mathematics; Parameterized complexity; Algorithm; Directed graph; Markov process; Path (computing); Sequential decoding; Sequence (biology); Binary number; Markov model; Mathematical optimization; Computer science; Maximum likelihood; Block code","score_opus":0.020305138290164695,"score_gpt":0.2612639241017747,"score_spread":0.24095878581160998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022963826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28827366,0.00083769235,0.680864,0.0011751509,0.00040703386,0.0004497088,0.00021885675,0.000116638264,0.027657272],"genre_scores_gemma":[0.9657426,0.00021494688,0.033322077,0.0000879775,0.000044936696,0.000029312607,0.0000732034,0.000011006212,0.00047395032],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989847,0.00015975836,0.00034132277,0.00022760454,0.000092258204,0.00019438249],"domain_scores_gemma":[0.99874485,0.00014706395,0.00011421777,0.0008461495,0.00010396474,0.00004374795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023755532,0.00014182199,0.00015507183,0.000063550244,0.00031228957,0.000019296262,0.00058529293,0.00014768523,0.000051692765],"category_scores_gemma":[0.000014035914,0.00012990879,0.000119512864,0.00017692927,0.00027257772,0.000006642477,0.000012210308,0.00018714252,0.000008186882],"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.000057591227,0.00058957696,0.00024509657,0.0000248715,0.000107974265,6.63616e-7,0.000035988,0.0041901963,0.9740997,0.0028214685,0.00032229885,0.01750458],"study_design_scores_gemma":[0.0015876029,0.0008817565,0.00068106677,0.00016549308,0.00017887745,0.00004129067,0.0004464611,0.014250434,0.94962436,0.0033184527,0.027913928,0.0009102827],"about_ca_topic_score_codex":0.00013379479,"about_ca_topic_score_gemma":0.00014101039,"teacher_disagreement_score":0.6774689,"about_ca_system_score_codex":0.000017217897,"about_ca_system_score_gemma":0.00006981704,"threshold_uncertainty_score":0.5297526},"labels":[],"label_agreement":null},{"id":"W2023544465","doi":"10.1109/tcomm.2011.091911.100189","title":"Binary Soliton-Like Rateless Coding for the Y-Network","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fountain code; Computer science; Luby transform code; Linear network coding; Decoding methods; Binary erasure channel; Computer network; Binary number; Variable-length code; Coding (social sciences); Theoretical computer science; Algorithm; Block code; Linear code; Channel (broadcasting); Channel capacity; Mathematics; Network packet","score_opus":0.14080348725088326,"score_gpt":0.31156643319474675,"score_spread":0.1707629459438635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023544465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085134125,0.001022057,0.98940706,0.003671128,0.00081172347,0.00058203825,0.000008868911,0.00027638802,0.0041356203],"genre_scores_gemma":[0.9322009,0.0061215903,0.05923602,0.0009565312,0.000044099823,0.0007080531,0.0000044680173,0.000021454125,0.0007068702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986269,0.00030928562,0.00033854344,0.00026559632,0.0001384709,0.0003212278],"domain_scores_gemma":[0.9939957,0.0014372427,0.00011240384,0.0041431403,0.00022650289,0.00008497737],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00060338265,0.00017869145,0.00016449952,0.000074556956,0.0027667985,0.00012977658,0.0042629745,0.00006914351,0.00005284716],"category_scores_gemma":[0.000008725238,0.00014713382,0.00016501542,0.0007512537,0.0002176386,0.00034991308,0.000053822092,0.0004368328,0.00006191685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009359742,0.001392874,0.000037309834,0.000023309114,0.00043629494,0.0000015533661,0.010424077,0.016369361,0.0010539435,0.52455443,0.0141552435,0.431458],"study_design_scores_gemma":[0.00094801944,0.00025586528,0.00068592903,0.00012875893,0.00010315659,0.000019270405,0.0003989307,0.85440856,0.0032611443,0.004284606,0.13485569,0.0006500569],"about_ca_topic_score_codex":0.000017531274,"about_ca_topic_score_gemma":0.00023012747,"teacher_disagreement_score":0.9321158,"about_ca_system_score_codex":0.00006248393,"about_ca_system_score_gemma":0.00009255766,"threshold_uncertainty_score":0.99853146},"labels":[],"label_agreement":null},{"id":"W2023580604","doi":"10.1109/tcomm.2012.042712.110410","title":"Cooperative AF Relaying in Spectrum-Sharing Systems: Performance Analysis under Average Interference Power Constraints and Nakagami-m Fading","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Relay; Rayleigh fading; Computer science; Cognitive radio; Spectral efficiency; Interference (communication); Signal-to-noise ratio (imaging); Electronic engineering; Wireless; Telecommunications; Power (physics); Engineering; Channel (broadcasting); Physics","score_opus":0.05721254112731804,"score_gpt":0.2918700804958549,"score_spread":0.23465753936853684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023580604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06553273,0.0012277997,0.9275256,0.00074931514,0.00022756588,0.00028646176,0.000007416731,0.00013567095,0.0043074903],"genre_scores_gemma":[0.9934882,0.0030860775,0.0029150813,0.00019544952,0.000008718364,0.00011054098,0.0000045703764,0.000013629834,0.00017776256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982513,0.00038940794,0.00047920318,0.0003395262,0.00016506707,0.00037549261],"domain_scores_gemma":[0.99702907,0.0005019593,0.00012570352,0.0020890061,0.000109069,0.00014519233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069084123,0.00022374006,0.0003043756,0.00061964197,0.00088341744,0.00027171063,0.0015504698,0.00008489628,0.00006077169],"category_scores_gemma":[0.000012519626,0.00023295905,0.000082543884,0.001817412,0.00025181827,0.0011703065,0.00008799845,0.00072995527,0.000037065653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007642077,0.0025352594,0.037709065,0.00008301347,0.0021388521,0.0000055995383,0.0666612,0.47005928,0.003617844,0.34110132,0.00007912724,0.07593302],"study_design_scores_gemma":[0.0006881622,0.00008931748,0.014040156,0.0003300995,0.00010438239,0.000047738642,0.0012815248,0.98139626,0.0009869307,0.000083161234,0.00034877754,0.00060347194],"about_ca_topic_score_codex":0.000031833908,"about_ca_topic_score_gemma":0.00025235777,"teacher_disagreement_score":0.92795545,"about_ca_system_score_codex":0.00023367481,"about_ca_system_score_gemma":0.000052260657,"threshold_uncertainty_score":0.9499794},"labels":[],"label_agreement":null},{"id":"W2024982724","doi":"10.1109/tcomm.2012.082812.110390","title":"Multiple CFO Mitigation in Amplify-and-Forward Cooperative OFDM Transmission","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Orthogonal frequency-division multiplexing; Decoding methods; Computer science; Carrier frequency offset; Interference (communication); Algorithm; Transmission (telecommunications); Multiplexing; Decodes; Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Frequency offset","score_opus":0.05104095675021321,"score_gpt":0.30287572687776193,"score_spread":0.25183477012754873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024982724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003584999,0.0015247737,0.98471844,0.006410198,0.00017167143,0.0004038103,0.000007653399,0.00017836054,0.003000078],"genre_scores_gemma":[0.96823037,0.006326657,0.024511028,0.00043156667,0.000017337528,0.00020273082,0.000012691202,0.000015312698,0.00025229726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825436,0.00061032054,0.00040632658,0.0002516715,0.00017385044,0.00030346547],"domain_scores_gemma":[0.9970341,0.0008203358,0.00008225672,0.001760664,0.00012224558,0.00018044088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005255141,0.00019708634,0.00020943565,0.00028513026,0.000821104,0.000082941675,0.0012258148,0.00010570958,0.00005588544],"category_scores_gemma":[0.000021092686,0.00019164693,0.00005752006,0.0008534617,0.00021081416,0.0009851814,0.000026808724,0.0005777722,0.000057786132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047206766,0.0020527807,0.0013088827,0.000028666313,0.00009275158,7.463967e-7,0.029920014,0.005638032,0.015927553,0.12848377,0.00073110336,0.8157685],"study_design_scores_gemma":[0.004243591,0.000387906,0.01650626,0.00058337825,0.00007319627,0.000047685466,0.0013102934,0.79617,0.02239404,0.0019427205,0.15472914,0.0016118009],"about_ca_topic_score_codex":0.000044378972,"about_ca_topic_score_gemma":0.00030546886,"teacher_disagreement_score":0.9646454,"about_ca_system_score_codex":0.00011214773,"about_ca_system_score_gemma":0.00004813111,"threshold_uncertainty_score":0.7815135},"labels":[],"label_agreement":null},{"id":"W2025349149","doi":"10.1109/tcomm.2015.2404440","title":"MINTED: <italic>M</italic>ulticast <italic>VI</italic>rtual <italic>N</italic>e<italic>T</italic>work <italic>E</italic>mbedding in Cloud Data Centers With <italic>D</italic>elay Constraints","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","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":"Concordia University","funders":"Qatar National Research Fund","keywords":"Multicast; Computer science; Computer network; Unicast; Quality of service","score_opus":0.05337180103299812,"score_gpt":0.2837657976359783,"score_spread":0.23039399660298018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025349149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43379048,0.058041878,0.21807572,0.030661175,0.04482195,0.045043685,0.069082275,0.027024599,0.07345824],"genre_scores_gemma":[0.90368867,0.009167096,0.02922713,0.006915202,0.0053443494,0.008541688,0.017844208,0.005440893,0.013830786],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9085793,0.010197865,0.021641262,0.021277977,0.01741768,0.020885952],"domain_scores_gemma":[0.9104492,0.010635874,0.011451201,0.045361627,0.00890011,0.013201972],"candidate_categories":["metaepi_narrow","metaepi_broad","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.015909558,0.019498559,0.01717167,0.011982254,0.013368552,0.01351772,0.047113284,0.010259517,0.0022610328],"category_scores_gemma":[0.004599276,0.020934198,0.0088897385,0.028958201,0.01739148,0.022780297,0.009160732,0.0142978905,0.007074502],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.010130815,0.050229557,0.004013067,0.004249531,0.027980193,0.0065461276,0.03660872,0.036493868,0.11743782,0.16229893,0.5010768,0.04293457],"study_design_scores_gemma":[0.04178169,0.010329229,0.0044326466,0.011604064,0.01060242,0.010139019,0.0073799123,0.09960689,0.005193139,0.0035843044,0.7572916,0.038055073],"about_ca_topic_score_codex":0.0026358147,"about_ca_topic_score_gemma":0.022563659,"teacher_disagreement_score":0.46989816,"about_ca_system_score_codex":0.011505033,"about_ca_system_score_gemma":0.008141891,"threshold_uncertainty_score":0.9992161},"labels":[],"label_agreement":null},{"id":"W2027150172","doi":"10.1109/tcomm.2012.071812.110739","title":"Joint Optimal Threshold-Based Relaying and ML Detection in Network-Coded Two-Way Relay Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Phase-shift keying; Detector; Linear network coding; Relay channel; Binary number; Transmission (telecommunications); Node (physics); Bit error rate; Algorithm; Channel (broadcasting); Topology (electrical circuits); Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Network packet; Physics; Arithmetic; Electrical engineering; Power (physics)","score_opus":0.07165189234788484,"score_gpt":0.29551240790146066,"score_spread":0.22386051555357583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027150172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0207834,0.0014773489,0.9726559,0.002637239,0.000528062,0.00040338672,0.0000026451323,0.0002702898,0.0012417561],"genre_scores_gemma":[0.9578729,0.001462157,0.039806176,0.00042843228,0.00004842232,0.0002576901,0.0000041205935,0.000023802933,0.000096261014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804896,0.0005164021,0.00046959164,0.0003094764,0.00019224822,0.00046329826],"domain_scores_gemma":[0.9966594,0.00043425907,0.00013001481,0.0024932576,0.00010892184,0.0001741693],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010167428,0.00022810549,0.00023751886,0.00031983943,0.0011639498,0.00016079465,0.0011577226,0.00010926781,0.000022078302],"category_scores_gemma":[0.000014746507,0.0002452379,0.00009683554,0.001092478,0.00015047312,0.0008142473,0.00005365658,0.00085259875,0.000039223836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056065604,0.0013841079,0.00044051086,0.000020545884,0.00008876355,0.0000018647171,0.005272569,0.7375899,0.00839945,0.024262488,0.00018256009,0.22230119],"study_design_scores_gemma":[0.00096240913,0.00008372735,0.0009126319,0.00013059833,0.000021459959,0.000017711627,0.00006899271,0.986245,0.008830781,0.00018388269,0.0021695069,0.0003733261],"about_ca_topic_score_codex":0.000036790367,"about_ca_topic_score_gemma":0.0005040106,"teacher_disagreement_score":0.93708956,"about_ca_system_score_codex":0.00016950029,"about_ca_system_score_gemma":0.000052291605,"threshold_uncertainty_score":1},"labels":[],"label_agreement":null},{"id":"W2028070124","doi":"10.1109/tcomm.2013.020813.120594","title":"A Modified Hard Core Point Process for Analysis of Random CSMA Wireless Networks in General Fading Environments","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Manitoba","funders":"","keywords":"Fading; Computer network; Computer science; Node (physics); Point process; Transmission (telecommunications); Wireless network; Stochastic geometry; Interference (communication); Carrier sense multiple access with collision avoidance; Wireless; Distributed computing; Topology (electrical circuits); Channel (broadcasting); Throughput; Engineering; Telecommunications; Mathematics","score_opus":0.04026231450494504,"score_gpt":0.27457280157659947,"score_spread":0.23431048707165442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028070124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06535202,0.00008693218,0.9332904,0.000037701706,0.00008179443,0.00087607396,0.000050089915,0.00007730991,0.00014766467],"genre_scores_gemma":[0.9898184,0.00035016635,0.008159409,0.000011818491,0.00000735523,0.0014576237,0.000072702554,0.00003613027,0.000086404994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906653,0.000045535086,0.0004734054,0.0001494723,0.00008275656,0.00018230674],"domain_scores_gemma":[0.99875945,0.0002142189,0.00009036341,0.0008367878,0.000050067134,0.000049119953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011110702,0.00014608202,0.0003305979,0.00039555124,0.00012531246,0.00001572307,0.00035236578,0.0000956978,0.00002211713],"category_scores_gemma":[0.0000039421543,0.00016408798,0.00013950204,0.000736709,0.000055017892,0.00023937394,0.000002173948,0.00018977292,0.000003280841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015304713,0.000096529984,0.00005062178,0.00002038947,0.00026588302,3.8593527e-8,0.00044289787,0.9939924,0.0027423354,0.00004299725,0.000007378236,0.0023232556],"study_design_scores_gemma":[0.0009331827,0.000015171438,0.00022436425,0.00003828326,0.00021271166,4.1645197e-7,0.00015111364,0.9965103,0.0016724805,0.000090047586,0.000010549726,0.00014136574],"about_ca_topic_score_codex":0.0000805786,"about_ca_topic_score_gemma":0.00027110832,"teacher_disagreement_score":0.925131,"about_ca_system_score_codex":0.00012859542,"about_ca_system_score_gemma":0.000009015393,"threshold_uncertainty_score":0.66913134},"labels":[],"label_agreement":null},{"id":"W2031321507","doi":"10.1109/tcomm.2015.2408601","title":"Uplink Decentralized Joint Bandwidth and Power Allocation for Energy-Efficient Operation in a Heterogeneous Wireless Medium","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Waterloo","funders":"Qatar National Research Fund","keywords":"Telecommunications link; Base station; Computer science; Computer network; Quality of service; Efficient energy use; Benchmark (surveying); Wireless; Bandwidth (computing); Multihoming; Distributed computing; Engineering; Telecommunications; Electrical engineering","score_opus":0.032282928049624626,"score_gpt":0.2585824660237203,"score_spread":0.2262995379740957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031321507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009025801,0.00052860635,0.9887582,0.00041951114,0.00033318298,0.00056739815,0.00002613928,0.00020424137,0.00013692719],"genre_scores_gemma":[0.9833441,0.0007074832,0.015104318,0.000042729946,0.000009501619,0.0006542606,0.000053389558,0.000044807522,0.00003943176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999059,0.00007443444,0.00039231428,0.00018109166,0.00010202834,0.00019112836],"domain_scores_gemma":[0.99894077,0.00009570923,0.000040874846,0.00067218696,0.00013568642,0.00011477994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019604682,0.0001620413,0.00018595096,0.00020150578,0.00015511326,0.00004263118,0.00019432732,0.0001055257,0.000006202327],"category_scores_gemma":[0.000009352152,0.00018098595,0.00004422582,0.00022179844,0.000053056447,0.0001479756,0.0000032262526,0.00013841434,0.000005133144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020360481,0.000120623416,0.0000020126795,0.0000127642015,0.000020567491,1.9290273e-7,0.00083014637,0.99283713,0.0031492894,0.0003929157,0.000039942704,0.002574031],"study_design_scores_gemma":[0.001129002,0.000053258216,0.000010013769,0.000048923514,0.000020737743,0.000011427303,0.00016512813,0.9793065,0.018457303,0.00010297016,0.0005081061,0.00018662355],"about_ca_topic_score_codex":0.000056298235,"about_ca_topic_score_gemma":0.0007208255,"teacher_disagreement_score":0.97431827,"about_ca_system_score_codex":0.0002644668,"about_ca_system_score_gemma":0.000050666597,"threshold_uncertainty_score":0.7380393},"labels":[],"label_agreement":null},{"id":"W2031570691","doi":"10.1109/tcomm.2009.04.070114","title":"On decoding binary perfect and quasi-perfect codes over markov noise channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Decoding methods; Hamming bound; Hamming code; Algorithm; Block code; Binary symmetric channel; Mathematics; Linear code; Sequential decoding; List decoding; Markov chain; Concatenated error correction code; Hamming distance; Discrete mathematics; Computer science; Low-density parity-check code; Statistics","score_opus":0.018475127721856662,"score_gpt":0.2779605272010587,"score_spread":0.259485399479202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031570691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107063465,0.0016614294,0.87732255,0.0013128367,0.00026544937,0.0008279007,0.00010835812,0.0027692595,0.008668743],"genre_scores_gemma":[0.97587186,0.007964138,0.0155314915,0.00022893409,0.00001447413,0.00019632,0.000019871934,0.000055340035,0.00011759324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885076,0.00016558007,0.00033151938,0.0002310201,0.00015517375,0.00026593363],"domain_scores_gemma":[0.9968192,0.0006200488,0.000054722255,0.0023377154,0.000053477383,0.000114833776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001944156,0.0002847912,0.00026430146,0.0003613343,0.000651295,0.00006836321,0.00078092504,0.00013871107,0.000056989484],"category_scores_gemma":[0.000013225102,0.0003170627,0.00010915701,0.00039976442,0.00014462382,0.00031318332,0.000008349995,0.00072132354,0.00003113526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022549991,0.003214797,0.000055098375,0.00015033744,0.0003608976,0.000007134313,0.003467294,0.2765419,0.091882326,0.020263722,0.0032361138,0.6005949],"study_design_scores_gemma":[0.0015665699,0.0013423945,0.0014163526,0.00075333845,0.00015755338,0.000046910183,0.00031276623,0.86908084,0.1127404,0.005422921,0.005489311,0.0016706602],"about_ca_topic_score_codex":0.00001720828,"about_ca_topic_score_gemma":0.000042301464,"teacher_disagreement_score":0.8688084,"about_ca_system_score_codex":0.00016781305,"about_ca_system_score_gemma":0.000016741207,"threshold_uncertainty_score":0.9999281},"labels":[],"label_agreement":null},{"id":"W2036710797","doi":"10.1109/tcomm.2015.2427171","title":"PLC System Performance With AF Relaying","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":66,"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":"International Development Research Centre","keywords":"Fading; Electronic engineering; Additive white Gaussian noise; Transmission (telecommunications); Bit error rate; Relay; Data transmission; Control theory (sociology); Attenuation; Phase-shift keying; Communications system; Noise (video); Channel (broadcasting); Signal-to-noise ratio (imaging); Computer science; Engineering; Telecommunications; Electrical engineering; Power (physics); Physics","score_opus":0.04213137260765672,"score_gpt":0.23833655832461254,"score_spread":0.19620518571695583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036710797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09247158,0.0017623345,0.7463983,0.0011163505,0.0007186432,0.00067559676,0.00007872173,0.0030317907,0.15374666],"genre_scores_gemma":[0.9874954,0.00067221397,0.011174918,0.000025758123,0.000014010228,0.00022562825,0.000011554389,0.000048092545,0.00033237456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919486,0.0000700378,0.0002545936,0.000118972064,0.0001623303,0.0001991969],"domain_scores_gemma":[0.99689525,0.00011987439,0.000035764562,0.0026750881,0.00012402983,0.0001499737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018955702,0.00016530874,0.00015274831,0.00016828178,0.00040246497,0.000043440585,0.0009046017,0.000068503046,0.000010119442],"category_scores_gemma":[0.0000023747843,0.00015682835,0.000048953112,0.00046360638,0.00010107552,0.00026323108,0.00000583129,0.0004739902,0.00022347459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001194905,0.0007380569,0.0002792645,0.00020405474,0.00041348836,0.0000040485384,0.0037643071,0.9410311,0.0009115986,0.0038885006,0.0030943423,0.045551725],"study_design_scores_gemma":[0.0018203105,0.0003037822,0.00043027056,0.00053649826,0.00019291518,0.00013547899,0.0024823397,0.9043807,0.0063231303,0.000036478727,0.082485504,0.0008726174],"about_ca_topic_score_codex":0.000028227081,"about_ca_topic_score_gemma":0.00009978301,"teacher_disagreement_score":0.8950239,"about_ca_system_score_codex":0.00021834868,"about_ca_system_score_gemma":0.00006212615,"threshold_uncertainty_score":0.63952744},"labels":[],"label_agreement":null},{"id":"W2038386869","doi":"10.1109/tcomm.2013.041113.120480","title":"Joint Optimization of Source Power Allocation and Cooperative Beamforming for SC-FDMA Multi-User Multi-Relay Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Beamforming; Relay; Joint (building); Optimization problem; Computer science; Mathematical optimization; Power (physics); Interference (communication); Signal-to-noise ratio (imaging); Convex optimization; Noise (video); Electronic engineering; Telecommunications; Mathematics; Algorithm; Regular polygon; Engineering; Channel (broadcasting)","score_opus":0.05336404005613694,"score_gpt":0.2852314857243695,"score_spread":0.23186744566823259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038386869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005719984,0.00049656205,0.9949596,0.0023339407,0.00015356182,0.0011862472,0.000008656365,0.00015658476,0.0001328833],"genre_scores_gemma":[0.59552246,0.001656547,0.40142703,0.00024382357,0.0000064883807,0.00050979375,0.000015308346,0.00002110934,0.00059745857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984307,0.00028538832,0.0005685034,0.00032983746,0.00013965934,0.00024587018],"domain_scores_gemma":[0.99641705,0.00052281405,0.00023442962,0.0019173328,0.00079030887,0.00011806708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037309952,0.00022498086,0.00026269053,0.00022591282,0.0010604362,0.00017572536,0.0011489829,0.00012493359,0.000040766416],"category_scores_gemma":[0.000039395058,0.00022639801,0.0001081302,0.000585224,0.00022725966,0.00086444925,0.000052993957,0.00029197396,0.0000118278795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068161526,0.0005117312,0.000015487953,0.000008203308,0.00006984575,2.846373e-8,0.0021378575,0.963082,0.0016832857,0.0047538565,0.0001315504,0.027599327],"study_design_scores_gemma":[0.0008698568,0.000110131725,0.00017791998,0.00008349139,0.000023521352,0.0000034181153,0.00021219753,0.99464005,0.0022243387,0.000013331691,0.0014078474,0.00023387726],"about_ca_topic_score_codex":0.00004138394,"about_ca_topic_score_gemma":0.00013909284,"teacher_disagreement_score":0.59495044,"about_ca_system_score_codex":0.00008018738,"about_ca_system_score_gemma":0.000071478695,"threshold_uncertainty_score":0.92322433},"labels":[],"label_agreement":null},{"id":"W2039436865","doi":"10.1109/tcomm.2008.060315","title":"On the complexity of joint source-channel decoding of Markov sequences over memoryless channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Convolutional code; Decoding methods; Viterbi algorithm; Algorithm; Source code; Markov process; Computer science; Markov chain; Viterbi decoder; Discrete mathematics; Mathematics; Theoretical computer science; Statistics","score_opus":0.16279026126519539,"score_gpt":0.3071654428613609,"score_spread":0.1443751815961655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039436865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051125936,0.000049646384,0.9429273,0.0030737102,0.0002717171,0.00033747609,0.000018597084,0.00026826432,0.0019273431],"genre_scores_gemma":[0.9754402,0.00019621293,0.023959618,0.00017456262,0.0000073224805,0.00008208593,0.0000010521997,0.000014736103,0.0001242059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99837846,0.00037348527,0.00046987683,0.00024108695,0.00034082824,0.00019624359],"domain_scores_gemma":[0.99550575,0.001085511,0.0003019081,0.0028547081,0.00019889593,0.00005324351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055057695,0.00016823459,0.00026505112,0.0002600824,0.0007697014,0.000024065563,0.0024805784,0.00007250868,0.000030991723],"category_scores_gemma":[0.000040341925,0.00014096902,0.00019064234,0.0006673096,0.00091414736,0.00020236101,0.00003738014,0.00045586444,0.000008432698],"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.00029622565,0.013149673,0.0003532624,0.00043026835,0.0013377434,0.000017985905,0.12261754,0.13363191,0.10451979,0.529926,0.009398052,0.084321536],"study_design_scores_gemma":[0.00050589105,0.0005467558,0.0007726932,0.00055445055,0.00005553797,0.00010107664,0.00081402593,0.43354923,0.5214776,0.04081261,0.00020282847,0.0006073015],"about_ca_topic_score_codex":0.0005089635,"about_ca_topic_score_gemma":0.00020816257,"teacher_disagreement_score":0.92431426,"about_ca_system_score_codex":0.000071954586,"about_ca_system_score_gemma":0.000087664164,"threshold_uncertainty_score":0.5919998},"labels":[],"label_agreement":null},{"id":"W2040483094","doi":"10.1109/tcomm.2010.062310.090065","title":"Selective Cooperative Relaying over Time-Varying Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Relay; Relay channel; Fading; Bandwidth (computing); Computer science; Computer network; Electronic engineering; Power (physics); Channel (broadcasting); Engineering; Physics","score_opus":0.03669912004018087,"score_gpt":0.2961604010098597,"score_spread":0.2594612809696788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040483094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034852247,0.00015302205,0.97136736,0.0046551856,0.00075886166,0.0004763321,0.000011605794,0.00058347464,0.01850895],"genre_scores_gemma":[0.9701575,0.00065284054,0.026574794,0.0007119966,0.000039101225,0.00022555598,0.000007466679,0.00002615696,0.001604593],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832356,0.00038082062,0.00036156276,0.0003953105,0.00022668921,0.0003120499],"domain_scores_gemma":[0.9950467,0.0007827065,0.00011742868,0.0035378786,0.00036734337,0.00014794759],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00040813105,0.00023966706,0.0002212243,0.00026871366,0.0020290522,0.0002941668,0.0028989457,0.00012926472,0.00022443707],"category_scores_gemma":[0.000033938893,0.00024924034,0.00012917514,0.0012494237,0.00020913717,0.000823312,0.000057532416,0.0014623353,0.00042725986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007361042,0.0032923145,0.000077054785,0.000021560234,0.0006198681,0.0000061478845,0.019537086,0.029987652,0.38204306,0.20209587,0.007067032,0.35517874],"study_design_scores_gemma":[0.0011479743,0.00019590845,0.000275378,0.00010765199,0.00004076702,0.000038265156,0.000058120633,0.9195372,0.05095714,0.00127394,0.025454924,0.0009127297],"about_ca_topic_score_codex":0.000015633423,"about_ca_topic_score_gemma":0.00014898436,"teacher_disagreement_score":0.96667224,"about_ca_system_score_codex":0.000088624474,"about_ca_system_score_gemma":0.0001533881,"threshold_uncertainty_score":0.999996},"labels":[],"label_agreement":null},{"id":"W2041376620","doi":"10.1109/tcomm.2013.050813.120450","title":"Randomized Masking in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":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; Code word; Channel (broadcasting); Transmission (telecommunications); Computer science; Cognitive radio; Computer network; Masking (illustration); Code (set theory); Quality of service; Interference (communication); Telecommunications; Set (abstract data type); Decoding methods; Wireless","score_opus":0.029684406223567078,"score_gpt":0.27186302636367166,"score_spread":0.24217862014010458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041376620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017670433,0.00041629298,0.98482865,0.0026082136,0.00026915816,0.0008066145,0.0000019195982,0.00018469311,0.009117437],"genre_scores_gemma":[0.9866054,0.0010694477,0.011323986,0.000417416,0.000027494027,0.00030057828,0.0000035528078,0.000016569345,0.00023556052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981646,0.0006024764,0.00041975008,0.0003117946,0.00015860358,0.00034278832],"domain_scores_gemma":[0.9960548,0.0024434454,0.000099991674,0.0011682335,0.00013488672,0.00009858672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047414686,0.00018649783,0.0003637406,0.00029361667,0.00044382713,0.00023117274,0.00094105175,0.00008931097,0.00008720531],"category_scores_gemma":[0.000021559707,0.00018400273,0.0001865116,0.0008565843,0.00024052158,0.0005518012,0.000013480449,0.00063735165,0.00008321443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015696741,0.0015815544,0.00005821187,0.000011137571,0.0004258291,0.000019211402,0.0047262083,0.108317375,0.00014567854,0.03390212,0.000544299,0.8486987],"study_design_scores_gemma":[0.019527933,0.0000246844,0.00020616557,0.00013123108,0.000026107584,0.000019441815,0.000101391706,0.9768105,0.00015844185,0.0026649435,0.00009527896,0.00023386451],"about_ca_topic_score_codex":0.00033242177,"about_ca_topic_score_gemma":0.00041761989,"teacher_disagreement_score":0.98483837,"about_ca_system_score_codex":0.00009110221,"about_ca_system_score_gemma":0.000045844445,"threshold_uncertainty_score":0.7503413},"labels":[],"label_agreement":null},{"id":"W2041849117","doi":"10.1109/tcomm.2012.120512.110258","title":"A General Framework for Mixed-Domain Echo Cancellation in Discrete Multitone Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","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":"Computer science; Toeplitz matrix; Algorithm; Echo (communications protocol); Frequency domain; Matrix decomposition; Mathematics","score_opus":0.027262475069016547,"score_gpt":0.28887031343717295,"score_spread":0.26160783836815643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041849117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008037032,0.00018991577,0.98890793,0.00024298023,0.000351874,0.0010578474,0.00010320143,0.0005746363,0.0005345771],"genre_scores_gemma":[0.69168484,0.0002471068,0.30556473,0.000012015938,0.000024409985,0.0022657246,0.000012079583,0.00004092467,0.00014817626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917334,0.000060795406,0.0003041733,0.00015310194,0.00008404964,0.00022455912],"domain_scores_gemma":[0.99848515,0.0002997446,0.000041560652,0.0010530897,0.000061177845,0.0000592787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008953718,0.00016242798,0.0001728038,0.00017707577,0.00017203293,0.00004485546,0.0004081353,0.00012942991,0.00001698212],"category_scores_gemma":[0.000007181165,0.00018289742,0.000066925946,0.00024579576,0.00006413327,0.00023126707,0.0000034102677,0.00039047163,0.00002941855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001148759,0.00012152138,0.000016251108,0.000070475224,0.000055617755,2.7932856e-7,0.0006317539,0.95480734,0.023264583,0.010548161,0.00045812826,0.010014384],"study_design_scores_gemma":[0.0004592469,0.000072167044,0.000350557,0.00033318726,0.000019286173,0.0000035544322,0.00025691843,0.9487074,0.017811883,0.024432518,0.0070736776,0.00047958115],"about_ca_topic_score_codex":0.00028327727,"about_ca_topic_score_gemma":0.0004095743,"teacher_disagreement_score":0.6836478,"about_ca_system_score_codex":0.00025958082,"about_ca_system_score_gemma":0.000012553504,"threshold_uncertainty_score":0.74583405},"labels":[],"label_agreement":null},{"id":"W2042649448","doi":"10.1109/tcomm.2011.100611.100171","title":"Efficient Search Algorithm for Determining Optimal R=1/2 Systematic Convolutional Self-Doubly Orthogonal Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Convolutional code; Algorithm; Turbo code; Computer science; Serial concatenated convolutional codes; Mathematics; Concatenated error correction code; Block code; Decoding methods","score_opus":0.05541220702480414,"score_gpt":0.2880105201604358,"score_spread":0.23259831313563167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042649448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032264132,0.00029924922,0.9924709,0.00003881421,0.00014374466,0.0011574426,0.00020963982,0.0016211648,0.0008326093],"genre_scores_gemma":[0.5803709,0.0001773192,0.41795802,0.000016102085,0.000007822647,0.0013695641,0.000019385301,0.000047342954,0.00003352482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846864,0.00016452352,0.00058605964,0.00021486818,0.00023444672,0.00033147016],"domain_scores_gemma":[0.9968165,0.0007474311,0.00008454177,0.00197248,0.00025918378,0.000119832555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037806938,0.00025271362,0.00032822107,0.00029264652,0.00068031484,0.00003508554,0.0012180757,0.00012741382,0.00003999208],"category_scores_gemma":[0.00000764998,0.0002801378,0.00017908137,0.00033400417,0.00019869857,0.00012680238,0.000013840282,0.00047977833,0.000048784612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007627163,0.0037523683,0.000022182605,0.0044715605,0.0015234778,0.0000040940818,0.01188541,0.89038527,0.004463494,0.02244671,0.00021530584,0.060753882],"study_design_scores_gemma":[0.00036632206,0.000081981496,0.000029316336,0.00044907068,0.000093474424,0.000022865683,0.00023200962,0.985748,0.0123856,0.00017085638,0.00011637401,0.0003041072],"about_ca_topic_score_codex":0.000010217688,"about_ca_topic_score_gemma":0.00002029754,"teacher_disagreement_score":0.5771445,"about_ca_system_score_codex":0.00023669809,"about_ca_system_score_gemma":0.00007092933,"threshold_uncertainty_score":0.9999651},"labels":[],"label_agreement":null},{"id":"W2044066528","doi":"10.1109/tcomm.2012.071812.100789","title":"Suboptimal Detectors for Alpha-Stable Noise: Simplifying Design and Improving Performance","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Carleton University","funders":"","keywords":"Detector; Limiter; Gaussian; Computer science; Noise (video); Gaussian noise; Algorithm; Electronic engineering; Binary number; Signal-to-noise ratio (imaging); Mathematics; Engineering; Telecommunications; Physics; Artificial intelligence; Arithmetic","score_opus":0.04774013833522976,"score_gpt":0.26636956726635147,"score_spread":0.2186294289311217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044066528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044029397,0.00029494174,0.99374944,0.00030494606,0.00041863465,0.00041689747,0.00001868126,0.00026166305,0.00013182865],"genre_scores_gemma":[0.75784767,0.00020585982,0.24152203,0.00008769896,0.000028059489,0.00019019566,0.0000027389765,0.000014657198,0.00010108055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989137,0.00009208666,0.00024303597,0.00022067512,0.00012792664,0.00040257326],"domain_scores_gemma":[0.9979383,0.00055628084,0.000086730106,0.0011444613,0.000104233106,0.00017002436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041087667,0.0001592354,0.00014067742,0.00013232595,0.0012118511,0.00016750056,0.0007031318,0.00008204195,0.000007796094],"category_scores_gemma":[0.000008829376,0.00016543269,0.00007282053,0.00040078195,0.00008215882,0.000887722,0.000014598987,0.00027032828,0.000015685173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074090975,0.0006912459,0.000075574,0.00006185591,0.000115087656,2.9455848e-7,0.001126058,0.109912604,0.0077996585,0.0023013488,0.00032148958,0.8775207],"study_design_scores_gemma":[0.00039345247,0.00013778359,0.0002458207,0.000016247359,0.00003086626,0.000021173362,0.000048001584,0.9800295,0.014643209,0.00008242777,0.0041142944,0.00023719578],"about_ca_topic_score_codex":0.000021909203,"about_ca_topic_score_gemma":0.0000054373113,"teacher_disagreement_score":0.8772835,"about_ca_system_score_codex":0.000071457805,"about_ca_system_score_gemma":0.00003471212,"threshold_uncertainty_score":0.93207014},"labels":[],"label_agreement":null},{"id":"W2044404558","doi":"10.1109/tcomm.2013.112513.130142","title":"Capacity-Achieving Distributions for the Discrete-Time Poisson Channel—Part I: General Properties and Numerical Techniques","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","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":"McMaster University","funders":"","keywords":"Poisson distribution; Channel capacity; Mathematics; Channel (broadcasting); Constraint (computer-aided design); Envelope (radar); Applied mathematics; Mathematical optimization; Topology (electrical circuits); Computer science; Statistics; Telecommunications; Geometry","score_opus":0.03614595243466399,"score_gpt":0.23625343763918244,"score_spread":0.20010748520451846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044404558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032488643,0.00035109103,0.9867586,0.007065384,0.00012095168,0.0005368224,0.00012092217,0.0012977805,0.000499617],"genre_scores_gemma":[0.9650746,0.0006532277,0.033081234,0.000046630146,0.000048487924,0.0009369981,0.000013198686,0.000035225796,0.00011040556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923354,0.000062009196,0.00022292759,0.00014765128,0.00008380633,0.000250062],"domain_scores_gemma":[0.9982904,0.0004927423,0.000025808884,0.0010877773,0.00004958713,0.000053650157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017619912,0.0001701793,0.00017260855,0.00006371003,0.00085245114,0.000076891505,0.0005482245,0.00011295344,0.0000075079975],"category_scores_gemma":[0.000033782882,0.00013000697,0.00008508237,0.0002157217,0.0003776009,0.00013083078,0.000011278386,0.00041964056,0.000012166985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012134655,0.0012116071,0.000045032124,0.0003503282,0.0011829116,4.7292744e-7,0.0016808311,0.26754263,0.06137247,0.108639136,0.010021729,0.5478315],"study_design_scores_gemma":[0.00013716062,0.00011765867,0.00006415159,0.0000730115,0.00010006272,0.0000075663315,0.000058008773,0.94383967,0.018213928,0.0011462672,0.035960544,0.00028198422],"about_ca_topic_score_codex":0.000020522624,"about_ca_topic_score_gemma":0.000024997196,"teacher_disagreement_score":0.9618257,"about_ca_system_score_codex":0.000059855007,"about_ca_system_score_gemma":0.0000067391093,"threshold_uncertainty_score":0.65564513},"labels":[],"label_agreement":null},{"id":"W2044607510","doi":"10.1109/tcomm.2005.861668","title":"Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University; University of Ottawa","funders":"","keywords":"Low-density parity-check code; Decoding methods; Algorithm; Asynchronous communication; Successive over-relaxation; Belief propagation; Relaxation (psychology); Mathematics; Computer science; Iterative method; Gaussian; Telecommunications","score_opus":0.024923408748593487,"score_gpt":0.2895366205965194,"score_spread":0.2646132118479259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044607510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1332174,0.00004062889,0.8652984,0.00050984335,0.00005309313,0.0002135661,0.00005689341,0.00019511116,0.00041506006],"genre_scores_gemma":[0.8177111,0.00013064098,0.18194187,0.000034201963,0.0000034771945,0.000070094226,0.000019145451,0.0000075285416,0.00008192578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989824,0.000111811685,0.00035331532,0.00025925282,0.0001290987,0.00016411385],"domain_scores_gemma":[0.99729896,0.0007396919,0.00017313988,0.0014804233,0.00026873252,0.000039044542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035361483,0.00013771013,0.00028081154,0.0004946687,0.0005988305,0.00007482796,0.0008883109,0.00007546888,0.0000020991229],"category_scores_gemma":[0.000012235359,0.00015016564,0.00014996745,0.0011970106,0.00016332931,0.00033773654,0.000018279725,0.00023371476,8.9526014e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027894494,0.0064620525,0.0659586,0.0005325764,0.004545782,0.0000034374482,0.012933849,0.11608964,0.017056221,0.38429642,0.0005517309,0.39129075],"study_design_scores_gemma":[0.00012189414,0.00008706192,0.0074045034,0.000038316695,0.00023653166,0.0000025975398,0.000043754797,0.97614014,0.014549589,0.0012107868,0.000013046162,0.00015180594],"about_ca_topic_score_codex":0.00034933758,"about_ca_topic_score_gemma":0.0072406144,"teacher_disagreement_score":0.86005044,"about_ca_system_score_codex":0.00010655779,"about_ca_system_score_gemma":0.000040963467,"threshold_uncertainty_score":0.6123577},"labels":[],"label_agreement":null},{"id":"W2044733806","doi":"10.1109/tcomm.2006.885072","title":"An Analytical Expression for the BER of an Individually Optimal Single Cochannel Interferer BPSK Receiver","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Phase-shift keying; Additive white Gaussian noise; Bit error rate; Interference (communication); Algorithm; Keying; Electronic engineering; Computer science; Mathematics; Gaussian noise; Channel (broadcasting); Telecommunications; Decoding methods; Engineering","score_opus":0.05322844969051971,"score_gpt":0.3311402596869316,"score_spread":0.2779118099964119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044733806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019635174,0.00014408006,0.97822297,0.00021095853,0.0000961047,0.00045986043,0.00009705228,0.0004336979,0.0007000943],"genre_scores_gemma":[0.8832336,0.00023973378,0.11616015,0.00004417274,0.000015677666,0.00017815766,0.000036860434,0.00004986143,0.00004177761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892867,0.00009519759,0.00044341054,0.00015790181,0.0001586071,0.00021622035],"domain_scores_gemma":[0.9958667,0.00092376233,0.00008045607,0.0028426398,0.00018964864,0.000096767835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043383066,0.00017133521,0.00018210955,0.00020334155,0.00039243972,0.000032316733,0.0015600612,0.00013770536,0.000038203747],"category_scores_gemma":[0.000012250666,0.00015347173,0.000104944986,0.0002953405,0.0002633372,0.0004065503,0.000010509554,0.0004536398,0.000004327081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022429368,0.003060585,0.00001602832,0.000057896836,0.00028103235,3.970239e-7,0.0056716274,0.51312774,0.21750127,0.0031710297,0.00041739258,0.25647074],"study_design_scores_gemma":[0.0005259256,0.00043759216,0.000293436,0.00011422137,0.00010925909,0.0000050504605,0.0014245891,0.3817447,0.6104756,0.0005223367,0.003988701,0.00035859607],"about_ca_topic_score_codex":0.0000136845165,"about_ca_topic_score_gemma":0.00020042907,"teacher_disagreement_score":0.86359847,"about_ca_system_score_codex":0.00009073136,"about_ca_system_score_gemma":0.000017613234,"threshold_uncertainty_score":0.6258396},"labels":[],"label_agreement":null},{"id":"W2045408189","doi":"10.1109/tcomm.2014.010414.130440","title":"Generalized and Extended Subspace Algorithms for Error Correction with Quantized DFT Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Algorithm; Subspace topology; Computer science; Error detection and correction; Mathematics; Artificial intelligence","score_opus":0.03507357175845837,"score_gpt":0.3008096985111171,"score_spread":0.26573612675265873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045408189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031724272,0.00026496,0.9931032,0.0005991274,0.0001748017,0.0006201928,0.00004147208,0.0012817803,0.00074202335],"genre_scores_gemma":[0.7481381,0.001683204,0.24886964,0.000049239003,0.000010884846,0.00089531497,0.000029143093,0.000061035345,0.00026338932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999083,0.00013256047,0.0002731535,0.0001961109,0.00011171525,0.00020347096],"domain_scores_gemma":[0.9973319,0.00063177204,0.000070609756,0.0017405463,0.0001413923,0.00008373806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019702924,0.00021597724,0.00025582494,0.00018513072,0.00054738997,0.000048230835,0.00049850286,0.00010409355,0.000009874225],"category_scores_gemma":[0.000012169849,0.00021772525,0.0000673974,0.00027597134,0.00020294018,0.00021290706,0.000004827374,0.00033411823,0.000005773594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005418249,0.0013962302,0.00004320678,0.00024063588,0.00070023467,4.9392173e-7,0.0025948063,0.25287503,0.047469363,0.03501516,0.0027943726,0.6563286],"study_design_scores_gemma":[0.0014046964,0.00024232829,0.00012255099,0.00009660995,0.0000948294,0.000017789042,0.0001863487,0.922879,0.057565738,0.0016098637,0.01533161,0.00044863528],"about_ca_topic_score_codex":0.00004287346,"about_ca_topic_score_gemma":0.0006000287,"teacher_disagreement_score":0.74496573,"about_ca_system_score_codex":0.00007647044,"about_ca_system_score_gemma":0.000016995953,"threshold_uncertainty_score":0.8878578},"labels":[],"label_agreement":null},{"id":"W2051821457","doi":"10.1109/tcomm.2009.11.080460","title":"Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters]","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"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; Transmission (telecommunications); Channel (broadcasting); Rayleigh fading; Automatic repeat request; Computer network; Hybrid automatic repeat request; Algorithm; Real-time computing; Bitstream; Fading; Decoding methods; Telecommunications","score_opus":0.024948729394263604,"score_gpt":0.2998096858582066,"score_spread":0.274860956463943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051821457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028795572,0.000039871167,0.983444,0.0114485705,0.00013842498,0.0008940576,0.000036154936,0.00065794314,0.00046142066],"genre_scores_gemma":[0.7840021,0.0001590324,0.21490927,0.00042743149,0.000021221678,0.00021965445,0.000010549707,0.000026329877,0.00022437639],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998252,0.00014658795,0.00049983757,0.00042985496,0.00032667656,0.00034505167],"domain_scores_gemma":[0.99634427,0.00037545434,0.00022832271,0.002639229,0.000276671,0.00013607922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025623452,0.00028964563,0.00030094967,0.0006208731,0.00064481475,0.00009285452,0.0018347611,0.00013648493,0.000014934319],"category_scores_gemma":[0.000006544158,0.00028212208,0.00022432386,0.0013310687,0.0001618773,0.0006867434,0.0000035711746,0.00040420244,0.0000065781574],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019825685,0.0028678745,0.0000041918533,0.00006259629,0.00018317864,0.0000010015899,0.0058621564,0.049428023,0.14123248,0.009233628,0.00042656585,0.79050004],"study_design_scores_gemma":[0.002513512,0.0021424205,0.00027220606,0.00061583676,0.00023473751,0.000058194815,0.0002790216,0.4270261,0.5581499,0.005291618,0.002279469,0.0011370507],"about_ca_topic_score_codex":0.00025336668,"about_ca_topic_score_gemma":0.0001733837,"teacher_disagreement_score":0.789363,"about_ca_system_score_codex":0.000152116,"about_ca_system_score_gemma":0.00020330699,"threshold_uncertainty_score":0.9999631},"labels":[],"label_agreement":null},{"id":"W2052543119","doi":"10.1109/tcomm.2013.122013.130239","title":"Joint Optimization of Source Precoding and Relay Beamforming in Wireless MIMO Relay Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"MIMO; Beamforming; Precoding; Relay; Optimization problem; Computer science; Mathematical optimization; Telecommunications link; Convex optimization; Linear programming; Algorithm; Mathematics; Computer network; Power (physics); Telecommunications; Regular polygon","score_opus":0.034887186930708775,"score_gpt":0.2568818715504245,"score_spread":0.22199468461971575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052543119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004154762,0.00028573527,0.9923989,0.00139808,0.00011828862,0.0002371705,0.000001294861,0.00011376132,0.0012919889],"genre_scores_gemma":[0.89724874,0.004477174,0.09793336,0.00012568432,0.000008926642,0.00006506138,0.000004142865,0.000015456055,0.000121473095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984089,0.0004749113,0.00051902205,0.0002590762,0.00013666341,0.00020142099],"domain_scores_gemma":[0.99698913,0.00064255844,0.00018662584,0.0019790654,0.00012576002,0.000076851196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007299985,0.00015450566,0.00023651634,0.00029787686,0.000541378,0.00007843475,0.0011478299,0.00009830757,0.000010242686],"category_scores_gemma":[0.000024131552,0.00016768072,0.000066307584,0.0007892154,0.00014648981,0.00043855247,0.000053672356,0.0005101822,0.0000030496806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048703787,0.00015100263,0.00006606063,0.000007918421,0.000014215065,6.4924706e-8,0.0011015364,0.8797811,0.00036596047,0.007094982,0.000014848969,0.11139741],"study_design_scores_gemma":[0.0003568932,0.000054978573,0.00018010924,0.00017517727,0.000010439203,0.000005405417,0.000066867855,0.9973657,0.0008719482,0.000053833683,0.00069505913,0.00016355558],"about_ca_topic_score_codex":0.000031682335,"about_ca_topic_score_gemma":0.00028945933,"teacher_disagreement_score":0.89446557,"about_ca_system_score_codex":0.00007829381,"about_ca_system_score_gemma":0.000038878887,"threshold_uncertainty_score":0.6837821},"labels":[],"label_agreement":null},{"id":"W2052616361","doi":"10.1109/tcomm.2012.020912.110117","title":"A Constrained-Coding Alternative to MPPM","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Low-density parity-check code; Concatenated error correction code; Computer science; Algorithm; Decoding methods; Concatenation (mathematics); Lookup table; Coding gain; Encoder; Coding (social sciences); Block code; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.042518401239919366,"score_gpt":0.3052045463125458,"score_spread":0.26268614507262644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052616361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020764994,0.00026285832,0.97744334,0.00067685236,0.0002551574,0.00036696592,0.00006192642,0.0012940593,0.01756235],"genre_scores_gemma":[0.92238444,0.0010456755,0.07567675,0.00019741405,0.000026292233,0.00048144636,0.000007665239,0.00005057787,0.0001297386],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990749,0.00008453381,0.0002896313,0.000110668356,0.0001352479,0.0003050277],"domain_scores_gemma":[0.9972978,0.0003525153,0.000036862195,0.0020495818,0.00007432675,0.00018891707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016426333,0.00018187056,0.00016246436,0.0002666682,0.0003389538,0.00002793475,0.0009777764,0.000071046125,0.000075539116],"category_scores_gemma":[0.000010012053,0.00021206569,0.000079440964,0.00044928308,0.00011772216,0.00037499063,0.000009873703,0.00047805594,0.0002430039],"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.000035983063,0.0015127421,0.000078026096,0.00007175493,0.00044990354,0.0000010232615,0.011572497,0.25586763,0.0694709,0.05931278,0.0028645296,0.5987622],"study_design_scores_gemma":[0.0010315774,0.0001901193,0.00037567638,0.00042729644,0.00014171707,0.000062004,0.0027130393,0.14044894,0.72215134,0.002821698,0.12763542,0.002001177],"about_ca_topic_score_codex":0.000017514278,"about_ca_topic_score_gemma":0.00003824212,"teacher_disagreement_score":0.92030793,"about_ca_system_score_codex":0.00018612636,"about_ca_system_score_gemma":0.0000135309565,"threshold_uncertainty_score":0.86477876},"labels":[],"label_agreement":null},{"id":"W2052789880","doi":"10.1109/tcomm.2007.904371","title":"On Trellis Shaping for PAR Reduction in OFDM Systems","year":2007,"lang":"fr","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","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":"Trellis (graph); Orthogonal frequency-division multiplexing; Reduction (mathematics); Decoding methods; Computer science; Space–time trellis code; Metric (unit); Algorithm; Trellis modulation; Multiplexing; Electronic engineering; Frequency domain; Theoretical computer science; Mathematics; Telecommunications; Fading; Channel (broadcasting); Block code; Engineering; Concatenated error correction code","score_opus":0.0739426159092565,"score_gpt":0.3150851067858185,"score_spread":0.24114249087656203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052789880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009053454,0.0059639555,0.9539597,0.005600888,0.011694754,0.0016791851,0.00028571053,0.00046207933,0.011300292],"genre_scores_gemma":[0.97974885,0.003574105,0.010347544,0.00003863261,0.00025987823,0.00064986164,0.000032415417,0.0001253842,0.0052233343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976177,0.00019546352,0.0009437028,0.00038209924,0.00024701786,0.000613973],"domain_scores_gemma":[0.9963883,0.0010926065,0.0001427391,0.002042479,0.00015331956,0.00018052892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008967141,0.00036194886,0.00036543104,0.0008458845,0.0006509211,0.00009060139,0.0007082773,0.00040284506,0.00009296196],"category_scores_gemma":[0.000027623395,0.00048411585,0.00024721868,0.0010005945,0.00026936198,0.0003550112,0.0000033555175,0.0011013957,0.00027408358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011197301,0.0011552128,0.0000042957,0.00025813238,0.00019601388,0.00000185154,0.001990611,0.9196831,0.005656836,0.020566905,0.0030524908,0.047322556],"study_design_scores_gemma":[0.005792362,0.0010636775,0.0005738858,0.004750985,0.00071682845,0.00035525576,0.008457581,0.5671132,0.075928085,0.006341203,0.32611525,0.0027916252],"about_ca_topic_score_codex":0.0007795293,"about_ca_topic_score_gemma":0.00067694415,"teacher_disagreement_score":0.9706954,"about_ca_system_score_codex":0.0012704901,"about_ca_system_score_gemma":0.000080562895,"threshold_uncertainty_score":0.99976104},"labels":[],"label_agreement":null},{"id":"W2053730170","doi":"10.1109/tcomm.2005.852844","title":"Improvement and Analysis of Iterative Decision- Feedback Differential Demodulation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Demodulation; Fading; Computer science; Iterative method; Channel state information; Convergence (economics); Transmission (telecommunications); Channel (broadcasting); Bit error rate; Decoding methods; Algorithm; Differential (mechanical device); Control theory (sociology); Electronic engineering; Telecommunications; Wireless; Engineering; Artificial intelligence","score_opus":0.015640961499251427,"score_gpt":0.2758237968010049,"score_spread":0.26018283530175346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053730170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08187866,0.00019674234,0.9167271,0.00017801685,0.000034066485,0.0002033322,0.00008474633,0.00023861077,0.00045867538],"genre_scores_gemma":[0.92891026,0.002083178,0.06878218,0.000022015058,0.000004987365,0.000113024005,0.000032042557,0.000019350933,0.00003296755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918574,0.000046951016,0.00040144887,0.00012730838,0.00013112031,0.000107410895],"domain_scores_gemma":[0.99794793,0.0003481167,0.00007199322,0.0014807711,0.000099722274,0.00005148942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007115141,0.00013722437,0.00022735681,0.00047599856,0.00019786293,0.000022561737,0.0004269333,0.000070055496,0.000074351294],"category_scores_gemma":[0.000004015142,0.00014767131,0.00010675498,0.0006624252,0.00011592721,0.00022563266,0.000008537747,0.00022837521,0.000005494731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015761056,0.00026412617,0.000048476108,0.000010127632,0.0006421807,2.9746566e-8,0.00075024704,0.32600856,0.026303269,0.000990058,0.000031786265,0.64493537],"study_design_scores_gemma":[0.00029160272,0.000047472193,0.0030005083,0.000035993377,0.00037298826,5.57e-7,0.000072068324,0.9222331,0.07255278,0.00041663522,0.0007781801,0.00019810106],"about_ca_topic_score_codex":0.000011018771,"about_ca_topic_score_gemma":0.0002627812,"teacher_disagreement_score":0.847945,"about_ca_system_score_codex":0.00009522343,"about_ca_system_score_gemma":0.000007868608,"threshold_uncertainty_score":0.60218614},"labels":[],"label_agreement":null},{"id":"W2054159605","doi":"10.1109/tcomm.2012.010512.100630","title":"Multi-Hop Relaying over the Atmospheric Poisson Channel: Outage Analysis and Optimization","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University; University of Waterloo","funders":"","keywords":"Transmitter; Constraint (computer-aided design); Computer science; Channel (broadcasting); Channel state information; Poisson distribution; Minification; Hop (telecommunications); Power control; Power (physics); Mathematical optimization; Topology (electrical circuits); Electronic engineering; Telecommunications; Wireless; Mathematics; Engineering; Electrical engineering; Physics; Statistics","score_opus":0.027087660061652835,"score_gpt":0.262901073620197,"score_spread":0.23581341355854415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054159605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014774428,0.0019222785,0.98028,0.0011385075,0.0001346143,0.00025800907,0.000023183216,0.0009597696,0.0005092558],"genre_scores_gemma":[0.91884977,0.0059962333,0.074762665,0.000060180962,0.0000073543024,0.0001942574,0.00001237079,0.000037978753,0.00007916733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990735,0.000118741744,0.00029071228,0.00012658461,0.00012798795,0.0002624921],"domain_scores_gemma":[0.9970803,0.0004527604,0.00005605312,0.0022777533,0.000053107087,0.00008002049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022353356,0.00018125023,0.00019130355,0.00010833144,0.00065220677,0.00006664074,0.0008089024,0.00014286673,0.000054692897],"category_scores_gemma":[0.000020330108,0.00015869588,0.00011593907,0.0013019615,0.00023152998,0.0003428779,0.000020014326,0.00055869657,0.00002800113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031486102,0.00021987007,0.00030350618,0.000009826165,0.00043001998,5.2950828e-8,0.0010103661,0.9872848,0.0004229601,0.00039696178,0.000033047163,0.0098854825],"study_design_scores_gemma":[0.000176174,0.000011303233,0.0035786943,0.000013116675,0.00026157926,0.0000015349581,0.00056175014,0.9935722,0.0009714944,0.000021599595,0.00063325756,0.00019732471],"about_ca_topic_score_codex":0.000051919524,"about_ca_topic_score_gemma":0.00011743658,"teacher_disagreement_score":0.9055173,"about_ca_system_score_codex":0.000096123695,"about_ca_system_score_gemma":0.000006514709,"threshold_uncertainty_score":0.64714307},"labels":[],"label_agreement":null},{"id":"W2055044375","doi":"10.1109/tcomm.2013.111213.130235","title":"Physical-Layer Security with Multiuser Scheduling in Cognitive Radio Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":212,"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; Cognitive radio; Scheduling (production processes); Computer network; Quality of service; Rayleigh fading; Artificial noise; Fading; Physical layer; Base station; Mathematical optimization; Wireless; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.0255506041634968,"score_gpt":0.27381222421167173,"score_spread":0.24826162004817492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055044375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3157615,0.00036572176,0.6758244,0.0006139892,0.00006847944,0.0010727212,0.00002708289,0.0013183529,0.004947733],"genre_scores_gemma":[0.9885174,0.0010611844,0.00892399,0.00008142861,0.000016329264,0.0012797986,0.000019198678,0.00006786535,0.00003283098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.00016234386,0.00030956388,0.00020075709,0.00015867408,0.00029334778],"domain_scores_gemma":[0.99728495,0.0006072471,0.00005060668,0.0017944011,0.00016199776,0.00010080875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000119897515,0.00024724228,0.0002592056,0.00024825666,0.00025485212,0.00007941435,0.0008592561,0.00013019418,0.000087337394],"category_scores_gemma":[0.0000058610476,0.00025554377,0.000082154955,0.0006685426,0.0002141781,0.00048538813,0.000009929622,0.0011963825,0.00009233081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049890707,0.0027067713,0.00045610388,0.00006516497,0.00038423465,0.0000027151077,0.010834052,0.9395402,0.0038135569,0.0014101203,0.0004570324,0.04028015],"study_design_scores_gemma":[0.00063566375,0.00005056323,0.0006631508,0.00023158101,0.00003743992,0.0000055064897,0.00057828816,0.9863539,0.01029788,0.00044597313,0.00030503632,0.00039505234],"about_ca_topic_score_codex":0.0002593551,"about_ca_topic_score_gemma":0.0010313268,"teacher_disagreement_score":0.67275584,"about_ca_system_score_codex":0.00013742404,"about_ca_system_score_gemma":0.000023220704,"threshold_uncertainty_score":0.9999897},"labels":[],"label_agreement":null},{"id":"W2056207853","doi":"10.1109/tcomm.2015.2424416","title":"Update-Efficient Error-Correcting Product-Matrix Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","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":"McMaster University","funders":"National Science Council; Syracuse University","keywords":"Vandermonde matrix; Computer science; Decoding methods; Algorithm; Overhead (engineering); Fountain code; Error detection and correction; Encoding (memory); Encoder; Luby transform code; Hamming code; Node (physics); Concatenated error correction code; Block code; Reed–Solomon error correction; Engineering","score_opus":0.067804828299535,"score_gpt":0.3306793863381466,"score_spread":0.2628745580386116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056207853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015785227,0.0004571398,0.988247,0.0059367474,0.0006773419,0.0003151485,0.00003907357,0.0017225803,0.0010264445],"genre_scores_gemma":[0.728116,0.00007383524,0.27137062,0.00008581568,0.000010149844,0.00012063883,0.000007171111,0.000014484686,0.00020133439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849254,0.0001467427,0.00032440436,0.00042941768,0.00030039274,0.00030648045],"domain_scores_gemma":[0.99396384,0.0002609489,0.0001327809,0.005286043,0.0002370281,0.00011933371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040065075,0.00019298078,0.00018656248,0.0002923587,0.0006367551,0.00012453648,0.0037056906,0.00007134588,0.0000069283706],"category_scores_gemma":[0.00008866448,0.00019509418,0.000071167204,0.0011083174,0.00026386543,0.00056594773,0.000069008245,0.00058104534,0.00036065606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003900968,0.00253595,0.000036291567,0.000025668442,0.00013777812,0.000013160705,0.0046354476,0.41185188,0.002181383,0.07674233,0.0064462386,0.49535486],"study_design_scores_gemma":[0.0015687223,0.00035912008,0.000057392386,0.00014618233,0.00009338902,0.00028777274,0.0028787395,0.7900165,0.10751946,0.018326635,0.07716543,0.0015806505],"about_ca_topic_score_codex":0.000055603057,"about_ca_topic_score_gemma":0.000116387164,"teacher_disagreement_score":0.7265374,"about_ca_system_score_codex":0.00021420025,"about_ca_system_score_gemma":0.00015158513,"threshold_uncertainty_score":0.79557097},"labels":[],"label_agreement":null},{"id":"W2056404676","doi":"10.1109/tcomm.2014.2363116","title":"Two-Stage Spectrum Sharing With Combinatorial Auction and Stackelberg Game in Recall-Based Cognitive Radio Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":91,"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":"Stackelberg competition; Cognitive radio; Computer science; Frequency allocation; Resource allocation; Quality of service; Computer network; Game theory; Scheme (mathematics); Mathematical optimization; Telecommunications; Mathematics; Mathematical economics","score_opus":0.017977796026361414,"score_gpt":0.25389576806538255,"score_spread":0.23591797203902115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056404676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020821761,0.00008909821,0.97502077,0.0014330165,0.00036357573,0.00035846187,0.0000054413913,0.00018667418,0.0017212133],"genre_scores_gemma":[0.9942854,0.00018394293,0.0051228157,0.00018363696,0.00006679838,0.000052247684,0.00000830608,0.000027048143,0.00006978411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982905,0.0003337478,0.0003122024,0.0004920714,0.00020730334,0.0003642227],"domain_scores_gemma":[0.9976017,0.0008813541,0.00011925769,0.0011730245,0.0000927002,0.00013194789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045176529,0.00023311675,0.0002652687,0.00029328384,0.00050511776,0.00023377094,0.0006288044,0.000091650465,0.000011268707],"category_scores_gemma":[0.000010688751,0.00024041446,0.00006491209,0.0008250487,0.00022787409,0.00040053797,0.000016645285,0.0007593332,0.0000057689745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007325167,0.0022146252,0.0018562932,0.00004382376,0.0002865801,0.000030995063,0.0023563695,0.68754053,0.00019875671,0.13631698,0.00003411389,0.16838841],"study_design_scores_gemma":[0.00275738,0.00029456834,0.001713643,0.00020888342,0.000035594123,0.00002064272,0.000065257955,0.9922716,0.00047002974,0.0015459148,0.00029431563,0.00032218706],"about_ca_topic_score_codex":0.0003179228,"about_ca_topic_score_gemma":0.0037254281,"teacher_disagreement_score":0.97346365,"about_ca_system_score_codex":0.00014613169,"about_ca_system_score_gemma":0.00006322785,"threshold_uncertainty_score":0.9803817},"labels":[],"label_agreement":null},{"id":"W2057544104","doi":"10.1109/tcomm.2011.102011.090300","title":"EM-Based Adaptive Frequency Domain Estimation of Doppler Shifts with CRLB Analysis for CDMA Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Cramér–Rao bound; Code division multiple access; Computer science; Doppler effect; Algorithm; Upper and lower bounds; Electronic engineering; Frequency domain; Wireless; Spread spectrum; Estimation theory; Telecommunications; Engineering; Mathematics; Physics","score_opus":0.04737437104390624,"score_gpt":0.2645424523094379,"score_spread":0.21716808126553167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057544104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041992264,0.0002076441,0.99213094,0.000048759106,0.000045112898,0.00078839523,0.00024437212,0.0006005371,0.0017350232],"genre_scores_gemma":[0.62593746,0.0000824221,0.37284452,0.000007863386,0.0000020159682,0.0010406,0.00004169256,0.00003397698,0.000009446147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888706,0.000119394,0.0004833357,0.0001697864,0.00016176418,0.00017864569],"domain_scores_gemma":[0.99659365,0.00039114818,0.00016393857,0.0025442566,0.00024036322,0.00006660961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018154636,0.00020826922,0.00032814994,0.0005459955,0.00026383245,0.00001871813,0.00085379,0.00011047661,0.000026640422],"category_scores_gemma":[0.0000045244765,0.0002113311,0.00016459772,0.0010343854,0.00017476335,0.00024909846,0.0000031647185,0.00026795626,0.000005619294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007129635,0.00045229014,0.000052992997,0.00007507778,0.00083610206,2.1734446e-7,0.0017868046,0.9790597,0.0010451353,0.013076836,0.00002561578,0.0035179064],"study_design_scores_gemma":[0.0007787028,0.0003358064,0.0008519407,0.00018718018,0.0007464492,0.0000022930697,0.0009962334,0.96585596,0.02561708,0.004024346,0.00009568702,0.00050831446],"about_ca_topic_score_codex":0.00018995837,"about_ca_topic_score_gemma":0.0008148725,"teacher_disagreement_score":0.62173826,"about_ca_system_score_codex":0.00013916314,"about_ca_system_score_gemma":0.0000445811,"threshold_uncertainty_score":0.86178327},"labels":[],"label_agreement":null},{"id":"W2061432406","doi":"10.1109/tcomm.2006.881264","title":"Spectrally efficient differential space-time coding using non-full-diverse constellations","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":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; Decoding methods; Constellation; Algorithm; Computer science; Space–time code; Coding (social sciences); Transmit diversity; Antenna (radio); Differential (mechanical device); Block code; Electronic engineering; Mathematics; Telecommunications; Fading; Engineering; Channel (broadcasting)","score_opus":0.018748700152623306,"score_gpt":0.2514995930429355,"score_spread":0.2327508928903122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061432406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03809998,0.000091976406,0.9506516,0.00018520904,0.00018311934,0.0004928981,0.00011301865,0.0011187908,0.00906344],"genre_scores_gemma":[0.9472399,0.00032647344,0.051998153,0.0000152066905,0.000030019834,0.000077441,0.00004054246,0.000070295566,0.00020198939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865836,0.000096211144,0.00048335362,0.0002197088,0.00021765807,0.00032472535],"domain_scores_gemma":[0.9972422,0.0002890135,0.00009676438,0.0021780073,0.000118712196,0.00007528101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000961559,0.00028727567,0.00027508498,0.00037615636,0.000862295,0.00007666114,0.0008927872,0.00013768871,0.00021133966],"category_scores_gemma":[0.000002662896,0.00034599923,0.00017063656,0.00055758515,0.00028549426,0.00017590879,0.000014726991,0.0005704154,0.00015238252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009719183,0.0002612615,0.0000049307732,0.000012208248,0.000046351495,6.1099325e-7,0.00013322399,0.82118976,0.175734,0.0011948732,0.00020228134,0.0012107579],"study_design_scores_gemma":[0.00038202447,0.000025112045,0.00007563973,0.000080141435,0.00008042876,0.000014500987,0.00009530445,0.9082739,0.08955981,0.00019976385,0.00082272995,0.00039069107],"about_ca_topic_score_codex":0.00008417018,"about_ca_topic_score_gemma":0.00010231613,"teacher_disagreement_score":0.9091399,"about_ca_system_score_codex":0.00038512185,"about_ca_system_score_gemma":0.000043526226,"threshold_uncertainty_score":0.9998992},"labels":[],"label_agreement":null},{"id":"W2062402845","doi":"10.1109/tcomm.2014.020314.130448","title":"On Signal Detection in the Presence of Weakly Correlated Noise over Fading Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"McGill University","funders":"","keywords":"Fading; Cognitive radio; False alarm; Interference (communication); Detector; Noise (video); Computer science; Detection theory; Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Electronic engineering; Energy (signal processing); Statistics; Telecommunications; Mathematics; Artificial intelligence; Engineering; Wireless","score_opus":0.02110148743605466,"score_gpt":0.253279905763931,"score_spread":0.23217841832787633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062402845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03415619,0.000029246423,0.96210784,0.00094605534,0.0002659653,0.00022495206,0.0000025544482,0.000060982402,0.002206244],"genre_scores_gemma":[0.9987654,0.00007618629,0.00088309945,0.0001818069,0.000017076794,0.000029600662,9.35702e-7,0.0000082120705,0.000037660666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986838,0.00046848448,0.00025368624,0.00020190366,0.00021454609,0.00017756014],"domain_scores_gemma":[0.9967728,0.0017685748,0.000095927884,0.0012624001,0.00006539861,0.00003485001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045388663,0.00011502243,0.00013125193,0.00021791372,0.00040675286,0.00006987008,0.0009472907,0.00006305908,0.000010059059],"category_scores_gemma":[0.000018108527,0.0000983632,0.00008440771,0.0008313279,0.00010350605,0.00021363237,0.000007465217,0.00049836334,0.000013839087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008943566,0.0014593086,0.000032299435,0.000015742848,0.00007680071,0.0000031127124,0.008369958,0.47354603,0.015667442,0.036597926,0.00011845628,0.4640235],"study_design_scores_gemma":[0.00028924277,0.00018079572,0.00085139676,0.00010349843,0.000012922173,0.000010528429,0.000057761856,0.9876121,0.007998872,0.0025396273,0.00022268514,0.00012055171],"about_ca_topic_score_codex":0.00012859965,"about_ca_topic_score_gemma":0.00043676843,"teacher_disagreement_score":0.9646092,"about_ca_system_score_codex":0.00005067718,"about_ca_system_score_gemma":0.000021898393,"threshold_uncertainty_score":0.40111348},"labels":[],"label_agreement":null},{"id":"W2062920601","doi":"10.1109/tcomm.2014.2356581","title":"Tag Modulation Silencing: Design and Application in RFID Anti-Collision Protocols","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"RFID technology advancements","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Collision; Decoding methods; Inefficiency; Frame (networking); Metric (unit); Capture effect; Modulation (music); Limit (mathematics); Collision problem; Radio-frequency identification; Computer network; Throughput; Telecommunications; Computer security; Engineering; Wireless","score_opus":0.026825044013103972,"score_gpt":0.28283549431265365,"score_spread":0.25601045029954966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062920601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023110244,0.000026848626,0.97143465,0.00023198615,0.000040989686,0.0044626114,0.000004898962,0.00041421776,0.0002735413],"genre_scores_gemma":[0.9531101,0.00017337043,0.037064128,0.000020942569,0.0000049150212,0.009575313,0.0000065139166,0.000027675553,0.000017014225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991873,0.000098129975,0.000280798,0.00017902777,0.00009995261,0.00015480712],"domain_scores_gemma":[0.998519,0.00019022175,0.000044274704,0.0011703708,0.000038518952,0.000037623813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024611602,0.000134207,0.00014182966,0.0002751861,0.00021234898,0.000020978283,0.000357726,0.00012907705,0.000004329518],"category_scores_gemma":[0.000009100075,0.00015718344,0.000022447519,0.0004191668,0.00008556141,0.00023289716,0.0000039805177,0.00032322344,0.000029154458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006089651,0.00013462245,0.0001328455,0.000019668632,0.000010973231,7.575011e-8,0.0001283585,0.9088444,0.037571363,0.0006401905,0.000016767335,0.052494656],"study_design_scores_gemma":[0.00048025782,0.000047001897,0.0016643916,0.00006150341,0.000008638204,0.0000023397029,0.00002428466,0.94980866,0.045008685,0.0016820792,0.0010664458,0.0001456997],"about_ca_topic_score_codex":0.000015891774,"about_ca_topic_score_gemma":0.00006279344,"teacher_disagreement_score":0.9343705,"about_ca_system_score_codex":0.000108869615,"about_ca_system_score_gemma":0.000009987112,"threshold_uncertainty_score":0.6409755},"labels":[],"label_agreement":null},{"id":"W2063601473","doi":"10.1109/tcomm.2013.031213.120686","title":"Outage Analysis of Opportunistic Scheduling in Dual-Hop Multiuser Relay Networks in the Presence of Interference","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Outage probability; Scheduling (production processes); Computer science; Hop (telecommunications); Interference (communication); Upper and lower bounds; Co-channel interference; Topology (electrical circuits); Single antenna interference cancellation; Channel state information; Channel (broadcasting); Relay channel; Closed-form expression; Computer network; Control theory (sociology); Fading; Mathematics; Telecommunications; Mathematical optimization; Wireless","score_opus":0.08063186284505632,"score_gpt":0.3159307185270514,"score_spread":0.2352988556819951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063601473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04091654,0.00027713706,0.9557308,0.0019325106,0.00006485038,0.0003730712,0.0000066772973,0.000029009063,0.00066939386],"genre_scores_gemma":[0.9848911,0.0022373751,0.012508717,0.00012272649,0.0000022179308,0.00017616767,0.000006164248,0.0000059650515,0.00004953834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979709,0.0008070831,0.0006625254,0.00020922956,0.0001745854,0.00017568893],"domain_scores_gemma":[0.9944672,0.0018752506,0.00020329357,0.0032048007,0.00020739844,0.000042073563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075736124,0.00012717031,0.00028404142,0.00060374604,0.00017309785,0.00005850775,0.0024601542,0.000066093264,0.000047925198],"category_scores_gemma":[0.00005134362,0.00010863806,0.000121277415,0.0032559377,0.00021443065,0.00036941993,0.000054770622,0.000577797,0.0000060822367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010778623,0.0012581052,0.002082569,0.000012921969,0.00020847606,0.0000014407361,0.01231249,0.92353183,0.0016282761,0.019583784,0.000027419168,0.039341923],"study_design_scores_gemma":[0.00017876677,0.000033156637,0.009249214,0.000097332646,0.000045764413,0.0000010733138,0.0004807838,0.98953104,0.00015452491,0.00008733724,0.000039636907,0.000101362646],"about_ca_topic_score_codex":0.00030037976,"about_ca_topic_score_gemma":0.003144907,"teacher_disagreement_score":0.9439746,"about_ca_system_score_codex":0.00004379865,"about_ca_system_score_gemma":0.00005883886,"threshold_uncertainty_score":0.45716196},"labels":[],"label_agreement":null},{"id":"W2064875147","doi":"10.1109/tcomm.2014.050714.130586","title":"Distributed Collaborative Beamforming in the Presence of Angular Scattering","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Scattering; Beamforming; Monochromatic color; Channel (broadcasting); Topology (electrical circuits); Physics; Noise (video); Plane wave; Power (physics); Computer science; Mathematics; Optics; Telecommunications; Combinatorics; Quantum mechanics","score_opus":0.0236013063430094,"score_gpt":0.2512918874048781,"score_spread":0.22769058106186874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064875147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026280427,0.00009788417,0.971689,0.00046327847,0.00006711591,0.00020241558,0.000053182433,0.0000643279,0.0010823637],"genre_scores_gemma":[0.9937676,0.00021253197,0.005841747,0.00004052814,0.0000056321837,0.00009861292,0.0000138401565,0.0000114893655,0.000007983077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999345,0.00012110216,0.0002427367,0.00007502853,0.00010623673,0.00010988595],"domain_scores_gemma":[0.9987938,0.00029019912,0.00003261396,0.0007995954,0.00006099,0.000022823902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027042354,0.00008398128,0.00010325867,0.000107942964,0.0001510194,0.000019773124,0.00045562518,0.000037082198,0.000011069745],"category_scores_gemma":[0.000011523829,0.00007458503,0.000038776947,0.0004390721,0.000100840654,0.00010970614,0.000002623604,0.00022274042,0.0000065566473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006799089,0.00014887666,0.00001736284,0.000043919586,0.000035946043,1.638142e-7,0.0043926686,0.9343009,0.043808956,0.0004867074,0.00005883397,0.016698845],"study_design_scores_gemma":[0.00029586133,0.00003929073,0.00010237245,0.00010416813,0.000024860212,0.0000030443832,0.0015221626,0.89931244,0.09639648,0.00031893773,0.0017234781,0.00015692854],"about_ca_topic_score_codex":0.000035123343,"about_ca_topic_score_gemma":0.00023752954,"teacher_disagreement_score":0.9674872,"about_ca_system_score_codex":0.00003116111,"about_ca_system_score_gemma":0.000011519886,"threshold_uncertainty_score":0.3041489},"labels":[],"label_agreement":null},{"id":"W2065439483","doi":"10.1109/tcomm.2004.836559","title":"Accurate Simulation of Multiple Cross-Correlated Rician Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta; Queen's University","funders":"","keywords":"Rician fading; Autocorrelation; Fading; Computer science; Rayleigh fading; Fading distribution; Autoregressive model; Channel (broadcasting); Algorithm; Channel state information; Wireless; Electronic engineering; Mathematics; Statistics; Telecommunications; Engineering","score_opus":0.04097646254708521,"score_gpt":0.3210827001431497,"score_spread":0.2801062375960645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065439483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020465799,0.00022738433,0.9759887,0.00013179945,0.00020485416,0.00036800443,0.0000544805,0.0011251215,0.0014338972],"genre_scores_gemma":[0.98242277,0.0009261095,0.016320258,0.000024646328,0.000008298029,0.00016026582,0.00002637843,0.00005938464,0.000051861258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989279,0.000057518282,0.00052061945,0.00014670666,0.00014581138,0.0002014603],"domain_scores_gemma":[0.99713504,0.00046000793,0.00011698058,0.0020415264,0.00018187912,0.00006455365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012229025,0.00019285931,0.00021109563,0.00029623232,0.00038064786,0.000033909848,0.00090064737,0.00014914988,0.00002149811],"category_scores_gemma":[0.000020713254,0.00023018596,0.00011466768,0.0006547686,0.00018631996,0.00044567094,0.000008204979,0.00051210413,0.00004398206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008132857,0.00014034478,0.000009074932,0.000014695476,0.00003715821,1.4845288e-7,0.0005340126,0.98661685,0.0055712797,0.00035181467,0.00000284405,0.006713657],"study_design_scores_gemma":[0.0006333597,0.000042674194,0.00013721573,0.00013389421,0.00002498618,0.000002297155,0.000076870434,0.85527176,0.14105806,0.0014656354,0.0008848484,0.00026841104],"about_ca_topic_score_codex":0.00005515512,"about_ca_topic_score_gemma":0.00008703,"teacher_disagreement_score":0.961957,"about_ca_system_score_codex":0.00021083132,"about_ca_system_score_gemma":0.000026382955,"threshold_uncertainty_score":0.9386711},"labels":[],"label_agreement":null},{"id":"W2065913119","doi":"10.1109/tcomm.2012.040212.100193","title":"Power Allocation Strategies across N Orthogonal Channels at Both Source and Relay","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Computer science; Power (physics); Wireless; Computer network; Telecommunications","score_opus":0.05007567618113382,"score_gpt":0.3140893679192075,"score_spread":0.26401369173807365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065913119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026808139,0.0017174443,0.9636165,0.003970053,0.00035985388,0.00024362338,0.000009602985,0.00028414585,0.0029906256],"genre_scores_gemma":[0.9862274,0.0028016581,0.009018119,0.00042176023,0.000023684759,0.00013134409,0.000008661243,0.000018849589,0.0013485091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985424,0.0003373842,0.00030434714,0.00024695735,0.0001988725,0.0003700019],"domain_scores_gemma":[0.99678105,0.00040177765,0.00010723647,0.002403012,0.00012585049,0.00018109499],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005160398,0.00019230109,0.000157727,0.00010356372,0.0018487355,0.00026020824,0.0013920218,0.00009424484,0.00006822489],"category_scores_gemma":[0.000008285629,0.00019678863,0.00007680775,0.0004924772,0.00023767084,0.0012034344,0.000088847795,0.00041429675,0.000109923305],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101489204,0.0040349984,0.0011352808,0.000052184256,0.0005194615,0.0000015058804,0.113684505,0.03944115,0.020131193,0.4172323,0.0034924296,0.4001735],"study_design_scores_gemma":[0.0035076523,0.0006395514,0.02214865,0.00037893857,0.00013069021,0.0003492379,0.0067609157,0.4131653,0.014673138,0.0019127524,0.5331149,0.00321824],"about_ca_topic_score_codex":0.000009475801,"about_ca_topic_score_gemma":0.00017214147,"teacher_disagreement_score":0.95941925,"about_ca_system_score_codex":0.00011151225,"about_ca_system_score_gemma":0.000057703666,"threshold_uncertainty_score":0.99945074},"labels":[],"label_agreement":null},{"id":"W2067125863","doi":"10.1109/tcomm.2014.2336245","title":"Source–Channel Communication Over Phase-Incoherent Multiuser Channels","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Channel (broadcasting); Computer science; Context (archaeology); Interference (communication); Relay; Coding (social sciences); Cognitive radio; Asynchronous communication; Topology (electrical circuits); Algorithm; Theoretical computer science; Wireless; Mathematics; Telecommunications; Physics; Statistics; Combinatorics","score_opus":0.05591394083249561,"score_gpt":0.31878063408418217,"score_spread":0.26286669325168655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067125863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012332859,0.0004574526,0.9854069,0.006986345,0.000421958,0.000472372,0.000008721495,0.00063183426,0.004381172],"genre_scores_gemma":[0.9768043,0.0026433412,0.017532013,0.0011594631,0.00003777004,0.00038074367,0.000023975566,0.00003918036,0.0013791799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723965,0.0010602938,0.0005648111,0.00043146504,0.00032938365,0.00037437488],"domain_scores_gemma":[0.9909695,0.00092266,0.00021136059,0.007408602,0.00028575643,0.00020213338],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00073004526,0.00031137228,0.00029928674,0.00031697404,0.0018521742,0.00031381677,0.005004467,0.00013697427,0.000117250725],"category_scores_gemma":[0.000028833898,0.00032662842,0.0002035608,0.0008883078,0.00023848437,0.0006863057,0.00010780411,0.0007926578,0.00029182006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050827406,0.0049542477,0.000016991637,0.000025194071,0.0002547084,4.1456073e-7,0.0077530025,0.04526935,0.002895921,0.065646656,0.0053494573,0.86778325],"study_design_scores_gemma":[0.0018075473,0.00017913627,0.0000593091,0.00011365821,0.000030179499,0.000007039478,0.00007712858,0.87774885,0.0032347161,0.0012988233,0.11496839,0.00047525045],"about_ca_topic_score_codex":0.000041272902,"about_ca_topic_score_gemma":0.00024490248,"teacher_disagreement_score":0.97557104,"about_ca_system_score_codex":0.00014455387,"about_ca_system_score_gemma":0.00006250066,"threshold_uncertainty_score":0.9999186},"labels":[],"label_agreement":null},{"id":"W2067303882","doi":"10.1109/tcomm.2012.051012.100285a","title":"Channel-Selective Multi-Cell Digital Predistorter for Multi-Carrier Transmitters","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Power Amplifier Design","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Predistortion; Intermodulation; Adjacent channel power ratio; Electronic engineering; Adjacent channel; Amplifier; Wideband; Computer science; Nonlinear distortion; Transmitter; Channel (broadcasting); Engineering; Telecommunications; CMOS","score_opus":0.05653248325612453,"score_gpt":0.2824551572268547,"score_spread":0.22592267397073018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067303882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002967427,0.00087720377,0.99521273,0.00008403894,0.0006768888,0.00080765533,0.00074920343,0.00052490825,0.00077064126],"genre_scores_gemma":[0.96194875,0.00017438205,0.035945002,0.00006394594,0.000037069596,0.0009808838,0.0000427929,0.00010493983,0.0007022581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893945,0.000037238708,0.00028993105,0.0001811642,0.00010681065,0.0004454072],"domain_scores_gemma":[0.9983598,0.00024698835,0.00003649989,0.0010878303,0.000077849654,0.00019104585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008546408,0.00025835153,0.00019454857,0.00015671963,0.00034813533,0.00003126411,0.00050537294,0.000121968995,0.000018553854],"category_scores_gemma":[0.000004181149,0.0002931484,0.00019053863,0.00022926209,0.00011520571,0.0006693684,0.0000020501727,0.00040433544,0.00006720318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004174678,0.015683424,0.00026994303,0.0006528752,0.0023973999,0.0000020751106,0.07721009,0.7497467,0.028671194,0.00022475532,0.019972391,0.104751706],"study_design_scores_gemma":[0.0068847155,0.00028609546,0.0005465823,0.00010837705,0.00046859006,0.00002581582,0.0018474282,0.8148716,0.07529494,0.0001386014,0.097379796,0.0021474194],"about_ca_topic_score_codex":0.0000049534196,"about_ca_topic_score_gemma":0.000023166402,"teacher_disagreement_score":0.961652,"about_ca_system_score_codex":0.0002213395,"about_ca_system_score_gemma":0.000022796705,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W2067709532","doi":"10.1109/26.957406","title":"Multiuser channel estimation for detection of cochannel signals","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Time division multiple access; Multiuser detection; Fading; Channel (broadcasting); Computer science; Key (lock); Context (archaeology); Electronic engineering; Interference (communication); Code division multiple access; Telecommunications; Engineering; Computer security","score_opus":0.03899073006356722,"score_gpt":0.29583215663037976,"score_spread":0.2568414265668125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067709532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027544813,0.00026671094,0.99457526,0.00021094398,0.0001327719,0.0006562952,0.00007260692,0.00080783485,0.00052309915],"genre_scores_gemma":[0.9534229,0.0022285702,0.043097083,0.000026647927,0.0000095315245,0.0010488647,0.000024102821,0.000053791344,0.000088521054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911225,0.00005839613,0.00041523742,0.00012852659,0.00011550268,0.00017011524],"domain_scores_gemma":[0.99758935,0.0004665217,0.000095354306,0.0015953232,0.00020010627,0.000053343592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001580082,0.00016403936,0.00019699508,0.0002832915,0.00029987545,0.000014701875,0.0006284909,0.00011845488,0.000013789936],"category_scores_gemma":[0.000014643301,0.00019525512,0.00012211503,0.00041689412,0.00010877917,0.00026861802,0.0000039562515,0.0002505282,0.000014140929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003553492,0.00027919022,8.116438e-7,0.00005111249,0.0000690485,6.997677e-8,0.00043301148,0.77760565,0.1046542,0.0002855779,0.00005333494,0.11653247],"study_design_scores_gemma":[0.00026883473,0.0000606471,0.00001443843,0.00005196306,0.000026656768,0.0000033145466,0.00008634179,0.6277841,0.36888444,0.0015045364,0.0011668742,0.00014791],"about_ca_topic_score_codex":0.00002265044,"about_ca_topic_score_gemma":0.00011889625,"teacher_disagreement_score":0.9514782,"about_ca_system_score_codex":0.00010106462,"about_ca_system_score_gemma":0.000013063768,"threshold_uncertainty_score":0.7962273},"labels":[],"label_agreement":null},{"id":"W2070061930","doi":"10.1109/tcomm.2012.061112.11-551","title":"Exact Analysis of Dual-Hop AF Maximum End-to-End SNR Relay Selection","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Nakagami distribution; Rayleigh fading; Rician fading; Channel state information; Computer science; Diversity gain; Selection (genetic algorithm); Fading; Hop (telecommunications); Signal-to-noise ratio (imaging); Topology (electrical circuits); Probability density function; Maximal-ratio combining; Cumulative distribution function; Mathematics; Channel (broadcasting); Telecommunications; Wireless; Statistics; Physics","score_opus":0.05600481566002874,"score_gpt":0.3132762628461942,"score_spread":0.25727144718616546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070061930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077730953,0.0004611564,0.9830225,0.0037571518,0.00028536594,0.0002921248,0.000027424603,0.00023338411,0.004147767],"genre_scores_gemma":[0.9565371,0.0015586041,0.040844996,0.00033964516,0.00002103743,0.00013884128,0.000017371915,0.000017747296,0.0005246241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785805,0.00063111034,0.0005450792,0.000288279,0.00032112177,0.0003563598],"domain_scores_gemma":[0.99494743,0.00072586327,0.00018518382,0.0035970807,0.00031708108,0.00022733235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007619682,0.00021186522,0.00033906993,0.0010344605,0.0008701241,0.0000872514,0.0018474612,0.00009963215,0.00035325493],"category_scores_gemma":[0.000024080584,0.00022498361,0.00027960568,0.0051988605,0.00012582185,0.0006885039,0.00005620532,0.00050745317,0.0001325966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008871251,0.006438154,0.002154099,0.000033105043,0.004579202,9.54962e-7,0.024127265,0.18719247,0.043785304,0.08671618,0.0031101054,0.6417745],"study_design_scores_gemma":[0.0013852898,0.00053834356,0.032197706,0.00017661513,0.0022332957,0.000038489143,0.0006566245,0.7885626,0.048096087,0.0003769187,0.12395058,0.0017874767],"about_ca_topic_score_codex":0.00007000975,"about_ca_topic_score_gemma":0.0008366988,"teacher_disagreement_score":0.948764,"about_ca_system_score_codex":0.00017318841,"about_ca_system_score_gemma":0.00008402941,"threshold_uncertainty_score":0.9174565},"labels":[],"label_agreement":null},{"id":"W2070394551","doi":"10.1109/tcomm.2009.12.080396","title":"Bit-interleaved coded modulation for hybrid RF/FSO systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Computer science; Electronic engineering; Radio frequency; Transmitter; Hybrid system; Fading; Code (set theory); Modulation (music); Bit error rate; Channel (broadcasting); Communications system; Telecommunications; Engineering; Physics","score_opus":0.03391046944717376,"score_gpt":0.26744762139241707,"score_spread":0.2335371519452433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070394551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007672944,0.00071826956,0.9827287,0.002400748,0.00034120673,0.0008160258,0.00013306635,0.0024527167,0.0027362953],"genre_scores_gemma":[0.98279715,0.0014206902,0.01493879,0.00006217985,0.000015295209,0.0004911341,0.000051361425,0.000043702283,0.00017970348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887365,0.00005831835,0.0004695853,0.0001868766,0.000143713,0.00026788155],"domain_scores_gemma":[0.9964065,0.00045012782,0.00006326523,0.0028515044,0.0001543671,0.00007426113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001538216,0.00021828937,0.00025040415,0.00027384132,0.00043919028,0.00009747338,0.0012566017,0.00013633147,0.000012301603],"category_scores_gemma":[0.000019728559,0.00024307343,0.00014170262,0.0003396172,0.00012780688,0.00023485771,0.0000048953743,0.00045325715,0.00007814512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049398062,0.00077134307,0.0000032611185,0.00007527442,0.00020295806,5.1230654e-7,0.00030926886,0.63587177,0.024583818,0.022079758,0.0019634543,0.31408918],"study_design_scores_gemma":[0.0005094261,0.00013162538,0.00008159924,0.00008646089,0.000036699705,0.000006678376,0.00016923755,0.96536857,0.023642771,0.0029530642,0.0066942484,0.0003196347],"about_ca_topic_score_codex":0.000011614796,"about_ca_topic_score_gemma":0.000029941364,"teacher_disagreement_score":0.9751242,"about_ca_system_score_codex":0.00018547077,"about_ca_system_score_gemma":0.000018769339,"threshold_uncertainty_score":0.9912247},"labels":[],"label_agreement":null},{"id":"W2072132013","doi":"10.1109/tcomm.2013.070213.120264","title":"Distributed Joint Source-Channel Coding Using Unequal Error Protection LDPC Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Manitoba","funders":"","keywords":"Low-density parity-check code; Code word; Algorithm; Computer science; Distributed source coding; Channel (broadcasting); Binary symmetric channel; Turbo code; Binary number; Theoretical computer science; Decoding methods; Forward error correction; Variable-length code; Source code; Error detection and correction; Mathematics; Telecommunications; Arithmetic","score_opus":0.12038957945736296,"score_gpt":0.3059059524873597,"score_spread":0.18551637302999674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072132013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006963098,0.000032246797,0.9871811,0.0024470482,0.00037685252,0.0009040858,0.000024305433,0.0017450941,0.0003261243],"genre_scores_gemma":[0.9045299,0.000035534613,0.09465093,0.000109649685,0.000018554909,0.0005111089,0.000007366872,0.000031840613,0.00010510949],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805266,0.00036819797,0.0004963642,0.00041246007,0.00029166308,0.00037868536],"domain_scores_gemma":[0.99638903,0.00024933318,0.00022665423,0.002687484,0.0003108846,0.00013661306],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00038846306,0.00025839423,0.0002491797,0.0003612815,0.001386821,0.00028821515,0.0016962332,0.000151604,0.00002914939],"category_scores_gemma":[0.000030165684,0.00027733855,0.0001672522,0.00096830964,0.00016517562,0.00084811274,0.00004210693,0.0007628537,0.00012252653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056386012,0.0050286874,0.000062637664,0.00020561967,0.00058313867,0.0000068936283,0.014920521,0.30331358,0.34534773,0.011141585,0.0023006266,0.31703258],"study_design_scores_gemma":[0.00020093174,0.00011424547,0.00007287542,0.00013042001,0.000028584449,0.00003339876,0.00026309513,0.9537328,0.042420775,0.0022028629,0.0004436559,0.0003563726],"about_ca_topic_score_codex":0.001763672,"about_ca_topic_score_gemma":0.00027767298,"teacher_disagreement_score":0.8975668,"about_ca_system_score_codex":0.00032323773,"about_ca_system_score_gemma":0.000095889365,"threshold_uncertainty_score":0.9999679},"labels":[],"label_agreement":null},{"id":"W2072734326","doi":"10.1109/tcomm.2011.063011.100706","title":"Multilevel Coding with General Decoding Metrics and Rateless Transmission","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Decoding methods; Algorithm; Code rate; MIMO; Coding (social sciences); Fading; Transmission (telecommunications); Channel (broadcasting); Telecommunications; Mathematics; Statistics","score_opus":0.06360568148206715,"score_gpt":0.27028891310012526,"score_spread":0.20668323161805813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072734326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052995,0.0004792715,0.9872872,0.00009200014,0.000046082907,0.0002561727,0.000015265045,0.0008586635,0.0056658275],"genre_scores_gemma":[0.74614984,0.006954327,0.24659453,0.000024783578,0.0000041492544,0.00014309055,0.0000048103802,0.000046406996,0.00007804065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991482,0.00008299158,0.00029008155,0.0001674899,0.000117408614,0.00019385805],"domain_scores_gemma":[0.9981457,0.00024424953,0.000050314335,0.0013666714,0.000085674204,0.00010741512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001277524,0.00020510984,0.00019598928,0.00034205188,0.00048584744,0.000023558492,0.00065732864,0.00009459492,0.00005300149],"category_scores_gemma":[0.0000030666563,0.00019505256,0.00003941869,0.00045905588,0.0002214044,0.00030224663,0.0000057214033,0.00045667408,0.0000068781037],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000647319,0.0004048226,0.00007733416,0.00010064231,0.00019001329,0.0000025002373,0.0060284236,0.019753344,0.028622814,0.010071316,0.00011773601,0.9345663],"study_design_scores_gemma":[0.0011174132,0.00019398307,0.0005622015,0.00035536633,0.00012434743,0.000044131404,0.000557288,0.67011416,0.31871212,0.0014970297,0.0058243917,0.00089754316],"about_ca_topic_score_codex":0.000048063874,"about_ca_topic_score_gemma":0.00006127994,"teacher_disagreement_score":0.9336688,"about_ca_system_score_codex":0.00007947729,"about_ca_system_score_gemma":0.000013714086,"threshold_uncertainty_score":0.7954012},"labels":[],"label_agreement":null},{"id":"W2072997002","doi":"10.1109/tcomm.2013.052013.120900","title":"Ergodic Capacity Analysis for Interference-Limited AF Multi-Hop Relaying Channels in Nakagami-m Fading","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Nakagami distribution; Ergodic theory; Topology (electrical circuits); Computer science; Interference (communication); Moment-generating function; Channel capacity; Co-channel interference; Mathematics; Telecommunications; Channel (broadcasting); Random variable; Statistics; Combinatorics; Mathematical analysis","score_opus":0.13684191084836556,"score_gpt":0.31659228402133416,"score_spread":0.1797503731729686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072997002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011908467,0.00019135104,0.98256284,0.0036576611,0.00023569675,0.0007410689,0.000015170676,0.0002371973,0.00045053603],"genre_scores_gemma":[0.924752,0.0010697587,0.07241576,0.00032076082,0.000009534324,0.0010752792,0.0000156507,0.000016881262,0.00032439636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998028,0.00046511737,0.0005743107,0.00041897676,0.00015095471,0.00036264877],"domain_scores_gemma":[0.9952267,0.001017061,0.00014958669,0.0031173758,0.00035889805,0.00013038918],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047125926,0.00023350242,0.00033839044,0.0009660623,0.0009567926,0.0002958688,0.0028559722,0.000117307194,0.00006900735],"category_scores_gemma":[0.00004585392,0.00024805425,0.0002616386,0.0028478934,0.00014139508,0.00080369134,0.000051750496,0.00063311023,0.00007634697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006744221,0.006150984,0.0026406278,0.00008248032,0.0025496124,0.0000018137813,0.047672644,0.3454095,0.024526363,0.04328506,0.0011274087,0.52648604],"study_design_scores_gemma":[0.00066540216,0.000057852598,0.0015460082,0.000083210834,0.00007087066,0.0000016603366,0.00024604882,0.9939936,0.0020658877,0.0002974993,0.00064712256,0.00032485274],"about_ca_topic_score_codex":0.00021246367,"about_ca_topic_score_gemma":0.0022142646,"teacher_disagreement_score":0.9128435,"about_ca_system_score_codex":0.00021958166,"about_ca_system_score_gemma":0.000059115573,"threshold_uncertainty_score":0.9999972},"labels":[],"label_agreement":null},{"id":"W2073833448","doi":"10.1109/tcomm.2007.910687","title":"Explicit Analytical Expressions for Outage and Error Rate of Diversity Cellular Systems in the Presence of Multiple Interferers and Correlated Rayleigh Fading","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Nortel (Canada)","funders":"","keywords":"Rayleigh fading; Phase-shift keying; Maximal-ratio combining; Fading; Interference (communication); Mathematics; Signal-to-noise ratio (imaging); Statistics; Bit error rate; Diversity combining; Fading distribution; Electronic engineering; Telecommunications; Algorithm; Computer science; Engineering; Decoding methods","score_opus":0.06046028086385841,"score_gpt":0.29662459081188003,"score_spread":0.23616430994802162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073833448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20554227,0.0004108352,0.79319483,0.00006761889,0.00003615431,0.00050687446,0.000056084413,0.000069967864,0.0001153442],"genre_scores_gemma":[0.9948848,0.00061626,0.0043721865,0.000006003299,0.0000016057744,0.00008539113,0.0000059879812,0.000013489183,0.0000142624995],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999225,0.0001212187,0.00036183922,0.00010239071,0.00007111039,0.00011843401],"domain_scores_gemma":[0.9966583,0.0021938677,0.00007999906,0.0009605859,0.000068688314,0.000038537677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004738444,0.00010436961,0.00018854307,0.00019795058,0.00024048626,0.000009850017,0.00057655707,0.000080030746,0.0000014101865],"category_scores_gemma":[0.000033635733,0.000095958916,0.000043482698,0.00025525913,0.00019806424,0.00013770824,0.000027148408,0.00029993057,2.0831723e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005324379,0.0017845928,0.0042495546,0.00093087176,0.000507919,0.0000031365119,0.055938985,0.36024302,0.5391843,0.018298483,0.00018835254,0.018138388],"study_design_scores_gemma":[0.00095105777,0.00010195919,0.0014471706,0.00046252398,0.00008934518,0.0000039442148,0.008997566,0.8818458,0.10523999,0.00039028132,0.0002217709,0.0002485914],"about_ca_topic_score_codex":0.00015727492,"about_ca_topic_score_gemma":0.0001699584,"teacher_disagreement_score":0.7893425,"about_ca_system_score_codex":0.000034456923,"about_ca_system_score_gemma":0.0000059766844,"threshold_uncertainty_score":0.3913091},"labels":[],"label_agreement":null},{"id":"W2074931698","doi":"10.1109/tcomm.2012.082812.110817","title":"LDGM-Based Multiple Description Coding for Finite Alphabet Sources","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","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":"Binary number; Mathematics; Algorithm; Coding (social sciences); Rate–distortion theory; Distortion (music); Upper and lower bounds; Rate distortion; Computer science; Statistics; Arithmetic; Bandwidth (computing); Telecommunications; Mathematical analysis","score_opus":0.08652453606989656,"score_gpt":0.2955598895495641,"score_spread":0.2090353534796675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074931698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000637801,0.00021906117,0.9962164,0.0014450559,0.00054962136,0.00033911908,0.00011694473,0.00027153073,0.00020442702],"genre_scores_gemma":[0.76459926,0.00006303077,0.23456827,0.0003192017,0.000030481902,0.00025255943,0.000035851237,0.000012895776,0.000118417716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895155,0.00012061155,0.00025006323,0.0002050618,0.0001680309,0.00030465526],"domain_scores_gemma":[0.9965918,0.0011244894,0.00009709288,0.0019512911,0.00010243367,0.00013287968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003235563,0.00014518619,0.0001325906,0.0001722366,0.0010812443,0.00014549436,0.0013849345,0.000076666984,0.000016445361],"category_scores_gemma":[0.000021688827,0.00014252837,0.00012206612,0.00030615536,0.00007561495,0.0009957822,0.00001558388,0.00022376842,0.00005548811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002522726,0.0113064,0.0021390114,0.00020226787,0.00038728394,0.000001241204,0.009546021,0.13807666,0.03411441,0.048114844,0.014454544,0.74140507],"study_design_scores_gemma":[0.00067683466,0.00007477072,0.00032908234,0.000053577576,0.000026318638,0.000002098657,0.00006423671,0.9301357,0.01213304,0.00029059875,0.055981312,0.00023241743],"about_ca_topic_score_codex":0.0000539368,"about_ca_topic_score_gemma":0.000049704413,"teacher_disagreement_score":0.79205906,"about_ca_system_score_codex":0.00006134636,"about_ca_system_score_gemma":0.00004506253,"threshold_uncertainty_score":0.83161664},"labels":[],"label_agreement":null},{"id":"W2075397399","doi":"10.1109/tcomm.2012.100812.110547","title":"Reliable Communication over Non-Binary Insertion/Deletion Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Decodes; Algorithm; Binary number; Additive white Gaussian noise; Sequence (biology); Redundancy (engineering); Computer science; Decoding methods; Binary code; Set (abstract data type); Theoretical computer science; Mathematics; White noise; Arithmetic; Telecommunications","score_opus":0.02976522417575794,"score_gpt":0.2859943577366687,"score_spread":0.25622913356091076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075397399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8219754,0.0016043208,0.16508888,0.0018496579,0.0006953006,0.0005659152,0.00003741237,0.00014129277,0.008041781],"genre_scores_gemma":[0.99346447,0.0012710559,0.0033380925,0.00052039145,0.00009558177,0.000115406016,0.00017725505,0.00002134704,0.0009964239],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989888,0.00016855904,0.00026339103,0.00019078782,0.00010779649,0.00028068112],"domain_scores_gemma":[0.9980189,0.000062350184,0.00009325625,0.001624091,0.00009407424,0.000107308224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000328396,0.00015862031,0.00012233447,0.0000725372,0.00067236996,0.000031957738,0.0006303025,0.00019135553,0.000059997106],"category_scores_gemma":[0.000011522127,0.00015104449,0.00012316306,0.00021338867,0.00014214839,0.00002391987,0.000026336786,0.00029253395,0.000096397394],"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.00029934483,0.0046813455,0.0026979316,0.00004458148,0.00029690284,5.572369e-7,0.00072278944,0.011823769,0.93640244,0.0013068542,0.012372699,0.02935077],"study_design_scores_gemma":[0.0032818145,0.0019005428,0.028353775,0.00031254307,0.00028879542,0.0000783904,0.0008304114,0.03115089,0.45178398,0.0008623432,0.4788736,0.0022828786],"about_ca_topic_score_codex":0.000054592696,"about_ca_topic_score_gemma":0.000022434071,"teacher_disagreement_score":0.48461846,"about_ca_system_score_codex":0.000038101145,"about_ca_system_score_gemma":0.000028176868,"threshold_uncertainty_score":0.6159415},"labels":[],"label_agreement":null},{"id":"W2075416647","doi":"10.1109/tcomm.2015.2409259","title":"Jitter-Robust Spectral Shaping in OFDM","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","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":"Jitter; Orthogonal frequency-division multiplexing; Electronic engineering; Computer science; Reduction (mathematics); Sampling (signal processing); Spectral efficiency; Control theory (sociology); Mathematics; Telecommunications; Engineering","score_opus":0.14120831588563065,"score_gpt":0.29446452635827197,"score_spread":0.15325621047264132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075416647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10017235,0.001128264,0.7815839,0.005463262,0.0031851656,0.0008136764,0.000084558895,0.0026095985,0.10495924],"genre_scores_gemma":[0.99071354,0.00028437242,0.008331633,0.000059947026,0.00003722688,0.00013096204,0.0000061126834,0.000039883522,0.00039629926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912745,0.0000695539,0.00028949292,0.00013651178,0.00014660333,0.00023041236],"domain_scores_gemma":[0.99850243,0.00009239373,0.000023109686,0.0012129039,0.000046381458,0.00012279105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016691086,0.00014506075,0.00014403323,0.00030627032,0.00012560285,0.000036872858,0.00057736115,0.00008350436,0.00007974224],"category_scores_gemma":[0.00000650355,0.00017629817,0.00006640062,0.00051900116,0.00009904187,0.00023526826,0.0000030310766,0.00055087096,0.0003009255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009924269,0.0002604065,0.000059835063,0.000014427475,0.00005017221,0.0000021028234,0.0016082549,0.98629665,0.0021948842,0.0005214984,0.0028966314,0.0060852366],"study_design_scores_gemma":[0.0043309135,0.00023398394,0.0027718411,0.0004262576,0.00014208708,0.0002042772,0.0046010283,0.84626395,0.042955063,0.0038321374,0.092195086,0.002043367],"about_ca_topic_score_codex":0.0000717487,"about_ca_topic_score_gemma":0.00045113088,"teacher_disagreement_score":0.8905412,"about_ca_system_score_codex":0.00031927865,"about_ca_system_score_gemma":0.00004285372,"threshold_uncertainty_score":0.7189231},"labels":[],"label_agreement":null},{"id":"W2076579100","doi":"10.1109/tcomm.2015.2411266","title":"Cognitive and Energy Harvesting-Based D2D Communication in Cellular Networks: Stochastic Geometry Modeling and Analysis","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":347,"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":"Telecommunications link; Stochastic geometry; Cognitive radio; Computer science; Energy harvesting; Computer network; Interference (communication); Transmitter; Cellular network; Channel (broadcasting); Stochastic geometry models of wireless networks; Wireless; Signal-to-interference-plus-noise ratio; Electronic engineering; Energy (signal processing); Radio resource management; Telecommunications; Wireless network; Engineering; Power (physics); Mathematics; Physics","score_opus":0.03234404328833789,"score_gpt":0.2432006864108595,"score_spread":0.21085664312252161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076579100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036706693,0.003214585,0.959128,0.000114677045,0.00006301594,0.00008870488,0.000018778263,0.00026133732,0.0004042038],"genre_scores_gemma":[0.9920892,0.0007908717,0.0067161047,0.000055487457,0.00001176969,0.00015856042,0.00008928398,0.000047769256,0.000040956147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987368,0.0002489643,0.00039174824,0.00022962021,0.00014482334,0.00024804467],"domain_scores_gemma":[0.9975955,0.0010119309,0.00005972246,0.0010306123,0.00012649517,0.00017577242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038542965,0.00022181789,0.0002908836,0.0006236477,0.00027422936,0.000091119975,0.00037566,0.00015747904,0.0000037291422],"category_scores_gemma":[0.00002644237,0.0002709278,0.000058579408,0.0013852314,0.00020156024,0.00021803172,0.000012468948,0.00056416466,0.0000014417727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009996875,0.00007672377,0.000108395674,0.000007677937,0.00013762541,5.651631e-7,0.00019078955,0.99198115,0.000018172934,0.00017711846,0.000003745737,0.007288011],"study_design_scores_gemma":[0.00052058365,0.000024767562,0.00012090247,0.00016468496,0.00029119517,0.000002211806,0.00020300294,0.9982212,0.000061494844,0.0001215378,0.000019757837,0.00024866025],"about_ca_topic_score_codex":0.00060758437,"about_ca_topic_score_gemma":0.003515066,"teacher_disagreement_score":0.9553825,"about_ca_system_score_codex":0.00010486057,"about_ca_system_score_gemma":0.00003323696,"threshold_uncertainty_score":0.9999743},"labels":[],"label_agreement":null},{"id":"W2077262688","doi":"10.1109/tcomm.2006.888584","title":"Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Decoding methods; Algorithm; Binary number; Computer science; Code (set theory); Discrete mathematics; Mathematics; Arithmetic","score_opus":0.0390375926743596,"score_gpt":0.3129934600301889,"score_spread":0.27395586735582933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077262688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056472942,0.00008657927,0.9405688,0.00051362935,0.00036523148,0.00028906908,0.000016734464,0.0005653257,0.0011216877],"genre_scores_gemma":[0.6789226,0.00011311443,0.3207502,0.00008826869,0.000008058245,0.0000209287,0.0000026242915,0.00001361996,0.0000806118],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981444,0.0002174305,0.0005936834,0.00038134347,0.00036978166,0.0002933998],"domain_scores_gemma":[0.9942519,0.001572474,0.00023055664,0.0034236747,0.00040601572,0.00011538632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012347715,0.00021087189,0.00029311524,0.00041373036,0.0007168492,0.000094251605,0.0023435454,0.00009786672,0.000013563526],"category_scores_gemma":[0.000060450737,0.00022824023,0.00019319665,0.0006570068,0.00022397659,0.00053284824,0.00004473422,0.00060783897,0.00003320197],"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.00023876654,0.0050681247,0.00091447006,0.00011371848,0.0003839657,0.000035262678,0.011550117,0.0031643007,0.124180935,0.05826888,0.0022695907,0.79381186],"study_design_scores_gemma":[0.00045995633,0.00021287547,0.0022601446,0.00039897586,0.000050455485,0.000068542206,0.00015959702,0.07134797,0.9099699,0.013669494,0.00090037356,0.0005016959],"about_ca_topic_score_codex":0.00013474179,"about_ca_topic_score_gemma":0.0005064646,"teacher_disagreement_score":0.79331017,"about_ca_system_score_codex":0.00016056368,"about_ca_system_score_gemma":0.0000840175,"threshold_uncertainty_score":0.93073666},"labels":[],"label_agreement":null},{"id":"W2079392607","doi":"10.1109/tcomm.2013.111613.130238","title":"Power Line Communications for Low-Voltage Power Grid Tomography","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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 British Columbia","funders":"","keywords":"Power-line communication; Smart grid; Automatic meter reading; Grid; Computer science; Context (archaeology); Ranging; Electronic engineering; Power (physics); Electrical engineering; Topology (electrical circuits); Engineering; Telecommunications; Wireless","score_opus":0.020963960393625657,"score_gpt":0.25707845306525745,"score_spread":0.2361144926716318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079392607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008628696,0.004598215,0.9240689,0.008426799,0.0016303868,0.0035174866,0.0014283125,0.0025730352,0.045128144],"genre_scores_gemma":[0.968825,0.0033239648,0.023636965,0.00036505397,0.000027381942,0.00293108,0.00016886178,0.00012333273,0.0005983947],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99820334,0.00012305519,0.0007271466,0.00027558487,0.0001941468,0.00047674982],"domain_scores_gemma":[0.9897796,0.0009362903,0.000098382625,0.00855565,0.00039141448,0.0002386586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025219272,0.00038283964,0.00034618663,0.00050085154,0.0010940481,0.00015499203,0.0034202966,0.00020481167,0.0005676987],"category_scores_gemma":[0.000019156978,0.00041627933,0.00039841508,0.0008924751,0.000401389,0.0005255732,0.000038151004,0.0008381786,0.00053094537],"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.0003113905,0.029303653,0.00041389253,0.00083122705,0.006611142,0.00000401096,0.015143235,0.121108934,0.19776465,0.0739542,0.3659903,0.18856336],"study_design_scores_gemma":[0.0033329905,0.00073373975,0.0014922044,0.00041827984,0.0003463344,0.00002892597,0.0014433825,0.2428279,0.018398305,0.004822854,0.7235387,0.002616402],"about_ca_topic_score_codex":0.00006338324,"about_ca_topic_score_gemma":0.0001968508,"teacher_disagreement_score":0.96019626,"about_ca_system_score_codex":0.00011562003,"about_ca_system_score_gemma":0.00005408115,"threshold_uncertainty_score":0.9998289},"labels":[],"label_agreement":null},{"id":"W2079624325","doi":"10.1109/tcomm.2015.2389833","title":"Analyzing the Impact of Inter Cooperation Region Interference in Coordinated Multi-Point Uplink Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Telecommunications link; Ergodic theory; Base station; Coverage probability; Interference (communication); Computer science; Cellular network; Topology (electrical circuits); Parametric statistics; Stochastic geometry; Point (geometry); Mathematical optimization; Lattice (music); Mathematics; Telecommunications; Statistics; Physics; Mathematical analysis; Combinatorics","score_opus":0.05572548228033818,"score_gpt":0.3052779985076034,"score_spread":0.2495525162272652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079624325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006495874,0.00026170447,0.9980058,0.00014303744,0.00016223709,0.00034924978,0.0000062753807,0.00013278113,0.00028929132],"genre_scores_gemma":[0.9962416,0.00036481948,0.00316785,0.0000052399123,0.000007933619,0.000105877894,0.000017716366,0.000028341734,0.00006061414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915504,0.00015382451,0.00042546733,0.00010014952,0.000021586968,0.00014392073],"domain_scores_gemma":[0.99848455,0.00015727119,0.000078995334,0.0010189316,0.00020668587,0.00005358339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002227919,0.00014464438,0.00017896993,0.00020551177,0.00009913809,0.000027196858,0.00044258713,0.00008838282,0.0000074863624],"category_scores_gemma":[0.000019419751,0.000118794596,0.0000789207,0.00068834954,0.00008834269,0.00028216443,0.0000053961676,0.00042244527,0.00000778923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016143966,0.00009005295,0.000110094734,0.000004254641,0.00003795444,1.7234018e-7,0.00093708024,0.99461883,0.000335167,0.00003013056,0.00010002901,0.0037201068],"study_design_scores_gemma":[0.0004427121,0.000056604687,0.000030765466,0.000113617614,0.000015350633,0.0000056393674,0.00029387695,0.9982067,0.0006966039,0.000023394721,0.000003437063,0.00011132962],"about_ca_topic_score_codex":0.0002740848,"about_ca_topic_score_gemma":0.0006993539,"teacher_disagreement_score":0.995592,"about_ca_system_score_codex":0.00032542917,"about_ca_system_score_gemma":0.000035943554,"threshold_uncertainty_score":0.48443028},"labels":[],"label_agreement":null},{"id":"W2079882399","doi":"10.1109/tcomm.2012.010313.100669","title":"Relay Selection Schemes and Performance Analysis Approximations for Two-Way Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Computer science; Relay channel; Maximization; Block Error Rate; Cumulative distribution function; Signal-to-noise ratio (imaging); Overhead (engineering); Mathematical optimization; Computer network; Topology (electrical circuits); Mathematics; Telecommunications; Probability density function; Engineering; Statistics; Telecommunications link; Electrical engineering; Power (physics); Artificial intelligence","score_opus":0.036510521352791724,"score_gpt":0.28294165729959186,"score_spread":0.24643113594680013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079882399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005221313,0.0003367296,0.98972434,0.0029814898,0.00008997142,0.0006373026,0.0000052731343,0.00026147006,0.0007420885],"genre_scores_gemma":[0.8811407,0.0020085073,0.114872634,0.00024123891,0.00001532816,0.0010577418,0.000014609023,0.00001282273,0.0006364139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987668,0.000203489,0.00035253752,0.000311511,0.0001238273,0.00024184944],"domain_scores_gemma":[0.9969629,0.0005706403,0.00011898592,0.0018676714,0.00037162157,0.00010819597],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00031496852,0.0001743211,0.00020738017,0.0003930636,0.0017479575,0.00028992692,0.0012203918,0.000074052456,0.000054910677],"category_scores_gemma":[0.000011372595,0.00017796933,0.00013850085,0.0019010702,0.00013148347,0.00085873686,0.000028405086,0.0003724292,0.000028446024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014492711,0.00064318907,0.0005396167,0.000022592585,0.00081266905,4.4520416e-8,0.0012007087,0.32832408,0.00095117977,0.049011294,0.00070852914,0.6177716],"study_design_scores_gemma":[0.00031185322,0.00006968379,0.0012639299,0.000015717296,0.00010283922,0.0000030504816,0.000028608234,0.99441403,0.0005798057,0.0001330116,0.0028810434,0.00019640542],"about_ca_topic_score_codex":0.000023014956,"about_ca_topic_score_gemma":0.00023906925,"teacher_disagreement_score":0.8759194,"about_ca_system_score_codex":0.0000718893,"about_ca_system_score_gemma":0.00003840964,"threshold_uncertainty_score":0.99955165},"labels":[],"label_agreement":null},{"id":"W2080920551","doi":"10.1109/tcomm.2011.093011.100693","title":"Cognitive Base Stations in LTE/3GPP Femtocells: A Correlated Equilibrium Game-Theoretic Approach","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":129,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Macrocell; Femtocell; Base station; Telecommunications link; Cognitive radio; Computer science; Resource allocation; Node (physics); Game theory; Potential game; Frequency allocation; Computer network; Interference (communication); Mathematical optimization; Resource management (computing); LTE Advanced; Nash equilibrium; Wireless; Engineering; Telecommunications; Mathematics; Mathematical economics","score_opus":0.046166163700319104,"score_gpt":0.2544726297428994,"score_spread":0.2083064660425803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080920551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003933079,0.00023939017,0.96573234,0.000031428382,0.00022610079,0.0008691539,0.00015039941,0.0006166758,0.02820146],"genre_scores_gemma":[0.97410476,0.0003896523,0.02425489,0.000028602986,0.000007769883,0.0007537469,0.00009342237,0.00008984486,0.00027730674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985702,0.00020419108,0.0005288432,0.00025860337,0.00012662789,0.00031152662],"domain_scores_gemma":[0.9981379,0.0003456128,0.000077189245,0.0011817031,0.00014293013,0.00011469736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017652636,0.0002553099,0.00024129283,0.00045576144,0.00015736105,0.000028419965,0.0004910031,0.00015606708,0.0001633271],"category_scores_gemma":[0.000018803,0.00030364675,0.000089234854,0.0009821182,0.00021617052,0.0003928869,0.000005474622,0.0006312043,0.00017205185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006553894,0.0012020875,0.000049240916,0.00009083985,0.00013246207,0.000003515945,0.010355316,0.98116285,0.001281588,0.00186453,0.000061950304,0.0037300834],"study_design_scores_gemma":[0.0012752333,0.00007988307,0.0001362058,0.00019429394,0.00011780806,0.00001897313,0.002487541,0.9895277,0.0048085935,0.0007999374,0.000068026806,0.0004858237],"about_ca_topic_score_codex":0.00007518439,"about_ca_topic_score_gemma":0.00015831483,"teacher_disagreement_score":0.9701717,"about_ca_system_score_codex":0.00018404283,"about_ca_system_score_gemma":0.000049580427,"threshold_uncertainty_score":0.9999416},"labels":[],"label_agreement":null},{"id":"W2080932185","doi":"10.1109/tcomm.2011.122111.110057","title":"Node Switching Rates of Opportunistic Relaying and Switch-and-Examine Relaying in Rician and Nakagami-m Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Fading; Relay; Computer science; Nakagami distribution; Independent and identically distributed random variables; Rayleigh fading; Fading distribution; Channel (broadcasting); Electronic engineering; Computer network; Topology (electrical circuits); Mathematics; Engineering; Electrical engineering; Statistics; Physics; Power (physics)","score_opus":0.128837156170677,"score_gpt":0.3070029729815844,"score_spread":0.1781658168109074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080932185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08392206,0.0020105334,0.90885246,0.0013382842,0.00008635674,0.0002759558,0.0000046308287,0.00010317479,0.0034065417],"genre_scores_gemma":[0.9560262,0.00923113,0.034475368,0.00016701243,0.0000032264436,0.00004047413,0.0000014974546,0.000013652859,0.00004146434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987363,0.00026682974,0.0004346411,0.00027528938,0.000101988524,0.00018494537],"domain_scores_gemma":[0.99769413,0.0006912623,0.00014237582,0.001292394,0.000079603844,0.00010022749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055038306,0.00016116683,0.0002325582,0.00034435675,0.0006625844,0.00007064462,0.00076684443,0.00006805414,0.000006801443],"category_scores_gemma":[0.000032703043,0.00017128674,0.00003175402,0.0005225888,0.0001660383,0.00046111617,0.000078831414,0.00047805518,0.0000020138912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057319852,0.0010189003,0.009075074,0.0001284918,0.0001887911,0.000011150439,0.05546296,0.00056305475,0.029958947,0.13568,0.000026250458,0.76782906],"study_design_scores_gemma":[0.0023501741,0.0003274163,0.06566385,0.0014224299,0.00013326661,0.00013664768,0.0029794665,0.91299444,0.0067105037,0.005312797,0.0007739408,0.0011950718],"about_ca_topic_score_codex":0.00012161737,"about_ca_topic_score_gemma":0.0004161122,"teacher_disagreement_score":0.91243136,"about_ca_system_score_codex":0.00003853813,"about_ca_system_score_gemma":0.000041293824,"threshold_uncertainty_score":0.69848704},"labels":[],"label_agreement":null},{"id":"W2083983191","doi":"10.1109/tcomm.2006.876849","title":"A Low-Complexity Method for Fixed-Rate Entropy-Constrained Vector Quantization","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lagrange multiplier; Vector quantization; Mathematics; Mathematical optimization; Quantization (signal processing); Algorithm; Constraint algorithm; Entropy (arrow of time); Iterative method","score_opus":0.048746259002279614,"score_gpt":0.3404887353094802,"score_spread":0.29174247630720057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083983191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006663126,0.000040843388,0.99390996,0.003170244,0.00022717289,0.0007650062,0.0002853946,0.0009946565,0.0005401087],"genre_scores_gemma":[0.3092398,0.000048076727,0.6897493,0.00018881098,0.000020586287,0.00047535528,0.00007310969,0.000019702462,0.00018527595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982336,0.00036598823,0.00047722386,0.00044088968,0.00018350805,0.00029878158],"domain_scores_gemma":[0.9953487,0.0010178147,0.00020053666,0.0031063878,0.0002462504,0.0000803026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039243192,0.0002222479,0.00023441338,0.00024691515,0.0008658934,0.00014885433,0.0022312296,0.000100124875,0.00003055489],"category_scores_gemma":[0.00002436723,0.0002316142,0.00016255233,0.0006219757,0.0001825071,0.00070364773,0.00002545393,0.00029346737,0.000031273543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041674906,0.0016375614,0.0000048206684,0.000047619902,0.000049210015,0.0000011039865,0.00020556443,0.0113638565,0.10739473,0.7856089,0.002735806,0.09090917],"study_design_scores_gemma":[0.0008438413,0.00013142257,0.00017056453,0.00008101224,0.000038805985,0.000011928498,0.000023450031,0.61021423,0.29089522,0.082777135,0.014334561,0.00047785987],"about_ca_topic_score_codex":0.00013021461,"about_ca_topic_score_gemma":0.00020661269,"teacher_disagreement_score":0.70283175,"about_ca_system_score_codex":0.00010481237,"about_ca_system_score_gemma":0.00009465216,"threshold_uncertainty_score":0.9444953},"labels":[],"label_agreement":null},{"id":"W2084279706","doi":"10.1109/tcomm.2014.2347279","title":"DSL and PLC Co-Existence: An Interference Cancellation Approach","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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 Calgary","funders":"","keywords":"Digital subscriber line; Interference (communication); Single antenna interference cancellation; Electronic engineering; Computer science; Power-line communication; Channel (broadcasting); Common-mode signal; Computer network; Engineering; Telecommunications; Power (physics); Digital signal processing; Physics","score_opus":0.040061322930697675,"score_gpt":0.27900908022469106,"score_spread":0.2389477572939934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084279706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03177699,0.00038363953,0.91926736,0.00029346294,0.00016487467,0.00025751078,0.00003997936,0.00051452103,0.04730169],"genre_scores_gemma":[0.9827101,0.0012726791,0.015471944,0.000055470882,0.000017153758,0.00021063426,0.000042513377,0.000029731473,0.00018977206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991848,0.000143144,0.0002533249,0.00016586308,0.00009110681,0.0001617487],"domain_scores_gemma":[0.9974409,0.00017976177,0.000035287165,0.0021698491,0.0000594607,0.00011476646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020504117,0.0001562039,0.00014800951,0.00014784938,0.00046935672,0.00006611507,0.0007241181,0.00008328605,0.000034906927],"category_scores_gemma":[0.000004817918,0.00016952351,0.000041819218,0.00022402429,0.00018406082,0.00024221404,0.000005646714,0.00040733782,0.000031814117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114596456,0.0033713244,0.00031278218,0.0003586127,0.0004650751,5.961737e-7,0.03386584,0.24461614,0.018583992,0.027150571,0.0030464234,0.66811407],"study_design_scores_gemma":[0.00040543004,0.00010997076,0.0004722886,0.00004915722,0.000046981724,0.00001171416,0.00087395037,0.976535,0.0027209725,0.00052708434,0.01787137,0.00037604597],"about_ca_topic_score_codex":0.000047345868,"about_ca_topic_score_gemma":0.00018365,"teacher_disagreement_score":0.9509331,"about_ca_system_score_codex":0.000057444966,"about_ca_system_score_gemma":0.000018347215,"threshold_uncertainty_score":0.6912968},"labels":[],"label_agreement":null},{"id":"W2087905744","doi":"10.1109/tcomm.2014.012614.130747","title":"Towards Scalable Traffic Management in Cloud Data Centers","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","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":"Computer science; Cloud computing; Virtual LAN; Scalability; Distributed computing; Column generation; Heuristic; Computer network; Mathematical optimization; Database","score_opus":0.05188230002339097,"score_gpt":0.2857047275059596,"score_spread":0.23382242748256862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087905744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005633391,0.00011937319,0.9881333,0.004449342,0.00057636405,0.00023335865,0.000019276109,0.0002927943,0.005612818],"genre_scores_gemma":[0.9195455,0.0008944909,0.07862903,0.0005252661,0.00002162601,0.000079085556,0.000023255918,0.00001520709,0.00026658922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863744,0.0001971824,0.0002917964,0.0003933138,0.00020180046,0.00027847814],"domain_scores_gemma":[0.99374694,0.00023092447,0.00005335633,0.0058513777,0.00003107278,0.00008635933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044923616,0.00014301663,0.00015126509,0.00021195092,0.00033664255,0.00012406586,0.0047555584,0.00005959195,0.00001950509],"category_scores_gemma":[0.0000046646896,0.00014950617,0.00005649458,0.0007907812,0.00008123054,0.0004045499,0.00006951253,0.0003313239,0.0001167924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012453329,0.0010799553,0.00002246677,0.000017532268,0.000073389296,0.0000021657947,0.00042788987,0.08957998,0.000008989417,0.0186089,0.004561902,0.8856044],"study_design_scores_gemma":[0.00080750464,0.00006305122,0.0004893586,0.00008047929,0.00002938331,0.000006425899,0.000057299458,0.9217339,0.00005953248,0.0011522702,0.07523705,0.00028372783],"about_ca_topic_score_codex":0.00009425822,"about_ca_topic_score_gemma":0.0004897812,"teacher_disagreement_score":0.9189821,"about_ca_system_score_codex":0.00007057012,"about_ca_system_score_gemma":0.000030407256,"threshold_uncertainty_score":0.883709},"labels":[],"label_agreement":null},{"id":"W2088111058","doi":"10.1109/tcomm.2012.100512.120006","title":"Multi-Edge-Type Low-Density Parity-Check Codes for Bandwidth-Efficient Modulation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Computer science; Algorithm; Bit error rate; Modulation (music); Error detection and correction; Electronic engineering; Turbo code; Block code; Linear code; Bandwidth (computing); Theoretical computer science; Mathematics; Decoding methods; Telecommunications; Engineering","score_opus":0.07044379227568483,"score_gpt":0.33031192657691716,"score_spread":0.25986813430123235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088111058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013654782,0.000117528165,0.98236716,0.00093214994,0.0009643613,0.0006832278,0.000017667098,0.000978512,0.00028459894],"genre_scores_gemma":[0.7046185,0.000054391843,0.29483488,0.00011689633,0.000022125043,0.00016811377,0.000008500558,0.000018881885,0.00015768479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851584,0.00022122139,0.00035552456,0.00030878512,0.00021556663,0.0003830294],"domain_scores_gemma":[0.99588954,0.00066205626,0.00014103121,0.0028005454,0.00036077996,0.00014601696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006949436,0.00020525682,0.00020778262,0.00022129324,0.0010213241,0.00009617013,0.00152771,0.00014109825,0.000007983787],"category_scores_gemma":[0.00005489757,0.0002226327,0.00015507598,0.00061081845,0.000118350355,0.00053774694,0.000027070588,0.00041261673,0.000066656736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037251497,0.03551422,0.0036797607,0.0004337589,0.00081391365,0.000002524236,0.041196927,0.17659214,0.19371387,0.08651542,0.005859963,0.45530498],"study_design_scores_gemma":[0.00043859778,0.00010677451,0.002895538,0.00006286455,0.000046296493,0.000012001161,0.000082406994,0.9453574,0.048278768,0.00057309726,0.001749608,0.00039669135],"about_ca_topic_score_codex":0.00009511801,"about_ca_topic_score_gemma":0.00022322749,"teacher_disagreement_score":0.7687652,"about_ca_system_score_codex":0.00018318712,"about_ca_system_score_gemma":0.00007349673,"threshold_uncertainty_score":0.9078699},"labels":[],"label_agreement":null},{"id":"W2088219981","doi":"10.1109/tcomm.2013.021913.120620","title":"Diversity and Multiplexing for Near-Field Atmospheric Optical Communication","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"","keywords":"Multiplexing; Free-space optical communication; Electronic engineering; Computer science; Communications system; Antenna diversity; Crosstalk; Atmospheric turbulence; Optical communication; Diversity gain; Orthogonal frequency-division multiplexing; Field (mathematics); Telecommunications; Physics; Engineering; Mathematics; Turbulence; MIMO; Wireless","score_opus":0.027092420836269428,"score_gpt":0.24028600313595105,"score_spread":0.21319358229968163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088219981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118958645,0.0012231863,0.86840284,0.0055587133,0.00011343858,0.0010605484,0.000025081188,0.0016521079,0.0030054622],"genre_scores_gemma":[0.8472365,0.0023957682,0.1496131,0.000116711024,0.000003179126,0.0005466544,0.0000072900334,0.00002847752,0.000052325267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991925,0.0000524159,0.00027344536,0.00015227555,0.00010413243,0.00022525732],"domain_scores_gemma":[0.9959961,0.0015070593,0.000036492584,0.0022443726,0.00012472107,0.00009126148],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00011746033,0.00016999841,0.00018030887,0.000036927635,0.0030602084,0.00008248601,0.0011839821,0.000171855,0.000048570568],"category_scores_gemma":[0.00004287089,0.0001884378,0.00008029299,0.00025029137,0.0003638243,0.0003346115,0.00013489333,0.00051272014,0.000050326595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005658302,0.0011250735,0.0008237072,0.00019396555,0.0005211269,3.3093275e-7,0.004956779,0.05968732,0.0052323514,0.033603262,0.0024727308,0.8913268],"study_design_scores_gemma":[0.00067980355,0.00012291704,0.0015630104,0.00006776394,0.000048258902,0.000004400315,0.0007035803,0.97944224,0.008225716,0.0044098306,0.0043048877,0.00042759275],"about_ca_topic_score_codex":0.00011787148,"about_ca_topic_score_gemma":0.00010520597,"teacher_disagreement_score":0.9197549,"about_ca_system_score_codex":0.00007833055,"about_ca_system_score_gemma":0.000010566596,"threshold_uncertainty_score":0.99823767},"labels":[],"label_agreement":null},{"id":"W2088849139","doi":"10.1109/tcomm.2004.840672","title":"Improved Decoding for Bluetooth Systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Bluetooth and Wireless Communication Technologies","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":"Computer science; Decoding methods; Bluetooth; Detector; Network packet; Throughput; Bit error rate; Error detection and correction; Hamming distance; Discriminator; Real-time computing; Transmission (telecommunications); Computer hardware; Electronic engineering; Algorithm; Wireless; Computer network; Telecommunications; Engineering","score_opus":0.04660050196733913,"score_gpt":0.28936846116281334,"score_spread":0.24276795919547423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088849139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025565972,0.00075446436,0.9845069,0.010898275,0.00028711034,0.00058561994,0.00002927877,0.0011606287,0.0015220551],"genre_scores_gemma":[0.75596076,0.0007896943,0.241664,0.00024656154,0.000019353778,0.00078982825,0.0000044797926,0.000016814372,0.0005085006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877006,0.000100467594,0.00040467473,0.00029054834,0.00013093231,0.00030332967],"domain_scores_gemma":[0.9941253,0.00069596956,0.00014391876,0.0047625527,0.00018473218,0.00008752322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000303992,0.00017723642,0.00019539065,0.00027804883,0.000995833,0.00024830885,0.0043980093,0.00013725902,0.000005114364],"category_scores_gemma":[0.000019990946,0.00018143494,0.00014347743,0.00050374214,0.00014286688,0.00063669344,0.000030110528,0.00037333937,0.000055232915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014817934,0.00069490017,0.000004255274,0.000026142725,0.0000935491,1.1882182e-7,0.00063917576,0.011003582,0.0032479616,0.20256744,0.0013824389,0.7803256],"study_design_scores_gemma":[0.0005064416,0.00009196122,0.0000074113364,0.000033854063,0.000018278899,0.000007515893,0.00015717042,0.9151712,0.014595297,0.00076166796,0.068378046,0.00027116874],"about_ca_topic_score_codex":0.00003670957,"about_ca_topic_score_gemma":0.00015083015,"teacher_disagreement_score":0.9041676,"about_ca_system_score_codex":0.00012263683,"about_ca_system_score_gemma":0.00008674977,"threshold_uncertainty_score":0.8172669},"labels":[],"label_agreement":null},{"id":"W2089426645","doi":"10.1109/tcomm.2006.873065","title":"Selective maximum-likelihood symbol-by-symbol detection for multidimensional multicode WCDMA with precoding","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"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":"Precoding; Computer science; Telecommunications link; Algorithm; Code division multiple access; Symbol rate; Symbol (formal); Electronic engineering; Bit error rate; Decoding methods; MIMO; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.02093469730244359,"score_gpt":0.2722067548261051,"score_spread":0.25127205752366155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089426645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004434513,0.00025106542,0.9902156,0.00234128,0.00015735811,0.0013031256,0.000076951896,0.0005028547,0.00071724015],"genre_scores_gemma":[0.84445155,0.00014781725,0.15337613,0.00008580514,0.000027750835,0.00153235,0.00004075485,0.000048763995,0.0002890622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738955,0.000434772,0.0005135413,0.0005861261,0.0004846639,0.00059136597],"domain_scores_gemma":[0.99387836,0.0017279906,0.00019808255,0.0034024012,0.00063389726,0.00015928019],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047088353,0.00031676044,0.00028555034,0.00036212697,0.0019247475,0.00018051964,0.002267092,0.00017373169,0.000011735527],"category_scores_gemma":[0.000015619407,0.00031585753,0.0001645483,0.0011387096,0.0002396022,0.0007087102,0.00003934892,0.0008165,0.000050439743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077328854,0.0107816085,0.00025522572,0.00014577292,0.0009199537,0.000003251967,0.0030054487,0.1827432,0.17270818,0.014992637,0.0065934947,0.60707796],"study_design_scores_gemma":[0.0021124945,0.0003940177,0.0004891951,0.000110574554,0.00005400324,0.000026858144,0.00016117157,0.87731016,0.11221366,0.0016764686,0.004835419,0.00061595964],"about_ca_topic_score_codex":0.00035186615,"about_ca_topic_score_gemma":0.0018861322,"teacher_disagreement_score":0.840017,"about_ca_system_score_codex":0.0003549257,"about_ca_system_score_gemma":0.00018797324,"threshold_uncertainty_score":0.99992937},"labels":[],"label_agreement":null},{"id":"W2093554016","doi":"10.1109/tcomm.2012.12.110670","title":"Transmit Antenna Selection for Security Enhancement in MIMO Wiretap Channels","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":424,"is_retracted":false,"has_abstract":true,"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; Transmitter; Channel (broadcasting); Channel state information; MIMO; Topology (electrical circuits); Computer science; Secrecy; Antenna (radio); Selection (genetic algorithm); Nakagami distribution; Signal-to-noise ratio (imaging); Algorithm; Computer network; Telecommunications; Mathematics; Wireless; Artificial intelligence; Combinatorics; Computer security","score_opus":0.03391912688999205,"score_gpt":0.2874597000552449,"score_spread":0.25354057316525286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093554016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020923976,0.0011109662,0.9729557,0.0009551905,0.00037642068,0.0011295504,0.00006575277,0.00087651715,0.0016059018],"genre_scores_gemma":[0.9828965,0.002810279,0.0120467385,0.00008385342,0.000031827098,0.001967548,0.000031212705,0.000058681537,0.000073351475],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986703,0.00013990262,0.00046646467,0.00015943003,0.000149636,0.00041426247],"domain_scores_gemma":[0.9980481,0.00030652483,0.000051775733,0.0013868115,0.0000969516,0.00010978811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004245842,0.00022851824,0.00024387648,0.0003499936,0.00030908664,0.000037269365,0.0007773855,0.00016640105,0.00006623786],"category_scores_gemma":[0.0000055788178,0.00027835817,0.00014141093,0.00057276734,0.00009462225,0.00046482577,0.0000045583356,0.0005755573,0.000035364283],"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.00066320924,0.027840454,0.001955632,0.002119,0.0020782936,0.000001099853,0.13478576,0.07167867,0.38268077,0.049869,0.010147364,0.31618074],"study_design_scores_gemma":[0.001547876,0.00021736677,0.00037126426,0.00031081119,0.00012595262,0.000014958894,0.0006148437,0.61965615,0.32426327,0.0025337003,0.049214453,0.0011293467],"about_ca_topic_score_codex":0.00008225341,"about_ca_topic_score_gemma":0.00068339036,"teacher_disagreement_score":0.96197253,"about_ca_system_score_codex":0.00027986272,"about_ca_system_score_gemma":0.000023223593,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W2094116203","doi":"10.1109/tcomm.2010.092810.090549","title":"Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Division of Electrical, Communications and Cyber Systems; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"MIMO; Link adaptation; Low-density parity-check code; Computer science; Code rate; Spectral efficiency; Adaptive coding; Communications system; Wireless; Bit error rate; Throughput; Coding (social sciences); Electronic engineering; Algorithm; Channel (broadcasting); Real-time computing; Computer network; Decoding methods; Mathematics; Telecommunications; Fading; Engineering","score_opus":0.039680225384198894,"score_gpt":0.298442293113083,"score_spread":0.2587620677288841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094116203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027913675,0.00006686071,0.9749153,0.007307992,0.00034217117,0.00065349106,0.000059452508,0.0016379692,0.012225373],"genre_scores_gemma":[0.686495,0.00018623914,0.31216794,0.00026677977,0.000011232522,0.00043840925,0.000012881885,0.00003625986,0.00038523416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975872,0.00069975073,0.00049082853,0.000527799,0.00027088987,0.0004235382],"domain_scores_gemma":[0.9867641,0.001750776,0.0002610941,0.010578263,0.00044601777,0.00019977105],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079701527,0.00036085228,0.00033416806,0.00039201006,0.0018487031,0.00029258485,0.007169632,0.00016591701,0.000036619636],"category_scores_gemma":[0.000026647216,0.0003390504,0.00015231017,0.0013402337,0.0007714449,0.0009228486,0.00009238387,0.0018588542,0.00015743781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043666217,0.011194564,0.001076887,0.000100352554,0.0014038027,0.00002336447,0.023958553,0.008241239,0.14404806,0.61096907,0.006160044,0.19238739],"study_design_scores_gemma":[0.0019552025,0.0015378359,0.0023210896,0.0004574994,0.0003105366,0.00017029612,0.0010787109,0.81272227,0.1267896,0.021555915,0.028493406,0.0026076455],"about_ca_topic_score_codex":0.000662108,"about_ca_topic_score_gemma":0.011990627,"teacher_disagreement_score":0.804481,"about_ca_system_score_codex":0.00009913056,"about_ca_system_score_gemma":0.00025657972,"threshold_uncertainty_score":0.9999061},"labels":[],"label_agreement":null},{"id":"W2094772862","doi":"10.1109/tcomm.2012.061212.110200","title":"Iterative Mode-Dropping for the Sum Capacity of MIMO-MAC with Per-Antenna Power Constraint","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"MIMO; Maximization; Constraint (computer-aided design); Antenna (radio); 3G MIMO; Multi-user MIMO; Mathematical optimization; Power (physics); Mode (computer interface); Iterative method; Convergence (economics); Computer science; Algorithm; Covariance matrix; Mathematics; Electronic engineering; Control theory (sociology); Telecommunications; Engineering; Beamforming","score_opus":0.035674985202138465,"score_gpt":0.268052692047264,"score_spread":0.23237770684512554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094772862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001388387,0.00042330232,0.995439,0.0002493864,0.00022619688,0.0006836352,0.00027762537,0.00014345972,0.0011690068],"genre_scores_gemma":[0.9565083,0.00019261864,0.042761948,0.000023396533,0.000013580984,0.00038004213,0.000011645029,0.00003814961,0.00007035181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992612,0.00006051373,0.00028035237,0.000093389346,0.00009024245,0.00021429802],"domain_scores_gemma":[0.99811685,0.00055641733,0.00007244979,0.0010114746,0.00018466638,0.000058149366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014403283,0.00015487446,0.00017423286,0.000089818,0.00037012543,0.000017940229,0.00033204802,0.00006238022,0.00003712536],"category_scores_gemma":[0.000006614796,0.000121767305,0.000084973086,0.00019869403,0.0002363871,0.00030592215,0.0000021475212,0.00025819376,0.0000065561194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003326543,0.00027006306,0.00004054125,0.000063329506,0.0003484704,4.901876e-8,0.007716692,0.97255045,0.012565972,0.0037375542,0.00005442264,0.0026191638],"study_design_scores_gemma":[0.0010279041,0.00014633285,0.00008690393,0.00025001672,0.00024939762,0.00003415513,0.0041352827,0.97127646,0.01822022,0.00011548456,0.003956735,0.0005011313],"about_ca_topic_score_codex":0.000030381472,"about_ca_topic_score_gemma":0.00016813778,"teacher_disagreement_score":0.9551199,"about_ca_system_score_codex":0.000091660906,"about_ca_system_score_gemma":0.000021479063,"threshold_uncertainty_score":0.49655265},"labels":[],"label_agreement":null},{"id":"W2095529104","doi":"10.1109/tcomm.2010.093010.100024","title":"Robust Multiresolution Coding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"Codebook; Algorithm; Coding (social sciences); Robustness (evolution); Computer science; Multiresolution analysis; Distributed source coding; Shannon–Fano coding; Variable-length code; Theoretical computer science; Mathematics; Decoding methods; Wavelet; Wavelet transform; Artificial intelligence","score_opus":0.06678330363256661,"score_gpt":0.30961659334065866,"score_spread":0.24283328970809204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095529104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018684151,0.000021779915,0.99359393,0.0020008308,0.00046923434,0.00020821003,0.000025016454,0.0010516964,0.0024424468],"genre_scores_gemma":[0.55719626,0.00011807385,0.4422786,0.00012153539,0.000009833157,0.000104757724,0.0000044600083,0.000009371157,0.00015711637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898535,0.000094416246,0.00024514765,0.0002862024,0.0001871252,0.0002017485],"domain_scores_gemma":[0.9951652,0.00033954016,0.000087173816,0.004195638,0.000112227106,0.00010016469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019705767,0.0001346491,0.000111503934,0.0002035383,0.00081615616,0.000102452694,0.002896268,0.00009480392,0.000042887616],"category_scores_gemma":[0.00001738899,0.00013905924,0.00007454326,0.00044719802,0.0001509749,0.00080835907,0.000032681164,0.0008023594,0.00011733652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014333765,0.0013986591,0.00001536182,0.000012841977,0.000042885,0.0000028518878,0.0006680467,0.0070647295,0.20445985,0.21929713,0.003288377,0.56373495],"study_design_scores_gemma":[0.0005068876,0.00008566668,0.00023180153,0.00006812887,0.000018614195,0.000044930868,0.000038149687,0.7420004,0.18663536,0.0070263227,0.06279151,0.0005522531],"about_ca_topic_score_codex":0.000038207214,"about_ca_topic_score_gemma":0.00018498563,"teacher_disagreement_score":0.73493564,"about_ca_system_score_codex":0.000040278665,"about_ca_system_score_gemma":0.000045961548,"threshold_uncertainty_score":0.6277296},"labels":[],"label_agreement":null},{"id":"W2096439448","doi":"10.1109/tcomm.2011.060911.100554","title":"Multicell Interference Mitigation with Joint Beamforming and Common Message Decoding","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Beamforming; Computer science; Telecommunications link; Decoding methods; Interference (communication); Base station; Transmitter; Multiplexing; Computer network; Optimization problem; Heuristic; Antenna (radio); Mathematical optimization; Channel (broadcasting); Telecommunications; Algorithm; Mathematics","score_opus":0.04056802228546848,"score_gpt":0.2394367607084012,"score_spread":0.19886873842293273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096439448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015103278,0.00012531079,0.978525,0.000030491876,0.00009457348,0.0002823994,0.000013658366,0.00034065542,0.0054846574],"genre_scores_gemma":[0.89558,0.00039776156,0.10378604,0.00001392386,0.000004313582,0.000116136995,0.000006437406,0.000034329623,0.00006109047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993561,0.000044641325,0.0002605801,0.0001314262,0.00006273038,0.00014454658],"domain_scores_gemma":[0.99897134,0.000096582015,0.000055901917,0.0007533592,0.000054981527,0.00006785649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008659991,0.00014817892,0.00014453991,0.00014745837,0.00028614944,0.000027151122,0.00022241952,0.000060459322,0.000023571278],"category_scores_gemma":[0.0000025939005,0.00015019906,0.000027168646,0.00019276128,0.000100424484,0.00038893922,0.0000036920349,0.00027412435,0.000014946215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007871598,0.00046255405,0.00040719233,0.00029240473,0.00031436284,0.000003984203,0.018454028,0.86037594,0.031794723,0.0025456655,0.000026180169,0.08524427],"study_design_scores_gemma":[0.0007163592,0.00013044801,0.00030154898,0.0004600393,0.0001061204,0.00003109876,0.0012039078,0.89940524,0.09675584,0.0002486864,0.00016874982,0.0004719767],"about_ca_topic_score_codex":0.000057695874,"about_ca_topic_score_gemma":0.0006100746,"teacher_disagreement_score":0.8804767,"about_ca_system_score_codex":0.00007924397,"about_ca_system_score_gemma":0.000009399337,"threshold_uncertainty_score":0.612494},"labels":[],"label_agreement":null},{"id":"W2096735338","doi":"10.1109/tcomm.2009.08.070399","title":"Design and analysis of robust detectors for TH IR-UWB systems with multiuser interference","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Detector; Computer science; Bit error rate; Interference (communication); Electronic engineering; Ultra-wideband; Multiuser detection; Robustness (evolution); Impulse (physics); Parametric statistics; Impulse response; Algorithm; Telecommunications; Physics; Mathematics; Engineering; Statistics; Decoding methods; Channel (broadcasting)","score_opus":0.03677024918431639,"score_gpt":0.2452470432369565,"score_spread":0.2084767940526401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096735338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014427025,0.0005037464,0.9837456,0.00021817944,0.000033408356,0.0005018416,0.000053148142,0.00032484438,0.00019224515],"genre_scores_gemma":[0.9314401,0.0008136675,0.067357555,0.000013263155,0.000001481926,0.0003110352,0.000013163297,0.00001940449,0.000030310155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992277,0.000084105275,0.00031477763,0.000144949,0.00007238959,0.00015609562],"domain_scores_gemma":[0.9971063,0.0006688293,0.00006663015,0.0019886917,0.0001232041,0.000046307665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013757958,0.00015754231,0.00029116165,0.00056058855,0.00022407377,0.000028117964,0.00076400617,0.000108801476,0.000005435087],"category_scores_gemma":[0.000006664719,0.00014890498,0.00007662791,0.0009712776,0.00015376678,0.00011187115,0.000002764513,0.00027215615,0.0000016154526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003303932,0.0002009374,0.000049234677,0.000017610382,0.0007836182,7.93002e-8,0.000523597,0.9796315,0.005594697,0.00048719102,0.00002033348,0.012658151],"study_design_scores_gemma":[0.00041116803,0.00028300125,0.00064331054,0.00006470984,0.0009390321,0.0000050441026,0.0003137738,0.9837604,0.013056178,0.00007022443,0.0002220419,0.00023108519],"about_ca_topic_score_codex":0.00004084481,"about_ca_topic_score_gemma":0.00024215266,"teacher_disagreement_score":0.9170131,"about_ca_system_score_codex":0.000057678237,"about_ca_system_score_gemma":0.000018815614,"threshold_uncertainty_score":0.60721684},"labels":[],"label_agreement":null},{"id":"W2096969048","doi":"10.1109/tcomm.2007.896127","title":"Source-Matched Spreading Codes for Optical CDMA","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","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":"Center for High Performance Computing","keywords":"Puncturing; Code division multiple access; Computer science; Bit error rate; Electronic engineering; Convolutional code; Physical layer; Probability of error; Code (set theory); Computer network; Telecommunications; Algorithm; Channel (broadcasting); Decoding methods; Engineering; Wireless; Set (abstract data type)","score_opus":0.026720632724459233,"score_gpt":0.26773194387620675,"score_spread":0.2410113111517475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096969048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029459003,0.0001380737,0.9609981,0.00014774191,0.00036636865,0.00032149573,0.00003447674,0.0005309262,0.0080038095],"genre_scores_gemma":[0.9910489,0.00007248217,0.008211684,0.0000339525,0.000031394684,0.00015595077,0.000009410457,0.000041742012,0.0003945099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992148,0.000030270323,0.000294582,0.00011438676,0.00008841906,0.00025753476],"domain_scores_gemma":[0.99800676,0.0008263842,0.000023620129,0.0009949259,0.000047832425,0.00010045574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043094507,0.00013824008,0.0001651425,0.00015579938,0.00041447938,0.000035368164,0.000460406,0.0001082026,0.000026099713],"category_scores_gemma":[0.000006382844,0.00015106353,0.00014383177,0.00023609314,0.00010408879,0.00009709986,0.0000015701618,0.00026900077,0.00006738973],"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.00033887321,0.0018625055,0.0001346008,0.0004995701,0.0014440576,0.0000029826806,0.010639944,0.3769419,0.21883838,0.13722055,0.0021530013,0.24992366],"study_design_scores_gemma":[0.0032025736,0.00039429258,0.00050055137,0.00048262344,0.0005510407,0.00010661767,0.0069802944,0.29234114,0.52779335,0.010497068,0.1551396,0.0020108318],"about_ca_topic_score_codex":0.000009926346,"about_ca_topic_score_gemma":0.00017986566,"teacher_disagreement_score":0.9615899,"about_ca_system_score_codex":0.00005949323,"about_ca_system_score_gemma":0.000009081551,"threshold_uncertainty_score":0.61601925},"labels":[],"label_agreement":null},{"id":"W2097179998","doi":"10.1109/tcomm.2004.831357","title":"Equalization Concepts for Alamouti's Space–Time Block Code","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Block code; Transmit diversity; Space–time block code; Computer science; Equalization (audio); Algorithm; Fading; Estimator; Antenna diversity; Transmission (telecommunications); Block (permutation group theory); Electronic engineering; Decoding methods; Mathematics; Telecommunications; Antenna (radio); Engineering","score_opus":0.029518065906435253,"score_gpt":0.31304927293657575,"score_spread":0.2835312070301405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097179998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009012343,0.00030723412,0.991713,0.0014175415,0.00012817077,0.0007746061,0.00020953767,0.0019978748,0.0025508367],"genre_scores_gemma":[0.9020122,0.0014225559,0.095080584,0.0001039516,0.000015627542,0.00087291223,0.00007591484,0.00008649337,0.0003297143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99896896,0.00006562287,0.00039182956,0.00018296625,0.00014103824,0.0002496069],"domain_scores_gemma":[0.9969734,0.00036676723,0.000072277384,0.002338734,0.00015923053,0.00008958709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013811793,0.00022141199,0.00021594427,0.00019521224,0.0005149697,0.00004195145,0.0009846744,0.00014506977,0.000034883873],"category_scores_gemma":[0.000013424146,0.00026803324,0.00013384079,0.00038658045,0.00018364275,0.0002689583,0.0000064567744,0.0003427764,0.00011553706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015207468,0.0003177392,8.29547e-7,0.0000343403,0.00009100079,1.784309e-7,0.0007562708,0.94214225,0.033294626,0.013432252,0.00059385865,0.009321431],"study_design_scores_gemma":[0.0026459584,0.00024800687,0.000021354348,0.00030444836,0.00016063101,0.000018303555,0.00031579885,0.27182418,0.6246266,0.01573789,0.08289647,0.0012004105],"about_ca_topic_score_codex":0.0000140816155,"about_ca_topic_score_gemma":0.000112471556,"teacher_disagreement_score":0.901111,"about_ca_system_score_codex":0.00028235695,"about_ca_system_score_gemma":0.00004681662,"threshold_uncertainty_score":0.9999772},"labels":[],"label_agreement":null},{"id":"W2097329427","doi":"10.1109/tcomm.2014.032014.130399","title":"On the Performance of Cooperative Relaying Spectrum-Sharing Systems with Collaborative Distributed Beamforming","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; Concordia University","funders":"","keywords":"Beamforming; Rayleigh fading; Phase-shift keying; Cognitive radio; Computer science; Relay; Moment-generating function; Spectral efficiency; Quadrature amplitude modulation; Signal-to-noise ratio (imaging); Electronic engineering; Topology (electrical circuits); Fading; Bit error rate; Probability density function; Algorithm; Mathematics; Telecommunications; Decoding methods; Engineering; Wireless; Statistics","score_opus":0.029785680449203593,"score_gpt":0.2550656941608576,"score_spread":0.22528001371165401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097329427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025745686,0.00012820914,0.9662585,0.0032912532,0.00013156098,0.0005133677,0.000022759143,0.00013661581,0.0037720012],"genre_scores_gemma":[0.99505883,0.0007663431,0.0036066487,0.00016105482,0.000009759286,0.00022688632,0.000008158491,0.00001516565,0.0001471597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984317,0.00045038457,0.00037881767,0.00026626632,0.00025929886,0.00021356839],"domain_scores_gemma":[0.9947471,0.0014579105,0.00021920384,0.0031498529,0.0003627255,0.00006319614],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00060020026,0.00019645269,0.0002302538,0.0001391584,0.0017178336,0.00017035675,0.0024949193,0.000051045507,0.000012603867],"category_scores_gemma":[0.000028325438,0.00013919876,0.00005248482,0.0013991845,0.00025238938,0.00039733684,0.00004018869,0.0005760182,0.000023923658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005695711,0.00041972558,0.000065705804,0.00002045052,0.00016216672,2.8297848e-7,0.0034159017,0.4288471,0.0009234002,0.5596602,0.00013830827,0.006289796],"study_design_scores_gemma":[0.00040965553,0.0005022557,0.00010362677,0.00038421666,0.000022193632,0.0000074945933,0.0003870491,0.98734426,0.008575428,0.00014565598,0.0018758831,0.00024228473],"about_ca_topic_score_codex":0.000014664822,"about_ca_topic_score_gemma":0.000098304794,"teacher_disagreement_score":0.96931314,"about_ca_system_score_codex":0.00011572106,"about_ca_system_score_gemma":0.0000946702,"threshold_uncertainty_score":0.9995818},"labels":[],"label_agreement":null},{"id":"W2097882868","doi":"10.1109/tcomm.2009.07.070510","title":"Error probabilities of noncoherent and coherent FSK in the presence of frequency and phase offsets for two-hop relay networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Frequency-shift keying; Relay; Rayleigh fading; Electronic engineering; Synchronization (alternating current); Hop (telecommunications); Computer science; Phase-shift keying; Bit error rate; Topology (electrical circuits); Telecommunications; Control theory (sociology); Fading; Engineering; Channel (broadcasting); Power (physics); Electrical engineering; Demodulation; Physics","score_opus":0.06746455128897061,"score_gpt":0.34433786787256826,"score_spread":0.27687331658359765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097882868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030843968,0.0026153729,0.9584362,0.0061034146,0.0000719995,0.0012613637,0.000025019128,0.00003737479,0.00060532003],"genre_scores_gemma":[0.9778013,0.0023217849,0.01951759,0.00011907025,0.0000047256435,0.00020314341,0.000004105949,0.0000043188834,0.00002391096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878126,0.00038734623,0.00040688636,0.00017602525,0.00011738309,0.00013108324],"domain_scores_gemma":[0.9968835,0.0011907526,0.00013900227,0.0016046126,0.00014360207,0.00003850045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052824,0.00011414491,0.00018685826,0.00010374551,0.0002963221,0.000039288552,0.0011704061,0.000046080866,0.0000041707344],"category_scores_gemma":[0.00002180592,0.000092597395,0.000048202786,0.00038333779,0.00026228855,0.0002178918,0.000017356722,0.0002748535,2.1828247e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013927296,0.005368,0.00024660703,0.000094362156,0.000098450895,5.4823175e-7,0.028333109,0.02498134,0.0068359966,0.2549036,0.00037358465,0.6786251],"study_design_scores_gemma":[0.0034359726,0.0013578256,0.0020425175,0.0003965195,0.000059176626,0.000015287915,0.0009751759,0.98003536,0.0022486134,0.007683704,0.0013946109,0.0003552293],"about_ca_topic_score_codex":0.000036273548,"about_ca_topic_score_gemma":0.00067838596,"teacher_disagreement_score":0.95505404,"about_ca_system_score_codex":0.000024079629,"about_ca_system_score_gemma":0.00004870685,"threshold_uncertainty_score":0.37760124},"labels":[],"label_agreement":null},{"id":"W2098237535","doi":"10.1109/tcomm.2011.011811.090638","title":"Hybrid Linear Programming Based Decoding Algorithm for LDPC Codes","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Decoding methods; Low-density parity-check code; List decoding; Algorithm; Sequential decoding; Berlekamp–Welch algorithm; Linear programming; Concatenated error correction code; Computer science; Mathematics; Block code; Error floor","score_opus":0.0926874537098621,"score_gpt":0.3199310397218236,"score_spread":0.22724358601196148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098237535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001291994,0.00004640335,0.9960086,0.0004736674,0.0003172158,0.0006421472,0.000029195666,0.0015279067,0.0008256841],"genre_scores_gemma":[0.32678866,0.000028217883,0.67235315,0.00013792735,0.000010595489,0.00058063155,0.0000048104266,0.000021717817,0.000074290874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987143,0.00013588321,0.0003343866,0.00034342307,0.00016232124,0.0003096769],"domain_scores_gemma":[0.9963444,0.00062000495,0.00012657224,0.0025720524,0.00023732183,0.00009966236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004668724,0.00018683208,0.00017912043,0.0002766773,0.00087129686,0.00008306644,0.0023860275,0.00006806704,0.000012179646],"category_scores_gemma":[0.000020180625,0.00020527381,0.00018293691,0.0003938397,0.00011873377,0.00037214207,0.000015916825,0.0003637925,0.0000243393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006865154,0.0006715671,0.000008508891,0.000012175562,0.000037424426,0.0000012373698,0.0007874762,0.00014223075,0.0003298516,0.0022340983,0.00013592216,0.99563265],"study_design_scores_gemma":[0.00029102585,0.00022759454,0.000011339813,0.000072367984,0.00003617418,0.0000147122155,0.000043550306,0.8914764,0.100291334,0.0018461901,0.0053924057,0.0002969241],"about_ca_topic_score_codex":0.0001230541,"about_ca_topic_score_gemma":0.00012944195,"teacher_disagreement_score":0.9953357,"about_ca_system_score_codex":0.0000937577,"about_ca_system_score_gemma":0.00011134691,"threshold_uncertainty_score":0.8370823},"labels":[],"label_agreement":null},{"id":"W2098243791","doi":"10.1109/tcomm.2006.876884","title":"Signal Activity Detection of Phase-Shift Keying Signals","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","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":"Queen's University","funders":"","keywords":"Detector; Phase-shift keying; Additive white Gaussian noise; Keying; Algorithm; Likelihood-ratio test; Gaussian noise; Detection theory; Amplitude and phase-shift keying; Energy (signal processing); Signal-to-noise ratio (imaging); Binary number; SIGNAL (programming language); Mathematics; Electronic engineering; Computer science; Invariant (physics); Gaussian; White noise; Bit error rate; Statistics; Telecommunications; Engineering; Decoding methods; Physics","score_opus":0.05191040407982971,"score_gpt":0.2985036673704731,"score_spread":0.2465932632906434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098243791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06465794,0.0000365015,0.93265164,0.0008295527,0.00014905358,0.00031526195,0.000023067198,0.00028227095,0.0010547253],"genre_scores_gemma":[0.9906552,0.00001535626,0.009000716,0.000024155432,0.000024814368,0.00014724844,0.000006174391,0.000018564539,0.00010780076],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982659,0.00033065618,0.00048100864,0.00033680376,0.00037121776,0.00021438459],"domain_scores_gemma":[0.99679184,0.0005803053,0.00033655396,0.0020162964,0.00020524955,0.00006977821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032228205,0.00018286188,0.00021354298,0.00038536513,0.00058153353,0.000089503126,0.0013314999,0.0001218935,0.000033719854],"category_scores_gemma":[0.0000056907797,0.00020607226,0.00016397938,0.00095992547,0.00020506736,0.000836024,0.00000842122,0.00035594884,0.00004146916],"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.000036278034,0.0025222343,0.000036644156,0.000019077434,0.000054022345,5.129292e-7,0.00044010486,0.0496896,0.79674935,0.006353807,0.000027776905,0.14407061],"study_design_scores_gemma":[0.0006343255,0.00013900983,0.0038946862,0.000032754582,0.000028073964,0.0000028939637,0.00001730973,0.42717302,0.5652898,0.0023641158,0.00021042104,0.00021359534],"about_ca_topic_score_codex":0.00045019455,"about_ca_topic_score_gemma":0.00041975093,"teacher_disagreement_score":0.9259972,"about_ca_system_score_codex":0.00013339713,"about_ca_system_score_gemma":0.000083567735,"threshold_uncertainty_score":0.8403383},"labels":[],"label_agreement":null},{"id":"W2098592039","doi":"10.1109/tcomm.2011.091911.100007a","title":"A Weighted Queue-Based Model for Correlated Rayleigh and Rician Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":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":"Rician fading; Queue; Rayleigh fading; Fading; Channel (broadcasting); Computer science; Channel capacity; Algorithm; Mathematics; Telecommunications; Computer network","score_opus":0.0484424474503522,"score_gpt":0.24224605641726085,"score_spread":0.19380360896690865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098592039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011583489,0.00022385705,0.9960511,0.00009224629,0.00021159352,0.0004928467,0.000057383102,0.0005741435,0.0011384944],"genre_scores_gemma":[0.88640046,0.0005095708,0.112389304,0.00005221607,0.0000087847875,0.00040763977,0.000032380696,0.00006114694,0.00013850046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.00003346754,0.0002513976,0.00015822775,0.00006630763,0.00021225655],"domain_scores_gemma":[0.99885255,0.00018820235,0.000045118202,0.0007480626,0.00008538636,0.00008067788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000722305,0.00017270315,0.00015907407,0.0001935732,0.00040318232,0.000020195539,0.00028370484,0.00012327451,0.00001659905],"category_scores_gemma":[0.0000027448782,0.00020031766,0.0000629135,0.0003268181,0.000081928476,0.00018918113,0.0000019706392,0.0002622478,0.000007609898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021599446,0.00008767877,0.0000019428799,0.000014649226,0.00003815106,1.1403741e-7,0.00076805387,0.9926758,0.00025995637,0.0005453873,0.00004217039,0.0055445274],"study_design_scores_gemma":[0.0005418028,0.00003224458,0.000005631704,0.000053292737,0.000056924095,0.0000013986368,0.00003492716,0.9950112,0.0030505587,0.00081245863,0.00019337444,0.00020617775],"about_ca_topic_score_codex":0.000011389406,"about_ca_topic_score_gemma":0.00011501023,"teacher_disagreement_score":0.8852421,"about_ca_system_score_codex":0.00008040688,"about_ca_system_score_gemma":0.000021387881,"threshold_uncertainty_score":0.81687176},"labels":[],"label_agreement":null},{"id":"W2098669738","doi":"10.1109/tcomm.2006.887488","title":"Performance of Belief Propagation for Decoding LDPC Codes in the Presence of Channel Estimation Error","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Additive white Gaussian noise; Belief propagation; Decoding methods; Bit error rate; Mathematics; Channel (broadcasting); Node (physics); Computer science; Telecommunications; Physics","score_opus":0.05991274641773332,"score_gpt":0.3339470309411472,"score_spread":0.2740342845234139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098669738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068095185,0.000030497464,0.92999244,0.00066375866,0.000094456,0.0006632693,0.0000070334668,0.00009188299,0.0003614537],"genre_scores_gemma":[0.82873404,0.000056208963,0.17098616,0.000025386715,0.0000033528736,0.00017178198,0.0000024941633,0.0000063117463,0.0000142347835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893767,0.000114695365,0.0004424937,0.0001501807,0.00020372924,0.00015126097],"domain_scores_gemma":[0.99679685,0.0013552983,0.00023433227,0.0013810468,0.00021353077,0.000018930075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015167352,0.00009259741,0.0001316415,0.00028564697,0.00026068883,0.000018158295,0.0016205111,0.00005655911,7.492037e-7],"category_scores_gemma":[0.000060607148,0.00008227821,0.000062126004,0.00073709554,0.00012038317,0.00039836168,0.000009835422,0.00020621685,0.0000010007533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026170583,0.004091058,0.0010089582,0.00066885696,0.000090297166,7.2786355e-7,0.05382625,0.2576699,0.051205415,0.03793954,0.00018852227,0.59304875],"study_design_scores_gemma":[0.00015275393,0.0002056669,0.0011482828,0.00015708953,0.0000111714735,0.00000455415,0.0002271878,0.87302876,0.124171495,0.0007898449,0.000019882642,0.00008331588],"about_ca_topic_score_codex":0.00008064812,"about_ca_topic_score_gemma":0.00051272754,"teacher_disagreement_score":0.7606389,"about_ca_system_score_codex":0.000051374816,"about_ca_system_score_gemma":0.00005590385,"threshold_uncertainty_score":0.3355208},"labels":[],"label_agreement":null},{"id":"W2099114934","doi":"10.1109/tcomm.2007.895978","title":"Convergence Speed and Throughput of Analog Decoders","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Convergence (economics); Throughput; Computer science; Electronic engineering; Engineering; Telecommunications; Wireless","score_opus":0.04220366089989956,"score_gpt":0.31848603325049724,"score_spread":0.27628237235059766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099114934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083101895,0.00013236923,0.9863115,0.00097020104,0.00018801696,0.00015198879,0.0000042818942,0.00031300864,0.0036184536],"genre_scores_gemma":[0.8514696,0.000295072,0.14802314,0.00011868839,0.0000032160185,0.000006175775,5.4039475e-7,0.000007632337,0.00007597518],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910223,0.00007470521,0.0003002954,0.00020493542,0.0001500889,0.00016771944],"domain_scores_gemma":[0.9971971,0.00059485337,0.0001100064,0.0019022833,0.00012738242,0.0000683865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047573342,0.00010628976,0.00013648356,0.00020891901,0.0002623849,0.000024818519,0.0013296829,0.00006359739,0.000011413929],"category_scores_gemma":[0.000014290238,0.0001150097,0.00006196956,0.0005719881,0.0002572887,0.00027144124,0.000017700277,0.0002644806,0.000012229742],"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.00012336714,0.003510282,0.0041303895,0.00015296071,0.00047587877,0.000015186498,0.022038575,0.0037573054,0.095945545,0.19414012,0.0022047756,0.6735056],"study_design_scores_gemma":[0.0012658421,0.00086596864,0.010260859,0.0003167163,0.00014114886,0.0001692305,0.0011815684,0.26255116,0.6944119,0.020641033,0.006868542,0.0013260775],"about_ca_topic_score_codex":0.0002667667,"about_ca_topic_score_gemma":0.0008593795,"teacher_disagreement_score":0.8431594,"about_ca_system_score_codex":0.000042934673,"about_ca_system_score_gemma":0.00005781046,"threshold_uncertainty_score":0.46899593},"labels":[],"label_agreement":null},{"id":"W2099510208","doi":"10.1109/tcomm.2007.902519","title":"Error Rate Analysis for Coded Multicarrier Systems Over Quasi-Static Fading Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Bit error rate; Subcarrier; Computer science; Electronic engineering; Cyclic prefix; Fading; QAM; Spectral efficiency; Quadrature amplitude modulation; Interleaving; Channel (broadcasting); Algorithm; Telecommunications; Engineering","score_opus":0.041032047840594166,"score_gpt":0.300676328613927,"score_spread":0.25964428077333285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099510208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015604047,0.00036306438,0.9803179,0.00044991053,0.00041102772,0.0007890257,0.00022900251,0.00095300004,0.0008830447],"genre_scores_gemma":[0.9863834,0.00038206214,0.01177065,0.00006514114,0.000015387535,0.00084513484,0.00008500748,0.00007040476,0.0003828555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983855,0.00013837163,0.00065775507,0.00023999883,0.0001393084,0.00043909947],"domain_scores_gemma":[0.9944243,0.0019251404,0.000097175165,0.0032682903,0.00015874956,0.00012637602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006686234,0.00026463252,0.00039963902,0.0009394966,0.00067477126,0.00007404179,0.0012732927,0.00023995303,0.00003961359],"category_scores_gemma":[0.000032326057,0.00029735762,0.00026185482,0.0015793032,0.00019096342,0.00018543752,0.0000067322694,0.000584733,0.00004493384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004149661,0.0006006588,0.000079134,0.00007421733,0.002448315,9.037954e-7,0.0018531135,0.97584045,0.009043655,0.00412487,0.0003195102,0.0055736834],"study_design_scores_gemma":[0.0007450514,0.00007525519,0.00023002477,0.000043335483,0.00094219996,0.000005169966,0.0010712387,0.9789557,0.006281858,0.00024760695,0.010948298,0.0004542852],"about_ca_topic_score_codex":0.00014527216,"about_ca_topic_score_gemma":0.0011704655,"teacher_disagreement_score":0.9707793,"about_ca_system_score_codex":0.00023208672,"about_ca_system_score_gemma":0.000027017326,"threshold_uncertainty_score":0.99994785},"labels":[],"label_agreement":null},{"id":"W2100072869","doi":"10.1109/26.855519","title":"The generation of correlated Rayleigh random variates by inverse discrete Fourier transform","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":270,"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":"Random variate; Convolution random number generator; Algorithm; Random number generation; Computer science; Control variates; Discrete Fourier transform (general); Fourier transform; Inverse; Mathematics; Mathematical optimization; Random variable; Statistics; Fourier analysis; Monte Carlo method; Fractional Fourier transform","score_opus":0.025999727430228128,"score_gpt":0.2791343712317966,"score_spread":0.25313464380156847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100072869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070183344,0.00043995338,0.84265494,0.006854059,0.0005040119,0.001318364,0.0014633607,0.000093609,0.07648838],"genre_scores_gemma":[0.98908174,0.00043505643,0.00048396242,0.000022319047,0.000018415756,0.00014712014,0.00012800377,0.00001090885,0.009672468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990404,0.00016087612,0.00027975274,0.00013370968,0.00020166831,0.00018356419],"domain_scores_gemma":[0.9984906,0.00032271887,0.00005233847,0.0009861225,0.000074420386,0.00007384053],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025333872,0.00010482859,0.000116172065,0.00004208395,0.0011178544,0.00010761526,0.0005129092,0.000032467786,0.001584201],"category_scores_gemma":[0.000002470842,0.0000766072,0.00013698034,0.00029163482,0.00037481557,0.00024243312,0.000001871938,0.00022859982,0.00007223918],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015108682,0.0031890546,0.00026286935,0.000021704092,0.0015151182,4.8138315e-7,0.00798497,0.037968688,0.036792345,0.020501448,0.0877419,0.80251056],"study_design_scores_gemma":[0.009103779,0.00037681634,0.0001187949,0.00008510362,0.0003890288,0.0000024139072,0.0032900467,0.4484691,0.24271959,0.014265518,0.2803038,0.00087598455],"about_ca_topic_score_codex":0.0005604697,"about_ca_topic_score_gemma":0.00019960877,"teacher_disagreement_score":0.9188984,"about_ca_system_score_codex":0.000016838443,"about_ca_system_score_gemma":0.00007414581,"threshold_uncertainty_score":0.9993285},"labels":[],"label_agreement":null},{"id":"W2100108445","doi":"10.1109/tcomm.2004.823591","title":"Isometric Data Sequences and Data-Modulation Schemes in Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Fading; Algorithm; Computer science; Modulation (music); Multiplicative function; Channel (broadcasting); Detector; Constellation; Transmission (telecommunications); Electronic engineering; Mathematics; Telecommunications; Decoding methods; Engineering; Physics","score_opus":0.11689976784521064,"score_gpt":0.34943556189435676,"score_spread":0.23253579404914612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100108445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008081533,0.0016333875,0.9876109,0.00092255994,0.00010596312,0.00032465832,0.00020074742,0.00067165284,0.00044859818],"genre_scores_gemma":[0.8991744,0.010640198,0.089802325,0.000029273408,0.000009095157,0.00008398411,0.00021751331,0.000030961917,0.000012268301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899584,0.00006334971,0.00034513406,0.0002842065,0.0001335435,0.00017794294],"domain_scores_gemma":[0.99377805,0.00026976698,0.000051077295,0.0058073965,0.000038982384,0.00005470278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002937638,0.00015723032,0.00016932447,0.00058514107,0.00027357755,0.000059701448,0.0026690136,0.00009048313,0.000008679172],"category_scores_gemma":[0.00002487767,0.00018491826,0.000016795637,0.0010890511,0.00015130037,0.0012525084,0.00006473956,0.00047461927,0.000013913067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065557656,0.00032262053,0.00006034012,0.00004795126,0.000072150666,0.0000010266717,0.00081501686,0.80894023,0.0052691875,0.004071805,0.000059194426,0.1803339],"study_design_scores_gemma":[0.0008236712,0.00004588554,0.00045176188,0.0002912172,0.00004178347,0.00001903258,0.0003710636,0.9664848,0.015252704,0.006407875,0.009192204,0.00061802595],"about_ca_topic_score_codex":0.00012569292,"about_ca_topic_score_gemma":0.0005278903,"teacher_disagreement_score":0.89780855,"about_ca_system_score_codex":0.00014536131,"about_ca_system_score_gemma":0.000032428896,"threshold_uncertainty_score":0.75407475},"labels":[],"label_agreement":null},{"id":"W2100183328","doi":"10.1109/tcomm.2010.08.090220","title":"Data-Aided and Non-Data-Aided Estimation of Signal Amplitude for Binary Data Communication in Laplace Noise","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Estimator; Binary number; Noise (video); SIGNAL (programming language); Binary data; Amplitude; Algorithm; Mean squared error; Mathematics; Estimation theory; Laplace transform; Statistics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.07492159489404657,"score_gpt":0.34571023056526967,"score_spread":0.27078863567122313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100183328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010849231,0.0004924764,0.98154503,0.0010412625,0.00008974845,0.0011478732,0.0041127843,0.0004182971,0.0003032794],"genre_scores_gemma":[0.6773728,0.0022852395,0.31638095,0.000023636116,0.0000062563286,0.0002441963,0.0036241137,0.000048076206,0.0000147577075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819595,0.00016591774,0.00080123777,0.00042627385,0.0001832451,0.00022737599],"domain_scores_gemma":[0.9790767,0.0016832369,0.00019595497,0.018824168,0.0001369954,0.00008298388],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010299073,0.00025184327,0.00036531143,0.00035369943,0.00035781314,0.000058087688,0.0073194653,0.00019215427,0.000021496533],"category_scores_gemma":[0.00008345927,0.00029942664,0.00003623273,0.00048509787,0.0003692754,0.0016370498,0.00029029427,0.0009344827,0.0000073522106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030293432,0.0034288934,0.00019923176,0.00082825404,0.0005797182,0.0000010049748,0.0024695445,0.42404714,0.20862673,0.004583288,0.0065646046,0.34836864],"study_design_scores_gemma":[0.0006859922,0.000037561666,0.0003768466,0.00012398999,0.00008810241,0.000004724519,0.00014649055,0.9866315,0.0073164306,0.0010262046,0.0032725332,0.00028964048],"about_ca_topic_score_codex":0.00019836858,"about_ca_topic_score_gemma":0.0037162805,"teacher_disagreement_score":0.6665236,"about_ca_system_score_codex":0.000057294466,"about_ca_system_score_gemma":0.00007795394,"threshold_uncertainty_score":0.99994576},"labels":[],"label_agreement":null},{"id":"W2100198221","doi":"10.1109/tcomm.2014.2318717","title":"Joint Channel and Frequency Offset Estimation for Oversampled Perfect Reconstruction Filter Bank Transceivers","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Carrier frequency offset; Estimator; Fading; Computer science; Cramér–Rao bound; Algorithm; Channel (broadcasting); Frequency offset; Control theory (sociology); Estimation theory; Electronic engineering; Orthogonal frequency-division multiplexing; Mathematics; Engineering; Telecommunications; Statistics","score_opus":0.03379579537303312,"score_gpt":0.24489841518352992,"score_spread":0.2111026198104968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100198221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012931652,0.00008715429,0.9815638,0.0009327203,0.0008398804,0.0005263989,0.00017892964,0.00045631983,0.002483162],"genre_scores_gemma":[0.9730723,0.0003721167,0.025946334,0.000041555264,0.000037304133,0.00037733468,0.000036805057,0.000040185714,0.00007605177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911726,0.00008495573,0.00030711628,0.00019650054,0.000102462676,0.00019170564],"domain_scores_gemma":[0.9987132,0.00026929012,0.000050100527,0.00080246385,0.000077355755,0.00008758458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019625649,0.00018426422,0.0001856997,0.0002445153,0.0004925756,0.000046564426,0.00021270043,0.00011866418,0.00007273606],"category_scores_gemma":[0.000021930191,0.00021339372,0.00011959834,0.00019002658,0.0001540655,0.00032077424,9.715762e-7,0.00028396194,0.00002734863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008067764,0.00038201577,0.000023341752,0.00038200198,0.00056131213,2.2232015e-7,0.0039121695,0.6174893,0.057815026,0.005268052,0.002259612,0.3118263],"study_design_scores_gemma":[0.0009307167,0.00013917925,0.0002632443,0.00011826251,0.00014757385,0.000051383602,0.00022878184,0.97752714,0.015256457,0.0032011613,0.0017491744,0.00038689587],"about_ca_topic_score_codex":0.00004264034,"about_ca_topic_score_gemma":0.00012086356,"teacher_disagreement_score":0.96014065,"about_ca_system_score_codex":0.00012852276,"about_ca_system_score_gemma":0.000018108502,"threshold_uncertainty_score":0.8701943},"labels":[],"label_agreement":null},{"id":"W2100863752","doi":"10.1109/26.891203","title":"Information theoretic considerations for coded modulation over fading channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"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; Rayleigh fading; Additive white Gaussian noise; Fading distribution; Channel state information; Algorithm; Diversity scheme; Probability of error; Mathematics; Computer science; Diversity combining; Electronic engineering; Channel (broadcasting); Telecommunications; Decoding methods; Topology (electrical circuits); Wireless; Engineering","score_opus":0.02620171050907693,"score_gpt":0.2730852568252837,"score_spread":0.24688354631620674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100863752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003825865,0.00007273738,0.9864988,0.00067337096,0.00016293206,0.00093926175,0.00018376595,0.0014172167,0.0062260823],"genre_scores_gemma":[0.9569954,0.0014061222,0.03982251,0.00020223028,0.000016187632,0.0012634322,0.00009513274,0.00004403516,0.0001549136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989697,0.00007968754,0.0004884185,0.00010576592,0.00013786212,0.00021856996],"domain_scores_gemma":[0.9973109,0.0007051635,0.00006247794,0.0017077343,0.00014321772,0.00007053888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016086028,0.00020144734,0.00017943858,0.0002566248,0.00075113314,0.00010376364,0.00047003783,0.00012961472,0.00047704982],"category_scores_gemma":[0.000016986774,0.0002381351,0.000115018745,0.00029945155,0.00014169836,0.0009833679,0.0000029106357,0.00032458137,0.00010130897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015842146,0.000095801515,0.000001017448,0.000028795468,0.000052083942,3.955474e-8,0.001485361,0.90283275,0.0012127584,0.01684386,0.0006622588,0.07676941],"study_design_scores_gemma":[0.0005880994,0.00005024485,0.000036621306,0.000061865016,0.000041384963,0.0000063288594,0.000114325376,0.9378198,0.017310614,0.028853353,0.014755975,0.0003614279],"about_ca_topic_score_codex":0.000011685016,"about_ca_topic_score_gemma":0.000031960026,"teacher_disagreement_score":0.9531696,"about_ca_system_score_codex":0.00015680477,"about_ca_system_score_gemma":0.000025506333,"threshold_uncertainty_score":0.97108674},"labels":[],"label_agreement":null},{"id":"W2101081066","doi":"10.1109/26.939904","title":"An overlapping window decorrelating multiuser detector for DS-CDMA radio channels","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Decorrelation; Detector; Code division multiple access; Computer science; Spread spectrum; Electronic engineering; Multiuser detection; Algorithm; Window (computing); Detection theory; Telecommunications; Engineering","score_opus":0.06766013472288533,"score_gpt":0.3371466916258581,"score_spread":0.26948655690297274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101081066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005201908,0.0003409202,0.9886954,0.0029736683,0.00059759396,0.00091689144,0.0000184208,0.00058928516,0.00066595373],"genre_scores_gemma":[0.85950774,0.0006641241,0.13819821,0.00021144636,0.00008729358,0.0008727162,0.00001546819,0.00004691337,0.00039607048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974642,0.0005415063,0.00054251216,0.0005065689,0.0003692605,0.0005759786],"domain_scores_gemma":[0.990756,0.001953132,0.00017483039,0.006482124,0.00036729046,0.00026662694],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007289627,0.00026707977,0.00027359443,0.00041882618,0.0020454028,0.0004158061,0.0056568524,0.0001745118,0.00003884994],"category_scores_gemma":[0.000040406012,0.00029657045,0.00020694222,0.0011936203,0.00018579248,0.0012951088,0.00004521421,0.0008143863,0.00008392096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011930966,0.0025801698,0.00024078085,0.00003644832,0.00029554765,0.0000040279438,0.0052605923,0.28276592,0.012309507,0.013124007,0.0006623955,0.6826013],"study_design_scores_gemma":[0.0009054572,0.00016583978,0.00035776861,0.00007446464,0.00001943783,0.000025006886,0.0001384175,0.98419017,0.0021881124,0.00046536684,0.0111068785,0.00036306368],"about_ca_topic_score_codex":0.00010857364,"about_ca_topic_score_gemma":0.00044641286,"teacher_disagreement_score":0.85430586,"about_ca_system_score_codex":0.00022031751,"about_ca_system_score_gemma":0.00015148484,"threshold_uncertainty_score":0.9999486},"labels":[],"label_agreement":null},{"id":"W2101246173","doi":"10.1109/tcomm.2005.855007","title":"Revised Analyses of Postdetection Switched Combining in Nakagami-<tex>$m$</tex>Fading","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Nakagami distribution; Frequency-shift keying; Fading; Rician fading; Mathematics; Rayleigh fading; Bit error rate; Phase-shift keying; Statistics; Algorithm; Telecommunications; Computer science; Demodulation; Decoding methods; Channel (broadcasting)","score_opus":0.047528809034075206,"score_gpt":0.32355914646187983,"score_spread":0.27603033742780464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101246173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04161373,0.0031432505,0.944556,0.0010717805,0.00017717513,0.00086563063,0.00006169193,0.0017619965,0.0067487457],"genre_scores_gemma":[0.95173573,0.008376038,0.039267804,0.000051633124,0.000016932836,0.00032616447,0.00002979109,0.00009043136,0.00010549043],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776745,0.00027667836,0.0010337885,0.00027538516,0.00027436044,0.00037232458],"domain_scores_gemma":[0.9957193,0.00065541844,0.00022010687,0.003122306,0.00017193607,0.00011090293],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042639856,0.00033611595,0.00049993064,0.00092936365,0.00038242235,0.00004100972,0.0013590247,0.00021623976,0.00008019553],"category_scores_gemma":[0.00003295724,0.0004100071,0.0002179638,0.0012921469,0.00019823469,0.00056870934,0.000019817036,0.0008945883,0.000044157343],"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.000040908748,0.0006394542,0.000030289759,0.0000906785,0.00018033762,6.667055e-7,0.0012669184,0.38649186,0.52552795,0.0007645724,0.0001400686,0.08482629],"study_design_scores_gemma":[0.0013407428,0.00012228536,0.0005572987,0.0006728019,0.00015215689,0.00001502451,0.00033930142,0.3357527,0.6497976,0.0005425514,0.009902812,0.00080472307],"about_ca_topic_score_codex":0.000058571673,"about_ca_topic_score_gemma":0.0010245829,"teacher_disagreement_score":0.910122,"about_ca_system_score_codex":0.0004797386,"about_ca_system_score_gemma":0.00004923076,"threshold_uncertainty_score":0.9998352},"labels":[],"label_agreement":null},{"id":"W2101637789","doi":"10.1109/26.939851","title":"Single parity check product codes","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","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":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.06367548601671887,"score_gpt":0.29474189126887845,"score_spread":0.2310664052521596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101637789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095363037,0.00023810765,0.9861854,0.0047591324,0.0003207405,0.00018589583,0.000020175963,0.0003609863,0.00697595],"genre_scores_gemma":[0.89355433,0.0006578708,0.1046372,0.00021680225,0.000027412325,0.00007214242,0.0000115714265,0.000010773566,0.0008119034],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989164,0.00013306447,0.00022869225,0.00030744565,0.00020341872,0.00021100859],"domain_scores_gemma":[0.99588317,0.00016316774,0.000066376895,0.003681252,0.00010939797,0.000096657524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001824664,0.000133248,0.00013127606,0.00011193889,0.00076045666,0.00015393297,0.0021827882,0.000048249374,0.000039782564],"category_scores_gemma":[0.00000769034,0.00012742727,0.00007574198,0.0005551966,0.00011414273,0.0006385387,0.00002764259,0.00032537105,0.0001659521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033761935,0.004803995,0.00008509872,0.000014212349,0.00009025519,0.0000073736483,0.0011017149,0.0023045796,0.009377117,0.015208821,0.005193464,0.9617796],"study_design_scores_gemma":[0.001286086,0.0005380831,0.002216283,0.00017039642,0.00007660017,0.0002019675,0.00014423915,0.3626121,0.061770666,0.010042315,0.55973655,0.0012047013],"about_ca_topic_score_codex":0.00010620979,"about_ca_topic_score_gemma":0.000249491,"teacher_disagreement_score":0.9605749,"about_ca_system_score_codex":0.00005835419,"about_ca_system_score_gemma":0.000053775704,"threshold_uncertainty_score":0.5848895},"labels":[],"label_agreement":null},{"id":"W2101704919","doi":"10.1109/tcomm.2004.826412","title":"Transmission Properties of Conjugate-Root Pulses","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 Alberta","funders":"","keywords":"Intersymbol interference; Pulse shaping; Raised-cosine filter; Transmission (telecommunications); Electronic engineering; Matched filter; Filter (signal processing); Interference (communication); Computer science; Pulse (music); Data transmission; Telecommunications; Root-raised-cosine filter; Optics; Low-pass filter; Physics; Bandwidth (computing); Engineering; Decoding methods; Channel (broadcasting)","score_opus":0.02633962944648991,"score_gpt":0.23074255455222167,"score_spread":0.20440292510573177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101704919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13162306,0.004261612,0.8475025,0.004557938,0.00023094122,0.0007175348,0.000064163054,0.0018728493,0.0091693625],"genre_scores_gemma":[0.98931336,0.0026852698,0.00762292,0.000027923517,0.0000037393559,0.00021981802,0.000006854438,0.000041305775,0.000078813515],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990824,0.000055381235,0.00041320673,0.00012779435,0.00012863516,0.00019261679],"domain_scores_gemma":[0.9973741,0.00008710829,0.00004403519,0.002339872,0.00009414436,0.00006072983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008731687,0.00017546579,0.00021393286,0.00026378705,0.00030702815,0.000016550295,0.0012034522,0.00014720054,0.000040555242],"category_scores_gemma":[0.0000049992505,0.00017387416,0.00011621574,0.00048148428,0.00036226134,0.00016468255,0.00000437065,0.000488272,0.00005905944],"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.000046388614,0.0015529809,0.00001680742,0.00015410401,0.00031408403,7.638248e-7,0.0024732137,0.2563895,0.6369913,0.0074930564,0.00010437991,0.09446337],"study_design_scores_gemma":[0.0007382287,0.00010998944,0.000065848944,0.00024583508,0.00007816486,0.000018463506,0.00028244045,0.0041960925,0.98362136,0.0017618551,0.008577569,0.0003041299],"about_ca_topic_score_codex":0.00009325643,"about_ca_topic_score_gemma":0.00030702562,"teacher_disagreement_score":0.8576903,"about_ca_system_score_codex":0.000098247634,"about_ca_system_score_gemma":0.00005655326,"threshold_uncertainty_score":0.70903826},"labels":[],"label_agreement":null},{"id":"W2101899205","doi":"10.1109/tcomm.2005.849792","title":"Accurate Performance Evaluation of Time-Hopping and Direct-Sequence UWB Systems in Multi-User Interference","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Time-hopping; Keying; Additive white Gaussian noise; Interference (communication); Bit error rate; Algorithm; Frequency-hopping spread spectrum; Phase-shift keying; Gaussian noise; Computer science; Modulation (music); Electronic engineering; Gaussian; Spread spectrum; Noise (video); Signal-to-noise ratio (imaging); Binary number; Telecommunications; White noise; Mathematics; Decoding methods; Physics; Engineering; Acoustics; Artificial intelligence; Pulse-amplitude modulation; Channel (broadcasting)","score_opus":0.07523173087991988,"score_gpt":0.30456971790822657,"score_spread":0.22933798702830668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101899205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8032486,0.0057222303,0.17971501,0.00096209825,0.00023940532,0.0014412809,0.000090761154,0.0008791315,0.0077015003],"genre_scores_gemma":[0.9902734,0.0045863176,0.004568563,0.000010746741,0.000003283894,0.00041723097,0.000007935512,0.000022853514,0.00010964557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889493,0.00018596319,0.00045210996,0.00015134658,0.00014626597,0.00016939102],"domain_scores_gemma":[0.9977721,0.00027523562,0.00007375663,0.0016780709,0.00016427544,0.000036534304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049060886,0.00015048288,0.00020538196,0.00035862048,0.00016201191,0.00002532455,0.0007886416,0.0001175262,0.000020805248],"category_scores_gemma":[0.000020029767,0.00016926027,0.00003374651,0.00048832106,0.00018207928,0.00034948223,0.000010150823,0.0004385276,0.00004517943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101204105,0.00033045525,0.0002445607,0.000050539562,0.00007673673,8.3735465e-8,0.0012124444,0.8250264,0.038969785,0.00024846933,0.000025397872,0.13380502],"study_design_scores_gemma":[0.0004311758,0.00002713296,0.0008615887,0.00020572645,0.000044184493,0.000006551106,0.00015968573,0.9874402,0.009799747,0.000008984639,0.00084730744,0.000167661],"about_ca_topic_score_codex":0.00008663336,"about_ca_topic_score_gemma":0.0006374075,"teacher_disagreement_score":0.18702483,"about_ca_system_score_codex":0.0002101512,"about_ca_system_score_gemma":0.000043639386,"threshold_uncertainty_score":0.69022334},"labels":[],"label_agreement":null},{"id":"W2102105576","doi":"10.1109/tcomm.2009.03.070115","title":"Optimal adaptive modulation and coding with switching costs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Link adaptation; Fading; Coding (social sciences); Computer science; Markov decision process; Adaptive coding; Mathematical optimization; Monotonic function; Markov process; Control theory (sociology); Channel (broadcasting); Mathematics; Algorithm; Telecommunications","score_opus":0.015728875812314063,"score_gpt":0.23497690477160763,"score_spread":0.21924802895929357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102105576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011870294,0.00013172353,0.9855184,0.00022875857,0.000049375634,0.00021843554,0.000007788335,0.00039936212,0.0015758419],"genre_scores_gemma":[0.8884227,0.00082217046,0.110621676,0.00003571288,0.000011411769,0.00003389395,0.000008400577,0.00002430303,0.000019715879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994309,0.000033407043,0.0001611586,0.00013021164,0.00009623509,0.00014807437],"domain_scores_gemma":[0.9991887,0.00011684645,0.00003348224,0.0005494241,0.00005143986,0.000060108432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051810657,0.00013945272,0.00011494793,0.000118273805,0.00036500063,0.000037107304,0.00016541524,0.00005723861,0.000005411282],"category_scores_gemma":[0.0000012886426,0.0001476939,0.000022485283,0.00028273065,0.000040768165,0.00034680523,0.0000012163887,0.00029846994,0.0000050604713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016751816,0.000035445373,0.0000030420379,0.0000021385188,0.000019164207,2.8586012e-7,0.00022968803,0.9340989,0.0012207404,0.00063779845,0.0000073559295,0.06372872],"study_design_scores_gemma":[0.00029427497,0.0000843974,0.00032650516,0.00007440125,0.000024100831,0.00000927067,0.00010706935,0.9975525,0.0012023731,0.0000935063,0.000062412975,0.00016920375],"about_ca_topic_score_codex":0.000005421496,"about_ca_topic_score_gemma":0.000052071544,"teacher_disagreement_score":0.8765524,"about_ca_system_score_codex":0.0001257466,"about_ca_system_score_gemma":0.000009473323,"threshold_uncertainty_score":0.6022783},"labels":[],"label_agreement":null},{"id":"W2102169767","doi":"10.1109/26.871391","title":"Gallager codes for CDMA applications .I. Generalizations, constructions, and performance bounds","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Algorithm; Additive white Gaussian noise; Decoding methods; Code division multiple access; Fading; Computer science; Frame (networking); Turbo code; Mathematics; Theoretical computer science; Low-density parity-check code; White noise; Telecommunications","score_opus":0.015325679743627306,"score_gpt":0.25404894938696393,"score_spread":0.23872326964333662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102169767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063548917,0.0011618643,0.9833544,0.0005025503,0.000068574125,0.0010680144,0.0002526668,0.0014188788,0.0058181817],"genre_scores_gemma":[0.8616351,0.026891913,0.10659339,0.000114611066,0.00002302043,0.0036908227,0.00009277475,0.00006804677,0.0008903304],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989606,0.000059533002,0.00041514024,0.00021881713,0.000112162794,0.00023373494],"domain_scores_gemma":[0.9975395,0.00027803716,0.000047972047,0.0019073368,0.00012785268,0.00009929932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011966344,0.00022501081,0.0002055155,0.00020739174,0.0011715356,0.00007832818,0.00066643953,0.00012499753,0.0001561982],"category_scores_gemma":[0.000002697827,0.00026829285,0.000078715086,0.00042298352,0.00030879275,0.00034009642,0.0000047172653,0.00030577835,0.000043437147],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034635246,0.00036100496,0.000086331725,0.0001410808,0.00018072152,9.2866316e-8,0.0004186199,0.09505888,0.0030553935,0.015910385,0.0015278219,0.883225],"study_design_scores_gemma":[0.0011154219,0.00015882116,0.00037905967,0.00013673553,0.00018077521,0.00006473015,0.00024322169,0.43114844,0.029313408,0.004143203,0.5320064,0.0011097793],"about_ca_topic_score_codex":0.0000091618895,"about_ca_topic_score_gemma":0.000059385362,"teacher_disagreement_score":0.88211524,"about_ca_system_score_codex":0.00010216851,"about_ca_system_score_gemma":0.000032190837,"threshold_uncertainty_score":0.99997693},"labels":[],"label_agreement":null},{"id":"W2102226403","doi":"10.1109/tcomm.2003.811421","title":"A method for increasing downlink capacity by coded multiuser transmission with a base station antenna array","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"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; Electronic engineering; Base station; Pairwise error probability; Antenna array; Algorithm; Transmission (telecommunications); Antenna diversity; Antenna (radio); Fading; Decoding methods; Telecommunications; Engineering","score_opus":0.03105875438405074,"score_gpt":0.29108862391625656,"score_spread":0.2600298695322058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102226403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010118721,0.00027867933,0.99529856,0.00048126996,0.000036458674,0.00078815134,0.0003974975,0.0009719211,0.0007355892],"genre_scores_gemma":[0.43864602,0.0008436963,0.5596682,0.00006659789,0.0000021487108,0.00058992516,0.00006527803,0.000058493428,0.000059626625],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984166,0.00048333636,0.00041439725,0.00025029277,0.00016630844,0.00026908738],"domain_scores_gemma":[0.9965001,0.0011532716,0.00008863404,0.0018642754,0.00026190697,0.00013183549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042391365,0.0002704736,0.0002623897,0.0001767208,0.00061901746,0.000044871234,0.00051387656,0.00014099485,0.000027771703],"category_scores_gemma":[0.000022174996,0.00027656177,0.000108160406,0.00047773833,0.00012240009,0.00034215846,0.0000014646605,0.00055040437,0.000007139373],"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.00015767846,0.0008738371,0.000007645047,0.00012321108,0.00019674553,4.0836744e-7,0.001571238,0.051688887,0.87992656,0.0016637336,0.000318232,0.063471794],"study_design_scores_gemma":[0.0013066118,0.000101680234,0.000009533863,0.00015699973,0.000108088156,0.000025418874,0.00027352636,0.20458946,0.7601309,0.0013303661,0.031478718,0.0004887117],"about_ca_topic_score_codex":0.000070808324,"about_ca_topic_score_gemma":0.00023325787,"teacher_disagreement_score":0.43763414,"about_ca_system_score_codex":0.00019050954,"about_ca_system_score_gemma":0.00005882424,"threshold_uncertainty_score":0.99996865},"labels":[],"label_agreement":null},{"id":"W2103117825","doi":"10.1109/tcomm.2004.826351","title":"Design of Nonuniformly Spaced Tapped-Delay-Line Equalizers for Sparse Multipath Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Channel (broadcasting); Delay spread; Filter (signal processing); Multipath propagation; Algorithm; Computer science; Matched filter; Control theory (sociology); Raised-cosine filter; Minimum mean square error; Electronic engineering; Mathematics; Filter design; Root-raised-cosine filter; Engineering; Telecommunications; Statistics","score_opus":0.07746427210293072,"score_gpt":0.31266530155029737,"score_spread":0.23520102944736665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103117825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078164146,0.0003284069,0.9956634,0.0005246088,0.00015554736,0.0011859866,0.00014224347,0.0009220557,0.0002960928],"genre_scores_gemma":[0.683492,0.0020555346,0.3134701,0.000029919976,0.000008158784,0.0008043695,0.000022878708,0.000065261745,0.000051757597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987407,0.00008265943,0.00056766026,0.00017541101,0.0001559406,0.00027763093],"domain_scores_gemma":[0.9964247,0.0005526486,0.00012980087,0.0025941688,0.000204098,0.00009458751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026543025,0.00025249648,0.00031180473,0.0003125663,0.00032745628,0.000020949921,0.0011734506,0.00015242629,0.0000151821805],"category_scores_gemma":[0.00001610025,0.00028955267,0.00015368928,0.0004573538,0.00020076305,0.00026974003,0.000008474653,0.00039284496,0.000020161204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003465461,0.00029635621,2.1095983e-7,0.00003736367,0.00006986766,1.7110926e-7,0.0006980562,0.9610208,0.027794013,0.0021181654,0.00003870361,0.007891636],"study_design_scores_gemma":[0.0018135513,0.0003053402,0.0000020748753,0.0002159088,0.00008532122,0.000007658796,0.00034328498,0.4528946,0.5356352,0.0054427837,0.0027404628,0.00051385874],"about_ca_topic_score_codex":0.0000443457,"about_ca_topic_score_gemma":0.000069373775,"teacher_disagreement_score":0.68271035,"about_ca_system_score_codex":0.00019937672,"about_ca_system_score_gemma":0.00006191664,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W2103435488","doi":"10.1109/tcomm.2009.0901.060118","title":"Design of irregular LDPC codes for BIAWGN channels with SNR mismatch","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Additive white Gaussian noise; Noisy-channel coding theorem; Decoding methods; Turbo code; Signal-to-noise ratio (imaging); Channel (broadcasting); Concatenated error correction code; Computer science; Belief propagation; Binary number; Mathematics; Error floor; Block code; Telecommunications; Arithmetic","score_opus":0.05956928053002612,"score_gpt":0.302457746603452,"score_spread":0.24288846607342585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103435488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003704808,0.00009264143,0.9938947,0.0038171345,0.00012008713,0.00075469504,0.000011653611,0.0005972012,0.00034142545],"genre_scores_gemma":[0.57474184,0.000071540126,0.42475805,0.00012180298,0.000005094169,0.00015434854,0.0000017094329,0.00001118729,0.0001344119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988094,0.00017382774,0.00031216358,0.00027536045,0.00019993419,0.00022931425],"domain_scores_gemma":[0.9960601,0.0006914561,0.00015677263,0.0027416507,0.00028309773,0.000066966946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040564698,0.00017537423,0.00023381754,0.000252549,0.00043399533,0.00006461795,0.0021789486,0.000085413776,0.00000395879],"category_scores_gemma":[0.000010487776,0.00016759946,0.00009748931,0.0006511039,0.0001237728,0.00031146043,0.0000062641625,0.00023891716,0.0000058731166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005059212,0.00812295,0.00002016145,0.00016099689,0.00056432834,0.0000057872126,0.01847379,0.26725814,0.13344105,0.07121073,0.005308722,0.49492744],"study_design_scores_gemma":[0.00094664324,0.0022556249,0.00005627626,0.00032963086,0.00010738594,0.000051599727,0.00017464539,0.5178551,0.45785892,0.01795031,0.0017762876,0.00063758565],"about_ca_topic_score_codex":0.00003456062,"about_ca_topic_score_gemma":0.00003460379,"teacher_disagreement_score":0.5743714,"about_ca_system_score_codex":0.00005648737,"about_ca_system_score_gemma":0.00010361719,"threshold_uncertainty_score":0.68345076},"labels":[],"label_agreement":null},{"id":"W2103642899","doi":"10.1109/tcomm.2005.857160","title":"DC-Free Error-Control Block Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Block code; Concatenated error correction code; Linear code; Turbo code; Computer science; BCH code; Serial concatenated convolutional codes; List decoding; Algorithm; Low-density parity-check code; Tornado code; Forward error correction; Decoding methods; Theoretical computer science","score_opus":0.033329838642760554,"score_gpt":0.29479614562807477,"score_spread":0.2614663069853142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103642899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077698135,0.00016494961,0.9673826,0.02091493,0.00026415888,0.0003326759,0.000027630858,0.00189739,0.00823868],"genre_scores_gemma":[0.7775262,0.00011772029,0.22065891,0.0008117729,0.000027824464,0.0001919277,0.0000011653324,0.000021017475,0.00064344675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998399,0.0002522493,0.00038514513,0.00035836082,0.00028497123,0.0003202703],"domain_scores_gemma":[0.9924985,0.00063000317,0.000120117606,0.006456493,0.00017234468,0.00012251458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038155165,0.0002164319,0.00021155439,0.00029141075,0.0007996344,0.0001345899,0.005378246,0.00011615394,0.000028292434],"category_scores_gemma":[0.000028241162,0.00023301803,0.00017171424,0.00063283,0.00015126402,0.00057597674,0.000031142587,0.00065436796,0.0002518862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010476007,0.007917778,0.00021570026,0.000053886655,0.0006865435,0.000011618763,0.01057372,0.06798111,0.028870512,0.11433032,0.036802385,0.7324517],"study_design_scores_gemma":[0.0026930838,0.0005044458,0.0005117861,0.00019812965,0.00017950649,0.00019909965,0.00016452036,0.7785058,0.09108648,0.012725015,0.11164588,0.0015862542],"about_ca_topic_score_codex":0.00010766592,"about_ca_topic_score_gemma":0.0013507386,"teacher_disagreement_score":0.77674925,"about_ca_system_score_codex":0.00016197994,"about_ca_system_score_gemma":0.00009611729,"threshold_uncertainty_score":0.9994208},"labels":[],"label_agreement":null},{"id":"W2103728008","doi":"10.1109/tcomm.2004.833197","title":"Sequence Detection and Adaptive Channel Estimation for ISI Channels Under Class-A Impulsive Noise","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"Intersymbol interference; Algorithm; Gaussian noise; Computer science; Noise (video); Channel (broadcasting); Estimation theory; Entropy (arrow of time); Upper and lower bounds; Maximum likelihood sequence estimation; Fading; Mathematics; Control theory (sociology); Artificial intelligence; Telecommunications; Decoding methods","score_opus":0.04773712568564409,"score_gpt":0.2836725320555676,"score_spread":0.2359354063699235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103728008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006018639,0.00044238885,0.990049,0.0013577339,0.0003246127,0.0006861366,0.00017649245,0.00040170975,0.00054325827],"genre_scores_gemma":[0.9804404,0.001431031,0.017054718,0.00009149271,0.000022503675,0.0008205248,0.000033430504,0.00005034303,0.000055566332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910665,0.000050016657,0.0003043045,0.00020115037,0.00010353915,0.00023435999],"domain_scores_gemma":[0.99807674,0.0002797533,0.000060861374,0.001322442,0.000150947,0.00010926767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014263019,0.00021657428,0.00017919838,0.00024327329,0.0008072086,0.000062557054,0.00046727672,0.00013085264,0.000005605668],"category_scores_gemma":[0.000009957689,0.00024648412,0.00009725584,0.00036276458,0.00016623654,0.00038117482,0.000007739147,0.00037613648,0.000026793996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032099026,0.00019641577,1.6772469e-7,0.000024938081,0.000095833464,1.8103049e-7,0.00086018135,0.9615751,0.0065500764,0.0028624034,0.000022435252,0.027780177],"study_design_scores_gemma":[0.0011498303,0.0002113933,0.0000607623,0.00010887045,0.00010879632,0.000022585202,0.00048607565,0.9555949,0.029608969,0.010970516,0.0012618304,0.0004154543],"about_ca_topic_score_codex":0.000076273995,"about_ca_topic_score_gemma":0.00050187984,"teacher_disagreement_score":0.97442174,"about_ca_system_score_codex":0.00025711814,"about_ca_system_score_gemma":0.000039723604,"threshold_uncertainty_score":0.99999875},"labels":[],"label_agreement":null},{"id":"W2103781515","doi":"10.1109/tcomm.2010.03.070333","title":"UWB receiver designs based on a gaussian-laplacian noise-plus-MAI model","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Additive white Gaussian noise; Rake receiver; Electronic engineering; Fading; Multipath propagation; Interference (communication); Bandwidth (computing); Rake; Computer science; Gaussian noise; Multipath interference; Matched filter; Gaussian; Algorithm; Telecommunications; White noise; Engineering; Physics; Channel (broadcasting); Decoding methods","score_opus":0.031008487362631978,"score_gpt":0.2561945189994218,"score_spread":0.22518603163678982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103781515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056802128,0.00005449953,0.9326375,0.0046845744,0.0004150184,0.0006038149,0.00015229343,0.00220438,0.053567678],"genre_scores_gemma":[0.9511529,0.0003049328,0.046644747,0.00037074974,0.000013358028,0.00067683175,0.000036365658,0.00009600107,0.00070411543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.000113425056,0.0004206549,0.0002823711,0.0002177428,0.0003816656],"domain_scores_gemma":[0.99318063,0.0005665699,0.00006179438,0.005938718,0.00010058725,0.00015171277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020984132,0.0003252917,0.0002685818,0.00057658,0.00078884297,0.00006692427,0.0024004655,0.00037800873,0.00022577333],"category_scores_gemma":[0.000022406934,0.0003629053,0.00017679084,0.00073737884,0.00033561868,0.00020319546,0.000008263908,0.0019476877,0.00043655778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040975443,0.00085026963,0.000008871332,0.000019634743,0.00010988847,0.0000012595714,0.00043309137,0.9163148,0.053567663,0.005458485,0.0018626355,0.021332469],"study_design_scores_gemma":[0.00063714944,0.00007283838,0.000047993683,0.000046795823,0.00007509983,0.000009619993,0.00006541526,0.95767486,0.028035102,0.00090659095,0.011997503,0.0004310148],"about_ca_topic_score_codex":0.000029987219,"about_ca_topic_score_gemma":0.001123684,"teacher_disagreement_score":0.94547266,"about_ca_system_score_codex":0.00019053424,"about_ca_system_score_gemma":0.00013974564,"threshold_uncertainty_score":0.9998823},"labels":[],"label_agreement":null},{"id":"W2103880125","doi":"10.1109/tcomm.2003.822704","title":"An Analytical Method for Approximate Performance Evaluation of Binary Linear Block Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Binary number; Additive white Gaussian noise; Algorithm; Mathematics; Series expansion; Phase-shift keying; Series (stratigraphy); Applied mathematics; Binary code; Gaussian; Keying; Focus (optics); Probability density function; Block (permutation group theory); Function (biology); Computer science; Decoding methods; White noise; Bit error rate; Statistics; Mathematical analysis; Telecommunications; Arithmetic; Combinatorics","score_opus":0.07551570766824982,"score_gpt":0.38350854639311377,"score_spread":0.30799283872486394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103880125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028698988,0.00016400884,0.96900505,0.00021319828,0.00005154612,0.0007135826,0.000091151924,0.0005573547,0.00050512387],"genre_scores_gemma":[0.6377827,0.0006434338,0.36094728,0.000013218833,0.0000059753916,0.0005366768,0.000032213575,0.000032073203,0.00000645294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988396,0.00015653884,0.00042964757,0.00015833111,0.00024544523,0.00017044925],"domain_scores_gemma":[0.996809,0.00026771994,0.00007839953,0.0023754467,0.000401291,0.000068122834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073212484,0.00016521206,0.00022363116,0.0002470235,0.00029584058,0.000012962278,0.0008811657,0.00011121564,0.000011661287],"category_scores_gemma":[0.000012580841,0.00018553686,0.00010168912,0.00041147848,0.00014126336,0.00030720694,0.0000046531773,0.00031395553,0.000005410764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015371717,0.00035659628,0.0000023691955,0.000034084278,0.000049917944,1.7268954e-8,0.00024171796,0.9489005,0.015112496,0.0014040059,0.000006250004,0.033876672],"study_design_scores_gemma":[0.0005008748,0.0001362184,0.00006165682,0.000059898688,0.00011520996,0.00000267442,0.00007649574,0.8669997,0.13065751,0.0010178831,0.00021201136,0.00015989538],"about_ca_topic_score_codex":0.000015632479,"about_ca_topic_score_gemma":0.000054048956,"teacher_disagreement_score":0.6090837,"about_ca_system_score_codex":0.0002012306,"about_ca_system_score_gemma":0.00007395934,"threshold_uncertainty_score":0.75659734},"labels":[],"label_agreement":null},{"id":"W2104090769","doi":"10.1109/tcomm.2011.102910.090386","title":"Interference Diversity Gain and its Application in Multi-Channel Systems: Capacity Maximization and QoS Guarantee Strategies","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; Quality of service; Interference (communication); Channel (broadcasting); Resource allocation; Diversity scheme; Spectral efficiency; Computer network; Wireless; Diversity gain; Throughput; Channel allocation schemes; Channel capacity; Fading; Electronic engineering; Telecommunications; Engineering","score_opus":0.04049512902770024,"score_gpt":0.25222478217223226,"score_spread":0.21172965314453202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104090769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054757763,0.00023860697,0.94368863,0.000055468376,0.00024789598,0.0005895795,0.000057801324,0.0002140931,0.00015017862],"genre_scores_gemma":[0.9949804,0.0011045607,0.0036364866,0.000006151849,0.00000912651,0.00020437014,0.000013077982,0.000021973397,0.000023847342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992677,0.00006995709,0.00026331138,0.00019115061,0.00006839715,0.00013948331],"domain_scores_gemma":[0.9991115,0.0001137911,0.00005627515,0.0005777231,0.00009266336,0.00004810143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001478104,0.00015667694,0.00015825932,0.00020913476,0.00035566505,0.000056003257,0.00026276565,0.00013304391,0.0000021655837],"category_scores_gemma":[0.000008459473,0.00018451939,0.000019112565,0.00024702668,0.00009353279,0.00053914794,0.000012852877,0.00044325984,0.000006742276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008591263,0.00011404529,0.00007168124,0.000097192424,0.000021928397,2.337059e-7,0.0023869823,0.98275965,0.011748582,0.0016697147,0.0000035082253,0.0011178864],"study_design_scores_gemma":[0.00040828204,0.00001550304,0.0003200175,0.000060849878,0.000017578546,0.000010200317,0.0009508261,0.99641484,0.0014314477,0.00016599766,0.00002407099,0.0001804115],"about_ca_topic_score_codex":0.00028338615,"about_ca_topic_score_gemma":0.0041553415,"teacher_disagreement_score":0.9402226,"about_ca_system_score_codex":0.00006809678,"about_ca_system_score_gemma":0.0000135171895,"threshold_uncertainty_score":0.75244826},"labels":[],"label_agreement":null},{"id":"W2104265071","doi":"10.1109/tcomm.2011.012711.090433","title":"DPC Rates and Multiplexing Gains for MIMO Broadcast Systems with Multi-Dimensional Space-Time Modulation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multiplexing; MIMO; Transmitter; Computer science; Transmission (telecommunications); Modulation (music); Spatial multiplexing; Space–time code; Wireless; Coding (social sciences); Disjoint sets; Electronic engineering; Topology (electrical circuits); Telecommunications; Mathematics; Channel (broadcasting); Engineering; Physics","score_opus":0.1369186114890206,"score_gpt":0.31023006074971227,"score_spread":0.17331144926069167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104265071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024283903,0.00056793116,0.9946861,0.00080703216,0.000121862984,0.00073376455,0.0000300081,0.00023199312,0.0003928874],"genre_scores_gemma":[0.8013343,0.0004568222,0.1971979,0.000082766775,0.000009807083,0.00029281073,0.000015121587,0.00002052581,0.0005899433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987281,0.00025900188,0.00030617503,0.00033524542,0.00014395652,0.00022752724],"domain_scores_gemma":[0.9970175,0.00054287055,0.00013283813,0.0018905888,0.00029781333,0.00011839878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030407688,0.00020469275,0.00020345973,0.00020261765,0.0012486322,0.00014027578,0.0009942481,0.00007402312,0.000013759537],"category_scores_gemma":[0.000011620354,0.00019012447,0.00006478632,0.00041154807,0.00022318985,0.0005194831,0.000029783147,0.00025850418,0.000026319512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006044073,0.0075826677,0.0011883645,0.0002078088,0.0013502829,0.000006540135,0.03749188,0.2866918,0.056695156,0.21944955,0.0012596977,0.38747182],"study_design_scores_gemma":[0.0009045348,0.00013943994,0.00095507473,0.00010720035,0.000022402506,0.000016577485,0.000079316815,0.9943353,0.0013712286,0.00007954553,0.0017284149,0.00026096817],"about_ca_topic_score_codex":0.000048006634,"about_ca_topic_score_gemma":0.00015595561,"teacher_disagreement_score":0.7989059,"about_ca_system_score_codex":0.00006356264,"about_ca_system_score_gemma":0.000058936505,"threshold_uncertainty_score":0.9603596},"labels":[],"label_agreement":null},{"id":"W2104527807","doi":"10.1109/tcomm.2008.060347","title":"Performance Improvement of Non-Data-Aided Feedforward Symbol Timing Estimation Using the \"Better Than\" Raised-Cosine Pulse","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advancements in PLL and VCO Technologies","field":"Engineering","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":"Raised-cosine filter; Pulse (music); Computer science; Trigonometric functions; Symbol (formal); Pulse shaping; Discrete cosine transform; Electronic engineering; Algorithm; Mathematics; Engineering; Telecommunications; Artificial intelligence; Physics; Bandwidth (computing); Power (physics)","score_opus":0.07818573419489822,"score_gpt":0.3004064761627917,"score_spread":0.2222207419678935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104527807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30322933,0.000079162375,0.69512236,0.00031337305,0.00015360002,0.00031641402,0.000066923734,0.00019020437,0.00052862905],"genre_scores_gemma":[0.96410316,0.0010267886,0.03462756,0.000036186462,0.00001039945,0.0000915016,0.000036052435,0.000024713188,0.00004365311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991361,0.000017003666,0.000358362,0.00013939283,0.00016670201,0.0001824264],"domain_scores_gemma":[0.99740976,0.00012185512,0.000082973296,0.0023012292,0.000060698127,0.000023470535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012208192,0.00015760712,0.000162732,0.00012779616,0.0006009291,0.000013549752,0.0010765775,0.00006686181,0.000036198446],"category_scores_gemma":[0.0000064620467,0.00013184626,0.000054519387,0.00032041853,0.00023311604,0.00040120917,0.000021978552,0.00034000317,0.000012052872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016876847,0.000246118,0.00013054292,0.00008479724,0.00019738135,5.160624e-7,0.00074506196,0.83545893,0.04435661,0.000015693482,0.00026268134,0.11848478],"study_design_scores_gemma":[0.00026461302,0.000045717912,0.00036056963,0.00007982794,0.00005977015,0.0000091944885,0.00019432252,0.91934294,0.079211965,0.000031181044,0.00025070345,0.00014921691],"about_ca_topic_score_codex":0.000025648753,"about_ca_topic_score_gemma":0.00001448967,"teacher_disagreement_score":0.66087383,"about_ca_system_score_codex":0.00008379916,"about_ca_system_score_gemma":0.000023304588,"threshold_uncertainty_score":0.53765345},"labels":[],"label_agreement":null},{"id":"W2104758809","doi":"10.1109/tcomm.2005.851582","title":"Sample Rejection for Efficient Simulation of Binary Coding Schemes Over Quantized Additive White Gaussian Noise Channels","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Decoding methods; Algorithm; Additive white Gaussian noise; Binary number; Computer science; Hypersphere; Curse of dimensionality; Gaussian noise; Mathematics; White noise; Telecommunications; Artificial intelligence; Arithmetic","score_opus":0.05092323093219039,"score_gpt":0.3348693885056417,"score_spread":0.2839461575734513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104758809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076228124,0.00004325026,0.98922145,0.0011206246,0.00033791034,0.00072419207,0.000100475816,0.0005860791,0.00024318002],"genre_scores_gemma":[0.8084375,0.00006141105,0.19104746,0.00006517928,0.000025958549,0.00024622216,0.000016241838,0.000020572383,0.000079396625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857545,0.00017057337,0.00045942212,0.0003325969,0.00022897271,0.00023301097],"domain_scores_gemma":[0.99602246,0.0015887603,0.00026840332,0.0017504303,0.00030457543,0.0000653921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004114456,0.00018310705,0.00022309227,0.00045357432,0.00066500594,0.00006391694,0.0010128953,0.00010883132,0.000022484195],"category_scores_gemma":[0.00007282836,0.00020296121,0.00019011447,0.00076860184,0.00010461353,0.0004169729,0.000019145033,0.00028269368,0.000008841953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001005821,0.0012258239,0.000022083326,0.0000341822,0.00007879637,1.6097387e-7,0.003996895,0.9276173,0.015038564,0.00783106,0.00023182823,0.043822683],"study_design_scores_gemma":[0.00043218484,0.00016601961,0.00011806747,0.00011286023,0.00003064967,0.0000018186441,0.00009287204,0.95582443,0.040716957,0.0002290753,0.0020786533,0.00019639451],"about_ca_topic_score_codex":0.000060938193,"about_ca_topic_score_gemma":0.000091563685,"teacher_disagreement_score":0.80081475,"about_ca_system_score_codex":0.00018289105,"about_ca_system_score_gemma":0.000074989206,"threshold_uncertainty_score":0.82765174},"labels":[],"label_agreement":null},{"id":"W2104878965","doi":"10.1109/tcomm.2010.082010.090256","title":"Error Performance Analysis of BPSK Modulation in Physical-Layer Network-Coded Bidirectional Relay Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Relay channel; Phase-shift keying; Rayleigh fading; Linear network coding; Bit error rate; Computer science; Algorithm; Topology (electrical circuits); Fading; Node (physics); Mathematics; Decoding methods; Computer network; Network packet; Engineering; Physics; Combinatorics","score_opus":0.04881039997255162,"score_gpt":0.3068714708438505,"score_spread":0.2580610708712989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104878965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15755466,0.00008800304,0.83910847,0.00091476255,0.0003822855,0.00025155678,0.000008331139,0.00014828252,0.0015436563],"genre_scores_gemma":[0.9828804,0.00095030566,0.015691618,0.00011135037,0.000033041833,0.00013018263,0.000025620884,0.000014329538,0.000163127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983376,0.00033292655,0.0005048853,0.0003194532,0.00024270239,0.00026242872],"domain_scores_gemma":[0.99581754,0.0006661513,0.00020202484,0.002999151,0.00023464226,0.00008047042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054521527,0.00018856015,0.0003363077,0.0005953644,0.0005834286,0.0000606312,0.0018023672,0.00012427443,0.00005352026],"category_scores_gemma":[0.000011904357,0.00019765938,0.00020263385,0.004273118,0.00016774787,0.00050242915,0.000037010148,0.0010344131,0.000014914515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011605214,0.00040296084,0.0009599856,0.0000021460053,0.0001696472,1.130217e-7,0.00052364805,0.9472959,0.0018869287,0.0066325874,0.0000527836,0.04206169],"study_design_scores_gemma":[0.00024540373,0.000036465364,0.03184788,0.00002200214,0.00009080433,0.0000013374035,0.000009743393,0.9660821,0.0006074522,0.00009335743,0.000780294,0.00018314528],"about_ca_topic_score_codex":0.00004010799,"about_ca_topic_score_gemma":0.0029042563,"teacher_disagreement_score":0.8253258,"about_ca_system_score_codex":0.000065238615,"about_ca_system_score_gemma":0.00006928065,"threshold_uncertainty_score":0.8060315},"labels":[],"label_agreement":null},{"id":"W2105077230","doi":"10.1109/tcomm.2007.902500","title":"Tree-Search Multiple-Symbol Differential Decoding for Unitary Space-Time Modulation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"MIMO; Fading; Channel state information; Algorithm; Decoding methods; Computer science; Benchmark (surveying); Tree (set theory); Unitary matrix; Channel (broadcasting); Computational complexity theory; Mathematics; Telecommunications; Unitary state; Wireless","score_opus":0.038160652505204104,"score_gpt":0.2980205812435675,"score_spread":0.2598599287383634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105077230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019801183,0.00010711686,0.97579324,0.00031166372,0.00014350154,0.0007788279,0.00008799931,0.0013646974,0.001611764],"genre_scores_gemma":[0.87295485,0.0005090825,0.12585272,0.000020629714,0.00002776639,0.00028841704,0.00009193588,0.000082710576,0.00017188957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872595,0.00008028451,0.00045884852,0.00019547332,0.00018439318,0.00035507488],"domain_scores_gemma":[0.99623746,0.0013589842,0.00005393278,0.00206572,0.00016301528,0.00012087532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028946606,0.00023391537,0.0002213535,0.0004482052,0.000701937,0.000039447084,0.000964885,0.00016091084,0.000053210606],"category_scores_gemma":[0.000016833634,0.0002797235,0.00015671195,0.00044038973,0.00013814443,0.00029783155,0.000010631317,0.0005299959,0.000047947164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012676392,0.00070228736,0.00007615607,0.00007906881,0.00022790546,6.054826e-7,0.0015078674,0.22770976,0.26929024,0.0023637966,0.00036422862,0.49755132],"study_design_scores_gemma":[0.0005265863,0.000050005652,0.0003628777,0.000052084855,0.00003393714,0.0000027792223,0.00022156072,0.8598411,0.13722807,0.00041035458,0.0009684664,0.00030213292],"about_ca_topic_score_codex":0.000031769327,"about_ca_topic_score_gemma":0.00044433385,"teacher_disagreement_score":0.85315365,"about_ca_system_score_codex":0.00021609502,"about_ca_system_score_gemma":0.0000224465,"threshold_uncertainty_score":0.9999655},"labels":[],"label_agreement":null},{"id":"W2105451798","doi":"10.1109/tcomm.2003.809263","title":"Dynamic rate adaptation based on multidimensional multicode DS-CDMA in cellular wireless networks","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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; University of Victoria; Simon Fraser University","funders":"","keywords":"Computer science; Fading; Code division multiple access; Base station; Multipath propagation; Telecommunications link; Cellular network; Computer network; Throughput; Network packet; Link adaptation; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.036282890273090986,"score_gpt":0.28670160399627204,"score_spread":0.25041871372318103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105451798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004162911,0.00018008257,0.99053425,0.0028284928,0.00029685596,0.00067233236,0.000011780584,0.00025071457,0.0010626005],"genre_scores_gemma":[0.9117629,0.00051052857,0.0866032,0.00040684437,0.0000051857883,0.00043327472,0.000031906362,0.000042667598,0.00020352633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99546933,0.002263726,0.00064388016,0.00057271594,0.00050376356,0.000546593],"domain_scores_gemma":[0.99135196,0.0026877024,0.00017152913,0.005333582,0.00025914083,0.00019606018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012184884,0.0003218103,0.00029791548,0.0006563388,0.0008928393,0.0001466324,0.002761974,0.00021059482,0.000045415207],"category_scores_gemma":[0.000041358697,0.00035282294,0.00016063364,0.0017313911,0.00024729403,0.00044509312,0.000028763132,0.0013993998,0.00012849976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029065022,0.001161574,0.000014608409,0.0000054196216,0.000018951065,0.000003356823,0.00027187445,0.9699299,0.00093975564,0.009361285,0.000033576915,0.01823066],"study_design_scores_gemma":[0.0011756665,0.00008583877,0.0003175708,0.00011259942,0.000009154403,0.0000025370057,0.00007587222,0.9949907,0.0016981737,0.00022351336,0.0009797274,0.0003286246],"about_ca_topic_score_codex":0.00011400941,"about_ca_topic_score_gemma":0.001102497,"teacher_disagreement_score":0.9075999,"about_ca_system_score_codex":0.00039700323,"about_ca_system_score_gemma":0.00028916923,"threshold_uncertainty_score":0.99989235},"labels":[],"label_agreement":null},{"id":"W2105551413","doi":"10.1109/tcomm.2004.829516","title":"Exact Error-Rate Analysis of Diversity 16-QAM With Channel Estimation Error","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Quadrature amplitude modulation; Bit error rate; QAM; Estimator; Rayleigh fading; Diversity combining; Fading; Transmit diversity; Channel (broadcasting); Algorithm; Mathematics; Sensitivity (control systems); Maximal-ratio combining; Antenna diversity; Phase-shift keying; Computer science; Decorrelation; Electronic engineering; Statistics; Telecommunications; Engineering; Antenna (radio)","score_opus":0.041264321405480815,"score_gpt":0.2869912575860922,"score_spread":0.24572693618061137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105551413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027260162,0.00010782467,0.9695681,0.00047679144,0.000037427482,0.00028851864,0.00011204805,0.00074978056,0.0013993842],"genre_scores_gemma":[0.96066636,0.0007200708,0.03830776,0.000033671993,0.0000022816193,0.00012874563,0.000069218106,0.000033641914,0.00003822938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904,0.00008844759,0.00034634426,0.00016547651,0.00018340095,0.00017631696],"domain_scores_gemma":[0.99692947,0.0001972971,0.00012321549,0.002519008,0.00015603787,0.000074959295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015694698,0.00020063961,0.00031152263,0.0006701463,0.00055899104,0.000017158221,0.000987604,0.000096929536,0.00003396339],"category_scores_gemma":[0.0000055563523,0.000213794,0.00015616458,0.0017227458,0.00022330236,0.00036570375,0.000019146357,0.0003966009,0.000014388833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000145260665,0.00022140762,0.00001656084,0.000015590129,0.00048552518,2.0201476e-7,0.0007785489,0.99418634,0.0006235837,0.000637947,0.000009222471,0.0030105293],"study_design_scores_gemma":[0.0011801583,0.00022910291,0.003713332,0.00022674463,0.0019593427,0.000005228612,0.0008274724,0.91193753,0.07608915,0.0027430414,0.0002912235,0.0007976927],"about_ca_topic_score_codex":0.00035354632,"about_ca_topic_score_gemma":0.0022434893,"teacher_disagreement_score":0.93340623,"about_ca_system_score_codex":0.00031136334,"about_ca_system_score_gemma":0.00003156176,"threshold_uncertainty_score":0.8718266},"labels":[],"label_agreement":null},{"id":"W2105552720","doi":"10.1109/tcomm.2010.07.090297","title":"Communications over the Best Singular Mode of a Reciprocal MIMO Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"MIMO; Channel (broadcasting); Computer science; Fading; Mode (computer interface); Transmission (telecommunications); Reciprocal; Algorithm; Computer network; Telecommunications","score_opus":0.028304484361192487,"score_gpt":0.29984824519515585,"score_spread":0.27154376083396337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105552720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012398101,0.00078291143,0.9710908,0.0027025037,0.00036550465,0.00086012465,0.00019215643,0.0011006764,0.010507238],"genre_scores_gemma":[0.9475136,0.004320395,0.04725203,0.00008914489,0.000015144442,0.0006039487,0.000026997495,0.00007277367,0.00010597097],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986562,0.00015945164,0.00055914535,0.00016572756,0.00021668554,0.00024278833],"domain_scores_gemma":[0.9897773,0.00080098526,0.00012485478,0.009002802,0.00020737472,0.000086639855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022174971,0.00024077187,0.00025137016,0.00022812381,0.0007885969,0.00003779972,0.0038799257,0.00018812405,0.000042474825],"category_scores_gemma":[0.00002314633,0.00022598423,0.00017365701,0.00064321177,0.00090121274,0.00025809163,0.000041939882,0.0016028126,0.000042249005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000862276,0.0060063195,0.000096523945,0.00022467553,0.0009952808,0.000001209525,0.010599663,0.16464658,0.4027917,0.08689786,0.0024192536,0.32523468],"study_design_scores_gemma":[0.0007716711,0.00013468148,0.00017566553,0.00023406654,0.00021407355,0.000029958557,0.00091329694,0.7428182,0.17964095,0.009622649,0.064548925,0.0008958735],"about_ca_topic_score_codex":0.00014022825,"about_ca_topic_score_gemma":0.0013140679,"teacher_disagreement_score":0.9351155,"about_ca_system_score_codex":0.000069742724,"about_ca_system_score_gemma":0.000049430953,"threshold_uncertainty_score":0.921537},"labels":[],"label_agreement":null},{"id":"W2105749229","doi":"10.1109/tcomm.2011.080111.090524","title":"Closed-Form Error Analysis of Variable-Gain Multihop Systems in Nakagami-m Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Nakagami distribution; Fading; Hypergeometric function; Mathematics; Bessel function; Random variable; Elementary function; Applied mathematics; Topology (electrical circuits); Algorithm; Computer science; Statistics; Mathematical analysis; Decoding methods; Combinatorics","score_opus":0.11688496621535671,"score_gpt":0.30946869793608434,"score_spread":0.19258373172072762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105749229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038456842,0.00050604617,0.9889749,0.00030485203,0.00032096202,0.00037971028,0.000025369784,0.0001525039,0.005489949],"genre_scores_gemma":[0.9706112,0.0012130124,0.02759319,0.00009100019,0.000005877352,0.00020132854,0.000010891071,0.000014270992,0.0002591982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798584,0.000518595,0.0006979942,0.00031109113,0.00021363013,0.00027286986],"domain_scores_gemma":[0.99515283,0.0005448816,0.00022347222,0.0037285455,0.00025349532,0.00009679624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007404243,0.00019510834,0.00041155328,0.0012065182,0.00043721817,0.00006687038,0.003025121,0.00010616264,0.000058715083],"category_scores_gemma":[0.000017709719,0.00020648669,0.0001825335,0.0044259527,0.0001387089,0.0004755767,0.00004829275,0.00046050988,0.000021030322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006895677,0.0047722487,0.00084787793,0.00007491692,0.002503281,0.00000445235,0.05631613,0.53705025,0.0055936207,0.29365137,0.00013788558,0.098979],"study_design_scores_gemma":[0.0003859515,0.000057002457,0.0013143629,0.00010381803,0.00015160111,0.0000017982602,0.0003345906,0.9954292,0.0010223022,0.00024010756,0.0007121907,0.00024708148],"about_ca_topic_score_codex":0.00052430277,"about_ca_topic_score_gemma":0.0010395386,"teacher_disagreement_score":0.9667655,"about_ca_system_score_codex":0.00014256951,"about_ca_system_score_gemma":0.00008987,"threshold_uncertainty_score":0.84202826},"labels":[],"label_agreement":null},{"id":"W2105785674","doi":"10.1109/tcomm.2006.874006","title":"Efficient design of FMT systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Digital Filter Design and Implementation","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":"McMaster University","funders":"","keywords":"Computer science; Transceiver; Electronic engineering; Iterative method; Matched filter; Channel (broadcasting); Design methods; Systems design; Filter (signal processing); Engineering; Algorithm; Wireless; Telecommunications; Computer vision","score_opus":0.06161142283313114,"score_gpt":0.2820327095995154,"score_spread":0.22042128676638423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105785674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003283239,0.000087638895,0.9942403,0.00036025132,0.00022048382,0.00031789683,0.000021780237,0.00012617538,0.004297137],"genre_scores_gemma":[0.9476041,0.000018592014,0.051842798,0.000028679204,0.0000061219234,0.00008734022,0.000004359774,0.00000741872,0.00040059938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903077,0.00015366955,0.00033087694,0.0001499198,0.00019763265,0.00013710909],"domain_scores_gemma":[0.9980302,0.000267235,0.00010032219,0.0014610862,0.0001060865,0.000035101795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019168068,0.00009278442,0.00010938776,0.00017509337,0.00020129135,0.00010203147,0.0010802771,0.000030512338,0.0000068174795],"category_scores_gemma":[0.0000017109936,0.0000939013,0.000060448732,0.00045253852,0.00006819067,0.00016992734,0.0000060740836,0.00009174222,0.00005417014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010345176,0.0012130757,0.0000057439916,0.000018515966,0.00003900431,6.7114985e-7,0.00037181316,0.8451863,0.011339917,0.12258705,0.0011389119,0.018088672],"study_design_scores_gemma":[0.00038427056,0.00015068866,0.00011816552,0.000038865608,0.000018321143,0.00000963976,0.00005857988,0.9805141,0.015727038,0.0014044127,0.0014003307,0.00017555035],"about_ca_topic_score_codex":0.00015464162,"about_ca_topic_score_gemma":0.000010192582,"teacher_disagreement_score":0.94727576,"about_ca_system_score_codex":0.00004859341,"about_ca_system_score_gemma":0.0000520703,"threshold_uncertainty_score":0.3829184},"labels":[],"label_agreement":null},{"id":"W2106325446","doi":"10.1109/tcomm.2005.860059","title":"Infinite Series Representations of the Trivariate and Quadrivariate Rayleigh Distribution and Their Applications","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":71,"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":"Mathematics; Rayleigh fading; Probability density function; Rayleigh distribution; Moment-generating function; Series (stratigraphy); Cumulative distribution function; Random variable; Joint probability distribution; Moment (physics); Applied mathematics; Rayleigh scattering; Function (biology); Statistics; Mathematical analysis; Fading; Physics","score_opus":0.015281729968398917,"score_gpt":0.25523615014418416,"score_spread":0.23995442017578525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106325446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004430633,0.0006561909,0.98796815,0.004107263,0.000044659602,0.00068532664,0.00042786455,0.00045501307,0.0012249027],"genre_scores_gemma":[0.98059195,0.005999648,0.012605768,0.00003520126,0.00001070012,0.00060352776,0.000033652515,0.000027009637,0.00009256854],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991095,0.00013001077,0.00039415056,0.00014663306,0.000088171226,0.00013152837],"domain_scores_gemma":[0.99730814,0.000389308,0.000102183796,0.0020440689,0.00010044142,0.000055883054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013784785,0.00016598974,0.00017861463,0.000094224684,0.00059501204,0.00003376459,0.00061061315,0.00008625508,0.000009948799],"category_scores_gemma":[0.000010397722,0.00014338433,0.00006511,0.00046020228,0.000425649,0.00034047535,0.000024673458,0.0003741602,0.0000031897157],"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.00009967012,0.001978085,0.00033721447,0.00031017044,0.0008171057,1.5360509e-7,0.010740819,0.20213512,0.1029573,0.26354045,0.0010265607,0.41605738],"study_design_scores_gemma":[0.0024605903,0.00022330647,0.010515378,0.00042807977,0.00040260373,0.00010685265,0.0024006062,0.24137151,0.45669392,0.05292937,0.230723,0.0017447836],"about_ca_topic_score_codex":0.00002559242,"about_ca_topic_score_gemma":0.00017207055,"teacher_disagreement_score":0.9761613,"about_ca_system_score_codex":0.000057907604,"about_ca_system_score_gemma":0.000020253547,"threshold_uncertainty_score":0.58470434},"labels":[],"label_agreement":null},{"id":"W2107428208","doi":"10.1109/tcomm.2009.0901.060523","title":"Exact error probability analysis of rectangular QAM for single- and multichannel reception in nakagami-m fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Quadrature amplitude modulation; Hypergeometric function; QAM; Mathematics; Independent and identically distributed random variables; Algorithm; Statistics; Topology (electrical circuits); Random variable; Combinatorics; Bit error rate; Mathematical analysis","score_opus":0.05541987781601642,"score_gpt":0.30583888318585334,"score_spread":0.2504190053698369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107428208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07916668,0.00040269384,0.91833067,0.00047315125,0.000054923155,0.0008303398,0.00007767526,0.0004131391,0.00025074428],"genre_scores_gemma":[0.9379016,0.0009863024,0.06069535,0.000019851812,0.000003937291,0.00032090244,0.000035643123,0.000022282595,0.00001412227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989207,0.00011705695,0.00049397646,0.00019321212,0.00009644183,0.00017862848],"domain_scores_gemma":[0.99776036,0.00045143932,0.00009301977,0.0015296276,0.000114427094,0.00005111433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029808294,0.00016739122,0.00033835953,0.0007010232,0.00014145742,0.000017954626,0.00045835823,0.000121652854,0.000007991161],"category_scores_gemma":[0.000029637074,0.00019923564,0.00013724747,0.0011603556,0.00010803931,0.000237919,0.000004186463,0.00027746888,7.478078e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048359412,0.0008625587,0.000036239984,0.000070548616,0.0002684988,1.2297518e-7,0.0033090366,0.7937092,0.10828936,0.0006079183,0.000009618346,0.092788495],"study_design_scores_gemma":[0.00052382774,0.00020227721,0.0011364606,0.00015665065,0.00032353034,0.000001677785,0.00025010656,0.8923036,0.101506494,0.0029154671,0.00031604187,0.00036385402],"about_ca_topic_score_codex":0.000026073363,"about_ca_topic_score_gemma":0.000315392,"teacher_disagreement_score":0.8587349,"about_ca_system_score_codex":0.0001959671,"about_ca_system_score_gemma":0.000010129115,"threshold_uncertainty_score":0.81245935},"labels":[],"label_agreement":null},{"id":"W2107883234","doi":"10.1109/tcomm.2010.06.090121","title":"New designs for bit-interleaved coded modulation with hard-decision feedback iterative decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"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; Computer science; Convolutional code; Fading; Algorithm; Bit error rate; Transmission (telecommunications); Error detection and correction; Forward error correction; Modulation (music); Computer engineering; Electronic engineering; Telecommunications; Engineering","score_opus":0.04520537086097836,"score_gpt":0.2984888654634526,"score_spread":0.25328349460247424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107883234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007033662,0.000052413456,0.98942363,0.0004235887,0.0002213256,0.00086718623,0.00006686728,0.0011114865,0.0007998406],"genre_scores_gemma":[0.5562981,0.00019812661,0.4428764,0.00002841573,0.000015307776,0.00034970365,0.000026623276,0.000056457746,0.00015088235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988915,0.00005777803,0.00041237727,0.0002358127,0.00016210374,0.00024042623],"domain_scores_gemma":[0.99620813,0.00088705635,0.00009275033,0.0024525886,0.00022629795,0.00013318397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016131798,0.00026345585,0.00023889118,0.00029254827,0.00058515446,0.000103141676,0.0009944991,0.0001568806,0.00007120268],"category_scores_gemma":[0.000016826425,0.00026750017,0.00011220488,0.00041259007,0.00011150231,0.0005090837,0.0000070021106,0.000724102,0.000032906177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019771885,0.00028132094,0.000019207158,0.0000338973,0.00017664205,3.1623313e-7,0.0015699465,0.21230416,0.21154985,0.0042078523,0.0012558439,0.56840324],"study_design_scores_gemma":[0.0014666021,0.00020810845,0.00022091519,0.0002371469,0.00007414917,0.000013797454,0.0001744722,0.7438393,0.23926221,0.006731935,0.007137695,0.0006336656],"about_ca_topic_score_codex":0.00002098455,"about_ca_topic_score_gemma":0.0010449628,"teacher_disagreement_score":0.5677696,"about_ca_system_score_codex":0.00012548572,"about_ca_system_score_gemma":0.000054734064,"threshold_uncertainty_score":0.9999777},"labels":[],"label_agreement":null},{"id":"W2108165364","doi":"10.1109/26.871398","title":"Equal-gain diversity receiver performance in wireless channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":247,"is_retracted":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":"Rician fading; Nakagami distribution; Mathematics; Fading; Probability density function; Rayleigh fading; Diversity gain; Algorithm; Telecommunications; Computer science; Statistics","score_opus":0.030439364612317936,"score_gpt":0.2523884447162454,"score_spread":0.22194908010392744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108165364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32089198,0.0004290828,0.6128652,0.00095995265,0.00032457086,0.0010298315,0.00009561495,0.003195171,0.06020856],"genre_scores_gemma":[0.9816241,0.013501539,0.004010537,0.000070382106,0.000007681815,0.00020424987,0.00001358816,0.00003860934,0.0005292982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900997,0.00011783969,0.00030917517,0.00016386069,0.00014902499,0.00025013252],"domain_scores_gemma":[0.9975783,0.00019131119,0.000029855655,0.0020868406,0.00004399629,0.000069654365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001627335,0.00018610033,0.00018905824,0.0002454085,0.00056978624,0.000022594364,0.0013130971,0.000118931974,0.00031131582],"category_scores_gemma":[0.0000015458647,0.00022926072,0.000069289345,0.000595904,0.00015256026,0.00041395985,0.000015458145,0.0006802326,0.00020631726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003658741,0.00050550647,0.00017067396,0.000041048337,0.00005211405,0.0000012312591,0.002162638,0.5248007,0.0011246953,0.0008582793,0.00019678399,0.47004974],"study_design_scores_gemma":[0.0014865128,0.00015777766,0.0019421444,0.00045770587,0.000050740993,0.000014662178,0.0003884774,0.90123755,0.07030695,0.0016171535,0.020968355,0.0013719825],"about_ca_topic_score_codex":0.00006353017,"about_ca_topic_score_gemma":0.00021380797,"teacher_disagreement_score":0.66073215,"about_ca_system_score_codex":0.00023000648,"about_ca_system_score_gemma":0.000014690681,"threshold_uncertainty_score":0.9348981},"labels":[],"label_agreement":null},{"id":"W2109962273","doi":"10.1109/tcomm.2003.816969","title":"Optimizing spectral efficiency in multiwavelength optical CDMA system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","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":"Code division multiple access; Spectral efficiency; Computer science; CDMA spectral efficiency; Electronic engineering; Spread spectrum; Wavelength-division multiplexing; Code (set theory); Prime (order theory); Computer network; Wavelength; Engineering; Mathematics; Optics; Physics; Channel (broadcasting)","score_opus":0.018225540692362013,"score_gpt":0.22876649045114777,"score_spread":0.21054094975878576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109962273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10548017,0.0006299443,0.80573153,0.00008245914,0.0010310189,0.0005972811,0.000027710608,0.0009418606,0.085478015],"genre_scores_gemma":[0.99298227,0.00011868149,0.0066236043,0.000008134712,0.000008421978,0.00014032681,0.0000020412572,0.00003464166,0.00008188528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.00019370398,0.00037257496,0.00016212102,0.00012315222,0.00029713902],"domain_scores_gemma":[0.998441,0.00024887803,0.00002381663,0.0011684942,0.000026335118,0.00009150962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003239667,0.00017490155,0.00019958625,0.00025352955,0.0002675999,0.000036789177,0.00046458078,0.000106500316,0.000028321623],"category_scores_gemma":[0.0000057630264,0.00019096662,0.00010979115,0.0005319345,0.000090886206,0.000118100295,0.0000013150325,0.00051516,0.00011534134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016586528,0.00070978794,0.00002996276,0.00014026073,0.00009909888,0.000009232144,0.0029565922,0.8614998,0.0070057497,0.123507544,0.000028742998,0.003996629],"study_design_scores_gemma":[0.0024626665,0.00016381571,0.0003160792,0.00065549405,0.000117365526,0.00018928754,0.007781917,0.91311544,0.069499925,0.00051713997,0.0039171833,0.0012636762],"about_ca_topic_score_codex":0.000015132369,"about_ca_topic_score_gemma":0.00012400442,"teacher_disagreement_score":0.8875021,"about_ca_system_score_codex":0.00017613253,"about_ca_system_score_gemma":0.000022076316,"threshold_uncertainty_score":0.7787393},"labels":[],"label_agreement":null},{"id":"W2110040147","doi":"10.1109/tcomm.2010.07.080633","title":"Limits to Performance of Optimum Combining with Dense Multiple Correlated Antennas","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Mathematics; Rayleigh fading; Signal-to-interference-plus-noise ratio; Interference (communication); Signal-to-noise ratio (imaging); Fading; Topology (electrical circuits); Mathematical analysis; Power (physics); Statistics; Physics; Telecommunications; Computer science; Combinatorics; Channel (broadcasting)","score_opus":0.01655576203975411,"score_gpt":0.23240446377809643,"score_spread":0.2158487017383423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110040147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26993728,0.0000262677,0.72788656,0.00007637516,0.00031999688,0.00036771447,0.000026961172,0.0003304451,0.0010283877],"genre_scores_gemma":[0.9453694,0.000153811,0.054131646,0.000016300519,0.0000059041627,0.00012773523,0.000010707217,0.000049599323,0.00013487361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992833,0.000026938622,0.00029340063,0.00012578108,0.00009996022,0.00017062882],"domain_scores_gemma":[0.9982008,0.00021162065,0.00005565776,0.0012647159,0.00017660412,0.00009062579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008384754,0.00014988014,0.00017233245,0.0001979413,0.00022673821,0.000014846009,0.00041358452,0.00008933554,0.000017861325],"category_scores_gemma":[0.000009827646,0.00015457229,0.000037397243,0.0005210197,0.00008515328,0.00020579528,0.0000025885308,0.00049646694,0.0000459733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003175304,0.00010397693,0.00016562812,0.00002022996,0.0000374311,2.3945088e-7,0.0005394685,0.9491537,0.047921594,0.000032692187,0.000019339825,0.0019739089],"study_design_scores_gemma":[0.0006450372,0.00017193379,0.0003599252,0.00015592446,0.000040657887,0.00002182155,0.0001388213,0.93667674,0.061194703,0.0000031100014,0.00034814287,0.00024317975],"about_ca_topic_score_codex":0.00002079702,"about_ca_topic_score_gemma":0.0004674218,"teacher_disagreement_score":0.67543215,"about_ca_system_score_codex":0.000037960515,"about_ca_system_score_gemma":0.000023498389,"threshold_uncertainty_score":0.6303275},"labels":[],"label_agreement":null},{"id":"W2110138118","doi":"10.1109/tcomm.2006.877959","title":"Revised analyses of postdetection switch-and-stay diversity in rician fading","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Rician fading; Fading; Bit error rate; Phase-shift keying; Keying; Diversity combining; Mathematics; Algorithm; Computer science; Statistics; Electronic engineering; Telecommunications; Engineering; Decoding methods","score_opus":0.056574239922813734,"score_gpt":0.30996856538755496,"score_spread":0.2533943254647412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110138118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08489096,0.0012516939,0.9077181,0.0002533818,0.00004898372,0.00034151546,0.000036155983,0.0006114722,0.004847728],"genre_scores_gemma":[0.9848342,0.0030285246,0.012005526,0.000011855185,0.0000036440622,0.00005044335,0.000008898508,0.000019742327,0.000037144768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992294,0.0000924499,0.0003344953,0.00011036228,0.000100437835,0.0001329058],"domain_scores_gemma":[0.9984778,0.00021995198,0.00006716414,0.0011522169,0.00005255668,0.000030310224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013708246,0.00012197213,0.00018593084,0.00041509746,0.00030434274,0.000011363698,0.00047382616,0.00007688097,0.000015047176],"category_scores_gemma":[0.00000462807,0.00014494204,0.00006520643,0.00051644567,0.00011217794,0.00020489056,0.000016571707,0.00033360778,0.0000037148338],"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.000071521965,0.0012814123,0.003614359,0.00025671735,0.00025511615,0.0000019091215,0.0018993203,0.57808155,0.25642052,0.0037242065,0.00020140843,0.15419199],"study_design_scores_gemma":[0.0015579052,0.0001404966,0.017631188,0.00045583982,0.00022853809,0.000013084628,0.00085401884,0.24330448,0.7245788,0.0073612905,0.0028289682,0.001045391],"about_ca_topic_score_codex":0.0005529679,"about_ca_topic_score_gemma":0.0014869712,"teacher_disagreement_score":0.8999433,"about_ca_system_score_codex":0.0001548602,"about_ca_system_score_gemma":0.000008134885,"threshold_uncertainty_score":0.59105647},"labels":[],"label_agreement":null},{"id":"W2110288531","doi":"10.1109/tcomm.2013.021913.120149","title":"Relaxed Half-Stochastic Belief Propagation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Decoding methods; Belief propagation; Computer science; Code word; Algorithm; Binary number; Throughput; Low-density parity-check code; Bit error rate; Coding (social sciences); Sequential decoding; Theoretical computer science; Wireless; Block code; Mathematics; Arithmetic; Telecommunications","score_opus":0.03033599025639153,"score_gpt":0.27193571936845407,"score_spread":0.24159972911206254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110288531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006784258,0.000048652637,0.9853622,0.0076014847,0.00033038866,0.0006738572,0.0000025277757,0.0015604964,0.0037419724],"genre_scores_gemma":[0.86734504,0.000037832408,0.1308237,0.00024556753,0.000010935783,0.00075896917,0.000002924766,0.000020458654,0.00075457647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986574,0.00019246653,0.0003376943,0.00031832766,0.0002459383,0.00024817185],"domain_scores_gemma":[0.9956638,0.0004257461,0.00012151525,0.0034261518,0.00026053388,0.00010222893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022228133,0.00017418963,0.00014444666,0.00026951206,0.0007160941,0.0001811446,0.0023434774,0.0000999482,0.00005424935],"category_scores_gemma":[0.000026866639,0.00018057444,0.000099701814,0.0007260161,0.00012304093,0.00081476994,0.000015242078,0.000539982,0.0008009557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016423079,0.0033688797,0.00002659132,0.000046153087,0.00017204724,0.0000026071157,0.007022297,0.017136922,0.046938226,0.09257768,0.00750503,0.82518715],"study_design_scores_gemma":[0.0006853818,0.0005039716,0.0006370166,0.00027477468,0.00006610601,0.00008891283,0.00020337092,0.9170378,0.050203096,0.02679921,0.0024463453,0.0010540212],"about_ca_topic_score_codex":0.00032743145,"about_ca_topic_score_gemma":0.00017132064,"teacher_disagreement_score":0.89990085,"about_ca_system_score_codex":0.00013002282,"about_ca_system_score_gemma":0.000075763324,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W2110487308","doi":"10.1109/tcomm.2005.861670","title":"Approximate SER of H-S/MRC in Nakagami fading with arbitrary branch power correlation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Nakagami distribution; Fading; Mathematics; Maximal-ratio combining; Integer (computer science); Modulation (music); Phase-shift keying; Statistics; Keying; Power (physics); Bit error rate; Algorithm; Telecommunications; Computer science; Physics; Decoding methods","score_opus":0.010546982591988939,"score_gpt":0.2291825001758941,"score_spread":0.21863551758390515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110487308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03197063,0.00032023404,0.9523396,0.00016054859,0.00005410709,0.0003909407,0.000036592795,0.00062472664,0.01410265],"genre_scores_gemma":[0.96072435,0.00044177196,0.038409002,0.000017012864,0.0000037436891,0.00023086347,0.000029332963,0.00005625653,0.000087677145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895775,0.00008322473,0.000464601,0.00014962585,0.00015604381,0.0001887345],"domain_scores_gemma":[0.9977487,0.00024622766,0.000090836984,0.0018002499,0.00008082419,0.000033207667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012646368,0.00018498945,0.00022104717,0.00037151697,0.00015021637,0.000016743012,0.00062102516,0.00011083772,0.000030820862],"category_scores_gemma":[0.0000021473184,0.00020050873,0.00006173226,0.0007133414,0.00015963562,0.00035925035,0.000005103932,0.0005442617,0.000010834507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032385473,0.0005105671,0.0006702903,0.00005411243,0.00004309173,6.7724613e-7,0.00054832606,0.97375125,0.011921735,0.0058788373,0.00007130551,0.0065174503],"study_design_scores_gemma":[0.0026453282,0.00026152423,0.012656013,0.001096751,0.000099064484,0.00004247889,0.000618034,0.7113167,0.2526554,0.013380961,0.0036612877,0.0015664593],"about_ca_topic_score_codex":0.00010267891,"about_ca_topic_score_gemma":0.00048148268,"teacher_disagreement_score":0.92875373,"about_ca_system_score_codex":0.00012858509,"about_ca_system_score_gemma":0.00002478399,"threshold_uncertainty_score":0.81765085},"labels":[],"label_agreement":null},{"id":"W2110529479","doi":"10.1109/tcomm.2012.050812.110115a","title":"Dithered Belief Propagation Decoding","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McGill University","funders":"","keywords":"Dither; Decoding methods; Belief propagation; Overhead (engineering); Computer science; Limit (mathematics); Algorithm; Waterfall; Propagation of uncertainty; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.0562468275296146,"score_gpt":0.3094651156017489,"score_spread":0.2532182880721343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110529479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015249847,0.0001296343,0.98820084,0.0017662725,0.0005270007,0.00027247745,0.0000037660789,0.0011810028,0.006394035],"genre_scores_gemma":[0.8245517,0.000099850906,0.17469446,0.00016274367,0.000023677278,0.0001786117,0.0000018424201,0.000015956448,0.00027118388],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888563,0.00019970801,0.00025113902,0.00018524968,0.00019515648,0.00028308955],"domain_scores_gemma":[0.9968136,0.00033149784,0.00010125533,0.0025470608,0.00010011527,0.00010649151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004270321,0.0001370644,0.00011308042,0.000206022,0.00068769563,0.00008435046,0.0017174416,0.000075312346,0.00002104732],"category_scores_gemma":[0.00001666995,0.00014295761,0.00008553928,0.0005822998,0.000070067275,0.0009013778,0.00001674219,0.0003809895,0.00017837953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017016106,0.0033064676,0.0006077296,0.000033320877,0.00013414874,0.0000010067143,0.011367103,0.0011344453,0.024193691,0.090393946,0.0020942409,0.86671686],"study_design_scores_gemma":[0.0012703612,0.00057560025,0.0034368339,0.00042568057,0.000168218,0.00020263653,0.00064199435,0.41586486,0.5215877,0.009702984,0.04384776,0.0022753682],"about_ca_topic_score_codex":0.00004780008,"about_ca_topic_score_gemma":0.00007804343,"teacher_disagreement_score":0.8644415,"about_ca_system_score_codex":0.0001337533,"about_ca_system_score_gemma":0.000044495144,"threshold_uncertainty_score":0.58296424},"labels":[],"label_agreement":null},{"id":"W2111061487","doi":"10.1109/26.996072","title":"Noncoherent MMSE interference suppression for DS-CDMA","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Code division multiple access; Minimum mean square error; Algorithm; Interference (communication); Spread spectrum; Single antenna interference cancellation; Matched filter; Computer science; Mathematics; Detector; Control theory (sociology); Channel (broadcasting); Electronic engineering; Telecommunications; Decoding methods; Statistics; Engineering","score_opus":0.11722199677070158,"score_gpt":0.3350077925116484,"score_spread":0.21778579574094684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111061487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022878853,0.00042294385,0.98084325,0.012011091,0.00035805308,0.0007074027,0.000031481268,0.00036096244,0.005036048],"genre_scores_gemma":[0.9276226,0.0017598197,0.0671373,0.00023291042,0.000023588123,0.0010412427,0.000009256324,0.00002675348,0.0021465158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803895,0.000394415,0.00044498232,0.00040064633,0.0003183028,0.0004027184],"domain_scores_gemma":[0.99171454,0.0013966808,0.00012233423,0.0062785167,0.00030417554,0.00018375953],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00033673333,0.0002121683,0.00021223079,0.0002779138,0.0011148262,0.0002509376,0.006225722,0.00012439047,0.00020583913],"category_scores_gemma":[0.000022941384,0.00021060168,0.00017938968,0.0007359492,0.0002181603,0.0005948773,0.00007705398,0.00068566465,0.00031724933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049709957,0.0036043597,0.000016884294,0.000047409692,0.00015112961,0.0000014327168,0.0034297076,0.013200344,0.004115341,0.025163349,0.025723165,0.9244972],"study_design_scores_gemma":[0.0006980769,0.00020265716,0.000042290954,0.000116859075,0.0000146462235,0.000009433223,0.000062441344,0.9470182,0.0064420924,0.0010618594,0.044020645,0.00031081238],"about_ca_topic_score_codex":0.000030384484,"about_ca_topic_score_gemma":0.00014085443,"teacher_disagreement_score":0.93381786,"about_ca_system_score_codex":0.00014820108,"about_ca_system_score_gemma":0.00005021828,"threshold_uncertainty_score":0.99915105},"labels":[],"label_agreement":null},{"id":"W2111484900","doi":"10.1109/tcomm.2011.050211.100036a","title":"Cramer-Rao Lower Bounds of DOA Estimates from Square QAM-Modulated Signals","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Direction-of-Arrival Estimation Techniques","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","funders":"","keywords":"Quadrature amplitude modulation; Cramér–Rao bound; QAM; Mathematics; Algorithm; Additive white Gaussian noise; Fisher information; Estimation theory; Statistics; White noise; Bit error rate; Decoding methods","score_opus":0.05889292817463917,"score_gpt":0.2964461860052343,"score_spread":0.23755325783059514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111484900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007841808,0.000096683514,0.9859688,0.00037064494,0.0002819843,0.00029368198,0.00009314686,0.0005909037,0.0044622896],"genre_scores_gemma":[0.7086796,0.00009608968,0.2910144,0.00004082186,0.00000334978,0.00008159267,0.000008616758,0.000016105372,0.0000594195],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841726,0.00015946309,0.00064214796,0.00029245554,0.00028623588,0.0002024407],"domain_scores_gemma":[0.9955251,0.0005828572,0.00031755434,0.0030707293,0.00041518768,0.00008853964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023515482,0.0001991271,0.00030758648,0.00035946094,0.0003191383,0.000051914278,0.0021825375,0.00012833394,0.0002563884],"category_scores_gemma":[0.000028523265,0.00021176993,0.00018661012,0.00088691927,0.00033846806,0.0006508112,0.000027468648,0.00028497967,0.00005144218],"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.00032538795,0.020199655,0.0007200723,0.00027097584,0.0018763505,0.0000095919595,0.031627994,0.024795355,0.2568356,0.083380975,0.0026606473,0.5772974],"study_design_scores_gemma":[0.00039825108,0.0003874801,0.0015795466,0.00028349142,0.00010320738,0.000005679837,0.00010203369,0.18909208,0.77653253,0.030474905,0.000621576,0.00041922007],"about_ca_topic_score_codex":0.0012736663,"about_ca_topic_score_gemma":0.00011107221,"teacher_disagreement_score":0.7008378,"about_ca_system_score_codex":0.00005530101,"about_ca_system_score_gemma":0.000102161626,"threshold_uncertainty_score":0.8635727},"labels":[],"label_agreement":null},{"id":"W2111600529","doi":"10.1109/tcomm.2010.05.090100","title":"Coherent max-log decision fusion in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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 British Columbia","funders":"","keywords":"Fusion; Fusion center; Sensor fusion; Fusion rules; Decision rule; Computer science; Wireless sensor network; Wireless; Binary number; Algorithm; Data mining; Artificial intelligence; Mathematics; Cognitive radio; Telecommunications; Computer network; Image fusion","score_opus":0.017144890658940058,"score_gpt":0.2615282395100707,"score_spread":0.24438334885113064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111600529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014625232,0.000036938403,0.9806918,0.0010876711,0.0017611302,0.00030166074,0.000017420745,0.0003000454,0.001178098],"genre_scores_gemma":[0.95367384,0.00044253832,0.04532406,0.00019877095,0.00003917702,0.0000914564,0.000009559503,0.0000178967,0.00020270304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840224,0.00015675127,0.00044071986,0.00039244915,0.00027143472,0.0003364035],"domain_scores_gemma":[0.99623865,0.0005626838,0.00010412572,0.0027921987,0.00013766342,0.00016468899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003295394,0.00020243374,0.00020632953,0.00027664367,0.0006142664,0.0001930828,0.0017108206,0.00021404293,0.00008415137],"category_scores_gemma":[0.000008375558,0.00020283293,0.00012873005,0.0011642361,0.0001255723,0.00030924025,0.000027180036,0.0012576482,0.00010825378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045450874,0.0012988405,0.00005556407,0.0000038855555,0.000028375507,0.000009214973,0.00023547614,0.09854616,0.0030072068,0.0052428124,0.0006739671,0.89085305],"study_design_scores_gemma":[0.00062228675,0.00006909555,0.000734873,0.000041385585,0.000009457251,0.000035593064,0.000046585898,0.9892076,0.0012411354,0.00065599725,0.007062763,0.00027319515],"about_ca_topic_score_codex":0.00010720894,"about_ca_topic_score_gemma":0.0024596485,"teacher_disagreement_score":0.9390486,"about_ca_system_score_codex":0.000071892675,"about_ca_system_score_gemma":0.000049724636,"threshold_uncertainty_score":0.8271287},"labels":[],"label_agreement":null},{"id":"W2111795445","doi":"10.1109/tcomm.2006.876852","title":"Joint Estimation of Carrier Frequency Offset and Statistical Parameters of the Multipath Fading Channel","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Fading; Multipath propagation; Channel state information; Rayleigh fading; Estimator; Computer science; Algorithm; Frequency offset; Fading distribution; Channel (broadcasting); Autoregressive model; Carrier frequency offset; Electronic engineering; Mathematics; Telecommunications; Statistics; Wireless; Orthogonal frequency-division multiplexing; Engineering","score_opus":0.02500190490422295,"score_gpt":0.25765577868704237,"score_spread":0.23265387378281943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111795445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025940772,0.00018273618,0.97234726,0.00021593722,0.00005648875,0.00028654738,0.0003317328,0.00015341963,0.00048509336],"genre_scores_gemma":[0.8932766,0.00032795532,0.10624122,0.000008626463,0.0000016478126,0.00010010357,0.0000143956195,0.000020509542,0.000008991333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991737,0.00009764867,0.00041578914,0.00008817636,0.00012199119,0.00010268434],"domain_scores_gemma":[0.99814767,0.00030817388,0.00010455464,0.0013403272,0.00007154473,0.000027752632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010835835,0.00011420342,0.00017135167,0.00012025259,0.00017843234,0.000008249139,0.00040920946,0.000065630054,0.0000060727025],"category_scores_gemma":[0.000018334753,0.000106117266,0.000056844437,0.00024342712,0.00032874418,0.00011937118,0.000007934656,0.0002727625,8.6832443e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007023645,0.00028275486,0.00007215771,0.00012224012,0.000067877736,1.2308033e-7,0.00090900325,0.9359071,0.029530954,0.009752733,0.00011748679,0.0232305],"study_design_scores_gemma":[0.00025226417,0.000041873285,0.0018972349,0.00021294181,0.00006354169,0.0000051956213,0.000145124,0.7820175,0.20675395,0.0083568,0.000047560967,0.00020596644],"about_ca_topic_score_codex":0.00020732621,"about_ca_topic_score_gemma":0.0002052976,"teacher_disagreement_score":0.8673358,"about_ca_system_score_codex":0.000059846207,"about_ca_system_score_gemma":0.000016958742,"threshold_uncertainty_score":0.43273365},"labels":[],"label_agreement":null},{"id":"W2112020139","doi":"10.1109/tcomm.2009.10.080048","title":"Switching rates of dual selection diversity in noisy fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Independent and identically distributed random variables; Diversity combining; Fading distribution; Diversity scheme; Selection (genetic algorithm); Dual (grammatical number); Computer science; Noise (video); Mathematics; Algorithm; Electronic engineering; Telecommunications; Topology (electrical circuits); Statistics; Channel (broadcasting); Random variable; Engineering; Rayleigh fading; Artificial intelligence; Combinatorics","score_opus":0.04381582510786672,"score_gpt":0.29838754698471975,"score_spread":0.25457172187685306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112020139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08500772,0.00018771419,0.91142887,0.00040313695,0.00009630482,0.00028269348,0.000011824021,0.0006653942,0.0019163508],"genre_scores_gemma":[0.984954,0.0013267755,0.013592979,0.000032378422,0.0000064476685,0.00003965773,0.00000518555,0.000017575958,0.000025013136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99919343,0.000086390435,0.0003246883,0.00011533077,0.000116199975,0.00016396439],"domain_scores_gemma":[0.998687,0.00019833936,0.000061878716,0.0009438543,0.00006856371,0.000040310224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000162395,0.00013787513,0.00018441357,0.00038718115,0.00037455244,0.000014611929,0.000596184,0.00008981775,0.000013771434],"category_scores_gemma":[0.000006277887,0.0001716447,0.0000684166,0.0006530129,0.00004651523,0.0003308707,0.000010597102,0.00052105216,0.0000068788163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024663967,0.000572676,0.00020034742,0.00002995789,0.00005376154,5.547827e-7,0.0037360513,0.8278137,0.08199616,0.0022090592,0.00006015065,0.083302915],"study_design_scores_gemma":[0.00079313415,0.00018856025,0.0031880075,0.0003148169,0.0000457292,0.000012154667,0.0005202934,0.4590694,0.52909845,0.0056466847,0.00051256566,0.0006102114],"about_ca_topic_score_codex":0.00007835555,"about_ca_topic_score_gemma":0.00024399624,"teacher_disagreement_score":0.8999463,"about_ca_system_score_codex":0.0001689352,"about_ca_system_score_gemma":0.000013265312,"threshold_uncertainty_score":0.6999468},"labels":[],"label_agreement":null},{"id":"W2112266980","doi":"10.1109/tcomm.2006.887479","title":"Linear Decoupled and Quasi-Decoupled Space–Time Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Block code; Linear code; Decoding methods; Concatenated error correction code; Space time; Full Rate; Space–time block code; Algorithm; Computer science; Diversity gain; Mathematics; Space–time code; Topology (electrical circuits); Combinatorics; Fading; Engineering","score_opus":0.01718006144823575,"score_gpt":0.278915571190286,"score_spread":0.26173550974205023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112266980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012054531,0.0009093189,0.9804959,0.0005824912,0.00008589516,0.00037565368,0.000044157467,0.0018051962,0.0036468408],"genre_scores_gemma":[0.87484944,0.005964023,0.11858622,0.00006594266,0.0000143840225,0.00011844299,0.000020693287,0.00007193159,0.0003089521],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886084,0.0000642955,0.00043714678,0.0001884456,0.00015477299,0.00029452864],"domain_scores_gemma":[0.9963949,0.00085872045,0.00006337537,0.002424514,0.000110448935,0.00014806008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038522988,0.00024044725,0.0002587271,0.00030969313,0.000494039,0.00003597822,0.00083321123,0.00015537966,0.0000869661],"category_scores_gemma":[0.000014367833,0.00027830334,0.000085892614,0.0004546279,0.0002522549,0.00025193256,0.000011623209,0.0006165326,0.00013073329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027983543,0.0040058093,0.00025357842,0.00034108994,0.0011627914,0.000011922585,0.005161021,0.13423018,0.2925657,0.019018095,0.0028311354,0.54013884],"study_design_scores_gemma":[0.0012242356,0.00021578262,0.0005476953,0.0002345273,0.00013244452,0.00004335809,0.00036895587,0.7783263,0.18286264,0.0027215662,0.032157328,0.0011652013],"about_ca_topic_score_codex":0.000033647448,"about_ca_topic_score_gemma":0.00056637684,"teacher_disagreement_score":0.8627949,"about_ca_system_score_codex":0.00013190114,"about_ca_system_score_gemma":0.00002101368,"threshold_uncertainty_score":0.9999669},"labels":[],"label_agreement":null},{"id":"W2112379819","doi":"10.1109/tcomm.2004.833028","title":"Reconstruction of Predictively Encoded Signals Over Noisy Channels Using a Sequence MMSE Decoder","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Decoding methods; Algorithm; Redundancy (engineering); Maximum a posteriori estimation; Minimum mean square error; Trellis (graph); Mean squared error; Residual; Sequence (biology); A priori and a posteriori; Computer science; Signal reconstruction; Mathematics; Signal processing; Statistics; Maximum likelihood; Telecommunications","score_opus":0.05820305858855234,"score_gpt":0.30790074094478453,"score_spread":0.2496976823562322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112379819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053097077,0.00020938089,0.944368,0.0001221994,0.00017880235,0.00040677664,0.00012320482,0.00071194343,0.0007826388],"genre_scores_gemma":[0.8697005,0.0016559516,0.12836233,0.00002568295,0.000010456843,0.00017598162,0.000008458308,0.00004949321,0.000011180154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987839,0.00009810629,0.0005359272,0.00018613014,0.00018277125,0.00021317575],"domain_scores_gemma":[0.9974342,0.00020309925,0.00014228823,0.0019537257,0.00018629541,0.0000803908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015096426,0.00021750914,0.00025868425,0.00033706654,0.00031838976,0.000023086903,0.00083691813,0.0001509604,0.00004733167],"category_scores_gemma":[0.0000104408155,0.0002597162,0.00012768825,0.0005957184,0.0003199505,0.00052437425,0.000009198164,0.0004971114,0.000010698139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010738816,0.00015774953,0.0000058331493,0.000023579376,0.00007096777,2.547019e-7,0.0005486501,0.8282639,0.15737712,0.0005307326,0.000003670642,0.013006824],"study_design_scores_gemma":[0.000609267,0.00007489138,0.000031122872,0.0003892328,0.00006913153,0.000041944986,0.00015316073,0.3092457,0.67945546,0.009414241,0.00014320436,0.0003726447],"about_ca_topic_score_codex":0.000111151705,"about_ca_topic_score_gemma":0.000102050784,"teacher_disagreement_score":0.81660336,"about_ca_system_score_codex":0.00037228028,"about_ca_system_score_gemma":0.00008493937,"threshold_uncertainty_score":0.9999855},"labels":[],"label_agreement":null},{"id":"W2112627185","doi":"10.1109/tcomm.2012.12.100185","title":"MPPM Constellation Selection for Free-Space Optical Communications","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","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":"Heuristics; Selection (genetic algorithm); SIGNAL (programming language); Algorithm; Computer science; Channel (broadcasting); Constellation; Figure of merit; Modulation (music); Compressed sensing; Constellation diagram; Position (finance); Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Telecommunications; Physics; Bit error rate","score_opus":0.041306056829605246,"score_gpt":0.2751747246043181,"score_spread":0.23386866777471282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112627185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00264891,0.0010534168,0.96514624,0.004275136,0.00052661425,0.00089170487,0.00009944474,0.0023218824,0.023036668],"genre_scores_gemma":[0.81462985,0.0013765343,0.18341589,0.00004539878,0.000042346946,0.0003071157,0.00002710119,0.00005278634,0.00010298789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988358,0.00007229732,0.00036663117,0.00014697034,0.00014405002,0.00043425348],"domain_scores_gemma":[0.9953779,0.0012369485,0.00004584223,0.0030863176,0.000118785414,0.0001342183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025560294,0.00021734418,0.00020680788,0.00021639073,0.00066409307,0.00005327679,0.0013115725,0.00025013628,0.000043028187],"category_scores_gemma":[0.00003485304,0.0002470256,0.00013801035,0.0005840214,0.00039667686,0.00036827606,0.000019159213,0.00063886447,0.0001076962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009146732,0.0028876483,0.0005648277,0.00018342555,0.0008437612,1.4291469e-7,0.0011749793,0.23927486,0.015291167,0.50058234,0.022057218,0.21704818],"study_design_scores_gemma":[0.0009698424,0.00015797248,0.00020246374,0.00007997533,0.00027589948,0.000024130719,0.0004416415,0.86242115,0.02419481,0.004008571,0.106479414,0.0007440995],"about_ca_topic_score_codex":0.000009565936,"about_ca_topic_score_gemma":0.00012137446,"teacher_disagreement_score":0.8119809,"about_ca_system_score_codex":0.00021363645,"about_ca_system_score_gemma":0.000024122242,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W2112633589","doi":"10.1109/tcomm.2010.06.090114","title":"Estimation and equalization of fiber-wireless uplink for multiuser CDMA 4G networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Telecommunications link; Multipath propagation; Electronic engineering; Bit error rate; Channel (broadcasting); Nonlinear distortion; Code division multiple access; Wireless; Equalization (audio); Multiuser detection; Signal-to-interference-plus-noise ratio; Radio over fiber; Computer network; Telecommunications; Engineering; Bandwidth (computing); Physics","score_opus":0.0392670958674767,"score_gpt":0.32696311475869066,"score_spread":0.287696018891214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112633589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053480575,0.00011855706,0.99142426,0.0016957057,0.00022438502,0.0006541502,0.000015710519,0.0001748316,0.00034434558],"genre_scores_gemma":[0.8203135,0.0004886224,0.17855765,0.00005471861,0.000016018399,0.00035159432,0.000025373256,0.000022837203,0.00016968309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847746,0.00026775963,0.0004898301,0.00029402968,0.0002236805,0.00024723232],"domain_scores_gemma":[0.99358124,0.002304888,0.00020899044,0.003420127,0.0003681357,0.000116635165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007276536,0.00016802795,0.00021521661,0.00026586885,0.0007645614,0.0001467825,0.0022331513,0.0002022296,0.000022773267],"category_scores_gemma":[0.000042338434,0.00018095766,0.0000956241,0.00069747126,0.00039018097,0.0005155249,0.000048076952,0.0006608262,0.000010265004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002993712,0.0007007803,0.000033777727,0.000044195956,0.00007036892,1.0800786e-7,0.00080797676,0.1236342,0.00529819,0.055514805,0.00026705978,0.81359863],"study_design_scores_gemma":[0.0005013558,0.00006281608,0.00018131157,0.000036358262,0.000017253233,0.0000037853836,0.000018393463,0.991278,0.005336987,0.0012354075,0.0011618593,0.00016648769],"about_ca_topic_score_codex":0.00005437349,"about_ca_topic_score_gemma":0.00017239834,"teacher_disagreement_score":0.8676438,"about_ca_system_score_codex":0.00003733931,"about_ca_system_score_gemma":0.00008721537,"threshold_uncertainty_score":0.7379239},"labels":[],"label_agreement":null},{"id":"W2113120847","doi":"10.1109/tcomm.2010.01.070451","title":"Systematic design of low-density parity-check code ensembles for binary erasure channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Erasure; Binary erasure channel; Low-density parity-check code; Binary number; Algorithm; Node (physics); Upper and lower bounds; Mathematics; Code (set theory); Degree (music); Computer science; Theoretical computer science; Topology (electrical circuits); Decoding methods; Channel capacity; Arithmetic; Combinatorics; Coding (social sciences); Statistics","score_opus":0.05596313526142133,"score_gpt":0.30405353589121603,"score_spread":0.2480904006297947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113120847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003573268,0.00007000455,0.9923399,0.0011117213,0.00071634335,0.0014062963,0.00002521487,0.00065580726,0.00010144219],"genre_scores_gemma":[0.73804253,0.00006016885,0.2611682,0.00005990848,0.000009979944,0.0005257881,0.0000021344295,0.000019812776,0.00011147372],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982767,0.0003850745,0.0005493159,0.00031248096,0.00023534978,0.00024103886],"domain_scores_gemma":[0.9931817,0.0021671539,0.00027560216,0.0038434824,0.00044609234,0.000085969696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011275456,0.0002032328,0.0003812741,0.00027088073,0.00063347985,0.00008024223,0.0026175838,0.00017509617,0.000004277165],"category_scores_gemma":[0.00010543129,0.00020692428,0.00019129773,0.000510557,0.00016196027,0.00031541195,0.000022972816,0.0006043259,0.000015349273],"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.0001882771,0.007752281,0.000060851908,0.011533913,0.0008832367,0.0000069254406,0.015722327,0.033575483,0.8632299,0.053949542,0.0032364698,0.009860806],"study_design_scores_gemma":[0.00049680885,0.00041295498,0.000050226416,0.0020040506,0.00015229992,0.00005689874,0.00018044566,0.60731626,0.3814562,0.007226636,0.00009962171,0.00054759753],"about_ca_topic_score_codex":0.00006246008,"about_ca_topic_score_gemma":0.00031815915,"teacher_disagreement_score":0.73446923,"about_ca_system_score_codex":0.00004734863,"about_ca_system_score_gemma":0.00013073572,"threshold_uncertainty_score":0.8438127},"labels":[],"label_agreement":null},{"id":"W2113552374","doi":"10.1109/26.843130","title":"Valuation of the effects of intersymbol interference in decision-feedback equalizers","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Communications Research Centre Canada","funders":"","keywords":"Intersymbol interference; Computer science; Interference (communication); Markov process; Bounding overwatch; Channel (broadcasting); Convergence (economics); Control theory (sociology); Equalization (audio); Noise (video); Algorithm; Mathematics; Telecommunications; Statistics; Artificial intelligence","score_opus":0.02469361702110106,"score_gpt":0.2861098678788465,"score_spread":0.26141625085774545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113552374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11969405,0.00045822933,0.87555915,0.00016459073,0.00017240322,0.00062990084,0.00002192996,0.00019638248,0.0031033573],"genre_scores_gemma":[0.987077,0.0030729827,0.0095783435,0.00001928967,0.0000014869606,0.00016488257,0.0000021565806,0.000021469497,0.00006236613],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898976,0.00018302367,0.00048866944,0.00009385117,0.0001394205,0.0001052925],"domain_scores_gemma":[0.9965278,0.0011034895,0.000074036994,0.0021997404,0.000070663715,0.000024275989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015033448,0.00011873244,0.00018602848,0.00018522167,0.000078205674,0.000006129637,0.0013239523,0.00007539115,0.000073914445],"category_scores_gemma":[0.000028621089,0.00010916966,0.000099435434,0.00061820576,0.00020758486,0.00014857274,0.000008879986,0.0003721198,0.000011488385],"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.000051059706,0.0005900274,0.000087287546,0.00014987566,0.00007247611,1.0793813e-7,0.0033375183,0.19328505,0.042348713,0.0014532069,0.0000891502,0.75853556],"study_design_scores_gemma":[0.0012114802,0.00017950984,0.0027673056,0.0024217924,0.00007183391,0.0000034740287,0.00039319045,0.13733855,0.84423625,0.010306626,0.00066683016,0.00040315973],"about_ca_topic_score_codex":0.000046063426,"about_ca_topic_score_gemma":0.00022305272,"teacher_disagreement_score":0.86738294,"about_ca_system_score_codex":0.0000986738,"about_ca_system_score_gemma":0.000022499798,"threshold_uncertainty_score":0.44518098},"labels":[],"label_agreement":null},{"id":"W2114115739","doi":"10.1109/tcomm.2011.042111.100310","title":"Analysis and Design of Cooperative BICM-OFDM Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise error probability; Orthogonal frequency-division multiplexing; Relay; Computer science; Disjoint sets; Cooperative diversity; Diversity gain; Multiplexing; Transmit diversity; Electronic engineering; Selection (genetic algorithm); Wireless; Diversity scheme; Computer network; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Wireless network; Engineering; Fading","score_opus":0.1283991337974955,"score_gpt":0.29790581125811916,"score_spread":0.16950667746062364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114115739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038285615,0.0008396526,0.9956237,0.00026325652,0.00008502514,0.00028953704,0.000009954163,0.00010358324,0.0024024495],"genre_scores_gemma":[0.9408439,0.0045420188,0.05418791,0.000059657796,0.0000027326216,0.0001147208,0.0000021425028,0.000007592671,0.00023932046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985021,0.0006505317,0.0003572009,0.00022331554,0.00013092333,0.00013596719],"domain_scores_gemma":[0.9963855,0.0004962704,0.00012862046,0.002611408,0.00029587097,0.00008233624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003905255,0.00013575245,0.00025202884,0.0004245045,0.00051925774,0.00006571555,0.0016111432,0.00005624419,0.000034797024],"category_scores_gemma":[0.000008903678,0.0001309746,0.00008526908,0.0017870081,0.00022164863,0.00032135722,0.000029578248,0.00023903286,0.000014788078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015527305,0.005482266,0.0011271586,0.00007507051,0.0067591877,0.000005287982,0.0576793,0.15798794,0.014029822,0.45595133,0.0005483684,0.30019897],"study_design_scores_gemma":[0.0004120256,0.00023456571,0.001464477,0.000056397836,0.00031273707,0.000007807423,0.00031654106,0.98802,0.00793654,0.00021500445,0.00069345906,0.00033045138],"about_ca_topic_score_codex":0.00008281197,"about_ca_topic_score_gemma":0.00013243374,"teacher_disagreement_score":0.94143575,"about_ca_system_score_codex":0.00003172202,"about_ca_system_score_gemma":0.00006163408,"threshold_uncertainty_score":0.5340989},"labels":[],"label_agreement":null},{"id":"W2115002145","doi":"10.1109/26.843194","title":"Extremal shape-controlled traffic patterns in high-speed networks","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Network Traffic and Congestion Control","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":"Queueing theory; Upper and lower bounds; Ergodic theory; Queue; Probabilistic logic; Randomness; Channel (broadcasting); Computer science; Network packet; Channel capacity; Random variable; Renewal theory; Topology (electrical circuits); Mathematics; Computer network; Statistics; Combinatorics","score_opus":0.01734213812584941,"score_gpt":0.23626182671001797,"score_spread":0.21891968858416855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115002145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060444098,0.0004133713,0.9295978,0.0059791803,0.00047120175,0.0008018522,0.00001467631,0.0005999939,0.001677842],"genre_scores_gemma":[0.9931263,0.0011488115,0.0034867178,0.00062516105,0.000054825043,0.0002773836,0.000008343812,0.000023999897,0.0012485052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977872,0.00044123642,0.00061156217,0.0004492126,0.00025543178,0.00045537317],"domain_scores_gemma":[0.99653345,0.00071587774,0.00009303835,0.0024310902,0.00007113668,0.00015540762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035968734,0.0002741179,0.00042132768,0.00025448375,0.00048354274,0.00017500333,0.0023051845,0.00015941309,0.00073464325],"category_scores_gemma":[0.0000035028074,0.00027634393,0.00022429289,0.00079754123,0.000102109116,0.00043122063,0.0000074349473,0.0007300268,0.00022844013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007382616,0.00046009087,0.000009049382,0.000001312496,0.00003520826,0.0000035685632,0.0001673275,0.45267445,0.0000076739,0.0011443214,0.00006137444,0.5453618],"study_design_scores_gemma":[0.0042841635,0.000082727915,0.00055426965,0.000050238203,0.00003220136,0.00001189417,0.000025692816,0.9934331,0.000008290317,0.000073048606,0.0011657529,0.00027859354],"about_ca_topic_score_codex":0.00006782137,"about_ca_topic_score_gemma":0.00088536006,"teacher_disagreement_score":0.93268216,"about_ca_system_score_codex":0.00009618845,"about_ca_system_score_gemma":0.00007991013,"threshold_uncertainty_score":0.9999689},"labels":[],"label_agreement":null},{"id":"W2115817513","doi":"10.1109/tcomm.2004.838736","title":"On Finite-State Vector Quantization for Noisy Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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 Manitoba","funders":"","keywords":"Decoding methods; Vector quantization; Encoder; Algorithm; Channel (broadcasting); Computer science; Quantization (signal processing); Mathematics; Telecommunications","score_opus":0.04938890782892184,"score_gpt":0.32249000995779525,"score_spread":0.2731011021288734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115817513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011056492,0.00003556243,0.9935019,0.004100967,0.00039651673,0.0006315402,0.0001439017,0.0007808181,0.00029821385],"genre_scores_gemma":[0.71409583,0.0002306905,0.2842599,0.00051546365,0.000011695841,0.0005952401,0.000031455234,0.000024245755,0.00023550157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988189,0.000084007275,0.00030958766,0.00035321628,0.00019976574,0.00023454451],"domain_scores_gemma":[0.99570256,0.0008542189,0.0001238717,0.0030624897,0.00016678244,0.000090047375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015802059,0.00018045279,0.00015781818,0.0002755392,0.00072866364,0.000113365895,0.0021168801,0.00007075172,0.000008004372],"category_scores_gemma":[0.00003956674,0.00018450785,0.00010923234,0.00055522815,0.00008825112,0.000613522,0.000017920394,0.00028945896,0.0000809263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007099638,0.0018481578,3.892913e-7,0.000026761769,0.000056500492,0.0000022465715,0.001221372,0.5860986,0.004716876,0.32943636,0.0011629955,0.07535875],"study_design_scores_gemma":[0.0023254596,0.0011157898,0.000020255835,0.00039489235,0.000036722242,0.000015010619,0.000041760784,0.34603447,0.33753282,0.27827874,0.03323618,0.00096789235],"about_ca_topic_score_codex":0.000025296706,"about_ca_topic_score_gemma":0.0000467325,"teacher_disagreement_score":0.71398526,"about_ca_system_score_codex":0.00012467564,"about_ca_system_score_gemma":0.000080790946,"threshold_uncertainty_score":0.7524012},"labels":[],"label_agreement":null},{"id":"W2115825742","doi":"10.1109/tcomm.2006.869865","title":"Reliability-based coded modulation with low-density parity-check codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Demodulation; Decoding methods; Algorithm; Raptor code; Computer science; Coding (social sciences); Turbo code; Modulation (music); Bit error rate; Error detection and correction; Electronic engineering; Mathematics; Statistics; Telecommunications; Error floor; Engineering","score_opus":0.01966030584582169,"score_gpt":0.26426229313043303,"score_spread":0.24460198728461136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115825742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030515853,0.000015038546,0.9636561,0.0020717357,0.00012933639,0.00043758214,0.000015203702,0.0016548889,0.001504214],"genre_scores_gemma":[0.7184799,0.000009751968,0.2810584,0.00014831004,0.000008912284,0.00013126925,0.000013040936,0.000018311379,0.00013212697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820477,0.0003449411,0.00038152185,0.0004522379,0.00034980537,0.00026670445],"domain_scores_gemma":[0.9946494,0.0005801601,0.00016254399,0.0041553937,0.00037781044,0.000074689044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044250593,0.00022880337,0.00022479813,0.0002394325,0.0008772049,0.0001467404,0.0016712327,0.0001275394,0.000008095647],"category_scores_gemma":[0.00001204202,0.00022603312,0.00011471264,0.0008741592,0.0002467258,0.00047130833,0.000013830894,0.00057696336,0.000038297872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004003439,0.0143047925,0.004424402,0.00024275195,0.00021327844,0.000019426807,0.002385735,0.7657372,0.062953494,0.081489764,0.0032254201,0.06460345],"study_design_scores_gemma":[0.0006421843,0.00022432768,0.005485226,0.00013123063,0.000045625493,0.000015613876,0.000026707075,0.88047475,0.10328096,0.008507891,0.0006346363,0.00053087884],"about_ca_topic_score_codex":0.0011207412,"about_ca_topic_score_gemma":0.0032367609,"teacher_disagreement_score":0.687964,"about_ca_system_score_codex":0.00021040061,"about_ca_system_score_gemma":0.00015871809,"threshold_uncertainty_score":0.92173636},"labels":[],"label_agreement":null},{"id":"W2116246363","doi":"10.1109/tcomm.2009.03.070068","title":"Adaptive iterative detectors for phase-uncertain channels via variational bounding","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Bounding overwatch; Detector; Computer science; Iterative method; Phase (matter); Control theory (sociology); Phase detector; Electronic engineering; Algorithm; Mathematical optimization; Mathematics; Physics; Telecommunications; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.047585702832365954,"score_gpt":0.3252938858538462,"score_spread":0.27770818302148026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116246363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028987578,0.00020639699,0.99547505,0.00071614084,0.000210677,0.0007923751,0.00015986763,0.0010504392,0.0010991541],"genre_scores_gemma":[0.836195,0.00032538554,0.162318,0.000122349,0.00003027309,0.00082953234,0.000056730474,0.000039884853,0.00008283638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889386,0.000100685415,0.00039622138,0.00019718878,0.00015040128,0.00026163962],"domain_scores_gemma":[0.9975422,0.00065159384,0.00008332503,0.0014500144,0.00018488905,0.00008795194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017014795,0.00024147725,0.00023200236,0.00029198028,0.00077163294,0.00006160234,0.0008458934,0.00012099797,0.00003522596],"category_scores_gemma":[0.000011392259,0.00028264575,0.00014300445,0.0004383642,0.00010195667,0.0004091466,0.0000033933695,0.00044161582,0.000017809305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012276086,0.0011124223,6.683683e-7,0.00002155629,0.00024315216,5.0016314e-7,0.0027943607,0.6484547,0.032015625,0.016978942,0.00048777522,0.2977675],"study_design_scores_gemma":[0.000899335,0.0003705161,0.000009457015,0.0000687137,0.000044694243,0.000005615583,0.000118308184,0.92016613,0.058572896,0.015018158,0.004329944,0.00039624266],"about_ca_topic_score_codex":0.0000072970643,"about_ca_topic_score_gemma":0.000030190056,"teacher_disagreement_score":0.83590513,"about_ca_system_score_codex":0.00031448895,"about_ca_system_score_gemma":0.000035519046,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W2116430029","doi":"10.1109/tcomm.2009.04.070246","title":"The effect of imperfect carrier frequency offset estimation on an OFDMA uplink","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Telecommunications link; Carrier frequency offset; Orthogonal frequency-division multiple access; Bit error rate; Orthogonal frequency-division multiplexing; Electronic engineering; Interference (communication); Frequency-division multiple access; Frequency offset; Computer science; Signal-to-interference-plus-noise ratio; Power (physics); Telecommunications; Engineering; Decoding methods; Physics","score_opus":0.011336078168917496,"score_gpt":0.2876714722224291,"score_spread":0.2763353940535116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116430029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062990434,0.0010574674,0.9271306,0.0019844149,0.00025045936,0.0011527018,0.00015438072,0.0017194122,0.003560159],"genre_scores_gemma":[0.98894435,0.0026198959,0.007951081,0.00003798743,0.00000861116,0.0003478664,0.000026284044,0.00003641883,0.000027479608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880326,0.0002861954,0.00040759574,0.00014279605,0.00017222013,0.00018793554],"domain_scores_gemma":[0.99551594,0.0008898384,0.00009261337,0.0033443049,0.00008474356,0.00007254356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031898005,0.0002139445,0.0002133002,0.00016642024,0.0006602087,0.00003536815,0.0012424508,0.000118232405,0.00001590901],"category_scores_gemma":[0.00002478526,0.0001779524,0.00012013583,0.00039735192,0.00016865444,0.0002678254,0.0000033361705,0.00059603486,0.000014725232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007873697,0.00025471568,0.000020513282,0.000028073855,0.00009477687,2.394651e-7,0.00040985405,0.2571222,0.026704937,0.004764324,0.0002146306,0.710307],"study_design_scores_gemma":[0.0004957314,0.0014614789,0.0005732012,0.0002146322,0.00009924259,0.0000051945553,0.000047445075,0.50460505,0.48825982,0.0029767337,0.0008427465,0.0004187349],"about_ca_topic_score_codex":0.000021227379,"about_ca_topic_score_gemma":0.00006801242,"teacher_disagreement_score":0.9259539,"about_ca_system_score_codex":0.00012649519,"about_ca_system_score_gemma":0.000019455123,"threshold_uncertainty_score":0.72566885},"labels":[],"label_agreement":null},{"id":"W2116674255","doi":"10.1109/tcomm.2010.01.080080","title":"Performance analysis of adaptive decode-and-forward cooperative diversity networks with best-relay selection","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":274,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Relay; Relay channel; Cooperative diversity; Node (physics); Computer science; Transmitter; Selection (genetic algorithm); Diversity gain; Computer network; Signal-to-noise ratio (imaging); Diversity combining; Outage probability; Channel (broadcasting); Telecommunications; Fading; Engineering; Power (physics); Artificial intelligence","score_opus":0.0326593209367927,"score_gpt":0.26295878030493214,"score_spread":0.23029945936813945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116674255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10183093,0.00007832136,0.89615107,0.00048044085,0.00008293245,0.00021615539,0.00000967398,0.000091835886,0.0010586514],"genre_scores_gemma":[0.96621597,0.0024283633,0.031022048,0.00009211818,0.0000061731034,0.0000567407,0.0000060671273,0.000008757284,0.00016377716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988434,0.00022499988,0.00027310688,0.0002866597,0.00019082332,0.00018105388],"domain_scores_gemma":[0.9971396,0.0004372658,0.00015230884,0.0016697117,0.00049742224,0.000103732185],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030774734,0.00017470344,0.00027451484,0.0004115681,0.0017458082,0.000063054846,0.0013915075,0.000092669216,0.00003965954],"category_scores_gemma":[0.0000062733307,0.00016051372,0.00009895748,0.0025002942,0.00033355205,0.000517151,0.00008392929,0.0007522197,0.0000054442303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011387077,0.0010932279,0.006095055,0.000006665489,0.00192948,4.332099e-7,0.0045309886,0.841828,0.001035944,0.017444154,0.000051489682,0.12587072],"study_design_scores_gemma":[0.0002867029,0.0002751896,0.0061236247,0.000020870395,0.00039862274,0.0000046281816,0.000079821744,0.9914056,0.0009900904,0.000007156817,0.00021768556,0.00018998931],"about_ca_topic_score_codex":0.00007196743,"about_ca_topic_score_gemma":0.005544287,"teacher_disagreement_score":0.865129,"about_ca_system_score_codex":0.000047628815,"about_ca_system_score_gemma":0.00007442374,"threshold_uncertainty_score":0.9995538},"labels":[],"label_agreement":null},{"id":"W2116750704","doi":"10.1109/tcomm.2002.1006561","title":"A reduced complexity channel estimation for OFDM systems with transmit diversity in mobile wireless channels","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Subcarrier; Orthogonal frequency-division multiplexing; Algorithm; Computational complexity theory; Reduction (mathematics); Channel (broadcasting); Computer science; Bit error rate; Electronic engineering; Mathematics; Telecommunications; Engineering","score_opus":0.08356209367219043,"score_gpt":0.2788531696928271,"score_spread":0.19529107602063667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116750704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094316,0.00054459,0.9857841,0.00045809845,0.00013816179,0.0017448256,0.00016277813,0.0009916013,0.0007442203],"genre_scores_gemma":[0.97845674,0.001857906,0.01659065,0.000021121457,0.000010788784,0.0028581107,0.000038450173,0.00005899019,0.00010726759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882555,0.000109931956,0.00039077873,0.0002206161,0.00017359249,0.0002795063],"domain_scores_gemma":[0.99762046,0.00031246652,0.000078177705,0.0017819831,0.00012278042,0.000084125575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015790622,0.00024332743,0.00030991898,0.00032621075,0.00068840035,0.00004437177,0.0009930864,0.00012911382,0.000018639998],"category_scores_gemma":[0.0000026372938,0.00027140294,0.000087475484,0.0005698434,0.00021209783,0.00037595685,0.000010784413,0.00045325377,0.0000147245055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003174898,0.00044222447,0.0000031923792,0.000119082826,0.00006646086,4.3644374e-7,0.0024861447,0.96557844,0.0006603617,0.0009036549,0.00010435439,0.029603872],"study_design_scores_gemma":[0.00073345075,0.00012687505,0.000023299874,0.0001880608,0.000034076547,0.0000069162047,0.00031148095,0.9915384,0.0055270535,0.00052879227,0.00065806194,0.00032355567],"about_ca_topic_score_codex":0.00009979402,"about_ca_topic_score_gemma":0.00031239117,"teacher_disagreement_score":0.96919346,"about_ca_system_score_codex":0.00027181892,"about_ca_system_score_gemma":0.00001076471,"threshold_uncertainty_score":0.99997383},"labels":[],"label_agreement":null},{"id":"W2117094662","doi":"10.1109/tcomm.2007.898836","title":"Equalization for DS-UWB Systems—Part I: BPSK Modulation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Rake; Rake receiver; Equalization (audio); Computer science; Phase-shift keying; Intersymbol interference; Electronic engineering; Adaptive equalizer; Transmission (telecommunications); Ultra-wideband; Data transmission; Bandwidth (computing); Matched filter; Channel (broadcasting); Bit error rate; Filter (signal processing); Telecommunications; Engineering; Fading; Computer network","score_opus":0.0399079712772989,"score_gpt":0.2799604119695461,"score_spread":0.24005244069224718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117094662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035754202,0.0005740111,0.98765737,0.0005260237,0.0006546601,0.0008333007,0.00010100555,0.0013836483,0.004694552],"genre_scores_gemma":[0.9864149,0.00089063233,0.011278969,0.000050545714,0.000035473768,0.0006691094,0.00013236153,0.00007160124,0.00045638427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986496,0.00007496361,0.0006067654,0.00019243191,0.0001541918,0.00032205676],"domain_scores_gemma":[0.9959673,0.00092281366,0.000086615975,0.0027396313,0.00020348337,0.00008012079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004771257,0.00020963696,0.00021307445,0.0004460125,0.0006313672,0.000053585012,0.00097457157,0.00024225973,0.00002432319],"category_scores_gemma":[0.000026419613,0.00024943324,0.00011756547,0.00068493234,0.00012776026,0.00023732816,0.000004972864,0.00038458657,0.00007487061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007025685,0.00095587,0.00004877618,0.00016596276,0.00042251864,5.29179e-7,0.0011139924,0.72651345,0.03354348,0.10964073,0.0033288922,0.12419553],"study_design_scores_gemma":[0.00151426,0.0002026977,0.00029005186,0.00017767979,0.00021514155,0.000029641158,0.0009328794,0.73291004,0.038240705,0.002841447,0.2216898,0.0009556566],"about_ca_topic_score_codex":0.00003785402,"about_ca_topic_score_gemma":0.00032419572,"teacher_disagreement_score":0.9828395,"about_ca_system_score_codex":0.00024050806,"about_ca_system_score_gemma":0.000027424512,"threshold_uncertainty_score":0.99999577},"labels":[],"label_agreement":null},{"id":"W2117145663","doi":"10.1109/tcomm.2010.03.080118","title":"Capacity of amplify-and-forward multi-hop relaying systems under adaptive transmission","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Channel capacity; Nakagami distribution; Signal-to-noise ratio (imaging); Computer science; Control theory (sociology); Noise power; Communications system; Adaptive system; Channel (broadcasting); Electronic engineering; Topology (electrical circuits); Mathematics; Power (physics); Telecommunications; Engineering; Physics","score_opus":0.10172004464597555,"score_gpt":0.30624978644737333,"score_spread":0.20452974180139777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117145663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032263563,0.00039679412,0.9916648,0.0023800249,0.00030796428,0.00031759404,0.000012277622,0.00016913272,0.0015250073],"genre_scores_gemma":[0.9145071,0.0022380098,0.08285542,0.00009316264,0.000009150219,0.00008530932,0.0000025140612,0.0000145463955,0.0001948021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985016,0.00039782177,0.00044191032,0.0002795396,0.00019115931,0.00018794193],"domain_scores_gemma":[0.99608606,0.00070995296,0.00015922273,0.002637055,0.00026945572,0.00013824122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004782939,0.0001826428,0.00024742822,0.00021877314,0.000947259,0.00007284161,0.0017726393,0.00013875961,0.000025490925],"category_scores_gemma":[0.000011914989,0.0001724834,0.000084411135,0.0005512455,0.00040083478,0.00040268168,0.000029286237,0.00095670763,0.000014694472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037179823,0.001355483,0.000046004625,0.0000513672,0.00022559379,4.3495652e-7,0.010753549,0.016564855,0.15514901,0.56343055,0.00018807512,0.25219792],"study_design_scores_gemma":[0.0012468381,0.0001959702,0.0009081019,0.00026574952,0.00006692333,0.000027275533,0.00069645065,0.97480047,0.008392338,0.0011942609,0.011649771,0.0005558716],"about_ca_topic_score_codex":0.00012621644,"about_ca_topic_score_gemma":0.0003443978,"teacher_disagreement_score":0.9582356,"about_ca_system_score_codex":0.00004043134,"about_ca_system_score_gemma":0.00006178482,"threshold_uncertainty_score":0.7285646},"labels":[],"label_agreement":null},{"id":"W2117691901","doi":"10.1109/tcomm.2006.869881","title":"Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Block code; Decoding methods; Algorithm; Computational complexity theory; Space time; Metric (unit); Mathematics; Computer science; Block (permutation group theory); Concatenated error correction code; Combinatorics; Engineering","score_opus":0.02592500877808454,"score_gpt":0.2732119221488582,"score_spread":0.24728691337077366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117691901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016575849,0.00034505426,0.99119866,0.00042267243,0.00011244345,0.00065140915,0.00046318417,0.0018721242,0.0032768513],"genre_scores_gemma":[0.55294347,0.0005219016,0.44534165,0.000028283046,0.00003097446,0.00057587476,0.000096612835,0.00007510181,0.00038613233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986458,0.000099038225,0.00050359155,0.00023401142,0.00017362148,0.0003439448],"domain_scores_gemma":[0.9966703,0.000641076,0.00009250574,0.0023403699,0.00016883224,0.000086892804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017533882,0.00029369077,0.0003076212,0.00018748642,0.00078799675,0.00006562135,0.0011397059,0.00015519687,0.000089424975],"category_scores_gemma":[0.000005498212,0.00035642638,0.00020853219,0.00038523774,0.00027275455,0.00026890216,0.000010658839,0.000509003,0.00008463959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004263849,0.003147328,0.000019995023,0.00019470582,0.00032559587,0.000001634689,0.00039352267,0.3281913,0.041457653,0.026320577,0.0058418387,0.5940632],"study_design_scores_gemma":[0.00059850735,0.00007919614,0.00006211075,0.00012254607,0.000069927904,0.000013850187,0.00006994652,0.8793282,0.09734147,0.0098158475,0.011872478,0.0006259535],"about_ca_topic_score_codex":0.00005943633,"about_ca_topic_score_gemma":0.00046480415,"teacher_disagreement_score":0.59343725,"about_ca_system_score_codex":0.00022045549,"about_ca_system_score_gemma":0.000036032037,"threshold_uncertainty_score":0.9998888},"labels":[],"label_agreement":null},{"id":"W2117855196","doi":"10.1109/tcomm.2007.908512","title":"On the Applicability of the Pearson Method for Approximating Distributions in Wireless Communications","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Nakagami distribution; Weibull distribution; Fading; Wireless; Weibull fading; Simple (philosophy); Computer science; Random variable; Probability distribution; Communications system; Mathematics; Algorithm; Applied mathematics; Statistics; Telecommunications; Rayleigh fading; Decoding methods","score_opus":0.036687443614386174,"score_gpt":0.32654613722809206,"score_spread":0.28985869361370586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117855196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003730183,0.00010180176,0.9880889,0.003043398,0.000065123204,0.0015846248,0.0002432714,0.00030678787,0.002835914],"genre_scores_gemma":[0.8809045,0.0003071414,0.11717246,0.00006820101,0.0000048478664,0.0014588535,0.000021785212,0.00003912257,0.000023070917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822706,0.0003575054,0.00077126076,0.00017870673,0.00018938172,0.0002761127],"domain_scores_gemma":[0.98662984,0.006204195,0.00017696484,0.006782777,0.0001589241,0.000047292415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015715072,0.00020500513,0.00025236883,0.00015186188,0.00089646503,0.00002215746,0.0032953247,0.0001296,0.000008562133],"category_scores_gemma":[0.00008801712,0.00016175426,0.00020856329,0.0010347295,0.0005078553,0.00010637098,0.00004006359,0.0009974065,0.0000040935383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081852595,0.0026751983,0.00009325941,0.00018493415,0.00019670727,8.6975206e-8,0.0030040029,0.05972549,0.04479746,0.6624221,0.00043771046,0.22638117],"study_design_scores_gemma":[0.0007841815,0.00009260366,0.001062382,0.00039708035,0.00009509491,0.0000053745325,0.0017732726,0.64154583,0.31197926,0.036009043,0.005662588,0.0005933156],"about_ca_topic_score_codex":0.000061044724,"about_ca_topic_score_gemma":0.0010476545,"teacher_disagreement_score":0.8771743,"about_ca_system_score_codex":0.0002898454,"about_ca_system_score_gemma":0.00003829746,"threshold_uncertainty_score":0.6894975},"labels":[],"label_agreement":null},{"id":"W2118061326","doi":"10.1109/tcomm.2010.07.090337","title":"Performance Analysis for BICM Transmission over Gaussian Mixture Noise Fading Channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Fading; Computer science; Gaussian noise; Transmission (telecommunications); Electronic engineering; Fading distribution; Noise (video); Additive white Gaussian noise; Telecommunications; Channel (broadcasting); Algorithm; Rayleigh fading; Engineering; Artificial intelligence","score_opus":0.01915652581378722,"score_gpt":0.277049875312401,"score_spread":0.25789334949861376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118061326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018697778,0.00012725985,0.9770386,0.00057174114,0.00023586133,0.0005201771,0.0000893599,0.0010844585,0.0016347178],"genre_scores_gemma":[0.91793025,0.001946403,0.07895325,0.00004964732,0.000023212526,0.0007320815,0.000060182887,0.00006595674,0.00023901775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989236,0.00004621748,0.00038849245,0.00021684737,0.00014877006,0.00027610207],"domain_scores_gemma":[0.99662673,0.00030963967,0.00006755871,0.0027640725,0.00010340859,0.00012857813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017973514,0.00024865687,0.00027510186,0.00057489815,0.0007157225,0.00005158374,0.0012292734,0.0002115156,0.0001166937],"category_scores_gemma":[0.0000047165836,0.0002650448,0.00027822942,0.001074897,0.00012919212,0.00036121262,0.000005299268,0.00087542436,0.00001527137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004041054,0.000451315,0.000102010956,0.00011339804,0.0006820488,2.3167331e-7,0.0015304744,0.6161759,0.1931372,0.0008994885,0.00032471097,0.18654284],"study_design_scores_gemma":[0.0003453489,0.00004467079,0.00042170408,0.00005075001,0.00028773045,0.0000027523295,0.00003875557,0.8288753,0.1385958,0.00023261379,0.030693457,0.0004110897],"about_ca_topic_score_codex":0.000013365667,"about_ca_topic_score_gemma":0.00013936582,"teacher_disagreement_score":0.89923245,"about_ca_system_score_codex":0.00007228455,"about_ca_system_score_gemma":0.000021919479,"threshold_uncertainty_score":0.99998015},"labels":[],"label_agreement":null},{"id":"W2118733048","doi":"10.1109/tcomm.2013.0828131.120920","title":"Robust Design of Widely Linear Pre-Equalization Filters for Pre-Rake UWB Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 British Columbia","funders":"","keywords":"Rake; Computer science; Rake receiver; Electronic engineering; Transmitter; Equalization (audio); Channel state information; Robustness (evolution); Ultra-wideband; Transmission (telecommunications); Filter (signal processing); Communications system; Channel (broadcasting); Fading; Telecommunications; Engineering; Wireless","score_opus":0.06220147998480039,"score_gpt":0.27022778312334106,"score_spread":0.20802630313854067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118733048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022174378,0.00053423335,0.99330497,0.00052115234,0.0002367521,0.0018352757,0.0001150016,0.0007410837,0.0004941027],"genre_scores_gemma":[0.913934,0.0012460644,0.08119609,0.000028888486,0.000010876179,0.0031286222,0.000061023944,0.00007203618,0.00032239975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856794,0.00017861882,0.0006669468,0.00018569232,0.00014182825,0.0002589678],"domain_scores_gemma":[0.99546486,0.0009835134,0.00013046722,0.0030453675,0.00030571214,0.00007006581],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022737158,0.00022270728,0.00028976717,0.0003407031,0.00035448736,0.000044172728,0.0014074729,0.00022697644,0.000043505195],"category_scores_gemma":[0.000030381472,0.0002463878,0.00012278704,0.00054447714,0.00019312438,0.00030950128,0.000007484547,0.00036650334,0.000045381625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012179085,0.00022065654,0.000006068894,0.000074729614,0.0001342903,2.4079126e-8,0.0004952708,0.98317647,0.009416559,0.0011632991,0.0009942311,0.0043062516],"study_design_scores_gemma":[0.00047364904,0.0001493229,0.00005821652,0.00011641759,0.00010578009,0.000006078472,0.00029672543,0.97813624,0.016768731,0.0005291181,0.0030677028,0.00029201736],"about_ca_topic_score_codex":0.00021173597,"about_ca_topic_score_gemma":0.00008763919,"teacher_disagreement_score":0.9121089,"about_ca_system_score_codex":0.000117993295,"about_ca_system_score_gemma":0.000048572096,"threshold_uncertainty_score":0.9999988},"labels":[],"label_agreement":null},{"id":"W2118891613","doi":"10.1109/tcomm.2005.855005","title":"Enhanced Multiple-Bit Differential Detection of DOQPSK","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Bit error rate; Algorithm; Decoding methods; Phase-shift keying; Bit (key); Mathematics; Offset (computer science); Detection theory; Computer science; Differential coding; Telecommunications; Detector","score_opus":0.018051863832494467,"score_gpt":0.25843734565958626,"score_spread":0.2403854818270918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118891613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024180273,0.00020453012,0.9719171,0.00016129152,0.0001222874,0.00028632063,0.00004160515,0.0009845123,0.0021020926],"genre_scores_gemma":[0.9759232,0.002250068,0.021326091,0.000017887824,0.000018911209,0.0003081562,0.000010662846,0.000048215443,0.00009684527],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999037,0.00007963664,0.00043421934,0.0001327463,0.00014498163,0.00017136867],"domain_scores_gemma":[0.9972092,0.00031345,0.00008002398,0.0022324503,0.000104388244,0.000060494654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006391388,0.00017658544,0.0001998729,0.00023995942,0.00024788614,0.000014816619,0.0008594024,0.0001166327,0.00006686144],"category_scores_gemma":[0.0000072123757,0.00020524854,0.0001250034,0.00033868538,0.00015437276,0.0002509169,0.0000071083255,0.00047259108,0.000051085837],"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.000016572076,0.00027520777,0.0000013916055,0.000018092207,0.000056236953,2.9132421e-8,0.00033214627,0.071636505,0.6489369,0.00023157349,0.000016568947,0.27847874],"study_design_scores_gemma":[0.0003108221,0.00003381662,0.00007053384,0.00003709176,0.000024487976,0.000001640516,0.000048549347,0.11520722,0.88144743,0.00010811172,0.002534123,0.0001761577],"about_ca_topic_score_codex":0.000018829895,"about_ca_topic_score_gemma":0.0005134985,"teacher_disagreement_score":0.9517429,"about_ca_system_score_codex":0.0001422014,"about_ca_system_score_gemma":0.0000124201,"threshold_uncertainty_score":0.8369792},"labels":[],"label_agreement":null},{"id":"W2119039041","doi":"10.1109/tcomm.2009.07.070157","title":"Resource allocation in an OFDM-based cognitive radio system","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 British Columbia","funders":"","keywords":"Cognitive radio; Subcarrier; Knapsack problem; Orthogonal frequency-division multiplexing; Resource allocation; Greedy algorithm; Computer science; Frequency allocation; Mathematical optimization; Resource management (computing); Simple (philosophy); Electronic engineering; Algorithm; Telecommunications; Computer network; Mathematics; Engineering; Wireless","score_opus":0.019338298893964344,"score_gpt":0.2548390433945764,"score_spread":0.23550074450061206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119039041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006824803,0.00016191298,0.9888587,0.00032717138,0.00008312259,0.00040515466,0.000025193234,0.0007822999,0.0025316277],"genre_scores_gemma":[0.9888472,0.000119035,0.010619006,0.00008709291,0.00001753048,0.00014847307,0.00009981686,0.000036958063,0.00002486521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990404,0.00015227804,0.00031262313,0.00017247349,0.00012684979,0.00019537797],"domain_scores_gemma":[0.9986104,0.00020682988,0.00004408649,0.0009851253,0.0000770286,0.00007653256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012219985,0.0001622986,0.00015752921,0.00027639908,0.00022275721,0.000032337797,0.00037619716,0.000106321415,0.000008778045],"category_scores_gemma":[0.0000034547472,0.00020234467,0.000047017922,0.0006511869,0.000054465978,0.00028908162,7.307393e-7,0.0003723071,0.000024453526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020328658,0.00017615229,0.0000063229236,0.000010200003,0.000008402037,6.116858e-7,0.00023321263,0.9735663,0.0004589221,0.00034708268,0.000017317107,0.02515515],"study_design_scores_gemma":[0.0005892654,0.00007597193,0.0003787722,0.0001930922,0.000026155996,0.0000027704339,0.00035359847,0.9947898,0.0031200023,0.00003023505,0.00023179816,0.00020857785],"about_ca_topic_score_codex":0.00000763944,"about_ca_topic_score_gemma":0.00019068364,"teacher_disagreement_score":0.9820224,"about_ca_system_score_codex":0.00029365864,"about_ca_system_score_gemma":0.000026529555,"threshold_uncertainty_score":0.8251377},"labels":[],"label_agreement":null},{"id":"W2119561941","doi":"10.1109/tcomm.2014.022314.120896","title":"Asymptotical Analysis of Several Multiple Description Scenarios with L≥ 3 Descriptions","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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":"Erasure; Algorithm; Computer science; Lattice (music); Code (set theory); Mathematics; Theoretical computer science","score_opus":0.02844989013748888,"score_gpt":0.2391577841428268,"score_spread":0.2107078940053379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119561941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015131471,0.000016786544,0.9826099,0.00074045727,0.00010456657,0.00014380112,0.000023483446,0.00019151751,0.0010379718],"genre_scores_gemma":[0.9241978,0.0000319887,0.07548806,0.00012943125,0.000005737162,0.000059168964,0.000009659569,0.000009286091,0.00006887762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863863,0.0003553967,0.00030407347,0.00027072633,0.0002331147,0.00019804205],"domain_scores_gemma":[0.99650013,0.00059025263,0.000103629805,0.0025150036,0.00018671271,0.000104282095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034937906,0.00014888881,0.00024031686,0.0007308979,0.0005683834,0.000088353685,0.0013605881,0.00007151607,0.000036619018],"category_scores_gemma":[0.00001439642,0.00013835622,0.0002521525,0.0024264657,0.00026909358,0.00041765365,0.00001176417,0.00029809395,0.000017237524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018274324,0.00404615,0.0025514467,0.000029469415,0.0030521492,0.0000010220738,0.0043252716,0.4658767,0.0062257983,0.4576362,0.00011975975,0.0559533],"study_design_scores_gemma":[0.0004786616,0.00023818022,0.007022573,0.0000362021,0.0006666592,0.000005543324,0.00008500085,0.9871357,0.00084652257,0.0021820953,0.0010610987,0.00024177585],"about_ca_topic_score_codex":0.00008493978,"about_ca_topic_score_gemma":0.0009815374,"teacher_disagreement_score":0.9090663,"about_ca_system_score_codex":0.00004106804,"about_ca_system_score_gemma":0.000041961386,"threshold_uncertainty_score":0.5642003},"labels":[],"label_agreement":null},{"id":"W2119912755","doi":"10.1109/tcomm.2010.08.080181","title":"On the Dynamics of Analog Min-Sum Iterative Decoders: An Analytical Approach","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Mathematics; Piecewise linear function; Applied mathematics; Singularity; Algorithm; Computer science; Mathematical analysis","score_opus":0.05127028002457988,"score_gpt":0.3201092435319665,"score_spread":0.2688389635073866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119912755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010938214,0.0000058031774,0.9762988,0.0035097043,0.00018269602,0.00027875134,0.000025146806,0.0002912255,0.008469645],"genre_scores_gemma":[0.8496398,0.000014251333,0.14987789,0.00021443334,0.0000066888542,0.00009258765,0.000007301859,0.000013332646,0.00013375291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862397,0.00032909052,0.00031497097,0.00029879276,0.0002438992,0.00018926969],"domain_scores_gemma":[0.9941718,0.0010587657,0.00012581197,0.004355088,0.0002051401,0.000083390536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189949,0.00016523714,0.00017427024,0.00024464144,0.0005633581,0.00010580171,0.0032756533,0.00011512627,0.000020957565],"category_scores_gemma":[0.00004149827,0.00013246103,0.00013081286,0.000751295,0.00036396223,0.00032516196,0.00002047931,0.0010625807,0.0000135638975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016144902,0.0020783856,0.000039916922,0.000007210463,0.00008273806,5.8942857e-7,0.0031845989,0.0022288063,0.0010813777,0.9678733,0.00030148824,0.023105456],"study_design_scores_gemma":[0.00009365519,0.00018497517,0.00011252094,0.000017791303,0.000024758116,0.000011380908,0.00023835043,0.9886659,0.0037201233,0.0066679716,0.00010403607,0.00015855808],"about_ca_topic_score_codex":0.000100635945,"about_ca_topic_score_gemma":0.0018736077,"teacher_disagreement_score":0.9864371,"about_ca_system_score_codex":0.0000624318,"about_ca_system_score_gemma":0.000085338084,"threshold_uncertainty_score":0.6087034},"labels":[],"label_agreement":null},{"id":"W2120347238","doi":"10.1109/tcomm.2011.060911.100166","title":"Exact and Closed-Form Error Performance Analysis for Hard MMSE-SIC Detection in MIMO Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Quadrature amplitude modulation; MIMO; Bit error rate; QAM; Mathematics; Algorithm; Single antenna interference cancellation; Pulse-amplitude modulation; Modulation (music); Control theory (sociology); Computer science; Statistics; Telecommunications; Pulse (music); Decoding methods; Physics; Detector","score_opus":0.05845323976861937,"score_gpt":0.2715310289998595,"score_spread":0.2130777892312401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120347238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083639644,0.0004778616,0.91325414,0.00004495931,0.00011150734,0.00067255524,0.000052576954,0.0006392506,0.0011074784],"genre_scores_gemma":[0.9752934,0.0035305247,0.019631762,0.00001236245,0.000005981077,0.0013875932,0.000015750833,0.00004367118,0.00007897564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901044,0.00007184317,0.0004291941,0.00018193154,0.00009347065,0.00021309839],"domain_scores_gemma":[0.99775785,0.0002144469,0.00007587438,0.0018039076,0.00008303717,0.000064898195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022704582,0.00018929224,0.0002690903,0.0006621336,0.00033082187,0.000029220055,0.0005944609,0.00012530152,0.000011480111],"category_scores_gemma":[0.000004879889,0.00021634552,0.00011077391,0.0008624033,0.00010918789,0.00039079666,0.000006054813,0.00039468548,0.000008586073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000263028,0.0015038544,0.0023482246,0.00073362933,0.0020072206,9.724557e-7,0.010270627,0.45162773,0.02252584,0.0018511998,0.00007680321,0.5067909],"study_design_scores_gemma":[0.00052917306,0.00013463726,0.009877382,0.00010027115,0.00027956202,0.000005774173,0.0004873237,0.93927,0.046820033,0.00024648194,0.0017915843,0.00045775654],"about_ca_topic_score_codex":0.0001524488,"about_ca_topic_score_gemma":0.0013570215,"teacher_disagreement_score":0.8936224,"about_ca_system_score_codex":0.00017574852,"about_ca_system_score_gemma":0.000013019013,"threshold_uncertainty_score":0.8822315},"labels":[],"label_agreement":null},{"id":"W2120448104","doi":"10.1109/tcomm.2004.836447","title":"Multihop Diversity in Wireless Relaying Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":673,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Channel (broadcasting); Computer science; Computer network; Wireless; Transmission (telecommunications); Signal-to-noise ratio (imaging); Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","score_opus":0.09475132157149174,"score_gpt":0.3027697721859978,"score_spread":0.20801845061450608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120448104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016194427,0.00016584944,0.97382414,0.0070231236,0.00029053286,0.00025194552,0.0000035548742,0.0002469642,0.0019994506],"genre_scores_gemma":[0.9809412,0.0024422766,0.015991054,0.00041450822,0.000007934882,0.00007323411,0.0000025380155,0.00000980654,0.00011747229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884105,0.00022171419,0.00026927138,0.00026330195,0.00017495197,0.0002297113],"domain_scores_gemma":[0.9968907,0.00024494596,0.000066695815,0.0026062853,0.00010380057,0.00008754301],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030070197,0.00014369031,0.00015273943,0.00028299747,0.0014480691,0.00009343861,0.0029103968,0.00007268869,0.000014218988],"category_scores_gemma":[0.0000073932174,0.00016190576,0.00008535391,0.0010463248,0.00011719432,0.0005395871,0.00012446751,0.0005804018,0.000097363576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003926633,0.0041413857,0.00043866673,0.00002265986,0.00012999006,0.000015480535,0.029814173,0.18842798,0.0045955596,0.29079404,0.00016463058,0.48141617],"study_design_scores_gemma":[0.01164882,0.00053788745,0.00718573,0.0012655611,0.000083765124,0.0000842336,0.0019249932,0.9082745,0.03286492,0.02317974,0.009871963,0.0030778984],"about_ca_topic_score_codex":0.00016395882,"about_ca_topic_score_gemma":0.0014430542,"teacher_disagreement_score":0.9647468,"about_ca_system_score_codex":0.00024761198,"about_ca_system_score_gemma":0.0000767346,"threshold_uncertainty_score":0.9998519},"labels":[],"label_agreement":null},{"id":"W2120458420","doi":"10.1109/tcomm.2009.09.070567","title":"Distribution of Max-Log Metrics for QAM-Based BICM in Fading Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Quadrature amplitude modulation; QAM; Algorithm; Computer science; Mathematics; Probability density function; Fading distribution; Electronic engineering; Statistics; Bit error rate; Decoding methods; Rayleigh fading; Engineering","score_opus":0.03961288077833008,"score_gpt":0.300856371263989,"score_spread":0.2612434904856589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120458420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031627757,0.00031966495,0.9939869,0.00087036635,0.0000879537,0.0005218992,0.0001884306,0.00046022475,0.00040177105],"genre_scores_gemma":[0.9527337,0.00094505685,0.045809485,0.000041640644,0.0000053238527,0.0003202124,0.00010175715,0.000024403425,0.000018447705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990585,0.00006481449,0.0004427275,0.00012607042,0.00011357683,0.00019431303],"domain_scores_gemma":[0.99757165,0.0005547821,0.00007851704,0.0016260666,0.0001227437,0.000046231482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022179392,0.00015061644,0.00022110392,0.00045476673,0.00017575709,0.000015613452,0.0008158546,0.0001163139,0.000006014904],"category_scores_gemma":[0.000026351796,0.00018278018,0.00011184837,0.0011029566,0.00008124561,0.00017728168,0.0000026763594,0.0003342287,0.000003253615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026297737,0.00060200185,0.000012094151,0.00005064716,0.000026328751,1.5025309e-7,0.00021680238,0.8828306,0.011891206,0.0052563804,0.00016094581,0.09892653],"study_design_scores_gemma":[0.0008144597,0.0001775242,0.00032125652,0.00018046462,0.0000371718,0.0000013725418,0.00007941415,0.6883084,0.30061698,0.0039903447,0.0051128604,0.00035971953],"about_ca_topic_score_codex":0.000014388732,"about_ca_topic_score_gemma":0.000045363082,"teacher_disagreement_score":0.9495709,"about_ca_system_score_codex":0.0002269292,"about_ca_system_score_gemma":0.000026243204,"threshold_uncertainty_score":0.7453559},"labels":[],"label_agreement":null},{"id":"W2120530281","doi":"10.1109/tcomm.2011.050911.100063","title":"On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multiplexing; Outage probability; MIMO; Relay; Computer science; Electronic engineering; Telecommunications; Topology (electrical circuits); Channel (broadcasting); Fading; Engineering; Electrical engineering; Physics; Power (physics)","score_opus":0.14930326292531437,"score_gpt":0.2839082592346494,"score_spread":0.13460499630933503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120530281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033469606,0.00026459777,0.95276594,0.003661029,0.00029731973,0.00068375614,0.000013545184,0.0003067898,0.00853742],"genre_scores_gemma":[0.9734049,0.0010017148,0.025022175,0.00029992397,0.0000043364057,0.0000878956,0.000002018635,0.000009365575,0.00016766253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985677,0.00045107817,0.00028620398,0.0003340223,0.00014570837,0.00021527948],"domain_scores_gemma":[0.99682254,0.00050558156,0.00007076232,0.0024304113,0.00007026571,0.00010043733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045615225,0.00016305714,0.0001709625,0.00025150957,0.00112637,0.0000667452,0.0018893899,0.00007910849,0.000040725816],"category_scores_gemma":[0.000020527632,0.00017121737,0.00006865275,0.00060095364,0.00018819694,0.0004245497,0.0001075868,0.0005989091,0.00003118308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019619311,0.007925245,0.0022042394,0.000062220905,0.0002000113,0.000012503913,0.12885259,0.016969996,0.0013010236,0.5224816,0.00038067417,0.3194137],"study_design_scores_gemma":[0.005793521,0.00134011,0.035553537,0.0008383174,0.00008423743,0.00004507124,0.0012396382,0.88568425,0.009808907,0.04990981,0.0072206645,0.0024819488],"about_ca_topic_score_codex":0.00007499266,"about_ca_topic_score_gemma":0.00077473925,"teacher_disagreement_score":0.9399353,"about_ca_system_score_codex":0.00010205441,"about_ca_system_score_gemma":0.00003387664,"threshold_uncertainty_score":0.8663241},"labels":[],"label_agreement":null},{"id":"W2120721517","doi":"10.1109/tcomm.2006.878827","title":"Differential turbo-coded modulation with APP channel estimation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Phase-shift keying; Decoding methods; Algorithm; Turbo code; Computer science; Bit error rate; Channel (broadcasting); Concatenated error correction code; Differential coding; Keying; Channel state information; Convolutional code; Binary erasure channel; Electronic engineering; Telecommunications; Channel capacity; Block code; Engineering; Wireless","score_opus":0.013767703521590572,"score_gpt":0.23762409514665656,"score_spread":0.223856391625066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120721517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082663335,0.000076838965,0.98559034,0.00030964628,0.000088349894,0.00041844996,0.00004052859,0.00211506,0.0030944326],"genre_scores_gemma":[0.9483606,0.00025728456,0.050412793,0.000017215052,0.000017669623,0.0004982026,0.000127595,0.000068062254,0.000240574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901855,0.000068990485,0.0003432001,0.00017099951,0.00019498705,0.00020324929],"domain_scores_gemma":[0.9976133,0.00014395616,0.00007338731,0.0020181057,0.00010077259,0.00005045078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050847546,0.00022686765,0.00018023881,0.00025139793,0.00043869804,0.000052566054,0.00064761937,0.00011159571,0.00003876406],"category_scores_gemma":[0.0000016891681,0.00023532813,0.00006895403,0.00042300826,0.00013747926,0.000357966,0.000004798709,0.00042378082,0.000041754385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015661508,0.00022772362,0.0000028416691,0.000016378799,0.000033520708,1.8886884e-7,0.00015837226,0.9658735,0.0051913382,0.0014316408,0.00012046963,0.026928376],"study_design_scores_gemma":[0.00041494134,0.000043841083,0.00030443244,0.00006177196,0.00003806666,0.000006350419,0.00004062951,0.9261133,0.069260776,0.002910637,0.0004905505,0.00031471963],"about_ca_topic_score_codex":0.000070386755,"about_ca_topic_score_gemma":0.00028287817,"teacher_disagreement_score":0.9400943,"about_ca_system_score_codex":0.00016038312,"about_ca_system_score_gemma":0.000016103075,"threshold_uncertainty_score":0.95964026},"labels":[],"label_agreement":null},{"id":"W2120896095","doi":"10.1109/tcomm.2006.877947","title":"Distributed space-time block coding","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":257,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Relay; Code (set theory); Algorithm; Topology (electrical circuits); Combinatorics; Mathematics; Set (abstract data type); Physics; Programming language","score_opus":0.03229868936485061,"score_gpt":0.2693690723793093,"score_spread":0.23707038301445868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120896095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062254636,0.00030142802,0.97746533,0.010444659,0.0001599998,0.000236094,0.00003509691,0.0005955305,0.010139307],"genre_scores_gemma":[0.97431177,0.0008787629,0.02269689,0.00020699583,0.0000241855,0.000097306,0.00002941281,0.000016660902,0.0017380395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857956,0.00030426926,0.00035338168,0.00028429492,0.00020522017,0.00027327222],"domain_scores_gemma":[0.9955425,0.0004861596,0.000104379695,0.0035864909,0.00019192882,0.00008852681],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00024658398,0.00018971004,0.00018562734,0.00018793199,0.0013208793,0.00021851236,0.0026723754,0.00007550392,0.000068491354],"category_scores_gemma":[0.00000806887,0.00020327707,0.0001310443,0.001021996,0.00014961103,0.0003825339,0.00003962769,0.00043993403,0.00043319777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041375337,0.0052052126,0.00009165843,0.000028847744,0.00032051196,0.000010100208,0.001594489,0.12042234,0.064923115,0.62784034,0.043199554,0.13632244],"study_design_scores_gemma":[0.0009871542,0.00010820373,0.0007256556,0.000112059155,0.000048675553,0.000038771297,0.00003889816,0.8565692,0.017900696,0.0026043598,0.120090336,0.00077602733],"about_ca_topic_score_codex":0.000032653345,"about_ca_topic_score_gemma":0.00015162851,"teacher_disagreement_score":0.9736892,"about_ca_system_score_codex":0.00013111977,"about_ca_system_score_gemma":0.00007114086,"threshold_uncertainty_score":0.99997926},"labels":[],"label_agreement":null},{"id":"W2120940736","doi":"10.1109/tcomm.2011.051311.090588","title":"Adaptive L_p—Norm Spectrum Sensing for Cognitive Radio Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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 British Columbia","funders":"","keywords":"Cognitive radio; Additive white Gaussian noise; Detector; Algorithm; False alarm; Gaussian noise; Rayleigh fading; Computer science; Norm (philosophy); Detection theory; Fading; Mathematics; Electronic engineering; Wireless; Telecommunications; Channel (broadcasting); Statistics; Engineering; Decoding methods","score_opus":0.06190989711200075,"score_gpt":0.26437578500067466,"score_spread":0.20246588788867392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120940736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030581356,0.0002521191,0.98714465,0.0008211554,0.0005587802,0.0006566224,0.000027233344,0.00034219935,0.009891418],"genre_scores_gemma":[0.9081858,0.00036489975,0.090764485,0.00032452823,0.00007861523,0.000046882105,0.0000072241655,0.000034309276,0.00019326412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983072,0.00020473344,0.00036376706,0.00046628685,0.00016531118,0.00049267284],"domain_scores_gemma":[0.9968747,0.0010932764,0.00014637526,0.0015047998,0.00022104655,0.00015982157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029307083,0.0002698494,0.00027841344,0.00023527403,0.0012334604,0.00012073448,0.0009720629,0.00012205272,0.000024714007],"category_scores_gemma":[0.00001054594,0.00029264943,0.00025574001,0.00068823947,0.00024713267,0.0004408616,0.000016987715,0.00055996154,0.000031197364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004232633,0.0015995669,0.000018358616,0.00001576082,0.000875148,0.000027665408,0.008762531,0.008810867,0.00016438335,0.069654346,0.0007102413,0.9089379],"study_design_scores_gemma":[0.00088865525,0.00039442233,0.00027231604,0.00014693377,0.00012570535,0.00008335317,0.0003733805,0.9865765,0.003041984,0.0070734043,0.00053140096,0.0004919713],"about_ca_topic_score_codex":0.00013773896,"about_ca_topic_score_gemma":0.0008037407,"teacher_disagreement_score":0.9777656,"about_ca_system_score_codex":0.00012825761,"about_ca_system_score_gemma":0.00009130837,"threshold_uncertainty_score":0.99995255},"labels":[],"label_agreement":null},{"id":"W2120968943","doi":"10.1109/tcomm.2013.042313.120770","title":"Throughput Upper-Bound of Slotted CSMA Systems with Unsaturated Finite Population","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Networks and Protocols","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":"Upper and lower bounds; Throughput; Exponential backoff; Computer science; Population; Algorithm; Markov process; Markov chain; Protocol (science); Computer network; Mathematics; Statistics","score_opus":0.02820872018376837,"score_gpt":0.26199499860348535,"score_spread":0.23378627841971697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120968943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006424579,0.000095897216,0.9874772,0.0013372289,0.00019031408,0.0031863635,0.000016918659,0.00023206396,0.0010394381],"genre_scores_gemma":[0.97748786,0.000075196964,0.019440277,0.000072792056,0.000014329372,0.0025839617,0.000017086946,0.000017888375,0.00029060882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865764,0.00025116417,0.00040335607,0.00023893552,0.0002380998,0.00021080226],"domain_scores_gemma":[0.99663186,0.00043384853,0.00020290678,0.0023626627,0.0002912012,0.00007749817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014074013,0.00016838685,0.00022488392,0.0001552495,0.00047104876,0.00021415863,0.0013200262,0.000102815015,0.00003206573],"category_scores_gemma":[0.000003117133,0.00014190112,0.0000708866,0.00091733737,0.000114617265,0.0007085176,0.000009835241,0.00031804264,0.00006501313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011456556,0.0028871645,0.0010588282,0.00023525079,0.0006369767,0.000003191272,0.0034427366,0.7201082,0.004035449,0.07658763,0.0017794237,0.18911056],"study_design_scores_gemma":[0.00091940636,0.00039953945,0.0076711564,0.00038113733,0.000042823758,0.00002546247,0.00013823452,0.9850094,0.0014530162,0.0011269341,0.0023868587,0.0004460542],"about_ca_topic_score_codex":0.0017263595,"about_ca_topic_score_gemma":0.00022442362,"teacher_disagreement_score":0.97106326,"about_ca_system_score_codex":0.00005435142,"about_ca_system_score_gemma":0.000062907624,"threshold_uncertainty_score":0.57865596},"labels":[],"label_agreement":null},{"id":"W2120987109","doi":"10.1109/tcomm.2010.03.070409","title":"Fixed relaying versus selective relaying in multi-hop diversity transmission systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rayleigh fading; Hop (telecommunications); Relay; Computer science; Diversity gain; Bit error rate; Fading; Transmission (telecommunications); Diversity scheme; Cooperative diversity; Outage probability; Diversity combining; Electronic engineering; Telecommunications; Decoding methods; Engineering; Physics","score_opus":0.09965880473049743,"score_gpt":0.3175072360297983,"score_spread":0.21784843129930087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120987109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009331838,0.00037107183,0.98376656,0.001783681,0.0009828797,0.00047888808,0.000006236829,0.00034884692,0.0029299944],"genre_scores_gemma":[0.9582108,0.0016936265,0.03962395,0.00007450906,0.000010546606,0.00011714237,0.000004646606,0.000017098759,0.00024767642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981258,0.00053068314,0.00040168592,0.00039174463,0.00024406813,0.0003060273],"domain_scores_gemma":[0.9958759,0.00093306135,0.00011815806,0.0027078823,0.00022190527,0.00014309117],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00059764326,0.00021331903,0.00022565316,0.0003699382,0.002346002,0.00015251635,0.0028874506,0.00016673534,0.000020697422],"category_scores_gemma":[0.000030470756,0.00023217549,0.00011916622,0.0012921711,0.00013768312,0.00068913674,0.00009765671,0.0016486098,0.000055270208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005644395,0.0072236937,0.002099693,0.000093656025,0.00054457854,0.000024137413,0.061401907,0.10153745,0.09418491,0.09120941,0.0009771079,0.64013904],"study_design_scores_gemma":[0.003326679,0.00014061517,0.0024217458,0.00017773348,0.000040395273,0.000015216716,0.0004884472,0.9814526,0.002915241,0.000095970645,0.008287626,0.0006377416],"about_ca_topic_score_codex":0.00017283646,"about_ca_topic_score_gemma":0.0017020345,"teacher_disagreement_score":0.94887894,"about_ca_system_score_codex":0.00018845985,"about_ca_system_score_gemma":0.000111153604,"threshold_uncertainty_score":0.9989528},"labels":[],"label_agreement":null},{"id":"W2121288242","doi":"10.1109/tcomm.2011.010411.090109","title":"Error Rate Analysis of M-ary Coherent Free-Space Optical Communication Systems with K-Distributed Turbulence","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Medical Research Council","keywords":"Quadrature amplitude modulation; Phase-shift keying; Bit error rate; Free-space optical communication; Compensation (psychology); Modulation (music); Optical communication; Turbulence; Standard deviation; Electronic engineering; Phase (matter); Mathematics; Keying; Control theory (sociology); Physics; Optics; Computer science; Telecommunications; Algorithm; Statistics; Engineering; Acoustics","score_opus":0.0420204356942666,"score_gpt":0.24236343471276145,"score_spread":0.20034299901849484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121288242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043813918,0.0024214152,0.9383668,0.0010532475,0.000108003456,0.00091077393,0.00093697815,0.0020533989,0.010335468],"genre_scores_gemma":[0.9699957,0.0028133236,0.026556075,0.000012954194,0.0000016830055,0.00040223807,0.00012670059,0.00004267767,0.0000486897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838036,0.0002650696,0.0006301008,0.00021722137,0.00023487737,0.00027234],"domain_scores_gemma":[0.99152887,0.00077505945,0.00015846132,0.007130193,0.00027334754,0.00013407203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030046157,0.00027354466,0.0004924503,0.00055483764,0.00031116031,0.00004030894,0.0029400373,0.00022208768,0.00008922516],"category_scores_gemma":[0.00003696797,0.00026239434,0.00015189857,0.0021224779,0.0007531085,0.00024213304,0.00003837064,0.0008140739,0.000028657356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018233206,0.0024298744,0.00025251327,0.0001350497,0.005724346,0.0000023816626,0.0019245981,0.9195067,0.0025573042,0.062282402,0.0005873037,0.00441515],"study_design_scores_gemma":[0.0008370098,0.00025270059,0.0039491197,0.0002514897,0.0017688829,0.000007010141,0.002307974,0.9692045,0.019188888,0.00045029868,0.0010658238,0.0007163417],"about_ca_topic_score_codex":0.00025860462,"about_ca_topic_score_gemma":0.00064201566,"teacher_disagreement_score":0.92618173,"about_ca_system_score_codex":0.00014850876,"about_ca_system_score_gemma":0.000045375513,"threshold_uncertainty_score":0.99998283},"labels":[],"label_agreement":null},{"id":"W2121484689","doi":"10.1109/tcomm.2013.13.120317","title":"Grobner Bases for Lattices and an Algebraic Decoding Algorithm","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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":"Gröbner basis; Decoding methods; Algebraic number; Algorithm; Computer science; Berlekamp–Welch algorithm; List decoding; Sequential decoding; Algebra over a field; Mathematics; Theoretical computer science; Block code; Computation; Concatenated error correction code; Pure mathematics","score_opus":0.04023690450236831,"score_gpt":0.2959592228082651,"score_spread":0.25572231830589676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121484689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039222087,0.00011888023,0.99243504,0.0023894012,0.00014294063,0.00030723197,0.000019840867,0.00021832947,0.0004461023],"genre_scores_gemma":[0.6775977,0.00014619096,0.32138982,0.00041271205,0.000014731551,0.00033856858,0.0000042800975,0.00000991497,0.00008606208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.00012670396,0.00016750727,0.00023169706,0.00007970347,0.00017391883],"domain_scores_gemma":[0.99761057,0.00071156817,0.00004859242,0.0014319464,0.00009096641,0.00010634044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020605403,0.00011453754,0.000104362014,0.00017739456,0.0008730195,0.00024932894,0.0010712745,0.000047127844,0.000047667723],"category_scores_gemma":[0.0000048889133,0.00011294302,0.00007685994,0.00030011666,0.00013006965,0.0009597369,0.000010617591,0.00014901385,0.000023571627],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035906444,0.00039066994,0.000014549542,0.000010124575,0.000050040922,1.4567199e-7,0.00090618106,0.00012807107,0.00078921235,0.097263776,0.00024065774,0.900203],"study_design_scores_gemma":[0.0008721221,0.00053029606,0.00051759096,0.000073469164,0.00008981357,0.00002371369,0.00046202372,0.8250533,0.0046609403,0.15172887,0.015337548,0.000650367],"about_ca_topic_score_codex":0.00006007388,"about_ca_topic_score_gemma":0.00008520524,"teacher_disagreement_score":0.89955264,"about_ca_system_score_codex":0.000012097925,"about_ca_system_score_gemma":0.000019783125,"threshold_uncertainty_score":0.67146486},"labels":[],"label_agreement":null},{"id":"W2121887926","doi":"10.1109/26.855514","title":"A quasi-optimum receiver for continuous phase modulation","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","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 Manitoba","funders":"","keywords":"Continuous phase modulation; Radio receiver design; SIGNAL (programming language); Modulation (music); Analog transmission; Electronic engineering; Computer science; Phase (matter); Phase modulation; Analog signal; Telecommunications; Engineering; Digital signal processing; Phase noise; Acoustics; Physics; Transmitter","score_opus":0.03604156395441832,"score_gpt":0.30486735670438386,"score_spread":0.26882579274996554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121887926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053117485,0.00006808727,0.989094,0.00021491028,0.00010422542,0.0005510891,0.0002041892,0.0012998919,0.003151843],"genre_scores_gemma":[0.88610667,0.0006001821,0.11165265,0.000036747195,0.000017843598,0.0006135659,0.000032634274,0.000050911935,0.00088882196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933356,0.000034002293,0.00023513613,0.00014288296,0.0000753842,0.00017900844],"domain_scores_gemma":[0.9985872,0.00017342919,0.00002413438,0.0010972236,0.00006358801,0.00005442981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007324181,0.0001510393,0.00015106502,0.000109253575,0.00027212253,0.000023910421,0.0003842168,0.000078827805,0.00021393536],"category_scores_gemma":[0.0000031777565,0.0001786898,0.0000978172,0.00018005751,0.00007422666,0.0002211095,0.000001051796,0.00022567395,0.000065054235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008851765,0.0010106919,6.0808316e-7,0.00002326036,0.00009283843,4.274636e-7,0.0004507252,0.31887102,0.01485342,0.0006473435,0.0009530195,0.66300815],"study_design_scores_gemma":[0.0013288325,0.00042530813,0.00001902404,0.00007380319,0.000053347627,0.0000073216643,0.000044413377,0.86764634,0.025168201,0.0025373313,0.102277644,0.000418412],"about_ca_topic_score_codex":0.000009384948,"about_ca_topic_score_gemma":0.000028479159,"teacher_disagreement_score":0.8807949,"about_ca_system_score_codex":0.000106581756,"about_ca_system_score_gemma":0.000009421075,"threshold_uncertainty_score":0.7286759},"labels":[],"label_agreement":null},{"id":"W2122210545","doi":"10.1109/tcomm.2009.11.080038","title":"Linear LLR approximation for iterative decoding on wireless channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Fading; Rayleigh fading; Channel state information; Decoding methods; Mathematics; Noise power; Measure (data warehouse); Channel (broadcasting); Algorithm; Noise (video); Signal-to-noise ratio (imaging); Bit error rate; Wireless; Computer science; Statistics; Power (physics); Telecommunications; Physics","score_opus":0.042422888012264834,"score_gpt":0.3109782135341635,"score_spread":0.26855532552189865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122210545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018628829,0.00010081842,0.9914739,0.0013770029,0.00016868612,0.00083312544,0.00007505762,0.0013466409,0.0027618494],"genre_scores_gemma":[0.9093287,0.0009820506,0.08840337,0.00022896804,0.000030504763,0.00077062694,0.000058709546,0.000048691778,0.00014838502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896604,0.00008014009,0.00038618685,0.000195165,0.00013665225,0.00023579499],"domain_scores_gemma":[0.9972951,0.0004953773,0.0000757781,0.001913292,0.00014554421,0.00007494642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015637284,0.00023566873,0.00022125992,0.0002897494,0.00059893733,0.00005369003,0.0008492076,0.00012946407,0.000014325288],"category_scores_gemma":[0.000010171229,0.00026703268,0.00012911389,0.0003730531,0.00007403849,0.00033200355,0.00000306847,0.0004747248,0.000034428624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000789068,0.0009331127,0.0000010572321,0.00005530123,0.00011318836,3.2922932e-7,0.002178462,0.4861353,0.024824599,0.03095755,0.0008331407,0.45388904],"study_design_scores_gemma":[0.00047778338,0.00023889588,0.0000102558,0.00016262685,0.000028096862,0.0000028671082,0.000105781604,0.76117355,0.2279225,0.0048129167,0.0046769395,0.00038776954],"about_ca_topic_score_codex":0.0000024025958,"about_ca_topic_score_gemma":0.000013796419,"teacher_disagreement_score":0.9074658,"about_ca_system_score_codex":0.00019291186,"about_ca_system_score_gemma":0.000017216105,"threshold_uncertainty_score":0.9999782},"labels":[],"label_agreement":null},{"id":"W2122539785","doi":"10.1109/tcomm.2012.090512.110198","title":"EDFA-Based All-Optical Relaying in Free-Space Optical Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Computer science; Electronic engineering; Attenuation; Optical amplifier; Optical wireless; Optical performance monitoring; Free-space optical communication; Transmission (telecommunications); Optical communication; Optical communications repeater; Optical engineering; Fading; Wireless; Optical fiber; Wavelength-division multiplexing; Channel (broadcasting); Optical attenuator; Telecommunications; Engineering; Laser; Multi-mode optical fiber; Optics; Wavelength; Physics","score_opus":0.04264797399737679,"score_gpt":0.2703477278897781,"score_spread":0.22769975389240132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122539785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015306428,0.009156696,0.9251894,0.0152352685,0.0011834066,0.0008410892,0.00006469653,0.0033372329,0.029685808],"genre_scores_gemma":[0.95851874,0.0015477254,0.03917362,0.00006753016,0.00001938488,0.0004910052,0.000010775469,0.000066604116,0.00010458919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983498,0.0001438174,0.00051499315,0.0001726151,0.00025051326,0.0005682558],"domain_scores_gemma":[0.99439627,0.0012114942,0.000039588664,0.00410067,0.000062928666,0.00018907078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040245344,0.00025330466,0.0002884512,0.00038776913,0.00021614747,0.00006969723,0.0017581129,0.00033360455,0.000032955508],"category_scores_gemma":[0.000068667134,0.0002854744,0.00011182152,0.00067843805,0.00036302838,0.0003836722,0.000024049781,0.0013886661,0.00025854527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005358658,0.0041215434,0.00033752777,0.00024523507,0.00033536198,0.000005173763,0.000984904,0.6857474,0.010096535,0.24396256,0.0029822532,0.051127937],"study_design_scores_gemma":[0.0021747411,0.0001609651,0.0008673509,0.0005550576,0.0001662933,0.00004280742,0.0016521534,0.8865335,0.05499384,0.0010203436,0.050292503,0.0015404361],"about_ca_topic_score_codex":0.00004417485,"about_ca_topic_score_gemma":0.0000979732,"teacher_disagreement_score":0.94321233,"about_ca_system_score_codex":0.00035832252,"about_ca_system_score_gemma":0.00003333608,"threshold_uncertainty_score":0.99995977},"labels":[],"label_agreement":null},{"id":"W2123054575","doi":"10.1109/tcomm.2007.906399","title":"Reduced-Complexity Time-Domain Equalization for Turbo-MIMO Systems","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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","funders":"","keywords":"Intersymbol interference; Computer science; Quadrature amplitude modulation; MIMO; Algorithm; Turbo; Equalization (audio); Trellis (graph); QAM; Turbo code; Trellis modulation; Electronic engineering; Mathematics; Channel (broadcasting); Bit error rate; Fading; Telecommunications; Decoding methods; Engineering","score_opus":0.054266928894197666,"score_gpt":0.31308632458758306,"score_spread":0.2588193956933854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123054575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018829504,0.0004481654,0.9881356,0.00031759896,0.00027879945,0.0009944877,0.00012616656,0.0019540219,0.005862247],"genre_scores_gemma":[0.90108925,0.0005537184,0.09709971,0.00004724844,0.000032590026,0.00060283113,0.00011001695,0.0000903032,0.00037433513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858016,0.00011533296,0.00060463994,0.00019846311,0.00017716447,0.00032423547],"domain_scores_gemma":[0.9959741,0.0009463775,0.0001062711,0.0026638398,0.00019875029,0.000110660374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005802068,0.00023445123,0.0002502871,0.0003125044,0.00062463304,0.000056483914,0.0011096391,0.00016539734,0.000029659894],"category_scores_gemma":[0.000017667275,0.0002802247,0.00013040655,0.00051309954,0.00019778228,0.00028046986,0.000007086449,0.00040243365,0.000079160855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021328445,0.0018861765,0.000014388682,0.00046012044,0.0006086011,0.0000015585628,0.0037237224,0.42727482,0.25325158,0.14559193,0.006882124,0.1600917],"study_design_scores_gemma":[0.001768845,0.0002793303,0.00016635227,0.00042816045,0.00016163863,0.000038447484,0.0010467143,0.48168296,0.36656538,0.018186832,0.1278206,0.001854751],"about_ca_topic_score_codex":0.000023677994,"about_ca_topic_score_gemma":0.000091138114,"teacher_disagreement_score":0.8992063,"about_ca_system_score_codex":0.00030537444,"about_ca_system_score_gemma":0.000026473841,"threshold_uncertainty_score":0.999965},"labels":[],"label_agreement":null},{"id":"W2123447220","doi":"10.1109/tcomm.2009.02.070158","title":"Decentralized dynamic spectrum access for cognitive radios: cooperative design of a non-cooperative game","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":true,"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; Computer science; Regret; Channel (broadcasting); Interference (communication); Computer network; Agile software development; Wireless; Telecommunications; Machine learning","score_opus":0.042197090668896084,"score_gpt":0.32879332533251926,"score_spread":0.28659623466362316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123447220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010643777,0.00028295463,0.99281347,0.0034994492,0.00017336407,0.0015564354,0.0000813169,0.00013210271,0.00039654993],"genre_scores_gemma":[0.965182,0.0011692976,0.032913648,0.00046206728,0.000012304058,0.00013493338,0.000016004038,0.000020117695,0.00008963468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810743,0.00036658594,0.00047767695,0.00044399814,0.00020093365,0.0004033957],"domain_scores_gemma":[0.9965153,0.0015527795,0.00018793906,0.0011678085,0.00044959877,0.00012658887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027953886,0.0002866229,0.00043086754,0.0002720086,0.00065648346,0.00021989326,0.0014881834,0.000097963755,0.000019634788],"category_scores_gemma":[0.00003062327,0.0002879121,0.00019730725,0.0010227495,0.00023429972,0.00072223373,0.000011707383,0.00038177203,0.0000091880775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018127409,0.007539451,0.000007709011,0.000053811935,0.0016721156,0.000022199376,0.021267246,0.46230856,0.019714462,0.021430042,0.0006421734,0.4635295],"study_design_scores_gemma":[0.0020585903,0.0008768091,0.00027358113,0.00020399263,0.00010798771,0.000023600835,0.00019004902,0.96286887,0.030999914,0.0019343044,0.00008144772,0.00038083174],"about_ca_topic_score_codex":0.000026847723,"about_ca_topic_score_gemma":0.00017528556,"teacher_disagreement_score":0.96411765,"about_ca_system_score_codex":0.00015502833,"about_ca_system_score_gemma":0.00024987932,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W2123576001","doi":"10.1109/tcomm.2014.2329834","title":"Diversity–Multiplexing Tradeoff of Asynchronous Decode-and-Forward Cooperative Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; IGNIS Innovation (Canada)","funders":"","keywords":"Asynchronous communication; Multiplexing; Computer science; Transmitter; Orthogonal frequency-division multiplexing; Bandwidth (computing); Electronic engineering; Computer network; Waveform; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.04129521618978292,"score_gpt":0.2712260852320172,"score_spread":0.22993086904223425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123576001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020615398,0.00042845248,0.99255246,0.001863101,0.00015172434,0.00022953548,0.000006737254,0.00015670678,0.0025497514],"genre_scores_gemma":[0.97088003,0.0033015807,0.025326643,0.00031905426,0.000013012752,0.00004194405,0.0000042741644,0.0000122509055,0.00010122607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984544,0.0005182643,0.0003608189,0.0002790419,0.00017090597,0.00021660325],"domain_scores_gemma":[0.99628365,0.0009788402,0.0001360703,0.0022685663,0.00021113903,0.00012174877],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00044615555,0.0001810962,0.00025851128,0.00017973605,0.0024661731,0.00006702748,0.002112247,0.0000860575,0.000024984427],"category_scores_gemma":[0.000022617895,0.00018820445,0.00010353566,0.0005930367,0.0002948934,0.0003928786,0.00019645586,0.00045815008,0.000011000985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039158203,0.0010488675,0.00043433142,0.000024351195,0.00028011788,6.6732116e-7,0.011093498,0.22389969,0.0011065918,0.20594113,0.00027754804,0.555854],"study_design_scores_gemma":[0.00058760983,0.00015611264,0.0008212673,0.00006812145,0.00002767992,0.000006682722,0.00008783886,0.9934404,0.0014493325,0.0003376944,0.0027663026,0.0002509504],"about_ca_topic_score_codex":0.000031305695,"about_ca_topic_score_gemma":0.00036920074,"teacher_disagreement_score":0.9688185,"about_ca_system_score_codex":0.00006119963,"about_ca_system_score_gemma":0.000044274584,"threshold_uncertainty_score":0.99883246},"labels":[],"label_agreement":null},{"id":"W2123616804","doi":"10.1109/tcomm.2009.06.070480","title":"Dynamic spot diffusing configuration for indoor optical wireless access","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"McMaster University","keywords":"Transmitter; Erasure; Computer science; Multipath propagation; Wireless; Electronic engineering; Channel (broadcasting); Optical power; Real-time computing; Telecommunications; Optics; Engineering; Physics","score_opus":0.03387930918076527,"score_gpt":0.30473217197946106,"score_spread":0.2708528627986958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123616804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024537247,0.0002514361,0.9621883,0.0053302287,0.00019812134,0.000702234,0.00005688343,0.0017734095,0.0049621463],"genre_scores_gemma":[0.9747844,0.0015682139,0.022965489,0.0001365257,0.000007839656,0.000350809,0.000043413726,0.000043000106,0.000100343175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883133,0.000046995672,0.0004492898,0.00020729534,0.00015785532,0.0003072061],"domain_scores_gemma":[0.9968307,0.0006024408,0.000057307258,0.0022817,0.00013971278,0.00008814169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000131435,0.00023637555,0.0002550688,0.00026996736,0.00044095778,0.00017379875,0.0017428625,0.00022032087,0.000021643344],"category_scores_gemma":[0.000022275204,0.00026196486,0.0001343343,0.0004786163,0.00022401252,0.00042446167,0.000008645205,0.00060516264,0.00004411115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060312723,0.0010058943,0.000004044761,0.00005305906,0.00013307991,6.791392e-7,0.00028187735,0.04251732,0.061419938,0.03342375,0.00031635087,0.8607837],"study_design_scores_gemma":[0.00097470137,0.0001758585,0.0004877347,0.00011502797,0.00007833245,0.000008487465,0.00021598194,0.8759696,0.113696635,0.0049326625,0.0027477634,0.0005972231],"about_ca_topic_score_codex":0.000004312396,"about_ca_topic_score_gemma":0.00006413768,"teacher_disagreement_score":0.9502471,"about_ca_system_score_codex":0.00019878485,"about_ca_system_score_gemma":0.000032011223,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W2123920269","doi":"10.1109/tcomm.2008.050628","title":"Performance of a CDMA system employing AMC and multicodes in the presence of channel estimation errors","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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","keywords":"Hidden Markov model; Channel (broadcasting); Computer science; Code division multiple access; Markov chain; Filter (signal processing); Algorithm; Markov model; Adaptive filter; Electronic engineering; Control theory (sociology); Speech recognition; Engineering; Telecommunications; Artificial intelligence","score_opus":0.07470288131571103,"score_gpt":0.3041034271432002,"score_spread":0.2294005458274892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123920269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39316317,0.00028343606,0.6044359,0.0011045462,0.000045247216,0.00047704956,0.00000706909,0.00006523571,0.00041829472],"genre_scores_gemma":[0.97263646,0.0013684744,0.025777955,0.000013009907,0.0000021974395,0.0001762801,0.0000015698173,0.000007474872,0.000016607542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984082,0.00052412704,0.00042583354,0.00015875537,0.00032414251,0.0001589621],"domain_scores_gemma":[0.9956881,0.0012733804,0.00016156034,0.0026777491,0.00016309082,0.000036143152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006185005,0.000101316,0.00017519412,0.00027240507,0.00048621744,0.000021973126,0.0026327583,0.000054234275,8.96513e-7],"category_scores_gemma":[0.000021611242,0.00008701713,0.000045996334,0.0009478029,0.00042727654,0.000433746,0.0000394272,0.0003597225,0.000003123296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077281715,0.0019254796,0.0021600917,0.0004918421,0.00009029706,0.000002558399,0.05189137,0.8618079,0.0025048957,0.012853927,0.000057715384,0.066136636],"study_design_scores_gemma":[0.00022778503,0.00006767806,0.0062264074,0.00020475169,0.0000055069486,0.000026548329,0.00047959943,0.9907477,0.0018999313,0.0000286511,0.000011184778,0.000074275435],"about_ca_topic_score_codex":0.00022226117,"about_ca_topic_score_gemma":0.00013720054,"teacher_disagreement_score":0.57947326,"about_ca_system_score_codex":0.000044198696,"about_ca_system_score_gemma":0.00007524691,"threshold_uncertainty_score":0.48923635},"labels":[],"label_agreement":null},{"id":"W2124026871","doi":"10.1109/tcomm.2008.050087","title":"Ldpc codes for non-coherent block fading channels with correlation: analysis and design","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"York University","funders":"","keywords":"Fading; Low-density parity-check code; Algorithm; Decoding methods; Block (permutation group theory); Computer science; Smoothing; Block code; Kalman filter; Electronic engineering; Mathematics; Engineering","score_opus":0.06159042362997631,"score_gpt":0.2916499387937162,"score_spread":0.2300595151637399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124026871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031007691,0.0000535052,0.99452966,0.00083611405,0.00010952919,0.0006624606,0.000009303238,0.00045571686,0.00024291457],"genre_scores_gemma":[0.6784688,0.00014601767,0.32073203,0.00005414297,0.0000066340313,0.00038907904,0.0000028519205,0.000012374381,0.00018805415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889004,0.00013182202,0.00026125502,0.00033580384,0.00017422924,0.00020686319],"domain_scores_gemma":[0.9968766,0.0009690995,0.00012836324,0.0017304578,0.0002080197,0.00008744443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027423442,0.00017743981,0.00024273442,0.0004575017,0.0012576347,0.00008390358,0.0010073158,0.0000767759,0.000003768572],"category_scores_gemma":[0.000009038781,0.00017134204,0.00011304583,0.0012974412,0.00016048536,0.0003367704,0.000011893666,0.00026769194,0.0000054108455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023622718,0.0026215105,0.0027082239,0.00007798583,0.0032487256,0.000012724055,0.032261454,0.886992,0.004584058,0.0046059606,0.0016500029,0.061001178],"study_design_scores_gemma":[0.0004006654,0.00035211537,0.0006498108,0.000053139316,0.00029615537,0.00006802721,0.000076250086,0.9828738,0.014251917,0.00038831477,0.0002694706,0.00032036105],"about_ca_topic_score_codex":0.00010563345,"about_ca_topic_score_gemma":0.0003115257,"teacher_disagreement_score":0.6753681,"about_ca_system_score_codex":0.0000734896,"about_ca_system_score_gemma":0.00007734315,"threshold_uncertainty_score":0.96728367},"labels":[],"label_agreement":null},{"id":"W2124252154","doi":"10.1109/tcomm.2003.814206","title":"Iterative semi-blind multiuser detection for coded mc-cdma uplink system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Telecommunications link; Code division multiple access; Multiuser detection; Single antenna interference cancellation; Interference (communication); Computer science; Iterative method; Decoding methods; Algorithm; Iterative and incremental development; Electronic engineering; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.06708335593216987,"score_gpt":0.32691003492508536,"score_spread":0.2598266789929155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124252154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005302668,0.00019164066,0.9927673,0.0014775165,0.00044638352,0.0013292897,0.00003209738,0.00053996214,0.0026855886],"genre_scores_gemma":[0.9048964,0.00026195365,0.09205712,0.00010973871,0.000019918729,0.0017971506,0.000012553784,0.00003972701,0.00080548594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972135,0.0009233123,0.0005821055,0.0004911246,0.0003422164,0.0004477781],"domain_scores_gemma":[0.9916789,0.0018725579,0.000191002,0.005415662,0.0006501678,0.00019171172],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00085906486,0.00027179447,0.00028414823,0.00039224152,0.001982778,0.00033652893,0.0032171828,0.00020260547,0.000016496317],"category_scores_gemma":[0.0000461008,0.00028626277,0.00021956944,0.0012438948,0.00019600117,0.0006827459,0.000028996668,0.00079550146,0.00013179408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048188271,0.005443693,0.000038781764,0.00028993303,0.0011336849,0.000005083025,0.010879529,0.18331528,0.028571941,0.46852764,0.002007191,0.29930538],"study_design_scores_gemma":[0.0017302891,0.00015026958,0.000022104821,0.000097733566,0.000031627183,0.000025085454,0.0003004588,0.9431842,0.039588142,0.00045123123,0.014044621,0.00037421143],"about_ca_topic_score_codex":0.000038533035,"about_ca_topic_score_gemma":0.00033015036,"teacher_disagreement_score":0.9043661,"about_ca_system_score_codex":0.0003810101,"about_ca_system_score_gemma":0.00018751329,"threshold_uncertainty_score":0.99995893},"labels":[],"label_agreement":null},{"id":"W2124369868","doi":"10.1109/tcomm.2004.836510","title":"Envelope-Aided Viterbi Receivers for GMSK Signals With Limiter-Discriminator Detection","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Minimum-shift keying; Discriminator; Envelope detector; Electronic engineering; Viterbi algorithm; Envelope (radar); Continuous phase modulation; Detector; Computer science; Frequency modulation; Fading; Demodulation; Algorithm; Phase-shift keying; Speech recognition; Engineering; Telecommunications; Bit error rate; Radio frequency; Channel (broadcasting); Amplifier; Radar; Decoding methods","score_opus":0.02949351342467163,"score_gpt":0.2630555231966033,"score_spread":0.23356200977193167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124369868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006440032,0.00018049894,0.9889309,0.00075784913,0.00011181215,0.00083939504,0.00008288995,0.0014917442,0.0011648686],"genre_scores_gemma":[0.87995905,0.0013700892,0.11697398,0.000090067486,0.000010415607,0.001397277,0.00002499165,0.00008557143,0.000088582245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989507,0.000062906765,0.0003549071,0.00021846508,0.00014945511,0.00026353647],"domain_scores_gemma":[0.99720955,0.00031817422,0.00007948362,0.0021187312,0.0001722034,0.00010184164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012546215,0.00025807598,0.00022235408,0.00029679027,0.00060569576,0.000053389696,0.00090379274,0.00013238071,0.000018319433],"category_scores_gemma":[0.000007954888,0.00027202402,0.00011840931,0.0004744433,0.00017930797,0.00043538,0.0000055121336,0.00046639517,0.000031350704],"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.0001919695,0.00078405533,0.000004003906,0.00014514352,0.0003492063,0.0000012545469,0.002486133,0.60080105,0.14766482,0.0021167665,0.0001306696,0.24532497],"study_design_scores_gemma":[0.0015135207,0.00040060113,0.000059198526,0.00026704898,0.00013148997,0.000021805736,0.0005188867,0.014850996,0.963909,0.0039161528,0.013713493,0.0006978496],"about_ca_topic_score_codex":0.00003271324,"about_ca_topic_score_gemma":0.0005102838,"teacher_disagreement_score":0.873519,"about_ca_system_score_codex":0.0003708769,"about_ca_system_score_gemma":0.000044026856,"threshold_uncertainty_score":0.9999732},"labels":[],"label_agreement":null},{"id":"W2124586345","doi":"10.1109/tcomm.2006.888522","title":"Error Rate of Quadrature Subbranch Hybrid Selection/ Maximal-Ratio Combining in Rayleigh Fading","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Maximal-ratio combining; Quadrature (astronomy); Rayleigh fading; Quadrature amplitude modulation; Diversity combining; Mathematics; Phase-shift keying; Keying; Pulse-amplitude modulation; Binary number; Amplitude and phase-shift keying; Algorithm; Fading; Electronic engineering; Bit error rate; Statistics; Telecommunications; Computer science; Pulse (music); Engineering; Detector; Arithmetic; Decoding methods","score_opus":0.024488407449556538,"score_gpt":0.28500574859999556,"score_spread":0.260517341150439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124586345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029011533,0.0003724396,0.9653873,0.00019082378,0.00015870045,0.00043010068,0.000040269006,0.00079888344,0.0036099819],"genre_scores_gemma":[0.97139007,0.0010871105,0.027124371,0.000050380688,0.000009401393,0.00015107243,0.000027650014,0.00006672054,0.00009321292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984625,0.00016586366,0.0007281675,0.00019079025,0.00014006652,0.00031263393],"domain_scores_gemma":[0.9973205,0.000702402,0.00011979858,0.0016407106,0.00013985731,0.000076751254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006047064,0.00023879211,0.00030867293,0.00062303036,0.00031550616,0.000026420355,0.00092559383,0.00015186345,0.00004812764],"category_scores_gemma":[0.000016019534,0.00029346897,0.00009922571,0.001073539,0.00016300345,0.00038136312,0.000008333457,0.0011343651,0.000017220922],"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.00016027183,0.0013816766,0.0005056869,0.00016770553,0.0002463666,0.000005471896,0.003723218,0.6241257,0.2930106,0.013234358,0.0004385347,0.06300038],"study_design_scores_gemma":[0.0009600828,0.000101903795,0.0011142638,0.00025547124,0.000042077387,0.000028214648,0.00050729717,0.13984127,0.8518045,0.0018902838,0.0028376032,0.0006170448],"about_ca_topic_score_codex":0.00006131578,"about_ca_topic_score_gemma":0.00083586795,"teacher_disagreement_score":0.9423785,"about_ca_system_score_codex":0.00023964068,"about_ca_system_score_gemma":0.00003835348,"threshold_uncertainty_score":0.9999517},"labels":[],"label_agreement":null},{"id":"W2124793012","doi":"10.1109/tcomm.2008.060652","title":"On the peak-to-mean envelope power ratio of phase-shifted binary codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","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":"BCH code; Phase-shift keying; Mathematics; Convolutional code; Upper and lower bounds; Binary code; Algorithm; Binary number; Block code; Code (set theory); Decoding methods; Discrete mathematics; Computer science; Arithmetic; Bit error rate; Mathematical analysis","score_opus":0.048479907221555665,"score_gpt":0.28304441038330197,"score_spread":0.23456450316174632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124793012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50399697,0.00028837414,0.4544887,0.006819448,0.0011492361,0.0011892603,0.0003768392,0.0010341988,0.030656956],"genre_scores_gemma":[0.9961489,0.00044807413,0.0024560804,0.00014902635,0.000012165507,0.00021034152,0.000011693483,0.000042904423,0.0005208375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990009,0.0001320758,0.00034756685,0.00013928252,0.00020487024,0.00017531241],"domain_scores_gemma":[0.99732906,0.0005183092,0.000046983332,0.0019221801,0.00009866786,0.00008483128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013663933,0.00017275425,0.00017323691,0.00025027487,0.0006024766,0.0000148935915,0.00079838315,0.00007202999,0.0003687378],"category_scores_gemma":[0.00001632908,0.00015421749,0.00010841496,0.00066120946,0.00024265016,0.000110343346,0.0000044371886,0.0004424321,0.0002708084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022473357,0.0047852728,0.000018742714,0.000053688833,0.0009475675,0.000006281579,0.023154313,0.7320706,0.16895142,0.020360677,0.042646147,0.006780511],"study_design_scores_gemma":[0.006384108,0.002378606,0.003984859,0.000687795,0.00042032494,0.00024059578,0.004532909,0.1701375,0.65794116,0.002539319,0.14782292,0.0029299224],"about_ca_topic_score_codex":0.000022116006,"about_ca_topic_score_gemma":0.000052144966,"teacher_disagreement_score":0.56193316,"about_ca_system_score_codex":0.000092522634,"about_ca_system_score_gemma":0.000047727728,"threshold_uncertainty_score":0.6288807},"labels":[],"label_agreement":null},{"id":"W2125332127","doi":"10.1109/tcomm.2004.838730","title":"Graph-Based Message-Passing Schedules for Decoding LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Tanner graph; Decoding methods; Factor graph; Belief propagation; Additive white Gaussian noise; Algorithm; Message passing; Mathematics; Probabilistic logic; Computer science; Bipartite graph; Graph; Channel (broadcasting); Discrete mathematics; Parallel computing; Statistics","score_opus":0.05850431123779526,"score_gpt":0.3256316168387922,"score_spread":0.26712730560099696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125332127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013508407,0.00012306891,0.9896041,0.0060535064,0.00030135314,0.00045178775,0.000020404137,0.0014574154,0.0006375367],"genre_scores_gemma":[0.5249537,0.000043440174,0.47447753,0.00020882796,0.0000065029694,0.0002715039,0.000003034533,0.000016822543,0.000018654597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99866813,0.0001257644,0.00034222688,0.00035721867,0.00020088753,0.00030577267],"domain_scores_gemma":[0.9960435,0.0008301006,0.00013439976,0.0026968,0.00020021269,0.00009500106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00043273458,0.00020350462,0.00019692197,0.00040611415,0.0014191316,0.00021541842,0.0023416902,0.00010756883,0.0000045210236],"category_scores_gemma":[0.000032625547,0.00022468664,0.00021864647,0.0007450791,0.00017929728,0.0004748477,0.000012985831,0.00044844742,0.000016124692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072405644,0.003599188,0.00009902444,0.00014691372,0.0002824084,0.0000048571615,0.0029070657,0.14057454,0.033638645,0.5557764,0.00035024714,0.26254827],"study_design_scores_gemma":[0.0021297494,0.0004695801,0.00013681676,0.00071191223,0.00013851849,0.000026504367,0.00023121567,0.3101338,0.54630214,0.13526931,0.0032933322,0.0011571135],"about_ca_topic_score_codex":0.00010756109,"about_ca_topic_score_gemma":0.0006270816,"teacher_disagreement_score":0.52360284,"about_ca_system_score_codex":0.00020130852,"about_ca_system_score_gemma":0.00023550849,"threshold_uncertainty_score":0.9998809},"labels":[],"label_agreement":null},{"id":"W2125378220","doi":"10.1109/tcomm.2008.050310","title":"M-ary orthogonal coded/balanced ultra-wideband transmitted-reference systems in multipath","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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","funders":"","keywords":"Computer science; Multipath propagation; Ultra-wideband; Interference (communication); Electronic engineering; Multipath interference; Wideband; Communications system; Single antenna interference cancellation; Algorithm; Decoding methods; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.033606144129861376,"score_gpt":0.24435633721090896,"score_spread":0.2107501930810476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125378220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25438038,0.0057379054,0.7089097,0.0015134262,0.0006218576,0.0017656375,0.00057050504,0.0036180837,0.022882536],"genre_scores_gemma":[0.98672724,0.00954213,0.0024829796,0.00008080253,0.000009620013,0.00084995467,0.00006317796,0.00006837372,0.00017571446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813455,0.00020399671,0.00070280675,0.00029726746,0.00022715896,0.00043423584],"domain_scores_gemma":[0.9958204,0.00066327356,0.0000670592,0.0031996684,0.0001053916,0.00014420382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017053136,0.0003333797,0.00039927565,0.0005330358,0.0005566186,0.000029966273,0.0017430834,0.00030885983,0.000058318707],"category_scores_gemma":[0.000015069882,0.00037322255,0.00012428203,0.0009959502,0.0004009679,0.0002696736,0.0000047510853,0.0013654681,0.00013968878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021393504,0.004282727,0.0027606029,0.0002518879,0.0006805292,0.000043886324,0.006543065,0.80982184,0.11821686,0.00824214,0.0018743798,0.047068126],"study_design_scores_gemma":[0.016164435,0.0009406765,0.026252221,0.0018592476,0.00055334234,0.0019350898,0.004148118,0.6855282,0.122300655,0.002741709,0.13019884,0.0073774466],"about_ca_topic_score_codex":0.00026630372,"about_ca_topic_score_gemma":0.0013999701,"teacher_disagreement_score":0.7323469,"about_ca_system_score_codex":0.00020322422,"about_ca_system_score_gemma":0.0001013076,"threshold_uncertainty_score":0.99987197},"labels":[],"label_agreement":null},{"id":"W2126107131","doi":"10.1109/26.871383","title":"Autocovariance preserving estimator (APE) interpretation of the MLSD metric for Rayleigh fading channels","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Autocovariance; Estimator; Mathematics; Rayleigh fading; Algorithm; Fading; Statistics; Metric (unit); Mathematical analysis; Decoding methods; Engineering","score_opus":0.024934081755209468,"score_gpt":0.2856395354433955,"score_spread":0.26070545368818604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126107131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001853736,0.00030714722,0.9925672,0.00062368705,0.00017398997,0.001004804,0.000069068294,0.0005833886,0.0028170028],"genre_scores_gemma":[0.9200459,0.0008114665,0.07750441,0.00003613398,0.000008898226,0.0011824702,0.000008042999,0.000049148635,0.00035353203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989819,0.00011029409,0.00044359147,0.00014287593,0.00014048707,0.00018085164],"domain_scores_gemma":[0.99652046,0.0007449405,0.000094627045,0.0024787544,0.00011980505,0.00004140567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018533836,0.00016695389,0.00020198098,0.00019904613,0.00048547983,0.00003105378,0.0016785873,0.000094014584,0.000094813404],"category_scores_gemma":[0.000026569467,0.00016016855,0.00015984192,0.00081449153,0.00012806397,0.00032660493,0.000009722864,0.00035815773,0.0000117037225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001684107,0.00011346151,0.0000028824165,0.000059630827,0.00006471496,2.1767184e-8,0.0006330457,0.91629976,0.0044692694,0.001095966,0.00018586847,0.07705855],"study_design_scores_gemma":[0.00024458335,0.000035118333,0.000048481616,0.0001919945,0.00004496415,0.0000022684303,0.00004753628,0.92331666,0.06929573,0.001570247,0.0050257295,0.0001766829],"about_ca_topic_score_codex":0.000021734024,"about_ca_topic_score_gemma":0.000033743505,"teacher_disagreement_score":0.91819215,"about_ca_system_score_codex":0.00012556081,"about_ca_system_score_gemma":0.00002700062,"threshold_uncertainty_score":0.6531484},"labels":[],"label_agreement":null},{"id":"W2126110344","doi":"10.1109/tcomm.2005.861648","title":"Effects of channel-estimation errors on receiver selection-combining schemes for Alamouti MIMO systems with BPSK","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Phase-shift keying; Rayleigh fading; Selection (genetic algorithm); Maximal-ratio combining; Bit error rate; Algorithm; Channel (broadcasting); Diversity combining; Signal-to-noise ratio (imaging); Fading; Mathematics; Diversity gain; MIMO; Statistics; Computer science; Telecommunications; Electronic engineering; Engineering","score_opus":0.012070343490993505,"score_gpt":0.24551581785002966,"score_spread":0.23344547435903615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126110344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007101799,0.000324979,0.9890957,0.00014557371,0.00013908885,0.0011400757,0.000039121773,0.0009590515,0.0010546129],"genre_scores_gemma":[0.95334536,0.00031006697,0.044394266,0.000013054972,0.000012148325,0.0016426435,0.00004147405,0.00007704393,0.00016393082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891937,0.00009639679,0.00041789652,0.00018149446,0.00017326139,0.00021159995],"domain_scores_gemma":[0.9975496,0.000860063,0.00014789753,0.0012001961,0.00019850675,0.000043757806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012298011,0.00023630308,0.00027560597,0.00034086625,0.00041878733,0.000029006316,0.00056264986,0.0001277417,0.0000034857828],"category_scores_gemma":[0.000010212457,0.00024831266,0.000091873866,0.00052153604,0.00013209072,0.0002463845,0.0000033808942,0.00036762745,0.000008009707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004653207,0.0004155889,0.0000075214316,0.0002400921,0.00010729726,1.1868702e-7,0.00019390215,0.98021334,0.008069058,0.0048671546,0.00026579743,0.0055736084],"study_design_scores_gemma":[0.000910623,0.0003141267,0.00013797569,0.00058527075,0.00011025074,0.0000055461855,0.00011296537,0.66247606,0.33234742,0.0007816931,0.0018296514,0.0003884133],"about_ca_topic_score_codex":0.000089974914,"about_ca_topic_score_gemma":0.00010044938,"teacher_disagreement_score":0.9462436,"about_ca_system_score_codex":0.00018260564,"about_ca_system_score_gemma":0.000028080829,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W2126195483","doi":"10.1109/tcomm.2003.813183","title":"On the SNR penalty of MPSK with hybrid selection/maximal ratio combining over i.i.d. rayleigh fading channels","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Maximal-ratio combining; Upper and lower bounds; Signal-to-noise ratio (imaging); Mathematics; Rayleigh fading; Modulation (music); Diversity combining; Phase-shift keying; Selection (genetic algorithm); Fading; Algorithm; Telecommunications; Statistics; Control theory (sociology); Computer science; Bit error rate; Physics; Mathematical analysis; Acoustics; Decoding methods","score_opus":0.02369243854555452,"score_gpt":0.2532405879033361,"score_spread":0.22954814935778156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126195483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02546766,0.00013303818,0.9640996,0.0003587296,0.00012195414,0.0005676492,0.000034464265,0.0006580447,0.008558895],"genre_scores_gemma":[0.9868748,0.0006629299,0.011673922,0.0000966852,0.0000066649923,0.0004541422,0.000009487952,0.00007173447,0.00014958538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863505,0.00027058582,0.00042001862,0.00018391646,0.00024395584,0.00024649716],"domain_scores_gemma":[0.9965125,0.001042536,0.00012964256,0.002094824,0.00015542466,0.000065083346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028874076,0.0002528925,0.0002492855,0.00024128407,0.0007770864,0.00004615283,0.0009011489,0.00007153039,0.00016997677],"category_scores_gemma":[0.000023278506,0.00021678951,0.00010480129,0.00065098214,0.00023957233,0.00026024698,0.0000058368564,0.0008336591,0.000021874672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055853798,0.00065645634,0.00003279905,0.000040888925,0.0003046922,7.1726663e-7,0.0011570142,0.88337415,0.014501311,0.09512891,0.0007179942,0.0040292],"study_design_scores_gemma":[0.001103299,0.0004082104,0.00008867426,0.00034537996,0.00011634123,0.00005672572,0.00040911985,0.19422522,0.7905523,0.006218614,0.0057194456,0.0007566531],"about_ca_topic_score_codex":0.000018289993,"about_ca_topic_score_gemma":0.00005307481,"teacher_disagreement_score":0.9614072,"about_ca_system_score_codex":0.00015857974,"about_ca_system_score_gemma":0.000051570147,"threshold_uncertainty_score":0.88404197},"labels":[],"label_agreement":null},{"id":"W2126252670","doi":"10.1110/tcomm.2010.062510.080615","title":"SER Analysis and PDF Derivation for Multi-Hop Amplify-and-Forward Relay Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Moment-generating function; Relay; Hop (telecommunications); Random variable; Cumulative distribution function; Probability density function; Erlang (programming language); Expression (computer science); Mathematics; Topology (electrical circuits); Probability of error; Bit error rate; Computer science; Algorithm; Telecommunications; Statistics; Combinatorics; Physics; Decoding methods; Theoretical computer science; Quantum mechanics","score_opus":0.06593631995843402,"score_gpt":0.3211921444500576,"score_spread":0.2552558244916236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126252670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034454563,0.00028109323,0.99247146,0.0026556249,0.00022984645,0.00044866948,0.000018881823,0.00015140623,0.0002975728],"genre_scores_gemma":[0.864588,0.0020979831,0.13202117,0.00018109585,0.000012135673,0.00035164235,0.000017356953,0.000011415661,0.0007191645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988896,0.00018680179,0.0003311243,0.0003017719,0.00011540226,0.00017529727],"domain_scores_gemma":[0.996433,0.000804383,0.00011466002,0.0022772301,0.00025190553,0.00011882324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045750084,0.00015539184,0.00021408134,0.00034060905,0.001228697,0.00028476113,0.0010582848,0.00011318271,0.000022122462],"category_scores_gemma":[0.000029126519,0.00015756938,0.00009450444,0.000789473,0.00015578543,0.00040512465,0.000032584638,0.00047997732,0.000026620039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008515131,0.0023605113,0.0016128467,0.000137436,0.002913998,9.96563e-7,0.011034591,0.038851116,0.04581479,0.36615545,0.0011890444,0.5298441],"study_design_scores_gemma":[0.00050017383,0.000043252727,0.0019405044,0.000016737114,0.00014462508,0.000007139646,0.00009168668,0.9740248,0.00073260133,0.00010842378,0.022150151,0.00023990546],"about_ca_topic_score_codex":0.000045070577,"about_ca_topic_score_gemma":0.0015457117,"teacher_disagreement_score":0.9351737,"about_ca_system_score_codex":0.000028867084,"about_ca_system_score_gemma":0.000039756254,"threshold_uncertainty_score":0.9450268},"labels":[],"label_agreement":null},{"id":"W2126372870","doi":"10.1109/tcomm.2011.022811.090576","title":"On Adaptive Lattice Reduction over Correlated Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Lattice reduction; Fading; Rayleigh fading; Lattice (music); Reduction (mathematics); MIMO; Algorithm; Computer science; Mathematics; Electronic engineering; Computational complexity theory; Channel (broadcasting); Topology (electrical circuits); Telecommunications; Decoding methods; Physics; Engineering; Combinatorics; Acoustics","score_opus":0.058594518977533726,"score_gpt":0.27226044215273904,"score_spread":0.2136659231752053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126372870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006175351,0.00017739771,0.9647483,0.00011008173,0.00056905777,0.00046308103,0.000036647783,0.002247119,0.02547294],"genre_scores_gemma":[0.9772991,0.0013981808,0.020529581,0.00004973061,0.000012549208,0.00035839825,0.000012783074,0.00007726019,0.00026239397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894875,0.00012855834,0.00034651847,0.00019638696,0.00014898021,0.00023080187],"domain_scores_gemma":[0.99709904,0.00025121216,0.00007635566,0.0023862799,0.000098394026,0.000088734414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012282448,0.00023271004,0.00018442137,0.00032969262,0.00047100105,0.000020599491,0.0008797197,0.00016112199,0.00018941768],"category_scores_gemma":[0.000006567601,0.00027170556,0.00010296917,0.0005386532,0.00016313026,0.00035783375,0.000007215946,0.00086541235,0.00019837072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035451175,0.0029136492,0.000008296378,0.00006425808,0.00085608294,0.0000045578904,0.017540345,0.70392674,0.020770332,0.09720336,0.0028626749,0.15349516],"study_design_scores_gemma":[0.0016232713,0.00076365215,0.00036701537,0.0007250246,0.00027142485,0.00006151458,0.0012215127,0.6267003,0.3255856,0.035011247,0.0057347966,0.0019346619],"about_ca_topic_score_codex":0.000052546085,"about_ca_topic_score_gemma":0.00002706621,"teacher_disagreement_score":0.97112375,"about_ca_system_score_codex":0.00023351402,"about_ca_system_score_gemma":0.000016510416,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W2127204517","doi":"10.1109/tcomm.2004.838738","title":"Threshold Values and Convergence Properties of Majority-Based Algorithms for Decoding Regular Low-Density Parity-Check Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Binary symmetric channel; Mathematics; Convergence (economics); Binary number; Computer science; Discrete mathematics; Arithmetic","score_opus":0.06376592848633332,"score_gpt":0.2991063240944776,"score_spread":0.2353403956081443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127204517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048024174,0.0002591985,0.94855714,0.0019050759,0.00019467188,0.0005326007,0.000018466424,0.0004507992,0.000057856912],"genre_scores_gemma":[0.69325054,0.0001735772,0.30630326,0.00008922748,0.0000055346,0.00013852108,0.0000016674002,0.000012336973,0.000025318506],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987625,0.00010370822,0.00036859667,0.00033658434,0.00021061965,0.00021797302],"domain_scores_gemma":[0.997194,0.00026902944,0.0001476497,0.0019904906,0.0003217243,0.00007713141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052528555,0.00018069409,0.00025406823,0.00018778596,0.0007370564,0.00007707158,0.001360386,0.00010542247,0.0000013577899],"category_scores_gemma":[0.000032042513,0.00018573315,0.00012172596,0.0003723243,0.00037462366,0.0003625256,0.000025677295,0.00030951868,0.0000024570472],"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.0005208919,0.011204428,0.0019543443,0.0024715692,0.00096903514,0.000011732307,0.029531281,0.05677732,0.5990742,0.1825206,0.0006024263,0.11436221],"study_design_scores_gemma":[0.0005323627,0.00018369067,0.000115269235,0.0003682415,0.000048491496,0.0000102386475,0.00012871386,0.16306229,0.81710225,0.018121457,0.00004729871,0.0002797019],"about_ca_topic_score_codex":0.00025555407,"about_ca_topic_score_gemma":0.00031276973,"teacher_disagreement_score":0.64522636,"about_ca_system_score_codex":0.000097503114,"about_ca_system_score_gemma":0.00016338799,"threshold_uncertainty_score":0.75739783},"labels":[],"label_agreement":null},{"id":"W2127384100","doi":"10.1109/tcomm.2008.060609","title":"Power reduction techniques for multiple-subcarrier modulated diffuse wireless optical channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"","keywords":"Optical wireless; Optical power; Electronic engineering; Computer science; Subcarrier; Optical performance monitoring; Bandwidth (computing); Optical wireless communications; Optical attenuator; Optical modulation amplitude; Electrical engineering; Wireless; Telecommunications; Multi-mode optical fiber; Materials science; Orthogonal frequency-division multiplexing; Engineering; Optoelectronics; Optical fiber; Wavelength-division multiplexing; Physics; Optical amplifier; Optics; Channel (broadcasting); Laser","score_opus":0.03395860612867826,"score_gpt":0.25954867307515955,"score_spread":0.2255900669464813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127384100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11127452,0.00029659984,0.87846416,0.0016959297,0.00045813786,0.0011362657,0.00010092498,0.004761136,0.0018123229],"genre_scores_gemma":[0.95647943,0.0028590003,0.038839485,0.000029274652,0.000018428003,0.0014753547,0.000031576925,0.00009437757,0.00017307728],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986364,0.00006979544,0.0004912205,0.0002617141,0.00018520028,0.0003556633],"domain_scores_gemma":[0.99612933,0.00052986294,0.00005634276,0.0029495698,0.00021832845,0.000116547366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014043979,0.0002889035,0.00029880388,0.00032696762,0.0007931878,0.000042274834,0.0012593218,0.00036914178,0.000024677025],"category_scores_gemma":[0.00003679361,0.0003176579,0.00019045129,0.00054958725,0.00056754955,0.0002855824,0.000015126936,0.00079264113,0.000044397795],"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.00047538878,0.0093292855,0.00006276234,0.0002596759,0.0015846946,0.000008349002,0.0066593033,0.12229812,0.47736382,0.025727263,0.006149603,0.3500817],"study_design_scores_gemma":[0.0011522506,0.0002535971,0.00010332937,0.00009758797,0.000055193086,0.00007179396,0.0004543813,0.35060874,0.6353011,0.0009587491,0.010135053,0.0008081849],"about_ca_topic_score_codex":0.000009113901,"about_ca_topic_score_gemma":0.000011095262,"teacher_disagreement_score":0.8452049,"about_ca_system_score_codex":0.00019543742,"about_ca_system_score_gemma":0.000031162737,"threshold_uncertainty_score":0.9999275},"labels":[],"label_agreement":null},{"id":"W2127421917","doi":"10.1109/tcomm.2004.836563","title":"On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":279,"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":"Low-density parity-check code; Algorithm; Decoding methods; Quantization (signal processing); Mathematics; Parity-check matrix; Belief propagation; Computer science","score_opus":0.054948146900187844,"score_gpt":0.34937265992529287,"score_spread":0.29442451302510503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127421917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014110927,0.00008734424,0.9809914,0.0033015863,0.00012290505,0.0006898488,0.00010239636,0.00034088676,0.00025267288],"genre_scores_gemma":[0.6871147,0.00021311779,0.3122021,0.00011620538,0.000010014833,0.00025761925,0.000008887519,0.000013162498,0.00006417926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.00014382975,0.00044250392,0.000335751,0.00019179237,0.00021816451],"domain_scores_gemma":[0.9968697,0.00095956214,0.00020548208,0.0015798179,0.00030287745,0.00008255979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294792,0.00017222337,0.00020394436,0.00028711642,0.0007605004,0.00007183242,0.0010585029,0.000087974826,0.000009110287],"category_scores_gemma":[0.000023274873,0.00019787559,0.000107655615,0.0003879084,0.00008604135,0.00043447287,0.000020072861,0.00027941228,0.000010940862],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002604076,0.001631306,0.00003759397,0.000073118594,0.00015043606,3.1496515e-7,0.004983448,0.002422611,0.017736131,0.096735284,0.0009097271,0.87529397],"study_design_scores_gemma":[0.00072996813,0.00027722924,0.00053254183,0.00011225982,0.00008149875,0.000012535718,0.0003631552,0.5989918,0.39221647,0.0053673955,0.00091581343,0.00039933086],"about_ca_topic_score_codex":0.00011562179,"about_ca_topic_score_gemma":0.0009891078,"teacher_disagreement_score":0.8748947,"about_ca_system_score_codex":0.00012677038,"about_ca_system_score_gemma":0.000084466854,"threshold_uncertainty_score":0.80691326},"labels":[],"label_agreement":null},{"id":"W2127605483","doi":"10.1109/26.930624","title":"Bandwidth-constrained signature waveforms for maximizing the network capacity of synchronous CDMA systems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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 Manitoba","funders":"","keywords":"Code division multiple access; Waveform; Bandwidth (computing); Signature (topology); Spread spectrum; Electronic engineering; Computer science; Interference (communication); Synchronous CDMA; Mathematics; Telecommunications; Engineering; Multiuser detection","score_opus":0.052505117688830656,"score_gpt":0.2836236825426637,"score_spread":0.23111856485383303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127605483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010755609,0.0009667359,0.9873042,0.006836399,0.00040903795,0.0011894838,0.000039814615,0.00020443201,0.0019743221],"genre_scores_gemma":[0.957887,0.0014609597,0.039461426,0.00012843647,0.00005684066,0.00070325925,0.000011092961,0.000025993457,0.00026502504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769396,0.0005241834,0.0006092757,0.00030492622,0.00037877634,0.0004889048],"domain_scores_gemma":[0.9911548,0.0024547211,0.00025821052,0.0055635627,0.00044979854,0.0001189032],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011155711,0.00022300056,0.0003134771,0.0001316445,0.0016251613,0.00019376884,0.005578707,0.00017648134,0.00001332987],"category_scores_gemma":[0.000026109788,0.0001733934,0.00023338568,0.0012346319,0.0005030672,0.00040501298,0.00005227943,0.0008749057,0.00001425992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091640235,0.0010240233,0.000046822403,0.00008806226,0.00042796106,0.0000014209327,0.0022006168,0.7194713,0.0013947808,0.14975601,0.0019043604,0.12359301],"study_design_scores_gemma":[0.00068370375,0.00015129303,0.00014025494,0.0001650914,0.00003961694,0.000054744145,0.00023911156,0.9780016,0.0006524915,0.0020585542,0.017525395,0.00028811925],"about_ca_topic_score_codex":0.00015691391,"about_ca_topic_score_gemma":0.0003028679,"teacher_disagreement_score":0.9568114,"about_ca_system_score_codex":0.00014911083,"about_ca_system_score_gemma":0.00018047333,"threshold_uncertainty_score":0.9998016},"labels":[],"label_agreement":null},{"id":"W2127644918","doi":"10.1109/tcomm.2009.07.070359","title":"A unified approach to computing error probabilities of diversity combining schemes over correlated fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Fading; Maximal-ratio combining; Diversity combining; Algorithm; Bit error rate; Channel state information; Diversity gain; Channel (broadcasting); Diversity scheme; Mathematics; Computer science; Superposition principle; Electronic engineering; Statistics; Telecommunications; Engineering; Decoding methods","score_opus":0.054951487819529826,"score_gpt":0.28563780697568664,"score_spread":0.2306863191561568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127644918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05448034,0.00012410176,0.9375101,0.00020336705,0.00010121235,0.0005799849,0.000026239859,0.0011849009,0.0057897684],"genre_scores_gemma":[0.9247131,0.0001434755,0.07492549,0.0000637492,0.000004825013,0.00004472999,0.000015504156,0.000027569233,0.00006160154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988604,0.00010746289,0.00043064906,0.00018405779,0.00018119944,0.00023620449],"domain_scores_gemma":[0.99758905,0.0002792546,0.00009094544,0.0018090128,0.0001402616,0.0000914957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019749244,0.00020903458,0.00029305904,0.00033107997,0.00067826407,0.000025592035,0.0012046016,0.00011679522,0.000009148461],"category_scores_gemma":[0.000013380083,0.000252002,0.000106652704,0.0007340685,0.00013853871,0.00023922033,0.000036453617,0.0005582678,0.0000067833953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025243078,0.00067897356,0.000036102985,0.000059660215,0.000102248196,1.5694863e-7,0.008242319,0.9602429,0.0061576604,0.009027482,0.00012251598,0.015304714],"study_design_scores_gemma":[0.00090561656,0.00023841424,0.0007026553,0.00048065832,0.00009099507,0.0000075992834,0.001843596,0.9380599,0.052706487,0.0031812694,0.0009752109,0.0008075855],"about_ca_topic_score_codex":0.000033788743,"about_ca_topic_score_gemma":0.000009941828,"teacher_disagreement_score":0.8702327,"about_ca_system_score_codex":0.00016587255,"about_ca_system_score_gemma":0.000018930346,"threshold_uncertainty_score":0.9999932},"labels":[],"label_agreement":null},{"id":"W2127774185","doi":"10.1109/tcomm.2011.060911.100581","title":"Direct Sequence and Time-Hopping Sequence Designs for Narrowband Interference Mitigation in Impulse Radio UWB Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Narrowband; Bandwidth (computing); Cognitive radio; Computer science; Electronic engineering; Frequency-hopping spread spectrum; Direct-sequence spread spectrum; Time-hopping; Spread spectrum; Wireless; Spectral efficiency; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.08390413285939638,"score_gpt":0.271634088328772,"score_spread":0.18772995546937563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127774185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055315703,0.0021063732,0.9319279,0.00046619034,0.00032218383,0.0016935766,0.00022280806,0.0012682689,0.006676985],"genre_scores_gemma":[0.9814199,0.0017146483,0.015519352,0.000020000278,0.000005543516,0.001145643,0.000021137015,0.000041651267,0.0001120786],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988108,0.00015564155,0.00044768653,0.00023816881,0.000077031815,0.00027061874],"domain_scores_gemma":[0.9974214,0.0005670804,0.000068713634,0.0017752439,0.000094393145,0.00007317398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029015666,0.00021406225,0.0002568824,0.00037736233,0.00033893329,0.000048023216,0.000979867,0.00017216946,0.000015803791],"category_scores_gemma":[0.00002351208,0.0002475085,0.000060538838,0.00048944424,0.00029844427,0.00033173664,0.000008400201,0.0004408914,0.000022438066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020154522,0.0014286623,0.00073093805,0.00061650557,0.0007057583,0.000007661531,0.021784244,0.08225652,0.76645446,0.016308438,0.0005523229,0.10895294],"study_design_scores_gemma":[0.0015900714,0.00043267803,0.00041258897,0.0010473155,0.00019319914,0.00015025836,0.0015462354,0.85471433,0.13331284,0.0033502972,0.0019210309,0.0013291813],"about_ca_topic_score_codex":0.00021498151,"about_ca_topic_score_gemma":0.00040560786,"teacher_disagreement_score":0.92610425,"about_ca_system_score_codex":0.00021107329,"about_ca_system_score_gemma":0.000045945737,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W2128626239","doi":"10.1109/26.974248","title":"Hexacode-based quantization of the Gaussian source at 1/2 bit per sample","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"Binary Golay code; Decoding methods; Binary number; Quantization (signal processing); Algorithm; Gaussian; Bit (key); Algebraic number; Computer science; Mathematics; Binary code; Theoretical computer science; Discrete mathematics; Arithmetic; Physics","score_opus":0.03932801141443842,"score_gpt":0.2963049526388216,"score_spread":0.2569769412243832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128626239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080198725,0.000062699124,0.9933819,0.004356315,0.00012337705,0.00028534592,0.000062582,0.00034392494,0.0005818764],"genre_scores_gemma":[0.82370996,0.0001769424,0.17523135,0.0003470733,0.000005057636,0.00009104784,0.000011774585,0.000015914016,0.0004108587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987091,0.00025727644,0.00033115767,0.00024824674,0.00027959936,0.00017460872],"domain_scores_gemma":[0.99441797,0.0005927511,0.00018327041,0.0046188985,0.00012577641,0.00006134657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001569131,0.00014016552,0.00014010546,0.0001628644,0.0008446791,0.000041332067,0.0029856465,0.000071182636,0.00008199969],"category_scores_gemma":[0.00002087261,0.000113546696,0.00012593217,0.00079881185,0.00021674136,0.00034427363,0.000052343872,0.00026898348,0.00003005785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017712684,0.005819917,0.0025425316,0.00009434523,0.00019339728,0.0000018117589,0.0034327714,0.34983167,0.12167515,0.0776019,0.0061177076,0.43251166],"study_design_scores_gemma":[0.0007894066,0.00014527397,0.0014872381,0.00021338835,0.000051077164,0.000023191538,0.00006957746,0.5408109,0.26794928,0.0048026354,0.18312001,0.00053801766],"about_ca_topic_score_codex":0.00014256245,"about_ca_topic_score_gemma":0.00032937044,"teacher_disagreement_score":0.822908,"about_ca_system_score_codex":0.00009799614,"about_ca_system_score_gemma":0.00007288393,"threshold_uncertainty_score":0.6496674},"labels":[],"label_agreement":null},{"id":"W2128874299","doi":"10.1109/tcomm.2010.080310.090292","title":"Performance Analysis of Bidirectional Communication Protocols Based on Decode-and-Forward Relaying","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Relay; Outage probability; Linear network coding; Multiplexing; Signal-to-noise ratio (imaging); Topology (electrical circuits); Computer network; Coding (social sciences); Protocol (science); Diversity gain; Asymptotic analysis; Power (physics); Channel (broadcasting); Fading; Mathematics; Telecommunications; Network packet; Statistics","score_opus":0.048973838145291555,"score_gpt":0.3224145168985834,"score_spread":0.27344067875329187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128874299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02636692,0.00006592749,0.95687777,0.004476597,0.0001523265,0.0024875463,0.000029554547,0.00032260988,0.009220754],"genre_scores_gemma":[0.94168216,0.00064512045,0.05521837,0.00026613547,0.000005008343,0.0020402796,0.000015649259,0.000012951499,0.0001142955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984098,0.00036384157,0.00047935493,0.0002893535,0.00028378336,0.00017383638],"domain_scores_gemma":[0.9936223,0.0010693631,0.0002222419,0.004668114,0.00031861704,0.000099387624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007334649,0.0001794818,0.0002766183,0.0007935256,0.0011375401,0.00009961918,0.0022806725,0.0001051212,0.00007170834],"category_scores_gemma":[0.000031588093,0.00018323347,0.0001731392,0.002179881,0.0002698513,0.0003736309,0.000040826082,0.00081712566,0.000016127133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016469978,0.003971808,0.006275676,0.00006494125,0.0012752329,4.7428935e-7,0.003039333,0.21049465,0.016824579,0.082952954,0.00033418468,0.67460144],"study_design_scores_gemma":[0.00035371954,0.00010561436,0.008653798,0.000074121184,0.00011311461,0.0000018659937,0.00001674034,0.9827198,0.0039211493,0.00007511664,0.0037654943,0.00019948203],"about_ca_topic_score_codex":0.000017855806,"about_ca_topic_score_gemma":0.0004787421,"teacher_disagreement_score":0.9153153,"about_ca_system_score_codex":0.000052789044,"about_ca_system_score_gemma":0.00011196996,"threshold_uncertainty_score":0.87491536},"labels":[],"label_agreement":null},{"id":"W2129369422","doi":"10.1109/tcomm.2009.10.080025","title":"Design of scalable decoders for sensor networks via Bayesian network learning","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Bayesian Modeling and Causal Inference","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 Manitoba","funders":"","keywords":"Factor graph; Scalability; Minimum mean square error; Decoding methods; Computer science; Gaussian; Computational complexity theory; Wireless sensor network; Algorithm; Quantization (signal processing); Graph; Bayesian network; Mathematics; Theoretical computer science; Artificial intelligence; Estimator; Statistics","score_opus":0.04594662418572424,"score_gpt":0.28384216330827117,"score_spread":0.23789553912254693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129369422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000196645,0.0002083342,0.997072,0.0016287144,0.0001491761,0.00032810823,0.000002022518,0.00022527234,0.00036670276],"genre_scores_gemma":[0.59328365,0.00022306087,0.4061163,0.00018741148,0.000014034598,0.000044211618,0.0000022134764,0.000008637482,0.000120471945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986723,0.0002533724,0.00035908553,0.0002579908,0.00013096651,0.00032629768],"domain_scores_gemma":[0.9974483,0.00068906264,0.00013165749,0.0014542748,0.00017740115,0.00009924988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046228664,0.0001558394,0.00020887466,0.0001028762,0.0007393773,0.00007473235,0.0013125474,0.00011465707,0.000007394604],"category_scores_gemma":[0.000008002024,0.00016824271,0.00011718182,0.0005468029,0.00008147622,0.0002385942,0.0000055268497,0.0004081342,0.000007780187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014622063,0.0001374705,0.0000020966977,0.0000026829803,0.000020909485,1.2919146e-7,0.00014997133,0.92001665,0.00031509734,0.0021675108,0.0001624003,0.07701043],"study_design_scores_gemma":[0.0002258853,0.00026067396,0.000013301289,0.00004776562,0.000026223692,0.0000050286744,0.000016890908,0.99262697,0.00080687064,0.005567774,0.00023540114,0.00016720775],"about_ca_topic_score_codex":0.000017681741,"about_ca_topic_score_gemma":0.0000133712465,"teacher_disagreement_score":0.593264,"about_ca_system_score_codex":0.000037908616,"about_ca_system_score_gemma":0.00007458527,"threshold_uncertainty_score":0.68607384},"labels":[],"label_agreement":null},{"id":"W2130092083","doi":"10.1109/tcomm.2009.07.070619","title":"Identical-capacity channel decomposition for design of universal LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Code (set theory); Channel (broadcasting); Conjecture; Computer science; Regular polygon; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Telecommunications; Programming language","score_opus":0.07968733975742756,"score_gpt":0.3290297916985942,"score_spread":0.24934245194116664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130092083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057704403,0.000026937176,0.9956201,0.0021988389,0.00014955443,0.0005005309,0.000020050778,0.0004937594,0.0004132314],"genre_scores_gemma":[0.61534244,0.00006365977,0.38441488,0.0000909062,0.0000045099514,0.000045854587,0.0000020156072,0.0000060407024,0.000029686236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989133,0.00020498224,0.00031753792,0.00022349875,0.00015742419,0.000183254],"domain_scores_gemma":[0.99711543,0.0007435194,0.00013702255,0.0016960013,0.00024444706,0.000063583226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039986437,0.00013229574,0.00017867972,0.0002503925,0.00044067268,0.00004924133,0.0016227901,0.00008635843,0.000003213646],"category_scores_gemma":[0.00001815505,0.00015036136,0.00013271673,0.0004518507,0.00011600837,0.0004130793,0.0000072328107,0.00023312581,0.0000068972117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003869137,0.009805002,0.000013590228,0.0001146118,0.00041769518,0.0000033272604,0.011070419,0.08548989,0.27758712,0.40244594,0.0031399645,0.20952553],"study_design_scores_gemma":[0.0005716709,0.00093388266,0.00014670865,0.00013856935,0.00007993504,0.000020248857,0.00007622254,0.7090339,0.22603092,0.062390573,0.0002170271,0.0003603283],"about_ca_topic_score_codex":0.000034194614,"about_ca_topic_score_gemma":0.000034746936,"teacher_disagreement_score":0.62354404,"about_ca_system_score_codex":0.00010378733,"about_ca_system_score_gemma":0.000057343223,"threshold_uncertainty_score":0.61315584},"labels":[],"label_agreement":null},{"id":"W2130098973","doi":"10.1109/26.905889","title":"Simple and accurate methods for outage analysis in cellular mobile radio systems-a unified approach","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Rician fading; Nakagami distribution; Fading; Computer science; Interference (communication); Algorithm; Outage probability; Fading distribution; Random variable; Mathematics; Electronic engineering; Statistics; Channel (broadcasting); Telecommunications; Rayleigh fading; Engineering","score_opus":0.051052115170956175,"score_gpt":0.3358924471817224,"score_spread":0.2848403320107662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130098973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009262825,0.003132564,0.9844782,0.00007854273,0.0000867315,0.0007301075,0.00009669695,0.00022629433,0.0019080353],"genre_scores_gemma":[0.93805355,0.004316934,0.05593772,0.000011960316,0.0000079133,0.0012781705,0.00010292647,0.0000364607,0.0002543461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877435,0.00028434626,0.00044362585,0.00019895674,0.00006506158,0.00023367487],"domain_scores_gemma":[0.99680716,0.00067646935,0.000052844724,0.0023056911,0.00006742879,0.0000904363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005533064,0.00018777652,0.00033969304,0.00058724696,0.00032832642,0.000078365025,0.0007296004,0.00011023541,0.000012933537],"category_scores_gemma":[0.000007863101,0.00020606277,0.0001490241,0.001362694,0.000084146544,0.00017565997,0.000008604183,0.00034944984,0.000004575147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020566313,0.00046933844,0.00008972584,0.000062231244,0.0005604233,4.0004895e-7,0.00080187403,0.9794745,0.0029041814,0.0009804171,0.00007554641,0.014560794],"study_design_scores_gemma":[0.0004418899,0.000027030545,0.0001826862,0.000011001788,0.0003173681,0.0000031094028,0.00049492717,0.9687297,0.0005934214,0.00011901147,0.028847871,0.00023199391],"about_ca_topic_score_codex":0.00014720962,"about_ca_topic_score_gemma":0.00025860648,"teacher_disagreement_score":0.92879075,"about_ca_system_score_codex":0.00008858134,"about_ca_system_score_gemma":0.00001964718,"threshold_uncertainty_score":0.8402996},"labels":[],"label_agreement":null},{"id":"W2131566996","doi":"10.1109/tcomm.2006.881398","title":"Performance Analysis of Generalized Selection Combining in Generalized Correlated Nakagami-$m$ Fading","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Fading; Nakagami distribution; Mathematics; Selection (genetic algorithm); Statistics; Maximal-ratio combining; Correlation; Fading distribution; Algorithm; Applied mathematics; Computer science; Artificial intelligence","score_opus":0.018943163637527873,"score_gpt":0.2611658133059284,"score_spread":0.24222264966840054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131566996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40212324,0.00027468707,0.5938342,0.00006432155,0.00008246486,0.0002850215,0.00003027652,0.00073967053,0.0025661008],"genre_scores_gemma":[0.9719207,0.002298913,0.02526199,0.000015071451,0.0000044155818,0.00024189457,0.00009133949,0.00004448514,0.00012114428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985495,0.00016898371,0.000720422,0.00017186278,0.0001634262,0.00022581308],"domain_scores_gemma":[0.99807763,0.00023088772,0.0001355039,0.0013990791,0.00011938513,0.000037514634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020383392,0.00020446109,0.00040511164,0.001274726,0.00024966773,0.000019215275,0.0006867535,0.00014170662,0.000051234485],"category_scores_gemma":[0.0000036850001,0.00025065272,0.00016580106,0.0031760966,0.00011493961,0.00025955826,0.0000065678223,0.0005067432,0.0000069243893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013655664,0.00018309882,0.0009011428,0.000011119961,0.00019925638,1.166788e-7,0.00018179214,0.97092295,0.022230648,0.0006929076,0.000026403706,0.0046369242],"study_design_scores_gemma":[0.0005125276,0.000025651992,0.003485468,0.000053887306,0.00021965058,0.000001647492,0.00003340354,0.93497765,0.060106292,0.00011750908,0.00023822626,0.00022810063],"about_ca_topic_score_codex":0.00041955398,"about_ca_topic_score_gemma":0.0013083799,"teacher_disagreement_score":0.5697975,"about_ca_system_score_codex":0.00025850662,"about_ca_system_score_gemma":0.000022570048,"threshold_uncertainty_score":0.9999946},"labels":[],"label_agreement":null},{"id":"W2131828276","doi":"10.1109/tcomm.2007.894092","title":"Coded Unitary Space–Time Modulation With Iterative Decoding: Error Performance and Mapping Design","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"McGill University; University of Saskatchewan","funders":"","keywords":"Decoding methods; Phase-shift keying; Algorithm; Unitary state; Mathematics; Transmitter; Constellation; Quadrature amplitude modulation; Keying; Fading; Computer science; Unitary matrix; Error detection and correction; Channel (broadcasting); Bit error rate; Telecommunications; Physics","score_opus":0.03961834163067597,"score_gpt":0.2645241426640996,"score_spread":0.22490580103342367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131828276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02989546,0.00014454404,0.96628505,0.0002667158,0.000029703458,0.00045297918,0.000012729699,0.00086902827,0.002043798],"genre_scores_gemma":[0.75249225,0.0007940731,0.24640082,0.00003089303,0.0000050608996,0.000101676174,0.000014218769,0.00004096721,0.00012004372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990962,0.000091889495,0.00030052342,0.00015919919,0.00013218941,0.00021995533],"domain_scores_gemma":[0.99788237,0.00050949794,0.00006398898,0.0013372725,0.00012023041,0.00008662781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029964893,0.00020745279,0.00017418207,0.00033169988,0.0005791282,0.00003734741,0.0004465234,0.00009203186,0.000017468376],"category_scores_gemma":[0.0000042546,0.00021826393,0.000030683103,0.00051416806,0.00018776924,0.00048725546,0.000006704059,0.00046804323,0.000019859473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109888824,0.0002609,0.000119712306,0.000064014035,0.0001919733,0.0000016615255,0.004004573,0.83237195,0.03582653,0.0008293183,0.00014577221,0.1260737],"study_design_scores_gemma":[0.00038292943,0.000109554036,0.0009759454,0.00016946376,0.000027308588,0.000020026877,0.00029450722,0.9480821,0.048435457,0.00020767117,0.00093818153,0.0003568807],"about_ca_topic_score_codex":0.000007852988,"about_ca_topic_score_gemma":0.000054588487,"teacher_disagreement_score":0.72259676,"about_ca_system_score_codex":0.00014947621,"about_ca_system_score_gemma":0.00002016622,"threshold_uncertainty_score":0.89005446},"labels":[],"label_agreement":null},{"id":"W2132078810","doi":"10.1109/tcomm.2005.852845","title":"Analytical Modeling of Offset-Induced Priority in Multiclass OBS Networks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Offset (computer science); Robustness (evolution); Jitter; Scaling; Blocking (statistics); Computer science; Optical burst switching; Control theory (sociology); Mathematics; Wavelength; Telecommunications; Computer network; Physics; Wavelength-division multiplexing; Optical performance monitoring; Artificial intelligence","score_opus":0.04112625151022743,"score_gpt":0.28530575208235054,"score_spread":0.24417950057212312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132078810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07424332,0.0002446143,0.9230227,0.0005539698,0.000084623876,0.00020236478,0.000008136371,0.0004773066,0.0011629784],"genre_scores_gemma":[0.93260676,0.0008630663,0.06641329,0.000016125725,0.000012137707,0.00005084164,0.0000027075819,0.000024035142,0.000011008475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905294,0.000039243347,0.00041993574,0.00013556598,0.00010940381,0.00024291244],"domain_scores_gemma":[0.9983478,0.0003004407,0.000025485353,0.0012226665,0.000050585775,0.000052984647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011480713,0.0001408853,0.00022395836,0.00018125321,0.00009548704,0.000009692321,0.0005588271,0.00017518038,0.000011433351],"category_scores_gemma":[0.000014429678,0.00015683242,0.00007589705,0.00056169543,0.00010974432,0.00016282986,0.000007049473,0.00079846854,0.000013128887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056888853,0.00015087411,0.000019667032,0.000005077969,0.000019849866,2.0595094e-7,0.00004929763,0.9582787,0.00025378875,0.00088059437,0.000005185989,0.040331032],"study_design_scores_gemma":[0.0002568471,0.000019835854,0.000058498175,0.000041076735,0.000019439864,0.0000010676099,0.00007832579,0.9983663,0.0006458176,0.0002329697,0.00014154403,0.00013826798],"about_ca_topic_score_codex":0.000016622045,"about_ca_topic_score_gemma":0.00056587666,"teacher_disagreement_score":0.85836345,"about_ca_system_score_codex":0.00016388601,"about_ca_system_score_gemma":0.00001395686,"threshold_uncertainty_score":0.639544},"labels":[],"label_agreement":null},{"id":"W2132553172","doi":"10.1109/tcomm.2009.12.070539","title":"Limit theorem on the sum of identically distributed equally and positively correlated joint lognormals","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Probability and Risk Models","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"Independent and identically distributed random variables; Mathematics; Log-normal distribution; Limit (mathematics); Central limit theorem; Random variable; Illustration of the central limit theorem; Joint probability distribution; Discrete mathematics; Distribution (mathematics); Combinatorics; Applied mathematics; Mathematical analysis; Statistics; Sum of normally distributed random variables","score_opus":0.15526412220446667,"score_gpt":0.3566107570205999,"score_spread":0.20134663481613324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132553172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12757224,0.00015856544,0.8331427,0.033920683,0.000120172794,0.0005490515,0.00036732334,0.00007748134,0.004091794],"genre_scores_gemma":[0.99777675,0.0002839474,0.0011121542,0.00058621605,0.0000044184862,0.000021342967,0.000007511435,0.0000066949774,0.00020093952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973134,0.0008422457,0.0007681194,0.0002834617,0.0005926322,0.00020016279],"domain_scores_gemma":[0.9923553,0.004622844,0.00022467629,0.002255522,0.00043993816,0.000101744234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021635492,0.00015598249,0.00027452127,0.00017991716,0.0007963707,0.00013350589,0.0014005876,0.00012030562,0.00010090791],"category_scores_gemma":[0.00041729258,0.00009813689,0.00017708565,0.00072141725,0.0006813689,0.0002330872,0.000014416122,0.00053059735,0.000076484335],"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.0006779194,0.0058471113,0.00016475763,0.000009731915,0.00029531942,0.000003926016,0.00603939,0.030535541,0.012290207,0.80517375,0.0011716072,0.13779072],"study_design_scores_gemma":[0.0016111911,0.0018728776,0.046171833,0.00030927826,0.0002997138,0.000045353,0.0024802482,0.12360289,0.029649395,0.79226,0.0009609916,0.0007362628],"about_ca_topic_score_codex":0.000034297223,"about_ca_topic_score_gemma":0.00010687436,"teacher_disagreement_score":0.8702045,"about_ca_system_score_codex":0.00004464087,"about_ca_system_score_gemma":0.00008544246,"threshold_uncertainty_score":0.612512},"labels":[],"label_agreement":null},{"id":"W2132947734","doi":"10.1109/26.891208","title":"Frame synchronization in guided scrambling line codes","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cellular Automata and Applications","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":"Dalhousie University","keywords":"Scrambling; Synchronizing; Computer science; Line code; Algorithm; Code word; Synchronization (alternating current); Decoding methods; Theoretical computer science; Telecommunications; Baseband","score_opus":0.04064479655014228,"score_gpt":0.29999418819685075,"score_spread":0.25934939164670845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132947734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004834473,0.00015544698,0.9849836,0.0043853815,0.00006768702,0.0002977552,0.000017060736,0.0003892288,0.0048693144],"genre_scores_gemma":[0.9366088,0.00081480556,0.061222877,0.00031693382,0.000012067704,0.00018801742,0.000023533474,0.000015216364,0.00079778145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987903,0.00012738316,0.00039067733,0.00029582062,0.000177434,0.0002183787],"domain_scores_gemma":[0.9969995,0.00021424232,0.000055615325,0.0025812346,0.00007312912,0.00007624681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020799635,0.00014095522,0.00014752433,0.0002402792,0.0004966014,0.00014487472,0.0017231171,0.000090523776,0.00022573929],"category_scores_gemma":[0.0000054009965,0.00015809684,0.000075162636,0.0012754258,0.000095421834,0.0004313931,0.000008857441,0.00034849817,0.00044159548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010613985,0.0026324568,0.00006659234,0.000022447794,0.00005948139,0.0000037459608,0.0020295728,0.20546912,0.004713276,0.045826916,0.0006140832,0.7385517],"study_design_scores_gemma":[0.00043682934,0.00003862685,0.00028617296,0.0000578953,0.000014651788,0.000015739477,0.000025061609,0.97961473,0.0042830966,0.0035818422,0.011388066,0.00025727527],"about_ca_topic_score_codex":0.00017012202,"about_ca_topic_score_gemma":0.00034739194,"teacher_disagreement_score":0.9317743,"about_ca_system_score_codex":0.0001012991,"about_ca_system_score_gemma":0.00008353285,"threshold_uncertainty_score":0.6447002},"labels":[],"label_agreement":null},{"id":"W2133539287","doi":"10.1109/tcomm.2005.843416","title":"Kalman Filter-Trained Recurrent Neural Equalizers for Time-Varying Channels","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Neural Networks and Applications","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":"McMaster University; University of Ottawa","funders":"","keywords":"Kalman filter; Recurrent neural network; Extended Kalman filter; Computer science; Convergence (economics); Control theory (sociology); Equalization (audio); Channel (broadcasting); Artificial neural network; Gradient descent; Invariant extended Kalman filter; Artificial intelligence; Telecommunications","score_opus":0.06137283117714596,"score_gpt":0.31443673816023904,"score_spread":0.25306390698309306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133539287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005093041,0.00012719234,0.9704174,0.026341245,0.0003158259,0.000694188,0.000058550406,0.0003959749,0.0011403329],"genre_scores_gemma":[0.91652715,0.00017314684,0.07988449,0.0010555445,0.000111768626,0.0009074826,0.000029337234,0.000026233492,0.0012848262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863654,0.000107603664,0.00037943112,0.0003657798,0.00016498858,0.00034563683],"domain_scores_gemma":[0.99686897,0.00055631687,0.000113341106,0.0022072985,0.00011016727,0.0001439226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019315789,0.000197703,0.0001801522,0.00014959986,0.0010567881,0.00016534774,0.0020569677,0.00007036271,0.00004599899],"category_scores_gemma":[0.0000051469274,0.00020394236,0.00020448523,0.000518541,0.00009518604,0.00047412782,0.000018472769,0.0003150003,0.00014837003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003109808,0.0014267312,9.281689e-7,0.000020470206,0.000103297156,4.989117e-7,0.0014634636,0.13211718,0.006040367,0.03068307,0.010257711,0.8178552],"study_design_scores_gemma":[0.00047841904,0.00010712145,0.000004999341,0.000027895117,0.000025201085,0.000008365128,0.000014165851,0.9366925,0.0031015752,0.001067943,0.058200702,0.00027114636],"about_ca_topic_score_codex":0.000009920768,"about_ca_topic_score_gemma":0.000028808721,"teacher_disagreement_score":0.9160179,"about_ca_system_score_codex":0.00007339402,"about_ca_system_score_gemma":0.000039494207,"threshold_uncertainty_score":0.83165276},"labels":[],"label_agreement":null},{"id":"W2134198979","doi":"10.1109/tcomm.2013.110413.120762","title":"Multi-Way MIMO Amplify-and-Forward Relay Networks with Zero-Forcing Transmission","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"MIMO; Relay; Transmission (telecommunications); Pairwise comparison; Pairwise error probability; Relay channel; Multiplexing; Node (physics); Channel state information; Topology (electrical circuits); Signal-to-noise ratio (imaging); Computer science; Channel (broadcasting); Electronic engineering; Mathematics; Control theory (sociology); Telecommunications; Engineering; Wireless; Physics; Power (physics)","score_opus":0.04130863413088687,"score_gpt":0.27266169821131425,"score_spread":0.23135306408042738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134198979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005233044,0.0010435593,0.98866105,0.0071535716,0.00010827221,0.000547172,0.0000022959011,0.00036558489,0.0015951941],"genre_scores_gemma":[0.80203867,0.0069175404,0.18928424,0.0005414967,0.000010668751,0.0003072197,0.000006808905,0.000027049406,0.0008663217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823153,0.00040451906,0.00041675867,0.00040781265,0.00020083193,0.00033854172],"domain_scores_gemma":[0.99573267,0.00059618364,0.00012404754,0.0030808207,0.00023383088,0.00023242363],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030495122,0.0002754625,0.0002574633,0.00021409788,0.0016915862,0.00025360953,0.002081951,0.00012997018,0.00010078692],"category_scores_gemma":[0.0000058559303,0.00022893323,0.00007839886,0.0007942993,0.00030561138,0.0008102092,0.000037154823,0.0008333988,0.000082465885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002636492,0.0007733241,0.000079795616,0.000021271102,0.0001788991,0.0000013393595,0.004995185,0.09049811,0.004161568,0.014987991,0.0016154916,0.8826606],"study_design_scores_gemma":[0.00091171404,0.00017382801,0.0008836726,0.00020245551,0.00003562176,0.000024805278,0.000114437855,0.9797244,0.0004893817,0.00019291336,0.016815923,0.00043083692],"about_ca_topic_score_codex":0.00010884072,"about_ca_topic_score_gemma":0.00019972338,"teacher_disagreement_score":0.8892263,"about_ca_system_score_codex":0.00007284013,"about_ca_system_score_gemma":0.000045830267,"threshold_uncertainty_score":0.9996081},"labels":[],"label_agreement":null},{"id":"W2134332777","doi":"10.1109/tcomm.2011.050911.100069","title":"Multi-Hop Coherent Free-Space Optical Communications over Atmospheric Turbulence Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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 Waterloo","funders":"","keywords":"Fading; Diversity gain; Electronic engineering; Relay; Multiplexing; Computer science; Diversity scheme; Free-space optical communication; Bit error rate; Communications system; Antenna diversity; Transmission (telecommunications); Signal-to-noise ratio (imaging); Optical communication; Heterodyne detection; Time diversity; Topology (electrical circuits); Telecommunications; Wireless; Engineering; Physics; Electrical engineering; Power (physics); Channel (broadcasting); Optics","score_opus":0.05902566054176014,"score_gpt":0.26609284337468464,"score_spread":0.2070671828329245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134332777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060450197,0.0036950188,0.9582313,0.0034272596,0.00068600586,0.0011130307,0.00015302304,0.004843164,0.021806218],"genre_scores_gemma":[0.7402197,0.008375162,0.25023255,0.00007595179,0.00000803534,0.00071191863,0.000014845195,0.000085042404,0.00027680717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801964,0.00018540036,0.00066277204,0.0003368488,0.0002831959,0.00051214435],"domain_scores_gemma":[0.9866288,0.00065362366,0.00009973569,0.012208499,0.00019231394,0.00021706785],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00021736111,0.00042479506,0.0003850007,0.00012575118,0.00077015883,0.000088459805,0.0066929795,0.0003388651,0.00031560872],"category_scores_gemma":[0.00005494983,0.00046350967,0.00021826001,0.0009556651,0.0011360941,0.00040182174,0.00014646196,0.0015139162,0.00037845646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003084504,0.029190268,0.00054561143,0.0005498025,0.004035535,0.000022710765,0.02391362,0.1593471,0.039802153,0.2472374,0.013167443,0.48187992],"study_design_scores_gemma":[0.0015223778,0.00020886114,0.0009067238,0.0002278454,0.0001674043,0.000020102158,0.0012614484,0.9464654,0.029869631,0.0024081687,0.015644893,0.0012971918],"about_ca_topic_score_codex":0.00011840307,"about_ca_topic_score_gemma":0.00041024474,"teacher_disagreement_score":0.78711826,"about_ca_system_score_codex":0.00026052477,"about_ca_system_score_gemma":0.00004919904,"threshold_uncertainty_score":0.99978167},"labels":[],"label_agreement":null},{"id":"W2134713051","doi":"10.1109/tcomm.2010.05.080640","title":"Accurate computation of the MGF of the lognormal distribution and its application to sum of lognormals","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","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":"Log-normal distribution; Mathematics; Function (biology); Expression (computer science); Applied mathematics; Cumulative distribution function; Saddle point; Method of steepest descent; Convergence (economics); Algorithm; Distribution (mathematics); Moment (physics); Mathematical optimization; Mathematical analysis; Probability density function; Computer science; Statistics; Geometry","score_opus":0.05811279964581716,"score_gpt":0.3563313375717895,"score_spread":0.2982185379259723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134713051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10054894,0.000010280832,0.89423054,0.0025057392,0.00008062009,0.0008496649,0.0014701068,0.00002674452,0.0002773781],"genre_scores_gemma":[0.9965876,0.000018036257,0.0030815662,0.000042261097,0.0000053842396,0.00017483384,0.000034391374,0.000009966646,0.000045970606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987541,0.00014539095,0.0006111636,0.00013660388,0.0002405627,0.000112209476],"domain_scores_gemma":[0.99714994,0.00079640176,0.00042319787,0.0010836138,0.00048762906,0.000059201742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029028984,0.00011549066,0.00018886385,0.000052697837,0.00036430184,0.000009355654,0.0006452079,0.00008945055,0.000023877517],"category_scores_gemma":[0.00022506174,0.000085187174,0.000104614024,0.0006834994,0.0003578802,0.00008503377,0.000024141644,0.00030081347,0.0000046922783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003303484,0.001094131,0.00015032024,0.00014506915,0.000060759266,1.2321844e-8,0.00050548906,0.0062875836,0.06992683,0.9141529,0.00039646722,0.007247406],"study_design_scores_gemma":[0.0016177874,0.00018005841,0.10692638,0.00034878467,0.0006300395,0.000021360476,0.000552242,0.25570482,0.55438805,0.07691206,0.0021438734,0.00057457166],"about_ca_topic_score_codex":0.000036547313,"about_ca_topic_score_gemma":0.00018879003,"teacher_disagreement_score":0.89603865,"about_ca_system_score_codex":0.000024557723,"about_ca_system_score_gemma":0.00006995058,"threshold_uncertainty_score":0.34738323},"labels":[],"label_agreement":null},{"id":"W2134864194","doi":"10.1109/tcomm.2010.07.090273","title":"Convolutionally Coded Transmission over Markov-Gaussian Channels: Analysis and Decoding Metrics","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Additive white Gaussian noise; Algorithm; Decoding methods; Markov chain; Noise (video); Gaussian noise; Markov process; Interference (communication); Interleaving; Channel (broadcasting); Gaussian; Transmission (telecommunications); Electronic engineering; Mathematics; Statistics; Telecommunications; Artificial intelligence; Engineering; Physics","score_opus":0.01965295760201848,"score_gpt":0.2652761580552627,"score_spread":0.24562320045324423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134864194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032351315,0.0009020252,0.95934016,0.0011497078,0.0003948472,0.0002694691,0.00014087331,0.0004700366,0.00498155],"genre_scores_gemma":[0.95982546,0.003966692,0.035686564,0.00006113623,0.000017531946,0.000105215055,0.00005091348,0.0000364268,0.0002500434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890757,0.00008998131,0.00038454554,0.00020413275,0.00017816477,0.000235586],"domain_scores_gemma":[0.99719733,0.00050697353,0.000051094106,0.0019560717,0.000094366085,0.00019417278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029891537,0.0002147554,0.000253966,0.0008863426,0.0006808386,0.00008961915,0.0007859124,0.00016345727,0.00026870047],"category_scores_gemma":[0.000011240843,0.00022845811,0.00018756554,0.001739789,0.00017640619,0.00023742869,0.000009065393,0.00085647876,0.000021012827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016967134,0.0038346057,0.002520405,0.00024794517,0.0077858106,0.0000067247615,0.0052175364,0.124318674,0.16229998,0.020200744,0.0031126363,0.6702853],"study_design_scores_gemma":[0.0006459922,0.00003347126,0.004185429,0.000031384167,0.0007459495,0.000010349017,0.00007745912,0.9541021,0.005087821,0.0003770558,0.034217272,0.00048569558],"about_ca_topic_score_codex":0.00007336784,"about_ca_topic_score_gemma":0.00089282024,"teacher_disagreement_score":0.92747414,"about_ca_system_score_codex":0.000055069206,"about_ca_system_score_gemma":0.000035636316,"threshold_uncertainty_score":0.9316252},"labels":[],"label_agreement":null},{"id":"W2134868944","doi":"10.1109/tcomm.2011.092011.090171","title":"Novel Representations for the Bivariate Rician Distribution","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Rician fading; Cumulative distribution function; Mathematics; Bivariate analysis; Independent and identically distributed random variables; Probability density function; Random variable; Joint probability distribution; Applied mathematics; Moment-generating function; Expression (computer science); Statistics; Fading; Computer science","score_opus":0.08392605327693733,"score_gpt":0.3013827566129275,"score_spread":0.21745670333599018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134868944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059993097,0.00020741328,0.9938723,0.00072713185,0.00020439958,0.00067972526,0.00041582613,0.00094904396,0.00288416],"genre_scores_gemma":[0.9080629,0.001689546,0.08806951,0.00006424906,0.0000130291455,0.0018342406,0.00007416453,0.00004439132,0.00014798869],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921256,0.000045694604,0.00031994766,0.00013587657,0.00009725848,0.00018868537],"domain_scores_gemma":[0.9962527,0.0006984134,0.00006130657,0.002801178,0.00013531651,0.000051073395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016276869,0.00015062068,0.00011787303,0.0000885436,0.0008893756,0.000029485269,0.00123353,0.00007925457,0.000036384336],"category_scores_gemma":[0.000014987359,0.00013820286,0.00012492691,0.00042673564,0.00018827461,0.00021789304,0.0000073282813,0.00035608764,0.000028775134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015141201,0.0032793249,0.000037454152,0.00011087372,0.0012325319,4.994549e-7,0.008554479,0.24800436,0.0334772,0.21947043,0.007951153,0.47773027],"study_design_scores_gemma":[0.0016553968,0.00019805956,0.0031170058,0.0001373586,0.00048281802,0.000026871376,0.0015842117,0.6650314,0.16383775,0.013621161,0.14906701,0.001240992],"about_ca_topic_score_codex":0.0001175797,"about_ca_topic_score_gemma":0.00028002716,"teacher_disagreement_score":0.9080029,"about_ca_system_score_codex":0.00010253516,"about_ca_system_score_gemma":0.000019754147,"threshold_uncertainty_score":0.6840448},"labels":[],"label_agreement":null},{"id":"W2135016653","doi":"10.1109/tcomm.2002.806548","title":"Multiuser receivers that are robust to delay mismatch","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Detector; Decorrelation; Computer science; Single antenna interference cancellation; Asynchronous communication; Telecommunications link; Robustness (evolution); Chip; Multiuser detection; Code division multiple access; Electronic engineering; Algorithm; SIGNAL (programming language); Block (permutation group theory); Residual; Telecommunications; Mathematics; Engineering","score_opus":0.1408921385955292,"score_gpt":0.2982669960133088,"score_spread":0.1573748574177796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135016653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094206363,0.00029803705,0.9551422,0.035202608,0.00026340873,0.00054190605,0.000022236954,0.00053012074,0.007057446],"genre_scores_gemma":[0.8811204,0.0020405448,0.1123854,0.0008998354,0.00001477449,0.00036243576,0.0000035034252,0.00003321944,0.0031399222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976849,0.0005319242,0.00035181563,0.00045275988,0.0005131068,0.0004654993],"domain_scores_gemma":[0.9907121,0.000860587,0.00011909801,0.007702792,0.00027585123,0.00032955705],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033920005,0.0002366609,0.0002302095,0.00043465043,0.0012631449,0.00027776966,0.0069321245,0.00013725615,0.00025589208],"category_scores_gemma":[0.000018959629,0.00025577954,0.00015356427,0.0015994684,0.0001733505,0.0006420692,0.000084500265,0.0008780102,0.0016489688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037442325,0.00392917,0.00024211717,0.000032501197,0.0003101755,0.000015274087,0.01023565,0.5372333,0.0007879461,0.0062024733,0.06116107,0.3798129],"study_design_scores_gemma":[0.0006860769,0.00009811899,0.00058461685,0.0001323639,0.000021298983,0.000028020047,0.00039618195,0.9146364,0.0020858634,0.00017504963,0.08056233,0.0005937197],"about_ca_topic_score_codex":0.000107099375,"about_ca_topic_score_gemma":0.0006979378,"teacher_disagreement_score":0.8801783,"about_ca_system_score_codex":0.00022431187,"about_ca_system_score_gemma":0.000037031594,"threshold_uncertainty_score":0.99998945},"labels":[],"label_agreement":null},{"id":"W2135287429","doi":"10.1109/tcomm.2010.01.080142","title":"On space-time coding for free-space optical systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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 British Columbia","funders":"","keywords":"Fading; Pairwise error probability; Free-space optical communication; Coding gain; Computer science; Coding (social sciences); Optical communication; Electronic engineering; Communications system; Space–time code; Optics; Decoding methods; Mathematics; Algorithm; Telecommunications; Physics; Engineering; Statistics","score_opus":0.021066653209366834,"score_gpt":0.25252979653940416,"score_spread":0.2314631433300373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135287429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009475024,0.00027810683,0.9477506,0.009951534,0.0010657405,0.0012179359,0.000277171,0.0038011651,0.026182668],"genre_scores_gemma":[0.9577885,0.0005215453,0.040221483,0.000030959476,0.000021427504,0.0008045418,0.000015551974,0.00007697992,0.0005190002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886525,0.00005042113,0.00035761684,0.00021175417,0.00018540972,0.00032953083],"domain_scores_gemma":[0.9926448,0.0021827235,0.000048910304,0.0048774392,0.00012642014,0.00011973277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022996537,0.0002460927,0.00027085413,0.00026676347,0.00056837936,0.00011820744,0.002136337,0.00029890527,0.000052316795],"category_scores_gemma":[0.000120093144,0.00026332526,0.00014440955,0.00036633437,0.0003300927,0.00015775936,0.000018132252,0.001266381,0.00032943097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044099765,0.0008194732,0.0000020330003,0.00009524542,0.00024395034,6.6671396e-7,0.00023375724,0.10743765,0.09822102,0.7686546,0.006190689,0.018056815],"study_design_scores_gemma":[0.0010792827,0.00022118966,0.0000249776,0.00015544679,0.00008744161,0.000013492631,0.00027348075,0.8673517,0.092276,0.0051022484,0.032685548,0.00072920346],"about_ca_topic_score_codex":0.000012673096,"about_ca_topic_score_gemma":0.00008153326,"teacher_disagreement_score":0.9483135,"about_ca_system_score_codex":0.00010965797,"about_ca_system_score_gemma":0.00002761007,"threshold_uncertainty_score":0.9999819},"labels":[],"label_agreement":null},{"id":"W2135301077","doi":"10.1109/tcomm.2008.060123","title":"Fast convenient numerical computation of lognormal characteristic functions","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","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":"Log-normal distribution; Computation; Mathematics; Characteristic function (probability theory); Numerical integration; Function (biology); Applied mathematics; Expression (computer science); Numerical analysis; Closed-form expression; Simple (philosophy); Algorithm; Probability density function; Computer science; Mathematical analysis; Statistics","score_opus":0.021491841216344825,"score_gpt":0.25064158787164376,"score_spread":0.22914974665529894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135301077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1352762,0.00002127502,0.8610061,0.00043200972,0.000095549774,0.00009227604,0.00008391491,0.00004605246,0.0029466369],"genre_scores_gemma":[0.99768656,0.000021938738,0.0013747219,0.000028143908,0.000026371432,0.00006509345,0.00006226261,0.000012698083,0.00072222383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991921,0.00008783126,0.0003040211,0.00014213054,0.00012600966,0.00014788454],"domain_scores_gemma":[0.9989826,0.00012441419,0.000115310926,0.00060730026,0.00010504232,0.000065299915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050823164,0.00011431614,0.00018226622,0.00012893266,0.0004846879,0.000010902357,0.00025973158,0.000027276099,0.00032727554],"category_scores_gemma":[0.0000010136351,0.000120844576,0.00016337248,0.00035024574,0.00017154957,0.00007036461,0.0000034907296,0.0002283644,0.000081119746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034533752,0.024361085,0.03192965,0.00013193369,0.0039454103,0.0000081121425,0.010290307,0.32818577,0.07479194,0.007734218,0.004832525,0.5134437],"study_design_scores_gemma":[0.006448333,0.002764614,0.08551549,0.000418061,0.002358589,0.00015696089,0.0036093285,0.82673043,0.06008456,0.002560948,0.0064435187,0.0029091677],"about_ca_topic_score_codex":0.0001869173,"about_ca_topic_score_gemma":0.0000047165668,"teacher_disagreement_score":0.86241037,"about_ca_system_score_codex":0.000020810354,"about_ca_system_score_gemma":0.000056416822,"threshold_uncertainty_score":0.4927899},"labels":[],"label_agreement":null},{"id":"W2136335103","doi":"10.1109/tcomm.2010.04.090075","title":"An analytical approach for performance evaluation of BICM transmission over Nakagami-m fading channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Fading; Nakagami distribution; Algorithm; Phase-shift keying; Additive white Gaussian noise; Multipath propagation; Computer science; Bit error rate; Electronic engineering; Mathematics; Telecommunications; Decoding methods; White noise; Channel (broadcasting); Engineering","score_opus":0.062125052958099905,"score_gpt":0.34407638931417145,"score_spread":0.28195133635607156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136335103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069793105,0.00008516733,0.92696077,0.00006631996,0.000120382596,0.00076869346,0.000043203345,0.0004608916,0.0017014876],"genre_scores_gemma":[0.8721047,0.00047461537,0.12651974,0.0000116755955,0.00001619111,0.00073986524,0.00006154702,0.000050612885,0.000021071495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987739,0.000111908616,0.0004288904,0.00018862318,0.000300007,0.00019668159],"domain_scores_gemma":[0.99690086,0.00022461565,0.00007530205,0.0023879616,0.0003129778,0.00009827775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006878691,0.00018562019,0.00021628197,0.0003057822,0.00035131787,0.00002572374,0.001036379,0.00017404895,0.00005256632],"category_scores_gemma":[0.000009858726,0.00020198435,0.00011990703,0.00040989928,0.00017028271,0.0004476244,0.0000034436118,0.00059058616,0.0000025237173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021561113,0.0005166061,0.000011008289,0.0000596764,0.00005446337,1.071068e-8,0.0005685573,0.655312,0.08254147,0.00095216616,0.00003192938,0.25993052],"study_design_scores_gemma":[0.0003913431,0.00006696658,0.000115761584,0.000031395975,0.00008556015,0.0000017018465,0.00005244677,0.89208585,0.10591014,0.00024786635,0.0008264738,0.0001845026],"about_ca_topic_score_codex":0.0000075865837,"about_ca_topic_score_gemma":0.00001405814,"teacher_disagreement_score":0.8023116,"about_ca_system_score_codex":0.00008456377,"about_ca_system_score_gemma":0.000048235637,"threshold_uncertainty_score":0.8236683},"labels":[],"label_agreement":null},{"id":"W2137048573","doi":"10.1109/tcomm.2010.01.060685","title":"LDPC code design considerations for non-uniform channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Concatenated error correction code; Transmitter; Decoding methods; Computer science; Channel capacity; Channel (broadcasting); Theoretical computer science; Code (set theory); Block code; Linear code; Turbo code; Integer programming; Forward error correction; Algorithm; Telecommunications","score_opus":0.08745486694520799,"score_gpt":0.32500439269825104,"score_spread":0.23754952575304306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137048573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018561172,0.00000865869,0.98769695,0.006977652,0.0012184399,0.0010623616,0.00004187274,0.0010680369,0.0017404348],"genre_scores_gemma":[0.51520634,0.000026833304,0.4833778,0.0002995985,0.000020349695,0.00076311466,0.000002333434,0.000019125271,0.00028448296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863595,0.000113928596,0.00038511495,0.00036651484,0.0001806697,0.00031784098],"domain_scores_gemma":[0.99323446,0.0024554527,0.00013191199,0.0036843237,0.00036400507,0.0001298663],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006085113,0.00021276818,0.00019860518,0.0003097701,0.00152465,0.00025366843,0.0020414754,0.00016130318,0.000033470886],"category_scores_gemma":[0.000086887456,0.00023179728,0.00015967162,0.00045228298,0.0001741801,0.00055553135,0.000018327555,0.0007598866,0.00006821662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010334157,0.006298183,0.000020915582,0.00010605527,0.0005514275,0.000009175016,0.020603966,0.056909278,0.25988066,0.44486508,0.05012837,0.16052356],"study_design_scores_gemma":[0.0005165163,0.00027423105,0.00001292247,0.00004046611,0.00004511276,0.00006924789,0.000070667455,0.76174456,0.18030787,0.04891075,0.007516304,0.0004913527],"about_ca_topic_score_codex":0.00004977944,"about_ca_topic_score_gemma":0.0009460939,"teacher_disagreement_score":0.7048353,"about_ca_system_score_codex":0.00006049877,"about_ca_system_score_gemma":0.0002340056,"threshold_uncertainty_score":0.99977523},"labels":[],"label_agreement":null},{"id":"W2138057312","doi":"10.1109/tcomm.2012.050912.110147","title":"Two Useful Bounds Related to Weighted Sums of Rayleigh Random Variables with Applications to Interference Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Cumulative distribution function; Mathematics; Rayleigh distribution; Random variable; Rayleigh scattering; Upper and lower bounds; Context (archaeology); Function (biology); Constant (computer programming); Probability density function; Applied mathematics; Combinatorics; Discrete mathematics; Statistics; Mathematical analysis; Computer science; Physics","score_opus":0.023797860561646598,"score_gpt":0.27497698142799293,"score_spread":0.2511791208663463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138057312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01592397,0.00059674564,0.9732659,0.00046144752,0.00016054526,0.0017003138,0.00014835339,0.0010886124,0.0066540986],"genre_scores_gemma":[0.9558477,0.00042735343,0.04047414,0.000049231694,0.000012687992,0.0029292894,0.00003365728,0.00007542852,0.00015050374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99830276,0.00022851836,0.0006800505,0.00020150894,0.00023788922,0.00034929518],"domain_scores_gemma":[0.99503297,0.000607811,0.00010278486,0.0036883934,0.00029223255,0.00027582337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041520837,0.00027613252,0.0003948038,0.00052591704,0.00035229788,0.00006750765,0.0016136981,0.00012935269,0.000047890157],"category_scores_gemma":[0.0000074574327,0.00027942527,0.000085363135,0.0014790338,0.00015116905,0.00033361054,0.00002277478,0.00054022716,0.0001275067],"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.00085562584,0.0062548146,0.0016760008,0.0007993454,0.0030972275,0.0000010313087,0.03485905,0.5127272,0.1664891,0.23742034,0.004042095,0.031778183],"study_design_scores_gemma":[0.009353309,0.0014346997,0.0015870444,0.0035398095,0.0013664773,0.000174509,0.005117506,0.16529387,0.54569185,0.002921077,0.2582292,0.005290681],"about_ca_topic_score_codex":0.00016231304,"about_ca_topic_score_gemma":0.0002260646,"teacher_disagreement_score":0.93992376,"about_ca_system_score_codex":0.00019662784,"about_ca_system_score_gemma":0.000047125784,"threshold_uncertainty_score":0.9999658},"labels":[],"label_agreement":null},{"id":"W2138410336","doi":"10.1109/tcomm.2009.08.070350","title":"Optimality of threshold policies for transmission scheduling in correlated fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 British Columbia","funders":"","keywords":"Fading; Computer science; Network packet; Scheduling (production processes); Channel state information; Computer network; Transmission (telecommunications); Channel (broadcasting); Upper and lower bounds; Mathematical optimization; Dynamic priority scheduling; Wireless; Real-time computing; Mathematics; Telecommunications; Quality of service","score_opus":0.03317226548997994,"score_gpt":0.29012426326394336,"score_spread":0.25695199777396344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138410336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01642876,0.0003364682,0.9814417,0.0003870788,0.00012384656,0.00041685117,0.000020418,0.00022590105,0.0006190287],"genre_scores_gemma":[0.9438459,0.0011731273,0.054799207,0.000026794445,0.000009495183,0.00007516582,0.000019400712,0.000025644607,0.00002522408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991773,0.000028884779,0.0003906482,0.00011995695,0.000084168096,0.00019905053],"domain_scores_gemma":[0.9990449,0.00018284626,0.000050087427,0.0006101049,0.00006482254,0.000047269605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012455115,0.00013973676,0.00020171049,0.00023900424,0.000169366,0.000013096651,0.00032586342,0.00011466155,0.0000077110335],"category_scores_gemma":[0.0000036504373,0.00016293064,0.00008532351,0.0005464197,0.000051011906,0.00020297577,9.94447e-7,0.0002938379,0.0000015219945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020517971,0.00012305197,0.00000399083,0.000017244085,0.000013509553,6.74362e-8,0.0005415949,0.9814939,0.00586767,0.00060043886,0.0000064606797,0.011311548],"study_design_scores_gemma":[0.0004643603,0.000051743686,0.00006121842,0.00016716028,0.000019701176,0.0000011275213,0.000074494965,0.97880006,0.019188736,0.00093897205,0.00008783821,0.00014460564],"about_ca_topic_score_codex":0.000007731162,"about_ca_topic_score_gemma":0.000016481603,"teacher_disagreement_score":0.92741716,"about_ca_system_score_codex":0.00009085635,"about_ca_system_score_gemma":0.000015547337,"threshold_uncertainty_score":0.66441184},"labels":[],"label_agreement":null},{"id":"W2138553475","doi":"10.1109/tcomm.2008.060298","title":"High-rate diversity across time and frequency using linear dispersion","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Orthogonal frequency-division multiplexing; Cyclic prefix; Fading; Guard interval; Computer science; Decoding methods; Diversity scheme; Algorithm; Telecommunications; Electronic engineering; Channel (broadcasting); Engineering","score_opus":0.04097787146392237,"score_gpt":0.27585412651282487,"score_spread":0.2348762550489025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138553475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4078137,0.0003646695,0.58974135,0.00025987075,0.00008434998,0.00022642045,0.0002158283,0.0010320896,0.0002617658],"genre_scores_gemma":[0.9265294,0.0050504603,0.068189785,0.0000448016,0.00000840676,0.000024348494,0.00002267356,0.00003453044,0.00009557889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.00009720184,0.00022347206,0.00014973072,0.00010566633,0.0001934445],"domain_scores_gemma":[0.99797547,0.00018918741,0.000043710177,0.0016314083,0.00007548384,0.00008476889],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00010907743,0.0001672108,0.00017204673,0.0000987473,0.0018641,0.000014620691,0.00069094275,0.00010477068,0.000033996796],"category_scores_gemma":[0.0000045634433,0.00019489705,0.00006154197,0.00029443298,0.0003306066,0.00035738724,0.00003927155,0.0004455315,0.000054197677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007642078,0.0014633345,0.0007296592,0.00011879916,0.0005456646,0.00001583196,0.013744502,0.65210277,0.2814017,0.0016696089,0.0008427273,0.04728898],"study_design_scores_gemma":[0.0013466228,0.00015224965,0.0021782834,0.00021915515,0.00013045987,0.00011201363,0.00038610262,0.85785586,0.13231471,0.0016943015,0.0022136741,0.0013965882],"about_ca_topic_score_codex":0.00021468713,"about_ca_topic_score_gemma":0.0001126774,"teacher_disagreement_score":0.52155155,"about_ca_system_score_codex":0.00014050113,"about_ca_system_score_gemma":0.000013712463,"threshold_uncertainty_score":0.99943537},"labels":[],"label_agreement":null},{"id":"W2138680197","doi":"10.1109/26.843121","title":"Generalized Markov modeling for flat fading","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Nortel (Canada)","funders":"","keywords":"Fading; Additive white Gaussian noise; Fading distribution; Context (archaeology); Algorithm; Markov model; Markov chain; Computer science; White noise; Mathematics; Covariance; Markov process; Hidden Markov model; Mathematical optimization; Statistics; Speech recognition; Rayleigh fading; Decoding methods","score_opus":0.03993385808510536,"score_gpt":0.29143603720808386,"score_spread":0.2515021791229785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138680197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039301794,0.0004600974,0.9869297,0.0004295618,0.00008706523,0.00051085325,0.000070525944,0.0016328427,0.005949156],"genre_scores_gemma":[0.8166626,0.006118427,0.17545937,0.00008013278,0.000014275045,0.00095437147,0.000030360588,0.00007137154,0.00060908997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907804,0.00006166343,0.00036359156,0.00015842605,0.000100224366,0.00023806418],"domain_scores_gemma":[0.99732226,0.00023429263,0.000024970594,0.0022730331,0.00007220355,0.00007321636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001264818,0.0001894461,0.0001891047,0.00016220308,0.00056964,0.000039540115,0.0009815911,0.00010706464,0.00020679452],"category_scores_gemma":[0.0000030204167,0.00022645142,0.00014506147,0.00027642344,0.000066558845,0.00025365068,0.0000029713976,0.00035856504,0.000056418157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015468124,0.00005453939,2.9366134e-7,0.0000124552525,0.000045965193,6.4377744e-8,0.00020678832,0.78952473,0.003980301,0.00071616966,0.00022429232,0.20521891],"study_design_scores_gemma":[0.00033317428,0.000019479736,6.555469e-7,0.000042439922,0.00002784041,0.0000031157374,0.00003504774,0.96202976,0.021639813,0.0015333939,0.014090355,0.00024490242],"about_ca_topic_score_codex":0.000018694518,"about_ca_topic_score_gemma":0.00006589865,"teacher_disagreement_score":0.8127324,"about_ca_system_score_codex":0.00013405958,"about_ca_system_score_gemma":0.000015466472,"threshold_uncertainty_score":0.92344207},"labels":[],"label_agreement":null},{"id":"W2138681964","doi":"10.1109/tcomm.2009.02.060671","title":"A new framework for soft decision equalization in frequency selective MIMO channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Factor graph; MIMO; Equalization (audio); Computer science; Low-density parity-check code; Decoding methods; Algorithm; Computational complexity theory; Channel (broadcasting); Belief propagation; Multipath propagation; Adaptive equalizer; Multiuser detection; Bit error rate; Code division multiple access; Telecommunications","score_opus":0.04868654231185577,"score_gpt":0.3483338355548701,"score_spread":0.2996472932430143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138681964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020804495,0.00012758395,0.9933781,0.0038545313,0.00039952138,0.0007023953,0.000005358061,0.00070814596,0.0006162952],"genre_scores_gemma":[0.49468887,0.00007804065,0.5047624,0.00028214356,0.0000148983,0.00011721001,0.0000022736756,0.000010560463,0.000043621792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985557,0.00015285531,0.0004115966,0.00038622264,0.0002078331,0.0002857726],"domain_scores_gemma":[0.9960425,0.001477803,0.00013093048,0.0021014793,0.0001512392,0.000096058815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036938995,0.0001868546,0.00019912144,0.0004857402,0.00044039203,0.00012659059,0.001979196,0.00018592126,0.0000065178106],"category_scores_gemma":[0.00012683948,0.00021147508,0.00012103728,0.0015331554,0.00003053458,0.00055560557,0.000008317677,0.00051193667,0.000018700059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043172495,0.00084941695,0.000020724412,0.0000066426164,0.000024590376,9.640643e-7,0.0058239074,0.005254232,0.0016809311,0.23944388,0.00086520694,0.74598634],"study_design_scores_gemma":[0.00045158254,0.00050932827,0.00017108802,0.00029860024,0.000018050374,0.000009625897,0.00005950216,0.09451864,0.012720537,0.8901674,0.0006869759,0.0003886424],"about_ca_topic_score_codex":0.00014781584,"about_ca_topic_score_gemma":0.00050582935,"teacher_disagreement_score":0.74559766,"about_ca_system_score_codex":0.00023050913,"about_ca_system_score_gemma":0.00018629317,"threshold_uncertainty_score":0.8623703},"labels":[],"label_agreement":null},{"id":"W2139057119","doi":"10.1109/tcomm.2009.04.070230","title":"A novel zonal UWB receiver with superior performance","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Rake receiver; Radio receiver design; Multipath propagation; Electronic engineering; Fading; Bandwidth (computing); Computer science; Interference (communication); Matched filter; Telecommunications; Channel (broadcasting); Engineering; Transmitter","score_opus":0.017088466368379074,"score_gpt":0.21940603475022236,"score_spread":0.20231756838184328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139057119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08722579,0.00047994187,0.8753882,0.004210569,0.0001673525,0.0005663134,0.00008211873,0.002396988,0.029482713],"genre_scores_gemma":[0.957995,0.0013812752,0.039927423,0.00016374038,0.000007620862,0.0001736915,0.0000121788635,0.000032983175,0.00030607576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916106,0.000029762676,0.00025739652,0.0001595105,0.00013881191,0.00025346645],"domain_scores_gemma":[0.9969443,0.00013172261,0.000029555273,0.0027394802,0.00008465064,0.00007030339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007580959,0.00020147485,0.00017515602,0.0002466977,0.0004961758,0.000033181543,0.0012551614,0.00012869053,0.0000712335],"category_scores_gemma":[0.000002247016,0.00019998272,0.0000667128,0.00063082855,0.00020731986,0.00025237488,0.0000031164584,0.00071850006,0.00012430754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020002526,0.0033674398,0.00015828249,0.00004571817,0.0005541185,0.000002414485,0.0020923456,0.26248255,0.101677075,0.008520247,0.0010697504,0.61983],"study_design_scores_gemma":[0.006645852,0.0031061224,0.017291281,0.000720731,0.0006323927,0.0008918012,0.001185578,0.6431336,0.17509457,0.0011785373,0.14632912,0.0037904086],"about_ca_topic_score_codex":0.000015125132,"about_ca_topic_score_gemma":0.00017071413,"teacher_disagreement_score":0.8707692,"about_ca_system_score_codex":0.00011709678,"about_ca_system_score_gemma":0.00004171108,"threshold_uncertainty_score":0.81550586},"labels":[],"label_agreement":null},{"id":"W2139188356","doi":"10.1109/tcomm.2011.082911.080032","title":"Gains in Error-Constrained Data Throughput from Extremely Fast Adaptation of Symbol Durations over Multi-Path Fading Channels: Coded and Uncoded Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"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; Throughput; Computer science; Symbol (formal); Communications system; Adaptation (eye); Error detection and correction; Algorithm; Path loss; Electronic engineering; Decoding methods; Telecommunications; Wireless; Engineering","score_opus":0.20257623037894787,"score_gpt":0.32058713034558406,"score_spread":0.11801089996663619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139188356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017781941,0.00089379266,0.9782544,0.000064661705,0.00017486645,0.00071254297,0.00096649764,0.00052695035,0.00062436494],"genre_scores_gemma":[0.9082948,0.0023904762,0.08865928,0.000011808196,0.000008046185,0.00030763278,0.00024481976,0.00005672091,0.000026400925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998317,0.00022592224,0.00076213654,0.00030843733,0.00016606977,0.000220402],"domain_scores_gemma":[0.99576885,0.00042831973,0.00017817262,0.0034272263,0.00011772896,0.000079702804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023096285,0.0002628242,0.0003567497,0.00035440642,0.00027268621,0.000035719702,0.0013322658,0.00016279251,0.000026704465],"category_scores_gemma":[0.000021695894,0.0003094769,0.000053270058,0.00051049987,0.00026999574,0.0007960845,0.000033773664,0.0005146979,0.0000061773703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010976076,0.00250385,0.0005333333,0.00025335723,0.0006187079,0.000004599458,0.04939757,0.8494983,0.048048317,0.006645949,0.0001108907,0.04227541],"study_design_scores_gemma":[0.00073942315,0.000031608455,0.00061329803,0.0002974942,0.00005737345,0.0000036945698,0.004072365,0.9888976,0.0046413746,0.00023335926,0.00011258076,0.00029979064],"about_ca_topic_score_codex":0.0017003561,"about_ca_topic_score_gemma":0.0044015194,"teacher_disagreement_score":0.8905129,"about_ca_system_score_codex":0.00012706552,"about_ca_system_score_gemma":0.000050995215,"threshold_uncertainty_score":0.99993575},"labels":[],"label_agreement":null},{"id":"W2139450743","doi":"10.1109/tcomm.2008.060056","title":"Effect of Channel Estimation Error on Bit Error Probability in OFDM Systems over Rayleigh and Ricean Fading Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Telus (Canada); University of Alberta","funders":"","keywords":"Fading; Orthogonal frequency-division multiplexing; Rayleigh fading; Bit error rate; Mathematics; Algorithm; Channel (broadcasting); Maximal-ratio combining; Statistics; Computer science; Electronic engineering; Telecommunications; Engineering; Decoding methods","score_opus":0.03729548531080171,"score_gpt":0.2932029443817528,"score_spread":0.25590745907095114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139450743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5493255,0.0006191221,0.44539833,0.00020758997,0.00024777328,0.0019049254,0.00007963618,0.00090308464,0.0013140367],"genre_scores_gemma":[0.9938298,0.0010136064,0.0042957417,0.000009923527,0.000006598756,0.0007454277,0.00001642745,0.000049104918,0.000033404394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850076,0.00035683694,0.00053536764,0.00021379632,0.00018393261,0.00020927489],"domain_scores_gemma":[0.9969233,0.0009305549,0.000117704374,0.0018932506,0.00006522647,0.00006994968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041686557,0.00024914587,0.00037408952,0.00044953817,0.0003067836,0.000016318761,0.000581201,0.00014676392,0.000006858273],"category_scores_gemma":[0.000028152974,0.00026166445,0.000079590645,0.00057089503,0.0002304182,0.00030151734,0.000010725033,0.0005522084,0.000008016042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005172904,0.00030808928,0.000057339614,0.00027603435,0.0000455482,6.5920665e-7,0.0014528914,0.99009174,0.0023713405,0.000525276,0.000029836054,0.004789521],"study_design_scores_gemma":[0.00082351844,0.00035098044,0.00060509576,0.0004917609,0.000036279107,0.000016017104,0.000074286894,0.9529215,0.04376509,0.00045086077,0.00011242073,0.0003522099],"about_ca_topic_score_codex":0.00012628657,"about_ca_topic_score_gemma":0.00007337064,"teacher_disagreement_score":0.44450426,"about_ca_system_score_codex":0.00022891971,"about_ca_system_score_gemma":0.000018121644,"threshold_uncertainty_score":0.99998355},"labels":[],"label_agreement":null},{"id":"W2139813817","doi":"10.1109/tcomm.2009.03.070113","title":"New simple closed-form BER expressions for MRC diversity BPSK in correlated rayleigh fading and CCI","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Phase-shift keying; Rayleigh fading; Maximal-ratio combining; Fading; Additive white Gaussian noise; Fading distribution; Keying; Diversity combining; Bit error rate; Mathematics; Amplitude and phase-shift keying; Binary number; Electronic engineering; Interference (communication); Diversity scheme; Telecommunications; Algorithm; Computer science; White noise; Statistics; Channel (broadcasting); Decoding methods; Engineering; Arithmetic","score_opus":0.028540480061101103,"score_gpt":0.2782190233074575,"score_spread":0.2496785432463564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139813817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011881642,0.00035884485,0.9837118,0.0007655513,0.00007488711,0.00064542604,0.000052905823,0.00083271886,0.0016762211],"genre_scores_gemma":[0.9353479,0.0021955073,0.06204241,0.00008239369,0.0000072926036,0.00011075781,0.00003323066,0.000029047047,0.00015144778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991073,0.00005201337,0.00033284194,0.0001748778,0.00010177748,0.00023121732],"domain_scores_gemma":[0.9978504,0.00043763695,0.000054305776,0.0014832882,0.00005655962,0.00011777328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011585879,0.0001919003,0.00021472138,0.00027861027,0.0007697204,0.000030512065,0.00077795255,0.00014852229,0.00002730869],"category_scores_gemma":[0.0000107283895,0.00022465058,0.000081732636,0.00039708253,0.00006591085,0.0003832929,0.00002192857,0.00054988044,0.000008970206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013184732,0.00095481816,0.00035596563,0.00006318594,0.00016872062,0.0000016531166,0.006999567,0.16313173,0.03149311,0.009466705,0.0028129362,0.7844198],"study_design_scores_gemma":[0.00967733,0.0007562906,0.010877233,0.0011363565,0.00041287707,0.000040053834,0.00288691,0.61051226,0.16136108,0.14326252,0.055577487,0.0034996166],"about_ca_topic_score_codex":0.000093522525,"about_ca_topic_score_gemma":0.00036038185,"teacher_disagreement_score":0.92346627,"about_ca_system_score_codex":0.00016640857,"about_ca_system_score_gemma":0.000023772194,"threshold_uncertainty_score":0.9160984},"labels":[],"label_agreement":null},{"id":"W2140891240","doi":"10.1109/tcomm.2008.060147","title":"Asymptotic Error Rate Analysis of Dual-Branch Diversity over Correlated Rician Channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Rician fading; Dual (grammatical number); Selection (genetic algorithm); Diversity combining; Channel (broadcasting); Word error rate; Mathematics; Bit error rate; Diversity scheme; Diversity (politics); Computer science; Statistics; Algorithm; Applied mathematics; Telecommunications; Orthogonal frequency-division multiplexing; Fading; Speech recognition; Artificial intelligence","score_opus":0.03911144538716488,"score_gpt":0.26946030496944295,"score_spread":0.23034885958227808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140891240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16059837,0.00029915263,0.8351296,0.00018351054,0.00019100124,0.00033341863,0.00016236513,0.0010211442,0.0020814],"genre_scores_gemma":[0.99310625,0.0030669128,0.0033872565,0.00005055838,0.000004291002,0.00007848603,0.00005088923,0.000036448397,0.00021892852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988091,0.00017614164,0.0004510139,0.0001717462,0.00018516398,0.00020682164],"domain_scores_gemma":[0.9965534,0.0004291726,0.0001191482,0.0026570002,0.00015557231,0.00008567107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014837338,0.00020673376,0.0003868805,0.00077842205,0.000824076,0.000009733439,0.00095541996,0.00014022793,0.00013158527],"category_scores_gemma":[0.00000853156,0.00024595176,0.00026388938,0.0022489699,0.00028980366,0.000260798,0.000028352986,0.0005219127,0.000029893225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019989846,0.0005004816,0.0005517827,0.000018814791,0.0015540412,0.0000014415315,0.0023286468,0.9872301,0.004253842,0.00039735332,0.000244114,0.002899379],"study_design_scores_gemma":[0.00088044815,0.00010322877,0.025279943,0.00009795599,0.0016006134,0.00001045217,0.00020002501,0.93464965,0.034536723,0.0005271246,0.0013060482,0.00080781244],"about_ca_topic_score_codex":0.00017455815,"about_ca_topic_score_gemma":0.00029327362,"teacher_disagreement_score":0.83250785,"about_ca_system_score_codex":0.0001482745,"about_ca_system_score_gemma":0.000022751547,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W2141334121","doi":"10.1109/tcomm.2011.02.090283","title":"Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Telecommunications link; Duality (order theory); Mathematical optimization; Computer science; Convex optimization; Power (physics); Constraint (computer-aided design); Regular polygon; Iterative method; Optimization problem; Mathematics; Computer network; Discrete mathematics","score_opus":0.037152539709148245,"score_gpt":0.25501200758629167,"score_spread":0.21785946787714341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141334121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018299653,0.00035727958,0.988525,0.0002209911,0.00032218284,0.0003464936,0.00016787005,0.0006338592,0.0075963666],"genre_scores_gemma":[0.92821366,0.00073791103,0.07039969,0.000038451377,0.000013986564,0.000257951,0.00004427349,0.000056991656,0.00023708714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989513,0.000058739024,0.00044874204,0.00020280159,0.00009617072,0.00024225735],"domain_scores_gemma":[0.9981626,0.00027444676,0.00005257338,0.0012742319,0.00010857979,0.00012754263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011256018,0.00020842017,0.00019031084,0.00021960473,0.00046827854,0.000049096954,0.0003464778,0.00013299542,0.00033941783],"category_scores_gemma":[0.000014673187,0.00023741889,0.00007301834,0.00031702445,0.00020043987,0.00038185413,0.000008153003,0.00038913012,0.00012838314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028079213,0.0057245987,0.0005734091,0.0007292484,0.0033280884,0.000034075114,0.07530782,0.67748606,0.046996146,0.07060553,0.014367309,0.10456694],"study_design_scores_gemma":[0.0051919925,0.0006843568,0.0070027965,0.001065569,0.0012238366,0.0005775529,0.011767005,0.8979528,0.03757723,0.0073261727,0.024554733,0.0050759627],"about_ca_topic_score_codex":0.000039198312,"about_ca_topic_score_gemma":0.00018019768,"teacher_disagreement_score":0.9263837,"about_ca_system_score_codex":0.00008167682,"about_ca_system_score_gemma":0.000026006473,"threshold_uncertainty_score":0.9681662},"labels":[],"label_agreement":null},{"id":"W2141578547","doi":"10.1109/tcomm.2003.818099","title":"Techniques for early stopping and error detection in turbo decoding","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Turbo code; Convolutional code; Decoding methods; Serial concatenated convolutional codes; Computer science; Redundancy (engineering); Algorithm; Cyclic redundancy check; Turbo; Encoder; Error detection and correction; Concatenated error correction code; Block code; Engineering","score_opus":0.0342274945587065,"score_gpt":0.2920470509046826,"score_spread":0.2578195563459761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141578547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017444443,0.00034508097,0.9788216,0.00011727361,0.00006688181,0.0006045238,0.000013661054,0.0008972706,0.0016892985],"genre_scores_gemma":[0.8808473,0.001483023,0.11653755,0.00002358741,0.000003581869,0.0010275681,0.0000022619613,0.00004178056,0.000033350894],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922305,0.00008900676,0.0002989392,0.00014474061,0.00006296923,0.00018127516],"domain_scores_gemma":[0.998395,0.00037196602,0.000041073617,0.001090846,0.00005412001,0.000046946847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022207435,0.00014881781,0.00015355283,0.00033209604,0.0003120667,0.000033225166,0.00034910746,0.00011102825,0.000005022301],"category_scores_gemma":[0.00001780389,0.00018401923,0.000052328855,0.00033010604,0.00008452302,0.00027041693,0.0000032298578,0.00039948148,0.0000025921895],"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.000035532295,0.00039329097,0.00010182378,0.00014100286,0.00009188805,5.1926776e-7,0.0023418672,0.017289456,0.10887215,0.00666988,0.000041417752,0.8640212],"study_design_scores_gemma":[0.0005670475,0.000121660036,0.00027223342,0.00020716412,0.0000337948,0.000014442135,0.00044440772,0.07988452,0.9016033,0.005829469,0.010451752,0.0005702381],"about_ca_topic_score_codex":0.000022701848,"about_ca_topic_score_gemma":0.00047666972,"teacher_disagreement_score":0.86345094,"about_ca_system_score_codex":0.00015686257,"about_ca_system_score_gemma":0.000012250446,"threshold_uncertainty_score":0.7504086},"labels":[],"label_agreement":null},{"id":"W2141983993","doi":"10.1109/tcomm.2002.1006559","title":"Optimum threshold detection in real-time scalable high-speed multi-wavelength optical code-division multiple-access LANs","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Division (mathematics); Code (set theory); Scalability; Code division multiple access; Electronic engineering; Maximization; Wavelength-division multiplexing; Wavelength; Computer network; Optics; Mathematics; Mathematical optimization; Engineering; Physics","score_opus":0.04787473468796925,"score_gpt":0.263618913198702,"score_spread":0.21574417851073274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141983993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56922406,0.00026061456,0.41411802,0.00045188583,0.001084198,0.0014115259,0.00025019795,0.0020927764,0.011106747],"genre_scores_gemma":[0.99587977,0.0010455577,0.0022736196,0.000016967902,0.000018312034,0.00017613308,0.000017656303,0.00007142032,0.00050059275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984304,0.00016881531,0.0005270716,0.0002871139,0.00020361974,0.00038301756],"domain_scores_gemma":[0.9976816,0.00041608047,0.00005136861,0.001643187,0.00006694223,0.00014082792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028472824,0.0002782834,0.00031267214,0.0003976071,0.00044354398,0.00010746476,0.00086888985,0.00023215586,0.00021907355],"category_scores_gemma":[0.000010261236,0.00030454202,0.00013562833,0.00076358346,0.00013682082,0.00045139433,0.000010037115,0.00069245824,0.00043187625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006969664,0.0023116975,0.00024085198,0.00010747516,0.00020644716,0.00000855938,0.0013974423,0.8489156,0.116479635,0.0007131734,0.00025402274,0.029295439],"study_design_scores_gemma":[0.0011525586,0.000060037677,0.0011047715,0.00010637458,0.00003443871,0.000009744957,0.00009786149,0.97201,0.02460225,0.000085956846,0.00038736625,0.0003486251],"about_ca_topic_score_codex":0.00019329131,"about_ca_topic_score_gemma":0.0013466388,"teacher_disagreement_score":0.4266557,"about_ca_system_score_codex":0.0001696922,"about_ca_system_score_gemma":0.000008257629,"threshold_uncertainty_score":0.9999407},"labels":[],"label_agreement":null},{"id":"W2142009305","doi":"10.1109/tcomm.2006.876875","title":"V-BLAST Without Optimal Ordering: Analytical Performance Evaluation for Rayleigh Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"École de Technologie Supérieure; University of Ottawa","funders":"Medical Research Council","keywords":"Monte Carlo method; Rayleigh fading; Fading; Algorithm; Signal-to-noise ratio (imaging); Bit error rate; Computer science; Independent and identically distributed random variables; Mathematics; Statistics; Telecommunications; Random variable; Decoding methods","score_opus":0.04606116449402705,"score_gpt":0.3112665671320339,"score_spread":0.26520540263800685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142009305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031013096,0.00019210305,0.963021,0.00029867608,0.00018332744,0.00089807465,0.000038778846,0.0010684816,0.0032864928],"genre_scores_gemma":[0.9327209,0.00051014085,0.06473917,0.000020866953,0.00003949184,0.0016088835,0.000066399465,0.00007398648,0.00022016927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987174,0.00007848722,0.0004557233,0.00021026187,0.00024073369,0.0002973423],"domain_scores_gemma":[0.99746925,0.00029865568,0.000071921626,0.0018367273,0.00025938652,0.00006406852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034258812,0.00023655978,0.00022938376,0.00028794727,0.00062362856,0.000062723084,0.0008459871,0.00012588588,0.000043024527],"category_scores_gemma":[0.000010126884,0.000276658,0.000121567726,0.00043595652,0.00014970587,0.0003823542,0.000007697036,0.00041547287,0.000028079876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150974265,0.0001475558,0.000014928569,0.000022816037,0.000039790026,3.7385952e-8,0.00014020588,0.9695053,0.0021494247,0.00074738014,0.00018650474,0.027030922],"study_design_scores_gemma":[0.0004731542,0.000058714082,0.00010826135,0.00006627939,0.00007093481,0.0000042308743,0.000048335834,0.9569741,0.036380712,0.00028653222,0.0052416716,0.0002870583],"about_ca_topic_score_codex":0.000018362956,"about_ca_topic_score_gemma":0.00006238835,"teacher_disagreement_score":0.90170777,"about_ca_system_score_codex":0.00028709832,"about_ca_system_score_gemma":0.000041233834,"threshold_uncertainty_score":0.9999686},"labels":[],"label_agreement":null},{"id":"W2142813958","doi":"10.1109/tcomm.2010.083110.090070","title":"Lower Bounds to the Performance of Bit Synchronization for Bandwidth Efficient Pulse-Shaping","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Synchronizer; Upper and lower bounds; Intersymbol interference; Algorithm; Synchronization (alternating current); Pulse-amplitude modulation; Bandwidth (computing); Mathematics; Computer science; Cramér–Rao bound; Decoding methods; Pulse (music); Control theory (sociology); Topology (electrical circuits); Telecommunications; Detector; Combinatorics","score_opus":0.02082678238678572,"score_gpt":0.2703305581404115,"score_spread":0.24950377575362578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142813958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042641614,0.00009988586,0.95400614,0.0008828216,0.0003516122,0.000719807,0.00006171093,0.0003994136,0.0008369914],"genre_scores_gemma":[0.9599365,0.00043119807,0.038682047,0.000066044275,0.000017203789,0.0007402816,0.000014023792,0.000044962402,0.00006774179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992039,0.000033970657,0.00033434256,0.00012114013,0.0001312051,0.00017539578],"domain_scores_gemma":[0.99692357,0.00034294362,0.00006032119,0.002422567,0.00019733471,0.00005327105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023214171,0.00014024848,0.00013959121,0.00017728232,0.0005566553,0.000030083633,0.0011624019,0.00008189195,0.000042995136],"category_scores_gemma":[0.000015709309,0.00012955721,0.00008257628,0.00050368556,0.00013731903,0.00011237369,0.000009441661,0.00043732903,0.000019137822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018433362,0.00022114631,0.0000090470085,0.000049635357,0.000040811432,1.8986082e-8,0.0005746929,0.88457423,0.03668218,0.0012033066,0.00021539841,0.07641111],"study_design_scores_gemma":[0.00019336147,0.000093417926,0.00010631285,0.000075272095,0.000029331013,0.000002414743,0.000047953494,0.8602086,0.12150114,0.0000611256,0.017482905,0.00019818352],"about_ca_topic_score_codex":0.000009420842,"about_ca_topic_score_gemma":0.0002096709,"teacher_disagreement_score":0.91729486,"about_ca_system_score_codex":0.00007252942,"about_ca_system_score_gemma":0.000031931697,"threshold_uncertainty_score":0.528319},"labels":[],"label_agreement":null},{"id":"W2144165159","doi":"10.1109/tcomm.2009.11.060557","title":"A low-complexity generalized sphere decoding approach for underdetermined linear communication systems: performance and complexity evaluation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Underdetermined system; Decoding methods; Computational complexity theory; MIMO; Algorithm; Mathematics; Cholesky decomposition; Reduction (mathematics); Communication complexity; Rank (graph theory); Computer science; Theoretical computer science; Eigenvalues and eigenvectors; Beamforming; Statistics; Combinatorics","score_opus":0.12489104865201725,"score_gpt":0.3292791908695439,"score_spread":0.20438814221752663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144165159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023397788,0.000992039,0.96927196,0.00035213467,0.0000731664,0.0019360327,0.00009132824,0.0010595956,0.0028259507],"genre_scores_gemma":[0.7189162,0.002945049,0.27689165,0.00005558765,0.000012887858,0.0009130761,0.00018619969,0.00003960305,0.000039741863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982608,0.00032307758,0.00061345147,0.00027186924,0.00024632423,0.0002844523],"domain_scores_gemma":[0.99614024,0.00032347627,0.00015324085,0.0029568665,0.00032020855,0.00010598111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061503606,0.0003033522,0.00035556557,0.00020705748,0.0010720937,0.00009311109,0.001101868,0.00016412525,0.000014245465],"category_scores_gemma":[0.000016510412,0.000349973,0.00010302936,0.00037706541,0.00032417034,0.00047617828,0.000012991745,0.0004906714,0.0000048671814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011638534,0.00094969553,0.000016403756,0.00034771574,0.0001438654,8.385726e-8,0.0011314997,0.7707706,0.0058128624,0.01576839,0.0003861883,0.2045563],"study_design_scores_gemma":[0.0008717702,0.000087908375,0.00017732878,0.00012291409,0.000078576086,0.000008600303,0.00018202174,0.9906599,0.004811252,0.0021550786,0.0004939988,0.00035065523],"about_ca_topic_score_codex":0.000029357057,"about_ca_topic_score_gemma":0.000080428894,"teacher_disagreement_score":0.69551843,"about_ca_system_score_codex":0.00032446347,"about_ca_system_score_gemma":0.000045711255,"threshold_uncertainty_score":0.9998952},"labels":[],"label_agreement":null},{"id":"W2144216682","doi":"10.1109/tcomm.2008.060596","title":"Statistical analysis of mobile radio reception: an extension of clarke's model","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autocorrelation; Fading; Wireless; Spectral density; Channel (broadcasting); Computer science; Statistical model; Electronic engineering; Doppler effect; Telecommunications; Statistical physics; Algorithm; Mathematics; Statistics; Engineering; Physics; Artificial intelligence","score_opus":0.041698612710820065,"score_gpt":0.2898219552091321,"score_spread":0.24812334249831206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144216682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027201338,0.00012776666,0.9715054,0.0000113930855,0.00006319571,0.00021392565,0.0002640298,0.0001469759,0.00046599706],"genre_scores_gemma":[0.89245397,0.0013774768,0.10589323,0.000004198606,0.0000037865132,0.00008970969,0.00009389585,0.000025324807,0.000058409292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900734,0.00009484942,0.00050309097,0.00014170197,0.0001420456,0.00011097891],"domain_scores_gemma":[0.997902,0.00017746398,0.00008711784,0.0015747376,0.00019140342,0.000067295405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011449119,0.0001200504,0.00032202352,0.00041423456,0.00016416403,0.0000035611606,0.00030686575,0.00009182271,0.00007114604],"category_scores_gemma":[0.000005503517,0.00013741193,0.000111402085,0.0009123266,0.00017255235,0.00021665604,0.0000020447478,0.00018622291,0.0000049642435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011055044,0.00022373324,0.000015252808,0.00001434351,0.00018955197,1.717854e-7,0.0006230352,0.9870033,0.009881342,0.00021387474,0.00003252997,0.0017917994],"study_design_scores_gemma":[0.00017551173,0.000060128372,0.0002549133,0.000017729277,0.00031598,0.000003921093,0.0001255452,0.99362296,0.0052149035,0.00005203458,0.00004087394,0.00011548056],"about_ca_topic_score_codex":0.00002775946,"about_ca_topic_score_gemma":0.00012234502,"teacher_disagreement_score":0.86561215,"about_ca_system_score_codex":0.00007327167,"about_ca_system_score_gemma":0.000030221267,"threshold_uncertainty_score":0.56034964},"labels":[],"label_agreement":null},{"id":"W2144406178","doi":"10.1109/tcomm.2009.04.070075","title":"Exact method for the error probability calculation of three-dimensional signal constellations","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Additive white Gaussian noise; Upper and lower bounds; Mathematics; Algorithm; Computation; Constellation diagram; White noise; Applied mathematics; Channel (broadcasting); Function (biology); Constellation; SIGNAL (programming language); Statistics; Mathematical analysis; Computer science; Telecommunications; Bit error rate; Physics; Decoding methods","score_opus":0.057339579943286784,"score_gpt":0.3285521754032389,"score_spread":0.27121259545995213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144406178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054127764,0.00036160785,0.9948875,0.0017647683,0.000064704334,0.0011217624,0.00010192576,0.00045784234,0.0006986295],"genre_scores_gemma":[0.7321841,0.000102972546,0.26731512,0.000054001728,0.0000074517247,0.00027142858,0.00002047006,0.000019345724,0.000025095214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988809,0.00012244906,0.0005056961,0.0001531008,0.00017184911,0.00016599966],"domain_scores_gemma":[0.9952976,0.002156196,0.00010971321,0.0021359872,0.00025126943,0.00004922339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037481342,0.00017298714,0.00020947366,0.00013557705,0.0005576737,0.00001730296,0.0007742166,0.000106757645,0.00004520388],"category_scores_gemma":[0.000016054662,0.00015446164,0.00018216044,0.00039771709,0.00020591743,0.00016685622,0.0000046018918,0.00037033026,0.0000048428574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023253264,0.00024647944,0.000007636703,0.000016519894,0.000072561445,2.1540707e-8,0.00015206629,0.8458839,0.008316468,0.005740579,0.0001849966,0.13935548],"study_design_scores_gemma":[0.00026929294,0.00007847365,0.000525959,0.000041922947,0.00008186822,0.000003010165,0.00002532515,0.9585124,0.027379164,0.011160121,0.0017435532,0.00017889972],"about_ca_topic_score_codex":0.000027571734,"about_ca_topic_score_gemma":0.00022182394,"teacher_disagreement_score":0.73164284,"about_ca_system_score_codex":0.000108116255,"about_ca_system_score_gemma":0.00004987145,"threshold_uncertainty_score":0.62987626},"labels":[],"label_agreement":null},{"id":"W2144624975","doi":"10.1109/tcomm.2009.10.080090","title":"Strict suboptimality of selection amplify-and-forward relaying under global channel information","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Selection (genetic algorithm); Channel (broadcasting); Upper and lower bounds; Outage probability; Constant (computer programming); Relay channel; Mathematical optimization; Power (physics); Computer science; Mathematics; Control theory (sociology); Telecommunications; Fading; Physics","score_opus":0.047567399892368856,"score_gpt":0.30338906514648195,"score_spread":0.2558216652541131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144624975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024623284,0.00020137391,0.98913646,0.0043896036,0.00009255437,0.00022831035,0.000015973377,0.00019937067,0.0032740193],"genre_scores_gemma":[0.97545934,0.002526669,0.021402162,0.0005368156,0.000006054553,0.000028056387,0.000009980974,0.000003537921,0.000027411135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987429,0.00029836877,0.00042795867,0.00016135552,0.00019473197,0.00017469843],"domain_scores_gemma":[0.99784166,0.00022624074,0.00017457716,0.0014074297,0.00026453086,0.00008554506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043527767,0.00014394843,0.00016910121,0.00017014914,0.0007147416,0.000116987285,0.0010934365,0.00009198723,0.000011533343],"category_scores_gemma":[0.000016654336,0.00015331,0.00007493557,0.0010733953,0.00009101342,0.001140074,0.000021362572,0.00035147107,0.000016932478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007043952,0.0010668403,0.00010709083,0.000022438377,0.00013381585,1.6177366e-7,0.0029420294,0.06386897,0.0010678549,0.3380117,0.0004023506,0.5923063],"study_design_scores_gemma":[0.0016395868,0.0007467901,0.024882754,0.00015771254,0.00009677894,0.000052817755,0.00052180997,0.9462966,0.004237354,0.013747888,0.0068010488,0.0008188801],"about_ca_topic_score_codex":0.00003485472,"about_ca_topic_score_gemma":0.00008277119,"teacher_disagreement_score":0.972997,"about_ca_system_score_codex":0.0001421414,"about_ca_system_score_gemma":0.00008150171,"threshold_uncertainty_score":0.62518007},"labels":[],"label_agreement":null},{"id":"W2144857775","doi":"10.1109/tcomm.2012.100512.110649","title":"Power Allocation in Two-Dimensional Superposition Modulation Based Cooperative Wireless Communication System","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rayleigh fading; Spectral efficiency; Superposition principle; Link adaptation; Computer science; Transmission (telecommunications); Modulation (music); Relay; Electronic engineering; Wireless; Bit error rate; Symbol rate; Node (physics); Fading; Quadrature amplitude modulation; Communications system; Power (physics); Topology (electrical circuits); Computer network; Telecommunications; Channel (broadcasting); Mathematics; Engineering; Electrical engineering; Physics","score_opus":0.037498846544489345,"score_gpt":0.2950147410092691,"score_spread":0.25751589446477974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144857775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028560136,0.0006593132,0.9621249,0.0035581337,0.00035304774,0.00079877925,0.000016287639,0.00044823784,0.0034812037],"genre_scores_gemma":[0.9758742,0.00023055026,0.022732567,0.0004538936,0.000016992426,0.0004909218,0.00008493115,0.000028935388,0.00008700417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967249,0.0015000252,0.000658918,0.00034306227,0.00037648572,0.0003966203],"domain_scores_gemma":[0.9947896,0.00073387846,0.00018817234,0.0036786697,0.0004404973,0.00016917309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010496861,0.00028751694,0.0002731569,0.0005022706,0.0011043333,0.0001424861,0.0019197153,0.00011289808,0.00005244053],"category_scores_gemma":[0.000013407875,0.00031464954,0.00011591976,0.0014168435,0.00016868822,0.001634088,0.000046703604,0.0006678723,0.00015070228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011222604,0.004816389,0.0006400631,0.00004410728,0.00013746116,0.0000014402335,0.0076885037,0.44631603,0.023656081,0.43426058,0.00033655556,0.081990555],"study_design_scores_gemma":[0.001117287,0.00005830362,0.0032829149,0.00024096084,0.000016572332,0.0000124787375,0.00018437045,0.9880631,0.0061834953,0.000079936675,0.00036227214,0.00039829005],"about_ca_topic_score_codex":0.00006732481,"about_ca_topic_score_gemma":0.00036896142,"teacher_disagreement_score":0.9473141,"about_ca_system_score_codex":0.00063961995,"about_ca_system_score_gemma":0.00014898945,"threshold_uncertainty_score":0.99993056},"labels":[],"label_agreement":null},{"id":"W2145502169","doi":"10.1109/tcomm.2007.902531","title":"Stochastic Differential Equation Theory Applied to Wireless Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"McMaster University","funders":"","keywords":"Fading; Autoregressive model; Wireless; Multipath propagation; Stochastic process; Stochastic differential equation; Computer science; Channel (broadcasting); Rayleigh fading; Stochastic modelling; Markov process; Channel state information; Mathematics; Applied mathematics; Telecommunications; Statistics","score_opus":0.025354993590031995,"score_gpt":0.2581639917742672,"score_spread":0.2328089981842352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145502169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021930947,0.000029993038,0.9930967,0.00007066529,0.00070056826,0.00062381005,0.000024255976,0.0006202603,0.0026406655],"genre_scores_gemma":[0.99163824,0.000027188406,0.0076727835,0.000040441846,0.000051828316,0.00026790428,0.000025459218,0.00006290042,0.00021327128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.00004502751,0.00034806126,0.00016721513,0.00014061267,0.00025790115],"domain_scores_gemma":[0.99827117,0.00037723378,0.000041332012,0.0011156992,0.00007157877,0.00012300364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023376915,0.00018140108,0.00016394332,0.00030811035,0.00032155463,0.000034279252,0.0004407282,0.000100375095,0.000051529758],"category_scores_gemma":[0.000005542414,0.0002100316,0.000057039873,0.00046596417,0.00005068795,0.00012266301,0.0000037926152,0.00028230893,0.00018515043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026812913,0.00008950009,1.4613398e-7,0.000010618514,0.00003690629,1.2037721e-7,0.000782048,0.9565493,0.01144123,0.005294893,0.000020155634,0.02574828],"study_design_scores_gemma":[0.0012402133,0.00010808117,0.00005361441,0.000165881,0.00014723552,0.000009517864,0.0011861192,0.9310308,0.06160966,0.0029746161,0.000486545,0.0009877067],"about_ca_topic_score_codex":0.000006280117,"about_ca_topic_score_gemma":0.000080476086,"teacher_disagreement_score":0.98944515,"about_ca_system_score_codex":0.00018445225,"about_ca_system_score_gemma":0.000012899612,"threshold_uncertainty_score":0.85648406},"labels":[],"label_agreement":null},{"id":"W2145605192","doi":"10.1109/tcomm.2011.020411.090488","title":"Tracking Nonlinear Noisy Dynamic Systems over Noisy Communication Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Target Tracking and Data Fusion in Sensor Networks","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 Ottawa","funders":"","keywords":"Bounded function; Nonlinear system; Tracking (education); Control theory (sociology); Lipschitz continuity; Computer science; Tracking error; Binary number; Transmission (telecommunications); SIGNAL (programming language); Channel (broadcasting); Stochastic process; Mathematics; Noise measurement; Algorithm; Telecommunications; Artificial intelligence; Mathematical analysis; Statistics; Physics","score_opus":0.054303057029064274,"score_gpt":0.2782233065486557,"score_spread":0.2239202495195914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145605192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022509957,0.00077440613,0.98896927,0.0006700501,0.0014830534,0.00044639656,0.00008776549,0.00082479476,0.0044932677],"genre_scores_gemma":[0.91593486,0.001596636,0.08149576,0.00020885644,0.000029654333,0.0001615777,0.0000491827,0.000042346943,0.0004810989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976165,0.0004783464,0.0006459982,0.00048078102,0.0003600864,0.00041822914],"domain_scores_gemma":[0.99218225,0.0005354034,0.00024298647,0.006610499,0.00025110808,0.00017776193],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005162783,0.0003014232,0.00029596765,0.0003309362,0.0013234724,0.0003188874,0.0045085764,0.00021093714,0.0000797207],"category_scores_gemma":[0.000012335882,0.0003151869,0.00018204955,0.00084955874,0.00023121262,0.0009812528,0.0000559323,0.00090230664,0.00028638696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032424834,0.017358897,0.00041186382,0.00032306937,0.0014924009,0.00005643934,0.05306303,0.19664273,0.006526608,0.18689801,0.010392158,0.52651054],"study_design_scores_gemma":[0.0006928965,0.0001327007,0.00052213337,0.00025807132,0.00006865523,0.00006326304,0.00031638896,0.97556454,0.0012579055,0.0009775633,0.019473156,0.00067272387],"about_ca_topic_score_codex":0.00048918964,"about_ca_topic_score_gemma":0.00023991743,"teacher_disagreement_score":0.9136839,"about_ca_system_score_codex":0.00011953352,"about_ca_system_score_gemma":0.00007007844,"threshold_uncertainty_score":0.9999767},"labels":[],"label_agreement":null},{"id":"W2145845506","doi":"10.1109/tcomm.2012.051412.110343","title":"Exact Analysis of Multihop Amplify-and-Forward Relaying Systems over General Fading Links","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Probability density function; Ergodic theory; Signal-to-noise ratio (imaging); Topology (electrical circuits); Channel (broadcasting); Outage probability; Computer science; Spread spectrum; Probability of error; Communications system; Fading distribution; Mathematics; Telecommunications; Algorithm; Rayleigh fading; Statistics; Mathematical analysis; Combinatorics","score_opus":0.06770129181002757,"score_gpt":0.32344586955251564,"score_spread":0.25574457774248804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145845506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024660131,0.0021587033,0.9705214,0.00051570096,0.0002890674,0.00022451293,0.000021983244,0.0001498098,0.0014587204],"genre_scores_gemma":[0.9771134,0.0043903627,0.018009476,0.00012970749,0.00002018892,0.00008723216,0.000012138509,0.00001406134,0.00022338411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830943,0.00048208327,0.00049504905,0.00022253592,0.00021382402,0.00027705083],"domain_scores_gemma":[0.99585456,0.0008059197,0.0001964334,0.0028357448,0.00015007138,0.00015728088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423371,0.00017567455,0.00033742544,0.0006077002,0.00077097985,0.00011472227,0.0014398922,0.0001482939,0.000027986362],"category_scores_gemma":[0.000015679574,0.00017759424,0.00018042655,0.0017239546,0.00011000558,0.00062908867,0.00005310785,0.0006593588,0.000013694996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045739744,0.0030447003,0.009515535,0.000101852944,0.0063235,0.0000010907195,0.030445652,0.33400488,0.022516638,0.32876816,0.0005683909,0.26466388],"study_design_scores_gemma":[0.00030669343,0.000032102533,0.0052898284,0.00005564882,0.00039254996,0.000004723853,0.00015789157,0.9862638,0.00067334104,0.000023750765,0.0065186233,0.00028102694],"about_ca_topic_score_codex":0.00010932315,"about_ca_topic_score_gemma":0.0001285155,"teacher_disagreement_score":0.9525119,"about_ca_system_score_codex":0.000094275514,"about_ca_system_score_gemma":0.000034296514,"threshold_uncertainty_score":0.7242083},"labels":[],"label_agreement":null},{"id":"W2147072043","doi":"10.1109/tcomm.2004.836596","title":"Distribution Functions of Selection Combiner Output in Equally Correlated Rayleigh, Rician, and Nakagami-<tex>$m$</tex>Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":273,"is_retracted":false,"has_abstract":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; Rayleigh fading; Fading; Fading distribution; Cumulative distribution function; Mathematics; Statistics; Signal-to-noise ratio (imaging); Channel capacity; Rayleigh distribution; Channel (broadcasting); Algorithm; Telecommunications; Probability density function; Computer science","score_opus":0.03565044146017216,"score_gpt":0.2724362698078587,"score_spread":0.23678582834768652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147072043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06371178,0.0014267856,0.9298294,0.0007438463,0.00044485804,0.00092825765,0.00034497082,0.0014325272,0.0011375765],"genre_scores_gemma":[0.97164196,0.004358768,0.021595387,0.00005578155,0.000027776267,0.00058990595,0.00084232877,0.00013454635,0.00075352873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99694175,0.00034397768,0.0012559432,0.00048667935,0.00039347832,0.0005781819],"domain_scores_gemma":[0.99564123,0.0006378532,0.00031952336,0.0027572077,0.00043844857,0.00020575995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004956311,0.00055849843,0.0006349688,0.0008435172,0.0009028986,0.00009286001,0.0010283047,0.0004778002,0.00008322329],"category_scores_gemma":[0.000083280014,0.0006808354,0.00022345809,0.0022082622,0.00042799694,0.0007060102,0.000041163017,0.0015019214,0.00014086916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011102168,0.0018143702,0.00016935817,0.0001444392,0.00035486798,6.1125024e-7,0.0026692697,0.9013223,0.067070946,0.004295379,0.0011400055,0.02090744],"study_design_scores_gemma":[0.023211781,0.0015169717,0.016697546,0.007973706,0.0028875386,0.0006001721,0.0015121253,0.17459801,0.1196595,0.026985772,0.61240155,0.011955356],"about_ca_topic_score_codex":0.00022843559,"about_ca_topic_score_gemma":0.0046537467,"teacher_disagreement_score":0.908234,"about_ca_system_score_codex":0.00090417964,"about_ca_system_score_gemma":0.00009852133,"threshold_uncertainty_score":0.9995643},"labels":[],"label_agreement":null},{"id":"W2147213649","doi":"10.1109/tcomm.2004.838739","title":"Parametric Construction of Nyquist-I Pulses","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":120,"is_retracted":false,"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 Alberta","funders":"","keywords":"Nyquist ISI criterion; Intersymbol interference; Pulse shaping; Raised-cosine filter; Nyquist–Shannon sampling theorem; Bandwidth (computing); Parametric statistics; Nyquist frequency; Mathematics; Nyquist stability criterion; Pulse (music); Frequency domain; Optics; Electronic engineering; Algorithm; Telecommunications; Computer science; Physics; Mathematical analysis; Engineering; Low-pass filter; Statistics","score_opus":0.021167871986279375,"score_gpt":0.23903445973199233,"score_spread":0.21786658774571296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147213649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09472414,0.0007100924,0.891042,0.00093640067,0.00051415066,0.00031187737,0.00005838904,0.0016597996,0.010043154],"genre_scores_gemma":[0.90561265,0.0018024222,0.09248367,0.0000093745575,0.000005556183,0.000051506868,0.00000286599,0.000017948687,0.000013993095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993999,0.000017714578,0.00025002737,0.0000890537,0.00010082944,0.000142475],"domain_scores_gemma":[0.99854195,0.00019384913,0.00002930925,0.001144481,0.00005443699,0.000035987458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051109142,0.00010620573,0.00014066177,0.00026928002,0.00012914209,0.0000131129755,0.00046738572,0.0001074764,0.000027067013],"category_scores_gemma":[0.00001230152,0.00011555378,0.00007424627,0.0008712357,0.00035182975,0.00009911962,0.0000027600204,0.00033369794,0.000051453873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009573235,0.00041385612,0.00002918659,0.000045618068,0.00014680266,6.6133885e-7,0.00011981877,0.82823336,0.002189203,0.058958866,0.00007296446,0.10978008],"study_design_scores_gemma":[0.0047485107,0.0011297659,0.0021983162,0.000751541,0.0007057223,0.00019002495,0.0026467782,0.20622128,0.63168126,0.13134673,0.015854472,0.0025255827],"about_ca_topic_score_codex":0.000022603695,"about_ca_topic_score_gemma":0.000052378375,"teacher_disagreement_score":0.8108885,"about_ca_system_score_codex":0.00009576831,"about_ca_system_score_gemma":0.00001839574,"threshold_uncertainty_score":0.47121465},"labels":[],"label_agreement":null},{"id":"W2147317567","doi":"10.1109/tcomm.2009.09.070577","title":"Antenna/relay selection for coded cooperative networks with AF relaying","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Relay; Computer science; Bit error rate; Selection (genetic algorithm); Transmission (telecommunications); Antenna (radio); Phase-shift keying; Relay channel; Electronic engineering; Reliability (semiconductor); Cooperative diversity; Telecommunications; Decoding methods; Topology (electrical circuits); Fading; Engineering; Power (physics); Electrical engineering","score_opus":0.04437427375651506,"score_gpt":0.2944433003551277,"score_spread":0.2500690265986127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147317567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039747954,0.00036688117,0.9890597,0.007602559,0.00014346968,0.00072603655,0.000007149379,0.0004436859,0.0012530744],"genre_scores_gemma":[0.89493805,0.0017989626,0.101135455,0.0011552863,0.000025493324,0.00029711222,0.000013606275,0.000019367977,0.0006166508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843276,0.00031686804,0.00036401453,0.00038514627,0.00017057099,0.0003306567],"domain_scores_gemma":[0.99648315,0.0005989099,0.00013700349,0.0021233244,0.0005372404,0.00012038793],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003520463,0.00024464919,0.0002393658,0.00020523241,0.002107071,0.00023810325,0.0017887772,0.00010604291,0.000016027128],"category_scores_gemma":[0.000013467703,0.00022617858,0.000112920505,0.0012591738,0.00012445751,0.0006144091,0.000012414306,0.0006253601,0.000017191542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024393626,0.0017081612,0.000036380323,0.000008670937,0.00025605332,0.0000011457179,0.0026943516,0.6536305,0.00575945,0.11590405,0.0015445639,0.21821275],"study_design_scores_gemma":[0.0009003004,0.00058649003,0.00013953583,0.00008616949,0.000034936744,0.000022269463,0.000070082635,0.991521,0.0014392625,0.00013772206,0.004737275,0.00032494953],"about_ca_topic_score_codex":0.000006723074,"about_ca_topic_score_gemma":0.0003502433,"teacher_disagreement_score":0.8945406,"about_ca_system_score_codex":0.00014298296,"about_ca_system_score_gemma":0.00012037577,"threshold_uncertainty_score":0.99919206},"labels":[],"label_agreement":null},{"id":"W2147600250","doi":"10.1109/tcomm.2013.072913.120881","title":"Opportunistic Spectrum Access Using Partially Overlapping Channels: Graphical Game and Uncoupled Learning","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Toronto Metropolitan University","funders":"","keywords":"Throughput; Computer science; Interference (communication); Potential game; Channel (broadcasting); Selection (genetic algorithm); Aggregate (composite); Convergence (economics); Heterogeneous network; Computer network; Game theory; Point (geometry); Distributed computing; Mathematical optimization; Wireless; Wireless network; Nash equilibrium; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.06002980338865202,"score_gpt":0.2928954113969637,"score_spread":0.23286560800831166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147600250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02810279,0.00012411138,0.96659964,0.003783111,0.00029495344,0.0003112557,0.0000025405081,0.00025026177,0.00053134176],"genre_scores_gemma":[0.9931109,0.0007572495,0.005693196,0.00024915984,0.000047577225,0.000038706043,0.0000031646757,0.000021731026,0.00007832286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984647,0.0002421329,0.0003316312,0.0003778345,0.00020719405,0.00037651675],"domain_scores_gemma":[0.9979618,0.00051460066,0.00012003434,0.0010965676,0.00010671482,0.00020029185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022557529,0.00020593955,0.000234257,0.00026404008,0.0010503279,0.00074899656,0.0009814369,0.00008593001,0.00004910626],"category_scores_gemma":[0.000014782829,0.00021911653,0.00010064682,0.0007169273,0.00021234501,0.0008750053,0.00004192155,0.0006726722,0.000019329127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071353024,0.002320593,0.0010627136,0.0001182848,0.0010100823,0.00007098095,0.0063582896,0.46612453,0.022918094,0.09368717,0.00025478425,0.40600312],"study_design_scores_gemma":[0.0002679201,0.000069168105,0.0007103398,0.00008460726,0.000035486526,0.000058969094,0.00006950841,0.99343467,0.00025278714,0.004362237,0.00038621647,0.00026809511],"about_ca_topic_score_codex":0.00033346243,"about_ca_topic_score_gemma":0.0003390358,"teacher_disagreement_score":0.9650081,"about_ca_system_score_codex":0.00007276711,"about_ca_system_score_gemma":0.000088421,"threshold_uncertainty_score":0.89353126},"labels":[],"label_agreement":null},{"id":"W2147646614","doi":"10.1109/tcomm.2009.09.080077","title":"Data detection and kalman estimation for multiple space-time trellis codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Trellis (graph); Kalman filter; Algorithm; Fading; Computer science; Convolutional code; Channel (broadcasting); Maximum a posteriori estimation; Sequential estimation; Space–time trellis code; Mathematics; Decoding methods; Statistics; Maximum likelihood; Artificial intelligence; Telecommunications; Block code; Concatenated error correction code","score_opus":0.04166796513633517,"score_gpt":0.2989855706011391,"score_spread":0.257317605464804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147646614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001249962,0.00039452608,0.9946585,0.00087429734,0.00005063874,0.0005972327,0.00037121613,0.0012245425,0.00057904643],"genre_scores_gemma":[0.8176256,0.002072592,0.1797972,0.000038501625,0.000008797892,0.00019364001,0.00015151824,0.000032027794,0.00008013502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919045,0.000061009225,0.00028779704,0.00020524797,0.000091108275,0.00016436269],"domain_scores_gemma":[0.996172,0.0005631432,0.000057948164,0.0030697756,0.000070567636,0.000066560395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016696026,0.00017477538,0.00017561016,0.0001931948,0.00051546784,0.00005166868,0.0009160062,0.00010637597,0.000007717226],"category_scores_gemma":[0.000024612345,0.00020641573,0.000045410965,0.00025051378,0.00009891893,0.00051441876,0.000008205823,0.0002879495,0.000017404744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039555704,0.00032142643,0.0000021874475,0.00003697465,0.000074572665,1.12663216e-7,0.00033284805,0.091529995,0.06532588,0.0008128331,0.0005562208,0.8409674],"study_design_scores_gemma":[0.0003151416,0.000078813464,0.00007715408,0.00003835087,0.00004525586,0.000004589973,0.000029843564,0.93889844,0.0499682,0.00196128,0.008371534,0.0002114144],"about_ca_topic_score_codex":0.000013930888,"about_ca_topic_score_gemma":0.0002361612,"teacher_disagreement_score":0.8473684,"about_ca_system_score_codex":0.00008561459,"about_ca_system_score_gemma":0.000011309388,"threshold_uncertainty_score":0.8417389},"labels":[],"label_agreement":null},{"id":"W2148095386","doi":"10.1109/tcomm.2004.838718","title":"A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":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; Decoding methods; Algorithm; Noisy-channel coding theorem; Additive white Gaussian noise; Gaussian; Mathematics; Computer science; Variable (mathematics); Turbo code; Limit (mathematics); Code (set theory); Range (aeronautics); Node (physics); Convergence (economics); Random variable; White noise; Statistics; Error floor","score_opus":0.05692893816505234,"score_gpt":0.3093812915881105,"score_spread":0.25245235342305816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148095386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058520595,0.00013715537,0.99094045,0.0023532396,0.000046563706,0.00023826551,0.000014920975,0.00033715207,0.00008022114],"genre_scores_gemma":[0.61666816,0.00011661867,0.38305694,0.000072960494,0.0000016305422,0.000051105886,0.00000194181,0.0000069500225,0.000023684897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881834,0.00019040277,0.00031927106,0.0002759822,0.00023787639,0.00015813265],"domain_scores_gemma":[0.9968283,0.00048488344,0.00014161614,0.0022799238,0.00019071737,0.00007455812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034502888,0.00014327161,0.0002480489,0.00051267724,0.00039348172,0.000052507025,0.0012944846,0.00007671348,0.0000066646394],"category_scores_gemma":[0.000014111057,0.00015263622,0.00012756046,0.0015121793,0.00024031731,0.00031588355,0.00002371923,0.00027781446,0.0000058037363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008214979,0.003810234,0.00017321641,0.00005314358,0.0024845272,0.000006668573,0.009080789,0.8250483,0.074794896,0.033279203,0.0001042844,0.051082555],"study_design_scores_gemma":[0.0011262508,0.0005118674,0.00326579,0.0002575704,0.0011508801,0.0000519063,0.00019660106,0.6472129,0.32119825,0.02407008,0.000116918374,0.0008409943],"about_ca_topic_score_codex":0.00031817897,"about_ca_topic_score_gemma":0.00028699334,"teacher_disagreement_score":0.6108161,"about_ca_system_score_codex":0.00006992793,"about_ca_system_score_gemma":0.000110314555,"threshold_uncertainty_score":0.6224324},"labels":[],"label_agreement":null},{"id":"W2148795300","doi":"10.1109/tcomm.2009.12.0701392","title":"The BER optimal linear rake receiver for signal detection in symmetric alpha-stable noise","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"Rake receiver; Bit error rate; Noise (video); Rake; Signal-to-noise ratio (imaging); Detection theory; Mathematics; SIGNAL (programming language); Algorithm; Computer science; Electronic engineering; Control theory (sociology); Fading; Telecommunications; Statistics; Engineering; Decoding methods","score_opus":0.024432725713716744,"score_gpt":0.2647302186608785,"score_spread":0.24029749294716174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148795300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015835188,0.0025129633,0.9701824,0.0030865395,0.00046895343,0.0012083229,0.0001242063,0.0005524762,0.006028936],"genre_scores_gemma":[0.9854714,0.0039875507,0.009526391,0.00008106501,0.000027308486,0.0004109636,0.000017266964,0.000034146375,0.00044389084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988885,0.000106819636,0.0004127037,0.00015794627,0.00012447819,0.00030954866],"domain_scores_gemma":[0.997061,0.000857306,0.000048550533,0.0018356456,0.000119927674,0.00007754445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037820937,0.0001845806,0.00016616365,0.00033678606,0.0008823266,0.00006375404,0.0009632192,0.000111996436,0.000021392536],"category_scores_gemma":[0.000018188155,0.00017291983,0.00014294054,0.0010026427,0.00008531025,0.00023190331,0.0000047059425,0.0005785054,0.000042569445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016430861,0.0010806673,0.000007975768,0.00002010738,0.00013761607,6.1304405e-7,0.00072623935,0.4836355,0.011893185,0.0016010223,0.0009361607,0.49979663],"study_design_scores_gemma":[0.001130073,0.00019437908,0.00073002646,0.000049933988,0.00006799348,0.000007237153,0.00015642554,0.86502475,0.02333278,0.0006513678,0.10826397,0.00039106712],"about_ca_topic_score_codex":0.000042966374,"about_ca_topic_score_gemma":0.00069007115,"teacher_disagreement_score":0.9696362,"about_ca_system_score_codex":0.00017706375,"about_ca_system_score_gemma":0.00003293485,"threshold_uncertainty_score":0.7051466},"labels":[],"label_agreement":null},{"id":"W2148920021","doi":"10.1109/tcomm.2010.01.070632","title":"Multiple description quantizer design for multiple-antenna systems with MAP detection","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Qualcomm (Canada); Queen's University","funders":"","keywords":"Transmitter; Algorithm; Maximum a posteriori estimation; Detector; Phase-shift keying; Computer science; Rayleigh fading; Block code; Keying; Decoding methods; Coding (social sciences); Channel (broadcasting); Electronic engineering; Mathematics; Theoretical computer science; Fading; Telecommunications; Bit error rate; Engineering","score_opus":0.048979690092596284,"score_gpt":0.26207504738492987,"score_spread":0.2130953572923336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148920021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039782817,0.00017550323,0.99138093,0.00015508261,0.000596599,0.0016085169,0.00008432893,0.0019219433,0.000098788296],"genre_scores_gemma":[0.83773035,0.00037333896,0.1587099,0.000016433929,0.000022364293,0.002910773,0.000027031303,0.00010084538,0.000108965556],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987698,0.00012402213,0.00042186488,0.00023494886,0.00016171802,0.00028761092],"domain_scores_gemma":[0.9958137,0.0011000446,0.00010283093,0.0026339514,0.00024876915,0.00010069729],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027820596,0.00027641142,0.00024269038,0.00028945116,0.00072376797,0.00009835471,0.0008830026,0.00017198472,0.000007163488],"category_scores_gemma":[0.00002630595,0.00028063531,0.00010671647,0.00033772402,0.00018764408,0.00046562724,0.000004892198,0.00082311797,0.000036121757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020726692,0.0004805534,0.00004409515,0.00012108067,0.00018730706,4.592817e-7,0.00040247265,0.33291677,0.636628,0.00076888443,0.00016407513,0.028079087],"study_design_scores_gemma":[0.0007162348,0.0001279047,0.000051773313,0.00007367488,0.0000550897,0.0000180651,0.00017951132,0.861854,0.1299042,0.00014770086,0.0065221665,0.00034965758],"about_ca_topic_score_codex":0.00008336333,"about_ca_topic_score_gemma":0.0017829259,"teacher_disagreement_score":0.83375204,"about_ca_system_score_codex":0.00012857061,"about_ca_system_score_gemma":0.000028825269,"threshold_uncertainty_score":0.9999646},"labels":[],"label_agreement":null},{"id":"W2148972467","doi":"10.1109/tcomm.2011.011811.090548","title":"Linear Precoding for Orthogonal Space-Time Block Coded MIMO-OFDM Cognitive Radio","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Université du Québec à Montréal","funders":"","keywords":"Precoding; Orthogonal frequency-division multiplexing; MIMO; Transmitter; Subcarrier; Cognitive radio; MIMO-OFDM; Transmitter power output; Rayleigh fading; Computer science; Convex optimization; Algorithm; Mathematics; Electronic engineering; Control theory (sociology); Fading; Telecommunications; Beamforming; Wireless; Engineering; Regular polygon; Decoding methods; Channel (broadcasting)","score_opus":0.05589669650676737,"score_gpt":0.28413643639808667,"score_spread":0.2282397398913193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148972467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030014368,0.0003035657,0.9867953,0.00025825956,0.00013665832,0.000971618,0.00036246012,0.0016754286,0.0064952914],"genre_scores_gemma":[0.86491925,0.0013287906,0.1319325,0.000043631087,0.000019074736,0.0011581599,0.00005398332,0.00009700861,0.000447631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879533,0.00011172018,0.0004365857,0.00022413529,0.00013059383,0.00030161339],"domain_scores_gemma":[0.99704546,0.000669421,0.00009168476,0.0018478393,0.00022635935,0.00011922582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018161883,0.0002701825,0.00027842593,0.00025923835,0.0005578826,0.000022957576,0.0010154812,0.00016157277,0.00013156996],"category_scores_gemma":[0.000020577017,0.00032199558,0.00018977406,0.00035250525,0.00021494624,0.00029005948,0.000010512758,0.0005692545,0.0001358824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014878245,0.010159738,0.00012947389,0.0008612614,0.005214234,0.000008397018,0.03435057,0.22685128,0.20916587,0.025929295,0.0069815423,0.4788605],"study_design_scores_gemma":[0.0016659105,0.00028955867,0.00010390892,0.00038966862,0.0003083452,0.000029224435,0.00048099153,0.5779212,0.40386662,0.0023431245,0.011460709,0.0011407221],"about_ca_topic_score_codex":0.000015706893,"about_ca_topic_score_gemma":0.000077906436,"teacher_disagreement_score":0.8619178,"about_ca_system_score_codex":0.00012050632,"about_ca_system_score_gemma":0.000041645642,"threshold_uncertainty_score":0.9999232},"labels":[],"label_agreement":null},{"id":"W2149024062","doi":"10.1109/tcomm.2013.022713.120129","title":"Relay Beamforming Designs in Multi-User Wireless Relay Networks Based on Throughput Maximin Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Beamforming; Relay; Mathematical optimization; Computer science; Optimization problem; Wireless; Computational complexity theory; Convex optimization; Minimax; Wireless network; Algorithm; Mathematics; Regular polygon; Telecommunications","score_opus":0.08093831440962014,"score_gpt":0.2975022704308457,"score_spread":0.21656395602122558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149024062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041770856,0.0001562437,0.99158335,0.005071633,0.0002566014,0.0008297016,0.0000038074033,0.00032727496,0.0013536658],"genre_scores_gemma":[0.69408727,0.0015987651,0.30220953,0.000997351,0.0000102172135,0.0005907227,0.000016296222,0.00003301083,0.00045684143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974898,0.0007426229,0.0006243554,0.00046734567,0.00026257226,0.00041330853],"domain_scores_gemma":[0.9944469,0.0009919067,0.0001773378,0.0039936393,0.0002481677,0.00014206606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050808967,0.0003057033,0.00027381652,0.00044152688,0.0010899322,0.0002711071,0.0027578464,0.00019077261,0.00012947772],"category_scores_gemma":[0.00002121394,0.0003173599,0.00013575531,0.0015379323,0.00015640854,0.0009532352,0.000044368768,0.0010242639,0.00013143751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073558786,0.0006320447,0.000033987046,0.0000030961621,0.000014141507,5.887329e-7,0.00047328937,0.96165276,0.00009701541,0.0022344552,0.00014869479,0.03470256],"study_design_scores_gemma":[0.0007995874,0.00009140409,0.00026827832,0.00016197779,0.00001119271,0.000002927738,0.000067306304,0.99666035,0.00039937109,0.000025799643,0.0011784788,0.00033332457],"about_ca_topic_score_codex":0.00008364786,"about_ca_topic_score_gemma":0.0005022457,"teacher_disagreement_score":0.69366956,"about_ca_system_score_codex":0.00028824375,"about_ca_system_score_gemma":0.00011689848,"threshold_uncertainty_score":0.9999278},"labels":[],"label_agreement":null},{"id":"W2149332137","doi":"10.1109/26.950349","title":"Nonlinear group-blind multiuser detection","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"","keywords":"Multiuser detection; Subspace topology; Telecommunications link; Interference (communication); Algorithm; Single antenna interference cancellation; Nonlinear system; Mathematics; Computational complexity theory; Detector; Computer science; Control theory (sociology); Mathematical optimization; Artificial intelligence; Telecommunications; Decoding methods","score_opus":0.06638866280194984,"score_gpt":0.3262858007003942,"score_spread":0.2598971378984444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149332137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030996227,0.00020219179,0.9869941,0.0047100857,0.0002912785,0.00043589063,0.0000075918456,0.0005931335,0.0036661432],"genre_scores_gemma":[0.9171877,0.0026419477,0.07868989,0.00026151843,0.000037443577,0.00033836832,0.0000093715535,0.000030681345,0.0008030689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782056,0.0005180668,0.0004314099,0.0003982047,0.00043272934,0.00039900542],"domain_scores_gemma":[0.9922398,0.0007429158,0.00011187779,0.0064465124,0.00026789392,0.00019103893],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004890834,0.0002124666,0.00018622246,0.00044156614,0.0013026142,0.00025023514,0.004806752,0.00015390229,0.00006468036],"category_scores_gemma":[0.000016205493,0.0002273908,0.00015825851,0.0017864914,0.00022037236,0.0008199119,0.000058675236,0.0010022414,0.000560763],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012510779,0.0032926833,0.00005237688,0.000011765045,0.00015684498,0.000006412198,0.001047454,0.017141351,0.007238095,0.005737646,0.000316729,0.96487355],"study_design_scores_gemma":[0.0012091603,0.00016056231,0.00028912508,0.000036703157,0.000016838205,0.00005239414,0.0000743615,0.92232585,0.005694531,0.0005419158,0.06922154,0.00037703375],"about_ca_topic_score_codex":0.00015018565,"about_ca_topic_score_gemma":0.0014427532,"teacher_disagreement_score":0.9644965,"about_ca_system_score_codex":0.00016916188,"about_ca_system_score_gemma":0.000071618415,"threshold_uncertainty_score":0.99999756},"labels":[],"label_agreement":null},{"id":"W2149333620","doi":"10.1109/tcomm.2004.842001","title":"A New Choice of Penalty Function for Robust Multiuser Detection Based on<tex>$M$</tex>-Estimation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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 Toronto","funders":"","keywords":"Minimax; Detector; Gaussian noise; Algorithm; Noise (video); Gaussian; Multiuser detection; Parametric statistics; Mathematics; Function (biology); Control theory (sociology); Mathematical optimization; Computer science; Applied mathematics; Statistics; Telecommunications; Physics; Artificial intelligence","score_opus":0.06852001951557384,"score_gpt":0.29668751881170075,"score_spread":0.2281674992961269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149333620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064919777,0.0006649513,0.9862018,0.0016322345,0.0005856311,0.0011837266,0.0003173655,0.0008303572,0.0020919244],"genre_scores_gemma":[0.758111,0.0005225504,0.23818004,0.00015330428,0.00011568443,0.00069012947,0.00042342948,0.00013560825,0.0016682803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727184,0.00026425594,0.0010816061,0.0004551579,0.00042704382,0.00050009805],"domain_scores_gemma":[0.9926512,0.0014830662,0.0002907476,0.00484563,0.00044921567,0.0002801216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005215118,0.000533588,0.00048871577,0.00079310266,0.0010414057,0.00011028852,0.0012699236,0.00035574604,0.00049347343],"category_scores_gemma":[0.00013400751,0.0006098984,0.00044478563,0.0011356246,0.00015243774,0.0006286169,0.00001737369,0.0008899841,0.00045873522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015677993,0.0008863298,0.000010353279,0.000076509736,0.00017016106,2.7285902e-8,0.00038344954,0.8761363,0.02055061,0.00012117563,0.0035940937,0.09791422],"study_design_scores_gemma":[0.00220367,0.00015408944,0.00083418214,0.0002564382,0.00047702965,0.0000060472407,0.000022253813,0.5583744,0.0045326427,0.00011829554,0.43230245,0.0007185071],"about_ca_topic_score_codex":0.00021164407,"about_ca_topic_score_gemma":0.018661968,"teacher_disagreement_score":0.751619,"about_ca_system_score_codex":0.00047390282,"about_ca_system_score_gemma":0.00014832465,"threshold_uncertainty_score":0.9996352},"labels":[],"label_agreement":null},{"id":"W2149719491","doi":"10.1109/tcomm.2010.04.080345","title":"An analytical method for calculating the bit error rate performance of rake reception in UWB multipath fading channels","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Fading; Multipath propagation; Bit error rate; Rake receiver; Additive white Gaussian noise; Computer science; Rake; Electronic engineering; Bandwidth (computing); Algorithm; Multipath interference; Ultra-wideband; Delay spread; Gaussian noise; Channel (broadcasting); Telecommunications; Engineering; Decoding methods","score_opus":0.044655320033360014,"score_gpt":0.3332573940208434,"score_spread":0.2886020739874834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149719491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3783654,0.000033396744,0.6194655,0.0008689664,0.00020173316,0.0005157032,0.000035061865,0.0002446522,0.00026962865],"genre_scores_gemma":[0.9221649,0.00019217588,0.07694505,0.000024594827,0.000012347201,0.0005756655,0.000019414503,0.00003648736,0.000029369283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988427,0.00018574731,0.0004835613,0.00016611606,0.0000859873,0.00023586242],"domain_scores_gemma":[0.996244,0.0010224981,0.0000792959,0.0024937643,0.00011315578,0.000047292542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223362,0.00016121169,0.00021962254,0.00033909534,0.00043175282,0.000025542658,0.0012332903,0.00018721739,0.00002324456],"category_scores_gemma":[0.000041596402,0.00014905087,0.00010226497,0.0006876848,0.00018979343,0.00021994079,0.0000066796115,0.0009564509,0.000007183078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003445956,0.00043684323,0.00022689273,0.000044921097,0.00008187969,8.309968e-8,0.0022346273,0.70461965,0.19096911,0.002180435,0.000017517044,0.09915357],"study_design_scores_gemma":[0.0003492799,0.00006718111,0.0006505462,0.00003660297,0.000043000022,0.0000048072447,0.0003188299,0.9658079,0.0316771,0.00018460974,0.0007069665,0.0001531506],"about_ca_topic_score_codex":0.00008412964,"about_ca_topic_score_gemma":0.0014100686,"teacher_disagreement_score":0.54379946,"about_ca_system_score_codex":0.00006118208,"about_ca_system_score_gemma":0.000028781253,"threshold_uncertainty_score":0.60781187},"labels":[],"label_agreement":null},{"id":"W2150513644","doi":"10.1109/tcomm.2012.051012.100594","title":"Performance Analysis of Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Beamforming; Relay; Moment-generating function; MIMO; Fading; Cumulative distribution function; Computer science; Bit error rate; Diversity gain; Electronic engineering; Probability density function; Control theory (sociology); Topology (electrical circuits); Algorithm; Channel (broadcasting); Telecommunications; Mathematics; Engineering; Statistics; Electrical engineering","score_opus":0.050222495464122385,"score_gpt":0.30027585539856294,"score_spread":0.25005335993444056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150513644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072539477,0.0015211455,0.9875236,0.0013849472,0.0003019044,0.00039740544,0.000041032876,0.00016032082,0.0014156748],"genre_scores_gemma":[0.9421089,0.0073061064,0.04941545,0.00025198332,0.00002549379,0.00029423714,0.000051096424,0.000021222604,0.0005254971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998212,0.00026943913,0.00061079295,0.0002641677,0.0002206401,0.00042299667],"domain_scores_gemma":[0.994577,0.0010619037,0.0002613546,0.0036334095,0.00030482613,0.00016151369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008137524,0.00022561439,0.00037446962,0.00047748932,0.001223021,0.00007589609,0.0021076258,0.00012244357,0.000043718523],"category_scores_gemma":[0.000017046406,0.00023454698,0.00032759443,0.0025364903,0.00017528012,0.0008765489,0.00005219972,0.0004558135,0.000014931588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009465564,0.0036384102,0.0012773366,0.00006385035,0.0031986444,1.8186108e-7,0.0114250695,0.53143966,0.007610806,0.022164876,0.0057395063,0.413347],"study_design_scores_gemma":[0.00037036347,0.00008677829,0.00043365936,0.000049261802,0.00038941164,0.000002606157,0.0001162412,0.9741441,0.002454912,0.000012280312,0.02163966,0.00030071568],"about_ca_topic_score_codex":0.000016476282,"about_ca_topic_score_gemma":0.00015008597,"teacher_disagreement_score":0.93810815,"about_ca_system_score_codex":0.00011346787,"about_ca_system_score_gemma":0.000056528435,"threshold_uncertainty_score":0.9564549},"labels":[],"label_agreement":null},{"id":"W2150673229","doi":"10.1109/tcomm.2009.06.070334","title":"Performance degradation of source matching in optical CDMA due to source coherence effects","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","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":"Coherence (philosophical gambling strategy); Computer science; Bit error rate; Coherence time; Electronic engineering; Binary number; Channel (broadcasting); Code division multiple access; Source code; Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.012011184077959428,"score_gpt":0.22656550522105787,"score_spread":0.21455432114309844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150673229","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5486299,0.000041897838,0.4493532,0.00011782838,0.00007989451,0.0002210691,0.000003003192,0.00012401534,0.0014292253],"genre_scores_gemma":[0.99693877,0.00004700775,0.002721474,0.00004135166,0.000006386422,0.000079401034,0.0000031423565,0.000016711761,0.00014574536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992012,0.000096905984,0.000299567,0.00011289131,0.000118914206,0.0001705419],"domain_scores_gemma":[0.99875295,0.00027605152,0.000030162557,0.00084202795,0.00003018711,0.000068645095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020321191,0.0001278432,0.0001865137,0.00022263234,0.000150471,0.000018052302,0.00045656163,0.0000739292,0.000007841272],"category_scores_gemma":[0.000005183198,0.00014216853,0.000057758203,0.00049594353,0.00004364949,0.00014330039,0.0000020907733,0.00031820883,0.00004143816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028274791,0.0002839915,0.00006330981,0.00009254542,0.00002656511,6.622003e-7,0.0024067252,0.8199493,0.036883626,0.0009961192,0.000020265374,0.13924861],"study_design_scores_gemma":[0.0021802187,0.000996823,0.027529223,0.0023940268,0.00015889622,0.00009991377,0.0020144947,0.58355135,0.37561256,0.0018123109,0.002170216,0.0014799408],"about_ca_topic_score_codex":0.000028023536,"about_ca_topic_score_gemma":0.00007710635,"teacher_disagreement_score":0.4483089,"about_ca_system_score_codex":0.000054174936,"about_ca_system_score_gemma":0.000011309311,"threshold_uncertainty_score":0.5797465},"labels":[],"label_agreement":null},{"id":"W2151198875","doi":"10.1109/tcomm.2011.083011.100771","title":"Efficient Network Protection Design Models using Pre-Cross-Connected Trails","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Scalability; Survivability; Computer science; Column generation; Redundancy (engineering); Distributed computing; Simple (philosophy); Network planning and design; Computation; Key (lock); Computer network; Mathematical optimization; Algorithm; Mathematics","score_opus":0.12180800975309011,"score_gpt":0.2823235851989959,"score_spread":0.1605155754459058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151198875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017171891,0.0002141436,0.97837865,0.000024881154,0.0002747072,0.0007986475,0.000012282533,0.0021185682,0.0010062184],"genre_scores_gemma":[0.7004958,0.00013152199,0.29898965,0.000008790572,0.000013563181,0.0002883929,0.0000013196512,0.000045970424,0.000025038566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988215,0.000086852415,0.0003588379,0.00021533085,0.00012801947,0.00038943958],"domain_scores_gemma":[0.9980802,0.00018084001,0.000049537088,0.0015272469,0.00008941757,0.00007278698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016455127,0.0002264727,0.00019089015,0.00013956247,0.0005477856,0.000033615877,0.0006593592,0.00020540641,0.000037933078],"category_scores_gemma":[0.000008191826,0.00024689478,0.00009370156,0.0007157972,0.0002591836,0.00017345879,0.0000066185207,0.00066437584,0.000022963653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026478903,0.00012794166,9.183512e-7,0.000007947217,0.000049708087,3.81968e-7,0.00026622717,0.98937595,0.0016480335,0.0006638161,0.000007607382,0.0078249695],"study_design_scores_gemma":[0.00020592441,0.00006291724,0.00006262875,0.00005343396,0.000041722928,0.000008909248,0.00003825259,0.9885119,0.005653392,0.005078087,0.000032705477,0.0002501052],"about_ca_topic_score_codex":0.000025552898,"about_ca_topic_score_gemma":0.000028592163,"teacher_disagreement_score":0.68332386,"about_ca_system_score_codex":0.00017359565,"about_ca_system_score_gemma":0.000021375665,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W2151258080","doi":"10.1109/tcomm.2003.813179","title":"On diagonal algebraic space-time block codes","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Block code; Diagonal; Algebraic number; Mathematics; Coding (social sciences); Decoding methods; Algorithm; Block matrix; Block (permutation group theory); Space–time block code; Discrete mathematics; Combinatorics; Mathematical analysis; Geometry; Statistics; Eigenvalues and eigenvectors; Physics","score_opus":0.015753382618571062,"score_gpt":0.2503578648488415,"score_spread":0.23460448223027042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151258080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00870893,0.0007099607,0.92622966,0.0011835857,0.00024497425,0.0006701453,0.00014436051,0.0033574493,0.058750954],"genre_scores_gemma":[0.96657443,0.0019893309,0.030068979,0.00013400488,0.0000066767902,0.00039573258,0.000016809374,0.00008017414,0.0007338579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988167,0.00020573495,0.00033138742,0.00019007915,0.00019103558,0.0002650062],"domain_scores_gemma":[0.99573755,0.0008606381,0.000051533054,0.0031592483,0.000077648125,0.00011339274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015832101,0.0002558063,0.00022550572,0.00026595523,0.000499531,0.0000402542,0.0009929008,0.00013217385,0.0002465447],"category_scores_gemma":[0.000021419088,0.00029279807,0.00012978307,0.00045792325,0.00019275013,0.00017455907,0.0000046257364,0.00072613626,0.0006034755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044159242,0.0024434282,0.000014672621,0.00006593584,0.0005174811,0.0000030380336,0.001075882,0.7012203,0.04568342,0.2026232,0.008222007,0.038086507],"study_design_scores_gemma":[0.0017552811,0.0004278336,0.00014009335,0.0004100017,0.00018441767,0.00006786166,0.00021884192,0.14813718,0.639848,0.047375813,0.15916783,0.0022668368],"about_ca_topic_score_codex":0.0000081556855,"about_ca_topic_score_gemma":0.00004820254,"teacher_disagreement_score":0.9578655,"about_ca_system_score_codex":0.00017775835,"about_ca_system_score_gemma":0.000034088724,"threshold_uncertainty_score":0.99995244},"labels":[],"label_agreement":null},{"id":"W2151308565","doi":"10.1109/tcomm.2007.896040","title":"Performance of Two Dual-Branch Postdetection Switch-and-Stay Combining Schemes in Correlated Rayleigh and Rician Fading","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Frequency-shift keying; Rayleigh fading; Fading; Phase-shift keying; Bit error rate; Mathematics; Keying; Fading distribution; Electronic engineering; Statistics; Computer science; Telecommunications; Engineering; Channel (broadcasting); Demodulation; Decoding methods","score_opus":0.01631804951401708,"score_gpt":0.2691363877751058,"score_spread":0.2528183382610887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151308565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66734403,0.00074792805,0.32982785,0.00008054641,0.00006418923,0.00025814187,0.0000075017942,0.00038802697,0.0012817745],"genre_scores_gemma":[0.9794095,0.0052086124,0.015233983,0.00001683587,0.0000034662878,0.000058052523,0.000006879049,0.000037207425,0.00002544239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990108,0.000059966856,0.0004704151,0.00013993423,0.00010546897,0.00021342997],"domain_scores_gemma":[0.9984102,0.00042105865,0.00008577528,0.0009579652,0.000062766485,0.00006219262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000377101,0.00016433041,0.00021391097,0.0004711984,0.00028101253,0.000015654527,0.00028433072,0.000107222164,0.00000870865],"category_scores_gemma":[0.0000078854755,0.00019761093,0.000034323173,0.00053429406,0.00017463841,0.00030849356,0.000011569589,0.000642972,0.0000028696786],"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.00017954114,0.0007441512,0.010405267,0.00025728226,0.00024849374,0.0000020702003,0.0064646658,0.120973736,0.29872298,0.003728956,0.00001980146,0.55825305],"study_design_scores_gemma":[0.0020626378,0.0002147399,0.010692701,0.000604762,0.00007298445,0.000052969026,0.00077559816,0.49363545,0.4895058,0.0007334892,0.0009429231,0.0007059737],"about_ca_topic_score_codex":0.00005334543,"about_ca_topic_score_gemma":0.00044043965,"teacher_disagreement_score":0.5575471,"about_ca_system_score_codex":0.000118411146,"about_ca_system_score_gemma":0.000011868902,"threshold_uncertainty_score":0.805834},"labels":[],"label_agreement":null},{"id":"W2151575149","doi":"10.1109/tcomm.2004.831359","title":"Error Performance Analysis of a Jointly Optimal Single-Cochannel-Interferer BPSK Receiver","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Keying; Signal-to-noise ratio (imaging); Bit error rate; Computer science; SIGNAL (programming language); Binary number; Algorithm; Electronic engineering; Amplitude and phase-shift keying; Phase (matter); Noise (video); Gaussian noise; White noise; Mathematics; Telecommunications; Decoding methods; Physics; Engineering; Arithmetic","score_opus":0.04052935710068363,"score_gpt":0.26904716124103506,"score_spread":0.22851780414035144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151575149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08456798,0.0002247103,0.9106279,0.0003091003,0.00009080036,0.00024536697,0.00010033876,0.0007513929,0.0030824253],"genre_scores_gemma":[0.9493198,0.0014862783,0.04880157,0.00003669525,0.000004714983,0.00017358453,0.0000371967,0.000046514073,0.000093646566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988637,0.00006717025,0.0005139116,0.00017304141,0.00016981167,0.00021237199],"domain_scores_gemma":[0.9967477,0.00016783996,0.000098884666,0.0027557174,0.00015675016,0.00007312271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001242733,0.00021330913,0.00034641798,0.0007330543,0.0002446849,0.000020168545,0.0011239821,0.00012748339,0.000093778195],"category_scores_gemma":[0.0000056440963,0.00024273066,0.00021923546,0.0014168877,0.00022916535,0.0003198973,0.000010918783,0.0005465071,0.00003666873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013446023,0.00037002805,0.000008972327,0.000019476074,0.00053496624,1.3452201e-7,0.0009748841,0.9763016,0.012599716,0.0003201194,0.000020812728,0.008835841],"study_design_scores_gemma":[0.00094010046,0.00036036907,0.0009826374,0.00031435778,0.0012005368,0.000008038893,0.00064771663,0.46468973,0.5272604,0.00031206402,0.0024414018,0.0008426059],"about_ca_topic_score_codex":0.000039619303,"about_ca_topic_score_gemma":0.00024370913,"teacher_disagreement_score":0.8647518,"about_ca_system_score_codex":0.00025574048,"about_ca_system_score_gemma":0.000026752457,"threshold_uncertainty_score":0.9898269},"labels":[],"label_agreement":null},{"id":"W2151666308","doi":"10.1109/tcomm.2009.04.070065","title":"Envelope and phase distribution of two correlated gaussian variables","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Radio Frequency Integrated Circuit Design","field":"Engineering","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":"Mathematics; Additive white Gaussian noise; Gaussian noise; Probability density function; Phase-shift keying; Gaussian; Statistics; Random variable; Amplitude; Bit error rate; Quadrature amplitude modulation; Series (stratigraphy); Closed-form expression; White noise; Statistical physics; Mathematical analysis; Physics; Algorithm; Quantum mechanics","score_opus":0.023926949229493368,"score_gpt":0.27215533459423347,"score_spread":0.2482283853647401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151666308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011893583,0.0005690953,0.9721813,0.00034393015,0.00017592551,0.00025543693,0.00026793365,0.00038359052,0.01392918],"genre_scores_gemma":[0.997822,0.0010614733,0.00091965747,0.000022286065,0.0000054658303,0.000030157289,0.000066651,0.000015916961,0.000056423632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927485,0.000070412665,0.00030495788,0.00011085713,0.000089883004,0.00014904028],"domain_scores_gemma":[0.9989384,0.0001285669,0.000039766255,0.00075459917,0.000065534216,0.00007316019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010861833,0.00013911113,0.00016192444,0.000111351845,0.00018110157,0.000022057153,0.0002946646,0.00008758572,0.00004232825],"category_scores_gemma":[0.0000060692064,0.00014956928,0.000046684116,0.000440594,0.00011264814,0.00015869827,2.135042e-7,0.00036056057,0.00001495825],"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.000056320263,0.0021284104,0.000023415454,0.00005580542,0.0004896197,0.0000058050073,0.0016116789,0.17328547,0.38702926,0.03917998,0.0019237491,0.3942105],"study_design_scores_gemma":[0.005204845,0.00076244323,0.0009942484,0.0004505227,0.0005243892,0.00014319131,0.00031311295,0.49420398,0.4795806,0.01112717,0.0055878186,0.0011076643],"about_ca_topic_score_codex":0.00004677725,"about_ca_topic_score_gemma":0.0000241687,"teacher_disagreement_score":0.98592836,"about_ca_system_score_codex":0.00009965521,"about_ca_system_score_gemma":0.00003109267,"threshold_uncertainty_score":0.60992587},"labels":[],"label_agreement":null},{"id":"W2152382476","doi":"10.1109/tcomm.2009.10.080005","title":"Comments on successive relaxation for decoding of LDPC codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Algorithm; Decoding methods; Additive white Gaussian noise; Code word; Belief propagation; Binary number; Relaxation (psychology); Computer science; Bit error rate; Mathematics; Frequency domain; Channel (broadcasting); Arithmetic; Telecommunications","score_opus":0.054695428228613424,"score_gpt":0.3447178290045503,"score_spread":0.2900224007759369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152382476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001972184,0.000031177857,0.98991466,0.004892463,0.00019225256,0.0004494561,0.000021569102,0.0003951817,0.0021310644],"genre_scores_gemma":[0.8328992,0.00008593496,0.16639349,0.00040462991,0.0000061814453,0.00011108734,0.000005487536,0.0000089320265,0.000085044725],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989532,0.00013468013,0.00034385922,0.00022449713,0.00017780464,0.00016593096],"domain_scores_gemma":[0.99632794,0.0012021685,0.0002402222,0.0019686657,0.00021208575,0.000048931943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003068857,0.0001328234,0.0001708784,0.00027110387,0.0005272536,0.0000513356,0.0016879111,0.00007725822,0.0000035692483],"category_scores_gemma":[0.000048020327,0.00014196045,0.00011957229,0.0004411424,0.00006086197,0.00032800436,0.0000069273974,0.00026435245,0.000008130928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013444878,0.0038463064,0.000080168,0.000045265988,0.00014125659,8.9750256e-7,0.005268328,0.00841552,0.022236396,0.22852644,0.0026761154,0.7286289],"study_design_scores_gemma":[0.001599663,0.0025165167,0.0010030757,0.0006794806,0.000108007895,0.000011478878,0.0002346501,0.43766904,0.5052355,0.046889074,0.0032350766,0.00081846386],"about_ca_topic_score_codex":0.00003593997,"about_ca_topic_score_gemma":0.00008690875,"teacher_disagreement_score":0.830927,"about_ca_system_score_codex":0.00011159062,"about_ca_system_score_gemma":0.000046512694,"threshold_uncertainty_score":0.5788979},"labels":[],"label_agreement":null},{"id":"W2152556510","doi":"10.1109/tcomm.2009.05.070599","title":"Performance Analysis of the IEEE 802.15.4a UWB System","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 British Columbia","funders":"","keywords":"Convolutional code; Computer science; Pulse-position modulation; Decoding methods; Bit error rate; Ultra-wideband; Phase-shift keying; Algorithm; Electronic engineering; Concatenated error correction code; Time-hopping; Code rate; Coding gain; Telecommunications; Block code; Pulse-amplitude modulation; Detector; Engineering; Pulse (music)","score_opus":0.014716095053885422,"score_gpt":0.2252945437196761,"score_spread":0.21057844866579067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152556510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5672581,0.0013218442,0.37355605,0.0046279947,0.0009086591,0.0012004358,0.00028724782,0.0031040087,0.047735624],"genre_scores_gemma":[0.99672157,0.0009949603,0.0019477748,0.00005427004,0.0000051015745,0.000111253095,0.000008352179,0.000020489182,0.00013622528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988951,0.00011320587,0.0004745654,0.00013988162,0.0001719062,0.00020534458],"domain_scores_gemma":[0.99435747,0.00022287529,0.00009246505,0.0051754736,0.000107497355,0.00004421008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001545714,0.00017695696,0.00029923563,0.0005183424,0.0005170306,0.000018926487,0.0023148633,0.0001475324,0.000024992783],"category_scores_gemma":[0.0000043770087,0.00015787022,0.0002794155,0.0025994347,0.0002004768,0.0001277075,0.0000054909146,0.00058753684,0.000036324414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015375455,0.0006978441,0.00036881317,0.000062592604,0.0018589251,2.3318154e-7,0.0011202922,0.9095654,0.023029938,0.0038309272,0.00049182196,0.05895784],"study_design_scores_gemma":[0.00046844708,0.00011970932,0.012441779,0.00017517277,0.002229637,0.000017032056,0.00060859224,0.8962651,0.082982115,0.00009637028,0.0040800762,0.000516006],"about_ca_topic_score_codex":0.000034608565,"about_ca_topic_score_gemma":0.00031070848,"teacher_disagreement_score":0.42946345,"about_ca_system_score_codex":0.00016329632,"about_ca_system_score_gemma":0.000030719028,"threshold_uncertainty_score":0.6437761},"labels":[],"label_agreement":null},{"id":"W2152610779","doi":"10.1109/tcomm.2011.012711.090592","title":"Asymptotically-Exact Performance Bounds of AF Multi-Hop Relaying over Nakagami Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Independent and identically distributed random variables; Nakagami distribution; Fading; Rayleigh fading; Moment-generating function; Mathematics; Hop (telecommunications); Relay; Upper and lower bounds; Harmonic mean; Topology (electrical circuits); Cumulative distribution function; Maximal-ratio combining; Asymptotically optimal algorithm; Algorithm; Statistics; Probability density function; Computer science; Telecommunications; Combinatorics; Random variable; Mathematical analysis; Physics; Decoding methods","score_opus":0.0978336611917214,"score_gpt":0.30068319812078037,"score_spread":0.20284953692905897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152610779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013243245,0.00027036414,0.9750374,0.0005501782,0.00026067373,0.00025076413,0.0000065554163,0.00025472694,0.010126068],"genre_scores_gemma":[0.9085746,0.0031633843,0.08759511,0.00018644128,0.00000745103,0.000074658514,0.0000027332812,0.000020697833,0.0003749518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983124,0.0003171659,0.0005416178,0.00030274692,0.00023696294,0.00028908777],"domain_scores_gemma":[0.99529135,0.00040857185,0.00018312552,0.0037232165,0.00027129208,0.00012243217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004678343,0.00021060012,0.00024446304,0.0002890409,0.0010169112,0.00007507312,0.0031293936,0.00010385353,0.00012881166],"category_scores_gemma":[0.000021016682,0.00021963014,0.00015522768,0.00093329797,0.00027807194,0.0007565584,0.00006930656,0.0006477773,0.000074138945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013366714,0.00733564,0.0032800997,0.00011948065,0.00073326076,0.000003722988,0.03835876,0.0073173293,0.026895404,0.15750006,0.00046164694,0.75786096],"study_design_scores_gemma":[0.0018785099,0.00043228033,0.01905824,0.0004935311,0.00010003396,0.000024042349,0.0002868645,0.92658395,0.04436298,0.0004060621,0.0053776344,0.0009958582],"about_ca_topic_score_codex":0.000026736716,"about_ca_topic_score_gemma":0.000120662524,"teacher_disagreement_score":0.91926664,"about_ca_system_score_codex":0.000106349056,"about_ca_system_score_gemma":0.00010994694,"threshold_uncertainty_score":0.8956257},"labels":[],"label_agreement":null},{"id":"W2153279511","doi":"10.1109/tcomm.2004.836424","title":"Accurate Evaluation of Multiple-Access Performance in TH-PPM and TH-BPSK UWB Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":179,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Phase-shift keying; Pulse-position modulation; Additive white Gaussian noise; Bit error rate; Modulation (music); Algorithm; Electronic engineering; Computer science; Interference (communication); Gaussian noise; Keying; Gaussian; Time-hopping; Mathematics; White noise; Telecommunications; Decoding methods; Physics; Pulse-amplitude modulation; Engineering; Pulse (music); Detector; Acoustics","score_opus":0.061669499479615635,"score_gpt":0.30058252815116454,"score_spread":0.2389130286715489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153279511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8695397,0.0027793592,0.120581,0.00085419434,0.00028528416,0.0012119557,0.000065811575,0.0005201009,0.004162589],"genre_scores_gemma":[0.9925255,0.0053389184,0.0014545994,0.000010786449,0.000003963859,0.0006082781,0.000013872882,0.000029975772,0.000014094211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988252,0.00014348459,0.0004766296,0.00015504932,0.00020998297,0.0001896821],"domain_scores_gemma":[0.9973213,0.00028065377,0.000081266124,0.0021007971,0.00017387919,0.000042105414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004495891,0.00016558387,0.00021968182,0.00042228017,0.00023351843,0.000042318727,0.0010844285,0.00014759733,0.000010597104],"category_scores_gemma":[0.000021743861,0.00018343104,0.000044601173,0.00069957256,0.00020258062,0.0004205016,0.000013547317,0.0005056965,0.000015683723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009754441,0.00024938156,0.00045485768,0.000055673285,0.000055929893,1.0308986e-7,0.00062573777,0.980036,0.0029375127,0.00067194825,0.0000061712244,0.014896887],"study_design_scores_gemma":[0.0026441154,0.00010133171,0.015058723,0.00042811772,0.0001538837,0.000025863266,0.0007545538,0.9545368,0.024234919,0.00064129906,0.0009628348,0.00045753366],"about_ca_topic_score_codex":0.0003053629,"about_ca_topic_score_gemma":0.0016290785,"teacher_disagreement_score":0.12298581,"about_ca_system_score_codex":0.00022710107,"about_ca_system_score_gemma":0.00007541947,"threshold_uncertainty_score":0.7480101},"labels":[],"label_agreement":null},{"id":"W2153342212","doi":"10.1109/tcomm.2012.100312.110480","title":"Collaborative Sub-Channel Allocation in Cognitive LTE Femto-Cells: A Cooperative Game-Theoretic Approach","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 British Columbia","funders":"","keywords":"Throughput; Femtocell; Computer science; Computer network; Telecommunications link; Resource allocation; Game theory; Femto-; Resource management (computing); Channel (broadcasting); Channel allocation schemes; Non-cooperative game; Base station; Wireless; Telecommunications; Mathematics","score_opus":0.022966472054573518,"score_gpt":0.2640205141335729,"score_spread":0.2410540420789994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153342212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037761957,0.0008388083,0.98688227,0.000078077595,0.00031447914,0.0011706783,0.00014411901,0.0003336581,0.0064617237],"genre_scores_gemma":[0.9903443,0.0015910126,0.006358656,0.000035469744,0.000027817636,0.0013313639,0.0000938261,0.00007446434,0.00014309437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853575,0.00030864662,0.00043893702,0.00021505197,0.00014204897,0.00035955213],"domain_scores_gemma":[0.99829423,0.00041146687,0.00008026136,0.00081134925,0.00027756704,0.00012510191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000271421,0.00027831347,0.00026937138,0.00034026313,0.0002527231,0.00004121191,0.00034127542,0.00015460477,0.000021501115],"category_scores_gemma":[0.000019073765,0.00031663163,0.000059859394,0.0012303606,0.0002079332,0.0006590778,0.0000047317135,0.0005196483,0.00009864229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035373112,0.00072642084,0.0000073963233,0.000040513944,0.00009585377,2.76749e-7,0.011067453,0.9810027,0.004352579,0.0012799635,0.000060082046,0.0013314013],"study_design_scores_gemma":[0.0018848592,0.00011540742,0.00007498131,0.00029886732,0.00014676905,0.00001429574,0.0112283435,0.8816655,0.103177756,0.00022784696,0.0002876617,0.0008776936],"about_ca_topic_score_codex":0.000018694607,"about_ca_topic_score_gemma":0.00014842866,"teacher_disagreement_score":0.9865681,"about_ca_system_score_codex":0.00032390974,"about_ca_system_score_gemma":0.00005259437,"threshold_uncertainty_score":0.9999286},"labels":[],"label_agreement":null},{"id":"W2153443706","doi":"10.1109/tcomm.2005.849797","title":"Tight Error Bounds for Space-Time Orthogonal Block Codes Under Slow Rayleigh Flat Fading","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Pairwise error probability; Upper and lower bounds; Rayleigh fading; Mathematics; Block code; Algorithm; Fading; Bit error rate; Decoding methods; Chernoff bound; Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.029150210371875027,"score_gpt":0.2864121138004663,"score_spread":0.25726190342859123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153443706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035418184,0.00064387766,0.98386395,0.0035443807,0.00013580256,0.00071593514,0.0002082366,0.0020331282,0.00531285],"genre_scores_gemma":[0.85581857,0.0012554441,0.14014886,0.00013684598,0.000041972507,0.00078248087,0.000062841515,0.00010735165,0.001645604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986049,0.00009538589,0.0004938051,0.00024367573,0.00019112659,0.00037113126],"domain_scores_gemma":[0.99623156,0.00073781837,0.000086554086,0.0026566675,0.00015668194,0.0001307122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020006407,0.00031375256,0.0003091726,0.00031450574,0.0009086249,0.00007664443,0.0012643655,0.00019096177,0.00012079321],"category_scores_gemma":[0.000008304619,0.00036279883,0.00021860327,0.0004278937,0.0002256252,0.00043823355,0.000012262992,0.0006218165,0.00017091533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056326062,0.0006013345,0.000008680529,0.00006243569,0.00044761226,3.7373664e-7,0.0009938562,0.84492916,0.08485018,0.013448809,0.005822927,0.04877828],"study_design_scores_gemma":[0.0010283027,0.00010079884,0.00005437092,0.0001643115,0.00015562528,0.00002384173,0.00016718895,0.61319417,0.21379381,0.002669374,0.16770029,0.000947924],"about_ca_topic_score_codex":0.0000071697855,"about_ca_topic_score_gemma":0.0002467877,"teacher_disagreement_score":0.85227674,"about_ca_system_score_codex":0.00034138866,"about_ca_system_score_gemma":0.000051910098,"threshold_uncertainty_score":0.9998824},"labels":[],"label_agreement":null},{"id":"W2153505774","doi":"10.1109/tcomm.2013.012913.110340","title":"Stochastic Decoding of LDPC Codes over GF(q)","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Decoding methods; Algorithm; Code word; Computational complexity theory; List decoding; Computer science; Galois theory; Mathematics; Block code; Concatenated error correction code; Discrete mathematics","score_opus":0.03690478225068595,"score_gpt":0.29877855041684437,"score_spread":0.2618737681661584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153505774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006589045,0.000065437416,0.9890699,0.0010209305,0.00021424108,0.00032036385,0.0000072790904,0.00056407746,0.0021487398],"genre_scores_gemma":[0.85935444,0.000053164502,0.14010677,0.000107120904,0.000005267148,0.00018307375,9.951578e-7,0.000013836629,0.00017534517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989065,0.00013660992,0.0003395954,0.00022021325,0.00020043297,0.00019662721],"domain_scores_gemma":[0.99605465,0.0007626451,0.00013760648,0.00277694,0.00019463767,0.000073524076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020053015,0.00013919976,0.00017665455,0.0002650963,0.0003551426,0.00007726688,0.0022267236,0.00007187964,0.00007533717],"category_scores_gemma":[0.000022067541,0.00014607643,0.0001109617,0.00056601915,0.00014344849,0.00051628274,0.000023858345,0.00035395878,0.00009732978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029232642,0.004633321,0.00027683767,0.00012974728,0.0004906065,0.0000022896274,0.013088788,0.03976977,0.13682128,0.10586325,0.007498127,0.6913968],"study_design_scores_gemma":[0.00054019986,0.00030199502,0.0011953964,0.00030831303,0.00006727457,0.000032621505,0.00025810028,0.8962834,0.08299957,0.016754813,0.00056168303,0.00069666735],"about_ca_topic_score_codex":0.00045918667,"about_ca_topic_score_gemma":0.0002398112,"teacher_disagreement_score":0.8565136,"about_ca_system_score_codex":0.00007315044,"about_ca_system_score_gemma":0.00006199305,"threshold_uncertainty_score":0.5956824},"labels":[],"label_agreement":null},{"id":"W2153907020","doi":"10.1109/tcomm.2009.09.070005","title":"Some comments on the use of markov models in communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":1,"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; Markov chain; Markov process; Stochastic differential equation; Channel (broadcasting); Field (mathematics); Markov model; Electronic engineering; Telecommunications; Mathematics; Engineering; Applied mathematics; Machine learning; Statistics","score_opus":0.12481479231560719,"score_gpt":0.2983842211223395,"score_spread":0.1735694288067323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153907020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023701305,0.00023733651,0.9159714,0.07723274,0.00008936528,0.0008681571,0.000087141234,0.00022509314,0.0029186085],"genre_scores_gemma":[0.96104217,0.0014280411,0.03487733,0.002205885,0.0000049507075,0.00022122465,0.000015550546,0.0000112901635,0.00019357199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984205,0.0003726433,0.0004925247,0.0002447705,0.00024934372,0.000220267],"domain_scores_gemma":[0.98999757,0.001314204,0.00014989298,0.008378028,0.000091931935,0.000068392044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002872595,0.00017023056,0.00019124798,0.00027426673,0.00065397413,0.0001131859,0.0047788206,0.000076005985,0.00000929071],"category_scores_gemma":[0.000010097727,0.00014865128,0.00013463406,0.0009482305,0.00023178825,0.0007205345,0.00004052647,0.00054959784,0.00004780977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012061824,0.0036050729,0.000007491605,0.000004457299,0.00004389407,4.951358e-7,0.0012655413,0.022141283,0.0016835701,0.9029847,0.0016937028,0.06655775],"study_design_scores_gemma":[0.00049610506,0.00013303258,0.0007296706,0.00010598733,0.000026928905,0.000005225894,0.0000783077,0.94093686,0.0031941617,0.040951643,0.013045966,0.00029610808],"about_ca_topic_score_codex":0.00012722067,"about_ca_topic_score_gemma":0.00015990861,"teacher_disagreement_score":0.95867205,"about_ca_system_score_codex":0.00008724268,"about_ca_system_score_gemma":0.00006615344,"threshold_uncertainty_score":0.8880317},"labels":[],"label_agreement":null},{"id":"W2154104609","doi":"10.1109/tcomm.2006.884852","title":"A Comparison of DCT-Based OFDM and DFT-Based OFDM in Frequency Offset and Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":164,"is_retracted":false,"has_abstract":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; Additive white Gaussian noise; Discrete cosine transform; Rayleigh fading; Fading; Carrier frequency offset; Frequency offset; Algorithm; Mathematics; Bit error rate; Computer science; Guard interval; Quadrature amplitude modulation; Discrete Fourier transform (general); Electronic engineering; Phase-shift keying; Multipath propagation; Telecommunications; White noise; Engineering; Fourier transform; Fractional Fourier transform; Channel (broadcasting); Decoding methods","score_opus":0.03248814429921955,"score_gpt":0.30472097599279085,"score_spread":0.2722328316935713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154104609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090021044,0.0015987187,0.9051185,0.0006385101,0.000058650887,0.00048595533,0.000103300445,0.00050442026,0.0014708791],"genre_scores_gemma":[0.9459493,0.00037943939,0.05333731,0.000026975356,0.0000039632214,0.00022709314,0.0000291743,0.000035964018,0.000010757277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988883,0.00011941309,0.0005265534,0.00016241071,0.00012328179,0.00018002813],"domain_scores_gemma":[0.9979379,0.00049094565,0.000098245764,0.0013512296,0.00007044973,0.000051219708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015553496,0.00018776025,0.0003053819,0.00045188697,0.00020735855,0.000023879018,0.00047088086,0.00011886604,0.00001316069],"category_scores_gemma":[0.000008136738,0.00022591482,0.000050566836,0.00048128524,0.0002657808,0.00017083916,0.0000062292634,0.00044691903,0.0000026527307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040433413,0.0016372314,0.004214745,0.00031096415,0.00005737519,9.796083e-7,0.0011996399,0.8943289,0.06584588,0.0055127935,0.00017855075,0.026672494],"study_design_scores_gemma":[0.0009620662,0.00011795852,0.0019476464,0.00042503863,0.000041811745,0.000002469464,0.00021435307,0.8407962,0.15258583,0.0018866608,0.00058333174,0.00043663976],"about_ca_topic_score_codex":0.00030401014,"about_ca_topic_score_gemma":0.0012020183,"teacher_disagreement_score":0.8559283,"about_ca_system_score_codex":0.000099512596,"about_ca_system_score_gemma":0.000029711673,"threshold_uncertainty_score":0.9212539},"labels":[],"label_agreement":null},{"id":"W2154165522","doi":"10.1109/tcomm.2009.11.070210","title":"Waterfall Performance Analysis of Finite-Length LDPC Codes on Symmetric Channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Decoding methods; Algorithm; Binary symmetric channel; Code word; Mathematics; Channel (broadcasting); Channel capacity; Waterfall; Block code; Computer science; Telecommunications","score_opus":0.04406269363340806,"score_gpt":0.29347941317687143,"score_spread":0.24941671954346337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154165522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027282411,0.00006503452,0.9655929,0.0017643106,0.00024361537,0.00023596396,0.000021127244,0.0006333368,0.004161302],"genre_scores_gemma":[0.9685866,0.00061440316,0.030221151,0.00028160203,0.0000072168045,0.000051031864,0.0000070346946,0.000010570565,0.00022036041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984846,0.00019497347,0.0004352268,0.000324317,0.00031157082,0.0002493113],"domain_scores_gemma":[0.9951623,0.0008884748,0.00017853311,0.0034867171,0.00020712418,0.00007683035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040960338,0.00019536795,0.00033150983,0.0017862295,0.00043765048,0.00006929424,0.00262933,0.00009683436,0.000013384251],"category_scores_gemma":[0.000025133942,0.00019222319,0.00024345216,0.0045694932,0.00007417578,0.00033609677,0.000012908236,0.00045797258,0.0000349628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007540181,0.005159158,0.00026329223,0.000037693397,0.0012945156,0.0000025260929,0.0063018855,0.42306682,0.004020977,0.023736192,0.00033837341,0.5357031],"study_design_scores_gemma":[0.00020229327,0.00078909204,0.0018345753,0.00008554567,0.00031442803,0.0000022731947,0.00004079991,0.9254932,0.06971553,0.00063942035,0.0005478199,0.00033503148],"about_ca_topic_score_codex":0.00006989935,"about_ca_topic_score_gemma":0.00007275913,"teacher_disagreement_score":0.9413042,"about_ca_system_score_codex":0.00009682991,"about_ca_system_score_gemma":0.000043682114,"threshold_uncertainty_score":0.7838634},"labels":[],"label_agreement":null},{"id":"W2154188754","doi":"10.1109/tcomm.2008.060106","title":"Cross-Layer Rate and Power Adaptation Strategies for IR-HARQ Systems over Fading Channels with Memory: A SMDP-Based Approach","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Hybrid automatic repeat request; Computer science; Fading; Rayleigh fading; Markov decision process; Link adaptation; Physical layer; Transmitter; Automatic repeat request; Block Error Rate; Markov process; Telecommunications link; Channel (broadcasting); Computer network; Wireless; Telecommunications; Mathematics","score_opus":0.04680008209293217,"score_gpt":0.2642501974351741,"score_spread":0.2174501153422419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154188754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018229328,0.00034741816,0.97908056,0.00004160878,0.00019923064,0.00082975236,0.00007003823,0.00042715832,0.00077488937],"genre_scores_gemma":[0.9659235,0.00033125107,0.032446213,0.00002544133,0.000019726098,0.00095222285,0.00006194915,0.000080602025,0.00015910166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990731,0.00006978427,0.00027313305,0.00022145538,0.00012461991,0.00023790031],"domain_scores_gemma":[0.99865544,0.00028686094,0.000074255695,0.0007623399,0.00014710063,0.00007397616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120427525,0.00022709354,0.00021131936,0.00017527658,0.0007170739,0.00012241135,0.00023865544,0.00010795797,0.000008320765],"category_scores_gemma":[0.0000027992126,0.000231969,0.00005258744,0.00035406358,0.00017422943,0.0005882479,0.0000018717908,0.00025385784,0.0000029446257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044107637,0.000076367636,0.0000073495767,0.00005081417,0.000057960464,3.4812e-7,0.00095197564,0.99768335,0.00040072572,0.0003330805,0.000028396036,0.0003655305],"study_design_scores_gemma":[0.0009682403,0.00007244838,0.00006921456,0.000063171174,0.000038676866,0.000011203645,0.0005792136,0.9969729,0.00065997965,0.000029643386,0.0002712233,0.00026404703],"about_ca_topic_score_codex":0.000028323984,"about_ca_topic_score_gemma":0.00003315459,"teacher_disagreement_score":0.9476942,"about_ca_system_score_codex":0.000100785954,"about_ca_system_score_gemma":0.00006395461,"threshold_uncertainty_score":0.94594216},"labels":[],"label_agreement":null},{"id":"W2154766530","doi":"10.1109/tcomm.2003.822187","title":"Precise Error-Rate Analysis of Bandwidth-Efficient BPSK in Nakagami Fading and Cochannel Interference","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":108,"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; University of Alberta; University of Victoria","keywords":"Fading; Phase-shift keying; Bit error rate; Electronic engineering; Fading distribution; Interference (communication); Bandwidth (computing); Bandlimiting; Algorithm; Computer science; Nakagami distribution; Word error rate; Mathematics; Telecommunications; Rayleigh fading; Engineering; Speech recognition; Fourier transform; Decoding methods","score_opus":0.030617110309637333,"score_gpt":0.2863406210239537,"score_spread":0.25572351071431637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154766530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1664317,0.00045456438,0.8316761,0.00019463433,0.0000412997,0.00023378461,0.00005877834,0.00026611326,0.0006429756],"genre_scores_gemma":[0.98525256,0.00280859,0.011692692,0.000014559391,0.0000014001964,0.00017950729,0.000012525472,0.000023945306,0.000014238425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905515,0.00009051277,0.00044330853,0.0001601401,0.00009108976,0.00015981609],"domain_scores_gemma":[0.99783766,0.00031048435,0.000072952316,0.0016442353,0.000077503486,0.000057133788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001959598,0.00015874428,0.0002931561,0.00085385406,0.00014143491,0.00001827259,0.00068242,0.00008246556,0.000011415311],"category_scores_gemma":[0.000010487897,0.00018297494,0.000092028764,0.0014407223,0.00018459569,0.00013307206,0.000013000381,0.0003995507,0.0000039848983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000818789,0.0001942332,0.000037858652,0.000015786869,0.00013409821,2.0208881e-7,0.0016191972,0.98369956,0.008360708,0.0008332636,0.0000010233827,0.005095863],"study_design_scores_gemma":[0.0007254233,0.000075723365,0.002617365,0.00037188223,0.00032570568,0.0000027903402,0.0009177994,0.89837927,0.09474992,0.0013179448,0.00007847866,0.00043770243],"about_ca_topic_score_codex":0.00012567588,"about_ca_topic_score_gemma":0.001097941,"teacher_disagreement_score":0.8199835,"about_ca_system_score_codex":0.00017000872,"about_ca_system_score_gemma":0.000020699026,"threshold_uncertainty_score":0.7461502},"labels":[],"label_agreement":null},{"id":"W2154993501","doi":"10.1109/tcomm.2012.100912.120503","title":"Message-Passing Algorithms for Counting Short Cycles in a Graph","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Bipartite graph; Message passing; Algorithm; Computer science; Computational complexity theory; Graph theory; Matrix multiplication; Graph; Theoretical computer science; Mathematics; Combinatorics; Parallel computing","score_opus":0.08365801311970401,"score_gpt":0.3494965390896761,"score_spread":0.2658385259699721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154993501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001974742,0.0002003463,0.9933039,0.0013996114,0.00040074525,0.00041541507,0.0000094890465,0.0006569863,0.0016387574],"genre_scores_gemma":[0.6910633,0.0000705474,0.30829382,0.00009823385,0.000017997832,0.00038678615,0.0000020110394,0.000017127215,0.000050156308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871594,0.00014983906,0.00034005995,0.00023365513,0.00017467035,0.00038586435],"domain_scores_gemma":[0.9971169,0.0007577802,0.000071657785,0.0018745961,0.00009869385,0.00008036749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008204199,0.00015821336,0.00017137248,0.00037384656,0.0006168523,0.00010883986,0.0016243301,0.000092993265,0.0000037728964],"category_scores_gemma":[0.00001984994,0.00017729923,0.0001248908,0.0006908819,0.00009140813,0.0006876707,0.000017329487,0.00041479897,0.000009045026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022162669,0.003172329,0.002242759,0.000069126545,0.00011783991,0.0000015478321,0.010628134,0.002778336,0.009620173,0.02374589,0.00093491987,0.9466668],"study_design_scores_gemma":[0.001367752,0.00032157332,0.005646778,0.00078285544,0.0001655895,0.00011731119,0.0014577825,0.83506256,0.11767261,0.0162916,0.01893053,0.0021830623],"about_ca_topic_score_codex":0.00013499912,"about_ca_topic_score_gemma":0.00030585795,"teacher_disagreement_score":0.9444837,"about_ca_system_score_codex":0.00013901711,"about_ca_system_score_gemma":0.00005082155,"threshold_uncertainty_score":0.72300524},"labels":[],"label_agreement":null},{"id":"W2155165039","doi":"10.1109/tcomm.2012.081012.100156","title":"Performance Analysis for Multihop Relaying Channels with Nakagami-m Fading: Ergodic Capacity Upper-Bounds and Outage Probability","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Nakagami distribution; Fading; Ergodic theory; Upper and lower bounds; Topology (electrical circuits); Independent and identically distributed random variables; Moment-generating function; Computer science; Signal-to-noise ratio (imaging); Channel state information; Context (archaeology); Mathematics; Channel capacity; Channel (broadcasting); Telecommunications; Probability density function; Wireless; Random variable; Statistics; Combinatorics; Mathematical analysis","score_opus":0.09869369265298683,"score_gpt":0.292406410548786,"score_spread":0.1937127178957992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155165039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1410024,0.00032318028,0.85582054,0.0014668399,0.00013001391,0.00053579477,0.000015904274,0.0001947695,0.0005105558],"genre_scores_gemma":[0.91734695,0.0010288854,0.08077539,0.00014353673,0.000016740622,0.000468983,0.000009147291,0.000015315203,0.00019505272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998483,0.00028181207,0.000341898,0.00033263568,0.00018360114,0.00037706524],"domain_scores_gemma":[0.99604416,0.00064124184,0.0001306784,0.0027572939,0.00024185069,0.00018478154],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007580525,0.00022218755,0.00028039535,0.00032838518,0.0019419289,0.0001799924,0.0013435793,0.00008481805,0.000011986208],"category_scores_gemma":[0.000019270732,0.00020391315,0.00014172928,0.0013665518,0.00028292483,0.0010037845,0.0000386445,0.00043001657,0.000008779985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003810818,0.009477263,0.10016654,0.0004644305,0.0053501693,8.2183095e-7,0.10083855,0.18220857,0.005779043,0.10624718,0.00026520866,0.48882115],"study_design_scores_gemma":[0.00090567366,0.00023240547,0.014694008,0.00008604258,0.00036823563,0.000014691794,0.00019796155,0.9750926,0.0021007021,0.00016137751,0.005540494,0.00060579774],"about_ca_topic_score_codex":0.000018809733,"about_ca_topic_score_gemma":0.00021838502,"teacher_disagreement_score":0.79288405,"about_ca_system_score_codex":0.0001398879,"about_ca_system_score_gemma":0.000053253294,"threshold_uncertainty_score":0.9993574},"labels":[],"label_agreement":null},{"id":"W2155199613","doi":"10.1109/tcomm.2004.826415","title":"Subspace-Based Active User Identification for a Collision-Free Slotted Ad Hoc Network","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Computer science; Transmitter; Wireless ad hoc network; Identifier; Subspace topology; Computer network; False alarm; Bandwidth (computing); Interference (communication); Node (physics); Algorithm; Wireless; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.04568657033656958,"score_gpt":0.313073654544155,"score_spread":0.2673870842075854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155199613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011691933,0.00051601167,0.96641755,0.028894931,0.00037484537,0.0016110211,0.00011449549,0.0005606462,0.00034128307],"genre_scores_gemma":[0.77099687,0.0012001505,0.22434682,0.0004766328,0.000035645277,0.0023104162,0.000072839925,0.000055885448,0.0005047087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708235,0.0004981019,0.00064601423,0.0005934753,0.00058606063,0.00059402274],"domain_scores_gemma":[0.98659366,0.001989054,0.00028808508,0.010105867,0.00079222047,0.00023112213],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00079507485,0.00030388404,0.00030384515,0.00040492474,0.0021444387,0.00039075766,0.007942257,0.00021445523,0.000017015498],"category_scores_gemma":[0.00007640999,0.00033541193,0.00027957134,0.002291257,0.00033244578,0.00083563436,0.00007979972,0.00078546937,0.00012200307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025034425,0.0021755865,0.0000062478107,0.000036841026,0.00020761356,0.0000012700415,0.0012141113,0.8801313,0.0014664991,0.051508736,0.0038995417,0.059101924],"study_design_scores_gemma":[0.009189236,0.0007302613,0.0015435081,0.0005503,0.00015608624,0.000017287215,0.0003395014,0.8397401,0.036700368,0.032412823,0.07708097,0.0015395636],"about_ca_topic_score_codex":0.000050710325,"about_ca_topic_score_gemma":0.0011945876,"teacher_disagreement_score":0.7698277,"about_ca_system_score_codex":0.00054684,"about_ca_system_score_gemma":0.00059917103,"threshold_uncertainty_score":0.9999098},"labels":[],"label_agreement":null},{"id":"W2155215189","doi":"10.1109/tcomm.2008.060641","title":"A Nash game approach for OSNR optimization with capacity constraint in optical links","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","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":"Nash equilibrium; Wavelength-division multiplexing; Computer science; Convergence (economics); Mathematical optimization; Constraint (computer-aided design); Multiplexing; Mathematics; Telecommunications; Wavelength; Optics; Physics","score_opus":0.045229168508986006,"score_gpt":0.2304290169166437,"score_spread":0.18519984840765769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155215189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011136908,0.000050259434,0.98289996,0.00041856177,0.000048111116,0.00060188636,0.000037722115,0.00074285845,0.0040637436],"genre_scores_gemma":[0.59793466,0.0003134237,0.40128413,0.000018761075,0.00000554232,0.0003917734,0.000012170048,0.000023832114,0.000015692634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914336,0.000031410607,0.00027355144,0.00017763396,0.00011129197,0.00026272557],"domain_scores_gemma":[0.99851805,0.00031725952,0.000023026898,0.0010062782,0.00007194861,0.00006342288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097227785,0.00017063628,0.00020425573,0.0001836504,0.00019939465,0.000020576674,0.00046452475,0.0002775187,0.000010545736],"category_scores_gemma":[0.000012552839,0.00016977682,0.00006487413,0.0004732418,0.00055227993,0.00013029104,0.0000033993651,0.0008708953,0.0000061298856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014434097,0.00026239926,0.000013419473,0.000016938193,0.000034666373,5.8056753e-7,0.00019047479,0.99479437,0.00006930434,0.0023270617,0.000030442268,0.0022459154],"study_design_scores_gemma":[0.0005924945,0.00009541034,0.00007034329,0.00003154367,0.000025374255,0.000035081634,0.00016343087,0.99749655,0.0009413656,0.00012117004,0.00021202292,0.00021519778],"about_ca_topic_score_codex":0.000008962056,"about_ca_topic_score_gemma":0.00005591082,"teacher_disagreement_score":0.5867978,"about_ca_system_score_codex":0.00013196263,"about_ca_system_score_gemma":0.000032020882,"threshold_uncertainty_score":0.69232976},"labels":[],"label_agreement":null},{"id":"W2155439723","doi":"10.1109/tcomm.2006.881338","title":"Performance of an ultra-wideband communication system in the presence of narrowband BPSK- and QPSK-modulated OFDM interference","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Narrowband; Electronic engineering; Keying; Wideband; Bit error rate; Minimum-shift keying; Gaussian noise; Computer science; Modulation (music); Ultra-wideband; Orthogonal frequency-division multiplexing; Adjacent-channel interference; Communications system; Telecommunications; White noise; Physics; Algorithm; Engineering; Acoustics; Decoding methods; Channel (broadcasting)","score_opus":0.012295237255100849,"score_gpt":0.22224062955813925,"score_spread":0.2099453923030384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155439723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.976123,0.0010504639,0.018763425,0.00022497677,0.000038196216,0.0004618838,0.000044272874,0.00018779511,0.0031060388],"genre_scores_gemma":[0.99536735,0.0018955488,0.0024668192,0.000007858276,0.0000026448558,0.00019379653,0.000025905396,0.000022473387,0.00001762441],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986176,0.0003101724,0.0006163552,0.00014573449,0.00014494614,0.00016520878],"domain_scores_gemma":[0.9956686,0.00058030454,0.00013071368,0.0034740707,0.00012003885,0.000026293143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040348322,0.00016914442,0.00024644265,0.00029926657,0.00024025267,0.000021291326,0.0018794342,0.00013766707,0.00000437796],"category_scores_gemma":[0.000009794335,0.00015648098,0.000048010646,0.0006818908,0.0005079056,0.0002308979,0.000007846796,0.00049591763,0.000002185312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002750786,0.0039729546,0.009321493,0.0011671497,0.00033907898,0.0000015177438,0.013927354,0.43827608,0.45054567,0.015470512,0.00019902109,0.06650408],"study_design_scores_gemma":[0.0019636329,0.0006616758,0.022352941,0.0013538629,0.00020126846,0.00013757472,0.00545414,0.50349724,0.46211803,0.000811711,0.00065693835,0.0007909765],"about_ca_topic_score_codex":0.0005299474,"about_ca_topic_score_gemma":0.0015728094,"teacher_disagreement_score":0.06571311,"about_ca_system_score_codex":0.000054386193,"about_ca_system_score_gemma":0.000024423129,"threshold_uncertainty_score":0.6381109},"labels":[],"label_agreement":null},{"id":"W2155605600","doi":"10.1109/tcomm.2011.022811.090261","title":"Efficient LLR Calculation for Non-Binary Modulations over Fading Channels","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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","funders":"","keywords":"Fading; Binary number; Measure (data warehouse); Computation; Convexity; Algorithm; Mathematics; Piecewise linear function; Computer science; Applied mathematics; Mathematical analysis; Decoding methods","score_opus":0.07647538349100345,"score_gpt":0.3129384104109315,"score_spread":0.23646302691992804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155605600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083708335,0.00002205722,0.9863877,0.0005086117,0.0006841766,0.00080708443,0.000019385445,0.0008211748,0.002378976],"genre_scores_gemma":[0.7980896,0.000014498684,0.20095336,0.00009196945,0.000016648322,0.00055382977,0.000005976255,0.000024837193,0.00024925443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986593,0.00010570235,0.00037328913,0.00037520632,0.00019740492,0.00028906166],"domain_scores_gemma":[0.99653226,0.00040618912,0.00014425571,0.0026056576,0.00021673816,0.00009492716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034564795,0.00019587217,0.00017125682,0.00040641398,0.0010506823,0.00007228511,0.0016291686,0.000117225834,0.000019074294],"category_scores_gemma":[0.000016144715,0.00021878295,0.00019070289,0.00070395885,0.0000919341,0.00028240087,0.000023316174,0.0003089951,0.000033703083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011204152,0.0061287843,0.00021450515,0.00010483068,0.00035359114,0.000004282152,0.04643753,0.74382675,0.02548994,0.07373657,0.0022326675,0.101358496],"study_design_scores_gemma":[0.000252721,0.00012593715,0.0007295003,0.000055769327,0.000029743054,0.0000057311972,0.00004161489,0.9864248,0.009814733,0.0019385427,0.0003293049,0.00025159534],"about_ca_topic_score_codex":0.00016636064,"about_ca_topic_score_gemma":0.00007882852,"teacher_disagreement_score":0.7897188,"about_ca_system_score_codex":0.00016243318,"about_ca_system_score_gemma":0.00006957578,"threshold_uncertainty_score":0.892171},"labels":[],"label_agreement":null},{"id":"W2155681377","doi":"10.1109/tcomm.2011.072011.100067","title":"A Spectrally Efficient Detect-and-Forward Scheme with Two-Tier Adaptive Cooperation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Relay; Computer science; Fading; Maximization; Scheme (mathematics); Signal-to-noise ratio (imaging); Electronic engineering; Spectral efficiency; Decoding methods; Computer network; Telecommunications; Mathematics; Channel (broadcasting); Mathematical optimization; Engineering","score_opus":0.0627042138644134,"score_gpt":0.2679042200404214,"score_spread":0.20520000617600803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155681377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019844808,0.00037726297,0.9841016,0.0010950352,0.00008791,0.0004045078,0.0000057646894,0.00028486707,0.011658587],"genre_scores_gemma":[0.7889767,0.0007791562,0.20954661,0.00031096942,0.0000074626423,0.00015943185,0.000001968844,0.000015990843,0.00020166562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986162,0.0002910729,0.00029355477,0.00035259893,0.00019533181,0.00025122528],"domain_scores_gemma":[0.9967997,0.00018890311,0.00009850864,0.0025026593,0.00028657416,0.00012364889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027178097,0.00021804002,0.00018553562,0.00021189831,0.0010538772,0.00012348658,0.0015255796,0.00005723661,0.00006378857],"category_scores_gemma":[0.000005979444,0.00019624585,0.00006500865,0.0007934979,0.0002644188,0.00035593435,0.000037586015,0.00049207296,0.00007719467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004612878,0.002382174,0.00005408573,0.000020210007,0.0006091817,0.000010582826,0.029242782,0.01734661,0.0060399305,0.47156933,0.00037047506,0.47189334],"study_design_scores_gemma":[0.002027288,0.000902353,0.0005028283,0.00015932438,0.00007871191,0.00006942351,0.0002499505,0.9689327,0.02107918,0.0008212187,0.004306767,0.0008702726],"about_ca_topic_score_codex":0.00003378796,"about_ca_topic_score_gemma":0.00061517383,"teacher_disagreement_score":0.95158607,"about_ca_system_score_codex":0.0000893663,"about_ca_system_score_gemma":0.000117600495,"threshold_uncertainty_score":0.81056774},"labels":[],"label_agreement":null},{"id":"W2155981314","doi":"10.1109/tcomm.2011.121410.100281","title":"Bit-Interleaved Coded Modulation with Mismatched Decoding Metrics","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 British Columbia","funders":"","keywords":"Decoding methods; Computer science; Metric (unit); Algorithm; Bit error rate; Scaling; Clipping (morphology); Theoretical computer science; Mathematics","score_opus":0.03668611409472764,"score_gpt":0.29146219594098866,"score_spread":0.254776081846261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155981314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024811016,0.000012935729,0.968991,0.0020556333,0.00043747667,0.0003119813,0.0000058094647,0.0013174372,0.0020567393],"genre_scores_gemma":[0.6457333,0.000027736236,0.35388818,0.00010217175,0.0000085838,0.000092663126,0.0000025860043,0.000018818579,0.00012593385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998675,0.00013607217,0.0003187259,0.0003459564,0.00027940422,0.0002448461],"domain_scores_gemma":[0.995334,0.0006281605,0.00015619148,0.003505837,0.00026648506,0.0001093164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039060097,0.00019582805,0.00018050428,0.00052281166,0.00066560006,0.00018704217,0.0023286988,0.0001257964,0.000018323997],"category_scores_gemma":[0.000031092797,0.00018985497,0.00009359935,0.0014122173,0.00012336734,0.0005579007,0.000018438512,0.0009136955,0.000049483977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008946716,0.0026374902,0.00059338135,0.000049522867,0.00029238692,0.000008757124,0.008842843,0.009822384,0.24855934,0.036385268,0.00069707015,0.6920221],"study_design_scores_gemma":[0.0005090591,0.00019166325,0.0003524651,0.00007076813,0.000042568627,0.000062369865,0.0001175316,0.87748146,0.116305925,0.0031613754,0.0012308887,0.00047390012],"about_ca_topic_score_codex":0.00013637425,"about_ca_topic_score_gemma":0.0019927432,"teacher_disagreement_score":0.8676591,"about_ca_system_score_codex":0.000084040475,"about_ca_system_score_gemma":0.00008772202,"threshold_uncertainty_score":0.7742061},"labels":[],"label_agreement":null},{"id":"W2156188675","doi":"10.1109/tcomm.2008.050646","title":"Statistics of general order selection in correlated Nakagami fading channels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Fading; Nakagami distribution; Fading distribution; Cumulative distribution function; Statistics; Mathematics; Signal-to-noise ratio (imaging); Order statistic; Algorithm; Applied mathematics; Statistical physics; Probability density function; Physics; Rayleigh fading","score_opus":0.02962727651438725,"score_gpt":0.2738377184433825,"score_spread":0.24421044192899527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156188675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019352552,0.00017298614,0.9781007,0.00006782753,0.00012050678,0.00026317945,0.00006305,0.00052089914,0.0013383053],"genre_scores_gemma":[0.88806784,0.004365577,0.107095435,0.000016792053,0.0000054810957,0.00015667654,0.00002369635,0.000042144595,0.00022633941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990229,0.000103185674,0.00045261,0.00011741094,0.00012630869,0.00017758962],"domain_scores_gemma":[0.9985832,0.00024216391,0.00007159916,0.0008973278,0.00016040972,0.000045308683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008999109,0.0001530557,0.00020558244,0.00038640937,0.00023842658,0.0000071601885,0.0005442854,0.0001149703,0.000042305885],"category_scores_gemma":[0.000010143925,0.00019103766,0.000043409207,0.000965193,0.00015860752,0.00018464022,0.0000050479543,0.0005634051,0.00001693293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010045931,0.00026619463,0.00006681059,0.000019751518,0.000042077034,7.1933454e-7,0.0010414822,0.97498626,0.013599414,0.0011526856,0.0002611558,0.008553387],"study_design_scores_gemma":[0.00048030305,0.00006749531,0.0005373704,0.00008708576,0.00002046355,0.000025583897,0.000078494486,0.91839564,0.07810793,0.000655309,0.0012317151,0.00031260453],"about_ca_topic_score_codex":0.00011772677,"about_ca_topic_score_gemma":0.00025709515,"teacher_disagreement_score":0.87100524,"about_ca_system_score_codex":0.00017163235,"about_ca_system_score_gemma":0.000040358264,"threshold_uncertainty_score":0.77902895},"labels":[],"label_agreement":null},{"id":"W2156541068","doi":"10.1109/tcomm.2009.06.070048","title":"Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Enumeration; Low-density parity-check code; Decoding methods; Binary number; Algorithm; Code (set theory); Discrete mathematics; Parity (physics); Mathematics; Word error rate; Computer science; Combinatorics; Statistics; Arithmetic; Artificial intelligence; Physics","score_opus":0.053480811009255086,"score_gpt":0.32590949501043415,"score_spread":0.27242868400117903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156541068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07049601,0.000034220047,0.92579514,0.0019986487,0.0003116731,0.00038582084,0.0000137537,0.0005688838,0.0003958723],"genre_scores_gemma":[0.8996701,0.00008711626,0.099871956,0.00026209163,0.000010974121,0.0000303137,0.00000960694,0.0000138532605,0.000043980348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982446,0.00045381056,0.0004648244,0.00033727378,0.00027549866,0.00022402938],"domain_scores_gemma":[0.99656254,0.0005405115,0.00026748597,0.0023282857,0.00022439755,0.00007680517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062655646,0.00020810925,0.00025570535,0.0006627365,0.0007308673,0.000099869474,0.0012558994,0.00014128107,0.0000049555833],"category_scores_gemma":[0.000056065954,0.00021316789,0.0001200282,0.0014835511,0.0000950466,0.0006374101,0.000014210535,0.00052062544,0.00002487046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007511868,0.00349982,0.000017152588,0.000052717503,0.00007863287,0.0000037602042,0.0025950384,0.7858919,0.05016629,0.017318277,0.00021223351,0.14008906],"study_design_scores_gemma":[0.000188129,0.00030121632,0.00041641924,0.00012139031,0.000028648868,0.000009216076,0.000027336893,0.8795348,0.11557611,0.003556597,0.000028772958,0.00021140712],"about_ca_topic_score_codex":0.00017766483,"about_ca_topic_score_gemma":0.000051181483,"teacher_disagreement_score":0.8291741,"about_ca_system_score_codex":0.00018251622,"about_ca_system_score_gemma":0.0000930357,"threshold_uncertainty_score":0.8692734},"labels":[],"label_agreement":null},{"id":"W2156717389","doi":"10.1109/tcomm.2009.06.070469","title":"Intercarrier interference reduction in OFDM systems using low complexity selective mapping","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","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":"","keywords":"Orthogonal frequency-division multiplexing; Interference (communication); Reduction (mathematics); Fast Fourier transform; Computational complexity theory; Computer science; Electronic engineering; Fourier transform; Inverse; Algorithm; Telecommunications; Mathematics; Engineering; Channel (broadcasting)","score_opus":0.0877712318335284,"score_gpt":0.29897598432897105,"score_spread":0.21120475249544263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156717389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11351398,0.0003153884,0.87626445,0.00038573373,0.0016345287,0.00059614045,0.00004446909,0.0006985394,0.0065467604],"genre_scores_gemma":[0.99571896,0.00021404112,0.003801869,0.000017751112,0.000039062794,0.000076115604,0.0000071890736,0.000027527854,0.000097506505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876237,0.00016727435,0.0004631976,0.00021549796,0.00013207378,0.00025958446],"domain_scores_gemma":[0.9986104,0.000070234644,0.00006124628,0.001072675,0.00010674734,0.00007873454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016540059,0.0002056595,0.00023194315,0.0005019633,0.00028317072,0.00006686334,0.0005305725,0.00011856025,0.000026254635],"category_scores_gemma":[0.000006297223,0.00025271002,0.00008096657,0.0008479988,0.00015455265,0.00035358846,0.0000032979415,0.0007666593,0.000035782818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002614186,0.00037453836,0.0000132661535,0.0000520062,0.00007419943,0.0000010787898,0.0032814743,0.93280447,0.052824046,0.000865503,0.0001810057,0.009502257],"study_design_scores_gemma":[0.0006645768,0.00009356101,0.0009228706,0.0007620085,0.000047801226,0.00017897699,0.0029725959,0.9751564,0.016543217,0.0012766949,0.0007174441,0.0006638434],"about_ca_topic_score_codex":0.00015574017,"about_ca_topic_score_gemma":0.000097150085,"teacher_disagreement_score":0.88220495,"about_ca_system_score_codex":0.00072623836,"about_ca_system_score_gemma":0.00004057569,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W2156922722","doi":"10.1109/tcomm.2006.869879","title":"Exact expression for the BER of rectangular QAM with arbitrary constellation mapping","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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","funders":"","keywords":"Quadrature amplitude modulation; QAM; Gray code; Mathematics; Bit error rate; Algorithm; Expression (computer science); Signal-to-noise ratio (imaging); Upper and lower bounds; Bounding overwatch; Phase-shift keying; Constellation diagram; Electronic engineering; Computer science; Statistics; Mathematical analysis; Artificial intelligence; Engineering","score_opus":0.02028480927255559,"score_gpt":0.24495127601168515,"score_spread":0.22466646673912954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156922722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026442783,0.0009170124,0.9899148,0.00041061267,0.00005275464,0.0006972115,0.000050638824,0.00047858845,0.004834105],"genre_scores_gemma":[0.9015293,0.0009955373,0.09702345,0.000019834537,0.000011412132,0.00029451156,0.000025411351,0.000041434094,0.000059117356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992283,0.00006502185,0.00033680047,0.00011068144,0.00012397273,0.00013524889],"domain_scores_gemma":[0.996915,0.0009748941,0.00009650615,0.0018885802,0.00010181155,0.000023234075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013510931,0.00014488735,0.00015435701,0.00013957432,0.0003413524,0.000017959455,0.00062123203,0.00007744165,0.00001880742],"category_scores_gemma":[0.000002546514,0.000118512115,0.00008445485,0.00032480617,0.00020363533,0.00017483707,0.000004150443,0.00029008125,0.0000026245996],"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.000078399455,0.00047207306,0.000055923076,0.00014158722,0.00018101731,2.5538682e-7,0.0008146656,0.7513266,0.17835262,0.0050996826,0.0010854244,0.062391717],"study_design_scores_gemma":[0.000703726,0.00009028411,0.0002608395,0.00038348272,0.00009383647,0.000010007207,0.0004392999,0.16781987,0.7952151,0.0026172404,0.031959154,0.00040717304],"about_ca_topic_score_codex":0.00003125458,"about_ca_topic_score_gemma":0.000067699904,"teacher_disagreement_score":0.898885,"about_ca_system_score_codex":0.00006162334,"about_ca_system_score_gemma":0.0000213864,"threshold_uncertainty_score":0.48327836},"labels":[],"label_agreement":null},{"id":"W2157179077","doi":"10.1109/tcomm.2006.876869","title":"Optimal Periodic Training Signal for Frequency Offset Estimation in Frequency-Selective Fading Channels","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Frequency offset; Fading; Rayleigh fading; Channel (broadcasting); Carrier frequency offset; Multipath propagation; SIGNAL (programming language); Offset (computer science); Computer science; Control theory (sociology); Mathematics; Statistics; Algorithm; Telecommunications; Orthogonal frequency-division multiplexing; Artificial intelligence","score_opus":0.032733241364087555,"score_gpt":0.28357684725981763,"score_spread":0.25084360589573007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157179077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008986293,0.00032492267,0.9856279,0.0003268404,0.0001197048,0.0008224777,0.00013433234,0.0009569063,0.0027006047],"genre_scores_gemma":[0.73352176,0.00020012815,0.26454502,0.0000193087,0.000015944695,0.0015279793,0.00008457834,0.000057844565,0.000027437023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855226,0.0001095319,0.00058861997,0.0002394706,0.00015191999,0.000358192],"domain_scores_gemma":[0.9979915,0.0005154238,0.00009558289,0.0012112312,0.0001285201,0.000057725603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000244125,0.0002662871,0.000281545,0.00051811564,0.0005531986,0.00006201184,0.0008341636,0.00016964438,0.000030483223],"category_scores_gemma":[0.00001497026,0.00033671645,0.0001294569,0.00067748077,0.00016272378,0.0005192375,0.0000047181716,0.00063424284,0.000014180595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008323083,0.00017515043,0.000014510831,0.00002452117,0.000030418822,4.0912448e-7,0.0014799103,0.9705232,0.0107557485,0.0042787977,0.00007081884,0.012638202],"study_design_scores_gemma":[0.00058455626,0.00011293213,0.00014475957,0.00021435256,0.000038469647,0.000011928508,0.00038215143,0.9454965,0.032841645,0.019394897,0.00023319617,0.00054463034],"about_ca_topic_score_codex":0.00016669999,"about_ca_topic_score_gemma":0.000765952,"teacher_disagreement_score":0.72453547,"about_ca_system_score_codex":0.00046824003,"about_ca_system_score_gemma":0.00007308421,"threshold_uncertainty_score":0.9999085},"labels":[],"label_agreement":null},{"id":"W2157298719","doi":"10.1109/tcomm.2010.01.080157","title":"Transmission control in cognitive radio as a Markovian dynamic game: Structural result on randomized threshold policies","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Cognitive radio; Computer science; Fading; Channel (broadcasting); Transmission (telecommunications); Computer network; Markov process; Time division multiple access; Nash equilibrium; Mathematical optimization; Markov chain; Telecommunications; Mathematics; Wireless; Statistics","score_opus":0.013665531496353083,"score_gpt":0.28892201780945703,"score_spread":0.27525648631310395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157298719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07990166,0.00019793597,0.89839256,0.01229009,0.0005140246,0.0013450121,0.000049782688,0.00026856054,0.0070403973],"genre_scores_gemma":[0.99477917,0.00050344336,0.0035103397,0.0008053119,0.000026043326,0.00011947402,0.000010573805,0.000026000587,0.00021962154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997761,0.000527888,0.00053720106,0.00044941535,0.00030854048,0.00041596184],"domain_scores_gemma":[0.99562484,0.0024492189,0.00013840523,0.0014770537,0.00014120793,0.0001692963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000574393,0.00030337606,0.0005126173,0.0004931658,0.0006229777,0.00020651483,0.0011468055,0.0001674548,0.000051952306],"category_scores_gemma":[0.000043469583,0.00027377397,0.00029136782,0.00074347755,0.00047509998,0.0003418124,0.000008007538,0.0014787544,0.000028210328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.029911289,0.0022720448,0.00006354556,0.000033279568,0.0007607863,0.000075290074,0.018098906,0.019643882,0.019238917,0.07537191,0.0001210618,0.83440906],"study_design_scores_gemma":[0.04443715,0.00016462301,0.00078191404,0.00021789747,0.00008100391,0.00007883674,0.00013024505,0.9457757,0.0012653905,0.0063906955,0.00024071691,0.00043581694],"about_ca_topic_score_codex":0.00037570842,"about_ca_topic_score_gemma":0.0022098462,"teacher_disagreement_score":0.92613184,"about_ca_system_score_codex":0.000097157514,"about_ca_system_score_gemma":0.00013027781,"threshold_uncertainty_score":0.99997145},"labels":[],"label_agreement":null},{"id":"W2157308659","doi":"10.1109/tcomm.2004.838722","title":"SER and Outage of Threshold-Based Hybrid Selection/Maximal-Ratio Combining Over Generalized Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Maximal-ratio combining; Fading; Moment-generating function; Nakagami distribution; Independent and identically distributed random variables; Mathematics; Diversity combining; Random variable; Algorithm; Signal-to-noise ratio (imaging); Statistics; Fading distribution; Selection (genetic algorithm); Topology (electrical circuits); Computer science; Combinatorics; Decoding methods; Rayleigh fading","score_opus":0.026550988439321542,"score_gpt":0.2726052357981235,"score_spread":0.24605424735880196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157308659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07045611,0.00029887396,0.92703164,0.00027299157,0.000106134634,0.0003577605,0.000047866855,0.00082913996,0.0005995161],"genre_scores_gemma":[0.9465194,0.0010323209,0.051965695,0.00008654775,0.000008691248,0.0002611139,0.00002225915,0.00006444184,0.000039548773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989332,0.000067170855,0.0004468468,0.00018153295,0.0001618114,0.00020942207],"domain_scores_gemma":[0.9981346,0.0001750465,0.0000979378,0.0013993649,0.00011342895,0.00007960978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014727775,0.00022496725,0.00027028745,0.000322199,0.00044244537,0.000043103515,0.000581721,0.00009163451,0.00003586785],"category_scores_gemma":[0.0000058343603,0.00026797235,0.00009728572,0.00042006865,0.0001968428,0.0003205325,0.000009298457,0.000491438,0.000006800402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014435283,0.00019442785,0.000020266803,0.000035808745,0.000067011424,3.4765395e-7,0.00040961176,0.9567326,0.036799587,0.003075501,0.000025255935,0.0026251804],"study_design_scores_gemma":[0.0012833343,0.00009224563,0.00008160592,0.00016317688,0.00005192476,0.00001275728,0.00006534093,0.5346529,0.46008018,0.0024921473,0.00062645617,0.00039796182],"about_ca_topic_score_codex":0.000044256365,"about_ca_topic_score_gemma":0.000081250786,"teacher_disagreement_score":0.8760633,"about_ca_system_score_codex":0.00016487391,"about_ca_system_score_gemma":0.000045429813,"threshold_uncertainty_score":0.99997723},"labels":[],"label_agreement":null},{"id":"W2157634894","doi":"10.1109/tcomm.2004.826247","title":"Call Admission Control for Integrated On/Off Voice and Best-Effort Data Services in Mobile Cellular Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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; Quality of service; Call Admission Control; Handover; Admission control; Partition (number theory); Computer network; Provisioning; Markov process; Real-time computing; Telecommunications; Mathematics; Wireless","score_opus":0.06221408652698515,"score_gpt":0.3406307085928149,"score_spread":0.27841662206582973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157634894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005532788,0.0028716212,0.9720677,0.015571469,0.00014079086,0.0024160075,0.00038650955,0.00030021113,0.00071289385],"genre_scores_gemma":[0.92527485,0.008316662,0.06382557,0.0005050137,0.000013020179,0.0015868399,0.0002624744,0.000039444378,0.00017610195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973907,0.00049980957,0.0006741745,0.0006329663,0.00035773643,0.0004446066],"domain_scores_gemma":[0.9824888,0.0018552087,0.00017818189,0.0149019705,0.0003276361,0.00024820198],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00093618437,0.00030133585,0.00035138166,0.00047892315,0.0012758058,0.00027492992,0.012292183,0.00020437574,0.0000067134592],"category_scores_gemma":[0.000028207432,0.00030596412,0.000090423535,0.0011683593,0.000385026,0.0009210399,0.0002812929,0.0011559029,0.00006921626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044445944,0.018847583,0.00024239202,0.00028936937,0.0005281445,0.000008395075,0.0070135114,0.33570406,0.006348529,0.050591525,0.0008809468,0.5791011],"study_design_scores_gemma":[0.002931229,0.00042174078,0.00012413593,0.000455794,0.000050492377,0.000010461918,0.00036502825,0.9263282,0.0013659733,0.001271294,0.06622839,0.00044726895],"about_ca_topic_score_codex":0.000598327,"about_ca_topic_score_gemma":0.0051451228,"teacher_disagreement_score":0.9197421,"about_ca_system_score_codex":0.00025235082,"about_ca_system_score_gemma":0.00035013162,"threshold_uncertainty_score":0.99993926},"labels":[],"label_agreement":null},{"id":"W2157665660","doi":"10.1109/tcomm.2010.10.080336","title":"A Novel High Data Rate Modulation Scheme Based on Chaotic Signal Separation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","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 Calgary","funders":"","keywords":"Additive white Gaussian noise; Computer science; Chaotic; Transmission (telecommunications); Modulation (music); Channel (broadcasting); Electronic engineering; Gaussian noise; SIGNAL (programming language); Data transmission; Noise (video); Signal-to-noise ratio (imaging); Algorithm; Telecommunications; Computer network; Engineering; Artificial intelligence; Acoustics; Physics","score_opus":0.0406786402846217,"score_gpt":0.2968420914863423,"score_spread":0.25616345120172057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157665660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015050148,0.000003045795,0.97984,0.0021676777,0.0002972787,0.00037444636,0.000488087,0.00009447238,0.0016848919],"genre_scores_gemma":[0.98833656,0.0000027885324,0.009799868,0.00013986239,0.00013625741,0.0001183791,0.0011767494,0.00002733362,0.00026219134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894536,0.00009691875,0.0002944162,0.00031184504,0.00017700247,0.0001744631],"domain_scores_gemma":[0.9967389,0.00029116633,0.00012591087,0.0026278866,0.00013855872,0.000077586454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025168833,0.00017878166,0.00015169464,0.00014928322,0.0006502529,0.000095985524,0.000763116,0.00007401439,0.0006843402],"category_scores_gemma":[0.00000483586,0.00018634349,0.00007297426,0.00030945867,0.00008499729,0.00035179278,0.000007726429,0.0005252637,0.00014444701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020006551,0.006073418,0.0005528567,0.000021615393,0.00029171995,4.2168057e-7,0.00041120267,0.4991939,0.3305714,0.056836985,0.0007058413,0.105140544],"study_design_scores_gemma":[0.0010531712,0.00004825091,0.001098541,0.000018436627,0.00004913991,3.8100947e-7,0.00002231977,0.99215525,0.0035212035,0.0006382515,0.001199954,0.00019509596],"about_ca_topic_score_codex":0.0002288335,"about_ca_topic_score_gemma":0.0003173885,"teacher_disagreement_score":0.97328645,"about_ca_system_score_codex":0.00003309458,"about_ca_system_score_gemma":0.00012389493,"threshold_uncertainty_score":0.7598867},"labels":[],"label_agreement":null},{"id":"W2157833158","doi":"10.1109/tcomm.2003.813261","title":"New analytical probability of error expressions for classes of orthogonal signals in rayleigh fading","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Alberta","funders":"","keywords":"Biorthogonal system; Rayleigh fading; Fading; Bit error rate; Mathematics; Probability of error; Phase-shift keying; Algorithm; Fading distribution; Rayleigh scattering; Electronic engineering; Topology (electrical circuits); Computer science; Decoding methods; Physics; Combinatorics; Engineering; Optics; Wavelet; Wavelet transform","score_opus":0.08878234410684217,"score_gpt":0.34360750796606476,"score_spread":0.2548251638592226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157833158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011044531,0.00024343906,0.98571336,0.00013635757,0.000042272593,0.000614281,0.000084771316,0.00017411016,0.0019468965],"genre_scores_gemma":[0.8077798,0.00030244634,0.19156657,0.000006233218,0.0000020654832,0.00026895988,0.000006670469,0.000025036794,0.00004224566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872357,0.0001589827,0.0006746473,0.00014360971,0.00013088773,0.00016832344],"domain_scores_gemma":[0.99673086,0.0012139888,0.000099627,0.0017419292,0.00013924847,0.000074320706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027210632,0.00015135373,0.0003168309,0.00028297093,0.00011107044,0.000006550879,0.0006858302,0.00011508372,0.000061688654],"category_scores_gemma":[0.00006578433,0.00016633498,0.00015191137,0.0005599346,0.00016112655,0.00017301078,0.0000053909584,0.00034332904,0.0000014464649],"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.00007999822,0.0017121976,0.0005449398,0.000278959,0.00019220785,1.9360658e-7,0.0011249086,0.77946746,0.12326637,0.068159424,0.00032693287,0.02484643],"study_design_scores_gemma":[0.0012211888,0.00016839505,0.0004925113,0.0005180468,0.00009819825,0.0000036577085,0.00043427068,0.12776278,0.8361608,0.029628938,0.0030114618,0.0004997395],"about_ca_topic_score_codex":0.00002103024,"about_ca_topic_score_gemma":0.0002155248,"teacher_disagreement_score":0.7967352,"about_ca_system_score_codex":0.00009338112,"about_ca_system_score_gemma":0.000104579005,"threshold_uncertainty_score":0.67829436},"labels":[],"label_agreement":null},{"id":"W2157877316","doi":"10.1109/tcomm.2010.03.080456","title":"Index assignment optimization for joint source-channel MAP decoding","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Decoding methods; Maximum a posteriori estimation; Algorithm; List decoding; Simulated annealing; Hamming distance; Computer science; Sequential decoding; Assignment problem; Gaussian; Markov chain; Mathematical optimization; Mathematics; Statistics; Concatenated error correction code; Block code; Maximum likelihood","score_opus":0.04814961760117752,"score_gpt":0.2931908962022027,"score_spread":0.24504127860102515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157877316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018414659,0.000015880929,0.99312776,0.003769001,0.0009162599,0.00057839055,0.00000892308,0.0008517759,0.0005478773],"genre_scores_gemma":[0.589592,0.00002741143,0.40953213,0.0001502587,0.000019133817,0.0004176202,0.0000039551655,0.000020294186,0.00023723723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882513,0.00009120342,0.0003277007,0.00031878575,0.00019216974,0.0002450015],"domain_scores_gemma":[0.99660146,0.00037675133,0.00014232204,0.002592014,0.00018967272,0.000097765864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004679026,0.00016817036,0.000144913,0.00028544187,0.000904776,0.00015858129,0.0016984653,0.00013126642,0.00002086377],"category_scores_gemma":[0.000029543942,0.00018784252,0.00013891178,0.0003247242,0.0000842217,0.00029367892,0.000024485353,0.000557505,0.000019202222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003024767,0.0016216353,0.000036329355,0.00004650021,0.00012774477,6.1337175e-7,0.0032729052,0.72520536,0.015587635,0.009669469,0.0027800675,0.2416215],"study_design_scores_gemma":[0.00022523383,0.0000859162,0.000011509639,0.000028313438,0.000013481251,0.0000087060625,0.000057996935,0.9787316,0.015915073,0.0015213408,0.0031845903,0.0002162673],"about_ca_topic_score_codex":0.000042043997,"about_ca_topic_score_gemma":0.00027464383,"teacher_disagreement_score":0.5894078,"about_ca_system_score_codex":0.000088640576,"about_ca_system_score_gemma":0.00008163796,"threshold_uncertainty_score":0.76599956},"labels":[],"label_agreement":null},{"id":"W2158628801","doi":"10.1109/tcomm.2004.823584","title":"Optimization of Linear Iterative Interference-Cancellation Receivers for CDMA Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Single antenna interference cancellation; Eigendecomposition of a matrix; Iterative method; Decorrelation; Convergence (economics); Interference (communication); Code division multiple access; Multiuser detection; Eigenvalues and eigenvectors; Computer science; Spread spectrum; Algorithm; Mathematics; Channel (broadcasting); Mathematical optimization; Telecommunications; Decoding methods","score_opus":0.0832216226944393,"score_gpt":0.34061162102383974,"score_spread":0.25738999832940046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158628801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016131903,0.0002441724,0.9870881,0.008697104,0.0001769845,0.00095118344,0.00007613333,0.00020883053,0.0023962182],"genre_scores_gemma":[0.5831197,0.0021067571,0.41407943,0.000081470775,0.0000099797035,0.00038933597,0.000051489245,0.00001914206,0.00014266993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979634,0.00040535413,0.00068412605,0.0003542766,0.00030330344,0.00028949475],"domain_scores_gemma":[0.9908882,0.0010839215,0.0003333953,0.006649364,0.0009251808,0.00011993498],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00048542375,0.00022017835,0.00028342823,0.0004464667,0.0011495132,0.00010717536,0.005728461,0.0001473856,0.000022785973],"category_scores_gemma":[0.000044550812,0.00024395018,0.00018848245,0.0013215246,0.0005012074,0.0007901242,0.00008996281,0.00055657723,0.000026871681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042329637,0.00077651767,0.0000056676877,0.000020651823,0.00009028518,8.9364406e-8,0.0026263117,0.91644436,0.00068285246,0.057175294,0.00009553645,0.022040088],"study_design_scores_gemma":[0.0011481014,0.00026607394,0.000023187791,0.0001787238,0.00002956054,0.0000035932042,0.0002294658,0.98392445,0.009054444,0.0027186177,0.002152641,0.0002711508],"about_ca_topic_score_codex":0.00009490155,"about_ca_topic_score_gemma":0.00032369109,"teacher_disagreement_score":0.5829584,"about_ca_system_score_codex":0.00030801262,"about_ca_system_score_gemma":0.00033608332,"threshold_uncertainty_score":0.999651},"labels":[],"label_agreement":null},{"id":"W2158946869","doi":"10.1109/tcomm.2013.112213.130302","title":"MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of Freedom","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Codebook; Degrees of freedom (physics and chemistry); Secrecy; MIMO; Channel (broadcasting); Artificial noise; Computer science; Linear subspace; Subspace topology; Information-theoretic security; Computer network; Transmitter; Mathematics; Computer security; Algorithm; Artificial intelligence; Physics","score_opus":0.025662316516211533,"score_gpt":0.2507151855061691,"score_spread":0.22505286898995758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158946869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022671575,0.00036241446,0.9624709,0.0004626773,0.00011466546,0.00043339483,0.00009145792,0.0014350816,0.011957829],"genre_scores_gemma":[0.9480979,0.0010091444,0.050465748,0.000024913345,0.000016863081,0.00020637865,0.00003081196,0.00007546552,0.00007278603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872017,0.00023144201,0.000413643,0.0001892096,0.00021584347,0.00022967323],"domain_scores_gemma":[0.9952672,0.00030105785,0.000087119224,0.004019256,0.000194104,0.00013126068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023640237,0.000246947,0.00029617272,0.00030180762,0.00032638505,0.00003924479,0.0016317071,0.00014339144,0.000038002432],"category_scores_gemma":[0.000005874879,0.0002519739,0.000094891344,0.00048383037,0.00035555815,0.000250048,0.000010210271,0.00057490217,0.000026156451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008545654,0.0019633574,0.000050244656,0.00016052375,0.0003704976,5.961075e-7,0.004893798,0.86411774,0.009615167,0.024562392,0.00034445443,0.093835756],"study_design_scores_gemma":[0.00079701195,0.00056739716,0.00036402867,0.00027080657,0.0001110569,0.000023388251,0.0004277468,0.95412755,0.028502638,0.00057786267,0.013562281,0.0006682395],"about_ca_topic_score_codex":0.0002404478,"about_ca_topic_score_gemma":0.0019688904,"teacher_disagreement_score":0.9254263,"about_ca_system_score_codex":0.00006810902,"about_ca_system_score_gemma":0.000031462892,"threshold_uncertainty_score":0.99999326},"labels":[],"label_agreement":null},{"id":"W2159041520","doi":"10.1109/tcomm.2011.081111.100300","title":"On Computation of Performance Bounds of Optimal Index Assignment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Algorithms and Data Compression","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":"Blackberry (Canada); McMaster University","funders":"","keywords":"Quadratic assignment problem; Mathematical optimization; Assignment problem; Heuristic; Computation; Index (typography); Computer science; Resilience (materials science); Channel (broadcasting); Weapon target assignment problem; Upper and lower bounds; Quadratic equation; Optimization problem; Algorithm; Frequency assignment; Mathematics; Telecommunications","score_opus":0.053607851987623335,"score_gpt":0.27326439195972874,"score_spread":0.2196565399721054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159041520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011728093,0.000030327525,0.98499817,0.00008576657,0.00015671067,0.00013606192,0.000021498863,0.000052379317,0.0027910112],"genre_scores_gemma":[0.9174406,0.00010609225,0.08234799,0.000026967924,0.0000027618682,0.000027305863,0.0000042335864,0.0000064113474,0.000037643505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905974,0.00008859131,0.00032888242,0.00016387067,0.00024564695,0.000113252],"domain_scores_gemma":[0.9979736,0.00013698173,0.00017381107,0.0015464388,0.00012071906,0.000048453327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001637341,0.00010250771,0.00014387479,0.00018111947,0.00023436513,0.000015739392,0.001254576,0.0000527554,0.000024153147],"category_scores_gemma":[0.0000022860916,0.000097289405,0.00006659187,0.00032676724,0.0001401057,0.00035083137,0.0000205533,0.00019989786,0.000014543808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002675529,0.008991215,0.00027171787,0.00012694264,0.00026142987,0.0000015114791,0.010258817,0.24016249,0.004470618,0.067813806,0.00044418612,0.6669297],"study_design_scores_gemma":[0.00058586535,0.00076019444,0.0031629729,0.00017320528,0.00002175554,0.000004631405,0.00008644096,0.95109475,0.042434745,0.0011535925,0.00032774254,0.00019412188],"about_ca_topic_score_codex":0.00006517717,"about_ca_topic_score_gemma":0.000007752088,"teacher_disagreement_score":0.9057125,"about_ca_system_score_codex":0.000035746823,"about_ca_system_score_gemma":0.000060082293,"threshold_uncertainty_score":0.39673468},"labels":[],"label_agreement":null},{"id":"W2159453617","doi":"10.1109/tcomm.2011.112811.100146a","title":"Design of Pre-Rake DS-UWB Downlink with Pre-Equalization","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Rake; Rake receiver; Telecommunications link; Computer science; Electronic engineering; Transmitter; Intersymbol interference; Equalization (audio); Base station; Ultra-wideband; Channel (broadcasting); Engineering; Fading; Telecommunications","score_opus":0.044577978631153085,"score_gpt":0.24496479696618023,"score_spread":0.20038681833502714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159453617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041826316,0.00033072528,0.9888359,0.00017810878,0.00007676934,0.0005715033,0.00003747998,0.0008524144,0.0049344683],"genre_scores_gemma":[0.91153514,0.0018857669,0.08586966,0.000024951796,0.000003575988,0.0004656267,0.000020679434,0.00005538112,0.00013921008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881667,0.00017164885,0.0004714642,0.00017073964,0.00015111882,0.00021833299],"domain_scores_gemma":[0.99577826,0.0003106262,0.00010400873,0.0035829998,0.00016195084,0.00006213664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017892919,0.00021385055,0.00023926562,0.00034608817,0.00028184048,0.000014468262,0.0014237615,0.00018316007,0.00012194699],"category_scores_gemma":[0.000007786877,0.00021358745,0.00006710722,0.0007742543,0.00031727157,0.00022299933,0.0000072764988,0.00049366173,0.00003678665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004838596,0.004255638,0.00022409414,0.00020550993,0.0013789203,0.0000019066599,0.021684164,0.8059613,0.05037961,0.014314403,0.0006524458,0.10045816],"study_design_scores_gemma":[0.0034166824,0.0018350974,0.003144469,0.0005981578,0.0009786942,0.00011252561,0.0014840584,0.36491713,0.60520124,0.0080836555,0.008124483,0.0021037825],"about_ca_topic_score_codex":0.00009350894,"about_ca_topic_score_gemma":0.00031021982,"teacher_disagreement_score":0.9073525,"about_ca_system_score_codex":0.000077052,"about_ca_system_score_gemma":0.000053986783,"threshold_uncertainty_score":0.8709844},"labels":[],"label_agreement":null},{"id":"W2159478385","doi":"10.1109/tcomm.2004.833044","title":"High-Order Spectral-Null Multimode Codes","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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":"Scrambling; Multi-mode optical fiber; Coding (social sciences); Null (SQL); Algorithm; Mathematics; Computer science; Concatenated error correction code; Block code; Decoding methods; Telecommunications; Optical fiber; Statistics","score_opus":0.024820448395127773,"score_gpt":0.26444082072791125,"score_spread":0.2396203723327835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159478385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003697533,0.000092137896,0.98762906,0.005532971,0.00031660328,0.00017282486,0.000025197178,0.0004871987,0.0020464736],"genre_scores_gemma":[0.7692954,0.00022747915,0.2299753,0.000301103,0.000011955245,0.00006841519,0.0000038737217,0.000011220536,0.00010527262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989438,0.00013471923,0.0002329029,0.00027767057,0.00016885107,0.00024206737],"domain_scores_gemma":[0.99664295,0.00023989387,0.000058489335,0.0028602444,0.00009782406,0.00010062613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019007004,0.00016322744,0.00014711858,0.0002335461,0.0008252035,0.00012527904,0.0021870523,0.00007018887,0.000056997094],"category_scores_gemma":[0.0000048298502,0.00016914545,0.00014329137,0.0009284978,0.00019407264,0.0004001178,0.000012772411,0.00040320237,0.00021237409],"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.000014648278,0.0013352422,0.0000045521174,0.0000061868896,0.00009332601,0.0000023134992,0.0014731166,0.048492666,0.003279113,0.9163308,0.00007898224,0.02888901],"study_design_scores_gemma":[0.0048351977,0.0008726832,0.0010132184,0.00026061857,0.00019140748,0.00009334378,0.00036244083,0.047837887,0.13324152,0.78864825,0.0206695,0.0019739363],"about_ca_topic_score_codex":0.00024972568,"about_ca_topic_score_gemma":0.0005389839,"teacher_disagreement_score":0.7655978,"about_ca_system_score_codex":0.00006732661,"about_ca_system_score_gemma":0.00008028067,"threshold_uncertainty_score":0.6897551},"labels":[],"label_agreement":null},{"id":"W2159519002","doi":"10.1109/tcomm.2009.11.080180","title":"Performance of BICM-SC and BICM-OFDM systems with diversity reception in non-gaussian noise and interference","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Fading; Algorithm; Additive white Gaussian noise; Nakagami distribution; Orthogonal frequency-division multiplexing; Bit error rate; Mathematics; Gaussian noise; Interference (communication); Topology (electrical circuits); Electronic engineering; Telecommunications; Computer science; Statistics; Decoding methods; Channel (broadcasting); White noise; Combinatorics; Engineering","score_opus":0.016931323295998675,"score_gpt":0.23450784083588655,"score_spread":0.21757651753988788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159519002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69190264,0.00039352613,0.30523318,0.00026314912,0.000038028065,0.00041612305,0.000023193854,0.00026368714,0.0014664662],"genre_scores_gemma":[0.98327947,0.009223117,0.007388814,0.000011144084,0.0000021289816,0.000052412666,0.0000048058123,0.000012655335,0.00002546422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938554,0.000053770316,0.00023961674,0.00012249603,0.000083479616,0.00011508716],"domain_scores_gemma":[0.9987373,0.00009222453,0.000056916273,0.0010095533,0.00005480734,0.000049197657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010859507,0.0001322846,0.00017930276,0.00021374474,0.00023883942,0.000017798211,0.00041075185,0.00007214171,0.0000028657932],"category_scores_gemma":[0.000001696311,0.00013508274,0.000017143406,0.00033408258,0.00016420953,0.00032921284,0.000013857774,0.000345343,0.0000017858437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044941044,0.0016378639,0.026464717,0.0007075859,0.00021288647,0.0000022424917,0.014553189,0.31623998,0.07009731,0.0019821455,0.000082419385,0.5675702],"study_design_scores_gemma":[0.0015261781,0.0009935036,0.12530553,0.0018584629,0.000087393884,0.00003605512,0.0011850565,0.83594483,0.03174538,0.00022091687,0.00026656635,0.0008301169],"about_ca_topic_score_codex":0.00009382449,"about_ca_topic_score_gemma":0.00020299545,"teacher_disagreement_score":0.5667401,"about_ca_system_score_codex":0.00007291322,"about_ca_system_score_gemma":0.000009254955,"threshold_uncertainty_score":0.5508514},"labels":[],"label_agreement":null},{"id":"W2159690431","doi":"10.1109/tcomm.2009.12.080231","title":"Approximate BER Expressions of Distributed Alamouti's Code in Dissimilar Cooperative Networks with Blind Relays","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bit error rate; Code (set theory); Algorithm; Signal-to-noise ratio (imaging); Computer science; Transmission (telecommunications); Channel (broadcasting); Range (aeronautics); Expression (computer science); Topology (electrical circuits); Mathematics; Theoretical computer science; Telecommunications; Decoding methods; Combinatorics; Engineering","score_opus":0.04440532180878933,"score_gpt":0.2974751012675554,"score_spread":0.2530697794587661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159690431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015934152,0.00043969936,0.9901555,0.005154091,0.00006006543,0.00062926474,0.00005559783,0.00015331617,0.0017590345],"genre_scores_gemma":[0.9713841,0.0027023419,0.02527817,0.00025276642,0.0000066704893,0.00020068325,0.000043099993,0.0000143479,0.000117818956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981097,0.00048414132,0.000540809,0.00034754002,0.00021825606,0.00029957265],"domain_scores_gemma":[0.9956727,0.00047816697,0.00017981438,0.0032693183,0.0002744194,0.0001255484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000314214,0.00024250647,0.0003226161,0.00023913891,0.00067699864,0.00009151552,0.0022814602,0.00011165492,0.000029593157],"category_scores_gemma":[0.000014361383,0.00021308292,0.00008783947,0.0016693071,0.00024138368,0.00049250096,0.00003352184,0.00076946226,0.000005707772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028226277,0.0045275623,0.00016651604,0.000013001202,0.000151308,0.000007025112,0.004950625,0.8626249,0.0036096282,0.06257272,0.00073386665,0.060360573],"study_design_scores_gemma":[0.0022886803,0.00039465036,0.0022052473,0.00048532474,0.000042498858,0.000014103945,0.00024779784,0.9859822,0.004781605,0.0003790546,0.0026522302,0.000526629],"about_ca_topic_score_codex":0.000008742806,"about_ca_topic_score_gemma":0.0005255847,"teacher_disagreement_score":0.9697907,"about_ca_system_score_codex":0.00010331513,"about_ca_system_score_gemma":0.00011949832,"threshold_uncertainty_score":0.86892694},"labels":[],"label_agreement":null},{"id":"W2159690504","doi":"10.1109/tcomm.2004.836560","title":"Near-Capacity Coding in Multicarrier Modulation Systems","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Low-density parity-check code; Quadrature amplitude modulation; Algorithm; Coding gain; QAM; Noisy-channel coding theorem; Decoding methods; Code rate; Additive white Gaussian noise; Constellation diagram; Variable-length code; Mathematics; Computer science; Bit error rate; Forward error correction; Channel capacity; Channel (broadcasting); Telecommunications; Error floor","score_opus":0.04124309118670567,"score_gpt":0.27208558495783325,"score_spread":0.2308424937711276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159690504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045850515,0.0001697069,0.9501416,0.00027520943,0.00016718099,0.00044740248,0.000033286648,0.0010458113,0.0018692511],"genre_scores_gemma":[0.95575535,0.00096512714,0.042762082,0.000022462857,0.000006610638,0.00040957172,0.000011060636,0.000045639466,0.00002211195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999006,0.00009169223,0.0004047695,0.00014809826,0.0001429044,0.00020658111],"domain_scores_gemma":[0.9976165,0.00018593759,0.000046669164,0.0020119736,0.00007001636,0.000068848065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015824662,0.00017024386,0.00018308875,0.00021933812,0.0003428343,0.00006122083,0.00070303265,0.00012615399,0.000009631882],"category_scores_gemma":[0.000008735835,0.00020701275,0.0000621435,0.00051784865,0.0001637897,0.00035366236,0.0000052535597,0.0006216502,0.00004829659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003115623,0.00012724937,0.000025176436,0.000016954229,0.000016858672,2.5006236e-7,0.0005728893,0.9858698,0.004331981,0.004333717,0.0000061257297,0.004695836],"study_design_scores_gemma":[0.0006890115,0.000026867645,0.0008905836,0.00022620188,0.000015841992,0.000007731129,0.0002005727,0.97695446,0.017219039,0.0018897109,0.0015050579,0.0003749403],"about_ca_topic_score_codex":0.00018489626,"about_ca_topic_score_gemma":0.0003639454,"teacher_disagreement_score":0.90990484,"about_ca_system_score_codex":0.00047053013,"about_ca_system_score_gemma":0.000026980302,"threshold_uncertainty_score":0.8441735},"labels":[],"label_agreement":null},{"id":"W2160220809","doi":"10.1109/26.886468","title":"Further analytical results on the joint detection of cochannel signals using diversity arrays","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Simon Fraser University","funders":"","keywords":"Fading; Computer science; Joint (building); Antenna diversity; Electronic engineering; Antenna (radio); Diversity combining; Algorithm; Binary number; Channel (broadcasting); Cooperative diversity; Keying; Phase-shift keying; Base station; Telecommunications; Mathematics; Bit error rate; Engineering; Arithmetic","score_opus":0.1372381799922359,"score_gpt":0.31412351537987143,"score_spread":0.17688533538763554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160220809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024616074,0.00006092961,0.9600194,0.01028289,0.00008586893,0.00041760912,0.000037135036,0.00014022565,0.004339853],"genre_scores_gemma":[0.995396,0.00048819633,0.0035660227,0.00018973403,0.000013960871,0.00003708275,0.0000022992783,0.000013249139,0.0002934427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757415,0.0009147808,0.00045413704,0.000286607,0.00050886377,0.0002614831],"domain_scores_gemma":[0.99339104,0.0013493606,0.00013931969,0.0047807842,0.00023865022,0.00010087742],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009154772,0.00015935178,0.00019815579,0.00023391552,0.0016576704,0.00008473009,0.0033581504,0.00010134541,0.000118500815],"category_scores_gemma":[0.000026172262,0.0001337663,0.00018109032,0.0011718753,0.00040819566,0.00026776124,0.0000752992,0.0007498402,0.00010953459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032501714,0.0025543116,0.000007138133,0.000015163225,0.00033292742,0.0000018730067,0.0070579527,0.78843963,0.013049034,0.009095638,0.0003965008,0.17872484],"study_design_scores_gemma":[0.00039576387,0.00013802807,0.00018022886,0.000071568946,0.000025565423,0.000005479825,0.00016675927,0.9805598,0.016843546,0.00082319137,0.000623746,0.00016626866],"about_ca_topic_score_codex":0.00027327536,"about_ca_topic_score_gemma":0.00016522635,"teacher_disagreement_score":0.97077996,"about_ca_system_score_codex":0.00014078408,"about_ca_system_score_gemma":0.00007380396,"threshold_uncertainty_score":0.999642},"labels":[],"label_agreement":null},{"id":"W2161238678","doi":"10.1109/tcomm.2013.052013.120256","title":"Asynchronous Compute-and-Forward","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous communication; Computer science; Electronic engineering; Telecommunications; Engineering","score_opus":0.038793094402356475,"score_gpt":0.27601687934020247,"score_spread":0.237223784937846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161238678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008377467,0.0005384935,0.9790643,0.011971459,0.00016949844,0.00032800742,0.0000026641544,0.0003442033,0.0067436476],"genre_scores_gemma":[0.9077961,0.0034336038,0.087257914,0.00094503234,0.000011064561,0.00022018664,0.0000025496986,0.000012045996,0.0003214929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988856,0.00023924265,0.00027095282,0.00025122156,0.00014089851,0.00021212338],"domain_scores_gemma":[0.9962595,0.00041005373,0.00006557565,0.0029481277,0.0001739475,0.00014277305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016429042,0.00015623581,0.00015548836,0.00015990034,0.0009678502,0.0002675535,0.0021545086,0.000060490613,0.00011850428],"category_scores_gemma":[0.0000055703545,0.00015639019,0.00007317882,0.0004860025,0.00017624488,0.00058516854,0.000052441374,0.0004053159,0.00052344904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001757518,0.0004017644,0.000022996808,0.0000058723012,0.00006511722,3.8811856e-7,0.001216624,0.0012053084,0.00086071424,0.101882376,0.0017560916,0.892581],"study_design_scores_gemma":[0.0008333096,0.00020712898,0.0022802697,0.00008547593,0.000029087805,0.00004588299,0.00012859605,0.9458944,0.0023134483,0.006196464,0.0412961,0.0006898182],"about_ca_topic_score_codex":0.00003874787,"about_ca_topic_score_gemma":0.00009214402,"teacher_disagreement_score":0.9446891,"about_ca_system_score_codex":0.00006133179,"about_ca_system_score_gemma":0.00005217689,"threshold_uncertainty_score":0.74440193},"labels":[],"label_agreement":null},{"id":"W2161272050","doi":"10.1109/tcomm.2006.877962","title":"Dual methods for nonconvex spectrum optimization of multicarrier systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1634,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Optimization problem; Duality gap; Convexity; Duality (order theory); Computer science; Strong duality; Dual (grammatical number); Convex optimization; Maximization; Mathematics; Algorithm; Regular polygon","score_opus":0.020313368459116538,"score_gpt":0.299815892806152,"score_spread":0.2795025243470355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161272050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008436061,0.0004501577,0.99652135,0.00010842874,0.0004913521,0.00061980257,0.00009510941,0.00032804382,0.0013014108],"genre_scores_gemma":[0.52192646,0.00033456422,0.47718492,0.0000047053436,0.000033245007,0.00028592194,0.000054182747,0.00004752609,0.00012846144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904025,0.00010085202,0.00044891555,0.0001382537,0.0000859161,0.00018579344],"domain_scores_gemma":[0.99824154,0.0005492182,0.00008619122,0.000959687,0.00012144582,0.00004192969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016617517,0.00015627919,0.00021957983,0.00017304039,0.00021095738,0.000023132721,0.00027231933,0.000111797475,0.000019659768],"category_scores_gemma":[0.000005818642,0.00018184801,0.000097344455,0.00038851475,0.00009675462,0.00017621617,0.0000020502441,0.00017623973,0.0000037134505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008887155,0.00008808684,0.0000017473441,0.000032210282,0.000039883,3.9965407e-8,0.00005218201,0.994113,0.00112448,0.0013024001,0.000074780626,0.003162259],"study_design_scores_gemma":[0.0004013477,0.00002791545,0.0000068759487,0.00003490519,0.0000610657,0.000002509287,0.00004946493,0.9869511,0.010558909,0.00018580971,0.001557707,0.00016237437],"about_ca_topic_score_codex":0.000034609762,"about_ca_topic_score_gemma":0.000039703664,"teacher_disagreement_score":0.5218421,"about_ca_system_score_codex":0.0001062164,"about_ca_system_score_gemma":0.000020552294,"threshold_uncertainty_score":0.7415547},"labels":[],"label_agreement":null},{"id":"W2162104643","doi":"10.1109/tcomm.2005.863788","title":"Service differentiation in multirate wireless networks with weighted round-robin scheduling and ARQ-based error control","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 Manitoba","funders":"","keywords":"Computer science; Scheduling (production processes); Fading; Computer network; Link adaptation; Wireless network; Automatic repeat request; Hybrid automatic repeat request; Wireless; Physical layer; Weighted round robin; Round-robin scheduling; Quality of service; Channel (broadcasting); Fair-share scheduling; Telecommunications; Telecommunications link; Mathematical optimization; Mathematics","score_opus":0.010117588710305284,"score_gpt":0.2130373673373874,"score_spread":0.2029197786270821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162104643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11291401,0.00022392692,0.88557047,0.00033714436,0.00008437056,0.00042332764,0.000020815638,0.00034487533,0.00008106058],"genre_scores_gemma":[0.9739401,0.00022666105,0.02528983,0.000078999255,0.0000203707,0.00026826555,0.000096510645,0.000066180866,0.00001308967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896103,0.000110286084,0.00035031233,0.0002060722,0.00011545627,0.0002568448],"domain_scores_gemma":[0.99877757,0.00027300903,0.00007686092,0.000715235,0.00010286055,0.000054450706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008264472,0.00023279995,0.0002239179,0.0002161707,0.0002918191,0.000060338967,0.00024429892,0.00013214166,0.000008256416],"category_scores_gemma":[6.6386144e-7,0.00024705162,0.000032899654,0.0007256467,0.00006951126,0.0002753107,0.0000019425718,0.00046557683,0.000004197955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004168296,0.00015582713,0.00023225021,0.000019741154,0.000025971529,5.2073005e-7,0.00005132544,0.99542373,0.00082057464,0.000084899024,0.0000027259655,0.003140745],"study_design_scores_gemma":[0.0018760873,0.000024499597,0.0013301406,0.0001423594,0.000049307047,0.0000019286756,0.000045325476,0.9953789,0.0008184806,0.000038958035,0.000029015642,0.00026501072],"about_ca_topic_score_codex":0.00019207505,"about_ca_topic_score_gemma":0.007891961,"teacher_disagreement_score":0.8610261,"about_ca_system_score_codex":0.00015347882,"about_ca_system_score_gemma":0.000021671367,"threshold_uncertainty_score":0.99999815},"labels":[],"label_agreement":null},{"id":"W2162184199","doi":"10.1109/tcomm.2010.072710.090036","title":"A Low Complexity Receiver for Noncoherent Amplify-and-Forward Cooperative Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Frequency-shift keying; Diversity gain; Computer science; Keying; Signal-to-noise ratio (imaging); Time diversity; Antenna diversity; Channel (broadcasting); Electronic engineering; Bit error rate; Diversity combining; Diversity scheme; Energy (signal processing); Telecommunications; Mathematics; MIMO; Orthogonal frequency-division multiplexing; Wireless; Fading; Engineering; Demodulation; Power (physics); Statistics; Physics","score_opus":0.08433162697910217,"score_gpt":0.32220483267574895,"score_spread":0.23787320569664677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162184199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014440663,0.00019703699,0.98986095,0.0044727377,0.0007096384,0.00096226175,0.00007361861,0.00025366043,0.0020260164],"genre_scores_gemma":[0.9525448,0.0013381963,0.044240933,0.00038722574,0.000032402262,0.0008154066,0.000019690608,0.000019710295,0.0006016436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857616,0.00028863613,0.00037157384,0.00035143926,0.00016047982,0.00025171705],"domain_scores_gemma":[0.99545574,0.0009127482,0.000116596166,0.0029299597,0.00042093097,0.00016404098],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004308,0.00021163186,0.00024885262,0.00014902798,0.0016092639,0.0003166007,0.0020444724,0.00011604272,0.00003649856],"category_scores_gemma":[0.000024185583,0.0002063346,0.0000954474,0.00043166956,0.00036665832,0.00039934885,0.000043037042,0.0007749048,0.00005033511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006176614,0.0018058347,0.00002165776,0.00006810117,0.0002220513,6.9542165e-7,0.004463518,0.0041992953,0.017046925,0.74628365,0.0034106602,0.22241588],"study_design_scores_gemma":[0.0019928843,0.0003850813,0.0003539616,0.00015179327,0.00006811274,0.00004088624,0.0003041452,0.84074706,0.007002292,0.0018832642,0.14618406,0.0008864901],"about_ca_topic_score_codex":0.000035044668,"about_ca_topic_score_gemma":0.0012050091,"teacher_disagreement_score":0.9511007,"about_ca_system_score_codex":0.000061155144,"about_ca_system_score_gemma":0.00011028138,"threshold_uncertainty_score":0.99969053},"labels":[],"label_agreement":null},{"id":"W2162344044","doi":"10.1109/tcomm.2010.04.090007","title":"Coded multipulse pulse-position modulation for free-space optical communications","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"University of British Columbia","funders":"","keywords":"Pulse-position modulation; Computer science; Electronic engineering; Bandwidth (computing); Coding (social sciences); Modulation (music); Pulse-amplitude modulation; Transmission (telecommunications); Optical communication; Binary number; Constellation; Algorithm; Telecommunications; Pulse (music); Mathematics; Engineering; Physics","score_opus":0.04177386960490998,"score_gpt":0.3161985241301165,"score_spread":0.27442465452520654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162344044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016843092,0.000032058208,0.971634,0.020674856,0.0006643293,0.0010633556,0.00007940639,0.0014715211,0.0026961905],"genre_scores_gemma":[0.5567712,0.00006430581,0.44207758,0.00015836617,0.000018996032,0.00068411976,0.000029401921,0.000026860533,0.00016915731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813795,0.0002234417,0.00051436684,0.00046907962,0.000296624,0.00035855288],"domain_scores_gemma":[0.98690116,0.0016803779,0.00019034668,0.01055153,0.0005086742,0.00016790906],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00063137134,0.00026916605,0.00024226148,0.00036490805,0.0016054453,0.00023781155,0.0061339424,0.0002581841,0.000015811442],"category_scores_gemma":[0.00013709835,0.0003074148,0.00022688511,0.0007193424,0.00035809062,0.0008040902,0.00008775155,0.001145914,0.000052238564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008480443,0.0039994707,0.00005179524,0.00004799836,0.00017369154,0.0000012320377,0.003060247,0.00412185,0.2849521,0.45856443,0.0025566008,0.24238577],"study_design_scores_gemma":[0.00084096135,0.00019726976,0.00034186488,0.00005561004,0.000064402724,0.000036370388,0.00006562392,0.9151059,0.060840003,0.016379438,0.0055692303,0.00050335756],"about_ca_topic_score_codex":0.00014672863,"about_ca_topic_score_gemma":0.0022650617,"teacher_disagreement_score":0.91098404,"about_ca_system_score_codex":0.00013845124,"about_ca_system_score_gemma":0.00012632959,"threshold_uncertainty_score":0.9999378},"labels":[],"label_agreement":null},{"id":"W2162490297","doi":"10.1109/tcomm.2006.873983","title":"Decision-feedback detection for block differential space-time modulation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Differential (mechanical device); Modulation (music); Bandwidth (computing); Rayleigh fading; Control theory (sociology); Computer science; Electronic engineering; Signal-to-noise ratio (imaging); Mathematics; Algorithm; Channel (broadcasting); Telecommunications; Physics; Engineering; Acoustics","score_opus":0.012780574054879614,"score_gpt":0.24795844608900752,"score_spread":0.2351778720341279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162490297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012580123,0.0001133752,0.9831187,0.00021634827,0.00024238238,0.00071771303,0.00009578295,0.0015596505,0.0013559111],"genre_scores_gemma":[0.9339995,0.0003660971,0.06430944,0.000012173251,0.000041066014,0.0007542653,0.00005573908,0.00008071722,0.0003810103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988768,0.00006360582,0.00044944318,0.0002031881,0.00017008939,0.00023686455],"domain_scores_gemma":[0.9970515,0.0005552669,0.00007828092,0.0021015203,0.00015482014,0.00005866159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009983574,0.0002351349,0.0002189731,0.0003005644,0.00061495067,0.000058535064,0.0007203973,0.00017055961,0.000047279656],"category_scores_gemma":[0.0000062648046,0.00027549968,0.00017330535,0.00039314324,0.00010530136,0.00027434653,0.000006655626,0.0003571181,0.00009436405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051035247,0.00042135545,0.0000035606213,0.000025615225,0.00006846858,1.00403e-7,0.00007563068,0.6337243,0.16415091,0.0012162016,0.0006705972,0.19959225],"study_design_scores_gemma":[0.0006090678,0.00006117201,0.00034401187,0.000051832685,0.000054665023,0.0000052694395,0.000016628237,0.8228229,0.15976891,0.0061349007,0.009750917,0.00037969468],"about_ca_topic_score_codex":0.000032029067,"about_ca_topic_score_gemma":0.0002410674,"teacher_disagreement_score":0.9214194,"about_ca_system_score_codex":0.00022450522,"about_ca_system_score_gemma":0.000014509097,"threshold_uncertainty_score":0.9999697},"labels":[],"label_agreement":null},{"id":"W2162973902","doi":"10.1109/tcomm.2010.03.080151","title":"Efficient power allocation schemes for nonconvex sum-rate maximization on gaussian cognitive MAC","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Korea Advanced Institute of Science and Technology","keywords":"Cognitive radio; Mathematical optimization; Quadratic growth; Maximization; Relaxation (psychology); Gaussian; Quadratic equation; Interference (communication); Quadratic programming; Computer science; Quadratically constrained quadratic program; Channel (broadcasting); Simple (philosophy); Mathematics; Wireless; Algorithm; Telecommunications","score_opus":0.021656402379905064,"score_gpt":0.2764396514206182,"score_spread":0.25478324904071314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162973902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01126102,0.000026518668,0.97867745,0.0049577104,0.0007458132,0.0007188486,0.000047279595,0.00023891621,0.0033264472],"genre_scores_gemma":[0.97368515,0.000061055354,0.025210576,0.00058551243,0.000042093667,0.00017473081,0.000030431662,0.000028583152,0.00018188845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859315,0.0001550268,0.00031955758,0.00042725104,0.00019836136,0.00030665394],"domain_scores_gemma":[0.99691755,0.0010117174,0.00013996701,0.0014371922,0.00036952912,0.00012407685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003671513,0.00021998589,0.00017528576,0.00027145792,0.0010547764,0.00019860371,0.00079219544,0.0001274694,0.00004082054],"category_scores_gemma":[0.000037991533,0.00022781659,0.00014987326,0.00058988546,0.00016933339,0.00017483665,0.000010189428,0.0005687027,0.000078604055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040201592,0.0055409456,0.000049188988,0.00004633598,0.00049956713,0.000006265983,0.0057052234,0.048039086,0.0337371,0.28976122,0.0006116897,0.61560136],"study_design_scores_gemma":[0.0011031401,0.00026791007,0.0005661912,0.000108640976,0.000059901984,0.000013000966,0.00013299748,0.9714619,0.020555506,0.0011311002,0.00418233,0.0004173951],"about_ca_topic_score_codex":0.000017543014,"about_ca_topic_score_gemma":0.00025860945,"teacher_disagreement_score":0.9624241,"about_ca_system_score_codex":0.0000715691,"about_ca_system_score_gemma":0.00010981111,"threshold_uncertainty_score":0.9290091},"labels":[],"label_agreement":null},{"id":"W2162982100","doi":"10.1109/tcomm.2005.852816","title":"Estimators Using Noisy Channel Samples for Fading Distribution Parameters","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Estimator; Fading; Channel (broadcasting); Moment (physics); Mathematics; Nakagami distribution; Noise (video); Statistics; Algorithm; M-estimator; Computer science; Telecommunications; Artificial intelligence","score_opus":0.07328313596317222,"score_gpt":0.3144403952948271,"score_spread":0.24115725933165488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162982100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005234541,0.0002554448,0.9916574,0.00046551408,0.00011809127,0.00052050996,0.00037067215,0.001202089,0.00017575847],"genre_scores_gemma":[0.734813,0.00063586683,0.26390994,0.000036823887,0.000012788999,0.00043561397,0.00009044021,0.00004904256,0.000016474167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903625,0.000054385586,0.0003741883,0.00016392588,0.000107482876,0.0002637364],"domain_scores_gemma":[0.9975307,0.0005002261,0.00006917324,0.0017211947,0.00009653624,0.000082175706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014306857,0.00020603446,0.00019429764,0.00016257771,0.0006624385,0.00004551115,0.00078051497,0.00011171111,0.000009148771],"category_scores_gemma":[0.000014985818,0.00025006186,0.00013678611,0.00032789205,0.00013671516,0.0003728888,0.0000061883625,0.00033990905,0.000014813433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007637127,0.00012291783,0.0000021852127,0.000021490998,0.00005300604,3.9462446e-8,0.00024155415,0.94827527,0.003863554,0.0010517611,0.00015704488,0.04620355],"study_design_scores_gemma":[0.0002452827,0.000025752177,0.000011856297,0.00007583542,0.000050713646,0.0000056631543,0.000120564415,0.91042733,0.0797271,0.00087123,0.008139742,0.00029893577],"about_ca_topic_score_codex":0.000025262163,"about_ca_topic_score_gemma":0.000091120564,"teacher_disagreement_score":0.72957844,"about_ca_system_score_codex":0.0003901804,"about_ca_system_score_gemma":0.000022359181,"threshold_uncertainty_score":0.9999952},"labels":[],"label_agreement":null},{"id":"W2163039436","doi":"10.1109/tcomm.2009.02.070293","title":"Optical impulse modulation for indoor diffuse wireless communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"","keywords":"Keying; Optical wireless; Channel (broadcasting); Electronic engineering; Low-pass filter; Computer science; On-off keying; High-pass filter; Wireless; Telecommunications; Bit error rate; Phase-shift keying; Bandwidth (computing); Engineering","score_opus":0.0333006113602244,"score_gpt":0.281511006509677,"score_spread":0.2482103951494526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163039436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014752936,0.0007045108,0.9632467,0.011129263,0.00022511516,0.0012505795,0.00016321088,0.0030440097,0.0054836427],"genre_scores_gemma":[0.927303,0.004065311,0.06743989,0.00018461255,0.00001672041,0.00073840335,0.00008630056,0.000063037915,0.00010269212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834555,0.00010817493,0.0006545525,0.00026574745,0.00021404838,0.00041191175],"domain_scores_gemma":[0.9917109,0.0011244873,0.00008137112,0.0067174765,0.00021674737,0.00014902628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023836616,0.0003255058,0.00034353288,0.00035616895,0.00086499844,0.000114462695,0.0031442493,0.0003343393,0.000017173877],"category_scores_gemma":[0.000040277882,0.00036478453,0.00022279823,0.0006790974,0.0004537929,0.0003666047,0.000023707327,0.0009775745,0.00009121855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005917145,0.0027255367,0.000011059518,0.000040336046,0.00019131524,4.061007e-7,0.0005948636,0.0206466,0.020461803,0.09048411,0.0007601423,0.86402464],"study_design_scores_gemma":[0.0014996753,0.00028576155,0.0005808305,0.00009397733,0.00009471542,0.000009381525,0.0003207409,0.9521517,0.02669483,0.008738378,0.008807026,0.00072294625],"about_ca_topic_score_codex":0.0000066076254,"about_ca_topic_score_gemma":0.00007625938,"teacher_disagreement_score":0.93150514,"about_ca_system_score_codex":0.00024138181,"about_ca_system_score_gemma":0.000039266328,"threshold_uncertainty_score":0.99988043},"labels":[],"label_agreement":null},{"id":"W2163192769","doi":"10.1109/tcomm.2011.062311.100352","title":"New Representations for the Gaussian Class Multivariate Weibull Distribution with Constant Correlation and Applications","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Weibull distribution; Mathematics; Cumulative distribution function; Fading; Fading distribution; Exponentiated Weibull distribution; Random variable; Gaussian; Applied mathematics; Weibull fading; Statistics; Additive white Gaussian noise; Probability density function; White noise; Rayleigh fading","score_opus":0.032815388097343474,"score_gpt":0.27276503831320453,"score_spread":0.23994965021586107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163192769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034916604,0.00039822498,0.99328214,0.00078506576,0.0000650063,0.0015500354,0.0002705509,0.0006987337,0.002915335],"genre_scores_gemma":[0.8906105,0.002009141,0.10412253,0.000040267347,0.00001703666,0.0027758898,0.00012061073,0.000049936047,0.0002541007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990827,0.00006667612,0.00034189664,0.00020226504,0.00011431236,0.00019215397],"domain_scores_gemma":[0.9968255,0.0007842557,0.00009984117,0.0020467,0.00014011785,0.000103596656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013106344,0.00019553953,0.00015046846,0.0000962195,0.000965917,0.00004655586,0.00063517183,0.00009746482,0.00002974882],"category_scores_gemma":[0.000007634467,0.00016540027,0.000062158244,0.00040765502,0.00028751694,0.00027207026,0.000008259215,0.00039603206,0.000013011759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029782267,0.00085273886,0.00018547283,0.00010836595,0.000833458,5.952684e-7,0.0054341913,0.15980524,0.0027625659,0.3601423,0.0029003718,0.4666769],"study_design_scores_gemma":[0.0034423617,0.00042497445,0.0039777863,0.00028657692,0.00091200555,0.00007503507,0.0033204716,0.796614,0.02954182,0.025352072,0.13449062,0.0015622525],"about_ca_topic_score_codex":0.00017271393,"about_ca_topic_score_gemma":0.00053800375,"teacher_disagreement_score":0.8905756,"about_ca_system_score_codex":0.000104154075,"about_ca_system_score_gemma":0.000051824147,"threshold_uncertainty_score":0.74291503},"labels":[],"label_agreement":null},{"id":"W2163628514","doi":"10.1109/tcomm.2009.080143","title":"Data extraction from wireless sensor networks using distributed fountain codes","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 science; Decoding methods; Fountain code; Wireless sensor network; Concatenation (mathematics); Channel (broadcasting); Wireless; Channel capacity; Real-time computing; Algorithm; Computer network; Concatenated error correction code; Telecommunications; Block code; Mathematics","score_opus":0.0694098788457642,"score_gpt":0.3317089390505193,"score_spread":0.2622990602047551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163628514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005465889,0.0005365439,0.9895439,0.00045780416,0.00017478474,0.00033141806,0.0014258776,0.0017078768,0.00035589834],"genre_scores_gemma":[0.88862467,0.0038569674,0.106231734,0.00008306563,0.000036164045,0.000047487934,0.0010537783,0.000050521492,0.000015594122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985824,0.0001821061,0.0004878449,0.0002917067,0.00017687413,0.0002790207],"domain_scores_gemma":[0.9931866,0.000534571,0.000105648265,0.0059688156,0.00010142569,0.00010295751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016984736,0.00026934777,0.00026789808,0.0001581944,0.00061959657,0.00008652363,0.002090951,0.00019210525,0.00003803751],"category_scores_gemma":[0.000008058341,0.00032478498,0.00007865519,0.0005279122,0.00013561547,0.00068024,0.000016455955,0.0008676039,0.000019694931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028214365,0.0004464088,0.000011587247,0.000006850008,0.00012896046,0.0000016127444,0.00011617593,0.8594487,0.028750854,0.0004776146,0.0004790719,0.110104],"study_design_scores_gemma":[0.00022459376,0.000023653716,0.0001748179,0.00008303861,0.00007596266,0.000008376317,0.00011611443,0.98326904,0.010711969,0.0006631183,0.00430719,0.00034209967],"about_ca_topic_score_codex":0.00012873749,"about_ca_topic_score_gemma":0.00033831893,"teacher_disagreement_score":0.88331217,"about_ca_system_score_codex":0.00027503193,"about_ca_system_score_gemma":0.000027980663,"threshold_uncertainty_score":0.9999204},"labels":[],"label_agreement":null},{"id":"W2163850973","doi":"10.1109/tcomm.2008.060229","title":"Synchronization and Integration Region Optimization for UWB Signals with Non-coherent Detection and Auto-correlation Detection","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 Victoria","funders":"","keywords":"Synchronization (alternating current); Integrator; Computer science; Bit error rate; Detection theory; Electronic engineering; Signal-to-noise ratio (imaging); Algorithm; Bandwidth (computing); Engineering; Detector; Telecommunications; Decoding methods","score_opus":0.016248104424547372,"score_gpt":0.21407982939087902,"score_spread":0.19783172496633164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163850973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03130376,0.00027662585,0.9660744,0.00029309437,0.00012479968,0.0010397814,0.000012361294,0.0006489896,0.0002261634],"genre_scores_gemma":[0.97501844,0.0036878507,0.020014955,0.000025313973,0.000016059328,0.0010706536,0.000046559362,0.00006282759,0.000057362293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998943,0.00008801826,0.0003802068,0.00026956608,0.0001251113,0.00019414311],"domain_scores_gemma":[0.9982865,0.00030472086,0.000117056,0.0010035884,0.00021823436,0.00006990502],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012255789,0.00024944136,0.00020623184,0.00044024258,0.0011127156,0.00005400412,0.0002464371,0.00021127792,0.000006646906],"category_scores_gemma":[0.000017124425,0.0002614948,0.00004423878,0.00057657796,0.000249116,0.00051261194,0.0000052480796,0.00040634675,0.000003979084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016302534,0.0002601612,0.000046678713,0.000060659713,0.0001247592,4.3548343e-7,0.0011791979,0.72237676,0.022206748,0.00013662444,0.00002662376,0.25341833],"study_design_scores_gemma":[0.00083675445,0.0005399576,0.00033019594,0.000076907454,0.000108963606,0.000119438686,0.00015947707,0.9689689,0.028164476,0.00019880409,0.00021571355,0.00028035883],"about_ca_topic_score_codex":0.00004849742,"about_ca_topic_score_gemma":0.00082626694,"teacher_disagreement_score":0.94605947,"about_ca_system_score_codex":0.00021041163,"about_ca_system_score_gemma":0.000030568994,"threshold_uncertainty_score":0.9999837},"labels":[],"label_agreement":null},{"id":"W2164196656","doi":"10.1109/26.905883","title":"NCFSK bit-error rate with unsynchronized slowly fading interferers","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Bit error rate; Rician fading; Rayleigh fading; Additive white Gaussian noise; Interference (communication); Phase-shift keying; Algorithm; SIGNAL (programming language); Electronic engineering; Computer science; Mathematics; Fading; White noise; Telecommunications; Engineering; Decoding methods; Channel (broadcasting)","score_opus":0.030604634206609548,"score_gpt":0.274525224788351,"score_spread":0.24392059058174145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164196656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009208873,0.00031998302,0.97413754,0.00081576355,0.000117680895,0.00042286608,0.00002714606,0.0022400813,0.012710089],"genre_scores_gemma":[0.94532204,0.0043262835,0.049145352,0.00010699712,0.000010775252,0.00049121643,0.00001942346,0.0000989768,0.00047893374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987934,0.00015770696,0.00038550684,0.00021169489,0.00014050948,0.0003111451],"domain_scores_gemma":[0.9962931,0.000326918,0.00007115181,0.003074055,0.00011866135,0.00011611331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016377626,0.00028345344,0.00025513046,0.00033763106,0.00052238646,0.000059380847,0.0013350684,0.00011286586,0.0001545677],"category_scores_gemma":[0.000005889701,0.00028963317,0.00010158332,0.0007744405,0.00024129185,0.00040837657,0.000009605735,0.0007734251,0.000123067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003237152,0.0013135462,0.00012809693,0.00012094633,0.00089494576,0.000014240792,0.0037002477,0.770015,0.049838196,0.0062064645,0.0015170574,0.16592751],"study_design_scores_gemma":[0.0037015725,0.0005757023,0.00038532182,0.001003094,0.0002765821,0.00017372819,0.0015925581,0.7006187,0.155105,0.0021202413,0.13194583,0.0025017075],"about_ca_topic_score_codex":0.000032585394,"about_ca_topic_score_gemma":0.00038266327,"teacher_disagreement_score":0.9361132,"about_ca_system_score_codex":0.00028689552,"about_ca_system_score_gemma":0.000037822523,"threshold_uncertainty_score":0.9999556},"labels":[],"label_agreement":null},{"id":"W2164982903","doi":"10.1109/tcomm.2014.2315791","title":"Probabilistic Availability Quantification of PON and WiMAX Based FiWi Access Networks for Future Smart Grid Applications","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer network; Computer science; Backhaul (telecommunications); WiMAX; Base station; Probabilistic logic; Smart grid; Quality of service; Reachability; Grid; Distributed computing; Wireless; Engineering; Telecommunications","score_opus":0.030926663115607638,"score_gpt":0.276351501480081,"score_spread":0.24542483836447335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164982903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014904048,0.00054778287,0.9936954,0.0012910359,0.00034907408,0.0012499121,0.00026226405,0.0002856285,0.0008285253],"genre_scores_gemma":[0.98349684,0.0009349843,0.013101996,0.000060156624,0.00006803294,0.0020675964,0.0001838633,0.000044177887,0.000042331456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877274,0.00014853496,0.00052741356,0.00024562082,0.00010787263,0.00019781392],"domain_scores_gemma":[0.9955195,0.00092003925,0.00011619566,0.0030897625,0.00025424425,0.00010025552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045600385,0.00020344158,0.00025330132,0.00017967478,0.00049622235,0.000060653387,0.001060248,0.00014073013,0.000022875764],"category_scores_gemma":[0.000023140872,0.00022033037,0.000119894845,0.00048329655,0.0002492475,0.00020680254,0.000010810626,0.0003412554,0.0000063460207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013210735,0.0023104616,0.0003659133,0.00084720337,0.00022946985,3.69914e-8,0.00038608184,0.84498346,0.0021586542,0.014931021,0.002713277,0.13094233],"study_design_scores_gemma":[0.0005131686,0.0000698697,0.0020055883,0.000052994423,0.00012434841,0.0000012987891,0.000044230255,0.9282843,0.0014862496,0.00082086626,0.06631902,0.0002780749],"about_ca_topic_score_codex":0.000027728885,"about_ca_topic_score_gemma":0.0003437338,"teacher_disagreement_score":0.98200643,"about_ca_system_score_codex":0.000066293076,"about_ca_system_score_gemma":0.000042953925,"threshold_uncertainty_score":0.8984812},"labels":[],"label_agreement":null},{"id":"W2165415702","doi":"10.1109/tcomm.2005.863766","title":"An enhanced widely linear CDMA receiver with OQPSK modulation","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Networks Research","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":"Phase-shift keying; Minimum-shift keying; Electronic engineering; Code division multiple access; Computer science; Asynchronous communication; Demodulation; Keying; Radio receiver design; Fading; Pulse-position modulation; Modulation (music); Telecommunications; Bit error rate; Pulse-amplitude modulation; Engineering; Transmitter; Detector; Physics; Channel (broadcasting); Pulse (music)","score_opus":0.03211758633553163,"score_gpt":0.30144709951128534,"score_spread":0.2693295131757537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165415702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008312565,0.000070190305,0.9825082,0.003321622,0.00009161591,0.00042884532,0.000012710638,0.00054658507,0.0047076624],"genre_scores_gemma":[0.8468349,0.0002449716,0.1518791,0.00011956523,0.000030920568,0.00023840135,0.00003561555,0.000030808256,0.00058574183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977223,0.0005632802,0.00041571588,0.00044263204,0.0004964804,0.00035955707],"domain_scores_gemma":[0.992106,0.00045591342,0.00014652775,0.006699815,0.00045132075,0.00014041066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035017802,0.0002250728,0.0001984701,0.00032285295,0.0011099946,0.0002200986,0.0040505314,0.00012500993,0.000040289742],"category_scores_gemma":[0.000004291185,0.00021974044,0.000083376195,0.0013677136,0.0002708939,0.0012526467,0.00002411377,0.0006879003,0.0001532044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006575555,0.0019756663,0.000055861943,0.000009546751,0.000067428395,0.0000017168,0.0008003959,0.83459276,0.0121624395,0.02280547,0.00035280554,0.12711015],"study_design_scores_gemma":[0.0006223532,0.00022668445,0.0017236542,0.00004942591,0.000015121562,0.000009660346,0.0000494852,0.97894555,0.013748685,0.0014701867,0.0027798838,0.00035932712],"about_ca_topic_score_codex":0.00039090487,"about_ca_topic_score_gemma":0.0015140879,"teacher_disagreement_score":0.8385223,"about_ca_system_score_codex":0.00016044613,"about_ca_system_score_gemma":0.0001587423,"threshold_uncertainty_score":0.8960755},"labels":[],"label_agreement":null},{"id":"W2165441308","doi":"10.1109/tcomm.2010.12.100002","title":"Two-Way MIMO Relay Precoder Design with Channel State Information","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Precoding; Relay; Relay channel; Channel state information; MIMO; Optimization problem; Computer science; Channel (broadcasting); Convex optimization; Control theory (sociology); Mathematical optimization; Wireless; Mathematics; Algorithm; Regular polygon; Computer network; Telecommunications","score_opus":0.04479262687496076,"score_gpt":0.27523187501586266,"score_spread":0.2304392481409019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165441308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058583997,0.00005748516,0.9884584,0.004401376,0.0003159458,0.00049609307,0.000011659341,0.0003942808,0.0052789263],"genre_scores_gemma":[0.818002,0.0008158502,0.17978494,0.00055120734,0.000010680551,0.00030104132,0.000009746724,0.00001558861,0.00050898024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985643,0.0003332224,0.00037666346,0.00021879692,0.00024019818,0.0002667908],"domain_scores_gemma":[0.9950329,0.0005011744,0.00015647348,0.0037888724,0.00038027906,0.00014031169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050888583,0.0002089536,0.00016108778,0.0002786873,0.0011932726,0.0003087253,0.002574228,0.00006976628,0.00006304176],"category_scores_gemma":[0.00001344835,0.00018980644,0.000068698355,0.0008590348,0.00018169585,0.0017575198,0.00003238875,0.00096609996,0.00024927178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013355013,0.0015258649,0.000023107197,0.000021695088,0.00028599755,0.000001903593,0.016887352,0.25819448,0.0060105845,0.04667111,0.002529419,0.66771495],"study_design_scores_gemma":[0.0016208522,0.00029616916,0.0002976133,0.00008514001,0.000038692346,0.00005437919,0.00014156575,0.94063646,0.015070438,0.0012507623,0.039789964,0.0007179913],"about_ca_topic_score_codex":0.00002607696,"about_ca_topic_score_gemma":0.00089877116,"teacher_disagreement_score":0.81741613,"about_ca_system_score_codex":0.000053554526,"about_ca_system_score_gemma":0.00015014406,"threshold_uncertainty_score":0.91778094},"labels":[],"label_agreement":null},{"id":"W2165479285","doi":"10.1109/tcomm.2012.082812.110813","title":"Double-Loop Receiver-Initiated MAC for Cooperative Data Dissemination via Roadside WLANs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Opportunistic and Delay-Tolerant Networks","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":"Computer network; Computer science; Network packet; Roaming; Node (physics); Local area network; Overhead (engineering); Relay; Dissemination; Channel (broadcasting); Wi-Fi; Wireless; Wireless network; Telecommunications; Engineering","score_opus":0.1748730875254381,"score_gpt":0.369360642529684,"score_spread":0.1944875550042459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165479285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021726819,0.00021629166,0.9909444,0.002628799,0.000710349,0.0006433826,0.00025283278,0.00026210592,0.0041245995],"genre_scores_gemma":[0.9588054,0.00041711188,0.038330957,0.00027125794,0.00006193837,0.00027648138,0.00050720625,0.000024226452,0.0013054509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984376,0.000184737,0.00040881784,0.0003617103,0.00021736517,0.00038978967],"domain_scores_gemma":[0.99443483,0.0010054316,0.0001408819,0.0039420403,0.00026926084,0.00020753728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005433272,0.00021284139,0.00021695398,0.00015075735,0.0009986754,0.00014241361,0.002728499,0.00013103582,0.000058971254],"category_scores_gemma":[0.0000037673215,0.0002148419,0.00008201751,0.00055023143,0.00013973535,0.0014030966,0.00004170949,0.0003690415,0.00009615361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025505785,0.0039103767,0.00008945524,0.00003567323,0.00048664818,0.0000031167651,0.0053786323,0.0021608858,0.0018066599,0.023228165,0.021339921,0.9413054],"study_design_scores_gemma":[0.000738057,0.000085831314,0.000039182116,0.000052445408,0.00009335728,0.000021896803,0.00013004382,0.9854217,0.0013639233,0.00028449236,0.011451747,0.00031733015],"about_ca_topic_score_codex":0.000059976104,"about_ca_topic_score_gemma":0.00017043474,"teacher_disagreement_score":0.9832608,"about_ca_system_score_codex":0.00007879118,"about_ca_system_score_gemma":0.000108947876,"threshold_uncertainty_score":0.8760998},"labels":[],"label_agreement":null},{"id":"W2165621383","doi":"10.1109/tcomm.2011.051311.100311","title":"Precise BER Computation for Binary Data Detection in Bandlimited White Laplace Noise","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Detector; Bit error rate; Bandlimiting; Algorithm; Noise (video); Electronic engineering; Computer science; White noise; Fading; Matched filter; Mathematics; Telecommunications; Engineering; Decoding methods","score_opus":0.07761552155626805,"score_gpt":0.2766512451577495,"score_spread":0.19903572360148147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165621383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01999057,0.0003142843,0.9735674,0.00047541747,0.00029338387,0.00095537776,0.0002580823,0.000987518,0.003157922],"genre_scores_gemma":[0.959377,0.0008528499,0.03863013,0.000029353037,0.0000072498306,0.0007674564,0.00018057678,0.000057330693,0.0000980842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881226,0.00012085381,0.00045357272,0.0002685902,0.000096179836,0.00024852835],"domain_scores_gemma":[0.9955262,0.0004214658,0.00006411259,0.0038301288,0.00009987125,0.000058230085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550177,0.00020155846,0.00020223754,0.00054739113,0.0003357137,0.000025810936,0.0017533012,0.00020409549,0.00003671599],"category_scores_gemma":[0.00001880121,0.0002417979,0.000067436,0.0008137492,0.00013591493,0.00042865783,0.000019952666,0.0005542317,0.0000510373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005410971,0.0052238936,0.0005726176,0.00023332912,0.0006580572,0.0000028071897,0.008247842,0.30122027,0.042762734,0.00079805084,0.0030590429,0.63668025],"study_design_scores_gemma":[0.0015318532,0.00018819825,0.0023645584,0.0001000777,0.00014806571,0.000017400731,0.00049534603,0.96553785,0.02115058,0.0010314921,0.0068807784,0.00055382086],"about_ca_topic_score_codex":0.000089713554,"about_ca_topic_score_gemma":0.0031692262,"teacher_disagreement_score":0.93938637,"about_ca_system_score_codex":0.00014487722,"about_ca_system_score_gemma":0.000030929463,"threshold_uncertainty_score":0.9860232},"labels":[],"label_agreement":null},{"id":"W2166346249","doi":"10.1109/tcomm.2013.112513.130143","title":"Capacity-Achieving Distributions for the Discrete-Time Poisson Channel&amp;#x2014;Part II: Binary Inputs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"","keywords":"Binary number; Poisson distribution; Channel (broadcasting); Current (fluid); Channel capacity; Mathematics; Applied mathematics; Binary Independence Model; Topology (electrical circuits); Work (physics); Probability mass function; Mathematical optimization; Computer science; Probability distribution; Statistical physics; Algorithm; Physics; Telecommunications; Statistics; Combinatorics","score_opus":0.03810030262917415,"score_gpt":0.2596301644287842,"score_spread":0.22152986179961007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166346249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00508568,0.000505153,0.968466,0.02090659,0.00035005962,0.0006995141,0.00047713344,0.0018246891,0.0016851965],"genre_scores_gemma":[0.9784551,0.0014833645,0.018146114,0.000099849945,0.000037613332,0.0012502962,0.000102762104,0.00006921409,0.0003556867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985756,0.00015617629,0.00046141245,0.00023072818,0.0001749887,0.00040106103],"domain_scores_gemma":[0.9934955,0.0019846067,0.000078207144,0.004207977,0.00013387454,0.000099826844],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00039932135,0.00029029715,0.0002785367,0.00017632828,0.0024591552,0.000092896495,0.0021563917,0.00020576367,0.000051671504],"category_scores_gemma":[0.00010823629,0.00025727827,0.00022147206,0.0005570071,0.00054039864,0.00024275313,0.000042802676,0.000860962,0.00018380996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012048957,0.00320927,0.00002238634,0.0003337547,0.0013817489,2.3755716e-7,0.0033712587,0.58779824,0.075096376,0.16331254,0.019093487,0.14626022],"study_design_scores_gemma":[0.0008606108,0.0002938861,0.00020506729,0.00024887655,0.0002747825,0.000011789671,0.00018592707,0.5552717,0.019553019,0.005272602,0.41677916,0.0010425614],"about_ca_topic_score_codex":0.000023202801,"about_ca_topic_score_gemma":0.00013783059,"teacher_disagreement_score":0.9733694,"about_ca_system_score_codex":0.0001621028,"about_ca_system_score_gemma":0.000020587006,"threshold_uncertainty_score":0.99998796},"labels":[],"label_agreement":null},{"id":"W2166478505","doi":"10.1109/tcomm.2007.910589","title":"Estimation of Bit and Frame Error Rates of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Low-density parity-check code; Algorithm; Decoding methods; Binary symmetric channel; Bit error rate; Parity bit; Error detection and correction; Binary number; Computer science; Mathematics; Arithmetic","score_opus":0.04991802552880289,"score_gpt":0.3278226457086265,"score_spread":0.27790462017982365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166478505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14590223,0.00010576157,0.8520268,0.0007609919,0.0001860949,0.0002936753,0.000020677911,0.0002648734,0.00043890634],"genre_scores_gemma":[0.9053879,0.0002592672,0.09417791,0.00008501034,0.0000051545226,0.000027450886,0.000004697315,0.000014309906,0.000038348986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985354,0.00019986153,0.00051205343,0.00027874083,0.00027137826,0.00020256909],"domain_scores_gemma":[0.99480385,0.0026122972,0.00028751258,0.0019773,0.00023928567,0.00007978523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008784763,0.00017973638,0.00028611268,0.00084019953,0.00034832023,0.000036595018,0.0011200858,0.00014507514,0.0000041408457],"category_scores_gemma":[0.00013103819,0.00019139743,0.00009791093,0.001489427,0.0002564748,0.00030936778,0.000030553678,0.00049639976,0.000008177143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005007821,0.015468157,0.0017290654,0.0009061836,0.00065733824,0.000014493638,0.020149425,0.16262907,0.048114378,0.10058801,0.0007443324,0.6484988],"study_design_scores_gemma":[0.0003848213,0.000719309,0.003396064,0.00033807938,0.000057241286,0.000011781117,0.00019229508,0.6049253,0.38544008,0.0041172025,0.00007912529,0.00033872967],"about_ca_topic_score_codex":0.0002641483,"about_ca_topic_score_gemma":0.00015796338,"teacher_disagreement_score":0.7594856,"about_ca_system_score_codex":0.00006508503,"about_ca_system_score_gemma":0.000058106256,"threshold_uncertainty_score":0.78049606},"labels":[],"label_agreement":null},{"id":"W2166527432","doi":"10.1109/tcomm.2012.030712.110086","title":"Design of Finite-Length Irregular Protograph Codes with Low Error Floors over the Binary-Input AWGN Channel Using Cyclic Liftings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"","keywords":"Low-density parity-check code; Additive white Gaussian noise; Algorithm; Encoder; Binary number; Channel (broadcasting); Computer science; Decoding methods; Binary code; Turbo code; Block code; Concatenated error correction code; Mathematics; Topology (electrical circuits); Telecommunications; Arithmetic; Combinatorics","score_opus":0.05597118724263235,"score_gpt":0.29642800139864084,"score_spread":0.2404568141560085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166527432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019319214,0.00023012403,0.97747177,0.00072497426,0.00018858581,0.0014013753,0.000011085177,0.00054523686,0.00010765946],"genre_scores_gemma":[0.82207435,0.00011988108,0.17709191,0.0001225477,0.00001560939,0.00050398003,0.0000016935777,0.00003667356,0.000033364027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978394,0.00061729545,0.000429639,0.00029992955,0.00037661052,0.00043713013],"domain_scores_gemma":[0.99469906,0.0011320845,0.00031630593,0.0035226268,0.00021621371,0.00011368549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009096817,0.00028266743,0.0002715215,0.00041165884,0.0010329455,0.00008280699,0.0026855655,0.00012045583,0.000009053296],"category_scores_gemma":[0.000026613083,0.00022064286,0.00014478846,0.0015925635,0.00043223466,0.0007351404,0.000040617826,0.00062837073,0.0000093490635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048599215,0.015041312,0.0025139297,0.00042125236,0.0017000706,0.000009002936,0.08741617,0.7238988,0.095353775,0.009331106,0.00087657623,0.06295195],"study_design_scores_gemma":[0.0005705759,0.0005096197,0.0008010504,0.00054763025,0.00018104163,0.000058912105,0.0005692024,0.91471,0.08028527,0.00063676585,0.00044964728,0.0006803248],"about_ca_topic_score_codex":0.00028070377,"about_ca_topic_score_gemma":0.00007594322,"teacher_disagreement_score":0.8027551,"about_ca_system_score_codex":0.000081691636,"about_ca_system_score_gemma":0.00012457457,"threshold_uncertainty_score":0.8997555},"labels":[],"label_agreement":null},{"id":"W2166757187","doi":"10.1109/tcomm.2010.092810.090322","title":"On the Performance of Cooperative-Diversity Networks with the Nth Best-Relay Selection Scheme","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":147,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Relay; Rayleigh fading; Expression (computer science); Cooperative diversity; Moment-generating function; Diversity combining; Signal-to-noise ratio (imaging); Node (physics); Maximal-ratio combining; Selection (genetic algorithm); Closed-form expression; Probability density function; Topology (electrical circuits); Computer science; Function (biology); Mathematics; Algorithm; Fading; Telecommunications; Statistics; Combinatorics; Channel (broadcasting); Engineering; Physics; Artificial intelligence; Power (physics)","score_opus":0.034647051076152055,"score_gpt":0.25618566852892566,"score_spread":0.2215386174527736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166757187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18336202,0.00007767109,0.80017054,0.013228483,0.00019985526,0.00048352024,0.0000044933013,0.000121282465,0.0023521371],"genre_scores_gemma":[0.99308693,0.0009227099,0.0048472397,0.00058139814,0.000014296771,0.0001009937,0.0000017326566,0.000010257931,0.00043441684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880606,0.00037684033,0.00019928324,0.00020266273,0.00023637246,0.00017878128],"domain_scores_gemma":[0.9956089,0.0011088297,0.00013023663,0.0027285432,0.00037217338,0.00005129058],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005133623,0.00016070715,0.00013067087,0.000085398045,0.0037320391,0.00009521621,0.003088156,0.000068989706,0.00007463556],"category_scores_gemma":[0.000011529489,0.00009659596,0.000069961075,0.0010610445,0.00046773563,0.00029450035,0.00007514474,0.0013044262,0.000029156012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018454633,0.0026473906,0.00070757663,0.000012970086,0.00043789143,4.8132176e-7,0.0068897577,0.5772837,0.008646047,0.33121067,0.003315056,0.068663925],"study_design_scores_gemma":[0.00033178885,0.00040528874,0.0006042416,0.00005344386,0.000029494086,0.00000910662,0.000111977475,0.98893607,0.0058232746,0.000023130355,0.0034741622,0.0001980453],"about_ca_topic_score_codex":0.000024741317,"about_ca_topic_score_gemma":0.0012055164,"teacher_disagreement_score":0.8097249,"about_ca_system_score_codex":0.000038643433,"about_ca_system_score_gemma":0.000087686814,"threshold_uncertainty_score":0.997565},"labels":[],"label_agreement":null},{"id":"W2167040808","doi":"10.1109/tcomm.2009.09.070595","title":"Relay ordering in a multi-hop cooperative diversity network","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Relay; Hop (telecommunications); Expression (computer science); Algorithm; Computer science; Computational complexity theory; Signal-to-noise ratio (imaging); Bit error rate; Diversity combining; Outage probability; Cooperative diversity; Probability of error; Selection (genetic algorithm); Mathematics; Mathematical optimization; Telecommunications; Decoding methods; Fading; Artificial intelligence","score_opus":0.0871327742830498,"score_gpt":0.3105994923613186,"score_spread":0.22346671807826882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167040808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016477256,0.000545882,0.98750544,0.006701718,0.00017881849,0.0003259251,0.0000033309198,0.00026992025,0.002821271],"genre_scores_gemma":[0.9377321,0.0032561356,0.057492845,0.0010617257,0.0000103830525,0.000046479858,0.0000032645285,0.000008047878,0.00038900634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840844,0.0004698905,0.00033503026,0.0003146538,0.00016507087,0.00030694465],"domain_scores_gemma":[0.99669176,0.00034168139,0.00007851661,0.00261752,0.00016993021,0.000100587546],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00040281797,0.0001864045,0.00020738815,0.0001986654,0.0018235532,0.000118688964,0.0027792712,0.0000828824,0.000029768782],"category_scores_gemma":[0.000015782305,0.00020273941,0.00008888786,0.0015097484,0.00010004475,0.0005625175,0.000092906834,0.0007248698,0.000057727702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055097807,0.0034063663,0.00047163074,0.0000068230715,0.000109895445,0.000011510328,0.015725737,0.52936083,0.0012534331,0.082124375,0.0013716443,0.36610267],"study_design_scores_gemma":[0.0017413633,0.0002446513,0.0073689413,0.00019456791,0.000020636124,0.000013119457,0.00019979579,0.9797278,0.00071705104,0.0008094799,0.008287709,0.00067485264],"about_ca_topic_score_codex":0.000031421416,"about_ca_topic_score_gemma":0.0016216149,"teacher_disagreement_score":0.9360844,"about_ca_system_score_codex":0.00016369126,"about_ca_system_score_gemma":0.00007326561,"threshold_uncertainty_score":0.99947596},"labels":[],"label_agreement":null},{"id":"W2167340446","doi":"10.1109/tcomm.2011.121410.090612","title":"Efficient Iterative Techniques for Soft Decision Decoding of Reed-Solomon Codes","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"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; Belief propagation; Sequential decoding; List decoding; Parity-check matrix; Berlekamp–Welch algorithm; Algorithm; Computer science; Low-density parity-check code; Binary number; Concatenated error correction code; Binary symmetric channel; Theoretical computer science; Mathematics; Block code; Arithmetic","score_opus":0.025563512691039552,"score_gpt":0.3060731576643248,"score_spread":0.28050964497328523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167340446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010434829,0.000033263605,0.9873825,0.00044192543,0.00026639376,0.0003554535,0.000046465408,0.00021741666,0.0008218043],"genre_scores_gemma":[0.663324,0.000026267273,0.33644092,0.00004190831,0.0000067221054,0.00013693153,0.000001925338,0.0000068466265,0.000014465751],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990949,0.00008831619,0.0003020534,0.00022373252,0.0001369699,0.00015405347],"domain_scores_gemma":[0.99609536,0.0015987597,0.00011644789,0.0019142008,0.00021790834,0.000057327205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051692995,0.000118033895,0.00015657622,0.00029994283,0.0006483833,0.00006507396,0.0015853052,0.00008736691,0.000011853087],"category_scores_gemma":[0.000029504487,0.0001194158,0.000179474,0.0005119292,0.00020876042,0.00013047595,0.000016289796,0.00032760677,0.0000047495637],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008864846,0.0011353404,0.000021813697,0.000022562193,0.00006329493,2.6956099e-7,0.002577312,0.0019810426,0.08122248,0.3140623,0.00009289969,0.59873205],"study_design_scores_gemma":[0.00077173975,0.00070976047,0.00012082023,0.00032417668,0.00007537595,0.00002007185,0.00016688423,0.41887143,0.481749,0.09118767,0.0054275207,0.0005755485],"about_ca_topic_score_codex":0.000012631024,"about_ca_topic_score_gemma":0.00018532858,"teacher_disagreement_score":0.6528892,"about_ca_system_score_codex":0.000017113165,"about_ca_system_score_gemma":0.000041032796,"threshold_uncertainty_score":0.49869058},"labels":[],"label_agreement":null},{"id":"W2167969644","doi":"10.1109/tcomm.2005.855020","title":"SER of Threshold-Based Hybrid Selection/Maximal-Ratio Combining in Correlated Nakagami Fading","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Nakagami distribution; Fading; Maximal-ratio combining; Mathematics; Algorithm; Modulation (music); Phase-shift keying; Statistics; Selection (genetic algorithm); Fading distribution; Bit error rate; Topology (electrical circuits); Computer science; Combinatorics; Physics; Decoding methods","score_opus":0.022247214505831312,"score_gpt":0.26589564940156657,"score_spread":0.24364843489573526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167969644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024064058,0.0003074945,0.96998435,0.0004670333,0.000091299145,0.00042461566,0.0000348895,0.0010868983,0.0035393755],"genre_scores_gemma":[0.9630597,0.0007286037,0.03567647,0.0000713517,0.0000069699972,0.00028843744,0.000027689419,0.000066350556,0.000074425145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986348,0.00011075867,0.0006563138,0.00017830257,0.00017531576,0.00024451612],"domain_scores_gemma":[0.99767596,0.0003667544,0.0001101336,0.0016465525,0.00013650024,0.000064106214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020814805,0.00022344915,0.00027807715,0.0005477612,0.00027531493,0.000024733361,0.00087897625,0.00011674897,0.00007610904],"category_scores_gemma":[0.0000088608895,0.00028108564,0.00010519083,0.0008596569,0.00015324175,0.0003773442,0.000007128287,0.00086491177,0.000034057244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001578929,0.0003364005,0.000074918964,0.000016409951,0.000035287558,2.6968166e-7,0.00029665022,0.97217935,0.0129308505,0.0007246035,0.00007461129,0.013314839],"study_design_scores_gemma":[0.0004901392,0.000039268438,0.00011245287,0.00012303241,0.000017730905,0.0000056085782,0.00005562769,0.7799236,0.21799122,0.00018728753,0.00082713936,0.00022685966],"about_ca_topic_score_codex":0.000026940266,"about_ca_topic_score_gemma":0.00036317555,"teacher_disagreement_score":0.93899566,"about_ca_system_score_codex":0.00031763708,"about_ca_system_score_gemma":0.000056650173,"threshold_uncertainty_score":0.9999641},"labels":[],"label_agreement":null},{"id":"W2168020874","doi":"10.1109/tcomm.2004.840639","title":"High-Rate Punctured Convolutional Self-Doubly Orthogonal Codes for Iterative Threshold Decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Puncturing; Sequential decoding; Serial concatenated convolutional codes; Algorithm; Decoding methods; Turbo code; Viterbi decoder; Concatenated error correction code; Computer science; List decoding; Linear code; Mathematics; Block code; Telecommunications","score_opus":0.027152906773087012,"score_gpt":0.2813389561534958,"score_spread":0.2541860493804088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168020874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003651999,0.00059999246,0.98936415,0.0020537265,0.00018640827,0.00072927604,0.00042518997,0.0020087839,0.0009804822],"genre_scores_gemma":[0.74944794,0.001520309,0.24744613,0.00015603012,0.00004248996,0.0010933777,0.000099269964,0.000057831236,0.00013660558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987254,0.00009374171,0.000494049,0.0002301676,0.00015640029,0.00030019996],"domain_scores_gemma":[0.99702203,0.000792538,0.000088692614,0.0017444348,0.00024815983,0.000104153994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023804611,0.00029233686,0.00027452383,0.00024128424,0.0008209355,0.0000711912,0.0010053247,0.00015026028,0.0000766089],"category_scores_gemma":[0.000008082634,0.00031804587,0.00016799201,0.00032592422,0.00016322077,0.00049371005,0.000009715768,0.00057309814,0.000049978185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008310857,0.00080200273,0.00002050776,0.00006938164,0.0005035504,3.8732884e-7,0.0012517201,0.86024183,0.017394522,0.09127588,0.0034151294,0.024941953],"study_design_scores_gemma":[0.0014713795,0.00011374672,0.00014811874,0.00013792905,0.00013803747,0.000013559045,0.00009864325,0.8137167,0.10364009,0.0074243215,0.072247766,0.0008497302],"about_ca_topic_score_codex":0.0000068628733,"about_ca_topic_score_gemma":0.00044694124,"teacher_disagreement_score":0.74579597,"about_ca_system_score_codex":0.00033589813,"about_ca_system_score_gemma":0.000060195354,"threshold_uncertainty_score":0.99992716},"labels":[],"label_agreement":null},{"id":"W2168253435","doi":"10.1109/tcomm.2011.022811.090623","title":"Resource Management in Spectrum-Sharing Cognitive Radio Broadcast Channels: Adaptive Time and Power Allocation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Cognitive radio; Transmitter; Computer science; Computer network; Fading; Base station; Transmission (telecommunications); Resource allocation; Channel (broadcasting); Interference (communication); Transmitter power output; Channel state information; Resource management (computing); Electronic engineering; Telecommunications; Wireless; Engineering","score_opus":0.04012262094412388,"score_gpt":0.24617390776058143,"score_spread":0.20605128681645754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168253435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00581064,0.00032609573,0.9513247,0.0008906053,0.00012368815,0.0005437849,0.000008977268,0.00018326366,0.04078825],"genre_scores_gemma":[0.98732346,0.00050372863,0.011536202,0.00015802096,0.000012279817,0.00005763969,0.000004233048,0.000019316967,0.0003851299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986709,0.00016595202,0.0002811746,0.00043761867,0.00015556099,0.00028880694],"domain_scores_gemma":[0.99851483,0.00022243956,0.00008306194,0.0010326192,0.000053695603,0.000093353374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002814085,0.00018811681,0.00017752332,0.00037824656,0.00042939535,0.000101422214,0.0007487513,0.00006536334,0.000037185953],"category_scores_gemma":[0.0000030348929,0.00021379592,0.00006253095,0.00066665135,0.00015559522,0.00039546902,0.000036915637,0.00039621993,0.00006508334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000464696,0.0038288233,0.00010062411,0.00003225865,0.0009980121,0.000130619,0.055282794,0.006410026,0.0003797451,0.12404034,0.00019870175,0.80813336],"study_design_scores_gemma":[0.0025456843,0.00062725565,0.005228143,0.0007855346,0.00015568957,0.00016727719,0.00270049,0.97204,0.003635142,0.009698778,0.0012610296,0.0011549602],"about_ca_topic_score_codex":0.000120070414,"about_ca_topic_score_gemma":0.00018664589,"teacher_disagreement_score":0.9815128,"about_ca_system_score_codex":0.00011392723,"about_ca_system_score_gemma":0.000018868646,"threshold_uncertainty_score":0.87183446},"labels":[],"label_agreement":null},{"id":"W2168590314","doi":"10.1109/26.923811","title":"Performance of multidimensional multicode DS-CDMA using code diversity and error detection","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Diversity scheme; Diversity gain; Electronic engineering; Precoding; Fading; Multipath propagation; Code division multiple access; Channel (broadcasting); Algorithm; Telecommunications; MIMO; Engineering","score_opus":0.05725839522726844,"score_gpt":0.28440142048473144,"score_spread":0.227143025257463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168590314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5710483,0.000114914554,0.42813966,0.000038134025,0.0000519042,0.00015048661,0.000022907181,0.0002798577,0.00015382309],"genre_scores_gemma":[0.94900864,0.003243829,0.04764255,0.000013332864,0.0000039670376,0.000033459648,0.0000036495042,0.000025602074,0.000024967794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.00006462749,0.0002687231,0.00012237499,0.00013004521,0.00013881839],"domain_scores_gemma":[0.9984089,0.00019375492,0.00006600869,0.0011673343,0.00010578704,0.000058213474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010490643,0.00014071466,0.00015920983,0.00019356517,0.0010188129,0.0000058322275,0.00040304268,0.00008815808,0.000013729474],"category_scores_gemma":[0.0000047322656,0.00016575473,0.000052689,0.00028062236,0.0002153609,0.00028164542,0.000037527232,0.0003403097,0.000004293855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000941689,0.0005227627,0.0015860144,0.00008514241,0.0001398911,6.739424e-7,0.0019138153,0.6838956,0.22233471,0.00013350646,0.000008390299,0.08928531],"study_design_scores_gemma":[0.00029034948,0.00004086735,0.0015893922,0.000062691,0.000037435184,0.00001643474,0.000109285545,0.8981722,0.09909161,0.000029793166,0.00039203846,0.00016791486],"about_ca_topic_score_codex":0.00008935543,"about_ca_topic_score_gemma":0.00026174315,"teacher_disagreement_score":0.38049713,"about_ca_system_score_codex":0.00011289182,"about_ca_system_score_gemma":0.000009845891,"threshold_uncertainty_score":0.78359884},"labels":[],"label_agreement":null},{"id":"W2168825220","doi":"10.1109/tcomm.2011.062311.100108","title":"Novel Representations for the Equicorrelated Multivariate Non-Central Chi-Square Distribution and Applications to MIMO Systems in Correlated Rician Fading","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Cumulative distribution function; Mathematics; Fading; MIMO; Probability density function; Square (algebra); Fading distribution; Degrees of freedom (physics and chemistry); Multivariate statistics; Applied mathematics; Wishart distribution; Representation (politics); Algorithm; Statistics; Rayleigh fading","score_opus":0.050920027505430066,"score_gpt":0.29711512392165457,"score_spread":0.2461950964162245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168825220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066362467,0.00036974563,0.9940101,0.00027388148,0.00020261228,0.002852647,0.00048665437,0.00055925094,0.0005815175],"genre_scores_gemma":[0.97302866,0.00092021393,0.019406913,0.00003188474,0.000013403103,0.006327429,0.00014455304,0.000058088353,0.000068873356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866503,0.000073169205,0.00056119205,0.0002558753,0.000112500325,0.00033223548],"domain_scores_gemma":[0.9970453,0.000660663,0.00009678141,0.0019307454,0.00014675973,0.00011979607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020305898,0.00022906151,0.00021786161,0.00023757553,0.00077204034,0.000057062876,0.00088186713,0.00015296885,0.0000067632013],"category_scores_gemma":[0.00002092718,0.0002294742,0.000080535516,0.00094628154,0.00013715269,0.0002508833,0.000018270877,0.00056706957,0.000013996052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009480237,0.0011892514,0.00019119498,0.000091142036,0.00030487985,4.2947534e-7,0.007743146,0.89670974,0.012978261,0.018404879,0.00027549444,0.062016755],"study_design_scores_gemma":[0.0009129433,0.00006466927,0.005843469,0.00020398306,0.00011566472,0.000011363009,0.0014261996,0.9822727,0.0044289734,0.00031620255,0.0039638043,0.0004400258],"about_ca_topic_score_codex":0.0007400602,"about_ca_topic_score_gemma":0.00060355983,"teacher_disagreement_score":0.9746032,"about_ca_system_score_codex":0.00025048043,"about_ca_system_score_gemma":0.000027985037,"threshold_uncertainty_score":0.93576866},"labels":[],"label_agreement":null},{"id":"W2169235621","doi":"10.1109/tcomm.2004.833015","title":"Performance of Digital Linear Modulations on Weibull Slow-Fading Channels","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":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; Weibull distribution; Fading distribution; Weibull fading; Diversity combining; Moment-generating function; Mathematics; Maximal-ratio combining; Electronic engineering; Diversity scheme; Channel (broadcasting); Statistics; Computer science; Algorithm; Topology (electrical circuits); Probability density function; Telecommunications; Engineering; Rayleigh fading; Combinatorics","score_opus":0.02838365057344143,"score_gpt":0.2648190963710286,"score_spread":0.23643544579758713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169235621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106868364,0.00011164441,0.88168854,0.0006438972,0.00020906168,0.00043673208,0.00014308667,0.0012727531,0.008625949],"genre_scores_gemma":[0.97809297,0.0015023641,0.019948814,0.00002553934,0.000014545134,0.00019546245,0.000032423566,0.00005972553,0.00012813859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990194,0.000027722102,0.0004247048,0.00014913175,0.0001788361,0.00020022072],"domain_scores_gemma":[0.997213,0.00020290124,0.00007658078,0.0023220016,0.000112469635,0.000073012154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007719075,0.00020156385,0.00020466631,0.00032330246,0.00036808397,0.000025655798,0.00093438977,0.00010410183,0.00001773641],"category_scores_gemma":[0.0000076000506,0.00023282085,0.00011344022,0.0005266835,0.00017253042,0.00043816533,0.000008581626,0.0005113884,0.00008685487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008524745,0.0002466983,0.00000792139,0.000019429119,0.00003526594,1.0457306e-7,0.00033222066,0.9856569,0.0024510284,0.0013045318,0.00001615481,0.009921228],"study_design_scores_gemma":[0.0010265155,0.0003933909,0.00018067179,0.0005429713,0.00005722698,0.000012289101,0.00016790378,0.67355394,0.31720406,0.0023999456,0.0037331036,0.00072796154],"about_ca_topic_score_codex":0.000008488593,"about_ca_topic_score_gemma":0.000010066577,"teacher_disagreement_score":0.87122464,"about_ca_system_score_codex":0.00019139933,"about_ca_system_score_gemma":0.000029741062,"threshold_uncertainty_score":0.94941586},"labels":[],"label_agreement":null},{"id":"W2169313213","doi":"10.1109/tcomm.2011.030411.100418","title":"Capacity and Delay Analysis of Next-Generation Passive Optical Networks (NG-PONs)","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","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":"Université du Québec à Montréal; Institut National de la Recherche Scientifique","funders":"","keywords":"Passive optical network; Computer network; Network packet; Computer science; Throughput; Pons; Ethernet; Electronic engineering; Wavelength-division multiplexing; Engineering; Wavelength; Telecommunications; Optics; Physics","score_opus":0.10889000672371393,"score_gpt":0.26353542155707166,"score_spread":0.15464541483335772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169313213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055735517,0.0004925032,0.9394158,0.000078555575,0.00014716852,0.00026644222,0.000059639337,0.00019611669,0.0036082459],"genre_scores_gemma":[0.98135954,0.0017021187,0.016654355,0.000023812217,0.000008050598,0.00017324899,0.000026093492,0.000025892636,0.000026865739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891686,0.00015219605,0.00048107895,0.0001612277,0.00012415752,0.00016446685],"domain_scores_gemma":[0.997147,0.0003415862,0.00009108677,0.0021848339,0.0001345479,0.00010090189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016716625,0.00016525797,0.00030435904,0.00034105143,0.0002635782,0.00002222456,0.0005571804,0.00012489546,0.00007631491],"category_scores_gemma":[0.0000075156654,0.00018324835,0.00013953347,0.00091395236,0.00023796331,0.00022949051,0.000008332763,0.0004044877,0.0000054932566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021176847,0.0004110614,0.00012816752,0.00002164734,0.002009631,5.237926e-7,0.0037052908,0.9436758,0.010414816,0.0058776727,0.000043354576,0.033690833],"study_design_scores_gemma":[0.00018100858,0.00003277498,0.0008732332,0.000019370522,0.000591344,0.0000054309066,0.00021294372,0.9895854,0.0077922316,0.00006516172,0.00044549652,0.00019560441],"about_ca_topic_score_codex":0.00011793104,"about_ca_topic_score_gemma":0.0016004232,"teacher_disagreement_score":0.9256241,"about_ca_system_score_codex":0.00008680644,"about_ca_system_score_gemma":0.000017578026,"threshold_uncertainty_score":0.7472651},"labels":[],"label_agreement":null},{"id":"W2169353059","doi":"10.1109/tcomm.2005.843432","title":"Comparison of CP-Based Single Carrier and OFDM With Power Allocation","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Cyclic prefix; Fading; Bit error rate; Transmission (telecommunications); Computer science; Electronic engineering; Power (physics); Block (permutation group theory); Mathematics; Algorithm; Telecommunications; Engineering; Physics; Channel (broadcasting)","score_opus":0.030179735045351784,"score_gpt":0.2959450030354976,"score_spread":0.2657652679901458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169353059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020126898,0.00069569435,0.9742528,0.0008551101,0.000025942954,0.0002877354,0.000042276915,0.0005520516,0.0031614464],"genre_scores_gemma":[0.91644377,0.0002347157,0.083058774,0.00004274361,0.000003167327,0.00013110325,0.000013266414,0.000036775593,0.00003568727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992492,0.000060799775,0.00032178828,0.00011373494,0.00013160458,0.00012285972],"domain_scores_gemma":[0.9978615,0.0002209002,0.000075848315,0.0016612352,0.000121857076,0.000058668138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007421584,0.00014550849,0.00019386396,0.00018172794,0.00018802819,0.000016712413,0.00045712723,0.00007708807,0.000030466106],"category_scores_gemma":[0.000003253066,0.00015304842,0.00003839486,0.00029442637,0.00023513164,0.00020012495,0.0000036218325,0.0003072855,0.000005558364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005152333,0.0013811444,0.00023652788,0.000064250504,0.00012954665,1.10635185e-7,0.0021940821,0.7869526,0.08287208,0.0016444213,0.0002530971,0.12422058],"study_design_scores_gemma":[0.00062242104,0.0002588319,0.00037437497,0.00015551256,0.00006683285,0.0000036458578,0.00042403303,0.22622447,0.7566173,0.00009121312,0.014777713,0.00038366645],"about_ca_topic_score_codex":0.00001312293,"about_ca_topic_score_gemma":0.0003280791,"teacher_disagreement_score":0.8963169,"about_ca_system_score_codex":0.00009916622,"about_ca_system_score_gemma":0.000023688803,"threshold_uncertainty_score":0.6241134},"labels":[],"label_agreement":null},{"id":"W2169435309","doi":"10.1109/tcomm.2009.08.070324","title":"Exact BER analysis of distributed alamouti's code for cooperative diversity networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bit error rate; Rayleigh fading; QAM; Quadrature amplitude modulation; Mathematics; Diversity combining; Expression (computer science); Maximal-ratio combining; Gray code; Modulation (music); Algorithm; Topology (electrical circuits); Computer science; Fading; Physics; Decoding methods; Combinatorics","score_opus":0.0583457954210946,"score_gpt":0.30976082451972825,"score_spread":0.25141502909863367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169435309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009101148,0.00025919286,0.9937009,0.0036368067,0.00009065304,0.00038610055,0.00026046688,0.00014444302,0.00061132695],"genre_scores_gemma":[0.98530054,0.0015955702,0.012369077,0.00041050618,0.000007246104,0.000057054625,0.00010915844,0.0000062718136,0.00014458789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861485,0.0003041168,0.00039866415,0.00028738976,0.00017188214,0.00022308753],"domain_scores_gemma":[0.9955727,0.000818919,0.0001702799,0.0028275081,0.0005104913,0.00010014363],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00035076722,0.00017629033,0.0003526533,0.00032956334,0.0015479663,0.000076207565,0.0025280549,0.000086959226,0.000034205106],"category_scores_gemma":[0.000018345141,0.00018180396,0.00031219862,0.0024673513,0.00015077635,0.00033975707,0.000054819804,0.00031206422,0.0000033000829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009745721,0.0024644495,0.00024065677,0.0000064616543,0.0022091111,6.319893e-7,0.0037972282,0.768325,0.0007393887,0.09185523,0.0019437493,0.12832065],"study_design_scores_gemma":[0.0004961839,0.00016806548,0.003976093,0.000022045184,0.00044255125,7.4462963e-7,0.000060949147,0.99063766,0.0009048141,0.0002391077,0.0028174508,0.00023430593],"about_ca_topic_score_codex":0.000013349648,"about_ca_topic_score_gemma":0.00066861394,"teacher_disagreement_score":0.98439044,"about_ca_system_score_codex":0.00010134996,"about_ca_system_score_gemma":0.0000545543,"threshold_uncertainty_score":0.99975187},"labels":[],"label_agreement":null},{"id":"W2169567855","doi":"10.1109/tcomm.2005.861657","title":"Integer-based constellation-shaping method for PAPR reduction in OFDM systems","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","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":"Orthogonal frequency-division multiplexing; Reduction (mathematics); Hadamard transform; Algorithm; Spectral efficiency; Computational complexity theory; Mathematics; Constellation; Multiplexing; Integer (computer science); Matrix decomposition; Constellation diagram; Computer science; Electronic engineering; Telecommunications; Bit error rate; Decoding methods; Engineering; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.05374440825190632,"score_gpt":0.3084018098456184,"score_spread":0.2546574015937121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169567855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012199754,0.00044852894,0.9874646,0.0005720623,0.0012455063,0.0008145315,0.00008547807,0.0005564592,0.007592849],"genre_scores_gemma":[0.9579587,0.00010122329,0.040955033,0.000016082005,0.00007300712,0.00054017873,0.00004918894,0.000056987752,0.00024961014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986567,0.00016037707,0.0005816428,0.00021369316,0.00014262342,0.0002449847],"domain_scores_gemma":[0.9981146,0.00055239437,0.00007830928,0.0010872075,0.000116683725,0.00005083941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003501994,0.00019870847,0.00023098476,0.0005086722,0.00031071942,0.00006414408,0.00037363014,0.00015043342,0.000030782507],"category_scores_gemma":[0.000006394529,0.00024244915,0.00012815428,0.00059804076,0.00010215917,0.00019491753,0.0000014929016,0.00039192743,0.000029804858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011678795,0.00013605444,0.0000068406935,0.00005179476,0.000027295227,1.2516419e-7,0.00007566651,0.98445684,0.00876686,0.0013661599,0.00069894077,0.004401738],"study_design_scores_gemma":[0.0007351295,0.00003118174,0.000035816018,0.00014686739,0.000047701225,0.000018327333,0.00034759424,0.9633847,0.01875293,0.00050598505,0.015692163,0.00030160503],"about_ca_topic_score_codex":0.00032171776,"about_ca_topic_score_gemma":0.00017487892,"teacher_disagreement_score":0.9567387,"about_ca_system_score_codex":0.00037321274,"about_ca_system_score_gemma":0.000058699443,"threshold_uncertainty_score":0.98867893},"labels":[],"label_agreement":null},{"id":"W2170260879","doi":"10.1109/tcomm.2009.04.070118","title":"Fast multiple-symbol detection for free-space optical communications","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Keying; Symbol (formal); Metric (unit); Channel (broadcasting); Detection theory; Algorithm; Bit error rate; Channel state information; Upper and lower bounds; Modulation (music); Phase-shift keying; Electronic engineering; Mathematics; Telecommunications; Detector; Engineering","score_opus":0.03127390575902961,"score_gpt":0.26656531226350183,"score_spread":0.23529140650447222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170260879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016349967,0.00086124643,0.97371536,0.012440276,0.00022564857,0.0010174518,0.0001732199,0.0031246436,0.0068071303],"genre_scores_gemma":[0.8927796,0.0032450021,0.102721214,0.00012868564,0.000017388686,0.00088270113,0.000036298123,0.000062908606,0.00012621762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838257,0.000104990766,0.000586553,0.0002772404,0.00021328923,0.00043536336],"domain_scores_gemma":[0.98889446,0.0016123132,0.0000772611,0.009037831,0.00022618833,0.0001519404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022731272,0.00033633667,0.00032942975,0.0003681507,0.0010689301,0.00011192384,0.004181527,0.0003230373,0.000016572101],"category_scores_gemma":[0.00012634578,0.0003854751,0.00024616925,0.0007257825,0.0004880477,0.00033648216,0.00003435174,0.0010675375,0.00010381842],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084722,0.0019134071,0.000007998391,0.000051103438,0.000267088,4.658301e-7,0.00071390305,0.04447782,0.060137875,0.03828097,0.0011306013,0.85293406],"study_design_scores_gemma":[0.0017621585,0.00040739807,0.00031953753,0.00010791376,0.00013891453,0.00001615644,0.00090982567,0.7837806,0.17901026,0.007831368,0.024805108,0.00091079646],"about_ca_topic_score_codex":0.000012620114,"about_ca_topic_score_gemma":0.00045353264,"teacher_disagreement_score":0.8911446,"about_ca_system_score_codex":0.00026240316,"about_ca_system_score_gemma":0.00003334089,"threshold_uncertainty_score":0.9998597},"labels":[],"label_agreement":null},{"id":"W2170452593","doi":"10.1109/tcomm.2004.841981","title":"A Wideband Crosstalk Canceller for xDSL Using Common-Mode Information","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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 Ottawa","funders":"","keywords":"Digital subscriber line; Wideband; Common-mode signal; Crosstalk; Electronic engineering; Computer science; Asymmetric digital subscriber line; Telecommunications; Digital signal processing; Engineering; Analog signal","score_opus":0.03253038155207603,"score_gpt":0.30335077414394473,"score_spread":0.2708203925918687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170452593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013534123,0.00062132324,0.977027,0.0012209453,0.00029440483,0.0006224418,0.00046757876,0.00048456495,0.0057276],"genre_scores_gemma":[0.9598817,0.0009924893,0.038279407,0.00019715787,0.000028894561,0.00035128996,0.000072067756,0.000036248697,0.00016070105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990686,0.000040914958,0.0004447469,0.00009396365,0.00010918669,0.00024259456],"domain_scores_gemma":[0.99750787,0.00026818935,0.00006157819,0.0019401747,0.00013053147,0.000091633214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013131136,0.00018256783,0.0001793503,0.00021508666,0.00076055276,0.000095852,0.0007591816,0.000098824945,0.000052292147],"category_scores_gemma":[0.0000055079986,0.00020697965,0.0001296545,0.0003053535,0.00011049903,0.0007603868,0.000006536733,0.00033463005,0.00006683969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037895246,0.00033990666,0.000012335655,0.000048913986,0.00013911561,6.941519e-8,0.0018277655,0.90555257,0.0038601723,0.0008599025,0.0030142653,0.08430711],"study_design_scores_gemma":[0.0006195724,0.000025825446,0.000026473497,0.00004460893,0.00005608905,0.0000062285003,0.000110162655,0.71673304,0.0074125035,0.00016504012,0.2745359,0.00026457768],"about_ca_topic_score_codex":0.00015862685,"about_ca_topic_score_gemma":0.0014738028,"teacher_disagreement_score":0.9463476,"about_ca_system_score_codex":0.00022950246,"about_ca_system_score_gemma":0.000060105005,"threshold_uncertainty_score":0.8440385},"labels":[],"label_agreement":null},{"id":"W2170678650","doi":"10.1109/tcomm.2012.12.100671","title":"Partial and Opportunistic Relay Selection with Outdated Channel Estimates","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Relay channel; Channel state information; Channel (broadcasting); Selection (genetic algorithm); Computer science; Signal-to-noise ratio (imaging); Scheduling (production processes); Outage probability; Bit error rate; Control theory (sociology); Telecommunications; Mathematics; Fading; Wireless; Mathematical optimization; Power (physics); Physics","score_opus":0.07913082268188901,"score_gpt":0.30184955950842934,"score_spread":0.22271873682654034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170678650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015781494,0.00036676985,0.9932412,0.0030523075,0.00014053045,0.00021651892,0.000006367463,0.00031649778,0.0010816621],"genre_scores_gemma":[0.9637747,0.0015545224,0.034031104,0.00022385639,0.000019636258,0.00014094768,0.000009766559,0.0000149035095,0.00023055867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900126,0.0001996026,0.0002141045,0.00019130569,0.00013392958,0.00025981065],"domain_scores_gemma":[0.9978641,0.00032012188,0.000080781174,0.0014281964,0.0001302469,0.00017650833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027599497,0.00015760065,0.00013918855,0.00014307813,0.0010847852,0.000119411685,0.00081233575,0.000057430516,0.000026802345],"category_scores_gemma":[0.000010212705,0.00014370108,0.00003313461,0.00057145534,0.00015884123,0.00065564795,0.00002327531,0.0003575872,0.00003984569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022179914,0.0071764085,0.0024080453,0.0000832374,0.000988822,0.0000044298176,0.022307498,0.033190183,0.0124796145,0.36429718,0.0029831305,0.55385965],"study_design_scores_gemma":[0.0007693853,0.00027625298,0.0017090924,0.00010444635,0.00009761227,0.00011665378,0.00013920192,0.9771263,0.005333165,0.00019368564,0.01357616,0.00055802596],"about_ca_topic_score_codex":0.000013485042,"about_ca_topic_score_gemma":0.00009246302,"teacher_disagreement_score":0.9621965,"about_ca_system_score_codex":0.000054062726,"about_ca_system_score_gemma":0.000056262215,"threshold_uncertainty_score":0.8343401},"labels":[],"label_agreement":null},{"id":"W2170692378","doi":"10.1109/tcomm.2008.060584","title":"P-order metric UWB receiver structures with superior performance","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 Alberta","funders":"","keywords":"Rake receiver; Bandwidth (computing); Multipath propagation; Computer science; Radio receiver design; Electronic engineering; Ultra-wideband; Matched filter; Additive white Gaussian noise; Interference (communication); Algorithm; Telecommunications; Channel (broadcasting); Transmitter; Engineering","score_opus":0.01979123438359709,"score_gpt":0.2177861083471962,"score_spread":0.1979948739635991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170692378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5494717,0.002178502,0.4119812,0.0016795604,0.00038290728,0.00089566555,0.000096831354,0.0034378304,0.029875856],"genre_scores_gemma":[0.96442235,0.007717999,0.02694893,0.00006536352,0.0000073526767,0.00027598158,0.000014697828,0.000056811976,0.0004905321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905115,0.00006231069,0.0002792472,0.00017467471,0.00016890567,0.00026371834],"domain_scores_gemma":[0.9964159,0.00022352043,0.00003579129,0.0031125378,0.00014149336,0.000070739356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060122904,0.00022449472,0.0002087358,0.0004860027,0.000872758,0.000021224605,0.0013307076,0.0001480054,0.00015537997],"category_scores_gemma":[0.0000063636985,0.00021322914,0.000063517786,0.0015846281,0.00041796747,0.00025378948,0.000006261462,0.00078153843,0.00012725424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016817813,0.0017747945,0.002464882,0.00014230616,0.0015192208,0.000011260501,0.005633494,0.71432954,0.012448444,0.0038319388,0.003126602,0.25454932],"study_design_scores_gemma":[0.0076424354,0.0019034616,0.04884228,0.00039066898,0.0009883031,0.0025207845,0.0021919345,0.2920206,0.28063813,0.0011042425,0.35614842,0.00560877],"about_ca_topic_score_codex":0.0000439298,"about_ca_topic_score_gemma":0.00020803562,"teacher_disagreement_score":0.42230898,"about_ca_system_score_codex":0.0001184283,"about_ca_system_score_gemma":0.000058518464,"threshold_uncertainty_score":0.86952317},"labels":[],"label_agreement":null},{"id":"W2170734840","doi":"10.1109/tcomm.2009.06.070109","title":"On the capacity of log-normal fading channels","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Institut National de la Recherche Scientifique; Ericsson (Canada)","funders":"","keywords":"Log-normal distribution; Fading; Truncation (statistics); Expression (computer science); Mathematics; Channel capacity; Series (stratigraphy); Ergodic theory; Remainder; Channel (broadcasting); Maximal-ratio combining; Statistics; Random variable; Fading distribution; Algorithm; Applied mathematics; Computer science; Telecommunications; Mathematical analysis; Rayleigh fading; Decoding methods","score_opus":0.04269886501188365,"score_gpt":0.2688345528964887,"score_spread":0.22613568788460509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170734840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017153718,0.0001326908,0.96464515,0.0025858418,0.00012859076,0.00036299968,0.000043227996,0.0007861175,0.014161638],"genre_scores_gemma":[0.9913865,0.0009969844,0.007222171,0.00018447585,0.000007251549,0.0001110502,0.0000040372106,0.000022007649,0.00006554281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991935,0.00011054838,0.0003002089,0.000095241776,0.00013729771,0.00016318647],"domain_scores_gemma":[0.99668574,0.0005948674,0.00006191447,0.0025433374,0.00007152063,0.00004259184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016980288,0.00014819419,0.0001542527,0.00015883795,0.00037990435,0.000017425042,0.0012185831,0.00007925064,0.000049402122],"category_scores_gemma":[0.000011415034,0.00013291721,0.000100591096,0.00037563613,0.00016525273,0.00015059816,0.0000037481618,0.00060529576,0.000028406548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023679404,0.0007504363,0.0000024704866,0.000023616138,0.00011496891,2.8436412e-7,0.0022370499,0.7724037,0.041790128,0.11476535,0.0010769932,0.06681133],"study_design_scores_gemma":[0.000416544,0.0003127934,0.00019051901,0.00028085982,0.000056913963,0.000010404578,0.00029212443,0.17404978,0.78733784,0.0309536,0.005505306,0.0005933142],"about_ca_topic_score_codex":0.000011903088,"about_ca_topic_score_gemma":0.000021420328,"teacher_disagreement_score":0.97423273,"about_ca_system_score_codex":0.00008246658,"about_ca_system_score_gemma":0.000010666062,"threshold_uncertainty_score":0.5420207},"labels":[],"label_agreement":null},{"id":"W2171227687","doi":"10.1109/tcomm.2010.093010.090216","title":"Performance of an AFC Loop in the Presence of a Single Interferer in a Fading Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Rician fading; Fading; Independent and identically distributed random variables; Nakagami distribution; Rayleigh fading; Channel (broadcasting); Fading distribution; Computer science; Control theory (sociology); Loop (graph theory); Lock (firearm); Electronic engineering; Mathematics; Topology (electrical circuits); Algorithm; Telecommunications; Statistics; Engineering; Random variable; Control (management)","score_opus":0.03221807304165422,"score_gpt":0.2777821394061698,"score_spread":0.24556406636451558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171227687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9337631,0.00006442812,0.063262776,0.00017209619,0.00006243424,0.00032507247,0.000013691883,0.00011411598,0.0022223166],"genre_scores_gemma":[0.99023885,0.0004905853,0.009012192,0.000010354394,0.0000023511832,0.00021518249,0.0000035564697,0.000018234767,0.000008674615],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992246,0.00010710883,0.0003663889,0.000083721476,0.00009896362,0.00011920434],"domain_scores_gemma":[0.9974452,0.00035892453,0.000062072075,0.0020589961,0.00005482158,0.000019953011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002720765,0.00009808943,0.00014632785,0.00029118382,0.000064622676,0.000007876417,0.0014113582,0.00007240883,0.000009572361],"category_scores_gemma":[0.000011737694,0.000094039955,0.0000365787,0.0005585244,0.00018450392,0.00030058302,0.000007888474,0.0006664908,0.0000016792483],"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.000057335346,0.0024861905,0.0003334194,0.00016256943,0.00003163949,4.1782758e-7,0.017057722,0.275467,0.627996,0.0016248078,0.00001176762,0.07477107],"study_design_scores_gemma":[0.0003289577,0.00015856138,0.0013996646,0.000271154,0.000010045586,0.0000071589457,0.0011709784,0.57137865,0.42456594,0.0003879522,0.00012651247,0.00019444707],"about_ca_topic_score_codex":0.00007823299,"about_ca_topic_score_gemma":0.0021797034,"teacher_disagreement_score":0.2959116,"about_ca_system_score_codex":0.00003283267,"about_ca_system_score_gemma":0.0000142122035,"threshold_uncertainty_score":0.3834838},"labels":[],"label_agreement":null},{"id":"W2171250293","doi":"10.1109/tcomm.2005.849638","title":"Iterative Tree Search Detection for MIMO Wireless Systems","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":173,"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":"MIMO; Turbo; Computer science; Quadrature amplitude modulation; Turbo code; Algorithm; Computational complexity theory; Tree (set theory); Wireless; Detection theory; Bit error rate; QAM; Electronic engineering; Mathematics; Decoding methods; Channel (broadcasting); Telecommunications; Engineering; Detector","score_opus":0.03672285389025646,"score_gpt":0.29790987980322453,"score_spread":0.26118702591296805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171250293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002573818,0.0005492327,0.99106044,0.00051190174,0.00018467655,0.0009137735,0.00011363008,0.0014365967,0.002655959],"genre_scores_gemma":[0.9669185,0.0017506002,0.028711021,0.00003776247,0.000043709504,0.0020250971,0.000025359259,0.00007694083,0.00041098765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988623,0.0001327538,0.00040618528,0.00018651188,0.00015290409,0.0002593427],"domain_scores_gemma":[0.9969819,0.00053938164,0.000050002458,0.0021375064,0.00020431678,0.0000868844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001918138,0.00021384809,0.00021461544,0.00028680734,0.00062857685,0.0000759587,0.000923536,0.00013903111,0.0000127795665],"category_scores_gemma":[0.0000041325616,0.0002462227,0.00012419918,0.00038963315,0.0001306932,0.00039876447,0.000005618601,0.000524254,0.00005893381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032830616,0.00033580099,0.0000014915689,0.000068753514,0.00013363437,1.1844974e-7,0.0011031397,0.42774537,0.04611117,0.0025695781,0.0002987635,0.52159935],"study_design_scores_gemma":[0.00037149168,0.00007207198,0.000010968649,0.00006756155,0.000028670489,0.0000065130635,0.00026458624,0.73693466,0.23688088,0.000105360385,0.024975976,0.00028125136],"about_ca_topic_score_codex":0.00002543739,"about_ca_topic_score_gemma":0.0005405664,"teacher_disagreement_score":0.9643447,"about_ca_system_score_codex":0.0003407952,"about_ca_system_score_gemma":0.000023718638,"threshold_uncertainty_score":0.999999},"labels":[],"label_agreement":null},{"id":"W2171275970","doi":"10.1109/26.864163","title":"Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (\"p-cycles\")","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Spare part; Bounding overwatch; Computer science; Set (abstract data type); Upper and lower bounds; Work (physics); Computer network; Span (engineering); Mathematical optimization; Mathematics; Engineering; Structural engineering; Operations management; Artificial intelligence","score_opus":0.042304511881844586,"score_gpt":0.29279207949562897,"score_spread":0.2504875676137844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171275970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00211165,0.0007684623,0.99292076,0.0020557803,0.00021382367,0.0004475292,0.000013906777,0.00015920552,0.0013088599],"genre_scores_gemma":[0.96331835,0.0007154018,0.03545661,0.00022907002,0.000026165846,0.00011219413,0.0000023754483,0.000019500061,0.000120354045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987632,0.00015396392,0.00036692046,0.00025471373,0.00016965803,0.00029156575],"domain_scores_gemma":[0.9952416,0.0021541906,0.000096100506,0.002332445,0.00010813489,0.00006757524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040376096,0.00015327372,0.00018700378,0.00008227171,0.0010755396,0.00009780648,0.002134907,0.000107202155,0.00014836826],"category_scores_gemma":[0.000011597567,0.000123653,0.00017533237,0.00061176997,0.0005112809,0.00018749564,0.000010065069,0.00032922687,0.000009351887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005307137,0.00052355515,0.000011742816,0.000010500322,0.000088946654,2.2289059e-7,0.0007366945,0.74554986,0.00012082618,0.13345279,0.0003408606,0.11911095],"study_design_scores_gemma":[0.000316727,0.000085931715,0.000079417354,0.00006223234,0.000056078527,0.0000081389835,0.000040130006,0.98897946,0.0006332329,0.00794846,0.0016394468,0.00015074444],"about_ca_topic_score_codex":0.00007169749,"about_ca_topic_score_gemma":0.000039294202,"teacher_disagreement_score":0.9612067,"about_ca_system_score_codex":0.00004519934,"about_ca_system_score_gemma":0.00008655427,"threshold_uncertainty_score":0.82722896},"labels":[],"label_agreement":null},{"id":"W2171323387","doi":"10.1109/tcomm.2010.080310.090066","title":"Bypassing Orthogonal Relaying Transmissions via Spatial Signal Separation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Space-division multiple access; Computer science; Spectral efficiency; Antenna diversity; Coding (social sciences); MIMO; Topology (electrical circuits); Relay; Electronic engineering; Algorithm; Antenna (radio); Mathematics; Telecommunications; Base station; Engineering; Channel (broadcasting); Electrical engineering; Statistics; Physics","score_opus":0.04214836407210019,"score_gpt":0.31640642984982165,"score_spread":0.27425806577772144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171323387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022479966,0.000104248706,0.9845788,0.006779759,0.0005499312,0.0002927208,0.000009670005,0.0004264315,0.0050104284],"genre_scores_gemma":[0.9311612,0.00043122267,0.06746781,0.00039047722,0.000047465775,0.00013873595,0.00001569926,0.000022697785,0.00032467867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981338,0.00037558487,0.00048781125,0.00038236505,0.0003140725,0.00030640772],"domain_scores_gemma":[0.9957855,0.00056206936,0.00013571739,0.003064248,0.00024518056,0.00020733234],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004409791,0.00023777614,0.00019774353,0.00027244748,0.002470144,0.0002627886,0.0025123688,0.00015393221,0.00030263196],"category_scores_gemma":[0.0000112504595,0.00024789604,0.00017798445,0.0008108695,0.00021220233,0.00073524436,0.000030495547,0.0014193368,0.00014814822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016814563,0.000746449,0.000029772134,0.0000053877816,0.00006252863,0.0000016579927,0.0016556693,0.003756363,0.1379084,0.028521048,0.0002671591,0.82702875],"study_design_scores_gemma":[0.0007134018,0.000112168505,0.0006793765,0.000067129964,0.000045124594,0.00004909528,0.0000423714,0.94266784,0.020458952,0.0017046874,0.03287612,0.0005837292],"about_ca_topic_score_codex":0.000029246658,"about_ca_topic_score_gemma":0.0012249006,"teacher_disagreement_score":0.9389115,"about_ca_system_score_codex":0.00006242985,"about_ca_system_score_gemma":0.00020107043,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W2171567428","doi":"10.1109/tcomm.2009.11.070197","title":"On the integrated cross-noise term in correlation detectors","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Noise (video); Gaussian noise; Autocorrelation; Probability density function; Algorithm; Cross-correlation; Noise measurement; SIGNAL (programming language); Component (thermodynamics); Gaussian; Mathematics; Signal processing; Statistics; Computer science; Noise reduction; Physics; Artificial intelligence; Telecommunications","score_opus":0.016380758193675984,"score_gpt":0.25425361890666487,"score_spread":0.23787286071298888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171567428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62535375,0.000514683,0.33953485,0.008476102,0.00051487185,0.0012790017,0.00008022874,0.0025246453,0.021721857],"genre_scores_gemma":[0.9978505,0.00053516397,0.0009648056,0.00020559193,0.0000040301056,0.00023047219,0.000016927816,0.000027150567,0.00016537488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898994,0.00014463284,0.0003759238,0.00015142099,0.00011776075,0.00022033595],"domain_scores_gemma":[0.99612546,0.0007854945,0.000044812932,0.0029421207,0.000060252318,0.000041872016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018575834,0.00019335054,0.00014975565,0.0003760908,0.00044277223,0.000058427693,0.0014025047,0.00018062473,0.00008709882],"category_scores_gemma":[0.000033319193,0.00016794566,0.000085899555,0.0009715499,0.00019509842,0.00015005299,0.0000033248314,0.0012046435,0.00016342013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008608772,0.0017571561,0.0005306903,0.000012045237,0.00013985857,0.0000021917842,0.002117314,0.7184548,0.029934762,0.026108926,0.00092051516,0.21993567],"study_design_scores_gemma":[0.0029946284,0.0008044108,0.059602648,0.00057914836,0.00015959944,0.00005532478,0.00096200954,0.8112559,0.08420619,0.024308998,0.013169104,0.0019020489],"about_ca_topic_score_codex":0.000035367786,"about_ca_topic_score_gemma":0.0005204459,"teacher_disagreement_score":0.3724967,"about_ca_system_score_codex":0.00023051587,"about_ca_system_score_gemma":0.000028020455,"threshold_uncertainty_score":0.68486255},"labels":[],"label_agreement":null},{"id":"W2171915411","doi":"10.1109/tcomm.2010.101210.090367","title":"Robust L_p-Norm Decoding for BICM-Based Secondary User Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"Weibull fading; Decoding methods; Fading; Algorithm; Computer science; Nakagami distribution; Gaussian noise; Rayleigh fading; Bit error rate; Mathematics; Electronic engineering; Engineering","score_opus":0.03296156520620366,"score_gpt":0.2444072024845561,"score_spread":0.21144563727835244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171915411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009325087,0.00039149635,0.97894955,0.001589568,0.0011356386,0.0008683878,0.00025966935,0.001786142,0.0056944685],"genre_scores_gemma":[0.93710214,0.0002738915,0.060457047,0.00008509804,0.000025001578,0.0016059914,0.000059570568,0.00008768372,0.0003035591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882394,0.00005980586,0.0004585098,0.00021292835,0.00011457466,0.0003302246],"domain_scores_gemma":[0.9946739,0.0009430135,0.000067234905,0.004057244,0.00015743426,0.000101177204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024467884,0.0002450159,0.00024677665,0.000432891,0.0008104211,0.00009387772,0.0017939835,0.0003012507,0.000081743994],"category_scores_gemma":[0.0000195118,0.00027966348,0.00016898462,0.000494886,0.00022140249,0.00021527562,0.000006638236,0.00128098,0.000085678665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005162579,0.0014237935,0.000093638126,0.00030944467,0.000597685,0.000001145263,0.0005858338,0.7348461,0.122404315,0.024160549,0.0074900156,0.10803582],"study_design_scores_gemma":[0.0012689122,0.00009255032,0.00007527611,0.00008745183,0.00015748228,0.000029597013,0.00031992883,0.7802073,0.039834615,0.0004060573,0.17682134,0.00069952646],"about_ca_topic_score_codex":0.00006222826,"about_ca_topic_score_gemma":0.0016535114,"teacher_disagreement_score":0.92777705,"about_ca_system_score_codex":0.00010764838,"about_ca_system_score_gemma":0.00009197884,"threshold_uncertainty_score":0.99996555},"labels":[],"label_agreement":null},{"id":"W2172242942","doi":"10.1109/tcomm.2009.04.070310","title":"Iterative decoding of serially concatenated CPM in fading channels with noisy channel state information","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Fading; Channel state information; Algorithm; Decoding methods; Factor graph; Computer science; Continuous phase modulation; Channel (broadcasting); Telecommunications; Wireless","score_opus":0.016933775635755124,"score_gpt":0.25290947863846724,"score_spread":0.23597570300271212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172242942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02445674,0.000094072966,0.97129107,0.00052909297,0.00008130865,0.0005848766,0.00006675734,0.00061613537,0.0022799713],"genre_scores_gemma":[0.9825718,0.0012064646,0.015911708,0.000059124217,0.0000035265123,0.0001654217,0.000039062426,0.000022474469,0.00002041329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998931,0.00008788739,0.0005392898,0.00010071323,0.0001357927,0.000205329],"domain_scores_gemma":[0.998344,0.0001737361,0.0001335901,0.0011207056,0.00017437922,0.000053604388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016017513,0.0001937197,0.00024915146,0.00051097956,0.00017862824,0.0000412558,0.0006496947,0.00008054965,0.000008876078],"category_scores_gemma":[0.0000058319233,0.00020380484,0.000046248224,0.00075187057,0.00009441423,0.0010621964,0.000004459861,0.0004385605,0.000009297116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005609272,0.00016760295,0.0000050289864,0.000028840259,0.000047021324,4.659476e-7,0.0063389074,0.94881284,0.008118907,0.0006538949,0.000025074547,0.03574534],"study_design_scores_gemma":[0.0016700665,0.00038573248,0.000360088,0.00068092835,0.000034377816,0.000017074068,0.00090298365,0.60409975,0.38832736,0.002059708,0.0007635333,0.00069838227],"about_ca_topic_score_codex":0.000031617856,"about_ca_topic_score_gemma":0.00015086982,"teacher_disagreement_score":0.95811504,"about_ca_system_score_codex":0.0001727101,"about_ca_system_score_gemma":0.000031209758,"threshold_uncertainty_score":0.83109206},"labels":[],"label_agreement":null},{"id":"W2174416479","doi":"10.1109/tcomm.2015.2497239","title":"Downlink Power Control in Two-Tier Cellular Networks With Energy-Harvesting Small Cells as Stochastic Games","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macrocell; Computer science; Power control; Base station; Stochastic geometry; Small cell; Energy harvesting; Telecommunications link; Transmitter power output; Mathematical optimization; Computer network; Energy (signal processing); Power (physics); Channel (broadcasting); Mathematics","score_opus":0.0178297000712583,"score_gpt":0.2229465426090453,"score_spread":0.205116842537787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174416479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077213603,0.00088941364,0.9840776,0.0001521453,0.0005052471,0.00023723616,0.000016593312,0.00062322244,0.0057772035],"genre_scores_gemma":[0.98997355,0.00011277749,0.008735352,0.00017719639,0.000058846137,0.00021067652,0.000019003923,0.00012425455,0.0005883666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982411,0.00023461781,0.0004909258,0.0003003603,0.00022374178,0.00050925004],"domain_scores_gemma":[0.99699104,0.00077826134,0.000089549525,0.0017217491,0.0001466783,0.00027274832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003184923,0.00036506352,0.00035120934,0.00026770556,0.00022454959,0.00010042344,0.00084787654,0.0001618091,0.000030595478],"category_scores_gemma":[0.000012383514,0.00037955158,0.00008671045,0.0006856615,0.0002055822,0.00020909744,0.0000074890468,0.0010007514,0.000047228437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028447712,0.00014983157,0.000016717891,0.000005328062,0.000077645935,0.0000068635245,0.00028589438,0.996284,0.0005630695,0.00030487968,0.00008953512,0.002187806],"study_design_scores_gemma":[0.0016260867,0.000103527804,0.00002150125,0.00024200129,0.00007672507,0.000016942147,0.00014312277,0.99469376,0.001078184,0.00011241715,0.0014113422,0.00047438845],"about_ca_topic_score_codex":0.0006433071,"about_ca_topic_score_gemma":0.0036995236,"teacher_disagreement_score":0.9822522,"about_ca_system_score_codex":0.00022878536,"about_ca_system_score_gemma":0.00009550904,"threshold_uncertainty_score":0.99986565},"labels":[],"label_agreement":null},{"id":"W2182209980","doi":"10.1109/tcomm.2015.2477082","title":"An Incremental Redundancy Hybrid ARQ Scheme via Puncturing and Extending of Polar Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Puncturing; Hybrid automatic repeat request; Algorithm; Computer science; Automatic repeat request; Redundancy (engineering); Polar code; Polar; Coding (social sciences); Error detection and correction; Decoding methods; Forward error correction; Mathematics; Transmission (telecommunications); Telecommunications","score_opus":0.05324886164437508,"score_gpt":0.3161911413478035,"score_spread":0.2629422797034284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182209980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056295075,0.0002390549,0.9414684,0.00046371113,0.00016222996,0.00018862511,0.000014021282,0.00047881115,0.0006900522],"genre_scores_gemma":[0.7380178,0.00008861963,0.26178026,0.000039249866,0.0000068690874,0.00003321008,0.0000031463107,0.000012751278,0.000018066412],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988275,0.00020310789,0.00030450235,0.0002621219,0.00022451232,0.00017825075],"domain_scores_gemma":[0.9972454,0.00016491815,0.0001282746,0.002174996,0.00014347286,0.00014295834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005090541,0.0001487532,0.00017442886,0.00025471018,0.00038451873,0.00008152509,0.0014949043,0.00004639185,0.000003748449],"category_scores_gemma":[0.000015179064,0.00015932991,0.000054379012,0.0003193282,0.00016882125,0.000737402,0.000032127704,0.00034191218,0.0000055275354],"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.00010537033,0.0041913544,0.0025927967,0.000122853,0.00033076477,0.000013028987,0.014778713,0.0018967728,0.5280102,0.027001435,0.00047619423,0.42048052],"study_design_scores_gemma":[0.00080048403,0.00072589936,0.00074371655,0.00023131941,0.00005516246,0.00023175144,0.00058417267,0.25984797,0.7248945,0.010206044,0.0009971189,0.00068184384],"about_ca_topic_score_codex":0.00042186162,"about_ca_topic_score_gemma":0.00022008592,"teacher_disagreement_score":0.68172276,"about_ca_system_score_codex":0.00010570482,"about_ca_system_score_gemma":0.00007186153,"threshold_uncertainty_score":0.6497285},"labels":[],"label_agreement":null},{"id":"W2182484825","doi":"10.1109/tcomm.2015.2469690","title":"Rate Maximization Through Structured Spectrum Allocation and User Association in Heterogeneous Cellular Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Bell Canada Enterprises","keywords":"Mathematical optimization; Telecommunications link; Computer science; Association scheme; Frequency allocation; Maximization; Nash equilibrium; Geometric programming; Convex optimization; Base station; Association (psychology); Stochastic geometry; Regular polygon; Mathematics; Statistics; Computer network","score_opus":0.019791996952064145,"score_gpt":0.23176952567860368,"score_spread":0.21197752872653952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182484825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054451143,0.0005264854,0.9919463,0.00038232768,0.00045339105,0.00046200142,0.000017255357,0.00030608088,0.0004610471],"genre_scores_gemma":[0.987675,0.0012481149,0.010583631,0.000047271067,0.000029673562,0.0001288248,0.00007391248,0.000053754076,0.00015977866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889064,0.0001957995,0.00038201903,0.00018961291,0.00012249447,0.0002194244],"domain_scores_gemma":[0.9988456,0.00013267377,0.000098310295,0.00075361534,0.00009620163,0.000073598814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023887068,0.0001841108,0.0001855495,0.0001543107,0.0001533245,0.000059320028,0.00023091026,0.00018409068,0.000010627699],"category_scores_gemma":[0.000015691601,0.00022210479,0.0000361686,0.0004856503,0.000034496978,0.00044666757,0.000004037262,0.00032855212,0.0000141057235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009212443,0.000039927156,0.00008489379,0.000008105369,0.000030302934,4.4360462e-7,0.0004458949,0.99792284,0.0005277041,0.0001849089,0.0000650247,0.00068076234],"study_design_scores_gemma":[0.0007592248,0.00003319791,0.00012395608,0.000037279682,0.00003786516,0.0000055188048,0.00013225878,0.9900778,0.0068111313,0.00078748236,0.00093488075,0.00025943352],"about_ca_topic_score_codex":0.00007253112,"about_ca_topic_score_gemma":0.0011125904,"teacher_disagreement_score":0.98222995,"about_ca_system_score_codex":0.0005925714,"about_ca_system_score_gemma":0.000025137886,"threshold_uncertainty_score":0.905717},"labels":[],"label_agreement":null},{"id":"W2187647323","doi":"10.1109/tcomm.2015.2475417","title":"Closed-Form Expressions for the BER/SER of OFDM Systems With an Integer Time Offset","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Phase-shift keying; Bit error rate; Carrier frequency offset; Rayleigh fading; Quadrature amplitude modulation; Additive white Gaussian noise; QAM; Algorithm; Mathematics; Fading; Modulation (music); Integer (computer science); Offset (computer science); Computer science; Frequency offset; Telecommunications; White noise; Statistics; Channel (broadcasting); Decoding methods; Physics","score_opus":0.051555165475320415,"score_gpt":0.2915583506110149,"score_spread":0.24000318513569452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187647323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012234879,0.00052668026,0.9938175,0.00046142878,0.0001080003,0.0009176754,0.00023433077,0.0006418692,0.0020689974],"genre_scores_gemma":[0.9659285,0.00045500754,0.031691227,0.00002734922,0.000013365604,0.0013886763,0.000049396516,0.000065576656,0.00038088992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990332,0.00010332061,0.00038398814,0.00012827679,0.00018379306,0.00016741014],"domain_scores_gemma":[0.9953515,0.0006894745,0.00010108584,0.0034359396,0.0003150752,0.000106902415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026269758,0.0001815252,0.0002229114,0.00014430795,0.0003482173,0.00003227347,0.001425094,0.00009980731,0.000012691475],"category_scores_gemma":[0.000010383282,0.00013646272,0.00007741045,0.00032189107,0.00023893263,0.0003418975,0.000009414503,0.00039194696,0.000018263774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019319131,0.0010397356,0.000011657979,0.00009960322,0.0004111974,2.3384172e-7,0.0036036312,0.94161767,0.009782021,0.007830973,0.004403495,0.031006604],"study_design_scores_gemma":[0.0010226903,0.00044281522,0.000036791032,0.00031411252,0.00015879708,0.000013215436,0.0024187388,0.9176922,0.03510856,0.0012439358,0.041052304,0.0004958672],"about_ca_topic_score_codex":0.00006818583,"about_ca_topic_score_gemma":0.00015090859,"teacher_disagreement_score":0.96470505,"about_ca_system_score_codex":0.00010680128,"about_ca_system_score_gemma":0.00005868097,"threshold_uncertainty_score":0.55647886},"labels":[],"label_agreement":null},{"id":"W2188722487","doi":"10.1109/tcomm.2015.2469685","title":"Performance Analysis of Parallel Relaying in Free-Space Optical Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"Diversity gain; Fading; Computer science; Relay; Multiplexing; Coding gain; Electronic engineering; Outage probability; Decoding methods; Coding (social sciences); Antenna diversity; Free-space optical communication; Optical communication; Computer network; Telecommunications; Wireless; Physics; Engineering; Mathematics; Power (physics)","score_opus":0.05161129614597985,"score_gpt":0.26492821529230715,"score_spread":0.2133169191463273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188722487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18216819,0.0063902475,0.7738973,0.0037518786,0.00045999233,0.0005981575,0.00009126765,0.0015302703,0.031112684],"genre_scores_gemma":[0.97582674,0.0037768676,0.020092398,0.000006089786,0.000002269902,0.00016848503,0.000007951959,0.000021422502,0.0000977524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989573,0.00008376927,0.00045504322,0.000119864664,0.00019059557,0.00019342273],"domain_scores_gemma":[0.99614424,0.00039876168,0.00004976813,0.0032205426,0.00010931527,0.000077402685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029709638,0.00013381187,0.0003137179,0.0007111802,0.00008171198,0.000022617212,0.0014131985,0.00015468414,0.000007053933],"category_scores_gemma":[0.00003547001,0.00014901027,0.00009403474,0.0019460812,0.0002374365,0.00020547713,0.000017342736,0.00056308083,0.00002489709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007245566,0.00016995678,0.00019592297,0.00001882113,0.00021342182,2.42351e-7,0.0002678434,0.98957026,0.00015105552,0.005086223,0.00008622055,0.004232806],"study_design_scores_gemma":[0.00033230457,0.000040446837,0.000673527,0.00006326668,0.0001492894,0.0000017030734,0.00075024925,0.9957139,0.0012330095,0.00010588831,0.0007701949,0.00016625173],"about_ca_topic_score_codex":0.00009814427,"about_ca_topic_score_gemma":0.00026683824,"teacher_disagreement_score":0.79365855,"about_ca_system_score_codex":0.00018165517,"about_ca_system_score_gemma":0.000030460544,"threshold_uncertainty_score":0.6076462},"labels":[],"label_agreement":null},{"id":"W2214742514","doi":"10.1109/tcomm.2015.2495286","title":"Distributed Collaborative Beamforming Design for Maximized Throughput in Interfered and Scattered Environments","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Overhead (engineering); Computer science; Channel (broadcasting); Topology (electrical circuits); Throughput; Wireless; Wireless network; Algorithm; Electronic engineering; Computer engineering; Mathematics; Computer network; Telecommunications; Engineering; Combinatorics","score_opus":0.0562185055676709,"score_gpt":0.2757258060062247,"score_spread":0.21950730043855382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214742514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006161427,0.00022240961,0.99736106,0.00023495816,0.00013294132,0.00095079973,0.00023579861,0.000117794625,0.0001280645],"genre_scores_gemma":[0.8553239,0.00026278614,0.14348918,0.00001460929,0.0000052485807,0.00073988934,0.000081056576,0.000033601493,0.00004973364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924135,0.00009323579,0.00029952495,0.00014250398,0.0000636589,0.0001597051],"domain_scores_gemma":[0.9990153,0.00022096951,0.00004736366,0.00059970847,0.00004394241,0.00007274256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016443337,0.00014648742,0.00018740156,0.0001269231,0.000133902,0.00002863783,0.00022918833,0.00007695005,0.000002905938],"category_scores_gemma":[0.000014867465,0.00016698145,0.000026541342,0.0002769062,0.00007410457,0.00029687438,0.0000037607226,0.00015643459,0.0000070959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777009,0.000092119946,0.000005469571,0.000012107613,0.000042746735,1.6609712e-7,0.0015463972,0.99385107,0.0015973314,0.000041110907,0.00011008044,0.0026336347],"study_design_scores_gemma":[0.00360327,0.00012615861,0.000021730066,0.00011043922,0.000049425882,0.0000056139042,0.0020382234,0.97677886,0.014097091,0.00067061355,0.002162451,0.00033613452],"about_ca_topic_score_codex":0.000009990991,"about_ca_topic_score_gemma":0.00009653823,"teacher_disagreement_score":0.8547078,"about_ca_system_score_codex":0.00027710473,"about_ca_system_score_gemma":0.00002587325,"threshold_uncertainty_score":0.68093055},"labels":[],"label_agreement":null},{"id":"W2216941018","doi":"10.1109/tcomm.2015.2496260","title":"Energy-Efficient Adaptive Rate Control for Streaming Media Transmission Over Cognitive Radio","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"National Natural Science Foundation of China","keywords":"Computer science; Quality of service; Cognitive radio; Transmission (telecommunications); Markov decision process; Computer network; Markov process; Mathematical optimization; Wireless; Telecommunications","score_opus":0.04068414524718479,"score_gpt":0.2707951690183008,"score_spread":0.23011102377111603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216941018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008611666,0.000494784,0.9948387,0.0014698933,0.0003765879,0.000437797,0.00009528173,0.00020678501,0.0012189741],"genre_scores_gemma":[0.9803686,0.00019560455,0.01876349,0.0003371166,0.00005622074,0.0001468075,0.000014916921,0.00002637677,0.00009087035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982715,0.00038748336,0.000334353,0.00040076897,0.00025025808,0.00035559744],"domain_scores_gemma":[0.99586135,0.002427783,0.00011801493,0.00093328144,0.00038498692,0.00027455742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044838706,0.00023596107,0.0002698858,0.00022126352,0.00068703276,0.00012328892,0.0007735026,0.00009905933,0.000008234733],"category_scores_gemma":[0.000020036689,0.00023315949,0.00019809917,0.0005196166,0.00016395628,0.00025743997,0.0000069162475,0.0003077266,0.000009674255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049457734,0.0014902422,0.0000038602407,0.00000785973,0.00035677536,0.000008841946,0.006131782,0.056265183,0.0013011404,0.03582547,0.00045635636,0.89765793],"study_design_scores_gemma":[0.0026689803,0.00022960604,0.00006781695,0.00011840087,0.00010303878,0.000012307019,0.00034548857,0.98928964,0.0031312853,0.0019265915,0.0018066629,0.00030019754],"about_ca_topic_score_codex":0.00008769495,"about_ca_topic_score_gemma":0.00020884935,"teacher_disagreement_score":0.97950745,"about_ca_system_score_codex":0.00018560907,"about_ca_system_score_gemma":0.00020461797,"threshold_uncertainty_score":0.95079684},"labels":[],"label_agreement":null},{"id":"W2243098549","doi":"10.1109/tcomm.2015.2502952","title":"A New Class of Rateless Codes Based on Reed–Solomon Codes","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erasure; Overhead (engineering); Online codes; Block code; Notation; Computer science; Class (philosophy); Raptor code; Discrete mathematics; Luby transform code; Coding (social sciences); Fountain code; Algorithm; Mathematics; Decoding methods; Theoretical computer science; Linear code; Arithmetic; Programming language; Statistics; Artificial intelligence","score_opus":0.06090656670449825,"score_gpt":0.2920649838029278,"score_spread":0.23115841709842955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243098549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015052619,0.00007309533,0.9882811,0.0026724765,0.0002304825,0.00017200402,0.000032354135,0.00021471122,0.0068185297],"genre_scores_gemma":[0.93898994,0.000051884428,0.060474347,0.0002652221,0.00000977021,0.000041002095,0.00000534385,0.000011356489,0.00015111276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.0003716898,0.00028436966,0.00023391785,0.00025936562,0.00017766783],"domain_scores_gemma":[0.9960274,0.0006593996,0.00011288274,0.0028609105,0.00016595902,0.00017343381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044679167,0.0001470033,0.0002043343,0.0003102354,0.00029643506,0.00006875309,0.0020793178,0.00008106432,0.000019972538],"category_scores_gemma":[0.000013256137,0.00015193096,0.00014957339,0.0009030303,0.00017385086,0.0002157827,0.0000116671645,0.00031993937,0.00004098639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005886661,0.0043431823,0.00013928894,0.000050554172,0.00027160769,0.0000051687693,0.0062268614,0.10102353,0.006516206,0.5670696,0.005068266,0.3086971],"study_design_scores_gemma":[0.0053640404,0.0031194622,0.000474611,0.00060619565,0.0002276003,0.000025165478,0.0009649639,0.7158412,0.14972404,0.08852809,0.033631373,0.0014933076],"about_ca_topic_score_codex":0.00015430027,"about_ca_topic_score_gemma":0.00035934997,"teacher_disagreement_score":0.9374847,"about_ca_system_score_codex":0.00004743831,"about_ca_system_score_gemma":0.00022712312,"threshold_uncertainty_score":0.6195565},"labels":[],"label_agreement":null},{"id":"W2246689711","doi":"10.1109/tcomm.2016.2555908","title":"Analysis of Massive MIMO-Enabled Downlink Wireless Backhauling for Full-Duplex Small Cells","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Telecommunications link; Computer network; MIMO; Stochastic geometry; Computer science; Wireless; Wireless network; Base station; Zero-forcing precoding; Multi-user MIMO; Precoding; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering; Mathematics; Statistics","score_opus":0.031504866662656665,"score_gpt":0.2509358748837726,"score_spread":0.21943100822111594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246689711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16864523,0.00024304836,0.8268718,0.0013634377,0.00025402306,0.0006983957,0.0011480979,0.00045030224,0.0003256344],"genre_scores_gemma":[0.9681214,0.0026173985,0.027847247,0.000037840317,0.000018156228,0.0007782088,0.00008577518,0.00008759335,0.0004063627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803746,0.00016381533,0.0008609501,0.00031911844,0.00019848964,0.0004201813],"domain_scores_gemma":[0.9925659,0.0024405716,0.00019588401,0.004229913,0.0004107592,0.00015700085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028549525,0.00033780938,0.0005982593,0.0008644432,0.00050057564,0.000042741176,0.001937378,0.00022057763,0.00018291181],"category_scores_gemma":[0.000019527759,0.00031095798,0.0005767681,0.0016516632,0.00029645822,0.00021539761,0.000017078755,0.00037214707,0.00006535267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032938162,0.00030318546,0.0000120538825,0.000046228393,0.0015241938,1.7932636e-7,0.00039554382,0.78712565,0.19511509,0.0005708825,0.0001230712,0.014750971],"study_design_scores_gemma":[0.0009462807,0.0000744149,0.00011915207,0.00013535639,0.0013840038,0.0000011616678,0.00025811986,0.9099167,0.08378293,0.000020451786,0.0029171668,0.00044426217],"about_ca_topic_score_codex":0.00006890004,"about_ca_topic_score_gemma":0.0017017532,"teacher_disagreement_score":0.7994762,"about_ca_system_score_codex":0.0002368741,"about_ca_system_score_gemma":0.00007587096,"threshold_uncertainty_score":0.99993426},"labels":[],"label_agreement":null},{"id":"W2275669737","doi":"10.1109/tcomm.2015.2514089","title":"Design of a Short Reference Noncoherent Chaos-Based Communication Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":171,"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":"Computer science; Keying; Chaotic; Energy (signal processing); SIGNAL (programming language); Bit error rate; Electronic engineering; Additive white Gaussian noise; Data transmission; Transmission (telecommunications); Multipath propagation; Algorithm; Communications system; Telecommunications; Mathematics; Decoding methods; White noise; Statistics; Channel (broadcasting); Engineering; Computer network","score_opus":0.05790060647622867,"score_gpt":0.282197505951102,"score_spread":0.22429689947487333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275669737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014436168,0.00012514346,0.99414575,0.00072170503,0.00008390502,0.0005092773,0.00012823782,0.00006208007,0.0027802752],"genre_scores_gemma":[0.9960671,0.000110034984,0.0029709921,0.00001521022,0.000015449374,0.0004137912,0.000032544252,0.000020242855,0.00035463096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876374,0.0003457049,0.0004068313,0.00016316355,0.00016809246,0.00015248217],"domain_scores_gemma":[0.9969712,0.00061440095,0.00014066516,0.0019717843,0.00024039634,0.00006154534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002292738,0.00014725822,0.0002083296,0.00012434274,0.00031117146,0.000026508991,0.00070331804,0.000055372515,0.00021272826],"category_scores_gemma":[0.0000023799746,0.00011570963,0.00008257522,0.00023141157,0.00015974797,0.00014772323,0.000005173837,0.00016276352,0.000051771814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041636478,0.006350109,0.0019632492,0.000080248,0.00088576373,3.983775e-7,0.0013272268,0.2906216,0.11989422,0.08806915,0.00077850424,0.48961315],"study_design_scores_gemma":[0.008232137,0.00098037,0.0017326167,0.0021004963,0.0007261366,0.0000040163427,0.0011599807,0.855909,0.110051654,0.004506559,0.012698895,0.0018981408],"about_ca_topic_score_codex":0.00024741574,"about_ca_topic_score_gemma":0.00003560971,"teacher_disagreement_score":0.9946235,"about_ca_system_score_codex":0.000074862444,"about_ca_system_score_gemma":0.00012403372,"threshold_uncertainty_score":0.47185016},"labels":[],"label_agreement":null},{"id":"W2287608525","doi":"10.1109/tcomm.2015.2506698","title":"Energy Efficiency of Adaptive HARQ","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Transmitter; Rayleigh fading; Decoding methods; Transmission (telecommunications); Channel state information; Channel (broadcasting); Fading; Automatic repeat request; Transmitter power output; Link adaptation; Adaptive coding; Real-time computing; Computer network; Electronic engineering; Algorithm; Wireless; Telecommunications; Engineering","score_opus":0.10757928056429754,"score_gpt":0.30315965570770315,"score_spread":0.1955803751434056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287608525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015797853,0.0007390796,0.9800709,0.0019695489,0.00020079901,0.00009790508,0.000006944924,0.00014977877,0.016607098],"genre_scores_gemma":[0.9633888,0.0012347993,0.03452831,0.00023003273,0.00000749162,0.000064315784,0.0000030883823,0.0000070494098,0.00053611054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987604,0.0003442604,0.00031584885,0.00019421085,0.0002273139,0.00015797606],"domain_scores_gemma":[0.9959318,0.00031973864,0.000114502735,0.0031038926,0.00039869908,0.00013134105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030417446,0.00012457442,0.00016250793,0.00020323839,0.00034141215,0.00004289404,0.0027541323,0.00005225841,0.000016551325],"category_scores_gemma":[0.000010790264,0.000126217,0.00009074661,0.0009482537,0.00019115178,0.00031005897,0.000038244907,0.0002361555,0.00002516546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035363435,0.0020153243,0.000010925764,0.0000049026767,0.00011046502,0.0000010735757,0.0051691923,0.0115916,0.0021921527,0.56766784,0.00255825,0.4086429],"study_design_scores_gemma":[0.0011907043,0.0005525411,0.00005728507,0.00010092942,0.000035193083,0.000016780921,0.00040239136,0.91169184,0.03268046,0.004851012,0.04790911,0.0005117203],"about_ca_topic_score_codex":0.000039766925,"about_ca_topic_score_gemma":0.00015545757,"teacher_disagreement_score":0.96323085,"about_ca_system_score_codex":0.00007832873,"about_ca_system_score_gemma":0.00018560732,"threshold_uncertainty_score":0.51469797},"labels":[],"label_agreement":null},{"id":"W2316613882","doi":"10.1109/tcomm.2016.2550524","title":"Error Probability Analysis and Applications of Amplitude-Coherent Detection in Flat Rayleigh Fading Channels","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Western University","funders":"","keywords":"Detector; Fading; Rayleigh fading; Algorithm; Multipath propagation; Electronic engineering; Monte Carlo method; Detection theory; Mathematics; Probability density function; Computer science; Diversity combining; Quadrature amplitude modulation; Bit error rate; Statistics; Channel (broadcasting); Telecommunications; Engineering; Decoding methods","score_opus":0.028290653831806203,"score_gpt":0.27922137724872487,"score_spread":0.2509307234169187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2316613882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026161866,0.0001929614,0.9718909,0.00017991969,0.000033094948,0.00068300613,0.00005888518,0.00039978174,0.00039956297],"genre_scores_gemma":[0.9853675,0.0017931601,0.011145063,0.0000066362873,0.0000052615633,0.0016097147,0.000006967873,0.000027014652,0.00003871655],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883354,0.00013541471,0.000519554,0.00021541759,0.000122048164,0.00017402087],"domain_scores_gemma":[0.9970851,0.00052689144,0.00009598615,0.0021316824,0.00009527676,0.00006504562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023874108,0.00017051556,0.0002840136,0.00065360876,0.00018341844,0.000015629541,0.00058200455,0.00011993302,0.000031434287],"category_scores_gemma":[0.000009137334,0.00015885542,0.00010368686,0.0012820405,0.00022682594,0.0002390769,0.000011716115,0.00028975127,0.0000067959822],"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.00003845888,0.000680466,0.00088112184,0.00014279173,0.0006298165,1.6493789e-7,0.0012161573,0.09028414,0.17550306,0.0025659802,0.0000066122107,0.72805125],"study_design_scores_gemma":[0.0013938807,0.00015129786,0.0068962537,0.00031072268,0.0005780292,0.0000067006754,0.0003212155,0.090017326,0.87831336,0.016757052,0.004185097,0.0010690684],"about_ca_topic_score_codex":0.0000838225,"about_ca_topic_score_gemma":0.0016418551,"teacher_disagreement_score":0.9607459,"about_ca_system_score_codex":0.00021461706,"about_ca_system_score_gemma":0.000013347849,"threshold_uncertainty_score":0.64779353},"labels":[],"label_agreement":null},{"id":"W2325466454","doi":"10.1109/tcomm.2016.2520458","title":"Optimal Power Allocation for Maximum Throughput of General MU-MIMO Multiple Access Channels With Mixed Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Toronto Metropolitan University","funders":"","keywords":"Throughput; MIMO; Computer science; Power (physics); Electronic engineering; Computer network; Max-min fairness; Channel (broadcasting); Mathematical optimization; Engineering; Resource allocation; Telecommunications; Mathematics; Wireless; Physics","score_opus":0.031902309385347306,"score_gpt":0.2768430419197617,"score_spread":0.24494073253441442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325466454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00560474,0.000059179587,0.9915359,0.00035981854,0.00038654447,0.00088013115,0.0002910241,0.00027334178,0.0006093081],"genre_scores_gemma":[0.90489787,0.00018575299,0.09400746,0.0000153672,0.000018367835,0.00061346206,0.000029126591,0.000062819076,0.0001697589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998977,0.000064358246,0.00040284632,0.00020333167,0.000119814686,0.00023263552],"domain_scores_gemma":[0.9979504,0.00042955446,0.000112972666,0.0011655078,0.00027173702,0.00006986059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013525238,0.00020448299,0.00023305234,0.00016863101,0.00020817285,0.000028748622,0.0005873596,0.00010957283,0.000043853477],"category_scores_gemma":[0.000015362766,0.00017100888,0.000087313885,0.000271562,0.0002501012,0.0005315864,0.0000049589585,0.00012307848,0.000011688199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055019762,0.00018117674,0.000018722232,0.000042858137,0.00015114436,1.6339554e-7,0.0003414207,0.96746516,0.020340044,0.00045992216,0.00012703595,0.010817343],"study_design_scores_gemma":[0.006100247,0.00045704882,0.00020755419,0.0006520855,0.0002227553,0.000034997647,0.00058458163,0.579717,0.40744412,0.00048006247,0.002989878,0.0011096918],"about_ca_topic_score_codex":0.000020130732,"about_ca_topic_score_gemma":0.00017157472,"teacher_disagreement_score":0.8992931,"about_ca_system_score_codex":0.00012261608,"about_ca_system_score_gemma":0.000046421752,"threshold_uncertainty_score":0.69735396},"labels":[],"label_agreement":null},{"id":"W2325575128","doi":"10.1109/tcomm.2016.2538769","title":"Effect of Antenna Configuration on MIMO-Based Access Points in a Short Tunnel With Infrastructure","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"MIMO; Multipath propagation; Decorrelation; Antenna (radio); Engineering; Electronic engineering; 3G MIMO; Channel (broadcasting); Computer science; Telecommunications","score_opus":0.015364707965673468,"score_gpt":0.261540475856653,"score_spread":0.24617576789097956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325575128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10391427,0.00003475379,0.894642,0.00057670043,0.00005620627,0.00023930057,0.000040734973,0.000102829006,0.0003932001],"genre_scores_gemma":[0.99926627,0.00015138046,0.00039080405,0.000053260406,0.0000061879614,0.00007009388,0.000006361121,0.000023831919,0.000031837193],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992291,0.00013530935,0.00025807705,0.00011487566,0.00013712239,0.00012553929],"domain_scores_gemma":[0.998538,0.00049227016,0.000029444198,0.0008266009,0.000066968285,0.00004671394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015022108,0.00015559042,0.00022574014,0.00035274634,0.00006466938,0.000019963656,0.00046372743,0.00007414988,0.000066310204],"category_scores_gemma":[0.000008156339,0.00010246243,0.00008520848,0.00047106712,0.00009282001,0.00019178125,0.0000011736868,0.00020188968,0.00001501691],"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.0017448068,0.0010259389,0.003696498,0.00028246915,0.00084400724,0.000016974329,0.0008412413,0.16454984,0.6995074,0.0003386189,0.0003697037,0.12678249],"study_design_scores_gemma":[0.005760998,0.0021130058,0.01505167,0.0020983433,0.00055642106,0.000011796295,0.00014399039,0.5983416,0.37425673,0.00012117904,0.0005508935,0.0009933717],"about_ca_topic_score_codex":0.000020720918,"about_ca_topic_score_gemma":0.0002824559,"teacher_disagreement_score":0.89535195,"about_ca_system_score_codex":0.00008682068,"about_ca_system_score_gemma":0.000025950661,"threshold_uncertainty_score":0.41782966},"labels":[],"label_agreement":null},{"id":"W2338352961","doi":"10.1109/tcomm.2016.2592519","title":"Bandlimited Optical Intensity Modulation Under Average and Peak Power Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bandlimiting; Clipping (morphology); Amplitude; Bandwidth (computing); Intensity modulation; Mathematics; Pulse-amplitude modulation; Spectral density; Amplitude modulation; Optical communication; Optics; Physics; Phase modulation; Frequency modulation; Computer science; Mathematical analysis; Fourier transform; Telecommunications; Statistics; Pulse (music); Detector","score_opus":0.025035927424638366,"score_gpt":0.23926420542901952,"score_spread":0.21422827800438116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338352961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07017056,0.00016375764,0.91604626,0.006169679,0.0001555677,0.00023823518,0.000048392525,0.0012996693,0.0057078567],"genre_scores_gemma":[0.9907298,0.0018189928,0.007179187,0.00008156661,0.0000037563045,0.00006413536,0.0000046082564,0.000031454576,0.00008651381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991391,0.00005582282,0.00029241864,0.00017530024,0.0001288122,0.0002086031],"domain_scores_gemma":[0.99730194,0.0006085913,0.000030459372,0.0018493808,0.000114918985,0.00009471042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118190525,0.00017678016,0.00018393759,0.00018386163,0.00027853713,0.000041977524,0.00056626654,0.0001743231,0.00012019299],"category_scores_gemma":[0.000027983775,0.00015006978,0.00006282641,0.00023656328,0.00081836525,0.00022887453,0.000017160008,0.00039734016,0.00011167137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008756106,0.0009829559,0.00017094339,0.00004111815,0.0005518057,0.0000028921481,0.0007007146,0.027370248,0.18409172,0.10794333,0.0005238207,0.6775329],"study_design_scores_gemma":[0.008573466,0.00080679695,0.094561666,0.0012427868,0.00034903042,0.00029082544,0.002670134,0.5913123,0.23960447,0.043425832,0.012640331,0.0045223692],"about_ca_topic_score_codex":0.0000037180507,"about_ca_topic_score_gemma":0.00003168836,"teacher_disagreement_score":0.9205592,"about_ca_system_score_codex":0.000121308505,"about_ca_system_score_gemma":0.000015273316,"threshold_uncertainty_score":0.6119668},"labels":[],"label_agreement":null},{"id":"W2344765023","doi":"10.1109/tcomm.2016.2519513","title":"Spectral-Efficiency Analysis of Massive MIMO Systems in Centralized and Distributed Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":94,"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":"MIMO; Computer science; Spectral efficiency; Electronic engineering; Telecommunications; Computer network; Distributed computing; Engineering; Beamforming","score_opus":0.01607228095544152,"score_gpt":0.25155018990841926,"score_spread":0.23547790895297774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344765023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017716996,0.000573498,0.9805,0.00015078136,0.00009531737,0.0002674515,0.00035885177,0.0001259831,0.00021116296],"genre_scores_gemma":[0.99568474,0.0016500974,0.0024955934,0.000001783226,0.0000027876026,0.00008524954,0.000021134412,0.000016127256,0.00004246918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916124,0.00007692193,0.00039048423,0.00013100736,0.00008262638,0.0001576973],"domain_scores_gemma":[0.99874103,0.0002586783,0.00006886507,0.000816928,0.00006436551,0.000050139904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008764766,0.000118585005,0.00026734878,0.00044477795,0.00007649936,0.000012892878,0.00024449034,0.00006625497,0.000019165976],"category_scores_gemma":[0.00000972681,0.00010345746,0.00007050242,0.001172153,0.00010080463,0.00015480393,0.0000021726132,0.000104768544,0.0000037570603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007740663,0.00010855956,0.0002522089,0.000024517723,0.0002607649,3.0796994e-7,0.00020302543,0.98577386,0.011289738,0.0009325068,0.000009626684,0.0011371706],"study_design_scores_gemma":[0.0010288573,0.000032872056,0.0016264908,0.0002238744,0.00041614907,0.000002202878,0.00040255886,0.98558784,0.009873294,0.00005379543,0.00046300452,0.0002890794],"about_ca_topic_score_codex":0.00006758985,"about_ca_topic_score_gemma":0.00024104865,"teacher_disagreement_score":0.97800434,"about_ca_system_score_codex":0.00014097737,"about_ca_system_score_gemma":0.000013454934,"threshold_uncertainty_score":0.42188725},"labels":[],"label_agreement":null},{"id":"W2409452000","doi":"10.1109/tcomm.2017.2737018","title":"Continuous Transmission of Spatially Coupled LDPC Code Chains","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Dalhousie University","funders":"Agencia Estatal de Investigación; Natural Sciences and Engineering Research Council of Canada; Instituto de Investigación Sanitaria Gregorio Marañón; National Science Foundation; Ministerio de Economía y Competitividad; Universidad Carlos III de Madrid","keywords":"Low-density parity-check code; Decoding methods; Transmission (telecommunications); Computer science; Encoding (memory); Code (set theory); Chain (unit); Concatenated error correction code; Algorithm; Theoretical computer science; Parallel computing; Telecommunications; Block code; Physics","score_opus":0.04624845525456713,"score_gpt":0.3185063007431408,"score_spread":0.2722578454885737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409452000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002815345,0.00007366578,0.9872364,0.004312067,0.000311455,0.00036238128,0.000020570074,0.0005547055,0.004313426],"genre_scores_gemma":[0.8742169,0.00040658578,0.124644175,0.000077270124,0.000008698368,0.00008103721,0.000001987823,0.000019777191,0.0005435359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861014,0.00015400018,0.0004287868,0.00030300164,0.00027915137,0.00022494486],"domain_scores_gemma":[0.9927225,0.00034970097,0.0003657934,0.006204491,0.00025482153,0.00010271169],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042438818,0.00018266383,0.0002801525,0.00019241593,0.001393652,0.00014826884,0.0052099526,0.00011907341,0.000021532187],"category_scores_gemma":[0.000031339725,0.00018974743,0.00017503763,0.00018651967,0.00030372854,0.00046315577,0.000029126448,0.00045060564,0.000020671261],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010255855,0.0035028677,0.00027308578,0.00009382208,0.00025350356,0.000010032732,0.00774564,0.003992157,0.13140965,0.035459485,0.00055869546,0.8165985],"study_design_scores_gemma":[0.001164408,0.0005176227,0.0013107947,0.00040468216,0.000086016444,0.00003072804,0.00006687016,0.76576626,0.22019596,0.0028106915,0.0070023574,0.00064361864],"about_ca_topic_score_codex":0.00053330726,"about_ca_topic_score_gemma":0.0008535013,"teacher_disagreement_score":0.8714016,"about_ca_system_score_codex":0.000058726113,"about_ca_system_score_gemma":0.00013483503,"threshold_uncertainty_score":0.9999064},"labels":[],"label_agreement":null},{"id":"W2429501648","doi":"10.1109/tcomm.2008.060585","title":"A blind carrier frequency offset estimation scheme for OFDM systems with constant modulus signaling","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Carrier frequency offset; Frequency offset; Identifiability; Frequency domain; Control theory (sociology); Mathematics; MIMO; Frequency-division multiplexing; Electronic engineering; Algorithm; Channel (broadcasting); Computer science; Telecommunications; Engineering; Statistics","score_opus":0.04470431198106362,"score_gpt":0.2741929415919258,"score_spread":0.2294886296108622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429501648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005025263,0.00069902244,0.9901419,0.00024251066,0.00012739297,0.0011038699,0.00033335004,0.0011830211,0.0011436193],"genre_scores_gemma":[0.7827584,0.00085192005,0.21459939,0.000022514863,0.000009577526,0.0015467977,0.00006183461,0.00006598145,0.000083558596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877644,0.00008309147,0.0004817634,0.00020333333,0.00020312832,0.00025224112],"domain_scores_gemma":[0.9969027,0.00036144268,0.00010939599,0.002240788,0.00028299354,0.00010270358],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014783589,0.000249256,0.00027330287,0.0002594821,0.00084644975,0.000039716186,0.00076325634,0.00013338478,0.0000134400225],"category_scores_gemma":[0.000013312099,0.0002605836,0.000090797046,0.00045927626,0.00028843252,0.00037424947,0.0000043956106,0.0004593049,0.000012664399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007125192,0.000323187,0.000026877608,0.00012975313,0.00024030323,0.0000016930093,0.00102239,0.97125417,0.01608055,0.0060822726,0.00039081715,0.0043767407],"study_design_scores_gemma":[0.0008492059,0.00013116753,0.000010497503,0.00028142054,0.00006330362,0.000064030704,0.00022867533,0.97006387,0.02587888,0.0005717575,0.0013942324,0.00046294293],"about_ca_topic_score_codex":0.00006533929,"about_ca_topic_score_gemma":0.00012413699,"teacher_disagreement_score":0.77773315,"about_ca_system_score_codex":0.00023350939,"about_ca_system_score_gemma":0.0000923358,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W2440761015","doi":"10.1109/tcomm.2016.2581163","title":"A Class of Binary Locally Repairable Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","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":"Erasure code; Binary number; Locality; Binary code; Block code; Erasure; Code (set theory); Computer science; Mathematics; Discrete mathematics; Algorithm; Arithmetic; Decoding methods","score_opus":0.03640963298082039,"score_gpt":0.28290905033410435,"score_spread":0.24649941735328396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2440761015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072842906,0.00014579527,0.99065036,0.0061340975,0.000107605505,0.00015084363,0.00007642073,0.00078509154,0.0012213506],"genre_scores_gemma":[0.76454127,0.0007146717,0.2341969,0.00006756049,0.0000020536881,0.00007464734,0.0000011840277,0.00000879317,0.00039289857],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990165,0.00009441523,0.00029280825,0.0002487554,0.00016631112,0.00018115898],"domain_scores_gemma":[0.9941911,0.0006031689,0.00011900175,0.0049118632,0.00013065914,0.000044191274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001667963,0.00011769044,0.00015919529,0.00021947922,0.00026348353,0.000018347337,0.0030217539,0.0000805501,0.000017444105],"category_scores_gemma":[0.00002999709,0.00009154108,0.000081411556,0.00059492944,0.00045232853,0.00064997305,0.000041082756,0.00018929405,0.000082422484],"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.000046267556,0.0017145035,0.000033892393,0.000031982192,0.00015580571,0.000007374006,0.00046823276,0.0030304433,0.16522717,0.2741734,0.0028075504,0.5523034],"study_design_scores_gemma":[0.0031883642,0.0018503033,0.0005804022,0.0009871497,0.00011684615,0.000107626605,0.00047275986,0.089264534,0.67917204,0.10343829,0.11914787,0.0016738],"about_ca_topic_score_codex":0.000025758172,"about_ca_topic_score_gemma":0.000089142886,"teacher_disagreement_score":0.76381284,"about_ca_system_score_codex":0.00008445817,"about_ca_system_score_gemma":0.00008107953,"threshold_uncertainty_score":0.56152207},"labels":[],"label_agreement":null},{"id":"W2461905345","doi":"10.1109/tcomm.2016.2587284","title":"In-band full duplex broadband power line communications","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":65,"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; Power-line communication; Digital subscriber line; Electronic engineering; Broadband; Wireless; MIMO; Channel (broadcasting); Data transmission; Ethernet; Power (physics); Communications system; Computer network; Telecommunications; Engineering","score_opus":0.02932094541761794,"score_gpt":0.27170775729637187,"score_spread":0.24238681187875394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461905345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06649508,0.010391923,0.7831106,0.053236715,0.001773792,0.0019886112,0.0010604387,0.0024796815,0.07946316],"genre_scores_gemma":[0.97956455,0.013650113,0.004954054,0.00019306716,0.000016856071,0.00038201848,0.000016606506,0.00007245491,0.0011502991],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837005,0.00020436001,0.0006417345,0.00023315317,0.00017476443,0.00037591896],"domain_scores_gemma":[0.9915138,0.0008986187,0.000067636436,0.0072350954,0.00012654316,0.00015831467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028832813,0.0002899622,0.0002863638,0.00046783686,0.00046290524,0.00005035153,0.0026563911,0.00016401446,0.0004204392],"category_scores_gemma":[0.000019073295,0.0002562364,0.00015626641,0.0007607175,0.0004023954,0.00045043833,0.000025231977,0.00062303466,0.0005068191],"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.0005060997,0.0138027035,0.00059392414,0.00019839255,0.0015874049,0.0000199974,0.008720893,0.0734551,0.54842407,0.034089193,0.03938372,0.2792185],"study_design_scores_gemma":[0.007383527,0.00066975725,0.0019989868,0.0010006482,0.000252463,0.0001100041,0.00055148086,0.08431717,0.05734714,0.003449958,0.8400737,0.0028451511],"about_ca_topic_score_codex":0.00005307473,"about_ca_topic_score_gemma":0.0015204824,"teacher_disagreement_score":0.9130694,"about_ca_system_score_codex":0.00022538421,"about_ca_system_score_gemma":0.00006075468,"threshold_uncertainty_score":0.999989},"labels":[],"label_agreement":null},{"id":"W2463130876","doi":"10.1109/tcomm.2016.2590436","title":"Accurate Range-Free Localization in Multi-Hop Wireless Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Université du Québec en Abitibi-Témiscamingue; Université du Québec à Montréal; Institut National de la Recherche Scientifique; University of Toronto","funders":"","keywords":"Wireless sensor network; Computer science; Hop (telecommunications); Range (aeronautics); Wireless; Computer network; Real-time computing; Algorithm; Telecommunications; Engineering","score_opus":0.031939828820753864,"score_gpt":0.2588538454936258,"score_spread":0.22691401667287192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463130876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015719796,0.00017464523,0.99500936,0.0009625538,0.00030613487,0.0002791901,0.000058386137,0.001079282,0.0005584619],"genre_scores_gemma":[0.99307257,0.0035366141,0.0027374753,0.000085655665,0.000011247653,0.0002689358,0.000008200261,0.000050646904,0.00022867566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898314,0.00008967719,0.00036824058,0.0001730528,0.000115307244,0.00027055893],"domain_scores_gemma":[0.99781436,0.0002586151,0.000041287218,0.0017489119,0.00008586211,0.000050994342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012455061,0.00018979909,0.00018123485,0.00030599555,0.00023001409,0.000031843087,0.0008372157,0.0002105874,0.00007025458],"category_scores_gemma":[0.000019650714,0.00016387839,0.00007269211,0.0006664834,0.00016896738,0.00023397611,0.000008243734,0.00029747322,0.00007568267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018292687,0.00020684276,0.00017550791,0.000018968474,0.000046227487,0.0000019587878,0.0002713864,0.9459207,0.0010116346,0.0006475003,0.0008751367,0.05080584],"study_design_scores_gemma":[0.001458655,0.0000225569,0.00024301543,0.0001321031,0.000021959777,0.0000041343887,0.0001872577,0.9844232,0.009800324,0.00013990288,0.0032494357,0.0003174574],"about_ca_topic_score_codex":0.000035687597,"about_ca_topic_score_gemma":0.0010631245,"teacher_disagreement_score":0.9922719,"about_ca_system_score_codex":0.00016861969,"about_ca_system_score_gemma":0.000016895241,"threshold_uncertainty_score":0.66827667},"labels":[],"label_agreement":null},{"id":"W2468432040","doi":"10.1109/tcomm.2016.2582873","title":"Source-Interference Recovery Over Broadcast Channels: Asymptotic Bounds and Analog Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Upper and lower bounds; Encoder; Algorithm; Gaussian; Mathematics; Fading; Decoding methods; Dirty paper coding; Distortion (music); Computer science; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Precoding; MIMO; Statistics; Bandwidth (computing); Combinatorics","score_opus":0.024505061057995353,"score_gpt":0.2561437748499788,"score_spread":0.23163871379198345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468432040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018281952,0.0011247661,0.97420865,0.0011897169,0.000206584,0.00025539327,0.00010679909,0.0012785511,0.0033475978],"genre_scores_gemma":[0.980201,0.015315598,0.0036384838,0.00008653035,0.000015811203,0.00019696538,0.0000072125977,0.00005398361,0.00048442447],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891526,0.0001513056,0.0003497504,0.00020555094,0.00013503162,0.00024312457],"domain_scores_gemma":[0.996756,0.0006691749,0.000055891964,0.0023254543,0.000082130275,0.00011135424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018534079,0.00022445868,0.00022578913,0.00028743633,0.00038218527,0.000103929146,0.00095744734,0.00014032866,0.0001225999],"category_scores_gemma":[0.000012787545,0.0002051177,0.00009203101,0.00028406893,0.00033243542,0.00037676896,0.000019315534,0.00038818436,0.00007136853],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007413093,0.00080914865,0.00019426674,0.00011832601,0.0005912003,0.0000012140569,0.0031219048,0.007314535,0.03853502,0.005625059,0.0035855607,0.9400296],"study_design_scores_gemma":[0.005821356,0.0015939364,0.0032465702,0.006398134,0.00073238544,0.00028185593,0.0013821401,0.3321184,0.24011548,0.0282246,0.37382528,0.0062598777],"about_ca_topic_score_codex":0.000070948074,"about_ca_topic_score_gemma":0.0003047384,"teacher_disagreement_score":0.97057015,"about_ca_system_score_codex":0.00015287576,"about_ca_system_score_gemma":0.000024364806,"threshold_uncertainty_score":0.8364457},"labels":[],"label_agreement":null},{"id":"W2476647282","doi":"10.1109/tcomm.2005.852828","title":"Pulse Position Amplitude Modulation for Time-Hopping Multiple-Access UWB Communications","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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 Victoria","funders":"","keywords":"Pulse-position modulation; Pulse-amplitude modulation; Time-hopping; Modulation (music); Computer science; Amplitude modulation; Ultra-wideband; Electronic engineering; Position (finance); Pulse (music); Amplitude; Communications system; Pulse-width modulation; Telecommunications; Frequency modulation; Physics; Engineering; Optics; Bandwidth (computing); Acoustics; Power (physics); Detector","score_opus":0.03631279053491899,"score_gpt":0.2925206503429353,"score_spread":0.2562078598080163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476647282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005241537,0.0006686212,0.9746422,0.010066879,0.000175396,0.0014381097,0.00032425317,0.0022151407,0.0052278545],"genre_scores_gemma":[0.91491705,0.0018791201,0.080030434,0.00023823511,0.000036976624,0.0021699916,0.00036848796,0.000103254475,0.00025642494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981173,0.00017274285,0.00074534625,0.00030875346,0.00018705282,0.00046875325],"domain_scores_gemma":[0.9916353,0.0012633764,0.00013076146,0.0065729953,0.00027515867,0.00012238651],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00032070046,0.00034295488,0.00032346236,0.0005668795,0.0015419683,0.0001714061,0.0036842623,0.0002875834,0.00009572621],"category_scores_gemma":[0.000035626857,0.000423479,0.00023486359,0.00078606815,0.0003259806,0.0008592177,0.00004543544,0.0007565124,0.00029437436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007823174,0.0020976814,0.0000801919,0.000087330205,0.0005855739,2.4711255e-7,0.0011430685,0.5111288,0.094024666,0.007760784,0.0024268066,0.38058665],"study_design_scores_gemma":[0.0009690526,0.000065851935,0.00037000576,0.000088269655,0.00013660041,0.00001732529,0.000094554016,0.93898463,0.014175267,0.0011790144,0.04334982,0.00056959805],"about_ca_topic_score_codex":0.00005661011,"about_ca_topic_score_gemma":0.0009770626,"teacher_disagreement_score":0.90967554,"about_ca_system_score_codex":0.00045246122,"about_ca_system_score_gemma":0.000051690015,"threshold_uncertainty_score":0.9998217},"labels":[],"label_agreement":null},{"id":"W2480531776","doi":"10.1109/tcomm.2005.861658","title":"Reduced-dimension MAP turbo-BLAST detection","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Detector; Maximum a posteriori estimation; Single antenna interference cancellation; Minimum mean square error; Rayleigh fading; Transmitter; Bit error rate; Computer science; Turbo; Turbo code; Electronic engineering; Interference (communication); Fading; Algorithm; Decoding methods; Telecommunications; Mathematics; Engineering; Statistics; Channel (broadcasting); Estimator","score_opus":0.01361716291401347,"score_gpt":0.24148859328577651,"score_spread":0.22787143037176305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480531776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008174264,0.00058697176,0.97845846,0.00061271706,0.00038885346,0.00042074992,0.000038004007,0.003238448,0.00808155],"genre_scores_gemma":[0.97579366,0.0007920286,0.022462713,0.00003861997,0.000028947292,0.0003563327,0.000028773093,0.00007569636,0.000423201],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988987,0.000102065664,0.00040484153,0.00018797498,0.00016834079,0.00023807389],"domain_scores_gemma":[0.99688447,0.00019989278,0.000062963605,0.002686431,0.000103581,0.0000626637],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010893226,0.00022615539,0.00017571321,0.00028712623,0.0005581808,0.000042243508,0.00079046475,0.00014711471,0.00004758004],"category_scores_gemma":[0.0000026868904,0.00026639094,0.00011425268,0.00045502518,0.00015104904,0.00028888707,0.00000753344,0.00063175894,0.00021125437],"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.000028474491,0.0006855576,0.000005309844,0.000051914838,0.00008511281,0.0000011174938,0.00024112541,0.3367082,0.47454247,0.0017120678,0.0022754024,0.18366328],"study_design_scores_gemma":[0.00032518143,0.000057988284,0.00014363122,0.000081468395,0.000040357438,0.000014272914,0.000073681425,0.0828336,0.8873946,0.0024258725,0.026149932,0.00045939445],"about_ca_topic_score_codex":0.000087297565,"about_ca_topic_score_gemma":0.0005002634,"teacher_disagreement_score":0.9676194,"about_ca_system_score_codex":0.00024321886,"about_ca_system_score_gemma":0.000015848404,"threshold_uncertainty_score":0.99997884},"labels":[],"label_agreement":null},{"id":"W2483668669","doi":"10.1109/tcomm.2010.03.080011","title":"Dynamics of analog decoders for different message representation domains","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Ottawa","funders":"","keywords":"Representation (politics); Computer science; Decoding methods; Message passing; Theoretical computer science; Electronic engineering; Domain (mathematical analysis); Algorithm; Parallel computing; Mathematics; Engineering","score_opus":0.03419981396875891,"score_gpt":0.3279826731685508,"score_spread":0.29378285919979186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483668669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012601902,0.000008924611,0.9814496,0.003563097,0.00039317165,0.00043271988,0.00004199783,0.000375823,0.0011327569],"genre_scores_gemma":[0.800829,0.00004707494,0.19872111,0.00004580757,0.000005637997,0.00022347293,0.0000115918565,0.000013462674,0.0001028671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989901,0.000100133555,0.0003348422,0.00024962876,0.00016308343,0.00016217098],"domain_scores_gemma":[0.9956698,0.0009323625,0.00016897978,0.0029788928,0.00018962244,0.000060359132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023588435,0.00012951455,0.0001720566,0.00024728547,0.0003749332,0.00004807829,0.0018889093,0.00009506717,0.00001016231],"category_scores_gemma":[0.000033508597,0.00013314797,0.00016330511,0.00040843838,0.00016405083,0.00025573853,0.000015688822,0.00040470975,0.000003730198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000963062,0.0032406445,0.001099011,0.00010885432,0.00038099103,0.0000013431003,0.005498576,0.0038276478,0.13052908,0.5127871,0.0012440936,0.34118637],"study_design_scores_gemma":[0.00061267335,0.00023149907,0.00093166425,0.000047109923,0.00007708982,0.0000137287325,0.00020510823,0.8068099,0.15436848,0.035901725,0.0004365868,0.000364405],"about_ca_topic_score_codex":0.00013657247,"about_ca_topic_score_gemma":0.0072554233,"teacher_disagreement_score":0.8029823,"about_ca_system_score_codex":0.00006902052,"about_ca_system_score_gemma":0.00006159576,"threshold_uncertainty_score":0.54296166},"labels":[],"label_agreement":null},{"id":"W2493697552","doi":"10.1109/tcomm.2005.860092","title":"Multiple-Symbol Differential Sphere Decoding","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Fading; Decoding methods; Rayleigh fading; Algorithm; Channel state information; Symbol (formal); Computational complexity theory; Mathematics; Computer science; Rayleigh scattering; Channel (broadcasting); Differential (mechanical device); Telecommunications; Theoretical computer science; Wireless; Engineering; Optics; Physics","score_opus":0.026107716833235046,"score_gpt":0.2690791408217206,"score_spread":0.24297142398848554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493697552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008606077,0.00035245577,0.9815103,0.00062645215,0.00015087322,0.00030352123,0.000046469184,0.0021832436,0.006220633],"genre_scores_gemma":[0.9239499,0.0025569329,0.072741054,0.00006363359,0.000031371932,0.000331525,0.000017255283,0.00006753385,0.00024080588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990034,0.000076416894,0.00037307714,0.00015851512,0.00014319668,0.00024535853],"domain_scores_gemma":[0.99680203,0.00037147081,0.00004672083,0.0026173817,0.0000645677,0.00009780592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006333068,0.00021598375,0.0001863754,0.00016258477,0.00047787259,0.000045523702,0.001216301,0.00011813036,0.00026377433],"category_scores_gemma":[0.000006517794,0.00025088497,0.00012440133,0.00028691677,0.00012368696,0.00032397424,0.0000094398065,0.00064038223,0.00022224325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017732049,0.0006157912,0.00003676868,0.000029450966,0.00014468224,4.108148e-7,0.00083599525,0.24159071,0.03551111,0.0014314724,0.0009926647,0.7187932],"study_design_scores_gemma":[0.00068070245,0.000036139452,0.00014664634,0.00010092747,0.000053475454,0.000010315834,0.00022698051,0.7625347,0.19110219,0.00032309082,0.044175576,0.00060930423],"about_ca_topic_score_codex":0.000011898434,"about_ca_topic_score_gemma":0.0005122891,"teacher_disagreement_score":0.9153438,"about_ca_system_score_codex":0.00019753624,"about_ca_system_score_gemma":0.000016593676,"threshold_uncertainty_score":0.99999434},"labels":[],"label_agreement":null},{"id":"W2496222037","doi":"10.1109/tcomm.2016.2594759","title":"Energy-Efficient Resource Allocation for Downlink Non-Orthogonal Multiple Access Network","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":492,"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":"Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Telecommunications link; Computer science; Mathematical optimization; Efficient energy use; Resource allocation; Single antenna interference cancellation; Convex optimization; Spectral efficiency; Optimization problem; Maximization; Base station; Noma; Multiplexing; Channel (broadcasting); Algorithm; Mathematics; Regular polygon; Computer network; Engineering; Telecommunications","score_opus":0.031359220935228714,"score_gpt":0.2715286323733495,"score_spread":0.2401694114381208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496222037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009977875,0.00035715188,0.99251306,0.0027372902,0.00017438624,0.00045093003,0.00014652112,0.0013431075,0.001279789],"genre_scores_gemma":[0.9721965,0.001653197,0.024007158,0.000112479545,0.000036133137,0.0016351802,0.000057986756,0.00007158572,0.00022977153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987088,0.00007171725,0.000448596,0.00025096512,0.00016090837,0.00035900157],"domain_scores_gemma":[0.99510837,0.00146356,0.000099381745,0.0031145068,0.00013319682,0.00008096893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018292967,0.00024130747,0.00021310455,0.000214514,0.00068982143,0.00005065662,0.002059828,0.00018021923,0.000023425382],"category_scores_gemma":[0.00002122323,0.00021748593,0.0001459975,0.00046521937,0.00024725928,0.00023969327,0.00002753646,0.00028988547,0.000028822014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022634973,0.00015522588,0.000009336218,0.000013727907,0.000063222185,7.5312066e-8,0.000048670536,0.8147457,0.0033595867,0.0032375362,0.0016194476,0.17672479],"study_design_scores_gemma":[0.0012137049,0.00006883011,0.00015015136,0.00020341246,0.000047774254,0.0000042667075,0.000101685684,0.73489004,0.05996241,0.0022810453,0.20047936,0.0005973451],"about_ca_topic_score_codex":0.000007997582,"about_ca_topic_score_gemma":0.00015989559,"teacher_disagreement_score":0.97119874,"about_ca_system_score_codex":0.00021062134,"about_ca_system_score_gemma":0.00003581125,"threshold_uncertainty_score":0.8868819},"labels":[],"label_agreement":null},{"id":"W2510173137","doi":"10.1109/tcomm.2017.2650992","title":"Optimal Joint Power and Subcarrier Allocation for Full-Duplex Multicarrier Non-Orthogonal Multiple Access Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":593,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Subcarrier; Telecommunications link; Computer science; Resource allocation; Base station; Mathematical optimization; Benchmark (surveying); Computational complexity theory; Optimization problem; Maximization; Convex optimization; Throughput; Orthogonal frequency-division multiplexing; Algorithm; Computer network; Mathematics; Regular polygon; Wireless; Telecommunications","score_opus":0.05177138249031417,"score_gpt":0.2963507919404115,"score_spread":0.24457940945009732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510173137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40209725,0.00046107027,0.5921759,0.0013811415,0.0007575762,0.0015698003,0.00061536045,0.00043751122,0.0005043616],"genre_scores_gemma":[0.9817427,0.00082797516,0.014817459,0.000037313996,0.00003955655,0.002095877,0.00009160827,0.00011410669,0.00023344287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827427,0.00009211264,0.0006224826,0.0003621341,0.00023268268,0.0004163063],"domain_scores_gemma":[0.99351597,0.0006019556,0.00018818714,0.0051085376,0.0003464264,0.000238904],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00032804883,0.00036648233,0.00038126248,0.00024809668,0.002591322,0.00065873045,0.0022381234,0.00023302084,0.000034990124],"category_scores_gemma":[0.000077187586,0.00041264936,0.00019260378,0.0001389,0.0004884556,0.0008920326,0.000050267838,0.00061042485,0.000035393674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047233156,0.00024698974,0.000098413635,0.00008675681,0.00025999107,4.5580612e-7,0.0007615114,0.9792791,0.014951387,0.00091396214,0.00041748732,0.002936714],"study_design_scores_gemma":[0.0011318403,0.00006550947,0.0035458207,0.000104741135,0.00010808824,0.000014395553,0.00026203695,0.986651,0.0032390638,0.000007232886,0.00441874,0.00045151505],"about_ca_topic_score_codex":0.0001826909,"about_ca_topic_score_gemma":0.0007041564,"teacher_disagreement_score":0.5796454,"about_ca_system_score_codex":0.00016131657,"about_ca_system_score_gemma":0.00007774698,"threshold_uncertainty_score":0.9998325},"labels":[],"label_agreement":null},{"id":"W2510935666","doi":"10.1109/tcomm.2016.2603981","title":"Decoding Delay and Outage Performance Analysis of Full-Duplex Decode-Forward Relaying: Backward or Sliding Window Decoding","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","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":"Decoding methods; Sliding window protocol; Computer science; Sequential decoding; Relay; Fading; List decoding; Channel state information; Algorithm; Context (archaeology); Channel (broadcasting); Real-time computing; Telecommunications; Computer network; Electronic engineering; Block code; Wireless; Engineering; Window (computing); Concatenated error correction code","score_opus":0.04001104619709668,"score_gpt":0.26583161348524575,"score_spread":0.2258205672881491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510935666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6156152,0.00032215205,0.38228166,0.00049123506,0.00013225278,0.0002594113,0.00014573392,0.00036477364,0.00038756191],"genre_scores_gemma":[0.958985,0.010207278,0.030228395,0.000031774565,0.000012038154,0.00019546477,0.000019437508,0.000082607716,0.00023804749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997824,0.00016997197,0.0009286707,0.000349665,0.00027682635,0.00045083],"domain_scores_gemma":[0.9943042,0.0019931938,0.00019586286,0.003118654,0.0001851616,0.00020293501],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046320952,0.0003719165,0.00059824134,0.0011238306,0.0008485537,0.00007109421,0.0013862768,0.00020097138,0.00020905439],"category_scores_gemma":[0.000056950772,0.00031863144,0.00028879227,0.0018396898,0.00026152233,0.0006237032,0.000037822116,0.0005128333,0.00004684008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009693162,0.0002535826,0.0021344144,0.00010595427,0.002269637,0.0000015844957,0.0018819498,0.85080254,0.064859144,0.0006891151,0.00007143597,0.07683374],"study_design_scores_gemma":[0.00076530327,0.00008957791,0.0023734146,0.0002986286,0.0010811209,0.00002598764,0.00040531333,0.981913,0.0115483375,0.0000057154652,0.0009683537,0.0005252821],"about_ca_topic_score_codex":0.000042690193,"about_ca_topic_score_gemma":0.0014400388,"teacher_disagreement_score":0.35205328,"about_ca_system_score_codex":0.00028685032,"about_ca_system_score_gemma":0.00006461766,"threshold_uncertainty_score":0.99992657},"labels":[],"label_agreement":null},{"id":"W2512920678","doi":"10.1109/tcomm.2016.2602341","title":"Ambient Backscatter Communication Systems: Detection and Performance Analysis","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":445,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Backscatter (email); Electronic engineering; Computer science; Remote sensing; Telecommunications; Electrical engineering; Engineering; Wireless; Geology","score_opus":0.014493826952490855,"score_gpt":0.21314515182205118,"score_spread":0.19865132486956033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512920678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1868897,0.00057406555,0.8097198,0.00033406133,0.00022890943,0.00017447684,0.00002345207,0.0005708107,0.0014847509],"genre_scores_gemma":[0.99257034,0.0053763194,0.001406365,0.000023140168,0.000013450083,0.0002358911,0.0000056688154,0.000032948486,0.00033584912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991063,0.0001369692,0.00029871074,0.00015764587,0.00012024902,0.00018015223],"domain_scores_gemma":[0.9975512,0.0003907165,0.00005260286,0.0018565115,0.000073270734,0.000075673495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018523677,0.00015521026,0.00017326855,0.00030010287,0.00041712855,0.000056483306,0.00045103286,0.000102340615,0.000021760106],"category_scores_gemma":[0.000003205198,0.00013490362,0.00007274907,0.0006358669,0.00016254341,0.00026458208,0.00000610459,0.00025025566,0.000046827066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001422137,0.000115583374,0.0006751445,0.0000379992,0.0007229999,1.8542336e-7,0.0002684755,0.88174915,0.00668369,0.00027577503,0.00009762929,0.109359145],"study_design_scores_gemma":[0.000400306,0.000058574227,0.008577131,0.00022825228,0.00045781088,0.000011202052,0.00006662315,0.97761405,0.00867924,0.000025032661,0.0034928345,0.0003889355],"about_ca_topic_score_codex":0.000053298012,"about_ca_topic_score_gemma":0.00047868342,"teacher_disagreement_score":0.8083134,"about_ca_system_score_codex":0.00013841194,"about_ca_system_score_gemma":0.0000070718197,"threshold_uncertainty_score":0.550121},"labels":[],"label_agreement":null},{"id":"W2516258115","doi":"10.1109/tcomm.2016.2602863","title":"QoS-Aware Throughput Maximization in Wireless Powered Underground Sensor Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Quality of service; Computer science; Throughput; Optimization problem; Reliability (semiconductor); Wireless; Computer network; Wireless sensor network; Resource allocation; Convex optimization; Maximization; Distributed computing; Real-time computing; Mathematical optimization; Telecommunications","score_opus":0.021964110672200974,"score_gpt":0.23410363464526046,"score_spread":0.2121395239730595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516258115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007344739,0.00017978865,0.98700815,0.00082010095,0.0008449801,0.00022662424,0.000028918785,0.0007836092,0.0027630716],"genre_scores_gemma":[0.99160075,0.004073947,0.0034339183,0.00006916732,0.00006643332,0.00016175692,0.000020078716,0.0000970516,0.00047688594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859583,0.00017400086,0.00044465016,0.0002513259,0.00016003956,0.00037413675],"domain_scores_gemma":[0.9973175,0.0007539138,0.000060581424,0.0016992941,0.00007527191,0.00009347294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015181038,0.00025549432,0.00023243326,0.00020478739,0.00027211342,0.00005376202,0.0006751405,0.00023523564,0.00007160566],"category_scores_gemma":[0.0000066089765,0.00024014684,0.00008950416,0.00064435543,0.00016332499,0.00032729574,0.000006747897,0.00048545573,0.000056555662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001071199,0.00014001825,0.000088664194,0.000011393012,0.00005329075,0.0000021368107,0.000101267724,0.97873384,0.0008886968,0.0008558455,0.00025433427,0.018859828],"study_design_scores_gemma":[0.0012359649,0.000048242568,0.0010403853,0.0005863665,0.00004675537,0.000019667908,0.000133113,0.9914232,0.0020066416,0.00032089363,0.0024735446,0.0006652351],"about_ca_topic_score_codex":0.000061882754,"about_ca_topic_score_gemma":0.0016740874,"teacher_disagreement_score":0.984256,"about_ca_system_score_codex":0.0003355174,"about_ca_system_score_gemma":0.000029727045,"threshold_uncertainty_score":0.9792904},"labels":[],"label_agreement":null},{"id":"W2516324260","doi":"10.1109/tcomm.2016.2602342","title":"Approximation of Achievable Rates in Additive Gaussian Mixture Noise Channels","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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; National Science Foundation","keywords":"Mathematics; Entropy (arrow of time); Gaussian noise; Gaussian; Amplitude; Upper and lower bounds; Differential entropy; Piecewise; Binary entropy function; Control theory (sociology); Algorithm; Principle of maximum entropy; Mathematical analysis; Computer science; Statistics; Physics","score_opus":0.020544935675273403,"score_gpt":0.2573660085841491,"score_spread":0.2368210729088757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516324260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046274614,0.0013280081,0.9210177,0.0046624597,0.00061753014,0.0011104544,0.00085279543,0.00062044733,0.023515986],"genre_scores_gemma":[0.9919792,0.003112076,0.0042081974,0.000021636515,0.000011163121,0.00028250224,0.000024227202,0.000032377513,0.0003286475],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905163,0.0001249901,0.00039315387,0.00013096139,0.00010802572,0.00019121627],"domain_scores_gemma":[0.99756676,0.00042546028,0.000063516345,0.00179808,0.000084233805,0.00006192894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017435354,0.00016041663,0.00019929517,0.00033778904,0.000146131,0.000015409454,0.0007485097,0.00010515769,0.00011591139],"category_scores_gemma":[0.000012868921,0.00013586419,0.00008693219,0.0005421787,0.00014209982,0.000291904,0.0000067999085,0.00027838806,0.00006351803],"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.00028842688,0.006212731,0.0002906398,0.0003272777,0.0007628635,0.0000035092003,0.010810032,0.10265834,0.3891046,0.019814815,0.0054708575,0.4642559],"study_design_scores_gemma":[0.0045636515,0.00032861723,0.003789448,0.0017463758,0.000176111,0.000018499046,0.0011091388,0.17614987,0.765131,0.0050223847,0.040398885,0.0015659988],"about_ca_topic_score_codex":0.000030358147,"about_ca_topic_score_gemma":0.00023554721,"teacher_disagreement_score":0.9457046,"about_ca_system_score_codex":0.00010150319,"about_ca_system_score_gemma":0.000032761964,"threshold_uncertainty_score":0.5540381},"labels":[],"label_agreement":null},{"id":"W2520624197","doi":"10.1109/tcomm.2017.2664860","title":"Robust Resource Allocation for MIMO Wireless Powered Communication Networks Based on a Non-Linear EH Model","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":349,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Australian Research Council; Alexander von Humboldt-Stiftung","keywords":"Computer science; Robustness (evolution); Channel state information; MIMO; Resource allocation; Maximization; Wireless; Mathematical optimization; Convex optimization; Throughput; Transmitter power output; Wireless network; Computer network; Channel (broadcasting); Regular polygon; Telecommunications; Mathematics; Transmitter","score_opus":0.050879311781171846,"score_gpt":0.2678242946319973,"score_spread":0.21694498285082547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520624197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017106989,0.00009168594,0.98674816,0.0016658606,0.0002697427,0.00067847397,0.000077705066,0.00061540527,0.008142298],"genre_scores_gemma":[0.94818985,0.00054702215,0.049215846,0.00021668969,0.00005951227,0.0009720678,0.00019863114,0.00015142046,0.00044896774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983873,0.00013203354,0.0005159688,0.00033242968,0.00022625407,0.0004060527],"domain_scores_gemma":[0.9918572,0.0008900349,0.00021651211,0.0066846674,0.00020344534,0.00014817789],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00045857503,0.00035338706,0.00031384348,0.00019492196,0.0024574776,0.00020209761,0.0025225142,0.00032401393,0.000009025918],"category_scores_gemma":[0.000030295125,0.0004202149,0.0002014001,0.00019747978,0.00029405562,0.00030903195,0.000015114447,0.0008636562,0.000017113985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004852355,0.00024125428,0.0000043073733,0.000025278376,0.000056388093,1.6206879e-7,0.00012820406,0.9902512,0.0002730951,0.0006352208,0.00081720826,0.0075191855],"study_design_scores_gemma":[0.00089260226,0.00006243215,0.00006375688,0.00033909065,0.00007858577,0.0000012114735,0.00003089313,0.9949303,0.0012268388,0.00008711674,0.0018958675,0.00039126462],"about_ca_topic_score_codex":0.00006130866,"about_ca_topic_score_gemma":0.0006670435,"teacher_disagreement_score":0.94647914,"about_ca_system_score_codex":0.00022583174,"about_ca_system_score_gemma":0.00006494175,"threshold_uncertainty_score":0.99982494},"labels":[],"label_agreement":null},{"id":"W2522427612","doi":"10.1109/tcomm.2016.2611669","title":"Improved Coarse Timing Estimation in OFDM Systems Using High-Order Statistics","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Concordia University","funders":"","keywords":"Intersymbol interference; Orthogonal frequency-division multiplexing; Fading; Computer science; False alarm; Multipath propagation; Preamble; Robustness (evolution); Algorithm; Carrier frequency offset; Frequency offset; Statistics; Electronic engineering; Mathematics; Decoding methods; Estimator; Telecommunications; Artificial intelligence; Engineering","score_opus":0.037946694580337836,"score_gpt":0.29658902064746695,"score_spread":0.2586423260671291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522427612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024528303,0.00017758681,0.9954489,0.00018428692,0.0002050702,0.00043313234,0.00019901858,0.00069852895,0.00020068791],"genre_scores_gemma":[0.712637,0.0010246048,0.28596228,0.000012194092,0.00000470848,0.00022432876,0.000014409836,0.00005007171,0.00007040919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988292,0.00013770165,0.0005114224,0.00016070223,0.00012878775,0.00023222106],"domain_scores_gemma":[0.99710995,0.00056762336,0.000090912086,0.0020261866,0.0001419453,0.00006335822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016693314,0.00019669892,0.00021540227,0.00032937122,0.00024238024,0.000038781447,0.0006883721,0.00011955706,0.0000287745],"category_scores_gemma":[0.000017493609,0.00019079653,0.000035047957,0.00040302385,0.00013796937,0.0003918612,0.00000849299,0.0003368076,0.000034843277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009378855,0.00020324043,0.0000068682707,0.00004740725,0.0000495046,6.790752e-7,0.00024046635,0.82092565,0.057384554,0.0040349183,0.000062438274,0.117034905],"study_design_scores_gemma":[0.00038646153,0.00002382177,0.000023775634,0.00020406906,0.000022962393,0.0000047317917,0.000070932605,0.98309237,0.014865754,0.00065786176,0.00039468106,0.0002525587],"about_ca_topic_score_codex":0.00020870836,"about_ca_topic_score_gemma":0.00033183288,"teacher_disagreement_score":0.71018416,"about_ca_system_score_codex":0.00043200827,"about_ca_system_score_gemma":0.00004336676,"threshold_uncertainty_score":0.7780457},"labels":[],"label_agreement":null},{"id":"W2525987021","doi":"10.1109/tcomm.2016.2613520","title":"Optimal Energy Management in Hybrid Energy Small Cell Access Points","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Université du Québec à Montréal; École de Technologie Supérieure; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Telecommunications link; Decoding methods; Network packet; Mathematical optimization; Online algorithm; Real-time computing; Algorithm; Computer network; Mathematics","score_opus":0.023883692680783653,"score_gpt":0.23538518328888122,"score_spread":0.21150149060809756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525987021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052289255,0.00024355573,0.97166497,0.0004715688,0.0003786665,0.0000818115,0.000027785907,0.000506329,0.021396406],"genre_scores_gemma":[0.9802192,0.0056259967,0.011857772,0.00011580741,0.000025371139,0.00037033288,0.000010262118,0.000076434895,0.0016988338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877334,0.000117289004,0.00037629533,0.00024420966,0.00013387408,0.00035497203],"domain_scores_gemma":[0.99770683,0.00035204715,0.000045305642,0.001753995,0.00003731796,0.00010452752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107555694,0.00023262178,0.00018106868,0.00033259075,0.00017566305,0.000058600486,0.0014117702,0.00008777053,0.00007290036],"category_scores_gemma":[0.0000016189641,0.00022322859,0.000089673704,0.00039477102,0.00009745099,0.0002471617,0.000020040112,0.00023147078,0.00003201777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011691196,0.00030703633,0.000016212774,0.000018207204,0.000081927996,0.000009420499,0.00003778836,0.881346,0.0006833594,0.0034921365,0.00069706165,0.11329915],"study_design_scores_gemma":[0.0039347215,0.00012817908,0.00080710807,0.0009982742,0.00019165814,0.000039748596,0.00007995617,0.71194035,0.16183126,0.0022142003,0.11578404,0.0020504908],"about_ca_topic_score_codex":0.00017470015,"about_ca_topic_score_gemma":0.0013775538,"teacher_disagreement_score":0.97499025,"about_ca_system_score_codex":0.00020572425,"about_ca_system_score_gemma":0.000016945947,"threshold_uncertainty_score":0.9102998},"labels":[],"label_agreement":null},{"id":"W2531628009","doi":"10.1109/tcomm.2016.2617335","title":"Symmetrical Constructions for Regular Girth-8 QC-LDPC Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Huawei Technologies","keywords":"Low-density parity-check code; Mathematics; Circulant matrix; Block code; Girth (graph theory); Permutation matrix; Permutation (music); Discrete mathematics; Combinatorics; Turbo code; Raptor code; Concatenated error correction code; Linear code; Algorithm; Decoding methods","score_opus":0.04413507167374254,"score_gpt":0.30240792962932656,"score_spread":0.258272857955584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531628009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003599582,0.000081055754,0.9817548,0.013368264,0.0005845758,0.00053778366,0.000093190254,0.0014085292,0.0018118771],"genre_scores_gemma":[0.66162086,0.00023280608,0.33666304,0.00018411336,0.000020175688,0.00050300267,0.0000021852918,0.00002229985,0.00075152196],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835104,0.00020964879,0.00042002922,0.0004382636,0.0002401136,0.00034092343],"domain_scores_gemma":[0.99347806,0.0021879505,0.00013929054,0.0037190337,0.0003349555,0.00014068502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039923235,0.00021123314,0.00023406679,0.0005000614,0.0009972344,0.000105969295,0.0025915457,0.0001448441,0.000020957872],"category_scores_gemma":[0.00009101991,0.0001777818,0.0002367293,0.001009423,0.00035424996,0.00049279514,0.000024475938,0.00029567452,0.00007501847],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033360637,0.0010109514,0.00006426232,0.00002091994,0.00017914113,0.0000014081843,0.000508463,0.00012435725,0.018604795,0.34391618,0.006981559,0.62855464],"study_design_scores_gemma":[0.004432121,0.0017033285,0.000542729,0.0007973841,0.00036400097,0.0004869771,0.0003385189,0.07069015,0.4746953,0.18620218,0.25690752,0.0028397923],"about_ca_topic_score_codex":0.000041372885,"about_ca_topic_score_gemma":0.00016189287,"teacher_disagreement_score":0.6612609,"about_ca_system_score_codex":0.00019809433,"about_ca_system_score_gemma":0.00013754841,"threshold_uncertainty_score":0.7670021},"labels":[],"label_agreement":null},{"id":"W2539200098","doi":"10.1109/tcomm.2016.2619707","title":"Design of Simultaneous Wireless Information and Power Transfer Scheme for Short Reference DCSK Communication Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":82,"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":"Computer science; Channel (broadcasting); Rayleigh fading; Energy (signal processing); Maximum power transfer theorem; Wireless; Bit error rate; Electronic engineering; Transmission (telecommunications); Data transmission; Power (physics); Fading; Telecommunications; Computer network; Engineering; Mathematics","score_opus":0.03174950240713562,"score_gpt":0.24115739863684812,"score_spread":0.2094078962297125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539200098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013944956,0.00034810245,0.98404187,0.00010755002,0.000116718555,0.0005310461,0.00011660467,0.00029301495,0.0005001231],"genre_scores_gemma":[0.9785712,0.0032295482,0.017652627,0.000012837614,0.0000049085183,0.0004225629,0.000020852436,0.000034639037,0.00005084285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998952,0.000120681434,0.0005016658,0.000109082306,0.00013262378,0.0001839826],"domain_scores_gemma":[0.99637944,0.0019412143,0.000043136442,0.0013397407,0.00022936211,0.00006711546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026203747,0.00017442403,0.00021343991,0.0001526801,0.000245219,0.00004065931,0.0005685407,0.00016654846,0.00000654908],"category_scores_gemma":[0.00001350814,0.00015650717,0.00004432749,0.00019675428,0.00018852661,0.0004651602,0.000004107122,0.00021963567,0.0000064102437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000558141,0.000104536295,0.000008709734,0.00009260183,0.00013146576,9.619259e-8,0.000561273,0.9230121,0.020912949,0.0054520383,0.00007993612,0.049588498],"study_design_scores_gemma":[0.0005752334,0.00011179932,0.000023101875,0.0004683246,0.00005597714,0.000008113138,0.0001429059,0.9856765,0.010485501,0.00008055549,0.0020717382,0.00030024973],"about_ca_topic_score_codex":0.00002544909,"about_ca_topic_score_gemma":0.000043583914,"teacher_disagreement_score":0.96638924,"about_ca_system_score_codex":0.00008327562,"about_ca_system_score_gemma":0.000029550509,"threshold_uncertainty_score":0.63821775},"labels":[],"label_agreement":null},{"id":"W2547852178","doi":"10.1109/tcomm.2016.2625257","title":"Secure Full-Duplex Spectrum-Sharing Wiretap Networks with Different Antenna Reception Schemes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":52,"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 Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Academy of Engineering","keywords":"Jamming; Secrecy; Computer science; Beamforming; Topology (electrical circuits); Antenna (radio); Signal-to-noise ratio (imaging); Telecommunications; Algorithm; Computer network; Mathematics; Physics; Computer security","score_opus":0.021100030737998283,"score_gpt":0.23986032186122833,"score_spread":0.21876029112323003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547852178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058053833,0.00040677146,0.93576133,0.0023759345,0.00013717012,0.00042274143,0.000045842313,0.002042472,0.0007538796],"genre_scores_gemma":[0.98456824,0.008398134,0.006204499,0.000052913267,0.000032792974,0.00042472634,0.000024503368,0.00009781693,0.00019639694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858123,0.00011079847,0.000432424,0.0002893957,0.0002278885,0.00035826585],"domain_scores_gemma":[0.99585116,0.00028447952,0.00009167727,0.0035363974,0.0001055874,0.00013067268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001500504,0.0003346108,0.00028504693,0.00025757332,0.00048221144,0.00008303406,0.0014913051,0.0001872634,0.00020601822],"category_scores_gemma":[0.0000043702544,0.00025997887,0.00012694155,0.00045052706,0.0002612023,0.00039057015,0.000019669842,0.0006995109,0.0000579645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082365057,0.004920506,0.0021046037,0.0004177047,0.0030855674,0.000011932006,0.0075354907,0.2222284,0.30567247,0.03888777,0.0037130283,0.41059887],"study_design_scores_gemma":[0.0020714635,0.0004604737,0.0017139016,0.0017130548,0.00023196012,0.00008199619,0.00032999567,0.90866196,0.067034364,0.0009385195,0.014928266,0.0018340481],"about_ca_topic_score_codex":0.000022547398,"about_ca_topic_score_gemma":0.0009058089,"teacher_disagreement_score":0.92955685,"about_ca_system_score_codex":0.00028321805,"about_ca_system_score_gemma":0.000017784696,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W2559855608","doi":"10.1109/tcomm.2016.2636289","title":"Quadrature Spatial Modulation in MIMO Cognitive Radio Systems With Imperfect Channel Estimation and Limited Feedback","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":32,"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","keywords":"Pairwise error probability; Rayleigh fading; MIMO; Robustness (evolution); Channel state information; Transmitter; Cognitive radio; Electronic engineering; Antenna diversity; Quadrature amplitude modulation; Computer science; Control theory (sociology); Channel (broadcasting); Algorithm; Mathematics; Fading; Telecommunications; Bit error rate; Antenna (radio); Engineering; Wireless","score_opus":0.016617499654793488,"score_gpt":0.23555080061474445,"score_spread":0.21893330095995098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559855608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04582799,0.0006443742,0.9510696,0.00074313744,0.0000909634,0.00058016094,0.000079885016,0.0007293095,0.0002345708],"genre_scores_gemma":[0.99310416,0.0029589874,0.003307525,0.000009496193,0.000006748219,0.00049910834,0.000025491754,0.000046667083,0.00004181705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906105,0.00011794659,0.0003008504,0.00019657178,0.00012766376,0.00019592993],"domain_scores_gemma":[0.9979977,0.0006198549,0.000074482465,0.0011554348,0.00010253236,0.000049980412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106004256,0.00021245971,0.00021206522,0.0003719371,0.00023214547,0.000042230466,0.00038500346,0.00017298163,0.0000050304316],"category_scores_gemma":[0.000018198763,0.0001745503,0.00003132869,0.0004918503,0.00023036634,0.00042506793,0.0000070530073,0.00039944836,0.000017130755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009907502,0.00022545752,0.00011122116,0.0000661956,0.0001204033,0.0000011941539,0.0009411947,0.70584196,0.0065929317,0.0005880626,0.000022552831,0.28538975],"study_design_scores_gemma":[0.0014486072,0.00012472938,0.0024651343,0.00068556797,0.000032471704,0.000020520158,0.0005908124,0.9859667,0.007879183,0.0003340108,0.000080459526,0.0003718003],"about_ca_topic_score_codex":0.000077426586,"about_ca_topic_score_gemma":0.00065644423,"teacher_disagreement_score":0.9477621,"about_ca_system_score_codex":0.0001750808,"about_ca_system_score_gemma":0.000020295502,"threshold_uncertainty_score":0.71179545},"labels":[],"label_agreement":null},{"id":"W2564729533","doi":"10.1109/tcomm.2016.2638907","title":"Novel Water-Filling for Maximum Throughput of Power Grid, MIMO, and Energy Harvesting Coexisting System With Mixed Constraints","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"MIMO; Computer science; Power budget; Maximum power principle; Energy harvesting; Interior point method; Mathematical optimization; Maximization; Upper and lower bounds; Power (physics); Electronic engineering; Algorithm; Energy (signal processing); Mathematics; Power control; Electrical engineering; Engineering; Channel (broadcasting); Telecommunications; Photovoltaic system","score_opus":0.025380190050919925,"score_gpt":0.22285349919832,"score_spread":0.19747330914740008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564729533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009024878,0.00010581612,0.9876589,0.00013039775,0.00035411026,0.00014068933,0.00017026278,0.00042457666,0.0019903407],"genre_scores_gemma":[0.9363022,0.00010182809,0.063170835,0.000011227669,0.000029111381,0.00017281141,0.000012121138,0.00007485414,0.00012503531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988079,0.0000637439,0.00045220656,0.00022460135,0.00012829975,0.00032325328],"domain_scores_gemma":[0.99746716,0.0012733203,0.00009379769,0.0009098727,0.00016559564,0.00009022808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026724543,0.00023269409,0.00028424137,0.00012290066,0.0003964764,0.00003778119,0.0003904624,0.000120492514,0.0000062295694],"category_scores_gemma":[0.000015123221,0.00017167469,0.00006817368,0.00015704407,0.00040574264,0.00019384053,0.0000072045054,0.00018022807,0.0000018219858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007109044,0.0002875343,0.00006181388,0.00049094314,0.0006315374,0.0000024451606,0.0009027417,0.63612205,0.24639627,0.016359478,0.0000733947,0.09860068],"study_design_scores_gemma":[0.005357511,0.00046920945,0.00019547698,0.007672732,0.00042806825,0.00036579065,0.0016925526,0.57116276,0.40412858,0.00022976185,0.0065183667,0.0017791814],"about_ca_topic_score_codex":0.000098510085,"about_ca_topic_score_gemma":0.00030736867,"teacher_disagreement_score":0.9272773,"about_ca_system_score_codex":0.00009372982,"about_ca_system_score_gemma":0.000025510251,"threshold_uncertainty_score":0.70006907},"labels":[],"label_agreement":null},{"id":"W2565767594","doi":"10.1109/tcomm.2016.2638906","title":"Interference-Aware Energy Efficiency Maximization in 5G Ultra-Dense Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council","keywords":"Scalability; Maximization; Bargaining problem; Nash equilibrium; Computer science; Mathematical optimization; Interference (communication); Spectral efficiency; Efficient energy use; Game theory; Scheme (mathematics); Distributed computing; Computer network; Mathematics; Beamforming; Telecommunications; Engineering; Mathematical economics","score_opus":0.016994730102252317,"score_gpt":0.23147196014308996,"score_spread":0.21447723004083763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565767594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026908272,0.00019384992,0.99575245,0.00022177864,0.0003986004,0.00018760389,0.000028414888,0.00043748884,0.0025107095],"genre_scores_gemma":[0.99466884,0.0027646548,0.0018793492,0.000028657529,0.000017829714,0.00021828266,0.000014235717,0.000050751012,0.00035738604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989479,0.000111233705,0.00041348874,0.00019344773,0.00008876,0.00024514724],"domain_scores_gemma":[0.998304,0.0002912018,0.000053859916,0.0012000997,0.00008276124,0.00006809202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009547585,0.0001856991,0.00017035304,0.00029648942,0.00016683553,0.000025430892,0.0005073469,0.00013136744,0.00006739931],"category_scores_gemma":[0.000008258255,0.00016902063,0.000059978986,0.00060077244,0.000086969885,0.0003019924,0.000002031267,0.00021108704,0.000036955305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008357559,0.00009708528,0.000014415879,0.000006365247,0.000014198118,4.9591466e-7,0.00015367825,0.9636826,0.0020021414,0.00038624048,0.00005806367,0.03357636],"study_design_scores_gemma":[0.0008562058,0.00006164855,0.00006898813,0.0003722147,0.000023923056,0.000012909065,0.00014158331,0.98427045,0.0125928,0.00025523987,0.0009056173,0.00043839228],"about_ca_topic_score_codex":0.000057844016,"about_ca_topic_score_gemma":0.0010414239,"teacher_disagreement_score":0.9943998,"about_ca_system_score_codex":0.00025882202,"about_ca_system_score_gemma":0.000021469788,"threshold_uncertainty_score":0.6892461},"labels":[],"label_agreement":null},{"id":"W2582747851","doi":"10.1109/tcomm.2017.2712186","title":"On the Average Locality of Locally Repairable Codes","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Locality; Computer science; Telecommunications","score_opus":0.05614801475095951,"score_gpt":0.3056711569567056,"score_spread":0.2495231422057461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582747851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000901327,0.00004222565,0.98377055,0.009415524,0.00013180023,0.00021575521,0.0000656144,0.00034855513,0.0051086457],"genre_scores_gemma":[0.94576466,0.0002603712,0.0534278,0.00020707546,0.0000026519226,0.00007811656,0.0000016192516,0.0000080811005,0.0002495972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899125,0.00013236268,0.0002552788,0.0002422094,0.00021271806,0.0001661683],"domain_scores_gemma":[0.9866584,0.0008736461,0.00022466309,0.012092823,0.00011637422,0.000034100998],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00038459175,0.00012519762,0.00015421878,0.000082332095,0.001774233,0.000121320045,0.0070128385,0.0000729915,0.000018611243],"category_scores_gemma":[0.0001295445,0.00009704758,0.00009245777,0.00018586678,0.00083271804,0.0005111876,0.00007082364,0.00047051202,0.000065039225],"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.00002401582,0.0008754184,0.000015339405,0.000014611714,0.00008776097,0.000003026793,0.000381179,0.015206265,0.0012521559,0.8952658,0.0013961907,0.0854782],"study_design_scores_gemma":[0.0012382903,0.0007644904,0.0010992492,0.00040951776,0.00007204473,0.00002787168,0.0003542164,0.36841717,0.19497149,0.40958518,0.022073818,0.0009866501],"about_ca_topic_score_codex":0.00014237757,"about_ca_topic_score_gemma":0.00028661106,"teacher_disagreement_score":0.9448634,"about_ca_system_score_codex":0.0000610837,"about_ca_system_score_gemma":0.00006165262,"threshold_uncertainty_score":0.9995253},"labels":[],"label_agreement":null},{"id":"W2593423258","doi":"10.1109/tcomm.2017.2679194","title":"Optimal Training Design for MIMO-OFDM Two-Way Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Relay; MIMO; Fading; Orthogonal frequency-division multiplexing; Node (physics); Channel (broadcasting); Computer science; Minimum mean square error; Relay channel; Mean squared error; Signal-to-noise ratio (imaging); Convex optimization; Computational complexity theory; Control theory (sociology); Mathematical optimization; Mathematics; Algorithm; Power (physics); Regular polygon; Telecommunications; Engineering; Statistics","score_opus":0.18213757611971593,"score_gpt":0.3540135723578985,"score_spread":0.17187599623818256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593423258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016349813,0.0004005086,0.98754066,0.00749961,0.00056671695,0.0006547052,0.000010775495,0.00029740832,0.002866109],"genre_scores_gemma":[0.6873047,0.0014945654,0.3097098,0.00027950093,0.000043053456,0.00046184185,0.000005314478,0.000023752344,0.0006774829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982112,0.0003973355,0.0004163418,0.0004049333,0.00016979959,0.00040039036],"domain_scores_gemma":[0.990924,0.001233294,0.00025593795,0.0071597775,0.00026784156,0.0001591209],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.000915315,0.00024306621,0.000263126,0.00015235988,0.005761978,0.0006839935,0.0063884505,0.00010786389,0.0000272363],"category_scores_gemma":[0.000051690808,0.00025850313,0.00020917639,0.00025030048,0.00030004585,0.0008343751,0.000067971574,0.00061795686,0.000038872677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040373285,0.0004021393,0.0000050358453,0.0000049364726,0.00013595234,0.000001078923,0.0026649933,0.54316366,0.0005547152,0.041447043,0.0014053251,0.41017476],"study_design_scores_gemma":[0.000889589,0.00012037774,0.00008142267,0.00006979657,0.000032967455,0.000009978674,0.00006397836,0.9823977,0.00089744356,0.000362091,0.014753271,0.0003214202],"about_ca_topic_score_codex":0.000016089667,"about_ca_topic_score_gemma":0.00020129707,"teacher_disagreement_score":0.6871412,"about_ca_system_score_codex":0.00009461676,"about_ca_system_score_gemma":0.00013236616,"threshold_uncertainty_score":0.9999867},"labels":[],"label_agreement":null},{"id":"W2609366403","doi":"10.1109/tcomm.2017.2699183","title":"Downlink spectrum allocation for in-band and out-band wireless backhauling of full-duplex small cells","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":90,"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":"Backhaul (telecommunications); Computer science; Computer network; Telecommunications link; Wireless; Base station; Wireless network; Telecommunications","score_opus":0.044218852651344794,"score_gpt":0.2690305192250262,"score_spread":0.2248116665736814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609366403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65296495,0.00067263225,0.3400503,0.0028852932,0.0005067128,0.0012198968,0.0003137624,0.0002471659,0.0011392983],"genre_scores_gemma":[0.98509616,0.0038778046,0.0103624705,0.000020159556,0.00002267893,0.000378682,0.000036423018,0.0000643146,0.00014132711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986401,0.00007791732,0.0006030865,0.0002536424,0.00012531328,0.0002999438],"domain_scores_gemma":[0.99526274,0.00067824585,0.0001894031,0.0036443053,0.00012321903,0.000102079066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003086078,0.00025925876,0.00035856426,0.0002795999,0.00086698006,0.00012306806,0.0015423053,0.00018126376,0.000017582277],"category_scores_gemma":[0.00001964918,0.00030676933,0.00012318073,0.00015506412,0.00031736767,0.00026951634,0.0000131524,0.0005103008,0.000015635009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009262573,0.00072025874,0.00013964513,0.0003270978,0.00023288914,5.759245e-7,0.003107706,0.6198394,0.3525587,0.0019415325,0.00010686961,0.020932712],"study_design_scores_gemma":[0.001859708,0.00011923092,0.0014262073,0.00031685826,0.00012662639,0.000006561027,0.00040790864,0.7490455,0.24453385,0.00013412499,0.0014757696,0.00054767996],"about_ca_topic_score_codex":0.00020400774,"about_ca_topic_score_gemma":0.010951183,"teacher_disagreement_score":0.3321312,"about_ca_system_score_codex":0.00011948611,"about_ca_system_score_gemma":0.000056066176,"threshold_uncertainty_score":0.9999384},"labels":[],"label_agreement":null},{"id":"W2614571185","doi":"10.1109/tcomm.2017.2704585","title":"On the Design of Symmetric Entropy-constrained Multiple Description Scalar Quantizer with Linear Joint Decoders","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"Algorithm; Mathematics; Encoder; Mathematical optimization; Quantization (signal processing); Decoding methods; Entropy (arrow of time); Vector quantization; Computer science","score_opus":0.10785868372587035,"score_gpt":0.3037160328637489,"score_spread":0.19585734913787853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614571185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009846225,0.000031910728,0.99434435,0.0033239226,0.00010548179,0.00062957394,0.00003919171,0.00023456446,0.00030638164],"genre_scores_gemma":[0.6663744,0.00018687964,0.33312055,0.00011691501,0.0000035407722,0.00014136528,0.0000024882177,0.000012843156,0.00004101951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846923,0.00034358123,0.00035333267,0.00030464877,0.00031873153,0.00021046527],"domain_scores_gemma":[0.99179995,0.0012765783,0.00036755094,0.0062703025,0.00020940666,0.00007623214],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045176654,0.00019095704,0.00021293687,0.00028811206,0.0015837942,0.00015864719,0.003578557,0.00007378425,0.000016987557],"category_scores_gemma":[0.00014438099,0.00013401045,0.00009905799,0.00036399806,0.0005185346,0.00071584625,0.000039996958,0.00045536636,0.000027862196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004339873,0.0054095644,0.00014221732,0.0000629834,0.0005472357,0.000010149225,0.0017054172,0.12818179,0.11597802,0.5502694,0.0026737978,0.19458543],"study_design_scores_gemma":[0.00094595965,0.00044389183,0.00045998124,0.00027506787,0.000049504008,0.000015307285,0.00008634556,0.7979145,0.18975273,0.009019541,0.00069054303,0.00034659982],"about_ca_topic_score_codex":0.000093035414,"about_ca_topic_score_gemma":0.00004924987,"teacher_disagreement_score":0.66973275,"about_ca_system_score_codex":0.000062511055,"about_ca_system_score_gemma":0.00008572544,"threshold_uncertainty_score":0.999716},"labels":[],"label_agreement":null},{"id":"W2614864174","doi":"10.1109/tcomm.2017.2706261","title":"Performance Analysis of Multiple Association in Ultra-Dense Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":74,"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":"Telecommunications link; Base station; Backhaul (telecommunications); Computer science; Fading; Cellular network; Computation; Shadow mapping; Electronic engineering; Computer network; Context (archaeology); Channel (broadcasting); Topology (electrical circuits); Algorithm; Engineering; Electrical engineering","score_opus":0.020080083456787884,"score_gpt":0.2561134467304341,"score_spread":0.23603336327364624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614864174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056952726,0.000083420164,0.93890953,0.000082767394,0.00025354346,0.00023442075,0.000051307503,0.00013427142,0.0032980281],"genre_scores_gemma":[0.9957189,0.0014529217,0.0025466043,0.000005175421,0.0000068701056,0.000082216495,0.00001940853,0.000019423407,0.00014850307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992647,0.00005221718,0.00034303238,0.00010134968,0.000094910574,0.00014379703],"domain_scores_gemma":[0.9977544,0.00028282282,0.0001682119,0.0016755702,0.00008798053,0.000030990563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002027076,0.000101638514,0.00022484607,0.0003328911,0.00032084863,0.000028442619,0.00052117324,0.00010407155,0.000014115418],"category_scores_gemma":[0.00002660679,0.0001224622,0.000096050666,0.0004743491,0.00004486649,0.0003132739,0.0000018797218,0.00025762845,0.000007335604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045799047,0.00006194557,0.008562964,0.000008277087,0.00020509011,6.784771e-8,0.00019822786,0.9874879,0.0005750241,0.000009379059,0.0000094962315,0.0028770608],"study_design_scores_gemma":[0.00026165083,0.000009704185,0.020982606,0.000035588004,0.00017408212,2.2385933e-7,0.000039906477,0.9764042,0.0019227542,0.0000029853807,0.00006063155,0.00010567931],"about_ca_topic_score_codex":0.00011442787,"about_ca_topic_score_gemma":0.0029457752,"teacher_disagreement_score":0.9387661,"about_ca_system_score_codex":0.00023398035,"about_ca_system_score_gemma":0.000009694228,"threshold_uncertainty_score":0.49938634},"labels":[],"label_agreement":null},{"id":"W2616584085","doi":"10.1109/tcomm.2017.2704609","title":"Pre-equalized Faster-than-Nyquist Transmission","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":54,"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); University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spectral efficiency; Precoding; Nyquist–Shannon sampling theorem; Intersymbol interference; Transmission (telecommunications); Computer science; Equalization (audio); Algorithm; Transmitter; Electronic engineering; Nyquist ISI criterion; Bit error rate; Nyquist rate; Interference (communication); Control theory (sociology); MIMO; Telecommunications; Decoding methods; Sampling (signal processing); Engineering; Beamforming","score_opus":0.04824429144813847,"score_gpt":0.31939884666660523,"score_spread":0.27115455521846676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616584085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065484266,0.00036759913,0.92056656,0.0029711165,0.0014535153,0.0004260781,0.000066938686,0.0010251792,0.06657461],"genre_scores_gemma":[0.9892381,0.0016236919,0.0053273374,0.000032830616,0.00005157235,0.0002092474,0.000009138864,0.000061604114,0.003446499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891675,0.000093572744,0.00036212534,0.00019625021,0.00018950822,0.00024180103],"domain_scores_gemma":[0.9956873,0.00014078736,0.00008167094,0.0038810526,0.00006722336,0.00014194245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00015424074,0.00021915133,0.00021497176,0.00016694544,0.0017211309,0.00013403206,0.0016080025,0.00013198188,0.00033443855],"category_scores_gemma":[0.000008653677,0.00023032971,0.00014260232,0.00011774192,0.0003804943,0.00038652853,0.0000047577246,0.00048901147,0.0002434228],"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.00023382917,0.0016999481,0.00007690339,0.00034803178,0.0009850805,0.0000061914766,0.012035383,0.20607606,0.14655204,0.0059686303,0.01349888,0.612519],"study_design_scores_gemma":[0.0042063254,0.00028008939,0.0034486197,0.00073553756,0.00038133492,0.000081863276,0.0007273432,0.20478839,0.10150041,0.0034040776,0.6785239,0.0019221205],"about_ca_topic_score_codex":0.000106932086,"about_ca_topic_score_gemma":0.0001076157,"teacher_disagreement_score":0.9826897,"about_ca_system_score_codex":0.0001010005,"about_ca_system_score_gemma":0.000022753806,"threshold_uncertainty_score":0.9995785},"labels":[],"label_agreement":null},{"id":"W2617309511","doi":"10.1109/tcomm.2017.2708110","title":"Joint Transceiver Design for Secure Downlink Communications Over an Amplify-and-Forward MIMO Relay","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Relay; Artificial noise; Telecommunications link; Computer science; Beamforming; Base station; Transceiver; MIMO; Mathematical optimization; Constraint (computer-aided design); Covariance matrix; Computer network; Wireless; Power (physics); Algorithm; Mathematics; Telecommunications; Physical layer","score_opus":0.09634926893443778,"score_gpt":0.326003359148615,"score_spread":0.2296540902141772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617309511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022119281,0.001023909,0.9855363,0.0044640573,0.00019572466,0.0016372752,0.00057101506,0.001429462,0.0029303655],"genre_scores_gemma":[0.83914214,0.009655983,0.14927317,0.00014922193,0.000022021935,0.0014259192,0.00009625801,0.00011074655,0.00012452646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813175,0.00031817151,0.0006297659,0.00033595433,0.00021115529,0.00037318887],"domain_scores_gemma":[0.9867676,0.0007198657,0.0001838218,0.011883937,0.00021428707,0.0002304706],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00063478627,0.0003800835,0.0004102949,0.00028004166,0.003116861,0.00035233118,0.004262472,0.00035568798,0.000050634746],"category_scores_gemma":[0.00002854004,0.00043539854,0.00021581052,0.00015324935,0.00078518066,0.0009089598,0.000037849204,0.001135077,0.00003173181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006371429,0.009569455,0.00021016721,0.0010859667,0.0038947447,0.000005481892,0.045237564,0.12559935,0.09029261,0.17011791,0.021640018,0.53170955],"study_design_scores_gemma":[0.0032031743,0.0005246233,0.0018736531,0.00045424514,0.0006344697,0.000039650073,0.00067809277,0.7571913,0.029508576,0.010052646,0.19370739,0.0021321818],"about_ca_topic_score_codex":0.00013169339,"about_ca_topic_score_gemma":0.0009713602,"teacher_disagreement_score":0.8369302,"about_ca_system_score_codex":0.00015666295,"about_ca_system_score_gemma":0.00006177409,"threshold_uncertainty_score":0.9998098},"labels":[],"label_agreement":null},{"id":"W2622829522","doi":"10.1109/tcomm.2017.2712601","title":"TAS-Based Incremental Hybrid Decode–Amplify–Forward Relaying for Physical Layer Security Enhancement","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Australian Research Council; National Natural Science Foundation of China","keywords":"Relay; Physical layer; Computer science; Overhead (engineering); Transmission (telecommunications); Computer network; Channel state information; Secure transmission; Secrecy; Scheme (mathematics); Electronic engineering; Topology (electrical circuits); Wireless; Engineering; Telecommunications; Power (physics); Mathematics; Electrical engineering","score_opus":0.08509650198207858,"score_gpt":0.35777423591280727,"score_spread":0.2726777339307287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622829522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006647069,0.0001102801,0.9820291,0.0071788933,0.0003219703,0.00066011294,0.00006298533,0.00018812472,0.0028015103],"genre_scores_gemma":[0.9580132,0.00049171736,0.039928265,0.0005971659,0.000035196397,0.00069732766,0.000027375536,0.000021151896,0.00018862617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984636,0.00022415615,0.00034823612,0.00039489058,0.00025046064,0.00031867815],"domain_scores_gemma":[0.9928269,0.00062457495,0.00023776428,0.0059460476,0.00022815684,0.00013658302],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047509483,0.00022853052,0.00024204698,0.0001256171,0.004428854,0.00046610087,0.004474194,0.00005584188,0.000037641592],"category_scores_gemma":[0.000033410644,0.00024220577,0.00021412998,0.00015025544,0.0002254675,0.0006391949,0.00008494503,0.0005059071,0.00008066559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030820502,0.009708096,0.00013086137,0.00011326758,0.0006917277,0.0000043047676,0.0060181827,0.008794803,0.037147485,0.14218651,0.009550378,0.7853462],"study_design_scores_gemma":[0.0016205293,0.00030237928,0.00013358389,0.00011803516,0.00006328025,0.000004239124,0.000055983717,0.8570539,0.098848976,0.0025786497,0.03868019,0.000540273],"about_ca_topic_score_codex":0.000023782874,"about_ca_topic_score_gemma":0.00027649238,"teacher_disagreement_score":0.9513661,"about_ca_system_score_codex":0.00018218422,"about_ca_system_score_gemma":0.00013431993,"threshold_uncertainty_score":0.99686724},"labels":[],"label_agreement":null},{"id":"W2663297862","doi":"10.1109/tcomm.2017.2717831","title":"Digitally Controlled Analog Cancellation for Full Duplex Broadband Power Line Communications","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Echo (communications protocol); Electronic engineering; Dynamic range; Broadband; Successive approximation ADC; Communications system; Analog-to-digital converter; Power (physics); Telecommunications; Electrical engineering; Engineering; Computer network; Capacitor; Voltage; Physics","score_opus":0.04355917880615724,"score_gpt":0.29511871439821996,"score_spread":0.25155953559206273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2663297862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027707836,0.0029841915,0.9187184,0.014805837,0.0011662558,0.004200342,0.001682344,0.0017170821,0.027017737],"genre_scores_gemma":[0.9756106,0.004140634,0.016455933,0.000109870634,0.00003869086,0.0021038575,0.00022040075,0.00012623645,0.0011937761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979183,0.00015203713,0.00088464026,0.00032935725,0.00025319343,0.00046245966],"domain_scores_gemma":[0.9848058,0.0014539169,0.0003219156,0.0127527965,0.00046295393,0.00020259019],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003827419,0.00042186186,0.00058913656,0.00031930968,0.0037390676,0.00048557817,0.0050928555,0.00024345137,0.000096278585],"category_scores_gemma":[0.000102213075,0.00047033193,0.00041717023,0.00025753523,0.0007134336,0.000701452,0.00005205846,0.000769662,0.000120994584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033513378,0.0012596085,0.000037587582,0.00007048607,0.00093027565,6.6613643e-7,0.001024676,0.95020986,0.013151217,0.006747101,0.0027090735,0.02352433],"study_design_scores_gemma":[0.0044995584,0.00019445452,0.0003672775,0.00011731669,0.00023227766,0.000009212169,0.0001586047,0.9533858,0.00161853,0.00019405616,0.03858507,0.0006378698],"about_ca_topic_score_codex":0.0001301843,"about_ca_topic_score_gemma":0.0047782483,"teacher_disagreement_score":0.94790274,"about_ca_system_score_codex":0.00027923923,"about_ca_system_score_gemma":0.00012813999,"threshold_uncertainty_score":0.9997748},"labels":[],"label_agreement":null},{"id":"W2699584971","doi":"10.1109/tcomm.2017.2764892","title":"Secure Broadcasting Using Independent Secret Keys","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"National Science Foundation","keywords":"Computer science; Broadcasting (networking); Computer network; Transmitter; Channel (broadcasting); Coding (social sciences); Channel capacity; Encryption; Computer security; Topology (electrical circuits); Mathematics","score_opus":0.07183492949968856,"score_gpt":0.31641869231116115,"score_spread":0.2445837628114726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2699584971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03789257,0.0005739684,0.93437487,0.0009426088,0.00046141125,0.00052086235,0.00012041272,0.0019269888,0.023186335],"genre_scores_gemma":[0.97184575,0.0014671083,0.026320225,0.000047650854,0.000025903264,0.0001153368,0.000010973332,0.00007300535,0.00009405752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880326,0.00012554196,0.00037960624,0.00019036878,0.00022796077,0.00027328145],"domain_scores_gemma":[0.9934083,0.00017840402,0.00013632125,0.0060395338,0.00012322082,0.00011417468],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00027794554,0.00023353077,0.00022189904,0.00020555357,0.0020796747,0.00027689087,0.0027939526,0.00018674707,0.00008897728],"category_scores_gemma":[0.000016412741,0.00028349503,0.0001320163,0.00014557478,0.00025320373,0.00052178156,0.00003248475,0.00097547745,0.00006709662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009001033,0.0028733304,0.0013188411,0.0006721771,0.001749174,0.000026229314,0.0167849,0.45384192,0.16605407,0.021126267,0.0035479728,0.3319151],"study_design_scores_gemma":[0.00079550064,0.00005702654,0.00096891995,0.0005245208,0.00014028067,0.000064723754,0.00045625554,0.91122705,0.06645153,0.0015833325,0.016699538,0.0010313056],"about_ca_topic_score_codex":0.00015562684,"about_ca_topic_score_gemma":0.0005046499,"teacher_disagreement_score":0.93395317,"about_ca_system_score_codex":0.00019887398,"about_ca_system_score_gemma":0.000043304404,"threshold_uncertainty_score":0.99996173},"labels":[],"label_agreement":null},{"id":"W2726729862","doi":"10.1109/tcomm.2017.2723565","title":"Secure Massive MIMO Relaying Systems in a Poisson Field of Eavesdroppers","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Division of Electrical, Communications and Cyber Systems; Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; Australian Research Council; Royal Academy of Engineering; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Relay; Channel state information; Computer network; Telecommunications link; Computer science; MIMO; Transmission (telecommunications); Reliability (semiconductor); Secure transmission; Poisson point process; Signal-to-noise ratio (imaging); Channel (broadcasting); Antenna (radio); Power (physics); Wireless; Poisson distribution; Telecommunications; Mathematics; Encryption; Physics; Statistics","score_opus":0.030768441062426512,"score_gpt":0.3004351606004512,"score_spread":0.26966671953802474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726729862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17368725,0.0060716453,0.6981743,0.0179878,0.0017434673,0.0031002185,0.0003818772,0.00262525,0.096228175],"genre_scores_gemma":[0.99329597,0.002667209,0.0036585932,0.00003065825,0.000007010694,0.00023468093,0.0000053210415,0.00003609057,0.00006446544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989957,0.00011569823,0.00043053212,0.00013279704,0.00014709425,0.00017814118],"domain_scores_gemma":[0.99506813,0.00036416398,0.00014352927,0.0042821504,0.00008649047,0.000055532513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020692099,0.00015790369,0.0002517109,0.00027930157,0.00043703962,0.00007635267,0.0019036073,0.00017767408,0.000017599285],"category_scores_gemma":[0.00002023716,0.00018645117,0.000097699434,0.00017062011,0.00015223499,0.0002997527,0.000015987313,0.00071645185,0.000014852934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002599257,0.004258965,0.003004406,0.0018105021,0.0018074294,0.000028172008,0.040221725,0.5708754,0.14117843,0.08774558,0.008439566,0.14036988],"study_design_scores_gemma":[0.0026412904,0.00039874067,0.003535305,0.003602392,0.00024720185,0.000036076002,0.0055675367,0.74859595,0.2086241,0.0024120163,0.022414502,0.0019249006],"about_ca_topic_score_codex":0.0008661147,"about_ca_topic_score_gemma":0.0009203827,"teacher_disagreement_score":0.81960875,"about_ca_system_score_codex":0.00012107541,"about_ca_system_score_gemma":0.000032293854,"threshold_uncertainty_score":0.7603258},"labels":[],"label_agreement":null},{"id":"W2736716964","doi":"10.1109/tcomm.2017.2729552","title":"Average Error Rates and Achievable Capacity in Large Office Indoor Wireless Environments","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"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 Calgary","funders":"","keywords":"Fading; Bit error rate; Channel (broadcasting); Computer science; Path loss; Joint (building); Wireless; Signal-to-noise ratio (imaging); Modulation (music); Electronic engineering; Statistics; Algorithm; Mathematics; Telecommunications; Engineering","score_opus":0.045564642704518855,"score_gpt":0.28555879766553544,"score_spread":0.2399941549610166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736716964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2922847,0.00035542928,0.7003645,0.0007540978,0.000114111885,0.00064001465,0.00019375046,0.0005127486,0.0047807153],"genre_scores_gemma":[0.987495,0.004252147,0.007618558,0.000043320644,0.000005006219,0.0002849214,0.000012320539,0.00004463355,0.00024410171],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906373,0.00010420798,0.0002954396,0.00018015463,0.00011292532,0.0002435586],"domain_scores_gemma":[0.99624395,0.00019783032,0.000087686,0.0033767074,0.000017957289,0.000075838034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020077919,0.00019237939,0.00021073497,0.00015734293,0.0009975776,0.0000831345,0.001298029,0.00012417624,0.000029571565],"category_scores_gemma":[0.000009868394,0.00022825976,0.00004718284,0.0000996267,0.00026417745,0.0005349799,0.000027318298,0.000707787,0.00004021674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041731098,0.011433348,0.018946268,0.0007337208,0.0011567218,0.000021110502,0.015157533,0.29469392,0.32098913,0.025509449,0.001176755,0.30976474],"study_design_scores_gemma":[0.0047447807,0.00017804626,0.07538685,0.0006514218,0.000099280995,0.00002848248,0.0006243959,0.55723596,0.30678597,0.002534989,0.04951276,0.0022170246],"about_ca_topic_score_codex":0.00012195231,"about_ca_topic_score_gemma":0.0015418488,"teacher_disagreement_score":0.6952103,"about_ca_system_score_codex":0.00013250002,"about_ca_system_score_gemma":0.000011398081,"threshold_uncertainty_score":0.9308163},"labels":[],"label_agreement":null},{"id":"W2738829458","doi":"10.1109/tcomm.2017.2731315","title":"Superposition Signaling in Broadcast Interference Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Saskatchewan","funders":"Division of Electrical, Communications and Cyber Systems; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Royal Academy of Engineering; National Science Foundation","keywords":"Superposition principle; Interference (communication); Gaussian; Rate of convergence; Computer science; Single antenna interference cancellation; Topology (electrical circuits); Quadratic equation; Zero-forcing precoding; Mathematical optimization; Convergence (economics); Mathematics; Algorithm; Telecommunications; Decoding methods; MIMO; Precoding; Beamforming; Physics","score_opus":0.031652230011379165,"score_gpt":0.27217589690280014,"score_spread":0.24052366689142096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738829458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031965245,0.00018301685,0.99226433,0.0001349375,0.00036460705,0.00022359675,0.000013998826,0.00022231138,0.0033966843],"genre_scores_gemma":[0.99162734,0.00074878987,0.0073184543,0.000014355372,0.00001947267,0.00014604817,0.000011025635,0.000032042197,0.000082463914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999334,0.00005020613,0.00026459072,0.0001282096,0.000055872817,0.00016713134],"domain_scores_gemma":[0.99805427,0.00010084282,0.000050607916,0.0017011673,0.00004717631,0.00004594329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010334719,0.00012777164,0.0001319182,0.00013809961,0.00054223905,0.00010166868,0.0007193469,0.000089314,0.000026837153],"category_scores_gemma":[0.000005846666,0.00015418165,0.000046622223,0.00011626148,0.00008623549,0.00046816873,0.000004456499,0.00039586218,0.000034280936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004955644,0.000049738155,0.000028383962,0.000007725584,0.000012516689,5.269362e-7,0.00028916454,0.98085684,0.0025134573,0.00011992835,0.000012491171,0.016104296],"study_design_scores_gemma":[0.00032059674,0.000022183085,0.0001720794,0.0002146623,0.000014067755,0.0000057359275,0.00013584405,0.9939046,0.004737129,0.00010377069,0.00016860598,0.00020074332],"about_ca_topic_score_codex":0.00007133829,"about_ca_topic_score_gemma":0.0005737771,"teacher_disagreement_score":0.9884308,"about_ca_system_score_codex":0.00013843067,"about_ca_system_score_gemma":0.000010255329,"threshold_uncertainty_score":0.62873447},"labels":[],"label_agreement":null},{"id":"W2742528185","doi":"10.1109/tcomm.2017.2736549","title":"A Weighted Combining Algorithm for Spatial Multiplexing MIMO DF Relaying Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"MIMO; Spatial multiplexing; Computer science; Multiplexing; Algorithm; Electronic engineering; Beamforming; Telecommunications; Engineering","score_opus":0.08740658906341649,"score_gpt":0.32649771827796065,"score_spread":0.23909112921454417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742528185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017502207,0.00045006504,0.99187046,0.003118204,0.0010416496,0.00071770605,0.000041519244,0.00034221695,0.0022431551],"genre_scores_gemma":[0.8115328,0.0010439949,0.18617128,0.00012427318,0.000044710992,0.0005595525,0.000014087913,0.000026126338,0.00048320426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830526,0.00029769275,0.0004714236,0.00038258272,0.00021216458,0.00033087732],"domain_scores_gemma":[0.9921505,0.0008939163,0.0003294791,0.006139412,0.00035483617,0.00013188225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00057628955,0.00022694435,0.00027474907,0.00019643093,0.006558673,0.0009077904,0.0050274176,0.00011117996,0.000009294844],"category_scores_gemma":[0.000035702233,0.00024454945,0.0001753967,0.00021284995,0.00020907263,0.00078520004,0.000083886844,0.00052821747,0.000042765936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011370612,0.0004500628,0.000019408175,0.000015065728,0.00013734518,0.0000011615192,0.0017391993,0.0029914044,0.0009927602,0.02192404,0.0002640915,0.9714541],"study_design_scores_gemma":[0.000945179,0.00007324754,0.00010145215,0.00015920616,0.00002304375,0.000008731627,0.00008679159,0.98039687,0.00091202825,0.00027170772,0.016735625,0.0002861393],"about_ca_topic_score_codex":0.00018265561,"about_ca_topic_score_gemma":0.0003464478,"teacher_disagreement_score":0.9774054,"about_ca_system_score_codex":0.00012450412,"about_ca_system_score_gemma":0.0000912521,"threshold_uncertainty_score":0.9972437},"labels":[],"label_agreement":null},{"id":"W2743594601","doi":"10.1109/tcomm.2017.2734882","title":"Energy Management for Energy Harvesting Wireless Sensors With Adaptive Retransmission","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":0,"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; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Pairwise error probability; Retransmission; Network packet; Decoding methods; Automatic repeat request; Energy (signal processing); Wireless sensor network; Real-time computing; Computer network; Algorithm; Telecommunications link; Fading; Hybrid automatic repeat request; Mathematics; Statistics","score_opus":0.036179044799372485,"score_gpt":0.25351807744900734,"score_spread":0.21733903264963486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743594601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006461358,0.00055347034,0.9838052,0.00023230934,0.00087087246,0.00041545974,0.0002169976,0.001131871,0.012127699],"genre_scores_gemma":[0.91711694,0.0062541165,0.069958046,0.000044812612,0.00011563307,0.0020057154,0.0001809717,0.00028685151,0.004036896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977411,0.0001615929,0.00058863463,0.0006358825,0.0003362276,0.0005365616],"domain_scores_gemma":[0.9941614,0.0005362678,0.00023419065,0.0046344055,0.00022255543,0.00021113662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021258286,0.00068290887,0.0005742878,0.00035491315,0.0012966179,0.00023979892,0.00215746,0.00055379816,0.000010996208],"category_scores_gemma":[0.0000032457094,0.00072485494,0.00028080025,0.0001997888,0.00029218776,0.00019269188,0.000037472953,0.0012104197,0.0000036821218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053773103,0.0001322036,8.298264e-7,0.00018477165,0.0005662362,0.0000055297683,0.00013708629,0.882407,0.000083084364,0.0034984653,0.0003092803,0.11262174],"study_design_scores_gemma":[0.0006437379,0.000097938995,0.000019868134,0.0025881298,0.0004058507,0.0000126278765,0.00007493316,0.97566164,0.0038252953,0.0008962383,0.014836455,0.0009373103],"about_ca_topic_score_codex":0.00049987884,"about_ca_topic_score_gemma":0.002295535,"teacher_disagreement_score":0.9164708,"about_ca_system_score_codex":0.00031938727,"about_ca_system_score_gemma":0.000084760446,"threshold_uncertainty_score":0.99952024},"labels":[],"label_agreement":null},{"id":"W2753098368","doi":"10.1109/tcomm.2017.2749398","title":"Efficient Access Control for Broadband Power Line Communications in Home Area Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Preamble; Computer science; Computer network; Broadband; Power-line communication; Media access control; Random access; Access control; Power (physics); Transmission (telecommunications); Broadband networks; Telecommunications; Channel (broadcasting); Wireless","score_opus":0.05208247449884817,"score_gpt":0.3171129007563936,"score_spread":0.2650304262575454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753098368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007747163,0.0025104166,0.97456855,0.0050582113,0.00063826,0.0013883123,0.00045965752,0.0004250326,0.0072043855],"genre_scores_gemma":[0.990603,0.0036210143,0.0040292027,0.00013131397,0.000020038147,0.0013176062,0.000051662828,0.00007263222,0.00015351447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847263,0.00012983027,0.00061335874,0.00024314848,0.00013629957,0.00040471973],"domain_scores_gemma":[0.9880805,0.0009592157,0.00015400152,0.010473842,0.00018875934,0.0001437069],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004480486,0.00029095061,0.00036632753,0.00032552122,0.0018649778,0.00032468373,0.005925414,0.00018167085,0.000044500517],"category_scores_gemma":[0.000035117555,0.00032076653,0.00021071572,0.00028546635,0.00042237295,0.00027799938,0.00005686545,0.0008166571,0.000023745357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054730644,0.0011551309,0.00017308226,0.000021248705,0.00016035006,5.437646e-7,0.00032361946,0.9840241,0.00031242453,0.0015566526,0.00067713123,0.011541002],"study_design_scores_gemma":[0.0019296077,0.00006341045,0.0024818354,0.00011950614,0.00007424469,0.0000035526402,0.00005161279,0.982916,0.00016047535,0.00029101025,0.011524221,0.00038454434],"about_ca_topic_score_codex":0.00010243278,"about_ca_topic_score_gemma":0.001841087,"teacher_disagreement_score":0.98285586,"about_ca_system_score_codex":0.00016915819,"about_ca_system_score_gemma":0.000055964276,"threshold_uncertainty_score":0.9999244},"labels":[],"label_agreement":null},{"id":"W2755368128","doi":"10.1109/tcomm.2017.2753773","title":"Impact of Residual Additive Transceiver Hardware Impairments on Rayleigh-Product MIMO Channels With Linear Receivers: Exact and Asymptotic Analyses","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Engineering and Physical Sciences Research Council; Horizon 2020 Framework Programme; South African National Space Agency; Imperial College London","keywords":"Transceiver; Residual; Ergodic theory; Channel (broadcasting); MIMO; Computer science; Signal-to-noise ratio (imaging); Mathematics; Control theory (sociology); Electronic engineering; Algorithm; Telecommunications; Engineering; Wireless","score_opus":0.05009689214093845,"score_gpt":0.3309077766235376,"score_spread":0.28081088448259917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755368128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29811463,0.00070462003,0.69055164,0.0004236764,0.00053422747,0.0021230772,0.0022258537,0.0006410938,0.004681152],"genre_scores_gemma":[0.9933536,0.0014760843,0.0047835447,0.0000051199077,0.00003089839,0.00008757083,0.00004841713,0.000057849484,0.00015691068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998944,0.00010079961,0.00030161082,0.00026340134,0.00016922946,0.00022096577],"domain_scores_gemma":[0.99732155,0.00018559197,0.00016044496,0.002047147,0.00018026339,0.00010501647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100136356,0.00027258776,0.0003339519,0.0002617987,0.0006570926,0.000056819837,0.0005518095,0.000083943196,0.00005238893],"category_scores_gemma":[0.000014444053,0.00024463068,0.000120814795,0.00018853627,0.00026051304,0.00054251374,0.000003735836,0.00033690906,0.000014841756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015533184,0.0003040845,0.00014927798,0.000039430764,0.0007107083,0.000002615861,0.0013207217,0.98859996,0.0031931547,0.000013107001,0.000112161484,0.005399435],"study_design_scores_gemma":[0.018248638,0.008265399,0.090301566,0.005252384,0.0032828357,0.00020245675,0.0037311052,0.50511736,0.3592041,0.00025630544,0.0012677092,0.0048701526],"about_ca_topic_score_codex":0.00019962665,"about_ca_topic_score_gemma":0.00016898458,"teacher_disagreement_score":0.69523895,"about_ca_system_score_codex":0.00013575559,"about_ca_system_score_gemma":0.000047409776,"threshold_uncertainty_score":0.9975749},"labels":[],"label_agreement":null},{"id":"W2760934367","doi":"10.1109/tcomm.2017.2762671","title":"Triangular Constellations for Adaptive Modulation","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 Victoria","funders":"","keywords":"Quadrature amplitude modulation; Additive white Gaussian noise; Constellation diagram; Rayleigh fading; Link adaptation; Delta modulation; Modulation (music); Pulse-amplitude modulation; Mathematics; Phase-shift keying; Algorithm; Bit error rate; Spectral efficiency; Electronic engineering; Topology (electrical circuits); Computer science; Fading; White noise; Telecommunications; Physics; Statistics; Decoding methods; Acoustics; Channel (broadcasting); Engineering; Combinatorics","score_opus":0.070179575828978,"score_gpt":0.3184287914922459,"score_spread":0.2482492156632679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760934367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004344807,0.00015325569,0.98537123,0.00084021647,0.00021570649,0.00081235246,0.00017678471,0.0008633397,0.011132608],"genre_scores_gemma":[0.8985933,0.00082499575,0.09942791,0.00003514796,0.000019296875,0.00076022744,0.000026810894,0.00005222546,0.00026010792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917024,0.000053504056,0.000324826,0.00015903517,0.000108505265,0.00018388007],"domain_scores_gemma":[0.9949296,0.00042639728,0.00012248635,0.004283965,0.00016732508,0.00007018659],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00015164883,0.0001753264,0.00018764562,0.00016618251,0.0018972611,0.000102351376,0.001376649,0.0001191361,0.00002829463],"category_scores_gemma":[0.000021932636,0.00021001144,0.00014174587,0.000099466924,0.0002775398,0.0004500973,0.0000076112874,0.00030519644,0.00003386181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074981246,0.00044062073,0.000021853453,0.00004486713,0.00032260068,3.7161578e-7,0.00068824936,0.45434588,0.009509738,0.0473795,0.0015105808,0.48566073],"study_design_scores_gemma":[0.0008937584,0.00007984648,0.00028480712,0.0000790209,0.0000699458,0.000003629703,0.00013501069,0.93191105,0.033854596,0.010648616,0.021599682,0.0004400139],"about_ca_topic_score_codex":0.000019315918,"about_ca_topic_score_gemma":0.00011007524,"teacher_disagreement_score":0.8981588,"about_ca_system_score_codex":0.00012755256,"about_ca_system_score_gemma":0.000027604885,"threshold_uncertainty_score":0.9994021},"labels":[],"label_agreement":null},{"id":"W2762855506","doi":"10.1109/tcomm.2017.2761867","title":"Joint Relay Beamforming and Receiver Processing for Multi-Way Multi-Antenna Relay Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Relay; Beamforming; Computer science; Relay channel; Signal-to-noise ratio (imaging); Optimization problem; Channel state information; Channel (broadcasting); Interference (communication); Convex optimization; Electronic engineering; Power (physics); Algorithm; Telecommunications; Wireless; Mathematics; Engineering; Regular polygon","score_opus":0.16765956673449453,"score_gpt":0.35076821495119004,"score_spread":0.1831086482166955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762855506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046919758,0.0013040951,0.9924233,0.0042599007,0.00037015844,0.00062181434,0.000010947835,0.00022887775,0.0003117371],"genre_scores_gemma":[0.6551281,0.005151378,0.33832517,0.00023067393,0.000019155195,0.0002762217,0.0000049675928,0.000024161423,0.0008401512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844813,0.00019023349,0.00045396676,0.0004307989,0.00013650856,0.00034037305],"domain_scores_gemma":[0.9945745,0.0003083692,0.0003250285,0.0042977417,0.0003427728,0.00015160885],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00064904185,0.00024493676,0.00026683044,0.00016409456,0.0062838565,0.0006502469,0.0028379017,0.00013553047,0.0000067252695],"category_scores_gemma":[0.00006692229,0.0002446943,0.00013931148,0.00021672563,0.0003535068,0.0011345808,0.00010454392,0.0006620047,0.000012069322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036896345,0.0011395855,0.00013045345,0.000047489644,0.00014941917,0.0000016268947,0.0052684317,0.01439182,0.004075404,0.0068836883,0.00031769898,0.9675575],"study_design_scores_gemma":[0.0009885646,0.00005725923,0.0010872906,0.00021044796,0.000032456177,0.000010527332,0.00008552656,0.9910116,0.0006018523,0.000039004008,0.0055728033,0.0003026351],"about_ca_topic_score_codex":0.000026790578,"about_ca_topic_score_gemma":0.00066619675,"teacher_disagreement_score":0.97661984,"about_ca_system_score_codex":0.00009430917,"about_ca_system_score_gemma":0.0000749993,"threshold_uncertainty_score":0.9978344},"labels":[],"label_agreement":null},{"id":"W2766032087","doi":"10.1109/tcomm.2017.2768516","title":"Security Optimization of Exposure Region-Based Beamforming With a Uniform Circular Array","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":14,"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; Rice University","keywords":"Beamforming; Computer science; Wireless; Context (archaeology); Information leakage; Metric (unit); Algorithm; Topology (electrical circuits); Mathematical optimization; Mathematics; Engineering; Computer network; Telecommunications; Combinatorics","score_opus":0.02513715767388952,"score_gpt":0.2514067566561165,"score_spread":0.22626959898222698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766032087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004395427,0.00013335483,0.98778105,0.00066644524,0.000060455404,0.0004048043,0.00004371932,0.00059619546,0.00591854],"genre_scores_gemma":[0.93596655,0.0007605599,0.06292613,0.00002865699,0.00000675394,0.00021689691,0.000025601092,0.00005286818,0.00001600165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989906,0.00007585046,0.00037810171,0.00015527187,0.00021612755,0.00018402329],"domain_scores_gemma":[0.99384284,0.00017228564,0.00020990428,0.0054643094,0.00023295924,0.000077721175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018222621,0.00020594455,0.00024679684,0.0002302253,0.00094115717,0.00008480019,0.0018271678,0.0001452387,0.000021753318],"category_scores_gemma":[0.00001148984,0.00021830529,0.000110517525,0.0002181812,0.00038362414,0.00045421044,0.0000071100485,0.0005050965,0.000004387854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023001769,0.00032660787,0.0001077599,0.000096499105,0.00009547507,7.4578384e-7,0.00079875655,0.99372655,0.0013224934,0.0007807302,0.0000364249,0.002684964],"study_design_scores_gemma":[0.0013912462,0.00024544616,0.00025737027,0.0006851748,0.00017288962,0.000023182356,0.00046114423,0.8464883,0.14522155,0.00061549677,0.003666037,0.000772182],"about_ca_topic_score_codex":0.0000943593,"about_ca_topic_score_gemma":0.00027109013,"teacher_disagreement_score":0.9315711,"about_ca_system_score_codex":0.0001167641,"about_ca_system_score_gemma":0.000071361705,"threshold_uncertainty_score":0.89022315},"labels":[],"label_agreement":null},{"id":"W2767012393","doi":"10.1109/tcomm.2017.2765637","title":"Robust MISO Beamforming With Cooperative Jamming for Secure Transmission From Perspectives of QoS and Secrecy Rate","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":40,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Jamming; Artificial noise; Computer science; Quality of service; Transmission (telecommunications); Transmitter power output; Secure transmission; Precoding; Covariance; Mathematical optimization; Optimization problem; Signal-to-noise ratio (imaging); Secrecy; Computer network; Channel (broadcasting); MIMO; Transmitter; Telecommunications; Mathematics; Algorithm; Computer security","score_opus":0.03821635600304873,"score_gpt":0.27179020867265397,"score_spread":0.23357385266960523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767012393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03721639,0.0007447033,0.9589596,0.0009491381,0.0000461702,0.0006291503,0.00024052571,0.00026709068,0.00094727665],"genre_scores_gemma":[0.8838273,0.00354197,0.11222298,0.000011011397,0.0000136092385,0.00027691296,0.000023085631,0.00004474235,0.000038369297],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992005,0.00008125914,0.00027865337,0.00019031575,0.000097149925,0.00015207009],"domain_scores_gemma":[0.99700534,0.00049890723,0.000117773416,0.0020905335,0.00021320271,0.00007423626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016961983,0.00019880242,0.00026505586,0.00012410854,0.0011708697,0.000097418364,0.00091942097,0.00011540643,0.000019738976],"category_scores_gemma":[0.000012473138,0.00019452425,0.00007324759,0.00009405434,0.00035345965,0.0004425247,0.000009004041,0.00040171642,0.0000011368352],"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.00089421746,0.0023611665,0.0002135209,0.00074080203,0.002476037,0.0000024894928,0.20519929,0.20165972,0.24853769,0.016402153,0.00045922628,0.32105368],"study_design_scores_gemma":[0.00336491,0.00059885933,0.00078792626,0.0015371981,0.00041877967,0.000011938316,0.020238828,0.47057435,0.4894618,0.001542123,0.0102464715,0.0012168178],"about_ca_topic_score_codex":0.00017938564,"about_ca_topic_score_gemma":0.0005782913,"teacher_disagreement_score":0.84673655,"about_ca_system_score_codex":0.00006195738,"about_ca_system_score_gemma":0.000038290083,"threshold_uncertainty_score":0.9005502},"labels":[],"label_agreement":null},{"id":"W2769390761","doi":"10.1109/tcomm.2017.2776114","title":"Cooperative Secure Communication in Two-Hop Buffer-Aided Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":49,"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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Buffer (optical fiber); Hop (telecommunications); Spread spectrum; Telecommunications; Code division multiple access","score_opus":0.030481619510830667,"score_gpt":0.31254329822400323,"score_spread":0.28206167871317256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769390761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029195476,0.002735863,0.89881194,0.006627066,0.0005302261,0.0019442607,0.00015154884,0.0027630467,0.057240553],"genre_scores_gemma":[0.98055094,0.009203423,0.009149859,0.000109948756,0.000016698063,0.00070375914,0.000050397335,0.00007884712,0.00013614188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825144,0.00040143196,0.00058253197,0.00024040783,0.00019245039,0.0003317158],"domain_scores_gemma":[0.99002147,0.000533908,0.00015466547,0.008993543,0.0001860117,0.00011039237],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00047669697,0.00031346225,0.00035069956,0.000290143,0.0016279429,0.00029591055,0.004085281,0.00018553161,0.00008102621],"category_scores_gemma":[0.000028005345,0.00037010436,0.00012513358,0.00031949207,0.00052932726,0.0007353751,0.000047778627,0.0015676599,0.00007244728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096945834,0.0020617116,0.00054888986,0.00008346467,0.0004297061,0.0000069655775,0.0080381185,0.8611524,0.004622398,0.034261815,0.003568292,0.08512926],"study_design_scores_gemma":[0.0018245609,0.0000678832,0.0018573931,0.00049914385,0.000067112494,0.000018908344,0.00053256954,0.969468,0.012671,0.0022847797,0.009730679,0.0009779828],"about_ca_topic_score_codex":0.00047703672,"about_ca_topic_score_gemma":0.009415312,"teacher_disagreement_score":0.95135546,"about_ca_system_score_codex":0.00026673297,"about_ca_system_score_gemma":0.00004344394,"threshold_uncertainty_score":0.99987507},"labels":[],"label_agreement":null},{"id":"W2774657019","doi":"10.1109/tcomm.2017.2780833","title":"Robust Fairness Transceiver Design for a Full-Duplex MIMO Multi-Cell System","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","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":"Telecommunications link; Computer science; MIMO; Robustness (evolution); Beamforming; Channel state information; Optimization problem; Precoding; Base station; Maximization; Mathematical optimization; Transceiver; Algorithm; Wireless; Computer network; Telecommunications; Mathematics","score_opus":0.11939781567782852,"score_gpt":0.2769340351306583,"score_spread":0.15753621945282975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774657019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005532959,0.0005414696,0.9884876,0.0007946005,0.0005587452,0.0015701598,0.00042132544,0.0011347544,0.0009583815],"genre_scores_gemma":[0.8669782,0.0007068886,0.12925811,0.000020950209,0.000027935514,0.0021630914,0.000039383784,0.00014065692,0.0006647674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981555,0.0001932537,0.0006022923,0.00035525524,0.00021009891,0.00048365432],"domain_scores_gemma":[0.99126107,0.0007903411,0.00016623268,0.0073257377,0.0002610229,0.00019559544],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00035746078,0.00041703385,0.00041190966,0.00025291412,0.003272452,0.00029175583,0.003953287,0.00026222522,0.000037834503],"category_scores_gemma":[0.000017655506,0.00047887227,0.0003403132,0.00020810944,0.0003724686,0.0005108815,0.000013201595,0.0006919228,0.00019247305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000354867,0.00049749797,0.0000018791441,0.00016112589,0.00013774671,6.7720566e-7,0.00069231325,0.985156,0.008646112,0.00040246377,0.0004377036,0.0038309917],"study_design_scores_gemma":[0.0017728742,0.00006932988,0.000081658494,0.00016244323,0.00018453378,0.000011891361,0.00050135475,0.9833057,0.010274962,0.0000033857566,0.0031272057,0.00050465297],"about_ca_topic_score_codex":0.000117242926,"about_ca_topic_score_gemma":0.0009559025,"teacher_disagreement_score":0.86144525,"about_ca_system_score_codex":0.00031684007,"about_ca_system_score_gemma":0.000085847736,"threshold_uncertainty_score":0.9997663},"labels":[],"label_agreement":null},{"id":"W2777247283","doi":"10.1109/tcomm.2017.2786665","title":"On the Distribution Function of the Generalized Beckmann Random Variable and Its Applications in Communications","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Nanjing University of Posts and Telecommunications; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cumulative distribution function; Nakagami distribution; Rician fading; Random variable; Probability density function; Closed-form expression; Gaussian; Mathematics; Range (aeronautics); Computer science; Mathematical optimization; Applied mathematics; Algorithm; Mathematical analysis; Statistics; Engineering; Physics","score_opus":0.05474097748380429,"score_gpt":0.2795210171380336,"score_spread":0.22478003965422932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777247283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009729177,0.0001936176,0.96230555,0.02439043,0.00019401866,0.0013460194,0.00011648615,0.000084129526,0.0016405762],"genre_scores_gemma":[0.9959678,0.0004132578,0.0021949853,0.00016507604,0.0000102713375,0.0009885738,0.000026780981,0.000013609424,0.00021965826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815136,0.0005803175,0.0004917241,0.00030409347,0.00029177414,0.00018071459],"domain_scores_gemma":[0.98965436,0.0016783999,0.00046359035,0.007894542,0.0002536052,0.00005550442],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006725137,0.00017708406,0.00019751779,0.00011266893,0.003268737,0.00021519417,0.0047415784,0.00010997759,0.000012294445],"category_scores_gemma":[0.00011904578,0.00012866112,0.00010701091,0.0005690087,0.00045337187,0.0004977395,0.00009621294,0.0005164253,0.000016982302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027587976,0.0005277693,0.000093711744,0.000010359624,0.000041888736,2.5214415e-8,0.00027981919,0.006719597,0.0034594897,0.9833791,0.000111057525,0.005349595],"study_design_scores_gemma":[0.0026511198,0.00011709703,0.03664558,0.00024730872,0.00014530538,0.0000050344356,0.00017206307,0.87551594,0.011425747,0.06265366,0.009917678,0.00050348847],"about_ca_topic_score_codex":0.00014444745,"about_ca_topic_score_gemma":0.00033094367,"teacher_disagreement_score":0.9862386,"about_ca_system_score_codex":0.0001195723,"about_ca_system_score_gemma":0.000107848566,"threshold_uncertainty_score":0.9980289},"labels":[],"label_agreement":null},{"id":"W2777541168","doi":"10.1109/tcomm.2017.2785765","title":"Cheat-Proof Distributed Power Control in Full-Duplex Small Cell Networks: A Repeated Game With Imperfect Public Monitoring","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Repeated game; Nash equilibrium; Distributed algorithm; Mathematical optimization; Stackelberg competition; Game theory; Power control; Non-cooperative game; Duplex (building); Private information retrieval; Power (physics); Mathematical economics; Distributed computing; Mathematics; Computer security","score_opus":0.04956796327051696,"score_gpt":0.2771206207554552,"score_spread":0.22755265748493822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777541168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023435108,0.00060275785,0.96761096,0.006253264,0.00024201834,0.0006219262,0.000021878714,0.00026012526,0.00095194177],"genre_scores_gemma":[0.9919522,0.0016200445,0.005814306,0.0001081494,0.000020629197,0.00028540322,0.000013344068,0.00002956414,0.000156383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788,0.0005140497,0.0004385103,0.0004704501,0.00021118645,0.00048585102],"domain_scores_gemma":[0.9913984,0.0004878947,0.00028387908,0.0072788554,0.0003588016,0.00019215672],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005517423,0.0003028319,0.00033482537,0.00023797629,0.0019328871,0.0007948761,0.004978254,0.00013316843,0.000024584258],"category_scores_gemma":[0.000033758668,0.00028726793,0.00012593046,0.0007011896,0.0002676379,0.00080812105,0.00007588164,0.0009805014,0.000021902959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072758656,0.011383096,0.012100323,0.00007980644,0.00094972795,0.00006511152,0.009269131,0.60857993,0.017624347,0.0106541095,0.0006279579,0.32793888],"study_design_scores_gemma":[0.0033240088,0.0003209077,0.010443329,0.00024630202,0.000042074094,0.000023514813,0.00015151061,0.9798163,0.0021993874,0.000029884337,0.002759404,0.00064336247],"about_ca_topic_score_codex":0.0000689848,"about_ca_topic_score_gemma":0.0011147656,"teacher_disagreement_score":0.96851707,"about_ca_system_score_codex":0.00022657202,"about_ca_system_score_gemma":0.00016226823,"threshold_uncertainty_score":0.9999579},"labels":[],"label_agreement":null},{"id":"W2778278155","doi":"10.1109/tcomm.2017.2787568","title":"Joint Optimal Mode Switching and Power Adaptation for Nonlinear Energy Harvesting SWIPT System Over Fading Channel","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Maximum power transfer theorem; Fading; Transmitter; Energy harvesting; Channel (broadcasting); Nonlinear system; Computer science; Electronic engineering; Transmitter power output; Power (physics); Control theory (sociology); Wireless; Energy (signal processing); Decoding methods; Engineering; Telecommunications; Mathematics; Physics","score_opus":0.04078802545739735,"score_gpt":0.2628997440097425,"score_spread":0.22211171855234513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778278155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02175634,0.00018355023,0.97508293,0.00014852163,0.0005552528,0.00018590358,0.00006606174,0.0005425053,0.0014789527],"genre_scores_gemma":[0.9424742,0.0002134613,0.05670514,0.0000215399,0.00007281491,0.00026007986,0.000018753502,0.00008883163,0.00014521547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890643,0.000051581483,0.0003785853,0.00023750795,0.00012931363,0.00029658366],"domain_scores_gemma":[0.9977741,0.0003472707,0.00014810816,0.0015256839,0.000092805625,0.000112020556],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00021863244,0.00023506746,0.00023944568,0.00014860468,0.0018886244,0.0002829636,0.0005804392,0.00014627166,0.0000023285484],"category_scores_gemma":[0.000025408988,0.00027390796,0.00010046228,0.00008038047,0.000083899955,0.00052741583,0.000012682188,0.00037294318,0.0000025771897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007461506,0.000036020978,0.0000028659342,0.000052153617,0.00007384001,6.125468e-7,0.00057801855,0.98612845,0.002352144,0.0019220762,0.00002288668,0.0088234795],"study_design_scores_gemma":[0.00039733216,0.000031479245,0.00006767323,0.00039632682,0.000053278036,0.000012737862,0.00027192733,0.99490774,0.0029821254,0.000051892366,0.0005594049,0.00026808932],"about_ca_topic_score_codex":0.0003797578,"about_ca_topic_score_gemma":0.0007864079,"teacher_disagreement_score":0.92071784,"about_ca_system_score_codex":0.00014397252,"about_ca_system_score_gemma":0.000025822932,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W2780395788","doi":"10.1109/tcomm.2017.2788012","title":"On Base Station Coordination in Cache- and Energy Harvesting-Enabled HetNets: A Stochastic Geometry Study","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Macrocell; Stochastic geometry; Base station; Computer science; Cache; Coverage probability; Heterogeneous network; Transmission (telecommunications); Interference (communication); Cellular network; Computer network; Energy harvesting; Wireless network; Wireless; Energy (signal processing); Channel (broadcasting); Telecommunications; Mathematics; Statistics","score_opus":0.02547354959278848,"score_gpt":0.2719022820426341,"score_spread":0.24642873244984564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780395788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032099087,0.00007684954,0.96580195,0.00028065307,0.00023302317,0.00041663952,0.00004514519,0.00022335225,0.0008232984],"genre_scores_gemma":[0.9962881,0.000060331502,0.0026316966,0.000017931165,0.0000103215325,0.00041301988,0.00002321633,0.000046863013,0.0005085212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998979,0.00013081938,0.00034909768,0.00022325428,0.00013513037,0.00018271315],"domain_scores_gemma":[0.99775153,0.00039236568,0.000116709205,0.0015782036,0.000089137,0.00007204953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002354372,0.00018871827,0.0001950481,0.00044153797,0.00073884596,0.00013378235,0.000409634,0.000081009064,0.000011502233],"category_scores_gemma":[0.000075270495,0.00022259666,0.000029308061,0.00025915407,0.000079087185,0.0005539943,0.0000063203734,0.0003106848,0.00001002333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018015433,0.00038829792,0.00004440085,0.000015961066,0.000033059758,0.0000011910405,0.0005746682,0.98587155,0.00038699282,0.0005643306,0.000026701984,0.012074847],"study_design_scores_gemma":[0.0017499072,0.00020315866,0.0021292886,0.00015898493,0.000050826682,0.000005311241,0.0007254088,0.99369484,0.0004505733,0.0004190411,0.00007819187,0.00033448625],"about_ca_topic_score_codex":0.0006776544,"about_ca_topic_score_gemma":0.005108884,"teacher_disagreement_score":0.964189,"about_ca_system_score_codex":0.00023083367,"about_ca_system_score_gemma":0.000022046885,"threshold_uncertainty_score":0.90772283},"labels":[],"label_agreement":null},{"id":"W2782666205","doi":"10.1109/tcomm.2017.2789211","title":"Stair Matrix and Its Applications to Massive MIMO Uplink Data Detection","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Development Corporation of Newfoundland and Labrador","keywords":"MIMO; Telecommunications link; Diagonal; Computer science; Algorithm; Matrix (chemical analysis); Computational complexity theory; Base station; Convergence (economics); Iterative method; Channel (broadcasting); Performance improvement; Transmission (telecommunications); Data transmission; Diagonal matrix; Mathematical optimization; Computer engineering; Mathematics; Telecommunications; Engineering; Computer network","score_opus":0.04023690209758715,"score_gpt":0.311482366768363,"score_spread":0.2712454646707758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782666205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038701674,0.000445699,0.99570024,0.0004874274,0.0002362134,0.00093740027,0.00025200122,0.0006147299,0.0009392608],"genre_scores_gemma":[0.96030444,0.0006751507,0.037719984,0.00003787266,0.000072158036,0.00067185,0.000054654814,0.00006003616,0.0004038403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990366,0.000049832175,0.0003162231,0.0002972264,0.00009663762,0.00020346488],"domain_scores_gemma":[0.99688196,0.00017550094,0.000048662518,0.0025676591,0.00018792538,0.00013827138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012469038,0.0001771452,0.00014860548,0.00024424377,0.000615404,0.00005199059,0.00081551465,0.00010356134,0.000031709835],"category_scores_gemma":[0.000012140112,0.00021043811,0.000027400323,0.00063668675,0.000080462945,0.00041243542,0.000019613919,0.00026324842,0.00034843464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056348643,0.0004088768,0.0000063777343,0.00017973367,0.0003211308,7.2390185e-7,0.0018488963,0.6816161,0.0786253,0.0026137065,0.0011034943,0.2332193],"study_design_scores_gemma":[0.00037272528,0.000100150224,0.000022136821,0.00006136767,0.000090901434,0.000014326431,0.0002819579,0.9304683,0.026680095,0.00020317004,0.04128161,0.00042320968],"about_ca_topic_score_codex":0.000017792607,"about_ca_topic_score_gemma":0.00049698795,"teacher_disagreement_score":0.9599174,"about_ca_system_score_codex":0.00012327335,"about_ca_system_score_gemma":0.000022691589,"threshold_uncertainty_score":0.8581417},"labels":[],"label_agreement":null},{"id":"W2784065132","doi":"10.1109/tcomm.2017.2789221","title":"Design of Optimal Entropy-Constrained Unrestricted Polar Quantizer for Bivariate Circularly Symmetric Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Entropy (arrow of time); Algorithm; Cross-entropy method; Gaussian; Mathematical optimization; Combinatorics; Optimization problem; Discrete mathematics; Statistics; Quadratic assignment problem","score_opus":0.05727282685408157,"score_gpt":0.3120925061258664,"score_spread":0.25481967927178484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784065132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028875237,0.00014612073,0.997235,0.0006529761,0.00017709474,0.00075594836,0.00015451355,0.00049933116,0.00009024171],"genre_scores_gemma":[0.5086247,0.00011678524,0.4910017,0.000051632043,0.000010099843,0.00014212064,0.000008522195,0.000014205628,0.00003027976],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823177,0.00032467063,0.0005160973,0.00037272542,0.0002575967,0.0002971627],"domain_scores_gemma":[0.99460465,0.0013377238,0.00027469173,0.003213012,0.00046545404,0.00010445717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003696953,0.00020523439,0.00026805841,0.0006971565,0.0006679441,0.00009690672,0.0031245558,0.00011690888,0.00002053971],"category_scores_gemma":[0.00006544086,0.00020567882,0.00013887529,0.0016021234,0.0003933554,0.0006394745,0.00003468443,0.00027104258,0.000020329544],"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.00027406996,0.0039180387,0.00003508286,0.00008027499,0.0006579486,0.0000031571321,0.0027428693,0.017043423,0.5914198,0.2517313,0.0011258615,0.13096812],"study_design_scores_gemma":[0.0012853356,0.0009050849,0.00009377922,0.000116581345,0.000105016334,0.000020888714,0.0000810132,0.6857072,0.29976517,0.0077948626,0.0036107472,0.00051428255],"about_ca_topic_score_codex":0.00006629661,"about_ca_topic_score_gemma":0.000004682964,"teacher_disagreement_score":0.6686638,"about_ca_system_score_codex":0.000057768517,"about_ca_system_score_gemma":0.00016038364,"threshold_uncertainty_score":0.83873385},"labels":[],"label_agreement":null},{"id":"W2786400303","doi":"10.1109/tcomm.2018.2801789","title":"Efficient LTE/Wi-Fi Coexistence in Unlicensed Spectrum Using Virtual Network Entity: Optimization and Performance Analysis","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Networks and Protocols","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Spectrum management; Computer science; Computer network; Scheduling (production processes); Throughput; Time division multiple access; Optimization problem; Admission control; Duty cycle; Quality of service; Wireless; Cognitive radio; Mathematical optimization; Algorithm; Engineering; Telecommunications; Mathematics","score_opus":0.03563410528360565,"score_gpt":0.2854527882261712,"score_spread":0.24981868294256554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786400303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033536978,0.000046922585,0.9644682,0.00045252487,0.00015474253,0.0009275353,0.0000061943374,0.000092587834,0.00031435522],"genre_scores_gemma":[0.93100905,0.00016576314,0.06836392,0.00011663247,0.000038454717,0.00025066952,0.0000034662826,0.000009957459,0.000042077598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859685,0.00022650145,0.0003466611,0.00033477947,0.00019588614,0.00029934853],"domain_scores_gemma":[0.9978911,0.00019630707,0.0001248828,0.0016066706,0.00009594236,0.00008509581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041099015,0.00015478209,0.00021828007,0.00033043185,0.0008937565,0.0001792301,0.00096959417,0.00008210794,0.000028175433],"category_scores_gemma":[0.0000028204836,0.00016578285,0.00007706623,0.0027745857,0.00024215721,0.00023696452,0.00002963972,0.0002928407,0.000011461983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013766592,0.00014789103,0.00026105755,0.0000032946361,0.00004938033,3.386691e-7,0.00046081207,0.9943937,0.000017856337,0.0009473197,0.000006626471,0.0036979364],"study_design_scores_gemma":[0.00027259986,0.00013890158,0.0011414142,0.000060789338,0.00006290672,0.000004033869,0.000026670672,0.99774575,0.00017554687,0.00004437453,0.00015270998,0.00017432116],"about_ca_topic_score_codex":0.00013482907,"about_ca_topic_score_gemma":0.00076155143,"teacher_disagreement_score":0.8974721,"about_ca_system_score_codex":0.00009995755,"about_ca_system_score_gemma":0.000067259934,"threshold_uncertainty_score":0.6874143},"labels":[],"label_agreement":null},{"id":"W2788407677","doi":"10.1109/tcomm.2018.2858263","title":"Cost-Efficient QoS-Aware Data Acquisition Point Placement for Advanced Metering Infrastructure","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Smart Grid Security and Resilience","field":"Engineering","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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metering mode; Computer science; Quality of service; Point (geometry); Data quality; Computer security; Computer network; Business; Engineering; Service (business)","score_opus":0.05600881956924331,"score_gpt":0.3166498761207665,"score_spread":0.2606410565515232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788407677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008348332,0.0001469474,0.98781496,0.00046789576,0.0015296156,0.0006744893,0.00046882534,0.0002565685,0.00029238252],"genre_scores_gemma":[0.98130625,0.00026894893,0.017775271,0.00013179715,0.00012591504,0.00022897978,0.00010562901,0.000029197772,0.000028000384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991475,0.000036289588,0.00026523828,0.00019892295,0.00013978693,0.0002122835],"domain_scores_gemma":[0.9974775,0.0002003942,0.000042169202,0.0020795187,0.00012250217,0.00007793733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015773055,0.00015257375,0.00013622218,0.00012618091,0.00046589746,0.00004700787,0.0010760382,0.00007804025,0.00007080339],"category_scores_gemma":[0.000007256772,0.00015512962,0.000059722082,0.00023812252,0.00012474526,0.00023199533,0.00001531305,0.00023255487,0.000042092284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006795533,0.00017003468,8.9143975e-7,0.000043574062,0.000089879904,4.195533e-7,0.0013224923,0.9690672,0.0072210752,0.00009268943,0.0030142188,0.018909583],"study_design_scores_gemma":[0.00088492624,0.00018936538,0.000066725275,0.00010932076,0.00008581286,0.000011396788,0.0008800647,0.92088366,0.023225842,0.00006892646,0.053276822,0.00031715046],"about_ca_topic_score_codex":0.0000041909834,"about_ca_topic_score_gemma":0.00011386045,"teacher_disagreement_score":0.9729579,"about_ca_system_score_codex":0.00014526161,"about_ca_system_score_gemma":0.000028295912,"threshold_uncertainty_score":0.63260025},"labels":[],"label_agreement":null},{"id":"W2790037810","doi":"10.1109/tcomm.2018.2816070","title":"Index Mapping for Bit-Error Resilient Multiple Description Lattice Vector Quantizer","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"Voronoi diagram; Algorithm; Decoding methods; Binary number; Coset; Hamming distance; Computer science; Lattice (music); Error detection and correction; Hamming bound; Mathematics; Binary erasure channel; Topology (electrical circuits); Channel (broadcasting); Theoretical computer science; Discrete mathematics; Hamming code; Block code; Combinatorics; Channel capacity; Arithmetic; Geometry; Telecommunications","score_opus":0.10861044294155325,"score_gpt":0.3431401829890115,"score_spread":0.23452974004745825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790037810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093611516,0.00006553625,0.99436635,0.0021117786,0.00050368137,0.0007289679,0.00008368102,0.00083284854,0.00037103833],"genre_scores_gemma":[0.589029,0.00007023549,0.40995803,0.00023464963,0.00002560786,0.00041153148,0.000010019291,0.000017611164,0.00024330002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998458,0.00017489876,0.00040332752,0.0004328156,0.00022883866,0.00030207096],"domain_scores_gemma":[0.9949626,0.0007016716,0.00015822548,0.0037177606,0.0003510429,0.0001087284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000299765,0.00019160385,0.00018101427,0.00032655726,0.0011545684,0.00013399424,0.0024267263,0.000108360735,0.000021075162],"category_scores_gemma":[0.000052209885,0.00019743956,0.00011806228,0.0006661508,0.00023220411,0.00094918744,0.00004339547,0.0003202147,0.00009282918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005927851,0.0069883885,0.00046168748,0.00022167427,0.00047562085,0.0000041508006,0.010178136,0.0057959934,0.29150194,0.12780951,0.0336079,0.52236223],"study_design_scores_gemma":[0.0010968496,0.0003690888,0.0011280165,0.00022091868,0.000032096865,0.000013450352,0.00019496343,0.77293116,0.09574584,0.00797552,0.11968796,0.00060414965],"about_ca_topic_score_codex":0.000078891084,"about_ca_topic_score_gemma":0.00035759143,"teacher_disagreement_score":0.76713514,"about_ca_system_score_codex":0.00012845013,"about_ca_system_score_gemma":0.00006966582,"threshold_uncertainty_score":0.88801235},"labels":[],"label_agreement":null},{"id":"W2792934834","doi":"10.1109/tcomm.2018.2799217","title":"Wireless Power Transfer in mmWave Massive MIMO Systems With/Without Rain Attenuation","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; MIMO; Fading; Channel (broadcasting); Wireless; Path loss; RADIUS; Attenuation; Energy (signal processing); Computer science; Electronic engineering; Topology (electrical circuits); Electrical engineering; Physics; Telecommunications; Computer network; Mathematics; Engineering; Statistics","score_opus":0.020394160950649883,"score_gpt":0.24066975886303424,"score_spread":0.22027559791238435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792934834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12098786,0.0001608866,0.86796486,0.00038412842,0.0006389996,0.00049366354,0.000042565047,0.00060608215,0.008720959],"genre_scores_gemma":[0.99679077,0.00021490768,0.0020592576,0.000048484257,0.00005120609,0.00040629404,0.000017797332,0.00009308384,0.00031818065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859923,0.00019246334,0.00041547944,0.00024309503,0.00021703952,0.0003326986],"domain_scores_gemma":[0.9979446,0.00031577126,0.000035291163,0.001455345,0.00015379171,0.000095224146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021679202,0.00025816372,0.00026098668,0.00027830625,0.00030566318,0.00007211389,0.00058900844,0.00018619644,0.00004077046],"category_scores_gemma":[0.0000037501748,0.00026373437,0.00006227711,0.0006752431,0.00029054328,0.0002410284,0.0000025177246,0.00063065917,0.00008092526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005101914,0.0002677577,0.00023554554,0.000041166128,0.00015688116,0.000003686884,0.0022752944,0.98645973,0.003895486,0.0016373615,0.00020095125,0.004775147],"study_design_scores_gemma":[0.001569827,0.0002403759,0.0011715445,0.0008399419,0.00008848078,0.000028980872,0.0007039075,0.98280036,0.008561464,0.000054449305,0.003158434,0.0007822131],"about_ca_topic_score_codex":0.00014450072,"about_ca_topic_score_gemma":0.0027991307,"teacher_disagreement_score":0.87580293,"about_ca_system_score_codex":0.00021442396,"about_ca_system_score_gemma":0.00004526058,"threshold_uncertainty_score":0.99998146},"labels":[],"label_agreement":null},{"id":"W2796862611","doi":"10.1109/tcomm.2018.2854613","title":"Unified Analysis and Optimization of D2D Communications in Cellular Networks Over Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Fading; Cellular network; Telecommunications link; Computer science; Stochastic geometry; Power control; Spectral efficiency; Transmitter power output; Cellular communication; Interference (communication); Electronic engineering; Signal-to-noise ratio (imaging); Computer network; Telecommunications; Power (physics); Base station; Engineering; Transmitter; Mathematics; Channel (broadcasting); Statistics","score_opus":0.023220725895469158,"score_gpt":0.2619273742864944,"score_spread":0.2387066483910252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796862611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020174328,0.0004308319,0.99564856,0.000090913425,0.00015239614,0.00032337965,0.000028132807,0.000168403,0.0011399764],"genre_scores_gemma":[0.94245285,0.0022166101,0.055054735,0.000014664465,0.000015164338,0.000098098964,0.00005769553,0.000037009173,0.000053166525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988771,0.00015250337,0.00051875436,0.00017335414,0.00009313394,0.00018516702],"domain_scores_gemma":[0.99732333,0.00027497014,0.0001082756,0.0020870275,0.00014415366,0.000062267005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021641643,0.00016841349,0.00028584292,0.0007387176,0.00028035982,0.000030154142,0.0005948328,0.00013550124,0.000040286188],"category_scores_gemma":[0.0000053952645,0.00020579742,0.00008076665,0.0020977836,0.00027536773,0.00028499457,0.000012743313,0.0002954337,0.0000035970595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055863743,0.00008184627,0.000082508384,0.000011717579,0.00015219176,8.4342496e-8,0.00065943855,0.9964786,0.00071558135,0.00020291464,0.0000064141627,0.0016030852],"study_design_scores_gemma":[0.00029614646,0.000026581754,0.00007812801,0.000055749708,0.0001760619,8.315541e-7,0.00014320979,0.996683,0.0022408213,0.000047151676,0.00008346305,0.00016885402],"about_ca_topic_score_codex":0.00012826493,"about_ca_topic_score_gemma":0.0010100747,"teacher_disagreement_score":0.9405938,"about_ca_system_score_codex":0.00010772062,"about_ca_system_score_gemma":0.000014530096,"threshold_uncertainty_score":0.8392175},"labels":[],"label_agreement":null},{"id":"W2802514696","doi":"10.1109/tcomm.2018.2832207","title":"Decoder Partitioning: Towards Practical List Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McGill University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Decoding methods; Computer science; List decoding; Sequential decoding; Polar; Algorithm; Concatenated error correction code; Electronic engineering; Theoretical computer science; Parallel computing; Block code; Engineering","score_opus":0.08444422761163856,"score_gpt":0.3729335643544408,"score_spread":0.28848933674280225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802514696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025053385,0.000043984204,0.9832316,0.004667604,0.00033699683,0.00018388775,0.000016193526,0.0006235609,0.008390844],"genre_scores_gemma":[0.6493921,0.0000833818,0.35018042,0.00016442366,0.00001729476,0.000051067065,0.0000017074567,0.000012485691,0.00009706224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985056,0.00027294195,0.00041995407,0.00028929324,0.0002665105,0.00024571046],"domain_scores_gemma":[0.99592924,0.00064069196,0.00018266722,0.0027271681,0.0004197147,0.00010051113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005218005,0.00015592971,0.00019726079,0.00024850154,0.00074712065,0.00010705225,0.0016448234,0.00010460791,0.00006755211],"category_scores_gemma":[0.00009136981,0.00016793342,0.00012454473,0.00071680505,0.00041515342,0.0005967544,0.000032080814,0.0004351085,0.00006474969],"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.00019163953,0.0093130125,0.0017739213,0.00014984384,0.0008265071,0.000015728365,0.023418244,0.00088586425,0.06622728,0.49633235,0.01622677,0.38463885],"study_design_scores_gemma":[0.00069521205,0.001068651,0.00083589833,0.0003491894,0.00013625213,0.00018548306,0.0003974564,0.31546453,0.64052993,0.019748844,0.01962496,0.0009636087],"about_ca_topic_score_codex":0.00030503728,"about_ca_topic_score_gemma":0.001103743,"teacher_disagreement_score":0.6468868,"about_ca_system_score_codex":0.00009602477,"about_ca_system_score_gemma":0.00019961222,"threshold_uncertainty_score":0.6848126},"labels":[],"label_agreement":null},{"id":"W2803003303","doi":"10.1109/tcomm.2018.2827053","title":"Improving the Update Complexity of Locally Repairable Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Direct-sequence spread spectrum; Locality; Distributed data store; Code (set theory); Distributed computing; Spread spectrum; RAID; Parallel computing; Operating system; Computer network; Code division multiple access; Programming language","score_opus":0.06153721891667427,"score_gpt":0.29612880835058936,"score_spread":0.2345915894339151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803003303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004860866,0.00009859771,0.99312115,0.0043503963,0.00014980775,0.00019855396,0.000057239977,0.000585529,0.0009526288],"genre_scores_gemma":[0.6776385,0.00011339037,0.32197556,0.0001689227,0.0000054112847,0.000039713806,0.0000023798123,0.000006600215,0.000049562703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898773,0.00012522361,0.0002925144,0.00023323103,0.00017263989,0.00018864362],"domain_scores_gemma":[0.9936872,0.0003034826,0.00016033764,0.005597496,0.00021961972,0.000031830183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003022397,0.00011593728,0.00014057898,0.00011248184,0.0008933329,0.000053161224,0.0042822757,0.000056980334,0.00001728123],"category_scores_gemma":[0.000031099495,0.000092896364,0.00006952617,0.0006824282,0.0018991228,0.00048834144,0.00007241282,0.00033991228,0.00007268675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032826392,0.0008376354,0.0000133355425,0.000026458229,0.00012899152,0.0000013730364,0.0012397435,0.0018866683,0.016495567,0.65889066,0.0014856274,0.31896114],"study_design_scores_gemma":[0.0006918976,0.0005819102,0.00022526958,0.00010141463,0.000070768845,0.00004383373,0.0005556009,0.5714516,0.29621452,0.10840129,0.021053229,0.0006086413],"about_ca_topic_score_codex":0.00019536848,"about_ca_topic_score_gemma":0.000743157,"teacher_disagreement_score":0.67715234,"about_ca_system_score_codex":0.00005379553,"about_ca_system_score_gemma":0.000073634204,"threshold_uncertainty_score":0.7957605},"labels":[],"label_agreement":null},{"id":"W2807209692","doi":"10.1109/tcomm.2019.2906622","title":"UAV-Enabled Communication Using NOMA","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":2,"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":"Institute for Computational Science and Technology; Queen's University; Queen's University Belfast; British Council; Royal Society; Australian Research Council; King Fahd University of Petroleum and Minerals; Royal Academy of Engineering; Newton Fund; National Science Foundation","keywords":"Beamwidth; Computer science; Optimization problem; Base station; Transmitter power output; Dirty paper coding; Convex optimization; Wireless; Mathematical optimization; Bandwidth (computing); Real-time computing; Computer network; Algorithm; Antenna (radio); Telecommunications; Channel (broadcasting); MIMO; Regular polygon; Mathematics; Precoding","score_opus":0.03897177894309839,"score_gpt":0.26767038077322597,"score_spread":0.22869860183012758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807209692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005663824,0.0013978856,0.97556233,0.000469084,0.0007288632,0.001346912,0.00034086406,0.0010649068,0.013425329],"genre_scores_gemma":[0.92669165,0.006502224,0.06499863,0.0000759133,0.000034667475,0.0006496668,0.0003727593,0.00015946162,0.00051505014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819726,0.00017853081,0.00068096357,0.00038043782,0.00024396053,0.00031884064],"domain_scores_gemma":[0.9924032,0.00026545263,0.00017999132,0.0067965165,0.0002433562,0.000111497604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023081743,0.00044907324,0.00042580476,0.00043865127,0.00062840566,0.00019613665,0.002030716,0.00052898674,0.00017038902],"category_scores_gemma":[0.000004093208,0.000549849,0.00025248746,0.0005235576,0.0001569331,0.00022303361,0.000048015107,0.0016791936,0.0003193998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052915443,0.0001887607,0.000007139897,0.00008999268,0.00014561192,1.2316282e-7,0.000269799,0.9947698,0.0004923305,0.00039449226,0.0004901538,0.0031465169],"study_design_scores_gemma":[0.00031900758,0.000015888323,0.000051663515,0.00024073827,0.00021027973,0.0000055680257,0.00009638836,0.990448,0.0015942177,0.00081140036,0.005644876,0.00056199706],"about_ca_topic_score_codex":0.00019152851,"about_ca_topic_score_gemma":0.00019832232,"teacher_disagreement_score":0.9210278,"about_ca_system_score_codex":0.0005053472,"about_ca_system_score_gemma":0.0001496997,"threshold_uncertainty_score":0.9996953},"labels":[],"label_agreement":null},{"id":"W2809074861","doi":"10.1109/tcomm.2018.2848271","title":"Optimum ConvergeCast Scheduling in Wireless Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Schedule; Real-time computing; Upper and lower bounds; Computer network; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.027679195477960467,"score_gpt":0.26718935985903997,"score_spread":0.2395101643810795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809074861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017461518,0.00008296627,0.9765063,0.0017078742,0.0009325682,0.00021119736,0.000004045565,0.0003776691,0.0027158845],"genre_scores_gemma":[0.90283346,0.0003466388,0.09603433,0.00034890237,0.000068148925,0.00006721207,0.0000039584074,0.000028828275,0.0002685386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980311,0.00031147248,0.000459766,0.00046521836,0.00024476147,0.00048768206],"domain_scores_gemma":[0.9957456,0.0005117717,0.00011786597,0.0032855528,0.00019756133,0.00014166627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033658074,0.00023699513,0.00024016827,0.00034183392,0.0006994166,0.00014667469,0.002490283,0.00017776125,0.000034531946],"category_scores_gemma":[0.000005722889,0.0002636982,0.00011289784,0.001483405,0.00039728498,0.00036449727,0.000031858297,0.0007403172,0.00015928104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013863065,0.00046691505,0.00004598201,0.0000030655785,0.000028663719,0.000004075415,0.00044609018,0.9735986,0.00045063454,0.008426189,0.000057212124,0.016458701],"study_design_scores_gemma":[0.00040936482,0.00007584009,0.00011912715,0.00007958147,0.000009182397,0.000015250617,0.00006573626,0.99586856,0.0023261213,0.000048635968,0.0007104008,0.00027216828],"about_ca_topic_score_codex":0.00008641851,"about_ca_topic_score_gemma":0.0005602864,"teacher_disagreement_score":0.8853719,"about_ca_system_score_codex":0.00013787481,"about_ca_system_score_gemma":0.00007143996,"threshold_uncertainty_score":0.9999815},"labels":[],"label_agreement":null},{"id":"W2883352791","doi":"10.1109/tcomm.2018.2855193","title":"Optimizing the MIMO Cellular Downlink: Multiplexing, Diversity, or Interference Nulling?","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Spatial multiplexing; Telecommunications link; Beamforming; Computer science; MIMO; Multiplexing; Interference (communication); Base station; Context (archaeology); Cellular network; Stochastic geometry; Antenna diversity; Enhanced Data Rates for GSM Evolution; Electronic engineering; Antenna (radio); Computer network; Engineering; Telecommunications; Mathematics; Channel (broadcasting)","score_opus":0.04885017103795134,"score_gpt":0.2682494096700022,"score_spread":0.21939923863205088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883352791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083599816,0.00016698005,0.9940257,0.00029832617,0.00062889763,0.000353577,0.0000452953,0.0005584722,0.0030867383],"genre_scores_gemma":[0.95635307,0.00046833913,0.042474773,0.00006546083,0.0000582034,0.00008022009,0.000010585206,0.00004009128,0.00044928226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907565,0.000093889445,0.00029726964,0.00017978443,0.000120683944,0.00023271173],"domain_scores_gemma":[0.9977219,0.00030788576,0.00006018392,0.0016887492,0.00015237159,0.00006890402],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00015300863,0.00018979608,0.00015049311,0.00013459421,0.0015191985,0.00006267259,0.0011994061,0.000097192744,0.00014723316],"category_scores_gemma":[0.000011159899,0.00015582038,0.00008251747,0.00043431978,0.00028058846,0.0002578656,0.000030142783,0.00044253666,0.00019835176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038176044,0.00015213656,0.000013500775,0.000028670423,0.00013445839,0.0000011109364,0.007374178,0.9783005,0.0061036595,0.00023791216,0.00039637208,0.007219341],"study_design_scores_gemma":[0.0004894726,0.00010309148,0.000008462181,0.00015621528,0.00007376841,0.00000978902,0.0010646611,0.95831054,0.033505812,0.00011652647,0.005798818,0.00036282948],"about_ca_topic_score_codex":0.000064998094,"about_ca_topic_score_gemma":0.00090372626,"teacher_disagreement_score":0.95551705,"about_ca_system_score_codex":0.00013200691,"about_ca_system_score_gemma":0.000022064656,"threshold_uncertainty_score":0.9997807},"labels":[],"label_agreement":null},{"id":"W2883569077","doi":"10.1109/tcomm.2018.2859937","title":"Distributed Massive MIMO Systems With Non-Reciprocal Channels: Impacts and Robust Beamforming","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Telecommunications link; Beamforming; Precoding; MIMO; Computer science; Maximization; Overhead (engineering); Channel (broadcasting); Sensitivity (control systems); Multiplexing; Channel state information; Calibration; Measure (data warehouse); Control theory (sociology); Electronic engineering; Algorithm; Real-time computing; Mathematics; Mathematical optimization; Wireless; Engineering; Statistics; Computer network; Telecommunications","score_opus":0.020988579502902633,"score_gpt":0.2397483013288274,"score_spread":0.21875972182592476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883569077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021475484,0.00031659563,0.99515325,0.000118507975,0.00038384373,0.0005305353,0.00013813158,0.00038318563,0.00082838343],"genre_scores_gemma":[0.9824657,0.00038804093,0.016598422,0.000012000267,0.000057629735,0.00026308643,0.000046730827,0.000059252416,0.00010916008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991106,0.00004165799,0.00028739125,0.0001830364,0.00011251968,0.00026482096],"domain_scores_gemma":[0.99850565,0.00013212433,0.00006821727,0.0009798812,0.00017845587,0.00013566339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009030282,0.00021465497,0.00021040521,0.00016143703,0.0005443981,0.000083279854,0.00030180777,0.00010905905,0.00000815586],"category_scores_gemma":[0.0000055058863,0.00020493908,0.00003301292,0.00044734168,0.00020320989,0.00039341516,0.000004227705,0.0002912766,0.000030161975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016017373,0.00005139251,0.0000073598753,0.000057125977,0.000080507576,6.0169054e-7,0.00062159356,0.9974867,0.0007130682,0.00005520727,0.00011138263,0.00079906103],"study_design_scores_gemma":[0.0005918892,0.00017382078,0.000025590132,0.00037799266,0.00006983394,0.000043235887,0.0009128976,0.99280965,0.0036166168,0.000011820335,0.0010484357,0.00031820242],"about_ca_topic_score_codex":0.000062299885,"about_ca_topic_score_gemma":0.0002520398,"teacher_disagreement_score":0.9803181,"about_ca_system_score_codex":0.0001701163,"about_ca_system_score_gemma":0.000028969014,"threshold_uncertainty_score":0.8357173},"labels":[],"label_agreement":null},{"id":"W2885059027","doi":"10.1109/tcomm.2018.2864281","title":"Partially Blind Joint Channel Estimation and Symbol Detection in Amplify-and-Forward Two-Way Relay Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Isfahan University of Technology; Iran National Science Foundation","keywords":"Algorithm; Channel (broadcasting); Relay; Block (permutation group theory); Convergence (economics); Computational complexity theory; Computer science; Detector; Mathematics; Reciprocal; Joint (building); Symbol (formal); Telecommunications; Engineering","score_opus":0.07112185769842491,"score_gpt":0.30747490699559554,"score_spread":0.23635304929717063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885059027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014301035,0.00052432204,0.9813353,0.0021270106,0.00032810518,0.0004899067,0.000005322227,0.00018757982,0.000701418],"genre_scores_gemma":[0.9896275,0.002344528,0.007469561,0.00014193536,0.000027541068,0.00026434124,0.0000039632146,0.000015237029,0.00010541051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983532,0.00047174352,0.00045238854,0.00033677812,0.00016334331,0.0002225781],"domain_scores_gemma":[0.9974491,0.00030637885,0.000127317,0.0018162425,0.00018479468,0.00011614343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006582937,0.00017953714,0.00020878855,0.00035989867,0.0010223308,0.00026473534,0.00074701273,0.00009822233,0.000006437626],"category_scores_gemma":[0.000023619032,0.00018822038,0.000040053437,0.00070904015,0.00025281997,0.0005672868,0.000046964604,0.0004780873,0.000043768963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010944879,0.0010090304,0.0000519345,0.00006172715,0.0001592245,0.0000022313673,0.01463488,0.05973262,0.011241212,0.04553346,0.00012507662,0.86733913],"study_design_scores_gemma":[0.00078343553,0.00014446957,0.0005632284,0.000114370996,0.000017880197,0.000027292308,0.00013006646,0.99400145,0.0027490484,0.00040308904,0.0008474045,0.00021826012],"about_ca_topic_score_codex":0.00012283117,"about_ca_topic_score_gemma":0.0025016773,"teacher_disagreement_score":0.9753264,"about_ca_system_score_codex":0.00010234146,"about_ca_system_score_gemma":0.000047766585,"threshold_uncertainty_score":0.78630453},"labels":[],"label_agreement":null},{"id":"W2885421144","doi":"10.1109/tcomm.2018.2885800","title":"Robust Distributed Compression of Symmetrically Correlated Gaussian Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Compression (physics); Gaussian; Computer science; Gaussian process; Electronic engineering; Engineering; Physics","score_opus":0.03926466377736963,"score_gpt":0.2615554079986081,"score_spread":0.22229074422123846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885421144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01071948,0.00037854476,0.9787353,0.000518482,0.00021093563,0.00031994842,0.00022936569,0.0013417432,0.007546174],"genre_scores_gemma":[0.9819879,0.0010888685,0.016633287,0.000029731476,0.000014252057,0.00008493133,0.00006511468,0.000043865017,0.00005204451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.00016731491,0.00052307866,0.00015207755,0.00021164968,0.00020426766],"domain_scores_gemma":[0.99643785,0.00041560014,0.00010757776,0.0026821163,0.00025620268,0.000100665355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016740254,0.00019110688,0.0002549335,0.0003756824,0.00041325635,0.00003279285,0.0014542823,0.00018049491,0.00012768482],"category_scores_gemma":[0.000014455063,0.000203402,0.00011380723,0.0011545126,0.00048741928,0.0001649529,0.000015768934,0.0005781882,0.0000713316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043826867,0.010532152,0.0009834686,0.0005768795,0.002389868,0.000005006937,0.014230402,0.44586167,0.14808762,0.029135088,0.034876566,0.312883],"study_design_scores_gemma":[0.0009753771,0.00033690274,0.0016568259,0.0005109371,0.00015791015,0.000016939552,0.00041385525,0.70238364,0.2615657,0.0007383751,0.030473866,0.00076966244],"about_ca_topic_score_codex":0.00007024906,"about_ca_topic_score_gemma":0.00012890066,"teacher_disagreement_score":0.9712684,"about_ca_system_score_codex":0.00009664248,"about_ca_system_score_gemma":0.000026971935,"threshold_uncertainty_score":0.8294493},"labels":[],"label_agreement":null},{"id":"W2886581636","doi":"10.1109/tcomm.2018.2873322","title":"Improved Bit-Flipping Algorithm for Successive Cancellation Decoding of Polar Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McGill University","funders":"","keywords":"Algorithm; Decoding methods; Computer science; Error detection and correction; Bit error rate; Sorting; List decoding; Code (set theory); Concatenated error correction code; Block code","score_opus":0.039094336960628716,"score_gpt":0.3243455029031874,"score_spread":0.2852511659425587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886581636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006019868,0.000082770704,0.9966458,0.0007450001,0.0004286408,0.00046301485,0.000052296997,0.00042309088,0.000557372],"genre_scores_gemma":[0.5533812,0.000057106132,0.44628754,0.000053648873,0.000021461914,0.00011040415,0.0000031758675,0.000011925845,0.00007354554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988911,0.00011328346,0.0003731707,0.0002716831,0.00013566589,0.00021507531],"domain_scores_gemma":[0.9964786,0.00083037885,0.00024853542,0.0018517232,0.00053468905,0.00005604045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035796987,0.00014257511,0.00018669193,0.00028435185,0.0007648907,0.00006641249,0.0016417215,0.00008848623,0.0000071506597],"category_scores_gemma":[0.000030984258,0.00015807764,0.000117404335,0.0006110684,0.00019365414,0.00041406613,0.000018119164,0.00021792499,0.000004832739],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017597458,0.00039700675,0.000028246932,0.000034807428,0.00011302783,1.9154916e-7,0.0034267877,0.00030937704,0.07029929,0.0055473815,0.00020470501,0.9196216],"study_design_scores_gemma":[0.0002076419,0.00020204175,0.000017434106,0.00007572523,0.000021550424,0.0000031706927,0.000072965304,0.77278084,0.22457808,0.0011714472,0.0007046523,0.00016447356],"about_ca_topic_score_codex":0.00044510458,"about_ca_topic_score_gemma":0.0011765262,"teacher_disagreement_score":0.91945714,"about_ca_system_score_codex":0.0001233296,"about_ca_system_score_gemma":0.00012556331,"threshold_uncertainty_score":0.6446219},"labels":[],"label_agreement":null},{"id":"W2887906137","doi":"10.1109/tcomm.2018.2881117","title":"Learning-Aided Physical Layer Authentication as an Intelligent Process","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":193,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Physical layer; Computer science; Authentication (law); Robustness (evolution); Authentication protocol; Lightweight Extensible Authentication Protocol; Distributed computing; Wireless","score_opus":0.03787961938960948,"score_gpt":0.336655443153291,"score_spread":0.2987758237636815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887906137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4905205,0.000089933965,0.48548797,0.0012328783,0.00027017476,0.0007871923,0.000026896407,0.004652125,0.016932312],"genre_scores_gemma":[0.9956302,0.00044642438,0.0030398204,0.00007744042,0.000055789886,0.00041899114,0.00003345039,0.00007317318,0.00022470062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987655,0.00021168226,0.00032759184,0.00022495055,0.00023398257,0.00023628221],"domain_scores_gemma":[0.9966355,0.00019076938,0.000063795575,0.0026786954,0.00029632737,0.00013491783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019277271,0.00021855715,0.00018802608,0.00023664079,0.00063511904,0.000086722146,0.0014359646,0.00012187704,0.00014938967],"category_scores_gemma":[0.000015060615,0.00024794764,0.000095934134,0.0005377483,0.00034971422,0.0004099291,0.00000914202,0.000763182,0.0007114732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003087268,0.012398444,0.00011438777,0.00030730892,0.0010390724,0.000002607997,0.16263574,0.076869585,0.19006798,0.062507525,0.0016460958,0.49210253],"study_design_scores_gemma":[0.00028152115,0.00052681717,0.00015374081,0.000097163924,0.000092269016,0.000013394186,0.0014225891,0.551665,0.42213228,0.008951472,0.014059964,0.00060374563],"about_ca_topic_score_codex":0.000039951956,"about_ca_topic_score_gemma":0.00015371786,"teacher_disagreement_score":0.5051097,"about_ca_system_score_codex":0.0001229294,"about_ca_system_score_gemma":0.00004290083,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W2888993486","doi":"10.1109/tcomm.2018.2867475","title":"Polar Codes: Bounds on Bhattacharyya Parameters and Their Applications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bhattacharyya distance; Upper and lower bounds; Merge (version control); Binary number; Binary symmetric channel; Cardinality (data modeling); Channel (broadcasting); Polar; Mathematics; Algorithm; Computer science; Topology (electrical circuits); Discrete mathematics; Channel capacity; Combinatorics; Telecommunications; Physics; Mathematical analysis; Arithmetic","score_opus":0.03945787012498194,"score_gpt":0.30332605850138084,"score_spread":0.2638681883763989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888993486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016999379,0.0000977524,0.9885783,0.003688794,0.00019158992,0.0004897505,0.000039917093,0.0010304836,0.004183484],"genre_scores_gemma":[0.90408313,0.00021224341,0.094139844,0.0008488126,0.000021197886,0.00048283537,0.000004722001,0.000023638655,0.00018358619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866915,0.00021096542,0.00027871874,0.0004261253,0.00015560204,0.0002594326],"domain_scores_gemma":[0.99504715,0.00075264834,0.00010532046,0.0038111338,0.00015854595,0.00012517204],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003137525,0.00022158338,0.00018089719,0.0003095201,0.0013532805,0.00019753558,0.0021400054,0.00010493502,0.000009938042],"category_scores_gemma":[0.000010940155,0.00021286916,0.00009294729,0.0007006478,0.00048586525,0.00033756165,0.000027992173,0.00050027284,0.00012869714],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101099846,0.0038675184,0.00016859973,0.000053226293,0.00043390368,0.0000018739504,0.0172444,0.00052411325,0.013067492,0.13021445,0.004312312,0.830011],"study_design_scores_gemma":[0.002090494,0.0045926673,0.001417432,0.00067078474,0.00021655436,0.00029655438,0.0020426305,0.35921207,0.31146613,0.07880209,0.23554796,0.0036446443],"about_ca_topic_score_codex":0.00011938596,"about_ca_topic_score_gemma":0.00036071095,"teacher_disagreement_score":0.9023832,"about_ca_system_score_codex":0.00009817342,"about_ca_system_score_gemma":0.000066953886,"threshold_uncertainty_score":0.99994683},"labels":[],"label_agreement":null},{"id":"W2889062623","doi":"10.1109/tcomm.2018.2867436","title":"Performance Analysis and Improvement of Online Fountain Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Beijing Council of Science and Technology; National Natural Science Foundation of China","keywords":"Fountain code; Fountain; Computer science; Telecommunications; Electronic engineering; Engineering; Decoding methods; Block code; Concatenated error correction code; History","score_opus":0.02961203989107317,"score_gpt":0.3069218964144205,"score_spread":0.27730985652334733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889062623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13263674,0.000023710674,0.865714,0.00066791766,0.00006448169,0.00012065207,0.000016705944,0.0001972746,0.0005585227],"genre_scores_gemma":[0.8427994,0.00027584942,0.15671352,0.00008249429,0.0000057103284,0.000030717118,0.000002416665,0.000005403409,0.00008444026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992296,0.000059942726,0.00025732527,0.00019267856,0.0001382663,0.00012217184],"domain_scores_gemma":[0.99741507,0.00019094282,0.0001092242,0.0020446763,0.00019700862,0.00004308755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024265451,0.000096856515,0.00015745191,0.00037003338,0.00034196008,0.000029908362,0.0011537214,0.00004178997,0.000009466453],"category_scores_gemma":[0.0000055745054,0.00009777515,0.00007221555,0.0011246573,0.00024510283,0.00021610537,0.000022447486,0.00017130961,0.0000046176337],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032450076,0.001974622,0.0036622728,0.000049515253,0.00090175524,3.8119745e-7,0.00446754,0.000687841,0.04670897,0.0041238945,0.000104558254,0.9372862],"study_design_scores_gemma":[0.00028769227,0.0010318763,0.0108476365,0.000067256675,0.00032989797,0.0000062750237,0.00015271497,0.7436309,0.24197257,0.0007437747,0.0006071251,0.0003222983],"about_ca_topic_score_codex":0.00026332826,"about_ca_topic_score_gemma":0.0019573274,"teacher_disagreement_score":0.9369639,"about_ca_system_score_codex":0.00004199971,"about_ca_system_score_gemma":0.000040991632,"threshold_uncertainty_score":0.3987155},"labels":[],"label_agreement":null},{"id":"W2890182058","doi":"10.1109/tcomm.2018.2869864","title":"Design of Optimal Scalar Quantizer for Sequential Coding of Correlated Sources","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Coding (social sciences); Algorithm; Scalar (mathematics); Electronic engineering; Mathematics; Control theory (sociology); Statistics; Engineering; Artificial intelligence","score_opus":0.08850073956349497,"score_gpt":0.3438400994164779,"score_spread":0.25533935985298295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890182058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000565684,0.000060866398,0.9981869,0.00022783186,0.0001595591,0.00042937114,0.00006726799,0.00020949403,0.00009302865],"genre_scores_gemma":[0.53070086,0.000087792665,0.46908477,0.000016404543,0.0000043633163,0.00006051898,0.0000035029766,0.000008082391,0.000033671415],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988846,0.00017151854,0.00041975503,0.00020798162,0.00016359542,0.00015252134],"domain_scores_gemma":[0.9965156,0.0007085788,0.00024203424,0.0021258127,0.00036217345,0.000045839217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994294,0.00011545539,0.00020041807,0.00021400278,0.0003634306,0.000023217728,0.0020336667,0.00008059365,0.000020150374],"category_scores_gemma":[0.00001866385,0.000116371746,0.0000925113,0.00042665147,0.00040656052,0.00038412525,0.000028823526,0.00016887572,0.000006810458],"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.0004005501,0.0023675554,0.000014313564,0.00010583011,0.00034760276,6.700542e-7,0.004613225,0.08151523,0.7588343,0.060499538,0.0019295126,0.08937165],"study_design_scores_gemma":[0.00028816354,0.0002752308,0.000005726541,0.000093278235,0.00002524648,0.0000034265781,0.0000342024,0.4016158,0.5958398,0.0010631402,0.0006488572,0.00010716248],"about_ca_topic_score_codex":0.00002276542,"about_ca_topic_score_gemma":0.000005717093,"teacher_disagreement_score":0.5301352,"about_ca_system_score_codex":0.000025489922,"about_ca_system_score_gemma":0.00007287839,"threshold_uncertainty_score":0.4745502},"labels":[],"label_agreement":null},{"id":"W2890765637","doi":"10.1109/tcomm.2018.2870875","title":"Stochastic Geometry-Based Modeling and Analysis of Massive MIMO-Enabled Millimeter Wave Cellular Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Path loss; Stochastic geometry; Beamwidth; Fading; Poisson point process; Computer science; Base station; Spatial multiplexing; Electronic engineering; Cellular network; Precoding; Moment-generating function; Topology (electrical circuits); 3G MIMO; Spectral efficiency; Extremely high frequency; Non-line-of-sight propagation; Antenna (radio); Computer network; Point process; Telecommunications; Wireless; Channel (broadcasting); Mathematics; Engineering; Random variable; Electrical engineering; Statistics","score_opus":0.03687239025430546,"score_gpt":0.24204921227441387,"score_spread":0.2051768220201084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890765637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043564916,0.00037081845,0.9552265,0.00009234085,0.00012591916,0.00020240594,0.00006374823,0.00013370637,0.00021964981],"genre_scores_gemma":[0.98007023,0.00019479096,0.0194902,0.000060593393,0.000016057518,0.000057746915,0.00004669276,0.000035832487,0.00002785929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892896,0.00007994023,0.00042905487,0.00019845484,0.00014750409,0.00021609598],"domain_scores_gemma":[0.99826854,0.00022307962,0.00006275921,0.0011232727,0.00022067252,0.000101648664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019292983,0.00018620444,0.00030284698,0.0008263985,0.00031177988,0.000034053814,0.00026451514,0.0001154384,0.000114372444],"category_scores_gemma":[0.0000066513403,0.00019933363,0.00017476376,0.0011184734,0.00014478044,0.000095845106,0.0000051262073,0.00029594664,0.00000789982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011042797,0.000060153838,0.0000015738035,0.000012272181,0.00052617665,1.5138407e-7,0.00021400067,0.98760307,0.009029154,0.000017860904,0.0000051983434,0.002519333],"study_design_scores_gemma":[0.00027081813,0.000048128233,0.00000736722,0.000036748766,0.0009117155,4.638716e-7,0.00007663519,0.98277223,0.015626654,0.00004927951,0.000013823308,0.00018613339],"about_ca_topic_score_codex":0.000039408224,"about_ca_topic_score_gemma":0.00010536052,"teacher_disagreement_score":0.9365053,"about_ca_system_score_codex":0.000054396092,"about_ca_system_score_gemma":0.000019868572,"threshold_uncertainty_score":0.812859},"labels":[],"label_agreement":null},{"id":"W2890830402","doi":"10.1109/tcomm.2018.2871448","title":"Hybrid mmWave MIMO-OFDM Channel Estimation Based on the Multi-Band Sparse Structure of Channel","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Estimator; Channel (broadcasting); Compressed sensing; MIMO; Computer science; Electronic engineering; MIMO-OFDM; Bandwidth (computing); Algorithm; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.05597804358014283,"score_gpt":0.26213347179651,"score_spread":0.20615542821636715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890830402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016859444,0.00005161216,0.98044413,0.0007947247,0.00033391025,0.00040099566,0.00022905906,0.00018023049,0.0007059],"genre_scores_gemma":[0.99004,0.000093229006,0.009418413,0.00022405536,0.00002860642,0.00006439227,0.000036900787,0.00004137651,0.000053028118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990463,0.000106102685,0.00033065447,0.00015891723,0.00017822142,0.00017979735],"domain_scores_gemma":[0.9980361,0.00023736522,0.000074868425,0.0014246159,0.00016217344,0.00006487077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015079613,0.00019076421,0.00016058751,0.00021480347,0.00046517013,0.000031153337,0.00048018503,0.00007627672,0.00013046457],"category_scores_gemma":[0.000015780166,0.0001632225,0.000101198595,0.00023418461,0.00017264155,0.000100335645,0.0000027997585,0.00036843529,0.000049944872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021822749,0.00019333973,5.0980276e-7,0.00003049376,0.00006284801,1.7076538e-7,0.0008569299,0.96277994,0.03156287,0.00006218069,0.00021573942,0.0042131436],"study_design_scores_gemma":[0.00025962444,0.000050878196,0.000009616934,0.000058889458,0.00003091948,0.0000017655692,0.000052379288,0.6859328,0.31315997,0.00023369868,0.00009812901,0.00011132533],"about_ca_topic_score_codex":0.000030661973,"about_ca_topic_score_gemma":0.00015022933,"teacher_disagreement_score":0.97318053,"about_ca_system_score_codex":0.00006024828,"about_ca_system_score_gemma":0.000029738861,"threshold_uncertainty_score":0.6656021},"labels":[],"label_agreement":null},{"id":"W2891340028","doi":"10.1109/tcomm.2018.2869820","title":"A Hierarchical Game With Strategy Evolution for Mobile Sponsored Content and Service Markets","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"York University","funders":"","keywords":"Mobile telephony; Game theory; Service (business); Computer science; Telecommunications; Business; Mobile radio; Marketing; Economics; Microeconomics","score_opus":0.051917396532306384,"score_gpt":0.24354219684632147,"score_spread":0.19162480031401508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891340028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8599693,0.000040800558,0.12649985,0.0014906917,0.00013442076,0.0008707768,0.00005418165,0.0001476317,0.010792315],"genre_scores_gemma":[0.9974762,0.000022082795,0.0011126027,0.000725969,0.00007552574,0.00028345265,0.000028775936,0.000020820016,0.0002545557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994117,0.0000032418636,0.00018496701,0.0001705583,0.000058401725,0.00017110341],"domain_scores_gemma":[0.9990358,0.0001167991,0.00007745008,0.0005576931,0.00019076957,0.000021508375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013523434,0.000119859156,0.00012338342,0.0001329465,0.0004190601,0.00031371805,0.0002727636,0.0000509815,0.00004691615],"category_scores_gemma":[0.000004348162,0.00010683313,0.000042065545,0.00020416746,0.00017530122,0.0014330073,0.000007550993,0.000120924684,0.00007999746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009803516,0.0066068918,0.0011045574,0.0009108158,0.0012617814,0.000004719011,0.0013913788,0.011285833,0.004038773,0.60561895,0.0028411103,0.35513166],"study_design_scores_gemma":[0.009149483,0.0012581846,0.022847202,0.00042515263,0.00063446595,0.000071735776,0.007715488,0.761561,0.0006264625,0.07372904,0.12000593,0.001975861],"about_ca_topic_score_codex":0.00019029604,"about_ca_topic_score_gemma":0.002864256,"teacher_disagreement_score":0.7502752,"about_ca_system_score_codex":0.00003698797,"about_ca_system_score_gemma":0.000028224867,"threshold_uncertainty_score":0.43565288},"labels":[],"label_agreement":null},{"id":"W2891725399","doi":"10.1109/tcomm.2018.2870378","title":"Interference and Outage Analysis of Random D2D Networks Underlaying Millimeter-Wave Cellular Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Huawei Technologies","keywords":"Stochastic geometry; Fading; Poisson point process; Path loss; Nakagami distribution; Topology (electrical circuits); Computer science; Power control; Cellular network; Coverage probability; Interference (communication); Transmitter power output; Node (physics); Signal-to-interference-plus-noise ratio; Electronic engineering; Transmitter; Point process; Computer network; Telecommunications; Physics; Mathematics; Power (physics); Engineering; Electrical engineering; Wireless; Statistics; Acoustics","score_opus":0.04733548736544642,"score_gpt":0.252116374281727,"score_spread":0.2047808869162806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891725399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029837085,0.0007683287,0.9677674,0.0000551692,0.00022881296,0.00019171761,0.000025982383,0.0001583159,0.0009671937],"genre_scores_gemma":[0.9928151,0.0020039955,0.004938706,0.00006127659,0.000024006815,0.000041195548,0.000026787713,0.000031621894,0.00005734964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887943,0.0001266766,0.00047440545,0.00019802956,0.000106359985,0.00021508707],"domain_scores_gemma":[0.9982355,0.0003347402,0.00007817706,0.0011256787,0.0001292091,0.00009668692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025771974,0.00019063446,0.00034152306,0.0004480751,0.00032220557,0.000048762256,0.0003224844,0.000121778954,0.00010148411],"category_scores_gemma":[0.0000039890238,0.00020192527,0.00017775832,0.0008087411,0.00022254075,0.00012040535,0.000009494514,0.00037190862,0.0000055312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032457698,0.000113101705,0.000023686567,0.000017713166,0.0012634852,4.2474466e-7,0.0010234233,0.958905,0.010475282,0.000036312445,0.00002491341,0.028084232],"study_design_scores_gemma":[0.00037831537,0.00005219012,0.00003859249,0.00004631803,0.00069893216,0.0000014876213,0.00014132955,0.98656064,0.011789181,0.000039062426,0.00006950484,0.00018445372],"about_ca_topic_score_codex":0.000041500658,"about_ca_topic_score_gemma":0.0003471632,"teacher_disagreement_score":0.962978,"about_ca_system_score_codex":0.00004431196,"about_ca_system_score_gemma":0.000010080343,"threshold_uncertainty_score":0.8234274},"labels":[],"label_agreement":null},{"id":"W2894564570","doi":"10.1109/tcomm.2018.2873735","title":"Joint User Scheduling and RRU Association for ODFMA-Based Networks With Inter-BBU Coordination","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; Scheduling (production processes); Joint (building); Association (psychology); Computer network; Distributed computing; Engineering; Operations management","score_opus":0.020691434397632675,"score_gpt":0.24778567525383596,"score_spread":0.22709424085620328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894564570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001137933,0.00007768008,0.9963745,0.00064421125,0.00027121304,0.0005779065,0.00003077364,0.00037585633,0.00050994655],"genre_scores_gemma":[0.9034835,0.000067112305,0.095657974,0.000058318365,0.00004810994,0.0003518494,0.000033685224,0.000052460906,0.00024698282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923414,0.000057276004,0.00027262207,0.00016080892,0.00008697301,0.0001882081],"domain_scores_gemma":[0.99860156,0.00029348876,0.000098933764,0.0006366724,0.000312877,0.00005648675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000209926,0.00015377635,0.00015768262,0.000166804,0.00044410996,0.000062996376,0.00017409996,0.00012045403,0.0000094324],"category_scores_gemma":[0.000016857894,0.00016348693,0.000045496414,0.00030400217,0.0000735353,0.0002703499,0.0000020364282,0.00022999066,0.000008416492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002017562,0.000059230482,0.000034888984,0.000023009274,0.00006708957,4.0208334e-8,0.00014776271,0.9950853,0.00075102644,0.00020654891,0.00018156534,0.0034233707],"study_design_scores_gemma":[0.0007289019,0.00012532448,0.000044232158,0.000117793905,0.000066376444,0.0000016729731,0.00009576042,0.99170697,0.0044490625,0.00004005834,0.0024344283,0.00018940175],"about_ca_topic_score_codex":0.000014944022,"about_ca_topic_score_gemma":0.00040212023,"teacher_disagreement_score":0.9023456,"about_ca_system_score_codex":0.00029696274,"about_ca_system_score_gemma":0.000022797265,"threshold_uncertainty_score":0.66668034},"labels":[],"label_agreement":null},{"id":"W2894957266","doi":"10.1109/tcomm.2018.2873345","title":"Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Encoder; Variable (mathematics); Sequence (biology); State (computer science); Computer science; Set (abstract data type); Code (set theory); Algorithm; Finite-state machine; Mathematics","score_opus":0.09192691104221765,"score_gpt":0.32281140746618825,"score_spread":0.2308844964239706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894957266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12460642,0.00004939784,0.86874384,0.00053273956,0.00019061072,0.0003785124,0.0003285228,0.000067942696,0.0051020267],"genre_scores_gemma":[0.89140505,0.000048553436,0.10777344,0.0003526869,0.0000633738,0.00009044387,0.00008889007,0.000013219376,0.00016436634],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990553,0.00014046325,0.0002237892,0.00027983962,0.000065787346,0.00023479555],"domain_scores_gemma":[0.9986695,0.00017571294,0.000070776136,0.0008481333,0.0001631158,0.00007273697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029766007,0.00014544534,0.0001315146,0.000041469826,0.000763853,0.00003707352,0.00056999776,0.00015220822,0.000019044235],"category_scores_gemma":[0.00004333241,0.00013396161,0.00009984981,0.00012702591,0.0004954712,0.00000662411,0.000011127374,0.00018711023,0.000010596593],"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.0001552098,0.0005540595,0.000045275825,0.00002478023,0.00018731048,2.2184331e-7,0.00022166788,0.00043104918,0.9655445,0.0047724936,0.00039270648,0.027670683],"study_design_scores_gemma":[0.0032963576,0.004678121,0.0002700871,0.00018410331,0.00030226583,0.00013150169,0.00075654016,0.089217864,0.7470178,0.005165072,0.14728577,0.0016945156],"about_ca_topic_score_codex":0.000028285363,"about_ca_topic_score_gemma":0.00008817094,"teacher_disagreement_score":0.7667986,"about_ca_system_score_codex":0.000018606244,"about_ca_system_score_gemma":0.000069886155,"threshold_uncertainty_score":0.5875017},"labels":[],"label_agreement":null},{"id":"W2896569878","doi":"10.1109/tcomm.2018.2875486","title":"Optimal Design of a Two-Stage Wyner-Ziv Scalar Quantizer With Forwardly/Reversely Degraded Side Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Alphabet; Algorithm; Minification; Scalar (mathematics); Directed acyclic graph; Dynamic programming; Source code; Partition (number theory); Mathematics; Property (philosophy); Optimization problem; Encoder; Computer science; Mathematical optimization; Discrete mathematics; Combinatorics","score_opus":0.041390576054619765,"score_gpt":0.27514921807884907,"score_spread":0.2337586420242293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896569878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010694951,0.00007439427,0.98389316,0.00031320495,0.0000666767,0.0006279798,0.000097735276,0.00088665995,0.0033452164],"genre_scores_gemma":[0.7852656,0.0004625121,0.21384305,0.000057325506,0.000007728118,0.00024376882,0.000024560119,0.000039607483,0.000055817418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855757,0.00020284766,0.0005785182,0.00013424695,0.0002720932,0.00025474248],"domain_scores_gemma":[0.99628717,0.00035351093,0.00015255681,0.0027454586,0.00036605957,0.00009524309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033042507,0.0002501094,0.0002812968,0.0004204343,0.0003967399,0.00006235351,0.0012437669,0.00013388318,0.000074157295],"category_scores_gemma":[0.000010881781,0.00025670574,0.0001035117,0.0007230548,0.0004752791,0.0008851716,0.0000125235565,0.0005167882,0.00010267616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038284415,0.0012500552,0.000059700822,0.00023797728,0.0008919676,0.0000014452066,0.012057724,0.8936305,0.040189814,0.0149688525,0.0021157882,0.03421333],"study_design_scores_gemma":[0.0017058722,0.00051644706,0.0001379422,0.00026904198,0.00018250424,0.000022164011,0.00095493795,0.6746627,0.30503345,0.0002627812,0.015515237,0.00073693006],"about_ca_topic_score_codex":0.00012502904,"about_ca_topic_score_gemma":0.00025234217,"teacher_disagreement_score":0.7745707,"about_ca_system_score_codex":0.00012263349,"about_ca_system_score_gemma":0.000079141435,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null},{"id":"W2897434454","doi":"10.1109/tcomm.2018.2874239","title":"Cooperative Non-Orthogonal Layered Multicast Multiple Access for Heterogeneous Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":43,"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 Science Basic Research Program of Shaanxi Province; Engineering and Physical Sciences Research Council; Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Royal Society","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Reliability (semiconductor); Xcast; Channel (broadcasting); Base station; Pragmatic General Multicast; Protocol Independent Multicast; Distributed computing; Physics","score_opus":0.04884232698886927,"score_gpt":0.3142361201314315,"score_spread":0.26539379314256223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897434454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003983991,0.00021680228,0.9922804,0.00036979513,0.00030923495,0.0007741685,0.00018916711,0.0011413638,0.00073502725],"genre_scores_gemma":[0.9646665,0.0011659279,0.032497145,0.00009389121,0.000036948015,0.0013459327,0.000047013007,0.000075475735,0.000071168346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890536,0.000056718538,0.000381034,0.0002292813,0.00010346769,0.00032414892],"domain_scores_gemma":[0.996177,0.0007863352,0.00006429587,0.002591083,0.0003005222,0.00008073153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009196606,0.00025040735,0.00023571984,0.00018653386,0.0009076373,0.000084480045,0.0018727229,0.0001771547,0.00004596287],"category_scores_gemma":[0.000025137211,0.00027506228,0.00012301034,0.0004565621,0.0004974727,0.00031150674,0.000025459727,0.00048048876,0.000052449413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003360218,0.00019039115,0.000013977194,0.000010639535,0.00011759284,2.1035875e-7,0.00017034737,0.95978487,0.0022618445,0.00025333464,0.00023839371,0.036924798],"study_design_scores_gemma":[0.0006168802,0.000104557745,0.000061360166,0.00003757331,0.000021423106,0.000005584584,0.00008507625,0.9404473,0.052657906,0.00013371983,0.005533156,0.00029548147],"about_ca_topic_score_codex":0.000010646794,"about_ca_topic_score_gemma":0.0007014545,"teacher_disagreement_score":0.9606825,"about_ca_system_score_codex":0.00011768639,"about_ca_system_score_gemma":0.000026674405,"threshold_uncertainty_score":0.99997014},"labels":[],"label_agreement":null},{"id":"W2899538333","doi":"10.1109/tcomm.2018.2880204","title":"Throughput-Based Design for Polar-Coded Modulation","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"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":"Hybrid automatic repeat request; Computer science; Throughput; Algorithm; Decoding methods; Coding gain; Code rate; Quadrature amplitude modulation; Polar code; Automatic repeat request; Real-time computing; Bit error rate; Telecommunications link; Computer network; Telecommunications; Wireless","score_opus":0.12284797493317359,"score_gpt":0.3495131739354024,"score_spread":0.22666519900222878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899538333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009539393,0.000090678484,0.98930943,0.0041099633,0.0013901548,0.0020599328,0.00015943726,0.0022847268,0.0005003016],"genre_scores_gemma":[0.4616387,0.000054602177,0.5365854,0.00023861248,0.000036181733,0.0012567743,0.000040650328,0.000043961983,0.0001051433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972788,0.000563051,0.0006197012,0.000812485,0.0003493263,0.0003766459],"domain_scores_gemma":[0.9894334,0.0014564655,0.0004075423,0.0079353005,0.0006600525,0.00010725268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008905795,0.0004343586,0.0003904731,0.00050555164,0.0010735602,0.00031253876,0.0053465413,0.00048311532,0.000012612143],"category_scores_gemma":[0.00005014554,0.0004993294,0.00039322276,0.0005337572,0.00021544873,0.0003280889,0.00007341788,0.0010815954,0.000050240247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024498874,0.0044254013,0.000021062533,0.00042623593,0.0006682376,0.0000022392962,0.005123225,0.78334373,0.005815646,0.014322164,0.017349785,0.16825731],"study_design_scores_gemma":[0.00030693834,0.00022356436,0.000023593315,0.00022632962,0.000072826886,0.0000030541232,0.000010705997,0.9430194,0.028534345,0.025675071,0.0014067916,0.0004974079],"about_ca_topic_score_codex":0.00023793326,"about_ca_topic_score_gemma":0.00026527198,"teacher_disagreement_score":0.4615433,"about_ca_system_score_codex":0.00038728793,"about_ca_system_score_gemma":0.0005564601,"threshold_uncertainty_score":0.99974585},"labels":[],"label_agreement":null},{"id":"W2899567128","doi":"10.1109/tcomm.2018.2879088","title":"Systematic Fountain Codes for Massive Storage Using the Truncated Poisson Distribution","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","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":"Queen's University; Bombardier (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Fountain code; List decoding; Computer science; Overhead (engineering); Redundancy (engineering); Algorithm; Poisson distribution; Luby transform code; Erasure; Theoretical computer science; Hamming code; Mathematics; Concatenated error correction code; Block code; Statistics","score_opus":0.05223495903565117,"score_gpt":0.3216712573283314,"score_spread":0.26943629829268023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899567128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083411677,0.00013775156,0.9937155,0.0029832395,0.00028676272,0.0010892351,0.00033360854,0.00058162236,0.000038133574],"genre_scores_gemma":[0.89652914,0.00005249025,0.102707386,0.000092561946,0.000015271773,0.0004909822,0.000035445966,0.000014788561,0.000061959996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870217,0.00022758401,0.0003558821,0.00027582134,0.00018341419,0.00025515156],"domain_scores_gemma":[0.99456525,0.00096754136,0.00022347874,0.003889182,0.0003144205,0.000040154144],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00039767948,0.00017138419,0.0002138297,0.00011303114,0.0017703315,0.00015233879,0.0029622924,0.00009389525,0.0000034797158],"category_scores_gemma":[0.000096671174,0.00013385543,0.00010194034,0.0007599069,0.00049294985,0.0005627219,0.00003301734,0.00026809168,0.00002749461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020111568,0.0027391957,0.000009480022,0.002458486,0.0013653808,0.000007563671,0.009413762,0.056570847,0.04753528,0.83729327,0.0037847832,0.038620852],"study_design_scores_gemma":[0.00043826853,0.0002388557,0.000014101798,0.0005788355,0.00014047665,0.000026659784,0.0010377882,0.9605531,0.02401295,0.011250008,0.001369231,0.00033971763],"about_ca_topic_score_codex":0.00004963812,"about_ca_topic_score_gemma":0.00016122882,"teacher_disagreement_score":0.9039823,"about_ca_system_score_codex":0.00032721012,"about_ca_system_score_gemma":0.00007507411,"threshold_uncertainty_score":0.99952924},"labels":[],"label_agreement":null},{"id":"W2905757196","doi":"10.1109/tcomm.2018.2889089","title":"Multi-Node ML Time and Frequency Synchronization for Distributed MIMO-Relay Beamforming Over Time-Varying Flat-Fading Channels","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Institut National de la Recherche Scientifique; University of Manitoba; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Computer science; Relay; Carrier frequency offset; MIMO; Node (physics); Synchronization (alternating current); Fading; Electronic engineering; Channel (broadcasting); Frequency offset; Computer network; Orthogonal frequency-division multiplexing; Engineering; Telecommunications; Power (physics)","score_opus":0.04051896480186675,"score_gpt":0.29557336871957274,"score_spread":0.255054403917706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905757196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016946088,0.0004219149,0.9943848,0.001864825,0.00025570925,0.0006000816,0.00008312945,0.00036083444,0.0003340888],"genre_scores_gemma":[0.7994943,0.00066167896,0.1986686,0.00029256233,0.000055887806,0.00019891665,0.00009399884,0.000033206812,0.00050085405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984215,0.00022134962,0.00044130176,0.00041002544,0.0001612355,0.00034461776],"domain_scores_gemma":[0.9964972,0.000644365,0.00016400455,0.002185148,0.00037473274,0.00013453345],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004201302,0.0002462883,0.00023854345,0.0002433854,0.0024590879,0.0002691728,0.0015993582,0.00012418101,0.00008293646],"category_scores_gemma":[0.000044503908,0.0002684417,0.0001037149,0.0008086128,0.0002552518,0.0008752166,0.0000633905,0.00033169286,0.000120815705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001496468,0.003143211,0.00023455874,0.00017061371,0.0012908897,0.0000035999599,0.026549155,0.09957913,0.35463133,0.020242732,0.0052085225,0.4887966],"study_design_scores_gemma":[0.0007253931,0.000099317454,0.00005766003,0.00013848272,0.000037875332,0.000009013363,0.000012620396,0.991287,0.004569773,0.0001757133,0.0025728676,0.00031426258],"about_ca_topic_score_codex":0.000028279215,"about_ca_topic_score_gemma":0.000107672975,"teacher_disagreement_score":0.8917079,"about_ca_system_score_codex":0.00018037739,"about_ca_system_score_gemma":0.000089670975,"threshold_uncertainty_score":0.99997675},"labels":[],"label_agreement":null},{"id":"W2907135405","doi":"10.1109/tcomm.2019.2892054","title":"Average SEP-Optimal Precoding for Correlated Massive MIMO With ZF Detection: An Asymptotic Analysis","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Precoding; MIMO; Zero-forcing precoding; Computer science; Mathematics; Algorithm; Electronic engineering; Control theory (sociology); Statistics; Engineering; Beamforming; Artificial intelligence","score_opus":0.013241440794707961,"score_gpt":0.2380051838955041,"score_spread":0.22476374310079614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907135405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011608036,0.000053605043,0.9854755,0.00004994532,0.00029728413,0.00090293767,0.0000867364,0.00058871455,0.0009372704],"genre_scores_gemma":[0.96198076,0.00008280263,0.03676652,0.00001369295,0.000014894953,0.0004185763,0.00008444749,0.000070983704,0.0005673489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989602,0.000080141304,0.00034064858,0.00026314697,0.00011677361,0.00023907512],"domain_scores_gemma":[0.9978407,0.00027266692,0.00009149603,0.0015204169,0.00017888223,0.0000958476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011094641,0.0002223913,0.00028075528,0.00041795243,0.0003899595,0.000060413968,0.00038975725,0.0001345287,0.00009440976],"category_scores_gemma":[0.000003647804,0.00023703912,0.00014814059,0.0010637016,0.00004671069,0.0005001704,0.0000022450486,0.00034075,0.00005969895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003332836,0.00008377236,0.000030619518,0.000023945315,0.00054069853,1.9517441e-7,0.00042059386,0.99468374,0.0018283931,0.000035760622,0.0000044018616,0.0023145573],"study_design_scores_gemma":[0.0006543796,0.0001806514,0.00006819545,0.000040952087,0.0004610515,0.0000066539437,0.00027877375,0.9918793,0.005838451,0.000012506146,0.00029227103,0.00028682456],"about_ca_topic_score_codex":0.000021648033,"about_ca_topic_score_gemma":0.0005670908,"teacher_disagreement_score":0.9503727,"about_ca_system_score_codex":0.00022747579,"about_ca_system_score_gemma":0.000025839545,"threshold_uncertainty_score":0.96661747},"labels":[],"label_agreement":null},{"id":"W2909012309","doi":"10.1109/tcomm.2019.2892756","title":"Interplay of Bit Rate, Linewidth, Bandwidth, and Reach on Optical DMT and PAM With IMDD","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bit error rate; Pulse-amplitude modulation; Laser linewidth; Bandwidth (computing); Electronic engineering; Computer science; Modulation (music); Optics; Intensity modulation; Laser; Physics; Phase modulation; Channel (broadcasting); Telecommunications; Phase noise; Pulse (music); Engineering","score_opus":0.008844575804206513,"score_gpt":0.22720534476259566,"score_spread":0.21836076895838916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909012309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84299946,0.00057929545,0.13000417,0.0021315368,0.00021457563,0.0007489491,0.00004957489,0.0008509353,0.022421509],"genre_scores_gemma":[0.97661567,0.0013913728,0.021666737,0.00002876316,0.0000045397237,0.000042666863,0.0000036453646,0.000025916392,0.00022070084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.000032192413,0.00020108005,0.00014837326,0.000079849,0.00015123576],"domain_scores_gemma":[0.99828774,0.00055200025,0.000022822322,0.0010417746,0.00003913277,0.000056515473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009414578,0.00014595552,0.00019924817,0.00014100102,0.00008316242,0.00002511279,0.00028609874,0.00012004296,0.000036049194],"category_scores_gemma":[0.000006808416,0.0001265794,0.000029355113,0.00023850972,0.00027759754,0.000096963966,0.000007732038,0.00048222896,0.00004431236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009860462,0.0032367837,0.0032478739,0.0009365634,0.0019540812,0.000011677814,0.0022715265,0.31251967,0.07420179,0.080243155,0.0018175263,0.5185733],"study_design_scores_gemma":[0.008573082,0.006988791,0.014329677,0.003007557,0.00086094934,0.00022789824,0.0025174567,0.7720148,0.1529791,0.004764457,0.030489964,0.003246274],"about_ca_topic_score_codex":0.000008166643,"about_ca_topic_score_gemma":0.000055881264,"teacher_disagreement_score":0.51532704,"about_ca_system_score_codex":0.000027235079,"about_ca_system_score_gemma":0.000009802956,"threshold_uncertainty_score":0.5161758},"labels":[],"label_agreement":null},{"id":"W2910412414","doi":"10.1109/tcomm.2019.2893387","title":"Joint FSO Fronthaul and Millimeter-Wave Access Link Optimization in Cloud Small Cell Networks: A Statistical-QoS Aware Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Optimization problem; Telecommunications link; Scheduling (production processes); Radio access network; Computer network; Multiplexing; Access network; Quality of service; Mathematical optimization; Base station; Algorithm; Telecommunications; Mathematics","score_opus":0.04640435486142452,"score_gpt":0.2525790998737686,"score_spread":0.20617474501234406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910412414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019566389,0.0009685029,0.99045706,0.00016331344,0.0004004187,0.0010987862,0.00011896001,0.00029554742,0.0045407773],"genre_scores_gemma":[0.92526805,0.0032493016,0.07053976,0.000055624583,0.000026242957,0.0004692725,0.00012455371,0.000079962214,0.00018723024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831086,0.00027311404,0.0006420077,0.0003157844,0.00014926505,0.0003089712],"domain_scores_gemma":[0.9964759,0.0005545488,0.00010705568,0.0026482777,0.0000872063,0.00012704496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026036054,0.0002805974,0.00037121255,0.0002799857,0.00022142973,0.00011105481,0.0008198615,0.00018429711,0.0000965149],"category_scores_gemma":[0.0000058558717,0.00032202198,0.00007247958,0.00043471446,0.00010844651,0.0002947942,0.0000306722,0.0008432052,0.000031702406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010481138,0.00016134923,0.000034285647,0.000072368464,0.000035350677,3.9448517e-7,0.00051545777,0.99584717,0.00013687903,0.000061435705,0.000055971283,0.0030688578],"study_design_scores_gemma":[0.0007378135,0.000036125217,0.00018789622,0.00009662878,0.000034371915,0.000008961232,0.00032451205,0.99638104,0.0004204146,0.000051519186,0.001394219,0.00032647263],"about_ca_topic_score_codex":0.00017116737,"about_ca_topic_score_gemma":0.00029058167,"teacher_disagreement_score":0.9233114,"about_ca_system_score_codex":0.00022557679,"about_ca_system_score_gemma":0.000039168805,"threshold_uncertainty_score":0.99992317},"labels":[],"label_agreement":null},{"id":"W2910778537","doi":"10.1109/tcomm.2019.2892719","title":"Generalized Approximate Message Passing for Massive MIMO mmWave Channel Estimation With Laplacian Prior","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":86,"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; Canada Research Chairs","keywords":"Message passing; Computer science; MIMO; Algorithm; Expectation propagation; Channel (broadcasting); Bayesian inference; Bayesian probability; Theoretical computer science; Mathematical optimization; Gaussian; Mathematics; Artificial intelligence; Gaussian process; Telecommunications","score_opus":0.030968454879707365,"score_gpt":0.2530233028250778,"score_spread":0.22205484794537042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910778537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011515843,0.000091313086,0.9847101,0.00055086456,0.0002176879,0.0010245191,0.00009151883,0.00039197525,0.0014061953],"genre_scores_gemma":[0.87019175,0.0001429369,0.12859944,0.00008544314,0.000012629813,0.00052628067,0.000073396855,0.00006401256,0.0003040929],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905324,0.000056977,0.0003032211,0.00020276116,0.00014279915,0.00024100079],"domain_scores_gemma":[0.9985843,0.0001477277,0.00007264335,0.0009968368,0.00011883485,0.000079674785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015048112,0.00020665939,0.00021241626,0.00019770383,0.00040639268,0.00008035565,0.00031009616,0.00009647485,0.00005083197],"category_scores_gemma":[0.0000035293217,0.00020176535,0.00009852034,0.00021894826,0.000047693877,0.00024861805,0.0000029028995,0.000257822,0.000052478543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051995954,0.000119679105,0.0000011834372,0.000121580975,0.0001404585,2.5029155e-7,0.0010221845,0.9551966,0.02328185,0.00029261952,0.00006739654,0.019704185],"study_design_scores_gemma":[0.000955412,0.00006274944,0.0000052643677,0.000099782796,0.00007271627,0.0000040277687,0.00017431096,0.9364347,0.061235763,0.0002883428,0.00041759305,0.00024932725],"about_ca_topic_score_codex":0.00001160719,"about_ca_topic_score_gemma":0.00006994989,"teacher_disagreement_score":0.85867596,"about_ca_system_score_codex":0.00011160727,"about_ca_system_score_gemma":0.000035395828,"threshold_uncertainty_score":0.8227752},"labels":[],"label_agreement":null},{"id":"W2911604477","doi":"10.1109/tcomm.2019.2941490","title":"FALP: Fast Beam Alignment in mmWave Systems With Low-Resolution Phase Shifters","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"National Science Foundation","keywords":"Computer science; Phased array; Antenna (radio); Overhead (engineering); Channel (broadcasting); Compressed sensing; Beam (structure); Electronic engineering; Phase (matter); Optics; Algorithm; Telecommunications; Physics; Engineering","score_opus":0.03283250671025887,"score_gpt":0.26320523962318904,"score_spread":0.23037273291293017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911604477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023715444,0.00068796624,0.9703151,0.00021567408,0.0009564724,0.001424651,0.00037303887,0.00039991553,0.0019117445],"genre_scores_gemma":[0.9937187,0.0018194657,0.0029058924,0.000048785187,0.000027075044,0.0009379381,0.00021837321,0.00009916248,0.00022461901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811417,0.00015502148,0.0006788933,0.0003955309,0.00031776208,0.00033863774],"domain_scores_gemma":[0.9969839,0.00012528036,0.00012838861,0.0025368957,0.00010237509,0.0001231824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026082652,0.00041715978,0.00042724362,0.00055046595,0.00019229238,0.00012923928,0.00077200984,0.00030388622,0.000033693417],"category_scores_gemma":[0.0000020658993,0.00044200855,0.00014975532,0.00027021038,0.000085930275,0.00014216958,0.000018596515,0.0013368165,0.00010986864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028352333,0.0003781343,0.0000023444268,0.00021526111,0.00013719164,0.0000011222143,0.0008593166,0.9941065,0.0018009292,0.000018638219,0.000070963106,0.00238129],"study_design_scores_gemma":[0.0012510009,0.00008857655,0.000009061924,0.0010230833,0.00010675638,0.0000068159943,0.0004384626,0.98991764,0.006010389,0.000028784209,0.0005964345,0.0005229757],"about_ca_topic_score_codex":0.00024114159,"about_ca_topic_score_gemma":0.00042018594,"teacher_disagreement_score":0.97000325,"about_ca_system_score_codex":0.0006022224,"about_ca_system_score_gemma":0.000102484475,"threshold_uncertainty_score":0.9998032},"labels":[],"label_agreement":null},{"id":"W2911893217","doi":"10.1109/tcomm.2019.2894797","title":"Collaborative Multicast Beamforming for Content Delivery by Cache-Enabled Ultra Dense Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":32,"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":"Institute for Information and Communications Technology Promotion; Institute for Computational Science and Technology; Ministry of Science and ICT, South Korea; Queen's University; Queen's University Belfast; Royal Academy of Engineering; National Science Foundation","keywords":"Multicast; Computer science; Backhaul (telecommunications); Computer network; Beamforming; Cache; Distributed computing; Base station; Telecommunications","score_opus":0.02909364837865125,"score_gpt":0.2518763374289379,"score_spread":0.22278268905028664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911893217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014761243,0.00046076791,0.9807046,0.0016062801,0.00054648257,0.0009213143,0.00012533668,0.0002413617,0.00063260697],"genre_scores_gemma":[0.98161435,0.000518573,0.015097542,0.0005593876,0.000014854188,0.0003501781,0.000029540757,0.000023332654,0.0017922241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854296,0.00017005368,0.00036969752,0.00037792986,0.00019113917,0.00034818778],"domain_scores_gemma":[0.9962054,0.0010920804,0.00013043966,0.0020388702,0.00040421105,0.00012898161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028979513,0.0002173349,0.00025466856,0.00013795048,0.0007828209,0.00019411829,0.001504639,0.0001138817,0.000012683911],"category_scores_gemma":[0.000012107004,0.00022211175,0.00018880237,0.00046441445,0.000092631046,0.00055625744,0.000012579085,0.00042176884,0.00006899451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088758726,0.0067645637,0.00030625693,0.00014318027,0.0019909188,0.000008025506,0.010682579,0.47920215,0.27567896,0.024211971,0.0150048435,0.18511896],"study_design_scores_gemma":[0.0018190676,0.00028804355,0.000024864474,0.00009566674,0.000077316596,0.000013518929,0.0010004772,0.979812,0.008176546,0.00007577517,0.008151964,0.000464734],"about_ca_topic_score_codex":0.00020655009,"about_ca_topic_score_gemma":0.0001776468,"teacher_disagreement_score":0.96685314,"about_ca_system_score_codex":0.0001497101,"about_ca_system_score_gemma":0.00010615629,"threshold_uncertainty_score":0.9057454},"labels":[],"label_agreement":null},{"id":"W2912928774","doi":"10.1109/tcomm.2019.2894808","title":"Design of Successively Refinable Unrestricted Polar Quantizer","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Entropy (arrow of time); Combinatorics; Computer science; Mathematics; Discrete mathematics; Physics","score_opus":0.046837516925425794,"score_gpt":0.30398805775679216,"score_spread":0.25715054083136635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912928774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038500852,0.00014460113,0.9966962,0.0007264032,0.00013989657,0.0004195415,0.000038315626,0.0004209244,0.0010291425],"genre_scores_gemma":[0.60121083,0.00036657057,0.39783028,0.00007455482,0.0000018466048,0.0000671951,0.0000052049318,0.000012453904,0.00043105066],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858534,0.0002967011,0.0003736056,0.00029120702,0.00024896336,0.00020417658],"domain_scores_gemma":[0.994445,0.00068710523,0.00020668405,0.0043855496,0.00020972785,0.00006591681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021263024,0.00014997009,0.00021454043,0.000310011,0.00026050475,0.00004786764,0.003394001,0.00008749855,0.000054740238],"category_scores_gemma":[0.000012309984,0.00014769264,0.00007254067,0.0009584308,0.0001005326,0.00083505997,0.00003804082,0.00036451328,0.00013009274],"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.00025058768,0.005710731,0.00026783216,0.00015678637,0.00035246235,0.000008680291,0.0018612675,0.13052885,0.48694476,0.21650128,0.006622458,0.1507943],"study_design_scores_gemma":[0.0015166802,0.0007856291,0.00067142973,0.00038822446,0.000057913272,0.000028666924,0.00011290596,0.36800903,0.59075433,0.014949966,0.021774199,0.00095100905],"about_ca_topic_score_codex":0.00011090852,"about_ca_topic_score_gemma":0.000006333015,"teacher_disagreement_score":0.60082585,"about_ca_system_score_codex":0.000054593846,"about_ca_system_score_gemma":0.00012029536,"threshold_uncertainty_score":0.63069546},"labels":[],"label_agreement":null},{"id":"W2913164447","doi":"10.1109/tcomm.2019.2896190","title":"Log-Likelihood Ratio Calculation for Pilot Symbol Assisted Coded Modulation Schemes With Residual Phase Noise","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Huawei Technologies","keywords":"Quadrature amplitude modulation; Residual; Additive white Gaussian noise; Algorithm; Modulation (music); Bit error rate; Phase-shift keying; Signal-to-noise ratio (imaging); Computer science; Phase noise; Mathematics; Electronic engineering; Statistics; Decoding methods; White noise; Physics; Engineering","score_opus":0.04991518570806551,"score_gpt":0.3233230937693331,"score_spread":0.2734079080612676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913164447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035365563,0.000026590182,0.95940965,0.001850766,0.00023979478,0.0015912949,0.000046351197,0.0010119892,0.00045798754],"genre_scores_gemma":[0.8160203,0.000017424101,0.18288398,0.0001204531,0.00001614049,0.0005611797,0.000051007104,0.000033329434,0.00029616297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982248,0.00022073847,0.00044436194,0.00047935353,0.0003325211,0.0002982272],"domain_scores_gemma":[0.9955861,0.00061348366,0.0002365436,0.0030114707,0.0004576241,0.000094767835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003971517,0.00024840247,0.00024992527,0.00033417682,0.00066535076,0.00017079612,0.0013516386,0.00010969269,0.0000126061805],"category_scores_gemma":[0.000021270753,0.00024896848,0.00009392374,0.00072625687,0.000087844724,0.0008295449,0.000014901016,0.00038083506,0.000048189813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017171293,0.0139572825,0.0009344091,0.0002682414,0.0008248016,0.0000037652194,0.006110065,0.073927194,0.48912847,0.04682358,0.0020169243,0.36428815],"study_design_scores_gemma":[0.0035196037,0.0017790479,0.0009346126,0.00015670533,0.000094989075,0.000022805121,0.00010377897,0.92216897,0.0688856,0.001065681,0.00069462194,0.00057355606],"about_ca_topic_score_codex":0.00009523288,"about_ca_topic_score_gemma":0.00046340615,"teacher_disagreement_score":0.8482418,"about_ca_system_score_codex":0.00018847383,"about_ca_system_score_gemma":0.00019046574,"threshold_uncertainty_score":0.99999624},"labels":[],"label_agreement":null},{"id":"W2913330947","doi":"10.1109/tcomm.2019.2896960","title":"A Generalized Grouping Scheme in Coded Caching","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":53,"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; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Scheme (mathematics); Transmission rate; Wireless; Wireless network; Algorithm; Computer network; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.037457749790339986,"score_gpt":0.2701184905180824,"score_spread":0.2326607407277424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913330947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18442205,0.00017332323,0.8094822,0.0024637848,0.00037576485,0.0002570198,0.000005546458,0.00025831064,0.0025619688],"genre_scores_gemma":[0.9816854,0.00015123143,0.017021097,0.00045720398,0.000006376291,0.00006176529,0.0000029845799,0.000010985493,0.00060293206],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998924,0.00019978639,0.00025708097,0.00025481242,0.00015977661,0.00020452529],"domain_scores_gemma":[0.9974136,0.00023080526,0.000055854634,0.0022011166,0.0000440632,0.00005459436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027152235,0.00011945455,0.00015628892,0.000261843,0.00027365456,0.00010649766,0.0015519393,0.000057810583,0.000020467907],"category_scores_gemma":[0.000004219722,0.0001301118,0.000105026025,0.0004914978,0.000032877648,0.0004262716,0.000016457521,0.00048013846,0.00019783241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000151019,0.004350172,0.0029403311,0.00010251502,0.00039866325,0.000021778565,0.011064116,0.24664691,0.31967303,0.28180942,0.0005312171,0.13231084],"study_design_scores_gemma":[0.0011317913,0.00005337209,0.00042637356,0.000110116554,0.0000088274,0.000014362377,0.0001054457,0.9943053,0.001596726,0.0006550215,0.0012941532,0.0002984715],"about_ca_topic_score_codex":0.00063113926,"about_ca_topic_score_gemma":0.00052537734,"teacher_disagreement_score":0.7972634,"about_ca_system_score_codex":0.00010198034,"about_ca_system_score_gemma":0.00005330438,"threshold_uncertainty_score":0.5305806},"labels":[],"label_agreement":null},{"id":"W2913563820","doi":"10.1109/tcomm.2019.2900634","title":"Energy Efficient Beamforming Design for MISO Non-Orthogonal Multiple Access Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":84,"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":"Engineering and Physical Sciences Research Council","keywords":"Beamforming; Telecommunications link; Mathematical optimization; Computer science; Maximization; Transmitter power output; Spectral efficiency; Efficient energy use; Transmission (telecommunications); Context (archaeology); Noma; WSDMA; Electronic engineering; Mathematics; Precoding; Engineering; Telecommunications; MIMO; Electrical engineering; Transmitter","score_opus":0.0421727387600164,"score_gpt":0.27498525830779985,"score_spread":0.23281251954778345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913563820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041180174,0.0006174678,0.9919029,0.00016053252,0.00046026174,0.00087919825,0.00009563688,0.0010598096,0.0007062125],"genre_scores_gemma":[0.9572146,0.001010408,0.0397398,0.00002487361,0.000009685429,0.0016924712,0.00003136326,0.00007142965,0.00020538791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988554,0.000058162495,0.0004156139,0.00021289455,0.00015449358,0.00030342874],"domain_scores_gemma":[0.995692,0.0012019416,0.00008714987,0.0028246269,0.00013097773,0.00006329503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016154855,0.00023134846,0.00025534967,0.000304592,0.0004543685,0.00008500004,0.001970311,0.00015742173,0.00001461911],"category_scores_gemma":[0.0000098036535,0.00025547761,0.00012851802,0.00038335737,0.00010781875,0.00025104507,0.000019041494,0.00036196676,0.000046200166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013296468,0.00011977798,0.000006263428,0.00003834467,0.000057744008,6.002377e-8,0.00007756324,0.9810504,0.0045549613,0.0011246654,0.00009468273,0.012862259],"study_design_scores_gemma":[0.00049058173,0.000045350782,0.000014672273,0.00008281585,0.000019042502,0.0000036598426,0.00019559161,0.95873606,0.032178618,0.00016230748,0.007797109,0.00027420354],"about_ca_topic_score_codex":0.000034398206,"about_ca_topic_score_gemma":0.00004829024,"teacher_disagreement_score":0.95309657,"about_ca_system_score_codex":0.00018509716,"about_ca_system_score_gemma":0.00003939359,"threshold_uncertainty_score":0.99998975},"labels":[],"label_agreement":null},{"id":"W2920939123","doi":"10.1109/tcomm.2019.2904258","title":"The Security–Reliability Tradeoff of Multiuser Scheduling-Aided Energy Harvesting Cognitive Radio Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":41,"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; Southeast University; Natural Science Foundation of Jiangsu Province; China Postdoctoral Science Foundation; Royal Society","keywords":"Computer science; Cognitive radio; Scheduling (production processes); Transmitter; Computer network; Channel (broadcasting); Wireless; Telecommunications; Mathematics; Mathematical optimization","score_opus":0.012512460093844878,"score_gpt":0.2267806518809536,"score_spread":0.2142681917871087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920939123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10500754,0.0016556667,0.88429576,0.00029337557,0.0012221857,0.00046080578,0.000049756076,0.00077917986,0.006235715],"genre_scores_gemma":[0.9942494,0.0018403415,0.0031935454,0.0000377295,0.000044231492,0.0001654902,0.000018554403,0.00007599007,0.0003747051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982634,0.00030140128,0.00060028734,0.00024880856,0.0002111792,0.0003748995],"domain_scores_gemma":[0.9939044,0.0037911255,0.00012838423,0.0018828997,0.00018796878,0.00010518971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042641637,0.0002640577,0.00029606573,0.00009736508,0.0005446853,0.00006626547,0.0009715942,0.0002041327,0.000030526193],"category_scores_gemma":[0.000047260542,0.00024775573,0.00018463396,0.0005668508,0.00036354622,0.0002253085,0.000010226798,0.00093134685,0.000016760985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001774373,0.0001303731,0.00011612595,0.000022775666,0.00012235514,2.4159553e-7,0.00027183644,0.9870312,0.00030309422,0.0010221897,0.000038920098,0.010923146],"study_design_scores_gemma":[0.00050531334,0.000046537923,0.000352883,0.00025884176,0.000069289476,0.0000050928948,0.00020529467,0.99246526,0.003927001,0.00020315255,0.0016894668,0.00027187023],"about_ca_topic_score_codex":0.00018710052,"about_ca_topic_score_gemma":0.0007601424,"teacher_disagreement_score":0.8892419,"about_ca_system_score_codex":0.00010143809,"about_ca_system_score_gemma":0.000044837077,"threshold_uncertainty_score":0.9999975},"labels":[],"label_agreement":null},{"id":"W2923621805","doi":"10.1109/tcomm.2019.2906232","title":"Fast Successive-Cancellation-Based Decoders of Polar Codes","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":61,"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":"Decoding methods; Computer science; Sequential decoding; List decoding; Polar code; Algorithm; Latency (audio); Code (set theory); Parallel computing; Reduction (mathematics); Berlekamp–Welch algorithm; Concatenated error correction code; Mathematics; Telecommunications; Block code; Set (abstract data type)","score_opus":0.02210518038164526,"score_gpt":0.283981946344798,"score_spread":0.26187676596315274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923621805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005130132,0.000076797005,0.9875793,0.0015982335,0.00028384815,0.00032367237,0.000026690857,0.0004621541,0.0045191906],"genre_scores_gemma":[0.87702405,0.00004594413,0.12244678,0.00014895992,0.000003642523,0.000051957366,0.000004507967,0.00001561692,0.00025851696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877226,0.00018649615,0.00034416636,0.00026739415,0.00024534835,0.000184351],"domain_scores_gemma":[0.99545586,0.0009569162,0.00020228165,0.0030929383,0.00023100196,0.00006099942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023917638,0.00014951655,0.00019960316,0.0003036213,0.00027760884,0.00005258836,0.002285315,0.00008370901,0.00005874684],"category_scores_gemma":[0.000012658309,0.0001633351,0.00013252135,0.00071674486,0.0001285371,0.00033053162,0.000012052158,0.00033702765,0.00008328546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018179374,0.0059211385,0.012423041,0.0004051485,0.00057971623,0.0000039468077,0.010608635,0.44958892,0.12335841,0.09022235,0.0018643832,0.3048425],"study_design_scores_gemma":[0.000619187,0.00026360905,0.0006300501,0.00019626983,0.00003255772,0.0000040157947,0.0001518121,0.8383983,0.15599649,0.0015504041,0.0016980704,0.0004592279],"about_ca_topic_score_codex":0.00027387234,"about_ca_topic_score_gemma":0.00053059176,"teacher_disagreement_score":0.87189394,"about_ca_system_score_codex":0.00009294413,"about_ca_system_score_gemma":0.00018321081,"threshold_uncertainty_score":0.6660613},"labels":[],"label_agreement":null},{"id":"W2923947164","doi":"10.1109/tcomm.2019.2906590","title":"Optimal Energy-Efficient Beamforming Designs for Cloud-RANs With Rate-Dependent Fronthaul Power","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Beamforming; Computer science; Efficient energy use; Mathematical optimization; Cloud computing; Telecommunications link; Reynolds-averaged Navier–Stokes equations; Relaxation (psychology); Transmitter power output; Karush–Kuhn–Tucker conditions; Remote radio head; Optimization problem; Algorithm; Wireless; Mathematics; Cognitive radio; Transmitter; Computer network; Engineering; Telecommunications; Computational fluid dynamics; Electrical engineering","score_opus":0.01710808998195311,"score_gpt":0.23506207642341417,"score_spread":0.21795398644146108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923947164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036651082,0.00016347006,0.99179417,0.00010632432,0.00056439184,0.00083904923,0.00011851515,0.00048047455,0.0022685202],"genre_scores_gemma":[0.91700363,0.000114474744,0.081258945,0.00003366666,0.000017410639,0.00059402455,0.000033817636,0.00010036021,0.00084368425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988981,0.000061951156,0.00034693273,0.00024131866,0.00013816793,0.00031352477],"domain_scores_gemma":[0.9979317,0.0003042583,0.000067942216,0.0014673746,0.00013602761,0.00009265628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016711545,0.00024802712,0.00023858881,0.00018510886,0.00035419053,0.00004562186,0.0005117647,0.00011300465,0.00007053777],"category_scores_gemma":[0.000002766618,0.000249146,0.00010439612,0.00026731595,0.00005740727,0.00020609573,0.0000033226092,0.00025522814,0.00006133725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045114328,0.00013520232,0.0000020839284,0.00002014667,0.00008539042,2.2942416e-7,0.00045229495,0.99410903,0.0039219963,0.00050973403,0.000051214734,0.0006675687],"study_design_scores_gemma":[0.0012723427,0.00021635774,0.0000048322845,0.00011076715,0.00008299067,0.000012576519,0.00073226396,0.968617,0.02393725,0.000027568178,0.0045403866,0.0004456684],"about_ca_topic_score_codex":0.000027805172,"about_ca_topic_score_gemma":0.0001661624,"teacher_disagreement_score":0.9133385,"about_ca_system_score_codex":0.0002440408,"about_ca_system_score_gemma":0.000046592082,"threshold_uncertainty_score":0.99999607},"labels":[],"label_agreement":null},{"id":"W2940469682","doi":"10.1109/tcomm.2019.2913413","title":"Reconfigurable and Traffic-Aware MAC Design for Virtualized Wireless Networks via Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Reinforcement learning; Partition (number theory); Scalability; Network packet; Wireless network; Wireless; Partition problem; Scheme (mathematics); Throughput; Monomial; Distributed computing; Computer network; Machine learning","score_opus":0.02175654600213309,"score_gpt":0.24307007761138175,"score_spread":0.22131353160924866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940469682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005931426,0.00021331165,0.9965196,0.00006865439,0.00028717765,0.0011558267,0.0000077919485,0.00044811887,0.00070633175],"genre_scores_gemma":[0.9846212,0.001278582,0.01228615,0.000022514716,0.000012745254,0.0005577841,0.00003988393,0.00006719285,0.0011138998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991168,0.00009075226,0.00033146952,0.00017393558,0.00006892498,0.00021815218],"domain_scores_gemma":[0.998562,0.00046418232,0.0000657138,0.00076068146,0.000079874044,0.00006754642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019038389,0.0001755326,0.00021393837,0.00011803737,0.00035497735,0.000041813357,0.00025647096,0.00011724486,0.00005847145],"category_scores_gemma":[0.000002940283,0.00020423016,0.00006348415,0.0001977569,0.000038106326,0.0002254169,0.0000016357586,0.00031592426,0.000026942413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025142503,0.000022419965,7.7901944e-7,0.000033854034,0.000052590025,4.7211714e-8,0.00023648828,0.98183006,0.0011568184,0.000075095806,0.000051076433,0.016515609],"study_design_scores_gemma":[0.0007248063,0.00009704274,0.0000011131322,0.00007875933,0.000036051606,0.000004225584,0.0001912837,0.994945,0.0021835568,0.000017759923,0.0015069691,0.00021343921],"about_ca_topic_score_codex":0.000008931065,"about_ca_topic_score_gemma":0.00002780038,"teacher_disagreement_score":0.9842335,"about_ca_system_score_codex":0.00010959206,"about_ca_system_score_gemma":0.000015685062,"threshold_uncertainty_score":0.83282644},"labels":[],"label_agreement":null},{"id":"W2941159701","doi":"10.1109/tcomm.2019.2910811","title":"Optimizing Forward Error Correction Codes for COFDM With Reduced PAPR","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","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":"Ultra Electronics (Canada); École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Forward error correction; Computer science; Electronic engineering; Error detection and correction; Algorithm; Telecommunications; Decoding methods; Channel (broadcasting); Engineering","score_opus":0.027689305843399556,"score_gpt":0.2721235979389611,"score_spread":0.24443429209556156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941159701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026462395,0.00016039111,0.9562551,0.00076689693,0.0026470013,0.0012831669,0.0001077052,0.001163188,0.011154177],"genre_scores_gemma":[0.9657849,0.00022761704,0.030582722,0.000042360214,0.00003268662,0.00076420314,0.000031800708,0.00008235176,0.0024513276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904203,0.0000488277,0.00028836896,0.00021347434,0.00014794704,0.00025934365],"domain_scores_gemma":[0.99795,0.00033092703,0.00005949521,0.0014371738,0.00013400917,0.00008838525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012583511,0.00020963399,0.00022206387,0.00021592106,0.00040573004,0.00005384599,0.00046390685,0.000112113754,0.00009741007],"category_scores_gemma":[0.0000053378367,0.00021838701,0.00012236695,0.00037458775,0.00009646369,0.00027241174,0.0000023058774,0.0004032219,0.00014534808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008876437,0.00018196079,0.000010874771,0.00005349986,0.00023034822,1.4395454e-7,0.0009007814,0.96604127,0.021649146,0.00021759846,0.0022013192,0.008424297],"study_design_scores_gemma":[0.0023063414,0.0005087496,0.00013142399,0.00030634308,0.0002860803,0.00007111033,0.0021959997,0.79507923,0.13578624,0.00017245881,0.062195353,0.0009606671],"about_ca_topic_score_codex":0.00002448599,"about_ca_topic_score_gemma":0.00012557553,"teacher_disagreement_score":0.93932253,"about_ca_system_score_codex":0.00020632826,"about_ca_system_score_gemma":0.000047707275,"threshold_uncertainty_score":0.8905564},"labels":[],"label_agreement":null},{"id":"W2946247520","doi":"10.1109/tcomm.2019.2918454","title":"Space–Time Signal Design for Multilevel Polar Coding in Slow Fading Broadcast Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Decoding methods; Fading; Unavailability; Computer science; Block code; Algorithm; Transmitter; Upper and lower bounds; Polar code; Channel state information; Channel (broadcasting); Topology (electrical circuits); Mathematics; Wireless; Telecommunications; Statistics","score_opus":0.04316566747340052,"score_gpt":0.27858630622439107,"score_spread":0.23542063875099056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946247520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017304907,0.0002572774,0.994387,0.0003138698,0.00015161063,0.0013173188,0.000096269076,0.00084558513,0.0009006343],"genre_scores_gemma":[0.858642,0.000760661,0.13925411,0.00003523229,0.000011037841,0.00074149395,0.00002375659,0.00008599125,0.00044575887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987282,0.00014411457,0.0004265521,0.00022373142,0.00013409833,0.00034329417],"domain_scores_gemma":[0.996694,0.00117586,0.00007045248,0.0018924312,0.00008899152,0.000078225276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003243842,0.00025123093,0.00029528193,0.00045130853,0.00029991992,0.000051299176,0.0011001807,0.00015658856,0.00008488958],"category_scores_gemma":[0.000010177962,0.00031141928,0.00012575723,0.00040884447,0.00007712479,0.000393383,0.000009893497,0.0005948132,0.00016176047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027599957,0.00020197207,0.000007797752,0.000045370358,0.0000534364,2.5902133e-7,0.0008528204,0.89470744,0.07960828,0.0007156768,0.00017886155,0.023600496],"study_design_scores_gemma":[0.00061467895,0.00006508301,0.000017147788,0.00019624527,0.000017083028,0.0000037418283,0.00011766386,0.889371,0.10563117,0.00056271185,0.0030549616,0.00034850303],"about_ca_topic_score_codex":0.000026698124,"about_ca_topic_score_gemma":0.00001813586,"teacher_disagreement_score":0.8569115,"about_ca_system_score_codex":0.00029383425,"about_ca_system_score_gemma":0.000033605593,"threshold_uncertainty_score":0.9999338},"labels":[],"label_agreement":null},{"id":"W2947605383","doi":"10.1109/tcomm.2019.2919620","title":"Throughput Maximization in Energy Limited Full-Duplex Cognitive Radio Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Throughput; Computer science; Underlay; Transceiver; Interference (communication); MIMO; Electronic engineering; Computer network; Wireless; Signal-to-noise ratio (imaging); Telecommunications; Engineering","score_opus":0.01800218803861843,"score_gpt":0.22939767434334044,"score_spread":0.211395486304722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947605383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0977039,0.0016663705,0.89302576,0.0008287669,0.00060385367,0.00074405584,0.00010064629,0.0010061947,0.0043204445],"genre_scores_gemma":[0.98695153,0.008156367,0.0034310478,0.00015403259,0.000022584703,0.00049741287,0.00023017806,0.00010937925,0.00044748426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982192,0.00026626774,0.0005962037,0.00030546967,0.00020575605,0.00040708986],"domain_scores_gemma":[0.9959798,0.00094183424,0.00008570367,0.0027288261,0.00015395306,0.0001098814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016428194,0.00032751556,0.0003390575,0.00047394098,0.00032182864,0.00007538436,0.0012073976,0.00025639168,0.00031852318],"category_scores_gemma":[0.0000119847555,0.00039929798,0.00014799062,0.001402284,0.00016488935,0.00041115095,0.000015994423,0.00088504195,0.0002387944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026154981,0.0003042184,0.000056447123,0.000012677656,0.00008858299,5.9618327e-7,0.00041000743,0.9865679,0.00094675407,0.0010405337,0.00015997852,0.010386128],"study_design_scores_gemma":[0.0009502166,0.000059890663,0.0006430482,0.0001566119,0.000047629987,0.000010894834,0.0003300034,0.99327147,0.0010197109,0.000017258457,0.003093359,0.00039990075],"about_ca_topic_score_codex":0.00016298906,"about_ca_topic_score_gemma":0.001986568,"teacher_disagreement_score":0.88959473,"about_ca_system_score_codex":0.00029985452,"about_ca_system_score_gemma":0.0000524951,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W2949909152","doi":"10.1109/tcomm.2019.2922255","title":"Dual-Band Fading Multiple Access Relay Channels","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Telecommunications link; Computer science; Channel (broadcasting); Fading; Transmission (telecommunications); Microwave; Microwave transmission; Antenna (radio); Telecommunications; Path loss; Transmitter power output; Electronic engineering; Power (physics); Computer network; Physics; Wireless; Engineering; Transmitter","score_opus":0.12645867850581136,"score_gpt":0.3469772734044358,"score_spread":0.22051859489862444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949909152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096413994,0.0013718201,0.97701097,0.008157967,0.0027262392,0.0010929628,0.00006409388,0.00068067986,0.007931131],"genre_scores_gemma":[0.9691169,0.012974122,0.014391237,0.0006191157,0.00006633208,0.00063680764,0.000056768542,0.000056480727,0.0020821816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968356,0.00077945733,0.00072552287,0.0008246707,0.0003946837,0.0004400714],"domain_scores_gemma":[0.9868629,0.0013566104,0.00037691844,0.010801684,0.0004186762,0.00018323556],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005829139,0.00049774547,0.00052239065,0.0005678937,0.0014161831,0.0010949901,0.0093709845,0.0003810056,0.00008037873],"category_scores_gemma":[0.000035033925,0.000545419,0.00035941962,0.0008967423,0.00018997511,0.00078590505,0.00050383504,0.0025583273,0.000341326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031316307,0.0015824904,0.0000941534,0.0001438353,0.0005538582,0.000005027294,0.006165737,0.8796561,0.0012100611,0.009769534,0.00604599,0.09474192],"study_design_scores_gemma":[0.00088400865,0.00008118214,0.00019363365,0.00074028876,0.00008587696,0.000018198105,0.000062520565,0.9553143,0.0067210486,0.001332601,0.033419434,0.0011469135],"about_ca_topic_score_codex":0.000061517516,"about_ca_topic_score_gemma":0.0004474073,"teacher_disagreement_score":0.9681528,"about_ca_system_score_codex":0.0002966856,"about_ca_system_score_gemma":0.00034730328,"threshold_uncertainty_score":0.99994195},"labels":[],"label_agreement":null},{"id":"W2950380080","doi":"10.1109/tcomm.2019.2910258","title":"User-Centric Base-Station Wireless Access Virtualization for Future 5G Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Huawei Technologies (Canada); Institut National de la Recherche Scientifique; University of Toronto","funders":"","keywords":"Computer science; Base station; Computer network; Overhead (engineering); Cellular network; Wireless network; Quality of service; Distributed computing; Cluster analysis; Virtualization; Wireless; MIMO; User equipment; Cloud computing; Telecommunications; Channel (broadcasting)","score_opus":0.018138040032396524,"score_gpt":0.2676087776828203,"score_spread":0.2494707376504238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950380080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017514089,0.00022993775,0.9934885,0.00021762922,0.0014498623,0.0013297679,0.00012480767,0.0006066572,0.0008014319],"genre_scores_gemma":[0.988976,0.0015509588,0.0077842204,0.00007916997,0.00009421224,0.00058563036,0.00028453855,0.000100254176,0.00054504164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891,0.000084527936,0.00040439607,0.00022728142,0.00012690003,0.00024691308],"domain_scores_gemma":[0.99800205,0.00029965956,0.00010164034,0.0013185221,0.00020334158,0.00007481254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001274442,0.00021476117,0.00020729635,0.00025322445,0.00027247984,0.0000967272,0.0006456913,0.00017541609,0.00005489607],"category_scores_gemma":[0.000004086219,0.0002503727,0.000101499136,0.0007531313,0.000030874566,0.0007537961,0.0000031831903,0.0002767341,0.000052852265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015735122,0.00008149791,0.000023822327,0.00005212604,0.00004352633,5.8219673e-8,0.00023153232,0.9896349,0.0005809805,0.00096273236,0.0003850186,0.007988083],"study_design_scores_gemma":[0.00068464363,0.00003813671,0.00008268882,0.00006367816,0.000050688905,0.0000021285025,0.00022122472,0.9923569,0.0015025641,0.000061437364,0.0046599302,0.0002759578],"about_ca_topic_score_codex":0.000014576877,"about_ca_topic_score_gemma":0.00015222668,"teacher_disagreement_score":0.9872246,"about_ca_system_score_codex":0.00021233836,"about_ca_system_score_gemma":0.000028300548,"threshold_uncertainty_score":0.9999949},"labels":[],"label_agreement":null},{"id":"W2950883843","doi":"10.1109/tcomm.2019.2921966","title":"Transmit Antenna Selection in Secure MIMO Systems Over $\\alpha-\\mu$ Fading Channels","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Memorial University of Newfoundland; Concordia University","funders":"","keywords":"Fading; Transmitter; MIMO; Channel state information; Secrecy; Computer science; Channel (broadcasting); Channel capacity; Antenna (radio); Topology (electrical circuits); Upper and lower bounds; Computer network; Electronic engineering; Telecommunications; Mathematics; Engineering; Wireless; Computer security","score_opus":0.01944448894364269,"score_gpt":0.2558385507497109,"score_spread":0.2363940618060682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950883843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18943623,0.0025530134,0.78987986,0.0011136187,0.0012661854,0.002530406,0.00014358846,0.0035688449,0.009508259],"genre_scores_gemma":[0.9944583,0.0028676724,0.0017004852,0.000054614222,0.000021040367,0.00050070224,0.000019734456,0.000091201,0.00028621472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983148,0.00024260105,0.0005803324,0.0002630494,0.00024173138,0.00035751486],"domain_scores_gemma":[0.9976365,0.0003111708,0.000073666124,0.0017855293,0.00010135153,0.00009175553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032381865,0.0002925861,0.00035019455,0.0006447656,0.00024818876,0.00010802038,0.0011798361,0.00025895616,0.00012163755],"category_scores_gemma":[0.0000034795567,0.00035192652,0.0001462575,0.0010411325,0.00007647808,0.00050529063,0.000007190838,0.0011338259,0.0001663949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085340536,0.0017288354,0.0009969765,0.00064366136,0.0005027497,0.0000035023625,0.010793377,0.833822,0.12728536,0.00987525,0.0013639441,0.012899005],"study_design_scores_gemma":[0.0008642487,0.00009129814,0.0006897306,0.00051932805,0.000043521904,0.000026079058,0.0004741772,0.97203183,0.0097731855,0.00026398498,0.014565816,0.00065681065],"about_ca_topic_score_codex":0.00029022107,"about_ca_topic_score_gemma":0.00062622165,"teacher_disagreement_score":0.8050221,"about_ca_system_score_codex":0.0003519621,"about_ca_system_score_gemma":0.000037362926,"threshold_uncertainty_score":0.99989325},"labels":[],"label_agreement":null},{"id":"W2950903284","doi":"10.1109/tcomm.2007.904390","title":"Error Rate Analysis for Coded Multicarrier Systems Over Quasi-Static Fading Channels","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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 British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Subcarrier; Bit error rate; Electronic engineering; Computer science; Fading; Interleaving; Rayleigh fading; Spectral efficiency; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.05091493308955023,"score_gpt":0.330373571263112,"score_spread":0.27945863817356176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950903284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003760426,0.00028866096,0.9926315,0.0001668172,0.00028145988,0.0008793034,0.00022646015,0.0011681721,0.00059720414],"genre_scores_gemma":[0.958462,0.0005698507,0.039562285,0.000057790745,0.00001689776,0.00087932806,0.00008165798,0.000080034515,0.00029013678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984644,0.00014422515,0.0006450277,0.00022010073,0.00015613138,0.00037007997],"domain_scores_gemma":[0.99513113,0.0017273217,0.00011522216,0.0027103636,0.00017722583,0.00013875656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066723867,0.00025746785,0.00038099437,0.00069696177,0.0005727797,0.00006992195,0.0009937808,0.0001600942,0.000027790173],"category_scores_gemma":[0.000022613458,0.00029477806,0.00023820657,0.0011549252,0.0001402301,0.0002698135,0.000006578445,0.00047802026,0.000020086054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026487736,0.0002502503,0.000018292616,0.00005972962,0.0008126278,4.0710538e-7,0.0010533432,0.985642,0.0055249515,0.0020311195,0.00012668179,0.0044540702],"study_design_scores_gemma":[0.0004359076,0.000047445123,0.00010456312,0.00005503139,0.00040540256,0.0000016484884,0.00052643416,0.97824574,0.013738352,0.00022948728,0.005834413,0.0003755685],"about_ca_topic_score_codex":0.00008079927,"about_ca_topic_score_gemma":0.00043363564,"teacher_disagreement_score":0.9547016,"about_ca_system_score_codex":0.00026084145,"about_ca_system_score_gemma":0.00001964532,"threshold_uncertainty_score":0.9999504},"labels":[],"label_agreement":null},{"id":"W2951617530","doi":"10.1109/tcomm.2019.2923237","title":"A Relay-Assisted OFDM System for VLC Uplink Transmission","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Telecommunications link; Relay; Computer science; Orthogonal frequency-division multiplexing; Electronic engineering; Visible light communication; Transmission (telecommunications); Multiplexing; Spectral efficiency; Signal-to-noise ratio (imaging); Modulation (music); Power (physics); Computer network; Engineering; Telecommunications; Electrical engineering; Channel (broadcasting); Physics; Light-emitting diode","score_opus":0.025896517779648312,"score_gpt":0.2531809775467217,"score_spread":0.2272844597670734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951617530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034029467,0.00091972516,0.9758956,0.002445298,0.00038666616,0.0010257254,0.000042881296,0.003233764,0.012647417],"genre_scores_gemma":[0.9454351,0.0012997136,0.051901683,0.000026257014,0.0000068222294,0.00069196493,0.000024732111,0.00007250587,0.0005412338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881035,0.00007281967,0.0004875029,0.00021817624,0.0001424432,0.00026868202],"domain_scores_gemma":[0.9954932,0.00078107906,0.000059336675,0.0034572058,0.00012434155,0.00008486968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018450015,0.00023194717,0.00030017385,0.00026400443,0.00040574104,0.000039662667,0.0015401085,0.00025586932,0.00006826362],"category_scores_gemma":[0.00000724673,0.00023355772,0.00017751397,0.0005041962,0.00016334694,0.00017259688,0.0000070785723,0.0005872409,0.00031067387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120292614,0.0008605704,0.00001681865,0.0009023448,0.00050327205,6.377379e-7,0.001037568,0.11777599,0.07570045,0.05033269,0.0015714185,0.75117797],"study_design_scores_gemma":[0.0016251559,0.00024110303,0.00010648842,0.0005718997,0.000112445625,0.000015198881,0.00091343134,0.88291293,0.04951719,0.00050683244,0.06281341,0.0006639215],"about_ca_topic_score_codex":0.000013121019,"about_ca_topic_score_gemma":0.000012714929,"teacher_disagreement_score":0.94203216,"about_ca_system_score_codex":0.00023653227,"about_ca_system_score_gemma":0.00002543459,"threshold_uncertainty_score":0.9524208},"labels":[],"label_agreement":null},{"id":"W2952695922","doi":"10.1109/tcomm.2019.2923226","title":"Cross-Layer Cloud Offloading With Quality of Service Guarantees in Fog-RANs","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Quality of service; Computer network; Linear network coding; Edge device; Radio access network; Microservices; Distributed computing; Base station; Operating system","score_opus":0.08604028554765403,"score_gpt":0.3519697267116657,"score_spread":0.2659294411640117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952695922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21471082,0.00033198405,0.77277905,0.0047021187,0.00022803748,0.00051664904,0.000017354463,0.0001642927,0.006549717],"genre_scores_gemma":[0.98555684,0.0006648989,0.012856558,0.0004831035,0.000006235373,0.00006926926,0.0000042045713,0.000015188762,0.0003437052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818754,0.0004767748,0.0005608937,0.00029799662,0.00025134714,0.00022546785],"domain_scores_gemma":[0.99477494,0.00075581146,0.000176586,0.0038932445,0.00034134492,0.000058090394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063284795,0.00017459525,0.00029357668,0.00024197025,0.00032224014,0.000091417685,0.0027791206,0.00007607794,0.000097436256],"category_scores_gemma":[0.000007924776,0.00016676453,0.00008854693,0.0015128538,0.00012509458,0.0005571905,0.000037413243,0.00050951785,0.000089511246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006956728,0.0076017953,0.02726629,0.00047388396,0.0006753383,0.0000036772074,0.042858012,0.28470626,0.12154455,0.3478447,0.00018321538,0.16614662],"study_design_scores_gemma":[0.010393235,0.0008875839,0.08949829,0.0018456903,0.00008179604,0.000038750874,0.0016547444,0.8059261,0.07012722,0.0022284458,0.01482641,0.0024917205],"about_ca_topic_score_codex":0.00023719577,"about_ca_topic_score_gemma":0.004694314,"teacher_disagreement_score":0.770846,"about_ca_system_score_codex":0.00008504518,"about_ca_system_score_gemma":0.00011987494,"threshold_uncertainty_score":0.680046},"labels":[],"label_agreement":null},{"id":"W2953731820","doi":"10.1109/tcomm.2019.2926454","title":"Energy-Efficient Power Allocation Maximization With Mixed Group Sum Power Bound and QoS Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maximization; Mathematical optimization; Computer science; Wireless; Computational complexity theory; Power (physics); Constraint (computer-aided design); Optimization problem; Efficient energy use; Algorithm; Mathematics; Engineering; Electrical engineering","score_opus":0.008504534674429748,"score_gpt":0.20696754954490076,"score_spread":0.19846301487047102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953731820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013629842,0.00019505291,0.9799338,0.00015551476,0.00049750437,0.000496488,0.000043661297,0.0003920322,0.0046561356],"genre_scores_gemma":[0.9886055,0.00025702454,0.010569816,0.000045107383,0.0000075746425,0.00015963429,0.000060482686,0.000067418085,0.00022743824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896175,0.00008379511,0.00032220877,0.00024833047,0.0001654899,0.00021841028],"domain_scores_gemma":[0.9983743,0.00014429443,0.00007730088,0.0011750197,0.00013746598,0.00009163029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113884926,0.00022616342,0.00018748501,0.00022318136,0.00027240012,0.00007064637,0.00027085133,0.00012034217,0.000120824254],"category_scores_gemma":[0.000002811895,0.0002356498,0.000042955973,0.0004000303,0.00018532998,0.0002682868,0.0000042175816,0.00023503871,0.000051068117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023730952,0.00020539618,0.000035795307,0.000025294732,0.000092346716,4.1634982e-7,0.0006180306,0.9869121,0.0052324133,0.0034635803,0.00006633695,0.003324563],"study_design_scores_gemma":[0.0023252312,0.0003137428,0.00056634273,0.00029156383,0.00012229302,0.00007335316,0.0014560373,0.98136187,0.007541282,0.00014317018,0.004836872,0.00096822117],"about_ca_topic_score_codex":0.000020985684,"about_ca_topic_score_gemma":0.00016476793,"teacher_disagreement_score":0.97497565,"about_ca_system_score_codex":0.00015862663,"about_ca_system_score_gemma":0.000029928533,"threshold_uncertainty_score":0.960952},"labels":[],"label_agreement":null},{"id":"W2962828372","doi":"10.1109/tcomm.2018.2867458","title":"Stochastic Modeling and Analysis of User-Centric Network MIMO Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Telecommunications link; MIMO; Base station; Computer science; Backhaul (telecommunications); Beamforming; Cluster analysis; Cellular network; Computer network; Channel state information; Duplex (building); Stochastic geometry; Distributed computing; Channel (broadcasting); Telecommunications; Mathematics; Wireless","score_opus":0.023848315059189884,"score_gpt":0.25475568532545223,"score_spread":0.23090737026626235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962828372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035727909,0.00079195877,0.9944578,0.000018432682,0.00027434283,0.00024151403,0.000050274797,0.00019339767,0.00039951236],"genre_scores_gemma":[0.9888657,0.00044226382,0.010497277,0.000005159981,0.000026056383,0.00006746694,0.000015862403,0.000028119443,0.000052095493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991878,0.00006300189,0.0003706706,0.0001284208,0.000089379304,0.00016072018],"domain_scores_gemma":[0.9985179,0.00017451028,0.00005995456,0.0010355598,0.00015300466,0.000059113314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119705925,0.00012343121,0.0002532657,0.00037578173,0.00025237925,0.000022976103,0.0002645558,0.00007239012,0.000010800417],"category_scores_gemma":[0.0000045749352,0.00013950001,0.000068975125,0.0014216971,0.00008605719,0.0001364628,0.000003138906,0.00015012332,0.000008180936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037516384,0.000029752413,0.000008571443,0.000015169581,0.00036741977,3.547317e-8,0.00020990625,0.9983722,0.00012736839,0.00028454422,0.000015066799,0.0005662074],"study_design_scores_gemma":[0.0001332891,0.000020789008,0.000017121638,0.000055093777,0.000524354,0.0000015949661,0.00010920153,0.9989026,0.00004129602,0.00002257602,0.000057533874,0.00011454112],"about_ca_topic_score_codex":0.00006214414,"about_ca_topic_score_gemma":0.00021316497,"teacher_disagreement_score":0.9852929,"about_ca_system_score_codex":0.00006556074,"about_ca_system_score_gemma":0.0000120035975,"threshold_uncertainty_score":0.5688645},"labels":[],"label_agreement":null},{"id":"W2962835128","doi":"10.1109/tcomm.2016.2591530","title":"BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Converse; Bit error rate; Computer science; Erasure; Physical layer; Algorithm; Binary number; Transmission (telecommunications); Additive white Gaussian noise; Decoding methods; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Channel (broadcasting); Telecommunications; Arithmetic; Wireless; Combinatorics","score_opus":0.04125545553687764,"score_gpt":0.2765831914220022,"score_spread":0.23532773588512457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962835128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10082569,0.000090445,0.89283526,0.002369061,0.0000600539,0.00051106006,0.00022278885,0.001435877,0.0016497385],"genre_scores_gemma":[0.99221,0.0004683978,0.006743851,0.000058264326,0.00000998144,0.00038874015,0.000024317393,0.00006240225,0.000034053654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886745,0.00016924126,0.00029203593,0.00023332718,0.00020024012,0.00023769877],"domain_scores_gemma":[0.9962818,0.0010792086,0.00007905122,0.0022934761,0.00014288543,0.00012360446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015557322,0.00024657653,0.00023815993,0.00019545473,0.00039993104,0.000053275213,0.00069415563,0.00011050236,0.000034915043],"category_scores_gemma":[0.000009159452,0.00021226269,0.00007026194,0.00029906858,0.00040703197,0.00033569126,0.000009338556,0.00047866083,0.000043957392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095152826,0.01848455,0.0024300995,0.0010866567,0.00303701,0.0000120526465,0.04244299,0.24223986,0.19092497,0.1712914,0.004734447,0.32236445],"study_design_scores_gemma":[0.0032214404,0.0004513816,0.00048928516,0.0006288294,0.00023587397,0.000012762311,0.0008469186,0.8963297,0.08093434,0.0018467595,0.01375872,0.0012439885],"about_ca_topic_score_codex":0.000032807595,"about_ca_topic_score_gemma":0.00023902717,"teacher_disagreement_score":0.8913843,"about_ca_system_score_codex":0.00012735068,"about_ca_system_score_gemma":0.000043571665,"threshold_uncertainty_score":0.86558217},"labels":[],"label_agreement":null},{"id":"W2962991496","doi":"10.1109/tcomm.2017.2732444","title":"Unified Stochastic Geometry Modeling and Analysis of Cellular Networks in LOS/NLOS and Shadowed Fading","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; University of Toronto","funders":"","keywords":"Rician fading; Fading; Computer science; Stochastic geometry; Weibull fading; Rayleigh fading; Fading distribution; Moment-generating function; Nakagami distribution; Channel (broadcasting); Cumulative distribution function; Non-line-of-sight propagation; Channel state information; Algorithm; Electronic engineering; Wireless; Topology (electrical circuits); Probability density function; Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.02837614367257191,"score_gpt":0.2637484674678252,"score_spread":0.2353723237952533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962991496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021360867,0.00056274637,0.9774808,0.00003205399,0.000060097784,0.00018365956,0.000030015946,0.00005974669,0.00023000226],"genre_scores_gemma":[0.99395096,0.0006160963,0.005336419,0.0000025525953,0.0000041464523,0.000037711594,0.000014192882,0.000021586691,0.000016301612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993421,0.00003677946,0.0003017102,0.00013471663,0.00005921226,0.00012547102],"domain_scores_gemma":[0.9985093,0.00015282325,0.000074839336,0.0011675208,0.00004692309,0.000048577647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014219583,0.00011567367,0.00025103972,0.00053783576,0.0003612516,0.000042281532,0.00029607108,0.00008624607,0.000004697542],"category_scores_gemma":[0.000011232727,0.00013924109,0.00004534773,0.00041412454,0.00008772798,0.00023087345,0.000007058486,0.00024601707,4.2390045e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004044388,0.00002599923,0.00005322218,0.000014350336,0.00015038937,1.70378e-7,0.00019689629,0.9967972,0.00084481365,0.00017391791,3.3346643e-7,0.0017386654],"study_design_scores_gemma":[0.00023499531,0.000007681036,0.00023750136,0.00007168755,0.00024185282,6.854867e-7,0.00014074048,0.99870896,0.00018434225,0.00005677327,9.263485e-7,0.00011382115],"about_ca_topic_score_codex":0.00011186694,"about_ca_topic_score_gemma":0.00077548553,"teacher_disagreement_score":0.97259015,"about_ca_system_score_codex":0.000048329075,"about_ca_system_score_gemma":0.000006440378,"threshold_uncertainty_score":0.5678087},"labels":[],"label_agreement":null},{"id":"W2963011891","doi":"10.1109/tcomm.2019.2906307","title":"On the Performance of Network NOMA in Uplink CoMP Systems: A Stochastic Geometry Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council","keywords":"Noma; Telecommunications link; Base station; Stochastic geometry; Computer science; Spectral efficiency; Computer network; Bandwidth (computing); Transmission (telecommunications); Channel (broadcasting); Topology (electrical circuits); Telecommunications; Engineering; Mathematics; Electrical engineering","score_opus":0.020461792980777865,"score_gpt":0.2244320215318485,"score_spread":0.20397022855107064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963011891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25012696,0.00091573584,0.7438064,0.0003099283,0.00023276491,0.00091721537,0.000022935446,0.0005084896,0.003159583],"genre_scores_gemma":[0.99521565,0.00076965336,0.0034550738,0.000020410043,0.0000042894358,0.00042734752,0.000007916744,0.000034771638,0.00006487845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902356,0.00009095119,0.00039908415,0.00013409859,0.00014034433,0.00021197819],"domain_scores_gemma":[0.9954085,0.0011103213,0.000085258034,0.0033200725,0.00005227714,0.000023609347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022726967,0.00016588104,0.0002447115,0.0002567001,0.0001923036,0.00001718624,0.0015924241,0.00011335611,0.000017838189],"category_scores_gemma":[0.000008407058,0.00014617424,0.00006232691,0.00095083634,0.00017699068,0.000112982154,0.00001468077,0.0008485763,0.00008112435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008597362,0.00012808357,0.00003487092,0.000042536372,0.00003063463,2.237762e-8,0.0001054015,0.9876525,0.0001344208,0.010256753,0.000032107302,0.0015740698],"study_design_scores_gemma":[0.00024076067,0.000063397216,0.0003556865,0.00020820368,0.000008815995,0.0000025081447,0.00038986222,0.99775356,0.00049865915,0.00019558935,0.00012526156,0.00015769394],"about_ca_topic_score_codex":0.000014642713,"about_ca_topic_score_gemma":0.000014503746,"teacher_disagreement_score":0.7450887,"about_ca_system_score_codex":0.00012415081,"about_ca_system_score_gemma":0.000018207005,"threshold_uncertainty_score":0.5960812},"labels":[],"label_agreement":null},{"id":"W2963160721","doi":"10.1109/tcomm.2018.2859981","title":"Enhancing Cellular Performance Through Device-to-Device Distributed MIMO","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; Science and Industry Endowment Fund","keywords":"Cellular network; Telecommunications link; Computer science; Computer network; MIMO; Spectral efficiency; Resource allocation; Cellular communication; Shared resource; Base station; Channel (broadcasting)","score_opus":0.027186157513654025,"score_gpt":0.2664900598111716,"score_spread":0.23930390229751755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963160721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009227241,0.0001575296,0.9842227,0.0002717053,0.00052736024,0.00043665315,0.00008547804,0.0007494761,0.0043218276],"genre_scores_gemma":[0.9438919,0.0003801076,0.05498869,0.00013210834,0.00006609822,0.00022007019,0.000047121852,0.000066384295,0.00020752111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988499,0.00006453808,0.00042039182,0.00021835149,0.00013794443,0.00030883492],"domain_scores_gemma":[0.99768746,0.0001420055,0.000053736898,0.0018000286,0.00021179931,0.000104957086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011959328,0.00022486408,0.0001992176,0.0001316015,0.00067281607,0.000043735046,0.0006828206,0.000108295586,0.00007956891],"category_scores_gemma":[0.000008399802,0.00026159917,0.000067012115,0.0008651326,0.00010089794,0.00044654025,0.0000067163824,0.00033444422,0.0006024379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019380246,0.00018942085,0.000015945354,0.00011071379,0.000117892894,5.857272e-7,0.0023691047,0.9266463,0.06333237,0.00019096545,0.00048132375,0.006525984],"study_design_scores_gemma":[0.0005288019,0.00016588948,0.00007328901,0.00036481634,0.00009835889,0.000010567205,0.00050775474,0.35046318,0.57452774,0.00006246524,0.07248302,0.00071414746],"about_ca_topic_score_codex":0.000028215756,"about_ca_topic_score_gemma":0.00042472,"teacher_disagreement_score":0.93466467,"about_ca_system_score_codex":0.00022255002,"about_ca_system_score_gemma":0.00002974006,"threshold_uncertainty_score":0.9999836},"labels":[],"label_agreement":null},{"id":"W2963163286","doi":"10.1109/tcomm.2018.2863377","title":"Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Low-density parity-check code; Algorithm; Binary number; Generator matrix; Logarithm; Mathematics; Upper and lower bounds; Encoder; Estimator; Decoding methods; Computer science; Arithmetic; Statistics","score_opus":0.10097820859671244,"score_gpt":0.3284064398404089,"score_spread":0.22742823124369646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963163286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014283865,0.0005209003,0.9808964,0.017255466,0.000091083195,0.0005597899,0.000019783945,0.0001425197,0.0003712209],"genre_scores_gemma":[0.8646034,0.0032879028,0.13056763,0.000655437,0.000016841339,0.00038092403,0.000003838135,0.000010958714,0.00047310148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988064,0.00036290847,0.00025286566,0.00026568325,0.00011839067,0.00019374909],"domain_scores_gemma":[0.99490297,0.0017441235,0.00008416338,0.0029158464,0.00028588154,0.00006700408],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00055519893,0.0001396327,0.00015449495,0.00023117791,0.0023169024,0.0001906678,0.0022419002,0.000057418096,0.000026051888],"category_scores_gemma":[0.0000074726872,0.00011229332,0.00011707982,0.0014184726,0.00047466735,0.00025548256,0.00004305354,0.00026118383,0.000022578244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001463606,0.0019420042,0.00015757351,0.000027514427,0.0038719145,0.0000010065618,0.0100201545,0.12829442,0.0038905684,0.19257198,0.0042368732,0.65483963],"study_design_scores_gemma":[0.00038406218,0.00018102622,0.00074483454,0.000019036177,0.00028625285,0.0000064621095,0.00008997744,0.9801654,0.0012948253,0.0020951824,0.014520994,0.00021194483],"about_ca_topic_score_codex":0.000015957132,"about_ca_topic_score_gemma":0.0011580786,"teacher_disagreement_score":0.8644605,"about_ca_system_score_codex":0.000054014065,"about_ca_system_score_gemma":0.000076731674,"threshold_uncertainty_score":0.99898195},"labels":[],"label_agreement":null},{"id":"W2963354877","doi":"10.1109/tcomm.2019.2910265","title":"Symbol-by-Symbol Maximum Likelihood Detection for Cooperative Molecular Communication","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Molecular communication; Symbol (formal); Algorithm; Detector; Intersymbol interference; Fusion center; Computer science; Transmitter; Detection theory; Interference (communication); Binary number; Sequence (biology); Communications system; Mathematics; Telecommunications; Decoding methods; Arithmetic; Wireless; Channel (broadcasting)","score_opus":0.008568695613415892,"score_gpt":0.22582022307120805,"score_spread":0.21725152745779217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963354877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010946079,0.0021760885,0.9763206,0.0008388028,0.00033952197,0.001576829,0.00013452335,0.0006629044,0.0070046186],"genre_scores_gemma":[0.989583,0.0026807273,0.005744081,0.00027921252,0.00000928639,0.001103488,0.00018609589,0.00010658616,0.00030753453],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844223,0.00026952734,0.0004785969,0.0002656406,0.00019482177,0.00034917903],"domain_scores_gemma":[0.99538755,0.00040491985,0.00008598059,0.0037612228,0.00022778654,0.0001325616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028035193,0.00030408427,0.0002906816,0.00020600951,0.00056038366,0.000098126846,0.0013433385,0.0002380168,0.00013611364],"category_scores_gemma":[0.000008079048,0.00035792124,0.00021613418,0.0005405973,0.000113005044,0.00023929449,0.000013827365,0.00070477795,0.00027889427],"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.00017291532,0.0014480083,0.000016304133,0.00017202587,0.000970449,6.341175e-7,0.0018016048,0.15901431,0.61566067,0.0022480795,0.0056055915,0.21288942],"study_design_scores_gemma":[0.0026550835,0.00035290656,0.00003235028,0.00019850681,0.00022539175,0.000015507729,0.0007480769,0.50477266,0.4160908,0.0017654853,0.07197732,0.0011659409],"about_ca_topic_score_codex":0.00002588028,"about_ca_topic_score_gemma":0.00015378017,"teacher_disagreement_score":0.9786369,"about_ca_system_score_codex":0.00018811072,"about_ca_system_score_gemma":0.000039484818,"threshold_uncertainty_score":0.9998873},"labels":[],"label_agreement":null},{"id":"W2963415238","doi":"10.1109/tcomm.2018.2869596","title":"Mixed-ADC/DAC Multipair Massive MIMO Relaying Systems: Performance Analysis and Power Optimization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Beijing Municipal Science and Technology Commission; Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; Southeast University; National Natural Science Foundation of China","keywords":"Converters; Effective number of bits; Electronic engineering; MIMO; Computer science; Quantization (signal processing); Bandwidth (computing); Power (physics); Engineering; Electrical engineering; Voltage; Algorithm; Beamforming; CMOS; Telecommunications","score_opus":0.04484471352069685,"score_gpt":0.27558948873560074,"score_spread":0.23074477521490389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963415238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004952641,0.000528313,0.98940307,0.001698959,0.00032169407,0.0002952202,0.0000105422705,0.00028241388,0.0025071558],"genre_scores_gemma":[0.91785944,0.0037143738,0.077741176,0.00017673607,0.000016125028,0.0001288905,0.000009603924,0.000015592412,0.00033807172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829376,0.0004571157,0.0004191866,0.00037532742,0.00021091795,0.00024369615],"domain_scores_gemma":[0.99570805,0.0004110252,0.00017008436,0.0031199453,0.00046575567,0.0001251153],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004108372,0.00020352911,0.00024772488,0.0005332222,0.0018521344,0.00027573208,0.0016534635,0.00009776672,0.000046866724],"category_scores_gemma":[0.000016800937,0.00020910049,0.00011000244,0.0021326886,0.00030089068,0.00071882486,0.00005748813,0.0003781513,0.000057013873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048885293,0.0010194837,0.00095947797,0.000037886028,0.0014817845,0.0000016369241,0.009484978,0.84348524,0.0010643512,0.023393717,0.0007183082,0.11830426],"study_design_scores_gemma":[0.0002709609,0.0001050477,0.0009876445,0.00005649364,0.000116028,0.0000053745985,0.00019174452,0.9949922,0.0006713956,0.000011041836,0.002350537,0.00024154049],"about_ca_topic_score_codex":0.000029586401,"about_ca_topic_score_gemma":0.00020664812,"teacher_disagreement_score":0.91290677,"about_ca_system_score_codex":0.00010650068,"about_ca_system_score_gemma":0.00006654181,"threshold_uncertainty_score":0.99944735},"labels":[],"label_agreement":null},{"id":"W2963624992","doi":"10.1109/tcomm.2018.2831222","title":"Framework of Channel Estimation for Hybrid Analog-and-Digital Processing Enabled Massive MIMO Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Precoding; Channel (broadcasting); MIMO; Computer science; Channel state information; Spatial correlation; Electronic engineering; Radio frequency; Algorithm; Telecommunications; Engineering; Wireless","score_opus":0.028499908156040817,"score_gpt":0.28784022768397516,"score_spread":0.25934031952793435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963624992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045559264,0.00046252084,0.99594206,0.0004600064,0.00015145076,0.00068774895,0.00026109148,0.00031689837,0.0012626147],"genre_scores_gemma":[0.81476855,0.00038002979,0.18424372,0.000020813488,0.000022006938,0.0003840202,0.000073747055,0.000048438225,0.000058648966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990033,0.000045980814,0.0004758546,0.00017536311,0.00009889944,0.00020062445],"domain_scores_gemma":[0.9971563,0.0005050248,0.0001495472,0.0017423781,0.00037352668,0.000073215684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012850715,0.00018730649,0.00023868533,0.00024909963,0.00061443954,0.000067762805,0.00065316074,0.00010625631,0.000008174631],"category_scores_gemma":[0.000047681282,0.00021642496,0.00007689146,0.00042825655,0.00039060065,0.00054367696,0.00001075609,0.0002628223,0.000013152608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006863165,0.0005687273,0.0000113823635,0.00042702182,0.00029712962,2.1374724e-7,0.0042174663,0.8439401,0.0025872376,0.005077069,0.00031597572,0.14248906],"study_design_scores_gemma":[0.00033239304,0.00009248981,0.000010020176,0.00026558037,0.00007447468,0.0000064314877,0.00034365014,0.98661906,0.0071465694,0.004238705,0.0006518047,0.0002188392],"about_ca_topic_score_codex":0.000009037121,"about_ca_topic_score_gemma":0.000041655097,"teacher_disagreement_score":0.814313,"about_ca_system_score_codex":0.00009508516,"about_ca_system_score_gemma":0.00004298649,"threshold_uncertainty_score":0.88255537},"labels":[],"label_agreement":null},{"id":"W2963875807","doi":"10.1109/tcomm.2017.2734768","title":"Dynamic Spectrum Access in Time-Varying Environment: Distributed Learning Beyond Expectation Optimization","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Performance metric; Mathematical optimization; Metric (unit); Q-learning; Nash equilibrium; Quality of service; Ordinal optimization; Potential game; Convergence (economics); Reinforcement learning; Mathematics; Artificial intelligence; Ordinal regression; Machine learning; Computer network","score_opus":0.020409931767824598,"score_gpt":0.2739983472998319,"score_spread":0.25358841553200734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963875807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032536797,0.00007200192,0.99123836,0.003452584,0.00013135768,0.00025029405,0.0000117995805,0.00014815392,0.0014417805],"genre_scores_gemma":[0.9821745,0.0009909031,0.016526138,0.000041649262,0.000010761104,0.00004248741,0.00004476727,0.00001921181,0.00014956946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986412,0.00020513147,0.00030254468,0.00035635885,0.00022090173,0.00027386175],"domain_scores_gemma":[0.99745315,0.0002536579,0.0002237929,0.0019655214,0.00003139967,0.00007245099],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00022318856,0.00017216655,0.00017696604,0.00023874347,0.0020433061,0.0008131397,0.0022078129,0.00007986845,0.000051352687],"category_scores_gemma":[0.00001650312,0.00020398584,0.000082315346,0.00027237428,0.00013758738,0.0013563205,0.000051184095,0.00052458735,0.000048944054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010070834,0.0002040524,0.00013936621,0.000002532354,0.0000215433,0.0000035986243,0.00036012745,0.9816108,0.00018493489,0.00017856447,0.000005169875,0.017279278],"study_design_scores_gemma":[0.00045780564,0.00003805484,0.0032570264,0.00006533622,0.00001506212,0.000008592872,0.000025389561,0.9946488,0.0005939259,0.00059765903,0.00007974778,0.00021259226],"about_ca_topic_score_codex":0.000086762324,"about_ca_topic_score_gemma":0.00018774945,"teacher_disagreement_score":0.9789208,"about_ca_system_score_codex":0.00025080034,"about_ca_system_score_gemma":0.000037660524,"threshold_uncertainty_score":0.9992559},"labels":[],"label_agreement":null},{"id":"W2963929289","doi":"10.1109/tcomm.2016.2605688","title":"Joint Transceiver Design Algorithms for Multiuser MISO Relay Systems with Energy Harvesting","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Joint (building); Relay; Transceiver; Energy harvesting; Computer science; Electronic engineering; Energy (signal processing); Algorithm; Wireless; Engineering; Telecommunications; Mathematics; Physics","score_opus":0.06760657515605088,"score_gpt":0.23908669005100272,"score_spread":0.17148011489495185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963929289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027810197,0.0005076068,0.99638885,0.00029867215,0.0004145682,0.00037247947,0.00007456916,0.0008956231,0.0007695027],"genre_scores_gemma":[0.8740488,0.0008253921,0.12100692,0.00003169022,0.00006157848,0.0012188103,0.000008764882,0.00014654805,0.002651462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.0001637889,0.00042470472,0.00026994097,0.0001730509,0.000384375],"domain_scores_gemma":[0.99676454,0.0013936445,0.00007340815,0.0014736829,0.00015500294,0.00013969709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024339899,0.0002899714,0.00026831217,0.00016868634,0.00048655446,0.000068988316,0.0005960572,0.0001674408,0.000013904709],"category_scores_gemma":[0.000010684338,0.00022724355,0.00011481874,0.00028716872,0.00017490747,0.00028624985,0.0000018918641,0.00026760553,0.000013565918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019988875,0.00009615652,0.0000022057325,0.000027770275,0.00015621979,0.0000010043037,0.00014442208,0.96303254,0.0055371034,0.0004439087,0.00030537922,0.030233327],"study_design_scores_gemma":[0.0015039603,0.00017740497,0.00003203936,0.0008803375,0.00014086551,0.00003366542,0.000060496328,0.9567651,0.02200341,0.00005072973,0.017753258,0.00059871754],"about_ca_topic_score_codex":0.00013411812,"about_ca_topic_score_gemma":0.00035402054,"teacher_disagreement_score":0.87538195,"about_ca_system_score_codex":0.00017306769,"about_ca_system_score_gemma":0.00004335563,"threshold_uncertainty_score":0.9266723},"labels":[],"label_agreement":null},{"id":"W2963976549","doi":"10.1109/tcomm.2018.2842758","title":"Hybrid Data-Sharing and Compression Strategy for Downlink Cloud Radio Access Network","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Backhaul (telecommunications); Cloud computing; Computer network; Telecommunications link; Computer science; Radio access network; Data transmission; C-RAN; Base station","score_opus":0.10985973648751568,"score_gpt":0.34576621648552647,"score_spread":0.2359064799980108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963976549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000533613,0.0005186169,0.99570686,0.0001265518,0.00055697217,0.00056351104,0.0002461475,0.00042472515,0.0013230249],"genre_scores_gemma":[0.96562845,0.0008796643,0.032640036,0.000032953438,0.00023136899,0.0001833082,0.00024538764,0.000058251026,0.00010055891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990562,0.000043358858,0.0003199811,0.0002813638,0.00007018135,0.00022892412],"domain_scores_gemma":[0.9970359,0.0002191784,0.00005994289,0.0025163025,0.000087012944,0.00008164474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001942418,0.00016456151,0.00017876762,0.00008474676,0.0006878254,0.00012239997,0.0013811105,0.00006884505,0.000021440082],"category_scores_gemma":[0.0000055346723,0.000180644,0.000033078057,0.00019147301,0.00012790065,0.00062015036,0.000027487918,0.0002425848,0.000012470835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018700935,0.00005052878,0.000010992916,0.000044691256,0.00006835697,1.4758074e-7,0.00007967122,0.97865295,0.00030524263,0.00039046106,0.0034719727,0.016906267],"study_design_scores_gemma":[0.0004209246,0.000042737563,0.000017173938,0.000108026674,0.000053632713,0.000009607069,0.000033081513,0.98466796,0.0015933528,0.00072159246,0.012121829,0.00021006289],"about_ca_topic_score_codex":0.00001985234,"about_ca_topic_score_gemma":0.00017053516,"teacher_disagreement_score":0.96509486,"about_ca_system_score_codex":0.00005848087,"about_ca_system_score_gemma":0.000017654702,"threshold_uncertainty_score":0.7366448},"labels":[],"label_agreement":null},{"id":"W2964028508","doi":"10.1109/tcomm.2017.2710185","title":"Massive Machine Type Communication With Data Aggregation and Resource Scheduling","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","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":"Carleton University","funders":"Australian Research Council","keywords":"Scheduling (production processes); Computer science; Data aggregator; Stochastic geometry; Base station; Computer network; Schedule; Channel (broadcasting); Cellular network; Distributed computing; Mathematical optimization; Wireless sensor network; Mathematics","score_opus":0.05930264593296651,"score_gpt":0.3029590654112676,"score_spread":0.24365641947830108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964028508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007339743,0.0047127954,0.9469967,0.0067967335,0.00030525084,0.005058306,0.00029473111,0.0009258557,0.027569909],"genre_scores_gemma":[0.96986103,0.0023929942,0.027058838,0.000041991538,0.000020153027,0.000334096,0.00010056735,0.000036713267,0.00015360535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993731,0.0000736674,0.00016828389,0.00015400206,0.000098932105,0.0001320385],"domain_scores_gemma":[0.99417114,0.00016834046,0.000081078506,0.0054573645,0.000062315965,0.000059750084],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00020747121,0.00013118067,0.00012213393,0.00006334665,0.0014520785,0.00020431298,0.0015262067,0.00007670416,0.000021423832],"category_scores_gemma":[0.000008276256,0.00012632257,0.00001649403,0.000099539975,0.00020573936,0.0004333256,0.000026611138,0.00046433022,0.00001952238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018062971,0.00028298845,0.00030111388,0.00011495145,0.00040112287,0.0000023904008,0.0013411455,0.23838094,0.00050413347,0.0020985666,0.0014983839,0.75489366],"study_design_scores_gemma":[0.0006669423,0.00007557127,0.00049924705,0.0003137035,0.00008409606,0.000012208063,0.00008479898,0.9549766,0.0009887081,0.0003123456,0.041692317,0.00029345628],"about_ca_topic_score_codex":0.00008907495,"about_ca_topic_score_gemma":0.000792818,"teacher_disagreement_score":0.9625213,"about_ca_system_score_codex":0.000032183823,"about_ca_system_score_gemma":0.000020726638,"threshold_uncertainty_score":0.9998479},"labels":[],"label_agreement":null},{"id":"W2965337571","doi":"10.1109/tcomm.2019.2933217","title":"Joint Power Control and User Association for NOMA-Based Full-Duplex Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":71,"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":"Institute for Information and Communications Technology Promotion; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Telecommunications link; Computer science; Decoding methods; Power control; Mathematical optimization; Relaxation (psychology); Computational complexity theory; Benchmark (surveying); Transmitter power output; Algorithm; Convex optimization; Power (physics); Regular polygon; Mathematics; Computer network; Transmitter","score_opus":0.016680600826656965,"score_gpt":0.23414695849941664,"score_spread":0.21746635767275968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965337571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01759466,0.0007695606,0.97645855,0.001529108,0.0003609565,0.001208213,0.00023236114,0.0011724649,0.0006741331],"genre_scores_gemma":[0.98922414,0.0004730778,0.0090983845,0.00006736615,0.000005236195,0.0006192513,0.000019698879,0.000051071685,0.00044178244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990581,0.00007368218,0.00034887888,0.0001634006,0.00013436722,0.00022152484],"domain_scores_gemma":[0.99686277,0.00089723634,0.00010852082,0.0019212058,0.00016206314,0.000048232116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020845568,0.00017800953,0.00025281264,0.00020520765,0.0002742149,0.0000641512,0.0005561728,0.00018616208,0.00002033567],"category_scores_gemma":[0.000023285507,0.00019758675,0.00009305592,0.00021974595,0.00006587112,0.00019533378,0.0000046045448,0.000388044,0.000071669376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002400243,0.00014239576,0.00008181267,0.00006431486,0.00015282347,5.8045835e-8,0.00012358872,0.9767011,0.017361866,0.0022971563,0.00047875982,0.002572155],"study_design_scores_gemma":[0.0019183318,0.00013656779,0.0003948608,0.00008909709,0.00005479056,0.0000022896431,0.00043280868,0.9626725,0.0056850105,0.00008958273,0.028143799,0.0003803971],"about_ca_topic_score_codex":0.000011757453,"about_ca_topic_score_gemma":0.00004116778,"teacher_disagreement_score":0.97162944,"about_ca_system_score_codex":0.0002987011,"about_ca_system_score_gemma":0.00002429285,"threshold_uncertainty_score":0.80573535},"labels":[],"label_agreement":null},{"id":"W2965447052","doi":"10.1109/tcomm.2019.2932072","title":"Maximum Likelihood Detection in a Four-Dimensional Stokes-Space Receiver","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","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":"Algorithm; Constellation; Symbol (formal); Detection theory; Signal-to-noise ratio (imaging); Phase (matter); Channel (broadcasting); Mathematics; Sequence (biology); Computer science; SIGNAL (programming language); Bit error rate; Monte Carlo method; Statistics; Telecommunications; Physics; Decoding methods; Detector","score_opus":0.015787134971566537,"score_gpt":0.22432012727589598,"score_spread":0.20853299230432945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965447052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68541723,0.0007256076,0.2869178,0.0036487596,0.0016550348,0.0013428428,0.000054685075,0.0034308778,0.016807145],"genre_scores_gemma":[0.9867192,0.00050456426,0.012445047,0.00003802357,0.000008053429,0.00012036386,0.0000028173931,0.000037633807,0.00012430172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911886,0.00005904624,0.00023412958,0.00017282802,0.00014276344,0.00027234366],"domain_scores_gemma":[0.9982154,0.0003001074,0.000023039916,0.0013672695,0.000042008407,0.000052189334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012258734,0.00016105741,0.000163879,0.00028917595,0.00012487291,0.000024180277,0.000494032,0.00017688611,0.00011905091],"category_scores_gemma":[0.0000059262156,0.0001794466,0.0000784933,0.00063172623,0.0000808546,0.00018301516,0.0000067997767,0.00079909543,0.0006344578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006184015,0.000502718,0.00018376509,0.00005308553,0.00015381699,0.0000039706742,0.00028882633,0.71996295,0.026368177,0.0009793725,0.00045611433,0.25098538],"study_design_scores_gemma":[0.0014291942,0.00024400398,0.0029217864,0.00020288373,0.00005830203,0.00003081285,0.0002748,0.9486243,0.029909259,0.0050879493,0.010448598,0.0007681192],"about_ca_topic_score_codex":0.000035387944,"about_ca_topic_score_gemma":0.00078355527,"teacher_disagreement_score":0.30130196,"about_ca_system_score_codex":0.00020574484,"about_ca_system_score_gemma":0.000017520884,"threshold_uncertainty_score":0.81548834},"labels":[],"label_agreement":null},{"id":"W2965808107","doi":"10.1109/tcomm.2019.2931972","title":"Robust Energy-Efficient Design for MISO Non-Orthogonal Multiple Access Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Base station; Single antenna interference cancellation; Spectral efficiency; Interference (communication); Orthogonal frequency-division multiple access; Algorithm; Cluster analysis; Mathematical optimization; Orthogonal frequency-division multiplexing; Mathematics; Channel (broadcasting); Computer network; Decoding methods","score_opus":0.07363820651431688,"score_gpt":0.27196957154656787,"score_spread":0.198331365032251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965808107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021776096,0.0007024377,0.9932042,0.0002642481,0.00049570296,0.0009679522,0.00013012148,0.0012059793,0.0008517607],"genre_scores_gemma":[0.9523743,0.0011790885,0.044131868,0.000026929654,0.000010140777,0.001883184,0.000036151727,0.00007635413,0.000281985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880654,0.00007810064,0.00041602715,0.0002362423,0.00016137834,0.0003017381],"domain_scores_gemma":[0.99525905,0.0011852848,0.00008619699,0.0032455216,0.00015610355,0.00006786348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016536245,0.00024328017,0.0002629638,0.0002966426,0.00043713138,0.000095984375,0.0021866828,0.00017182657,0.000022912058],"category_scores_gemma":[0.000011974393,0.00026878365,0.00013328777,0.0004197363,0.00012444753,0.00023151301,0.000018911936,0.00040061332,0.00006526374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014058216,0.00016230682,0.000007503013,0.000035696827,0.000061502426,7.300944e-8,0.000058536305,0.98934597,0.0023958345,0.0014641677,0.0002537278,0.0062006325],"study_design_scores_gemma":[0.0005252991,0.000045209414,0.000030893065,0.000073589064,0.000020972708,0.000003288572,0.0001721208,0.9770471,0.015608656,0.00015885902,0.0060232007,0.00029081572],"about_ca_topic_score_codex":0.00003132639,"about_ca_topic_score_gemma":0.0000583068,"teacher_disagreement_score":0.9501967,"about_ca_system_score_codex":0.00018456294,"about_ca_system_score_gemma":0.000042535303,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null},{"id":"W2966955883","doi":"10.1109/tcomm.2019.2935728","title":"Energy and Spectral Efficiency Analysis for a Device-to-Device-Enabled Millimeter-Wave OFDMA Cellular Network","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spectral efficiency; Cellular network; Stochastic geometry; Base station; Computer science; Path loss; Interference (communication); Electronic engineering; Efficient energy use; Bandwidth (computing); Transmitter power output; Coverage probability; Topology (electrical circuits); Computer network; Engineering; Mathematics; Electrical engineering; Telecommunications; Beamforming; Wireless; Statistics; Transmitter","score_opus":0.034248492588933706,"score_gpt":0.2414461284680043,"score_spread":0.2071976358790706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966955883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074000835,0.00079851015,0.9229016,0.00030934613,0.0002241673,0.00047787148,0.00006619827,0.00021892984,0.0010026015],"genre_scores_gemma":[0.974851,0.00086133886,0.023128418,0.00023552706,0.000034727123,0.00030935073,0.000038317827,0.00005041825,0.0004908649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870914,0.00007820278,0.00041120892,0.00029535496,0.00014429278,0.00036177333],"domain_scores_gemma":[0.998181,0.00028466436,0.00005254997,0.0012060833,0.00011272233,0.00016297956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022007573,0.0002341234,0.00033710012,0.0004375543,0.00037470306,0.00007708449,0.00036698554,0.00010562171,0.0001340949],"category_scores_gemma":[0.0000026845614,0.00025257407,0.00023998882,0.0010777639,0.00003611022,0.000115718525,0.000007467525,0.00020085422,0.000030326011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019235966,0.00011884851,0.000038351533,0.00004462017,0.0006582636,2.6240505e-7,0.000419283,0.95677847,0.034291588,0.00015083699,0.00008594982,0.0073942915],"study_design_scores_gemma":[0.0004160643,0.00008815708,0.00004941835,0.000043062508,0.00055429735,0.0000015385098,0.00008540142,0.95514923,0.039222915,0.00016259539,0.0038988716,0.00032845465],"about_ca_topic_score_codex":0.00006388083,"about_ca_topic_score_gemma":0.00053224154,"teacher_disagreement_score":0.9008502,"about_ca_system_score_codex":0.00007762421,"about_ca_system_score_gemma":0.000023875455,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W2969090546","doi":"10.1109/tcomm.2019.2935714","title":"An Adaptive and Parameter-Free Recurrent Neural Structure for Wireless Channel Prediction","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":60,"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":"Computer science; Channel (broadcasting); Channel state information; Recurrent neural network; Wireless; Machine learning; Artificial neural network; Artificial intelligence; Data mining; Computer network; Telecommunications","score_opus":0.04435555621110145,"score_gpt":0.27633187079983973,"score_spread":0.23197631458873827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969090546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055320174,0.000042593394,0.9404695,0.0019119222,0.0007072902,0.00092785305,0.00031219484,0.0002532176,0.00005526291],"genre_scores_gemma":[0.9691072,0.00005337956,0.030323228,0.00010156174,0.00003174173,0.00027041454,0.000043259657,0.00002098164,0.00004822028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861294,0.00019977494,0.00031049462,0.0004574542,0.00021562174,0.00020372467],"domain_scores_gemma":[0.99610937,0.00048736352,0.00014939133,0.0029157833,0.00021855792,0.000119551245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015243102,0.00018510784,0.00017390188,0.00020759877,0.00048030395,0.00014774481,0.0015279441,0.000120693985,0.000009338514],"category_scores_gemma":[0.000008120007,0.00019327828,0.00007308367,0.0003483511,0.00009904013,0.0009355263,0.000014618518,0.00031472548,0.000008111789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043255254,0.0025472208,0.00030947826,0.00013809108,0.00031282264,6.0246987e-7,0.0065282723,0.16106376,0.053220913,0.120533116,0.0006342878,0.6542789],"study_design_scores_gemma":[0.0006116546,0.00053173304,0.0016824583,0.000028737266,0.000023173248,0.00000686718,0.00009988964,0.9883864,0.0031411876,0.0051281415,0.00017052278,0.0001892566],"about_ca_topic_score_codex":0.00002042483,"about_ca_topic_score_gemma":0.00009345885,"teacher_disagreement_score":0.91378707,"about_ca_system_score_codex":0.00009180095,"about_ca_system_score_gemma":0.00005037612,"threshold_uncertainty_score":0.7881659},"labels":[],"label_agreement":null},{"id":"W2972189300","doi":"10.1109/tcomm.2019.2939473","title":"Joint Transmission Scheduling and Power Allocation in Non-Orthogonal Multiple Access","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Toronto Metropolitan University","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Telecommunications link; Efficient energy use; Base station; Single antenna interference cancellation; Throughput; Noma; Optimization problem; Heuristic; Multiplexing; Interference (communication); Mathematical optimization; Channel (broadcasting); Computer network; Wireless; Engineering; Algorithm; Telecommunications; Electrical engineering","score_opus":0.027388836741652513,"score_gpt":0.2731394315955342,"score_spread":0.2457505948538817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972189300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2104177,0.00045089665,0.7860504,0.00085514673,0.000099388664,0.00046264057,0.000012296144,0.00051151804,0.0011400231],"genre_scores_gemma":[0.9759942,0.0034337994,0.020224927,0.000041568743,0.000002161782,0.00020994876,0.000013277266,0.000040416562,0.0000396521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990624,0.00005194498,0.0003655914,0.00019714441,0.00012489241,0.00019798943],"domain_scores_gemma":[0.99793756,0.00026079902,0.00004785284,0.0016456273,0.000052960564,0.000055174998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013850292,0.00018021378,0.00019805574,0.00037521686,0.00018271687,0.000049473918,0.00082036806,0.0001468616,0.00005110365],"category_scores_gemma":[0.000007468322,0.00020219693,0.000055105775,0.00042190813,0.0001097792,0.0005080689,0.000015577234,0.00068098283,0.000048368704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016377033,0.000226305,0.00043331145,0.000055807246,0.00003506379,3.907116e-7,0.0004890205,0.86709684,0.047947038,0.00075156457,0.000010556957,0.08293773],"study_design_scores_gemma":[0.0010643392,0.00005271228,0.007729457,0.0002782074,0.000012506224,0.000006433238,0.00051268435,0.92397314,0.06349879,0.0012230673,0.0012019826,0.00044669682],"about_ca_topic_score_codex":0.000021680014,"about_ca_topic_score_gemma":0.00011824566,"teacher_disagreement_score":0.76582545,"about_ca_system_score_codex":0.000109255,"about_ca_system_score_gemma":0.000021050992,"threshold_uncertainty_score":0.82453513},"labels":[],"label_agreement":null},{"id":"W2980169183","doi":"10.1109/tcomm.2019.2946814","title":"Generalized FFT-Based One-Bit Quantization System for Wideband Spectrum Sensing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantization (signal processing); Fast Fourier transform; Computer science; Wideband; Electronic engineering; Asynchronous communication; False alarm; Algorithm; Telecommunications; Engineering; Artificial intelligence","score_opus":0.034783312886199305,"score_gpt":0.2630398579170746,"score_spread":0.22825654503087534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980169183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004990896,0.00009908388,0.987251,0.0044911667,0.0006949704,0.00077958783,0.000020912086,0.0004192936,0.0012531028],"genre_scores_gemma":[0.8885179,0.00005602132,0.11090991,0.0002256217,0.00003963495,0.000025187888,0.000017975426,0.000028998858,0.00017871211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846715,0.00022250149,0.00037183033,0.0003965683,0.0002196786,0.00032226462],"domain_scores_gemma":[0.9968549,0.0006881531,0.0001476318,0.0020497295,0.00016929582,0.00009027943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025275242,0.00019759189,0.00027393686,0.00025594226,0.00077028974,0.00023310204,0.0007552268,0.000094635085,0.000010733331],"category_scores_gemma":[0.000005580027,0.00021915465,0.00019808568,0.00063026574,0.000061833205,0.00029051251,0.000007200673,0.0002525781,0.000065861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048783896,0.0022003395,0.00013954718,0.00049779896,0.00089037063,0.000012515454,0.0025746317,0.3238515,0.09977714,0.36582145,0.00063842605,0.20310846],"study_design_scores_gemma":[0.0010877479,0.000114031456,0.000036204623,0.00019117008,0.00005323854,0.000017866918,0.000055096894,0.97488683,0.021463063,0.0005656666,0.0012513603,0.00027774583],"about_ca_topic_score_codex":0.00010136581,"about_ca_topic_score_gemma":0.00038709785,"teacher_disagreement_score":0.88352704,"about_ca_system_score_codex":0.00020639678,"about_ca_system_score_gemma":0.00011932752,"threshold_uncertainty_score":0.8936867},"labels":[],"label_agreement":null},{"id":"W2980465753","doi":"10.1109/tcomm.2019.2947441","title":"Bridging the Gap Between MMSE-DFE and Optimal Detection of MIMO Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"MIMO; Computer science; Detector; Minimum mean square error; Algorithm; Computational complexity theory; Equalization (audio); Channel (broadcasting); Metric (unit); Decoding methods; Mathematics; Telecommunications; Engineering","score_opus":0.026824387930059857,"score_gpt":0.25985160676380686,"score_spread":0.233027218833747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980465753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066517904,0.0010076516,0.9297839,0.00024262593,0.00013543661,0.0005299486,0.000051710937,0.0005285704,0.001202249],"genre_scores_gemma":[0.994281,0.0018478582,0.0035498359,0.00000979348,0.000012731163,0.00016763502,0.000005927125,0.000039093913,0.000086129614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991511,0.0001275906,0.00034064485,0.0001159948,0.00012571759,0.00013891258],"domain_scores_gemma":[0.9972485,0.0004707832,0.0000818342,0.002082037,0.00007584263,0.000041014373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020041995,0.0001387761,0.00019430873,0.0001522663,0.0002748783,0.000032349097,0.0007098088,0.0000841285,0.0000073686365],"category_scores_gemma":[0.000004023636,0.00013091552,0.00006286111,0.00030171298,0.00015401981,0.00019572223,0.000010414539,0.00047591195,0.000021693397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022227403,0.00018137415,0.00026075044,0.00027136013,0.00036706694,1.731007e-7,0.0017880838,0.613457,0.17537908,0.0018576263,0.000095599404,0.20631962],"study_design_scores_gemma":[0.0005572243,0.00014307408,0.0012304534,0.00031771703,0.0001377872,0.00002004838,0.00093085977,0.7103151,0.27785343,0.0002188613,0.007747599,0.00052781694],"about_ca_topic_score_codex":0.00007480614,"about_ca_topic_score_gemma":0.000034671673,"teacher_disagreement_score":0.9277631,"about_ca_system_score_codex":0.000069781854,"about_ca_system_score_gemma":0.0000116200135,"threshold_uncertainty_score":0.533858},"labels":[],"label_agreement":null},{"id":"W2981066294","doi":"10.1109/tcomm.2019.2947509","title":"A Game-Theoretic Analysis for Complementary and Substitutable IoT Services Delivery With Externalities","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Transportation and Mobility Innovations","field":"Engineering","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":"York University","funders":"National Research Foundation of Korea; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Stackelberg competition; Computer science; Service provider; Internet of Things; Service (business); Computer network; Backward induction; Game theory; Computer security; Business; Marketing","score_opus":0.016440721435037043,"score_gpt":0.23686351490469432,"score_spread":0.22042279346965726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981066294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6008684,0.00013950544,0.3970919,0.0002115396,0.000056679724,0.00046158908,0.00047921998,0.00020109215,0.0004901052],"genre_scores_gemma":[0.99213797,0.00024919637,0.006894722,0.00010491617,0.000004070417,0.00024258284,0.00019830708,0.000019314986,0.00014894316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993881,0.000020072557,0.0002287126,0.00013483055,0.00009111696,0.00013717596],"domain_scores_gemma":[0.998922,0.000171361,0.000029754676,0.00073448854,0.00009738081,0.000045036137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007984167,0.00012350171,0.00016493321,0.00025012082,0.00018667502,0.00004268631,0.0002393523,0.000035570385,0.00017011451],"category_scores_gemma":[1.9946404e-7,0.00012437424,0.00007020118,0.0004888837,0.00009965677,0.0001293465,0.0000010601035,0.00013025348,0.000012280815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014891283,0.0005106442,0.012896298,0.0007221522,0.0036639161,5.739922e-7,0.005656048,0.94054186,0.0036494373,0.027525011,0.000035628334,0.0046494915],"study_design_scores_gemma":[0.005959591,0.0005679654,0.060553864,0.00036719276,0.0052791364,0.000013101538,0.011911253,0.85645586,0.011062262,0.0027571127,0.043323025,0.0017496296],"about_ca_topic_score_codex":0.00016965021,"about_ca_topic_score_gemma":0.003949467,"teacher_disagreement_score":0.39126956,"about_ca_system_score_codex":0.00003574226,"about_ca_system_score_gemma":0.000016077362,"threshold_uncertainty_score":0.50718343},"labels":[],"label_agreement":null},{"id":"W2985618070","doi":"10.1109/tcomm.2019.2953601","title":"Construction of QC LDPC Codes With Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Error floor; Computer science; Trapping; Algorithm; Theoretical computer science; Decoding methods; Biology","score_opus":0.017633620423915405,"score_gpt":0.27141470426903447,"score_spread":0.25378108384511905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985618070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2447616,0.00010081188,0.75363845,0.0003562606,0.000075701544,0.000680429,0.00002091931,0.00014326719,0.0002225854],"genre_scores_gemma":[0.93724805,0.00006529031,0.0625513,0.000011667022,9.820996e-7,0.000076140124,0.000003231001,0.0000116526735,0.000031685526],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998609,0.00028671906,0.00042497925,0.00023129019,0.00030920721,0.00013878189],"domain_scores_gemma":[0.9974439,0.0004544484,0.0002133449,0.0015358602,0.00030689943,0.000045539295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004872627,0.00013326672,0.00029554666,0.00030507005,0.00018691897,0.000033109776,0.000789809,0.000069270354,0.0000049551145],"category_scores_gemma":[0.000011101805,0.00012405908,0.000056402005,0.0006031318,0.0002272032,0.00019440796,0.000013088967,0.00024452843,0.0000049509213],"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.00037308334,0.00811062,0.0008319814,0.03939132,0.0013750718,0.0000027524652,0.052983064,0.14930207,0.60946214,0.049263272,0.0001442294,0.088760406],"study_design_scores_gemma":[0.00054741633,0.00046477842,0.0002932342,0.0037967057,0.000086510205,0.000054627642,0.0019865753,0.70981,0.28260383,0.0000968041,0.000003583493,0.00025594616],"about_ca_topic_score_codex":0.00016645163,"about_ca_topic_score_gemma":0.000090582165,"teacher_disagreement_score":0.69248646,"about_ca_system_score_codex":0.00008060217,"about_ca_system_score_gemma":0.00007224578,"threshold_uncertainty_score":0.50589824},"labels":[],"label_agreement":null},{"id":"W2987600525","doi":"10.1109/tcomm.2019.2952135","title":"Monte-Carlo Integration Models for Multiple Scattering Based Optical Wireless Communication","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Monte Carlo method; Monte Carlo integration; Dynamic Monte Carlo method; Monte Carlo molecular modeling; Quasi-Monte Carlo method; Monte Carlo method in statistical physics; Computer science; Importance sampling; Hybrid Monte Carlo; Computation; Quantum Monte Carlo; Statistical physics; Impulse response; Physics; Markov chain Monte Carlo; Algorithm; Mathematics; Statistics; Mathematical analysis","score_opus":0.03525249529567703,"score_gpt":0.250834295183948,"score_spread":0.21558179988827098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987600525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043694813,0.0003926794,0.94700557,0.0023337817,0.00022084257,0.0012971909,0.00010802647,0.0018819543,0.003065136],"genre_scores_gemma":[0.9178089,0.0009241956,0.07959934,0.000095904696,0.000006473853,0.0013202289,0.000050686904,0.000091258495,0.00010302845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849826,0.000105193714,0.00056675426,0.00027556598,0.00021285185,0.00034135111],"domain_scores_gemma":[0.9933833,0.0016105808,0.00008030259,0.0046041543,0.00022733038,0.000094367744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026889838,0.00030560268,0.0003295213,0.0003217082,0.00045296183,0.00011636009,0.0020324101,0.00027168938,0.00003797591],"category_scores_gemma":[0.00003043455,0.00034065332,0.0002076885,0.0004483522,0.00027068055,0.0005262857,0.000022111737,0.0007884435,0.00012655277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003872735,0.00041347698,0.00001629208,0.00006115581,0.00008847443,7.6695834e-8,0.0002567861,0.8904531,0.015867813,0.0075329538,0.00016881025,0.08510233],"study_design_scores_gemma":[0.00074998237,0.000069174224,0.000035365934,0.00018100058,0.000032127173,0.0000016983169,0.00032512972,0.9584374,0.038485646,0.0007789451,0.00056374643,0.0003397976],"about_ca_topic_score_codex":0.000030472278,"about_ca_topic_score_gemma":0.0002470651,"teacher_disagreement_score":0.8741141,"about_ca_system_score_codex":0.00027078952,"about_ca_system_score_gemma":0.00003946416,"threshold_uncertainty_score":0.9999046},"labels":[],"label_agreement":null},{"id":"W2990652809","doi":"10.1109/tcomm.2020.2978189","title":"Rate Analysis of Cell-Free Massive MIMO-NOMA With Three Linear Precoders","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":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; MIMO; Rayleigh fading; Computer science; Spectral efficiency; Interference (communication); Single antenna interference cancellation; Imperfect; Noma; Algorithm; Mathematics; Topology (electrical circuits); Fading; Telecommunications; Beamforming; Decoding methods; Telecommunications link; Channel (broadcasting)","score_opus":0.0378847861004028,"score_gpt":0.26216948047485106,"score_spread":0.22428469437444826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990652809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004847039,0.00087333773,0.98584235,0.0018931669,0.00012919118,0.0006999925,0.0011029439,0.0012938577,0.0033181165],"genre_scores_gemma":[0.88145643,0.0050377348,0.1124663,0.000029140954,0.0000059967165,0.0006550495,0.00018875222,0.00010218554,0.00005839502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981925,0.00015124041,0.00073025835,0.00041979647,0.00023951495,0.00026669793],"domain_scores_gemma":[0.98888135,0.00065688405,0.00034950822,0.00976141,0.00025055755,0.00010026393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011696752,0.00047929608,0.0008175892,0.00093478407,0.00026834945,0.00003838844,0.004678342,0.00040878216,0.00009416551],"category_scores_gemma":[0.000017480099,0.00051220134,0.00041282433,0.0018527942,0.00049293065,0.00014282939,0.0001298231,0.002088022,0.000042333246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025179821,0.00018155009,0.00004675945,0.00012250824,0.0021582919,6.245601e-7,0.00036770687,0.9934372,0.0013187322,0.00017028714,0.000105674124,0.0020655366],"study_design_scores_gemma":[0.00060046546,0.00009628814,0.0007494441,0.00020471729,0.0024127015,7.962829e-7,0.0005486887,0.94844973,0.04348823,0.0021578148,0.0004985698,0.00079254515],"about_ca_topic_score_codex":0.00010327425,"about_ca_topic_score_gemma":0.002102444,"teacher_disagreement_score":0.8766094,"about_ca_system_score_codex":0.00019806848,"about_ca_system_score_gemma":0.00010816216,"threshold_uncertainty_score":0.999733},"labels":[],"label_agreement":null},{"id":"W2991461063","doi":"10.1109/tcomm.2019.2955965","title":"Performance of Multi-Cell Massive MIMO Systems With Interference Decoding","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":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; Decoding methods; Interference (communication); Computer science; Electronic engineering; Single antenna interference cancellation; 3G MIMO; Telecommunications; Engineering; Beamforming; Channel (broadcasting)","score_opus":0.02133082664781102,"score_gpt":0.23477631723181425,"score_spread":0.21344549058400322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991461063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049351756,0.00027424717,0.94508696,0.0000151767545,0.0003151205,0.0005010988,0.000031900283,0.0002105737,0.00421317],"genre_scores_gemma":[0.9820008,0.0005181235,0.016734587,0.0000028896354,0.0000041678677,0.00012495944,0.000005750663,0.000038715094,0.0005699613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00004224307,0.00029566183,0.00012598868,0.000084913794,0.0001430848],"domain_scores_gemma":[0.99846095,0.00012937757,0.00008674134,0.0011574542,0.00012307765,0.000042402215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063970125,0.00014319454,0.00018814992,0.0001524885,0.000105105086,0.000017082713,0.00039487574,0.0000634402,0.000019915586],"category_scores_gemma":[0.0000011661124,0.0001405162,0.000037549526,0.0002828285,0.00005413218,0.00025858288,0.0000028045438,0.00024827552,0.00008390431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010691087,0.0000795701,0.00013499983,0.00014292925,0.000029779936,8.312227e-8,0.00031580648,0.9921254,0.0062249084,0.000023360684,0.000005712654,0.0009067663],"study_design_scores_gemma":[0.0004709068,0.00009754285,0.00003968122,0.00030831,0.000023995502,0.000004252453,0.0004165235,0.98191833,0.01648412,5.9432756e-7,0.0000757018,0.00016003824],"about_ca_topic_score_codex":0.000022048564,"about_ca_topic_score_gemma":0.000044745997,"teacher_disagreement_score":0.9326491,"about_ca_system_score_codex":0.0000992983,"about_ca_system_score_gemma":0.000022906837,"threshold_uncertainty_score":0.5730085},"labels":[],"label_agreement":null},{"id":"W2992716901","doi":"10.1109/tcomm.2019.2957482","title":"Towards Optimal Power Control via Ensembling Deep Neural Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":279,"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 Natural Science Foundation of China","keywords":"Computer science; Power control; Artificial neural network; Channel state information; Fading; Generalization; Channel (broadcasting); Power (physics); Additive white Gaussian noise; Computational complexity theory; Interference (communication); Artificial intelligence; Machine learning; Algorithm; Wireless; Computer network; Telecommunications; Mathematics","score_opus":0.023973619432550834,"score_gpt":0.2596625151970172,"score_spread":0.2356888957644664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992716901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039422517,0.000112440306,0.98864776,0.004372078,0.0007538414,0.0005008359,0.0000069140674,0.00041131262,0.0012525794],"genre_scores_gemma":[0.97150755,0.000032550917,0.02764205,0.0005382213,0.000022737582,0.00008740788,0.000007596814,0.000027308173,0.00013460075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818265,0.00029668453,0.00044441555,0.0004193221,0.00033095983,0.00032593674],"domain_scores_gemma":[0.9957986,0.00048377234,0.00017073158,0.0031621528,0.0002474905,0.00013724544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028698042,0.00021971796,0.00022739531,0.0002502685,0.00051250396,0.00019850425,0.002147361,0.0001431043,0.00011214902],"category_scores_gemma":[0.0000064536407,0.00023493661,0.00017501807,0.0007077554,0.00009575459,0.00075453985,0.000015760816,0.0005768849,0.00028406596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018964964,0.0002653341,0.0000314012,0.00000323023,0.000050830437,5.9166564e-7,0.0004196368,0.9302217,0.0019226943,0.005918563,0.000019343066,0.06112773],"study_design_scores_gemma":[0.0005777509,0.00009633477,0.00089104444,0.000011810991,0.000019428546,0.0000135844875,0.000040036877,0.9969297,0.0006106301,0.00020646263,0.00036198905,0.00024121878],"about_ca_topic_score_codex":0.0000349641,"about_ca_topic_score_gemma":0.00003119104,"teacher_disagreement_score":0.9675653,"about_ca_system_score_codex":0.00013617941,"about_ca_system_score_gemma":0.00005332792,"threshold_uncertainty_score":0.9580437},"labels":[],"label_agreement":null},{"id":"W2993252065","doi":"10.1109/tcomm.2019.2957767","title":"Throughput-Oriented Non-Orthogonal Random Access Scheme for Massive MTC Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Science Basic Research Program of Shaanxi Province; Key Research and Development Projects of Shaanxi Province; National Science and Technology Major Project; National Mobile Communications Research Laboratory, Southeast University; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Telecommunications link; Random access; Multiplexing; Optimization problem; Computer network; Particle swarm optimization; Noma; Distributed computing; Algorithm; Wireless; Telecommunications","score_opus":0.026604280658252388,"score_gpt":0.30028973601207637,"score_spread":0.273685455353824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993252065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014886267,0.00013804242,0.98577553,0.0003470147,0.00089206087,0.006073002,0.00008032745,0.00030005892,0.004905356],"genre_scores_gemma":[0.97931486,0.00041978955,0.009425622,0.00015935907,0.00010947645,0.009873286,0.00007784917,0.00007508001,0.00054469553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894387,0.000053756867,0.00034252976,0.00020408398,0.00012659647,0.0003291627],"domain_scores_gemma":[0.99773884,0.0005330826,0.000058694604,0.0014618242,0.00012158115,0.000085953114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017265158,0.00021909896,0.00026510708,0.00010111976,0.00039055757,0.00009042013,0.000841358,0.00016791928,0.00020438092],"category_scores_gemma":[0.000002572216,0.0002278138,0.00021087525,0.00039308533,0.00006762486,0.00031674918,0.00000793854,0.0005325877,0.00008688113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014213417,0.00015766501,0.00005580362,0.000051811065,0.00019891922,2.5508734e-7,0.00014072619,0.9850707,0.00032262158,0.0008007993,0.002777673,0.010280873],"study_design_scores_gemma":[0.0024224992,0.00007507744,0.00012323496,0.00010958693,0.000047101,0.0000021369597,0.00003622904,0.9511042,0.0010434113,0.0002134234,0.04451869,0.00030437513],"about_ca_topic_score_codex":0.000011122572,"about_ca_topic_score_gemma":0.0000739949,"teacher_disagreement_score":0.97782624,"about_ca_system_score_codex":0.0000752878,"about_ca_system_score_gemma":0.000037342572,"threshold_uncertainty_score":0.92899776},"labels":[],"label_agreement":null},{"id":"W2995050929","doi":"10.1109/tcomm.2019.2960334","title":"Semi-Blind Interference Aligned NOMA for Downlink MU-MISO Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Telecommunications link; Beamforming; Computer science; Interference (communication); Channel state information; Transmitter; Transmitter power output; Transmission (telecommunications); Power (physics); Channel (broadcasting); Topology (electrical circuits); Electronic engineering; Mathematical optimization; Telecommunications; Mathematics; Wireless; Engineering; Physics","score_opus":0.034341747560174246,"score_gpt":0.2738842251243106,"score_spread":0.23954247756413635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995050929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007847711,0.0009971325,0.9835909,0.00065561687,0.0005922559,0.0011706664,0.00017485097,0.0017671024,0.0032037375],"genre_scores_gemma":[0.98295295,0.002043132,0.01298571,0.000033533408,0.000010897995,0.0012092976,0.000043992808,0.00006497706,0.0006555179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988578,0.000062968196,0.00045628368,0.00022705687,0.000119108285,0.00027677964],"domain_scores_gemma":[0.9949553,0.0007272092,0.00008530119,0.004016282,0.00015310723,0.00006281558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013569828,0.0002405807,0.0002810043,0.00027841202,0.00031550982,0.00006947127,0.0019286285,0.0002014444,0.000042517768],"category_scores_gemma":[0.000012545121,0.00026529696,0.00012757951,0.00041720353,0.00014406955,0.00027282577,0.000015426027,0.0004162405,0.000282962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007034101,0.00036307433,0.000028484357,0.00020479053,0.00026114754,2.3682871e-7,0.00062621135,0.92326283,0.02581183,0.007747146,0.000741399,0.040882535],"study_design_scores_gemma":[0.0021018644,0.00024447296,0.00004987275,0.00036012765,0.000069910224,0.000015000019,0.0016845108,0.89628446,0.054885,0.0011683014,0.04224106,0.00089538767],"about_ca_topic_score_codex":0.00001973647,"about_ca_topic_score_gemma":0.00007523906,"teacher_disagreement_score":0.9751052,"about_ca_system_score_codex":0.00017948277,"about_ca_system_score_gemma":0.00003048003,"threshold_uncertainty_score":0.9999799},"labels":[],"label_agreement":null},{"id":"W2995549874","doi":"10.1109/tcomm.2019.2960345","title":"Secrecy-Enhancing Design for Cooperative Downlink and Uplink NOMA With an Untrusted Relay","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Alberta","funders":"Engineering and Physical Sciences Research Council","keywords":"Telecommunications link; Relay; Secrecy; Jamming; Computer network; Computer science; Eavesdropping; Noma; Electronic engineering; Engineering; Power (physics); Computer security","score_opus":0.027853277842877104,"score_gpt":0.25839726341204805,"score_spread":0.23054398556917094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995549874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014980203,0.0003951797,0.98150396,0.00046092426,0.00007740676,0.0010495365,0.00004869784,0.0011113336,0.00037276553],"genre_scores_gemma":[0.7828282,0.0010449961,0.2153085,0.00003628343,0.0000041560675,0.0005665911,0.00002691784,0.000054019627,0.00013030131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910295,0.00009119987,0.0002808501,0.00022394882,0.00008260031,0.0002184244],"domain_scores_gemma":[0.9965389,0.0008490922,0.00005684091,0.002330561,0.0001556571,0.000068955866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015426356,0.00021860228,0.00023152314,0.00018951121,0.00048008648,0.00005518569,0.0007570786,0.00014950385,0.000025125037],"category_scores_gemma":[0.0000099293175,0.00021279733,0.000037053494,0.00037622737,0.00018376349,0.0004159681,0.000008012848,0.00054462644,0.000030191197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008051351,0.00014183075,0.0000101711885,0.00003818314,0.000120492245,1.8761827e-7,0.0006831328,0.9549025,0.010984743,0.0033945565,0.000016138816,0.029627519],"study_design_scores_gemma":[0.0013900737,0.0006874235,0.00006319849,0.0001533703,0.000060322604,0.000015982607,0.0016737368,0.910414,0.0821063,0.0010451116,0.0018239911,0.00056649273],"about_ca_topic_score_codex":0.00000919217,"about_ca_topic_score_gemma":0.0002133639,"teacher_disagreement_score":0.767848,"about_ca_system_score_codex":0.000106366315,"about_ca_system_score_gemma":0.000041138937,"threshold_uncertainty_score":0.8677623},"labels":[],"label_agreement":null},{"id":"W2998239782","doi":"10.1109/tcomm.2019.2962397","title":"Counting Short Cycles in Bipartite Graphs: A Fast Technique/Algorithm and a Hardness Result","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Complete bipartite graph; Algorithm; Graph; Discrete mathematics; Mathematics; Computer science","score_opus":0.02737860117143568,"score_gpt":0.2921835513328338,"score_spread":0.2648049501613981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998239782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010246749,0.000105504136,0.98472095,0.0010494427,0.00023231607,0.0007169673,0.00001530392,0.0008275217,0.0020852278],"genre_scores_gemma":[0.78665084,0.0002493239,0.2124826,0.00008951896,0.00000463206,0.0004054229,0.0000021962262,0.000019076633,0.00009636865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850047,0.00020372737,0.0003880212,0.00041410394,0.00022010089,0.00027360444],"domain_scores_gemma":[0.9969468,0.00031719275,0.000079990685,0.0024691464,0.000118888274,0.00006799627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408462,0.0001884213,0.00021823782,0.0005362279,0.00032795192,0.00015275103,0.0015984364,0.00011851783,0.000006427008],"category_scores_gemma":[0.000010752587,0.00020737125,0.000075108685,0.001125839,0.00013196586,0.0005915985,0.000038846116,0.00064130954,0.000024788487],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043356347,0.0021881168,0.004719799,0.00012749941,0.00013636982,0.000014731964,0.010984249,0.000990055,0.060658958,0.012685842,0.00041221303,0.9070388],"study_design_scores_gemma":[0.0012648326,0.0005495182,0.0065615177,0.0015594402,0.000072491406,0.00025818634,0.0014027238,0.776712,0.1925632,0.010577398,0.0065189307,0.0019597712],"about_ca_topic_score_codex":0.00030950236,"about_ca_topic_score_gemma":0.0004645185,"teacher_disagreement_score":0.90507907,"about_ca_system_score_codex":0.000090998525,"about_ca_system_score_gemma":0.00006195895,"threshold_uncertainty_score":0.8456354},"labels":[],"label_agreement":null},{"id":"W3000708128","doi":"10.1109/tcomm.2020.2965451","title":"Adaptive Trust Management for Soft Authentication and Progressive Authorization Relying on Physical Layer Attributes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Access Control and Trust","field":"Social Sciences","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":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Authentication (law); Physical layer; Robustness (evolution); Transmitter; Computer network; Computer security; Wireless; Message authentication code; Cryptography; Channel (broadcasting); Telecommunications","score_opus":0.10754168945309621,"score_gpt":0.35708106686571506,"score_spread":0.24953937741261883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000708128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004868596,0.000106887266,0.9566902,0.031488184,0.00013496101,0.0017652892,0.00012278286,0.00026158895,0.004561524],"genre_scores_gemma":[0.9952621,0.00013117184,0.0033087013,0.00025949752,0.00007831137,0.0006888678,0.000014895426,0.000016090331,0.00024034835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990576,0.00017135718,0.0001699048,0.00024001245,0.00018153223,0.00017959617],"domain_scores_gemma":[0.99881697,0.00047244373,0.00009979867,0.00035977064,0.00013438899,0.00011660181],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0001614758,0.000114561044,0.00013306718,0.00006910324,0.0019468343,0.00010555288,0.00032984972,0.00006489903,0.000018135548],"category_scores_gemma":[0.000031101663,0.00011577755,0.00007654689,0.0003217303,0.00023650692,0.00024892777,0.000006314457,0.00018979593,0.000022542332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030710292,0.0012627009,0.00006526784,0.000057404744,0.00037099706,0.000006945923,0.038685102,0.002179536,0.00022841238,0.6349357,0.0003593607,0.3215415],"study_design_scores_gemma":[0.0060895192,0.0018468696,0.0018283055,0.00038920078,0.001924534,0.000014370674,0.053889204,0.8305938,0.0028272343,0.032515977,0.06635824,0.0017226951],"about_ca_topic_score_codex":0.00004528303,"about_ca_topic_score_gemma":0.00007989121,"teacher_disagreement_score":0.9903935,"about_ca_system_score_codex":0.000063594845,"about_ca_system_score_gemma":0.000035571455,"threshold_uncertainty_score":0.9993525},"labels":[],"label_agreement":null},{"id":"W3001462167","doi":"10.1109/tcomm.2020.2968907","title":"Dynamic Flow Migration for Embedded Services in SDN/NFV-Enabled 5G Core Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":98,"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); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Quality of service; Software-defined networking; Integer programming; Distributed computing; Multi-commodity flow problem; Control reconfiguration; Computer network; Heuristic; Provisioning; Mathematical optimization; Flow network; Algorithm","score_opus":0.03483660970441744,"score_gpt":0.27321670426134753,"score_spread":0.2383800945569301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001462167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012995867,0.0003211709,0.98383677,0.013087251,0.00026944364,0.00057542365,0.000033716107,0.00037926523,0.00019736259],"genre_scores_gemma":[0.8916241,0.0007369792,0.10475692,0.0023002715,0.000019518448,0.00040748128,0.00006574434,0.000024678395,0.000064318614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986765,0.00013280343,0.00038770985,0.0003675563,0.00014991,0.00028555625],"domain_scores_gemma":[0.9974784,0.0006538876,0.00010869134,0.0015235764,0.000114581766,0.000120834884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021577827,0.00019372582,0.00022253432,0.00013190894,0.00042689027,0.00015873542,0.0016834583,0.0001267592,0.000013203704],"category_scores_gemma":[0.000007939168,0.00020521655,0.00013644122,0.00097634405,0.000047727986,0.0004968968,0.000014043982,0.00044299255,0.000024725592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005457845,0.00037395637,0.000055934564,0.000037703903,0.000050345294,0.0000012176473,0.0034025623,0.95209783,0.00022233998,0.002905543,0.00054245355,0.04025554],"study_design_scores_gemma":[0.0006400114,0.00010931029,0.00024179784,0.00005772526,0.000020965683,0.0000025584384,0.00011912011,0.9950753,0.0000780059,0.0009304542,0.002524483,0.00020027673],"about_ca_topic_score_codex":0.0000855416,"about_ca_topic_score_gemma":0.004431859,"teacher_disagreement_score":0.8903245,"about_ca_system_score_codex":0.000068069225,"about_ca_system_score_gemma":0.000073255156,"threshold_uncertainty_score":0.83684886},"labels":[],"label_agreement":null},{"id":"W3003598188","doi":"10.1109/tcomm.2020.2970058","title":"Enhanced Fairness and Scalability of Power Control Schemes in Multi-Cell Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Stiftelsen för Strategisk Forskning","keywords":"Scalability; MIMO; Computer science; Power control; Transmitter power output; Convex optimization; Max-min fairness; Optimization problem; Power (physics); Channel (broadcasting); Scheme (mathematics); Spectral efficiency; Mathematical optimization; Fairness measure; Distributed computing; Computer network; Regular polygon; Throughput; Wireless; Algorithm; Resource allocation; Mathematics; Telecommunications","score_opus":0.020502040759090515,"score_gpt":0.25071203277559273,"score_spread":0.23020999201650222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003598188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123075945,0.00034932612,0.98589814,0.00039380437,0.00005947258,0.0004231886,0.000068633846,0.00013342139,0.00036642514],"genre_scores_gemma":[0.97975713,0.00023612655,0.01984173,0.000034455225,0.0000023883142,0.00008527806,0.00000401599,0.000023977685,0.000014880013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992544,0.00007992617,0.00033921713,0.00014598519,0.000063564774,0.00011689722],"domain_scores_gemma":[0.99897784,0.00020309468,0.00005306903,0.0006168662,0.00008216314,0.00006695714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006585983,0.00012476077,0.00021453586,0.00008188804,0.00007012942,0.000009249554,0.00024464284,0.00007884665,0.000019885914],"category_scores_gemma":[0.000015370939,0.00014294249,0.00004429395,0.00030939266,0.00010728159,0.00016983804,0.0000028455715,0.00025473814,0.0000083946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002570093,0.0002548181,0.000048080878,0.000102840044,0.00003110967,2.0285272e-7,0.0018186673,0.9289375,0.066884965,0.000060821156,0.0000065557,0.0018287227],"study_design_scores_gemma":[0.0023015752,0.000062302315,0.0002864936,0.00007345743,0.000031190306,5.990493e-7,0.00092518324,0.86920714,0.12670994,0.000025553083,0.0001342263,0.00024231222],"about_ca_topic_score_codex":0.000012864127,"about_ca_topic_score_gemma":0.00008460538,"teacher_disagreement_score":0.96744955,"about_ca_system_score_codex":0.000053908807,"about_ca_system_score_gemma":0.000017310284,"threshold_uncertainty_score":0.58290255},"labels":[],"label_agreement":null},{"id":"W3004172495","doi":"10.1109/tcomm.2020.2970986","title":"Joint Long-Term Cache Updating and Short-Term Content Delivery in Cloud-Based Small Cell Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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":"Computer science; Cache; Computer network; Cloud computing; Small cell; Quality of service; Distributed computing; Radio access network; Base station; Multicast; Mobile station","score_opus":0.10543574234773788,"score_gpt":0.2522205997933782,"score_spread":0.1467848574456403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004172495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20129463,0.0005339595,0.7941131,0.003114775,0.00018637757,0.0002819763,0.000011795865,0.00018726812,0.00027610196],"genre_scores_gemma":[0.994252,0.0005208504,0.003770857,0.0012888247,0.000026709184,0.00007732945,0.000012846396,0.000018326122,0.000032209507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984896,0.0002662342,0.00042930254,0.00039280514,0.0001491618,0.00027287184],"domain_scores_gemma":[0.99795765,0.00031717497,0.0000829227,0.0013717962,0.00008553266,0.0001849339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022611793,0.00020487823,0.00023541535,0.00014155601,0.00042451837,0.00018049784,0.0011892101,0.00009516134,0.00000760542],"category_scores_gemma":[0.0000060326543,0.00022121586,0.00013277523,0.0003799667,0.000102111066,0.00023059035,0.00003734121,0.00073086785,0.000013855838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003526386,0.006002771,0.03894821,0.00039052486,0.00044107018,0.00018924354,0.011403658,0.47991952,0.07333606,0.0038339656,0.0004935731,0.38468876],"study_design_scores_gemma":[0.0010300839,0.00018298812,0.007974422,0.00016367903,0.000055339035,0.00001138727,0.00022144703,0.98695284,0.0029277524,0.000013299251,0.000044425084,0.0004223632],"about_ca_topic_score_codex":0.00020459565,"about_ca_topic_score_gemma":0.0007741577,"teacher_disagreement_score":0.7929574,"about_ca_system_score_codex":0.00008239306,"about_ca_system_score_gemma":0.000076070115,"threshold_uncertainty_score":0.9020921},"labels":[],"label_agreement":null},{"id":"W3004878114","doi":"10.1109/tcomm.2020.2971699","title":"Cross-Layer Scheduling and Beamforming in Smart-Grid Powered Cellular Networks With Heterogeneous Energy Coordination","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Shenzhen University; National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Smart grid; Lyapunov optimization; Scheduling (production processes); Mathematical optimization; Optimization problem; Grid; Renewable energy; Distributed computing; Base station; Schedule; Real-time computing; Engineering; Computer network; Algorithm; Telecommunications; Electrical engineering; Mathematics","score_opus":0.01849001566145168,"score_gpt":0.23330061396054305,"score_spread":0.21481059829909138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004878114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011741062,0.0007606412,0.986334,0.00023105316,0.00012889503,0.0002121088,0.000015923191,0.00028299054,0.00029327793],"genre_scores_gemma":[0.9784354,0.00060515024,0.020627463,0.00006946531,0.000026419782,0.000116923846,0.000033107677,0.000057544006,0.0000285125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914694,0.00005222941,0.00031904117,0.00019509444,0.00008737874,0.00019933564],"domain_scores_gemma":[0.9991281,0.00010638637,0.000053718573,0.0005469827,0.000065673376,0.00009912902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069140726,0.00017931769,0.00018033375,0.00012973939,0.00024779222,0.00006302265,0.00024130892,0.00010458406,0.000013502016],"category_scores_gemma":[0.0000043072278,0.00020001222,0.00003581053,0.0004472398,0.000071532,0.00031779186,0.0000047249273,0.00030721066,0.000003946857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016993245,0.000031671996,0.00006072164,0.000016638673,0.000029506598,0.0000014594223,0.00033755318,0.993921,0.0025512204,0.0000521624,0.000002288036,0.0029787805],"study_design_scores_gemma":[0.0005303495,0.00005315065,0.000017945542,0.00006237636,0.000019952742,0.00001015794,0.00008887085,0.9895627,0.008757619,0.000010227502,0.0006746699,0.0002120083],"about_ca_topic_score_codex":0.00005108935,"about_ca_topic_score_gemma":0.00037775305,"teacher_disagreement_score":0.96669436,"about_ca_system_score_codex":0.00009752344,"about_ca_system_score_gemma":0.00001503186,"threshold_uncertainty_score":0.8156262},"labels":[],"label_agreement":null},{"id":"W3007600769","doi":"10.1109/tcomm.2020.2974738","title":"A Deep Reinforcement Learning-Based Transcoder Selection Framework for Blockchain-Enabled Wireless D2D Transcoding","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; Carleton University","funders":"National Natural Science Foundation of China","keywords":"Transcoding; Computer science; Reinforcement learning; Quality of service; Scheduling (production processes); Distributed computing; Real-time computing; Computer network; Artificial intelligence; Engineering","score_opus":0.02848112148239362,"score_gpt":0.26233327802611983,"score_spread":0.2338521565437262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007600769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033008264,0.0001374229,0.99531436,0.0014900555,0.00018930271,0.0010983301,0.000013312831,0.0011393684,0.00028775248],"genre_scores_gemma":[0.93332607,0.00014509785,0.06509188,0.00020150117,0.000047805606,0.0009873281,0.00003152929,0.00011159425,0.0000572035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986212,0.00009771988,0.00050727744,0.00027210452,0.00016248257,0.00033920544],"domain_scores_gemma":[0.9985554,0.0004595801,0.00008074227,0.00059732614,0.0001466248,0.00016031074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012530635,0.00028455627,0.00029061153,0.00017051942,0.0006909977,0.000050566312,0.00044118962,0.00020300629,0.00007411353],"category_scores_gemma":[0.000011574599,0.00034619015,0.00020633609,0.0006948366,0.000058524947,0.000106480984,0.0000011440372,0.0007225659,0.000022722203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059758728,0.00006616141,0.0000018977638,0.00013098962,0.00009262083,1.4343497e-7,0.0014754218,0.9898745,0.0043573924,0.0004739139,0.000016044192,0.0034512035],"study_design_scores_gemma":[0.0008508658,0.00016405572,6.7639235e-7,0.0001111832,0.00010608084,0.0000015434307,0.00030234997,0.975694,0.0214895,0.00011778623,0.00083784055,0.000324123],"about_ca_topic_score_codex":0.000010085756,"about_ca_topic_score_gemma":0.00008363485,"teacher_disagreement_score":0.932996,"about_ca_system_score_codex":0.00019690537,"about_ca_system_score_gemma":0.000046785375,"threshold_uncertainty_score":0.999899},"labels":[],"label_agreement":null},{"id":"W3007970939","doi":"10.1109/tcomm.2020.2974457","title":"Sparse Channel Estimation and Hybrid Precoding Using Deep Learning for Millimeter Wave Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":219,"is_retracted":false,"has_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":"Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Precoding; Zero-forcing precoding; MIMO; Computer science; Algorithm; Quantization (signal processing); Artificial neural network; Electronic engineering; Channel (broadcasting); Control theory (sociology); Artificial intelligence; Engineering; Telecommunications","score_opus":0.09714878866662471,"score_gpt":0.26926534903455496,"score_spread":0.17211656036793024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007970939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016207516,0.00031115778,0.9817978,0.0006278314,0.00013260772,0.00044062646,0.000032259617,0.00027560885,0.00017456507],"genre_scores_gemma":[0.9143005,0.0005596744,0.08475579,0.00014272776,0.000024932595,0.00011862065,0.00002934001,0.000048927715,0.000019492798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917734,0.000061576364,0.00029179765,0.00018990332,0.00008854631,0.00019085224],"domain_scores_gemma":[0.9991806,0.00021202343,0.000055818786,0.00035125174,0.00007977529,0.00012053379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010693878,0.00016977233,0.00016934569,0.000131424,0.0005194712,0.00006664234,0.00016020637,0.000060021335,0.000022016358],"category_scores_gemma":[0.000020170162,0.0001981837,0.00008633777,0.00014801252,0.000046795518,0.00022122273,0.000005186139,0.00032793343,0.000011816534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120057,0.00002357071,6.447442e-7,0.000059685717,0.00006381597,2.715173e-7,0.0011749216,0.9416308,0.018607372,0.000010852507,0.000016004225,0.038400054],"study_design_scores_gemma":[0.00032872212,0.000050127805,0.000002315366,0.000046581157,0.000086667824,0.000006549726,0.00020459769,0.94359165,0.055057377,0.00013045184,0.0003017041,0.0001932228],"about_ca_topic_score_codex":0.000005902486,"about_ca_topic_score_gemma":0.0000100607695,"teacher_disagreement_score":0.898093,"about_ca_system_score_codex":0.00006253196,"about_ca_system_score_gemma":0.000012328011,"threshold_uncertainty_score":0.80816966},"labels":[],"label_agreement":null},{"id":"W3008718072","doi":"10.1109/tcomm.2020.2975195","title":"Error Floor Estimation of LDPC Decoders — A Code Independent Approach to Measuring the Harmfulness of Trapping Sets","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Randomness; Algorithm; Tanner graph; Message passing; Decoding methods; Computer science; Binary number; Graph; Code (set theory); Belief propagation; Theoretical computer science; Mathematics; Set (abstract data type); Error floor; Statistics","score_opus":0.11425838287925082,"score_gpt":0.3156160599393843,"score_spread":0.20135767706013347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008718072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067583984,0.000038722457,0.9863942,0.0048016184,0.000097887525,0.0005838213,0.000022253169,0.00032217836,0.0009808736],"genre_scores_gemma":[0.8182088,0.000014208351,0.18133104,0.00021866389,0.0000034207178,0.00019832731,0.0000020880657,0.000015032323,0.000008435467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837464,0.00029697068,0.0004942455,0.00028407056,0.00037613264,0.00017396374],"domain_scores_gemma":[0.9971984,0.000335593,0.00021474359,0.0019621477,0.0001898191,0.00009928299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053689623,0.00015543523,0.0002318481,0.00019274316,0.00037562812,0.000044491157,0.0028620835,0.00007452717,0.000004108149],"category_scores_gemma":[0.000057599238,0.00014352916,0.00012164592,0.0010533888,0.00011288235,0.00028506585,0.0000389097,0.00046687722,0.000008626004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059276175,0.0011699459,0.00001936141,0.00017821978,0.00019409394,4.6773692e-7,0.042568427,0.7711894,0.014241758,0.003755134,0.00027257967,0.16635132],"study_design_scores_gemma":[0.00021182952,0.00009623402,0.00016578361,0.000090419446,0.00004306565,0.00000764021,0.00074237137,0.8953499,0.102735184,0.00028031773,0.000103365746,0.0001738574],"about_ca_topic_score_codex":0.0001311826,"about_ca_topic_score_gemma":0.00012171412,"teacher_disagreement_score":0.81145036,"about_ca_system_score_codex":0.00006325822,"about_ca_system_score_gemma":0.00011400418,"threshold_uncertainty_score":0.5852949},"labels":[],"label_agreement":null},{"id":"W3010012151","doi":"10.1109/tcomm.2020.2979149","title":"Robust Federated Learning With Noisy Communication","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":146,"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 Key Research and Development Program of China","keywords":"Computer science; Maxima and minima; Noise (video); Convergence (economics); Mathematical optimization; Node (physics); Process (computing); Function (biology); Convex function; Wireless; Convexity; Artificial intelligence; Regular polygon; Mathematics; Telecommunications; Engineering","score_opus":0.08482952423078478,"score_gpt":0.2744377171142667,"score_spread":0.1896081928834819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010012151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060291844,0.00013027512,0.8529345,0.14159547,0.000039404043,0.00023285724,0.000013247262,0.0018554243,0.0025959304],"genre_scores_gemma":[0.6718155,0.00039848217,0.3270722,0.0005349991,0.000004322171,0.000094245086,0.000019324158,0.00001917558,0.000041763054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984421,0.00034089622,0.00029495338,0.00040134843,0.0002631447,0.00025756983],"domain_scores_gemma":[0.98675734,0.00047927373,0.00014170357,0.01233027,0.0001728887,0.000118545555],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00021750774,0.00019776648,0.0001866103,0.00013463548,0.0011925102,0.00030200576,0.027338684,0.00011627489,0.00003201437],"category_scores_gemma":[0.00048241817,0.0001943084,0.00005867539,0.0013003334,0.00026683148,0.00082812936,0.0014928746,0.0012250203,0.00017650258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036620785,0.004264281,0.00061066274,0.00018740378,0.0013485517,0.000036605874,0.008210651,0.22851354,0.018502356,0.029346045,0.14942084,0.55919284],"study_design_scores_gemma":[0.00055442646,0.00026172816,0.00006031025,0.00006978383,0.00002906803,0.000017459677,0.0002239426,0.97737056,0.009596115,0.0024745257,0.008967413,0.00037463885],"about_ca_topic_score_codex":0.00006769928,"about_ca_topic_score_gemma":0.000105495405,"teacher_disagreement_score":0.7488571,"about_ca_system_score_codex":0.00008646504,"about_ca_system_score_gemma":0.00009784722,"threshold_uncertainty_score":0.97792387},"labels":[],"label_agreement":null},{"id":"W3010268208","doi":"10.1109/tcomm.2020.2979113","title":"Design of General Entropy-Constrained Successively Refinable Unrestricted Polar Quantizer","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Entropy (arrow of time); Combinatorics; Algorithm; Mathematics; Minification; Discrete mathematics; Computer science; Mathematical optimization; Physics","score_opus":0.06519810886652606,"score_gpt":0.30382343160195147,"score_spread":0.23862532273542542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010268208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018363222,0.00013753149,0.99337965,0.004835171,0.00007376374,0.00036507202,0.00009854306,0.0005791215,0.00034749357],"genre_scores_gemma":[0.49422136,0.00033474882,0.50497013,0.00030893696,0.000006882366,0.00007039993,0.000010081445,0.000013332606,0.000064106585],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998285,0.00038288767,0.00047688826,0.00034936436,0.00026479535,0.00024104901],"domain_scores_gemma":[0.9965013,0.00045752103,0.00023470586,0.0024410868,0.0002112608,0.00015406942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013848655,0.00018974896,0.00025910238,0.00019285729,0.0003850239,0.00006351862,0.003259404,0.00009032678,0.00004159831],"category_scores_gemma":[0.00003372698,0.0001912156,0.00009556574,0.0010796743,0.00020060947,0.00070388534,0.000045131263,0.00042048626,0.000032482454],"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.00017244938,0.0020281326,0.000042236832,0.00007031216,0.00025710036,0.000017260909,0.0018686,0.07807079,0.6999377,0.14233574,0.0064857854,0.06871388],"study_design_scores_gemma":[0.0009548779,0.0004083972,0.000095943826,0.0000824519,0.000049657992,0.000014804647,0.000057834855,0.56701857,0.41987428,0.0034737454,0.0074802246,0.00048917864],"about_ca_topic_score_codex":0.00009968862,"about_ca_topic_score_gemma":0.0000036048607,"teacher_disagreement_score":0.49403772,"about_ca_system_score_codex":0.000045930865,"about_ca_system_score_gemma":0.00017166536,"threshold_uncertainty_score":0.77975464},"labels":[],"label_agreement":null},{"id":"W3010834347","doi":"10.1109/tcomm.2020.2981332","title":"Improper Gaussian Signaling for Integrated Data and Energy Networking","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":25,"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; Institute for Computational Science and Technology; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Royal Society; Australian Research Council; Royal Academy of Engineering","keywords":"Beamforming; Computer science; Telecommunications link; Throughput; Base station; Gaussian; Relay; Energy (signal processing); Computer network; Electronic engineering; Telecommunications; Engineering; Wireless; Mathematics; Power (physics)","score_opus":0.06699094452326423,"score_gpt":0.25907443765887317,"score_spread":0.19208349313560893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010834347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045230024,0.0008894045,0.9957022,0.0010171776,0.00025780074,0.000092259965,0.000114167866,0.00055052026,0.0009241546],"genre_scores_gemma":[0.96941143,0.0013010671,0.028533936,0.0002528547,0.00012008375,0.00010925944,0.0001322152,0.000067758636,0.000071371884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991959,0.000056268404,0.00025241522,0.00022386198,0.000069640875,0.00020193131],"domain_scores_gemma":[0.9981803,0.0003757836,0.000032148408,0.0012473436,0.000042472868,0.00012192988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010690155,0.0001609897,0.00015738697,0.000052316675,0.0003497575,0.00007459563,0.0008822235,0.00009482427,0.000011224765],"category_scores_gemma":[0.000007744093,0.00016839594,0.00003735523,0.0002977431,0.000083082625,0.00017785629,0.000012577498,0.00035013916,0.000003199517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001660985,0.000045095625,0.0000063137027,0.000037285605,0.00014921364,5.4809067e-7,0.0003424747,0.8264122,0.00519376,0.0005659289,0.0014027427,0.16582781],"study_design_scores_gemma":[0.00019550546,0.00002881326,0.000002363897,0.00007176503,0.000048759397,0.0000023996736,0.00006764933,0.9233383,0.0016686338,0.00003802837,0.07436251,0.00017527476],"about_ca_topic_score_codex":0.000039640603,"about_ca_topic_score_gemma":0.0002271395,"teacher_disagreement_score":0.96895915,"about_ca_system_score_codex":0.000030251598,"about_ca_system_score_gemma":0.000022566477,"threshold_uncertainty_score":0.68669873},"labels":[],"label_agreement":null},{"id":"W3013612420","doi":"10.1109/tcomm.2020.2982632","title":"Relaying Systems With Reciprocity Mismatch: Impact Analysis and Calibration","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Reciprocity (cultural anthropology); Codebook; Computer science; Calibration; Electronic engineering; Beamforming; Performance improvement; Algorithm; Engineering; Mathematics","score_opus":0.07006073793233017,"score_gpt":0.2958096614110718,"score_spread":0.22574892347874162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013612420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041943076,0.0004751538,0.986198,0.007922781,0.000034666875,0.00025755548,0.000012958793,0.00026318894,0.0006413645],"genre_scores_gemma":[0.97790384,0.0015980335,0.019907359,0.00041856934,0.00001005012,0.00008289684,0.000009864636,0.000011373398,0.000057988946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998699,0.0003837198,0.0002803912,0.00029851476,0.00017994066,0.00015840866],"domain_scores_gemma":[0.99740607,0.00033434408,0.00011662967,0.0018106803,0.00014667006,0.00018563788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002024665,0.00016155877,0.00023277289,0.00019313364,0.0008694321,0.00031384782,0.00117884,0.00005775574,0.000015713555],"category_scores_gemma":[0.000009208774,0.00013936832,0.00009994059,0.0021973366,0.00010174478,0.0005840176,0.000025081823,0.0003935431,0.000010920475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002509158,0.0014372084,0.004756736,0.00011228613,0.005530135,0.000009786623,0.0388872,0.68025273,0.00764309,0.046124104,0.0013107742,0.21368502],"study_design_scores_gemma":[0.00026976838,0.00013487869,0.0008657531,0.00002646971,0.00015011158,0.0000067104043,0.00014322842,0.9969918,0.00042417008,0.000027953687,0.00075248355,0.00020665048],"about_ca_topic_score_codex":0.00006887211,"about_ca_topic_score_gemma":0.00020588137,"teacher_disagreement_score":0.9737096,"about_ca_system_score_codex":0.00006353719,"about_ca_system_score_gemma":0.000072834984,"threshold_uncertainty_score":0.6687057},"labels":[],"label_agreement":null},{"id":"W3017308685","doi":"10.1109/tcomm.2020.2987565","title":"Lattice-Based Robust Distributed Source Coding for Three Correlated Sources","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Rate distortion; Distributed source coding; Lattice (music); Degenerate energy levels; Coding (social sciences); Rate–distortion theory; Mathematics; Algorithm; Quadratic equation; Source code; Gaussian process; Computer science; Statistical physics; Decoding methods; Theoretical computer science; Applied mathematics; Channel code; Physics; Statistics; Quantum mechanics; Geometry","score_opus":0.06467019300070098,"score_gpt":0.2588014935177366,"score_spread":0.19413130051703564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017308685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020960248,0.00027513114,0.98785985,0.0053140717,0.000086392996,0.00071177905,0.00041409186,0.002811139,0.0004315379],"genre_scores_gemma":[0.9690293,0.00022986041,0.02954769,0.0003072329,0.000019024423,0.0005641782,0.00019761604,0.00008739499,0.00001770376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988301,0.00009291244,0.00044087355,0.000207819,0.00016245098,0.0002658556],"domain_scores_gemma":[0.99688506,0.00091747055,0.00008273417,0.001796295,0.0001554776,0.00016293739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015118712,0.0002444731,0.00026192825,0.00013351589,0.0006442073,0.00009123102,0.0014135024,0.00017735621,0.000055816196],"category_scores_gemma":[0.000027990774,0.0002922086,0.00018352372,0.0005998052,0.00016991168,0.00016959647,0.000009628644,0.00069558487,0.00005168003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047793514,0.00025652445,0.00003734162,0.000099802084,0.00016057317,2.799917e-7,0.000878348,0.98019755,0.0026173294,0.0011528414,0.0018340894,0.012717528],"study_design_scores_gemma":[0.0005639876,0.000066738074,0.00003766483,0.00007192985,0.000087556706,0.0000012770859,0.00012351897,0.95911896,0.012673788,0.00012804262,0.02681974,0.00030681133],"about_ca_topic_score_codex":0.000025616086,"about_ca_topic_score_gemma":0.0002043146,"teacher_disagreement_score":0.96693325,"about_ca_system_score_codex":0.000118015814,"about_ca_system_score_gemma":0.00004244417,"threshold_uncertainty_score":0.99995303},"labels":[],"label_agreement":null},{"id":"W3019060914","doi":"10.1109/tcomm.2020.2989462","title":"Energy-Constrained UAV-Assisted Secure Communications With Position Optimization and Cooperative Jamming","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Transmitter power output; Artificial noise; Relay; Jamming; Optimization problem; Node (physics); Mathematical optimization; Energy (signal processing); Iterative method; Convex optimization; Maximization; Computer network; Power (physics); Wireless; Transmitter; Algorithm; Physical layer; Regular polygon; Engineering; Telecommunications; Mathematics","score_opus":0.01755361681248436,"score_gpt":0.21634691408716625,"score_spread":0.1987932972746819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019060914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006197472,0.00034428362,0.98860687,0.005585423,0.00003386602,0.00039084372,0.00014375645,0.000597715,0.0036774853],"genre_scores_gemma":[0.8893764,0.002404411,0.1070634,0.00040746908,0.00001666471,0.0003696495,0.0002612113,0.000057550496,0.00004323497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989546,0.00011448807,0.00034883735,0.00025107793,0.00014321861,0.00018775534],"domain_scores_gemma":[0.9980503,0.00018755985,0.000074631826,0.0013049291,0.0002099647,0.00017265852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000065818684,0.00024746917,0.00020879795,0.00014399129,0.00083801727,0.0001226167,0.00054803916,0.00012740797,0.00005800436],"category_scores_gemma":[0.0000031465147,0.00025838095,0.000050745515,0.0008312567,0.00029439217,0.00036553084,0.000010767457,0.00030447697,0.000012745888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003404229,0.0002356396,0.00000671908,0.000029834207,0.00018296698,6.933149e-7,0.0021228574,0.9552496,0.002745831,0.0031159995,0.00021362866,0.03606215],"study_design_scores_gemma":[0.0006066483,0.00013467041,0.000020457062,0.00005037767,0.00011777134,0.000020087924,0.0006344104,0.9939777,0.0018702834,0.00002974791,0.002233163,0.00030465407],"about_ca_topic_score_codex":0.000030484725,"about_ca_topic_score_gemma":0.00020625672,"teacher_disagreement_score":0.88875663,"about_ca_system_score_codex":0.00008910335,"about_ca_system_score_gemma":0.000052083044,"threshold_uncertainty_score":0.9999868},"labels":[],"label_agreement":null},{"id":"W3022068581","doi":"10.1109/tcomm.2020.2992471","title":"Performance Analysis of Overlay Cognitive NOMA Systems With Imperfect Successive Interference Cancellation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Guangxi University for Nationalities; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Underlay; Overlay; Computer science; Noma; Cognitive radio; Single antenna interference cancellation; Interference (communication); Throughput; Spectral efficiency; Computer network; Signal-to-noise ratio (imaging); Cognitive network; Stochastic geometry; Wireless; Electronic engineering; Telecommunications link; Telecommunications; Engineering; Mathematics; Statistics","score_opus":0.027197595053315943,"score_gpt":0.24946025961041335,"score_spread":0.2222626645570974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022068581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11283087,0.0004893926,0.8837404,0.00025561798,0.000047767644,0.00031737043,0.00017407574,0.0005583752,0.0015860801],"genre_scores_gemma":[0.9961419,0.002310414,0.001233231,0.00001952257,0.000003757792,0.00021098256,0.000036323956,0.000027266802,0.00001660395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991256,0.00006945212,0.00035034496,0.00016752898,0.00014150968,0.0001455551],"domain_scores_gemma":[0.99790686,0.00052435376,0.00013696268,0.0011676546,0.00020745546,0.000056697125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051511288,0.0001774376,0.0003242758,0.0003230185,0.00019646666,0.000023519637,0.00080259476,0.000081368635,0.00003120549],"category_scores_gemma":[0.000011784692,0.00017432927,0.000082954015,0.0018047766,0.00023852267,0.00026412145,0.000009182522,0.0004134482,0.000008835271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000375905,0.000052855008,0.00034616387,0.000050134855,0.0006968811,1.8302926e-7,0.0008360223,0.98508793,0.0024615426,0.00010944554,0.000007850347,0.010313377],"study_design_scores_gemma":[0.00027517436,0.00016645175,0.0009677608,0.00013739096,0.00041158573,9.881231e-7,0.0010631315,0.96621525,0.030456617,0.0000025408456,0.000086920765,0.00021621204],"about_ca_topic_score_codex":0.000046714205,"about_ca_topic_score_gemma":0.00018058914,"teacher_disagreement_score":0.88331103,"about_ca_system_score_codex":0.000094089264,"about_ca_system_score_gemma":0.00003230699,"threshold_uncertainty_score":0.71089417},"labels":[],"label_agreement":null},{"id":"W3022887449","doi":"10.1109/tcomm.2021.3119368","title":"Efficient NOMA Design Without Channel Phase Information Using Amplitude-Coherent Detection","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Western University","funders":"King Abdullah University of Science and Technology","keywords":"Detector; Single antenna interference cancellation; Noma; Bit error rate; Interference (communication); Multiuser detection; Channel (broadcasting); Electronic engineering; Equalization (audio); Computer science; Phase detector; Amplitude; Phase (matter); Algorithm; Code division multiple access; Detection theory; Engineering; Telecommunications; Physics; Optics; Electrical engineering; Telecommunications link","score_opus":0.06031604428046786,"score_gpt":0.29964927409356584,"score_spread":0.239333229813098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022887449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013014474,0.00038123768,0.983889,0.00018559354,0.000293906,0.0004251273,0.000046208424,0.0013749661,0.00038953178],"genre_scores_gemma":[0.9457756,0.0007035417,0.05306662,0.00003821028,0.0000074314116,0.0003297316,0.000023051027,0.000037738682,0.000018073637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987911,0.00013839376,0.0004727631,0.00015365232,0.00019197096,0.00025213827],"domain_scores_gemma":[0.99690694,0.00022050415,0.0000983223,0.0024689615,0.00023385797,0.0000714452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014483197,0.0002270925,0.00020792683,0.00031365006,0.0006565822,0.00008761769,0.0006925963,0.00015208458,0.000031860083],"category_scores_gemma":[0.00002188107,0.0002699692,0.00010081862,0.0007620817,0.00014069994,0.00032632943,0.000015586584,0.0005846607,0.00008628552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012077646,0.0002602828,4.25724e-7,0.000016503329,0.000051657746,3.0060633e-7,0.00032781,0.9150521,0.023416305,0.00010224353,0.000007765132,0.06075251],"study_design_scores_gemma":[0.0006076237,0.000037120666,0.000008804299,0.00004836203,0.000031898788,0.000019966461,0.00049403496,0.8001037,0.19716832,0.0001886176,0.0010601311,0.00023137343],"about_ca_topic_score_codex":0.000014963893,"about_ca_topic_score_gemma":0.000057913814,"teacher_disagreement_score":0.93276113,"about_ca_system_score_codex":0.0003654077,"about_ca_system_score_gemma":0.000060684477,"threshold_uncertainty_score":0.99997526},"labels":[],"label_agreement":null},{"id":"W3024309904","doi":"10.1109/tcomm.2020.2995223","title":"Popular Matching for Security-Enhanced Resource Allocation in Social Internet of Flying Things","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"China University of Mining and Technology; Queen's University; Newton Fund; National Natural Science Foundation of China; Department for Business, Energy and Industrial Strategy, UK Government; Queen's University Belfast; Royal Academy of Engineering","keywords":"Computer science; Distributed computing; Optimization problem; Resource allocation; Convergence (economics); Matching (statistics); Block (permutation group theory); Computer network; Computer security; Algorithm","score_opus":0.026262925394666674,"score_gpt":0.2590506932225097,"score_spread":0.232787767827843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024309904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011279318,0.000061103805,0.9849638,0.0020181285,0.000034402627,0.00042844427,0.000029839497,0.00018696868,0.0009980251],"genre_scores_gemma":[0.9817649,0.00010143309,0.017556671,0.00014234288,0.000018567052,0.00029630348,0.000061116894,0.000032756565,0.000025895775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992626,0.000045675002,0.00035264634,0.00013202413,0.00008614782,0.00012091942],"domain_scores_gemma":[0.99935794,0.00010649901,0.00006169039,0.00037840757,0.000058008587,0.000037455193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012392217,0.00010752955,0.000152739,0.000119047116,0.00021619633,0.000022999344,0.00039543767,0.00008472204,0.000013737101],"category_scores_gemma":[0.0000062491813,0.00013479668,0.00007456965,0.00041157057,0.00003842291,0.00019242398,0.000003849593,0.00027838052,0.00000637243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008439481,0.00042488132,0.000008359683,0.00033239645,0.00013045242,1.3041237e-7,0.07228994,0.82441247,0.046427514,0.014089346,0.0009745278,0.040825583],"study_design_scores_gemma":[0.00056391244,0.000040204923,0.00002813054,0.0000637787,0.00004146849,4.9449864e-7,0.0012667024,0.969358,0.022525983,0.0013047846,0.004594658,0.0002118537],"about_ca_topic_score_codex":0.000041924042,"about_ca_topic_score_gemma":0.00008061275,"teacher_disagreement_score":0.97048557,"about_ca_system_score_codex":0.00006968779,"about_ca_system_score_gemma":0.000013268774,"threshold_uncertainty_score":0.5496849},"labels":[],"label_agreement":null},{"id":"W3025756901","doi":"10.1109/tcomm.2020.3039856","title":"Noisy Density Evolution With Asymmetric Deviation Models","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":0,"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":"Agence Nationale de la Recherche","keywords":"Low-density parity-check code; Code word; Large deviations theory; Decoding methods; Algorithm; Belief propagation; Range (aeronautics); Computer science; Code (set theory); Mathematics; Statistics","score_opus":0.06863529664891711,"score_gpt":0.2877480401966405,"score_spread":0.21911274354772342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025756901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004459498,0.00019424669,0.98688114,0.0054610358,0.0004994057,0.00088255794,0.00003484053,0.0024530473,0.003147785],"genre_scores_gemma":[0.7190154,0.00024798015,0.28005153,0.00019254535,0.000021116786,0.00035048413,0.000019937623,0.000037416885,0.00006355151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973082,0.0004537812,0.00051755394,0.00084402785,0.0005679736,0.00030847668],"domain_scores_gemma":[0.99258375,0.00045579212,0.00041284255,0.005829142,0.0005502574,0.00016820256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003848909,0.00042367473,0.00040877252,0.00074347534,0.0007697599,0.0002767261,0.0043436764,0.0003598984,0.0000030062506],"category_scores_gemma":[0.000026099502,0.00044956425,0.00022423104,0.0017709925,0.00013304903,0.00063502806,0.00014822847,0.00219792,0.00006983005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016667394,0.0035515828,0.00016866026,0.0004261266,0.0009876757,0.000020798205,0.008036652,0.58322704,0.0014878934,0.16618632,0.0024109082,0.23332968],"study_design_scores_gemma":[0.00023689582,0.00018879732,0.0002704948,0.00025565483,0.0001394352,0.00002517434,0.000041902116,0.9469624,0.004343641,0.046663452,0.00023027195,0.0006418584],"about_ca_topic_score_codex":0.000752254,"about_ca_topic_score_gemma":0.0011565854,"teacher_disagreement_score":0.71856946,"about_ca_system_score_codex":0.0007508379,"about_ca_system_score_gemma":0.00053187186,"threshold_uncertainty_score":0.9997956},"labels":[],"label_agreement":null},{"id":"W3026492770","doi":"10.1109/tcomm.2020.2996781","title":"A Joint Encryption, Channel Coding and Modulation Scheme Using QC-LDPC Lattice-Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Algorithm; Cryptosystem; Mathematics; Computer science; Theoretical computer science; Plaintext; Encryption; Decoding methods; Cryptography; Computer network","score_opus":0.10968305158944719,"score_gpt":0.28413902087906984,"score_spread":0.17445596928962265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026492770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016733155,0.00010753048,0.97644293,0.005786501,0.00011013143,0.00019090946,0.000014953063,0.00028843107,0.00032548624],"genre_scores_gemma":[0.88299984,0.0002165933,0.116238356,0.0004672722,0.00002165152,0.000030549683,0.000003449303,0.0000115392595,0.000010728715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988972,0.00018770626,0.00027262824,0.00030157878,0.00015905495,0.00018182462],"domain_scores_gemma":[0.99841386,0.00019154263,0.000095930496,0.0010585524,0.0001000797,0.00014005469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024560184,0.0001518538,0.00015918625,0.00018543152,0.00095300435,0.00016629424,0.0007402032,0.00006858814,0.000018057073],"category_scores_gemma":[0.000013657823,0.00016872553,0.000098769386,0.000741786,0.00013940476,0.00056237995,0.000024918687,0.0003162552,0.000019074107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009942727,0.0011793687,0.00012253347,0.00016785118,0.00042364068,0.000004941837,0.026273156,0.031513788,0.2266327,0.64484245,0.00018417493,0.06855594],"study_design_scores_gemma":[0.00029279102,0.00007520634,0.00021123518,0.000057631267,0.000030716867,0.0000113582,0.00015055852,0.98391503,0.003359574,0.011226842,0.00044604196,0.0002230024],"about_ca_topic_score_codex":0.000029881216,"about_ca_topic_score_gemma":0.000020272693,"teacher_disagreement_score":0.9524013,"about_ca_system_score_codex":0.00003433857,"about_ca_system_score_gemma":0.0000372661,"threshold_uncertainty_score":0.7329835},"labels":[],"label_agreement":null},{"id":"W3029660360","doi":"10.1109/tcomm.2020.2997400","title":"Design and Analysis of Online Fountain Codes for Intermediate Performance","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Fountain code; Overhead (engineering); Fountain; Computer science; Luby transform code; Tornado code; Online codes; Raptor code; Erasure; Decoding methods; Real-time computing; Algorithm; Block code; Hamming code; Operating system","score_opus":0.07554776408683453,"score_gpt":0.32196956672403737,"score_spread":0.24642180263720284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029660360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102748005,0.000051243198,0.98665625,0.002376353,0.000039729748,0.00028747405,0.000041823274,0.00024136702,0.000030986805],"genre_scores_gemma":[0.6662545,0.00027247562,0.3331898,0.00018920169,0.0000025499448,0.00006994647,0.0000059613994,0.0000058451856,0.000009709141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923027,0.000115389856,0.0002587931,0.00019350431,0.00009367399,0.00010837737],"domain_scores_gemma":[0.9978761,0.00080875854,0.00010842441,0.001019586,0.00012737475,0.0000597477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022697951,0.00009632473,0.00020732678,0.00025395627,0.00020643017,0.000030239595,0.001161964,0.000041707863,0.0000027180297],"category_scores_gemma":[0.000018636318,0.000100175595,0.00009232163,0.0009841747,0.00010662425,0.00020656896,0.000015224077,0.00017239229,0.000001219029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027671325,0.0020006076,0.001066173,0.00023456062,0.0027091969,9.4947137e-7,0.024044044,0.15882601,0.025029026,0.005958877,0.0004683088,0.77938557],"study_design_scores_gemma":[0.0001316944,0.00026729857,0.00055509264,0.000019595802,0.00020221964,7.676705e-7,0.00005355979,0.9851544,0.013242562,0.0001269945,0.00014805458,0.00009776834],"about_ca_topic_score_codex":0.000017406592,"about_ca_topic_score_gemma":0.00007302761,"teacher_disagreement_score":0.8263284,"about_ca_system_score_codex":0.000025287754,"about_ca_system_score_gemma":0.000044404645,"threshold_uncertainty_score":0.40850422},"labels":[],"label_agreement":null},{"id":"W3029883195","doi":"10.1109/tcomm.2020.2997401","title":"Security Enhancement via Antenna Selection in MIMOME Channels With Discrete Inputs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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 British Columbia","funders":"National Natural Science Foundation of China","keywords":"Rayleigh fading; QAM; Quadrature amplitude modulation; Computer science; Antenna (radio); Channel (broadcasting); Topology (electrical circuits); Artificial noise; Communications system; Electronic engineering; Fading; Telecommunications; Bit error rate; Mathematics; Engineering; Transmitter","score_opus":0.021637268988591363,"score_gpt":0.25126453838190155,"score_spread":0.22962726939331018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029883195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014576868,0.00021337545,0.9766382,0.005247497,0.00006385431,0.0006137006,0.000029744053,0.0010915995,0.0015251759],"genre_scores_gemma":[0.99190176,0.0013190793,0.0058146184,0.00031757503,0.000016040147,0.00054296246,0.000017705426,0.000054600456,0.000015672464],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.00015370728,0.00039555898,0.00022745864,0.00019972396,0.00025736872],"domain_scores_gemma":[0.99853927,0.00011659387,0.00005850054,0.0010704325,0.000087199114,0.00012799115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001315484,0.0002369501,0.0002476737,0.00022850133,0.00023371038,0.00005252519,0.00090195227,0.00011389493,0.0000640995],"category_scores_gemma":[0.0000036972122,0.00025686025,0.00006829992,0.0010189769,0.00012176465,0.00033259392,0.000010941363,0.0008504384,0.000057206704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087129226,0.006309267,0.00090189226,0.001057361,0.0015458913,0.000020031406,0.073770784,0.42731598,0.42920262,0.007930226,0.0026724187,0.048402227],"study_design_scores_gemma":[0.0009840677,0.00040015296,0.00018251948,0.00025029364,0.000053708456,0.0000135157,0.00025110372,0.81797415,0.17157754,0.0006328791,0.006901106,0.0007789896],"about_ca_topic_score_codex":0.00008905856,"about_ca_topic_score_gemma":0.00087626465,"teacher_disagreement_score":0.9773249,"about_ca_system_score_codex":0.0001822386,"about_ca_system_score_gemma":0.000029317804,"threshold_uncertainty_score":0.9999884},"labels":[],"label_agreement":null},{"id":"W3030158821","doi":"10.1109/tcomm.2020.2996737","title":"Sum Power Minimization With Mixed Power and QoS Bounded Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Mathematical optimization; Interior point method; Computer science; Power (physics); Throughput; Distributed power; Power optimization; Wireless; Mathematics; Power consumption; Telecommunications","score_opus":0.01806715574617264,"score_gpt":0.22876577054208241,"score_spread":0.2106986147959098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030158821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002695121,0.00014995674,0.99028826,0.0011477161,0.0001952831,0.0004185389,0.000074395364,0.0005289762,0.004501774],"genre_scores_gemma":[0.9724883,0.00022686915,0.02689682,0.00014995664,0.000009914346,0.00009351482,0.000023123363,0.000055657143,0.000055851746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920547,0.000062595354,0.0002654602,0.00018855938,0.00010960007,0.00016829121],"domain_scores_gemma":[0.9988921,0.00012694679,0.000049396018,0.00069762336,0.000096597374,0.00013728668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004491516,0.00018473534,0.00017642205,0.00009426879,0.00027008422,0.00005580929,0.00025052065,0.000089981026,0.00010481552],"category_scores_gemma":[0.000008124559,0.0001940001,0.000037325,0.00036549979,0.00022580691,0.0002805562,0.0000030049625,0.00027392563,0.000039190498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097269236,0.00028565698,0.000082872204,0.0000949099,0.00036648047,0.0000039304837,0.005983807,0.9764004,0.006569665,0.0020736204,0.0013799389,0.0066614575],"study_design_scores_gemma":[0.007508143,0.0010874562,0.0008434999,0.0005280673,0.00046828063,0.00017289373,0.007238427,0.9122005,0.031925354,0.00031012666,0.034940433,0.0027767885],"about_ca_topic_score_codex":0.00000490574,"about_ca_topic_score_gemma":0.00007052263,"teacher_disagreement_score":0.9697932,"about_ca_system_score_codex":0.00005931859,"about_ca_system_score_gemma":0.00003063544,"threshold_uncertainty_score":0.79110944},"labels":[],"label_agreement":null},{"id":"W3034663452","doi":"10.1109/tcomm.2020.3001647","title":"Joint Component Design for the JSCC System Based on DP-LDPC Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McMaster University","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Source code; Coding (social sciences); Algorithm; Connection (principal bundle); Mathematics; Statistics; Programming language","score_opus":0.14220246899759165,"score_gpt":0.2992184717571124,"score_spread":0.15701600275952077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034663452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029932544,0.00006588968,0.9671129,0.029201083,0.00030254864,0.001195466,0.00003193836,0.0014656698,0.00059457414],"genre_scores_gemma":[0.75245583,0.000030486997,0.24533665,0.0013078508,0.000017436041,0.00080094766,0.0000025502638,0.000022228764,0.000026005251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831414,0.00046123457,0.00036871928,0.0003461497,0.0002752898,0.00023448127],"domain_scores_gemma":[0.9935732,0.0029465805,0.00014328319,0.0030547553,0.00016955101,0.000112631315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062139065,0.00020398891,0.00021864116,0.00012520216,0.0012596155,0.00015745344,0.002931719,0.00007448392,0.0000053124168],"category_scores_gemma":[0.000035129484,0.00016771271,0.00020867027,0.0005261204,0.000115825445,0.00014586221,0.000017388036,0.00048050034,0.000056274723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033717122,0.0023689202,0.000008665001,0.00027033413,0.00037189134,0.0000055182104,0.0076729697,0.7776208,0.016763555,0.08027776,0.015427419,0.09887501],"study_design_scores_gemma":[0.00030320784,0.00031402797,0.00001837734,0.00010253895,0.000042190568,0.0000044152816,0.00012555678,0.9694317,0.026525205,0.00016044863,0.0027902543,0.00018210326],"about_ca_topic_score_codex":0.000059233706,"about_ca_topic_score_gemma":0.000038076854,"teacher_disagreement_score":0.7524259,"about_ca_system_score_codex":0.00017040886,"about_ca_system_score_gemma":0.00011762225,"threshold_uncertainty_score":0.9688072},"labels":[],"label_agreement":null},{"id":"W3035789229","doi":"10.1109/tcomm.2020.3032700","title":"Optimization of Wireless Relaying With Flexible UAV-Borne Reflecting Surfaces","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"York University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ergodic theory; Computer science; Transmission (telecommunications); Key (lock); Mathematical optimization; Maximization; Mode (computer interface); Wireless; Optimization problem; Energy (signal processing); Quadratic equation; Algorithm; Mathematics; Telecommunications","score_opus":0.07035304019683797,"score_gpt":0.3086306269643048,"score_spread":0.23827758676746685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035789229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002814802,0.0011293605,0.9874484,0.0014391557,0.00020062963,0.0006289381,0.00014754308,0.0030026955,0.0031885016],"genre_scores_gemma":[0.77942353,0.00883628,0.21112932,0.000017989327,0.000007922919,0.00034320907,0.00007697912,0.00012349154,0.0000412832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981502,0.00014679796,0.00075532024,0.00038521615,0.00028749564,0.00027496752],"domain_scores_gemma":[0.99436927,0.0005156755,0.00035587922,0.0044071046,0.00027211485,0.000079934805],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00015717854,0.00044149152,0.00058127707,0.00041197045,0.00043719634,0.00006470185,0.0023814095,0.0004153608,0.000027214746],"category_scores_gemma":[0.000019606174,0.00048716407,0.00014798211,0.0009742659,0.0003719086,0.00024006702,0.000078349665,0.0023037393,0.000012649705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021514132,0.0001086909,0.000007611025,0.00020487607,0.00020383645,3.9389354e-7,0.0004891764,0.98695695,0.0024191523,0.0005612771,0.000028878641,0.008997623],"study_design_scores_gemma":[0.00035420374,0.0000851743,0.000023088714,0.00077654555,0.00012290213,0.000004976107,0.0008146897,0.91371983,0.08242479,0.0007830836,0.00030085354,0.00058985106],"about_ca_topic_score_codex":0.000060222595,"about_ca_topic_score_gemma":0.00010002638,"teacher_disagreement_score":0.7766087,"about_ca_system_score_codex":0.00024974268,"about_ca_system_score_gemma":0.00011557586,"threshold_uncertainty_score":0.999998},"labels":[],"label_agreement":null},{"id":"W3039245001","doi":"10.1109/tcomm.2020.3005712","title":"Improved Constructions of Coded Caching Schemes for Combination Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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":"Lakehead University","funders":"","keywords":"Scheme (mathematics); Computer science; Cache; Transmission (telecommunications); Algorithm; Focus (optics); Theoretical computer science; Computer network; Topology (electrical circuits); Mathematics; Combinatorics; Telecommunications","score_opus":0.04293471852267657,"score_gpt":0.26394967175355966,"score_spread":0.22101495323088308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039245001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013549811,0.000114874434,0.9914931,0.005813048,0.00027247024,0.00036049823,0.000042457617,0.00022493576,0.00032362665],"genre_scores_gemma":[0.9741906,0.000109107066,0.025135987,0.0003427652,0.000015291504,0.00011813624,0.000011677165,0.000011429687,0.00006503096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990958,0.00010249233,0.000326322,0.0002185238,0.00010810239,0.00014874342],"domain_scores_gemma":[0.99803215,0.00046077673,0.00014019012,0.0010653787,0.00021341433,0.00008806934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001458206,0.00011743123,0.00017514158,0.00010081449,0.0005658299,0.00006371719,0.0011148718,0.000067057445,0.000004880253],"category_scores_gemma":[0.000021357446,0.0001304101,0.0001674607,0.00040132296,0.00011792562,0.00030905608,0.000012599125,0.0003040642,0.0000032369635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002575182,0.002725682,0.000099467456,0.0001662499,0.00088081555,9.733685e-7,0.0050545963,0.19215736,0.09989478,0.3487751,0.0015391051,0.34844837],"study_design_scores_gemma":[0.0006818234,0.00014889953,0.000010298062,0.000023096929,0.00003843815,0.0000033670522,0.000116703064,0.99271816,0.00465382,0.00042304935,0.0010497614,0.00013258317],"about_ca_topic_score_codex":0.000052261206,"about_ca_topic_score_gemma":0.000040008563,"teacher_disagreement_score":0.9728356,"about_ca_system_score_codex":0.000034295266,"about_ca_system_score_gemma":0.0000673802,"threshold_uncertainty_score":0.53179693},"labels":[],"label_agreement":null},{"id":"W3040458116","doi":"10.1109/tcomm.2020.3006913","title":"Secure Hybrid A/D Beamforming for Hardware-Efficient Large-Scale Multiple-Antenna SWIPT Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Engineering and Physical Sciences Research Council; State Key Laboratory of Rail Traffic Control and Safety; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China; Royal Society","keywords":"Computer science; Beamforming; Artificial noise; Optimization problem; Mathematical optimization; Maximum power transfer theorem; Wireless; Algorithm; Base station; Power (physics); Mathematics; Telecommunications","score_opus":0.02894241891680449,"score_gpt":0.2369501768097731,"score_spread":0.2080077578929686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040458116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003749465,0.00060359173,0.9912058,0.0006547932,0.00078381976,0.0006103116,0.00042271247,0.0011838853,0.00078563124],"genre_scores_gemma":[0.98045206,0.00029057765,0.018034171,0.0001387268,0.00010839562,0.00067413365,0.00007926956,0.00010981185,0.000112846596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998611,0.0000666574,0.00045647906,0.00026577676,0.00018043362,0.00041968346],"domain_scores_gemma":[0.99776894,0.0006058524,0.00006816806,0.0012381487,0.000114450806,0.00020445127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016961886,0.00026077993,0.00028434594,0.00010181004,0.00063695444,0.00008567191,0.0008549282,0.0001128266,0.000011486929],"category_scores_gemma":[0.000022420421,0.00029499884,0.00018901231,0.00035025584,0.00007075063,0.000109771776,0.000008519236,0.0005969164,0.000043940927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116343235,0.00011867785,0.00000842943,0.00008104858,0.00007998847,6.3947004e-7,0.0006610624,0.99575806,0.0014199881,0.00030038654,0.0005934814,0.0009666027],"study_design_scores_gemma":[0.00054224796,0.000043235937,0.000007187615,0.00013884284,0.00006345313,0.000008064114,0.00033018528,0.96064,0.0022621877,0.0000057918846,0.03567166,0.000287155],"about_ca_topic_score_codex":0.000020141193,"about_ca_topic_score_gemma":0.00012893851,"teacher_disagreement_score":0.97670263,"about_ca_system_score_codex":0.000119787175,"about_ca_system_score_gemma":0.000030413154,"threshold_uncertainty_score":0.99995023},"labels":[],"label_agreement":null},{"id":"W3041662461","doi":"10.1109/tcomm.2020.3008233","title":"Signal Superposition in NOMA With Proper and Improper Gaussian Signaling","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Research Council; Royal Academy of Engineering; National Science Foundation","keywords":"Noma; Decodes; Computer science; Gaussian; Computer network; Interference (communication); Topology (electrical circuits); Theoretical computer science; Decoding methods; Channel (broadcasting); Algorithm; Mathematics; Telecommunications link","score_opus":0.025245074511293666,"score_gpt":0.22159761256668845,"score_spread":0.19635253805539477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041662461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07930477,0.0007280336,0.9114016,0.0052230703,0.00002324445,0.0005560254,0.0000300145,0.0011566539,0.0015765678],"genre_scores_gemma":[0.97738653,0.0008913645,0.021283643,0.00012318631,0.000005144793,0.00024929296,0.000007694486,0.000040933697,0.000012189922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929076,0.000055376055,0.00023072354,0.00016323884,0.00009616212,0.00016375571],"domain_scores_gemma":[0.9989287,0.0000972103,0.000024839102,0.00084129255,0.00003981523,0.00006810388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005110679,0.00015934581,0.00015504216,0.00013968043,0.00021392862,0.00003801475,0.0005169317,0.0000843395,0.000031763608],"category_scores_gemma":[0.0000027040805,0.00014680371,0.00002641343,0.00045338992,0.00019171316,0.00029071321,0.000008361809,0.0005950962,0.000022741177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098121214,0.00031731656,0.00023195332,0.00010930474,0.000113954,0.0000050314748,0.0035012853,0.7027476,0.17006122,0.0013489091,0.000040264877,0.12142505],"study_design_scores_gemma":[0.001957383,0.0005504533,0.0007842259,0.00036169068,0.00006355706,0.000036059293,0.0030184113,0.7095562,0.27916542,0.00038834577,0.0030705899,0.0010476215],"about_ca_topic_score_codex":0.000016353108,"about_ca_topic_score_gemma":0.00011255707,"teacher_disagreement_score":0.8980818,"about_ca_system_score_codex":0.00006506815,"about_ca_system_score_gemma":0.000019176125,"threshold_uncertainty_score":0.5986482},"labels":[],"label_agreement":null},{"id":"W3041990688","doi":"10.1109/tcomm.2022.3207820","title":"Age-Limited Capacity of Massive MIMO","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Mathematical notation; Mathematics; Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.04138377596060438,"score_gpt":0.2544963150106071,"score_spread":0.21311253905000271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041990688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009659539,0.00001758357,0.9885449,0.003189129,0.00023560313,0.00024062161,0.00006125869,0.00018671858,0.0065582315],"genre_scores_gemma":[0.8747465,0.000052533745,0.12428166,0.00035410773,0.0000029739779,0.00018055704,0.000017199676,0.000008349708,0.00035613932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987917,0.00024145085,0.0003704075,0.00014352633,0.00031847265,0.00013442237],"domain_scores_gemma":[0.9971747,0.00023166485,0.00021322387,0.00216494,0.00016118812,0.000054298696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023253543,0.00010166488,0.00012686598,0.0003125727,0.00092066603,0.000042976746,0.002105424,0.000034483593,0.00015840279],"category_scores_gemma":[0.000009660953,0.00011922671,0.00009895937,0.0009790108,0.00012409469,0.0005444726,0.00003533216,0.00037740477,0.00003217165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016529739,0.000954086,0.0000068931204,0.0000149447715,0.00008774957,0.0000016892751,0.006160123,0.91493225,0.0014847217,0.055458855,0.0016410769,0.019241089],"study_design_scores_gemma":[0.0007991049,0.00025547578,0.00020660243,0.00001975596,0.00003459626,0.000025471682,0.0008149992,0.968082,0.011101111,0.0019574875,0.016333919,0.0003694562],"about_ca_topic_score_codex":0.000043622877,"about_ca_topic_score_gemma":0.000023417571,"teacher_disagreement_score":0.87378055,"about_ca_system_score_codex":0.00013994072,"about_ca_system_score_gemma":0.00008214663,"threshold_uncertainty_score":0.70811117},"labels":[],"label_agreement":null},{"id":"W3044929920","doi":"10.1109/tcomm.2020.3010986","title":"Absolute Value Layered ACO-OFDM for Intensity-Modulated Optical Wireless Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonal frequency-division multiplexing; Electronic engineering; Spectral efficiency; Bit error rate; Computer science; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.05352686073563345,"score_gpt":0.26696656836190774,"score_spread":0.2134397076262743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044929920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013944314,0.00029438824,0.9610065,0.018608207,0.00036565633,0.0010150985,0.0001329528,0.0031857511,0.0014471203],"genre_scores_gemma":[0.9709302,0.0012478791,0.02650959,0.000393676,0.000027952485,0.00070871634,0.000038884507,0.000088209374,0.000054866974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986249,0.000057895515,0.00049556175,0.00027642978,0.00017110813,0.00037408096],"domain_scores_gemma":[0.9966331,0.00060299755,0.000053043947,0.0023129042,0.00020273506,0.00019518142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012811972,0.00028427414,0.00037913598,0.00015661771,0.00046216638,0.00008462155,0.0018350928,0.00027387988,0.000024780695],"category_scores_gemma":[0.00004501656,0.00031980392,0.00020393974,0.00062024273,0.00030943408,0.00020189013,0.000028316259,0.00087840616,0.00017155307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025566117,0.001232854,0.0000060091047,0.000273484,0.0011062379,0.0000034399047,0.0025376244,0.6991676,0.084651634,0.032496348,0.003655896,0.17461322],"study_design_scores_gemma":[0.0006127576,0.00014287615,0.00003442028,0.00005312516,0.00005998552,0.0000046305227,0.00027957105,0.91655606,0.07356764,0.0007728368,0.0075164624,0.00039961943],"about_ca_topic_score_codex":0.000009148407,"about_ca_topic_score_gemma":0.000014359025,"teacher_disagreement_score":0.9569859,"about_ca_system_score_codex":0.00011984514,"about_ca_system_score_gemma":0.000031006788,"threshold_uncertainty_score":0.9999254},"labels":[],"label_agreement":null},{"id":"W3047617695","doi":"10.1109/tcomm.2020.3014939","title":"Energy-Efficient and Throughput Fair Resource Allocation for TS-NOMA UAV-Assisted Communications","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":77,"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; Queen's University; Department for Business, Energy and Industrial Strategy, UK Government; Queen's University Belfast; Royal Society; Royal Academy of Engineering; Newton Fund","keywords":"Computer science; Throughput; Telecommunications link; Resource allocation; Quality of service; Transmitter power output; Context (archaeology); Computer network; Resource management (computing); Efficient energy use; Distributed computing; Transmitter; Real-time computing; Wireless; Telecommunications; Engineering","score_opus":0.04019573114552203,"score_gpt":0.24871362172067657,"score_spread":0.20851789057515455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047617695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069781154,0.00080937584,0.98141176,0.01147948,0.00006358791,0.00063957,0.00019071982,0.0007011296,0.004006579],"genre_scores_gemma":[0.9394333,0.0019703333,0.056522377,0.00051357626,0.000029536606,0.0011233976,0.00022637063,0.00006976612,0.00011138628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881864,0.000090442525,0.000445466,0.0002816496,0.00014071142,0.00022308559],"domain_scores_gemma":[0.99703884,0.00042587967,0.000080967184,0.0021304663,0.00015630921,0.00016753862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010287534,0.00022892733,0.00021033276,0.00013083508,0.0009221661,0.00009054782,0.0009259737,0.00013836357,0.000019944899],"category_scores_gemma":[0.000010095544,0.0002657723,0.00010597508,0.0006411044,0.00022157551,0.00014219379,0.000017794186,0.00028842394,0.00002272718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058269317,0.0008944215,0.000011952165,0.0001232859,0.00029558488,2.152911e-7,0.003860302,0.78253174,0.0076750303,0.033033874,0.005402046,0.16611327],"study_design_scores_gemma":[0.0004797882,0.00006125818,0.00008323717,0.0000258787,0.00009589009,0.000004106431,0.0003824722,0.8929738,0.0018451593,0.00016068335,0.10362252,0.0002652415],"about_ca_topic_score_codex":0.000034344874,"about_ca_topic_score_gemma":0.00014558302,"teacher_disagreement_score":0.9387354,"about_ca_system_score_codex":0.00010989568,"about_ca_system_score_gemma":0.000039737686,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W3048045154","doi":"10.1109/tcomm.2020.3014680","title":"Enhanced Channel Estimation in Massive MIMO via Coordinated Pilot Design","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Futurewei Technologies","keywords":"MIMO; Channel (broadcasting); Rayleigh fading; Mean squared error; Mathematical optimization; Algorithm; Computer science; Bipartite graph; Quadratic equation; Control theory (sociology); Fading; Mathematics; Statistics; Telecommunications; Theoretical computer science","score_opus":0.04309593948428443,"score_gpt":0.25991909043634104,"score_spread":0.21682315095205662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048045154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015869766,0.00011024426,0.99651086,0.0009346207,0.000167873,0.0007065836,0.000024218814,0.0006274234,0.0007594949],"genre_scores_gemma":[0.9508144,0.00023617309,0.04829559,0.00008247909,0.000009584757,0.00044093354,0.000028044267,0.000056200886,0.000036540037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898106,0.0001390482,0.00039262124,0.00019068205,0.000093196046,0.00020340961],"domain_scores_gemma":[0.9988116,0.00022495884,0.000062187006,0.0007183469,0.00008347693,0.00009942127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090613736,0.00019268939,0.00020572789,0.00018798657,0.00018020534,0.000025776213,0.0004259485,0.00008564175,0.000033247965],"category_scores_gemma":[0.000016843413,0.00023685691,0.000044012755,0.0008301476,0.000053664753,0.00033568975,0.000003006742,0.00038519592,0.00014364405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024119836,0.0000950254,1.8984602e-7,0.000021858708,0.000024974359,5.317418e-7,0.0007899435,0.9775635,0.017417895,0.000038995986,0.000053609285,0.0039693764],"study_design_scores_gemma":[0.00054514164,0.000116905285,0.000006604329,0.000056762,0.0000192621,0.0000015229484,0.00011458298,0.95031273,0.04842725,0.0001601477,0.000032175525,0.00020691419],"about_ca_topic_score_codex":0.00002554401,"about_ca_topic_score_gemma":0.00007677569,"teacher_disagreement_score":0.95065576,"about_ca_system_score_codex":0.00018668815,"about_ca_system_score_gemma":0.00002488708,"threshold_uncertainty_score":0.9658745},"labels":[],"label_agreement":null},{"id":"W3048295980","doi":"10.1109/tcomm.2020.3014945","title":"Optimization for Signal Transmission and Reception in a Macrocell of Heterogeneous Uplinks and Downlinks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":7,"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":"Institute for Computational Science and Technology; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Australian Research Council; Royal Academy of Engineering; National Science Foundation","keywords":"Telecommunications link; Computer science; Computer network; Bandwidth (computing); Bandwidth allocation; Quality of service; Electronic engineering; Engineering","score_opus":0.029520247777888763,"score_gpt":0.2407172404711094,"score_spread":0.21119699269322065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048295980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05745916,0.001015682,0.9388757,0.0017415019,0.00002489607,0.0005550017,0.00009470103,0.00014953564,0.000083858824],"genre_scores_gemma":[0.9333514,0.0063628703,0.05996021,0.000055888304,0.000005936972,0.00018370894,0.000039419785,0.000033674787,0.0000068995914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919015,0.00006342168,0.00037876843,0.00016193985,0.00007518177,0.00013054344],"domain_scores_gemma":[0.998964,0.00030247786,0.000048240996,0.000526534,0.0000627554,0.00009597844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009372849,0.00014476625,0.00019531765,0.00014369542,0.0001753746,0.000021773329,0.00030401972,0.00013994945,0.00003548614],"category_scores_gemma":[0.0000047544468,0.00016936421,0.000053903164,0.0002890417,0.00011760924,0.00012637641,0.000005376122,0.00032820518,0.000001773644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034657347,0.000090555215,0.000008046494,0.00009862282,0.000022202657,7.8556766e-8,0.0012231466,0.948748,0.011812903,0.000042615186,0.000011604413,0.03790756],"study_design_scores_gemma":[0.00065839663,0.00009737473,0.000035175064,0.00006837463,0.000035788802,0.0000036695224,0.000113196525,0.98448366,0.013847689,0.000023790944,0.00048642902,0.00014647178],"about_ca_topic_score_codex":0.00001763352,"about_ca_topic_score_gemma":0.00007376013,"teacher_disagreement_score":0.8789154,"about_ca_system_score_codex":0.000036156627,"about_ca_system_score_gemma":0.000018411984,"threshold_uncertainty_score":0.6906472},"labels":[],"label_agreement":null},{"id":"W3048824451","doi":"10.1109/tcomm.2020.3015500","title":"Binary Code Optimized for Partial Encryption","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos-based Image/Signal Encryption","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":"Encryption; Binary number; Algorithm; Computer science; Binary code; Distortion (music); Bitstream; Theoretical computer science; Mathematics; Decoding methods; Arithmetic","score_opus":0.07982855011395366,"score_gpt":0.3063544953834262,"score_spread":0.2265259452694725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048824451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003256855,0.000068654015,0.9703205,0.027322926,0.00027537165,0.0006319452,0.000086494096,0.00057774043,0.00039064724],"genre_scores_gemma":[0.7002616,0.00018240967,0.29736716,0.0014867046,0.000051171774,0.00050719327,0.000028988963,0.000024236895,0.0000905331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985392,0.00020634069,0.0003769702,0.0003941463,0.00022699755,0.0002563125],"domain_scores_gemma":[0.99728984,0.0005436032,0.000119398326,0.0016868671,0.00016966436,0.00019062022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023879256,0.00018605038,0.0001987038,0.00013518472,0.0006711448,0.00013262645,0.0017814621,0.00008981969,0.00005401483],"category_scores_gemma":[0.000027601403,0.00020595395,0.00021107438,0.00061463204,0.000120903176,0.0006732421,0.000016811924,0.00034757413,0.00019799784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009490352,0.0032346973,0.000005785277,0.00014233658,0.000354618,0.0000075559765,0.0071742972,0.5195948,0.24357796,0.05227959,0.01080916,0.1618702],"study_design_scores_gemma":[0.0013523183,0.0003466875,0.000013158328,0.000023001028,0.00004581412,0.0000046266982,0.00005055876,0.9580755,0.025919026,0.0007627808,0.013144877,0.00026161483],"about_ca_topic_score_codex":0.000019847803,"about_ca_topic_score_gemma":0.000014161914,"teacher_disagreement_score":0.6999359,"about_ca_system_score_codex":0.00009683323,"about_ca_system_score_gemma":0.00013045783,"threshold_uncertainty_score":0.83985585},"labels":[],"label_agreement":null},{"id":"W3049056399","doi":"10.1109/tcomm.2020.3016648","title":"A Distributed Low-Complexity Coding Solution for Large-Scale Distributed FFT","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Fast Fourier transform; Computer science; Computational complexity theory; Coding (social sciences); Decoding methods; Distributed algorithm; Distributed computing; Node (physics); Computation; Distributed data store; Parallel computing; Computer engineering; Algorithm; Mathematics; Engineering","score_opus":0.08301009275867412,"score_gpt":0.31403233649428813,"score_spread":0.23102224373561403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049056399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031914035,0.000032939646,0.9767044,0.018833434,0.00024063876,0.0006893201,0.0011707753,0.0018472091,0.00016212526],"genre_scores_gemma":[0.7809942,0.000044521446,0.21792088,0.00047723873,0.000022620283,0.00033633938,0.00016542737,0.000020850099,0.000017947847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982838,0.00019736476,0.00042890193,0.0004577158,0.00022336244,0.00040886836],"domain_scores_gemma":[0.996758,0.00050864875,0.00016404902,0.0021078694,0.00026641207,0.0001950477],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00032336815,0.00022399791,0.0002537814,0.000105514104,0.0013165042,0.00015237936,0.002432864,0.00012130263,0.0000137572615],"category_scores_gemma":[0.000061712686,0.00025679645,0.00022378466,0.0009824198,0.00012040222,0.00045205423,0.00004409893,0.00051646016,0.000039443126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012151478,0.022456171,0.00065643806,0.0015572942,0.0014035568,0.00002217532,0.053951066,0.023773976,0.23099811,0.38439545,0.09818382,0.18138678],"study_design_scores_gemma":[0.00057664746,0.00016634431,0.00015482817,0.00006216043,0.000042442964,0.0000060992297,0.00012149,0.97701335,0.011966108,0.002168665,0.007383157,0.00033871355],"about_ca_topic_score_codex":0.0000464464,"about_ca_topic_score_gemma":0.00031766493,"teacher_disagreement_score":0.9532394,"about_ca_system_score_codex":0.00019120994,"about_ca_system_score_gemma":0.00009699915,"threshold_uncertainty_score":0.99998844},"labels":[],"label_agreement":null},{"id":"W3079579528","doi":"10.1109/tcomm.2020.3018184","title":"On the Complexity Reduction of Uplink Sparse Code Multiple Access for Spatial Modulation","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Lakehead University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Decoding methods; Telecommunications link; Computational complexity theory; Reduction (mathematics); Bit error rate; Algorithm; Tree (set theory); Transmission (telecommunications); Code (set theory); Computer engineering; Theoretical computer science; Parallel computing; Mathematics; Computer network; Telecommunications","score_opus":0.19903381964929953,"score_gpt":0.340194147862292,"score_spread":0.1411603282129925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079579528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038425284,0.00013070507,0.9836018,0.0076485616,0.00056550803,0.0018630144,0.0008755603,0.0011430401,0.00032926386],"genre_scores_gemma":[0.96444744,0.0017094788,0.031503603,0.000040433177,0.00002667827,0.0018768797,0.00028899673,0.000089106936,0.000017368879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839103,0.00015175002,0.0007009305,0.0003344402,0.00021443189,0.00020739727],"domain_scores_gemma":[0.9933691,0.0012052903,0.00032421222,0.004798138,0.00025029012,0.000052956126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018434077,0.00035558193,0.0004210593,0.00025611455,0.00055735,0.0000681245,0.0031927445,0.00035051332,0.000027690348],"category_scores_gemma":[0.00008837245,0.0003510532,0.00027030916,0.00036083008,0.00061998056,0.00015497058,0.000087602195,0.0016121707,0.000014590575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056308632,0.00021322958,0.0000018491548,0.00011853032,0.00015011191,3.5925584e-8,0.00026135994,0.9634971,0.0027876094,0.0072134095,0.00035543955,0.025344994],"study_design_scores_gemma":[0.00033298144,0.000053120646,0.00011079687,0.00017383283,0.00006172472,8.753719e-7,0.00010781371,0.90473104,0.04610153,0.047432873,0.0005956563,0.0002977325],"about_ca_topic_score_codex":0.000119393066,"about_ca_topic_score_gemma":0.000368901,"teacher_disagreement_score":0.9606049,"about_ca_system_score_codex":0.00023950079,"about_ca_system_score_gemma":0.000062296065,"threshold_uncertainty_score":0.99989414},"labels":[],"label_agreement":null},{"id":"W3081875647","doi":"10.1109/tcomm.2020.3021145","title":"CoMP Transmission in Downlink NOMA-Based Heterogeneous Cloud Radio Access Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":65,"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 de recherche du Québec – Nature et technologies","keywords":"Telecommunications link; User equipment; Computer science; Noma; Transmission (telecommunications); Spectral efficiency; Computer network; Cloud computing; Interference (communication); Enhanced Data Rates for GSM Evolution; Radio access network; Data transmission; Channel (broadcasting); Telecommunications; Base station; Mobile station","score_opus":0.04531447328210351,"score_gpt":0.27657888581954143,"score_spread":0.23126441253743793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081875647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020091154,0.0015100801,0.9888258,0.0048122834,0.0001656608,0.00043589008,0.000035464487,0.0018156188,0.0003900923],"genre_scores_gemma":[0.9816075,0.0042801676,0.013346806,0.00035936938,0.000017431083,0.000276422,0.000037067293,0.0000684508,0.00000679315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986638,0.00013869065,0.00050720887,0.0002456882,0.00014576262,0.00029884724],"domain_scores_gemma":[0.997184,0.00041044023,0.0000616982,0.0021595005,0.000048938706,0.00013543767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000084142834,0.00026884497,0.00030094388,0.00022527616,0.00030825878,0.00006258833,0.0024910427,0.00021054508,0.00006571234],"category_scores_gemma":[0.000006581434,0.0003080228,0.00013388894,0.0009847453,0.00020067654,0.00024861738,0.000014752674,0.001130262,0.00003754645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021529833,0.00013712051,0.00001359833,0.000021920192,0.00002607054,0.0000015955025,0.00014614985,0.95776594,0.0006161775,0.00006095442,0.000086897875,0.04110204],"study_design_scores_gemma":[0.0006548308,0.00004985126,0.00006033842,0.000072591065,0.00001763184,0.000002486087,0.00004963097,0.97402585,0.015953582,0.000105227045,0.008694788,0.00031321676],"about_ca_topic_score_codex":0.000017485025,"about_ca_topic_score_gemma":0.000115914925,"teacher_disagreement_score":0.9795984,"about_ca_system_score_codex":0.00016056444,"about_ca_system_score_gemma":0.00003288211,"threshold_uncertainty_score":0.9999372},"labels":[],"label_agreement":null},{"id":"W3082208370","doi":"10.1109/tcomm.2020.3020833","title":"A Partially Dynamic Subarrays Structure for Wideband mmWave MIMO Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"Basic Research Program of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Precoding; Spectral efficiency; MIMO; Computer science; Wideband; Algorithm; Channel (broadcasting); Electronic engineering; Engineering; Telecommunications","score_opus":0.04343274986315033,"score_gpt":0.2542208639618039,"score_spread":0.21078811409865356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082208370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004578108,0.00048190518,0.99151814,0.0013505209,0.0003420898,0.00058852584,0.00036589644,0.0004202927,0.0003545343],"genre_scores_gemma":[0.9909019,0.00036523794,0.008107133,0.00020534218,0.000028771616,0.00021674391,0.00005552328,0.000053066586,0.00006631531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991485,0.000052281448,0.00032789508,0.00016984752,0.00010948295,0.00019199254],"domain_scores_gemma":[0.99884164,0.00014502551,0.000038398575,0.00074556645,0.00009276046,0.00013662648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006610073,0.00016887473,0.0001836081,0.000080323036,0.0003195904,0.000068576584,0.00040228496,0.00009792158,0.00004182395],"category_scores_gemma":[0.000007809868,0.0001806719,0.000109998946,0.00019345983,0.00004216242,0.00011538116,0.0000021958847,0.0003021198,0.000027999762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023149178,0.00004324554,0.0000011126642,0.00012748697,0.00012928684,2.8294002e-7,0.001435415,0.8974298,0.09444497,0.00012902683,0.0003932458,0.00584295],"study_design_scores_gemma":[0.00039350757,0.000053589465,0.00000214662,0.000032071843,0.000069030044,0.0000037343468,0.00019365041,0.9712722,0.023350183,0.000114503586,0.004311722,0.00020368132],"about_ca_topic_score_codex":0.000011584266,"about_ca_topic_score_gemma":0.00020341865,"teacher_disagreement_score":0.9863238,"about_ca_system_score_codex":0.000063557614,"about_ca_system_score_gemma":0.000030712356,"threshold_uncertainty_score":0.73675865},"labels":[],"label_agreement":null},{"id":"W3084109717","doi":"10.1109/tcomm.2020.3022692","title":"Virtual Service Placement for Edge Computing Under Finite Memory and Bandwidth","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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 Manitoba","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Server; Bandwidth (computing); Edge computing; Enhanced Data Rates for GSM Evolution; Knapsack problem; Distributed computing; Computer network; Wireless; Service (business); Algorithm; Telecommunications","score_opus":0.06974632060964614,"score_gpt":0.2741229558407045,"score_spread":0.20437663523105837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084109717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029659423,0.000117114585,0.9714296,0.02444785,0.00018112917,0.00025887517,0.000028404338,0.00021016326,0.00036092004],"genre_scores_gemma":[0.98158073,0.00009025472,0.012324782,0.005800768,0.00002472353,0.00004392265,0.0000067839296,0.000011384158,0.000116640236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916613,0.00009620171,0.00020645848,0.0002555542,0.000118554235,0.0001571076],"domain_scores_gemma":[0.99806255,0.0007799338,0.00005582154,0.000887025,0.00009734077,0.00011733014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014824313,0.00012216433,0.00012983376,0.00006642215,0.00075459754,0.00012115866,0.0009236716,0.00004442868,0.000005516382],"category_scores_gemma":[0.000006921753,0.00013088524,0.00006973877,0.000279317,0.000049600687,0.00020681543,0.000026569625,0.00024670968,0.000026532034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021077803,0.0013094877,0.000016660913,0.00014069451,0.0005117977,0.000002342907,0.025990171,0.68111557,0.009895973,0.034006756,0.0028692745,0.2439305],"study_design_scores_gemma":[0.00073470286,0.0001668638,0.000025636826,0.00003246852,0.00003231557,0.000003598574,0.0006308126,0.9954314,0.00065200153,0.00015846896,0.0019526669,0.00017906149],"about_ca_topic_score_codex":0.000042639662,"about_ca_topic_score_gemma":0.00008182202,"teacher_disagreement_score":0.9786148,"about_ca_system_score_codex":0.000031563894,"about_ca_system_score_gemma":0.000051199047,"threshold_uncertainty_score":0.58038306},"labels":[],"label_agreement":null},{"id":"W3084353073","doi":"10.1109/tcomm.2020.3022349","title":"Proactive Eavesdropping via Jamming in Full-Duplex Multi-Antenna Systems: Beamforming Design and Antenna Selection","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","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":"Eavesdropping; Beamforming; Computer science; Antenna (radio); Jamming; Physical layer; Optimization problem; Electronic engineering; Mathematical optimization; Algorithm; Telecommunications; Engineering; Computer network; Mathematics; Wireless","score_opus":0.06018245510937005,"score_gpt":0.25467473217883313,"score_spread":0.1944922770694631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084353073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04310222,0.0009222398,0.9529735,0.0008657715,0.00016393547,0.0011733363,0.000029337727,0.00072268065,0.000046965262],"genre_scores_gemma":[0.9313388,0.0015871981,0.066126555,0.00006576455,0.000022052494,0.0007187439,0.000016500031,0.000096166266,0.000028226734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798083,0.00034792765,0.0006864516,0.0003646935,0.00019563355,0.0004244657],"domain_scores_gemma":[0.9977672,0.0005959113,0.00011104885,0.0011782458,0.00014447785,0.0002031316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003029995,0.00036343807,0.00039177423,0.00041443185,0.00071924756,0.00012371205,0.000847482,0.00018881405,0.000011637791],"category_scores_gemma":[0.000032255215,0.000431162,0.000095359326,0.0011586652,0.00017575592,0.0006173213,0.000020647001,0.0011650146,0.00004323564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003340835,0.00019006763,0.000025499055,0.00007819013,0.0001486348,0.0000013390405,0.004037876,0.87697065,0.11277035,0.000057210178,0.000010649512,0.0056761303],"study_design_scores_gemma":[0.0006766993,0.00010423292,0.00018882036,0.00018848239,0.00007397229,0.000036787747,0.0015716311,0.9936799,0.0028485684,0.0000021147512,0.00022459555,0.00040423608],"about_ca_topic_score_codex":0.00024412155,"about_ca_topic_score_gemma":0.000488935,"teacher_disagreement_score":0.8882366,"about_ca_system_score_codex":0.0003456522,"about_ca_system_score_gemma":0.000068511225,"threshold_uncertainty_score":0.99981403},"labels":[],"label_agreement":null},{"id":"W3088192645","doi":"10.1109/tcomm.2020.3025555","title":"Coordinated Direct and Relay Transmission With NOMA and Network Coding in Nakagami-<i>m</i> Fading Channels","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Relay; Nakagami distribution; Telecommunications link; Fading; Computer science; Computer network; Base station; Single antenna interference cancellation; Transmission (telecommunications); Linear network coding; Spectral efficiency; Noma; Relay channel; Electronic engineering; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering; Network packet; Channel (broadcasting); Physics","score_opus":0.021242222820318794,"score_gpt":0.2272913965673144,"score_spread":0.2060491737469956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088192645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025225423,0.0029769817,0.96492696,0.0037546938,0.00004731897,0.00042953272,0.000016636226,0.0012625433,0.0013599312],"genre_scores_gemma":[0.97253704,0.011041122,0.016137645,0.00008121871,0.000005639133,0.0001309149,0.0000057873285,0.00004415091,0.000016506741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991797,0.00007580197,0.00025659407,0.00019849838,0.00007561995,0.00021374073],"domain_scores_gemma":[0.9987372,0.0003650399,0.000039600032,0.00073566847,0.000029120007,0.00009334245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092377224,0.0001894153,0.00024239832,0.00013252103,0.00035320583,0.000039779115,0.000430057,0.00010942022,0.000005850827],"category_scores_gemma":[0.000006757543,0.00019368176,0.000024803123,0.0007148818,0.00019571601,0.00023839244,0.000011222513,0.00059922296,0.0000031446473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036107805,0.000050271687,0.00009819659,0.000055715787,0.000050110426,0.0000020716502,0.0015383632,0.93575835,0.0044778506,0.00038339978,0.00005188351,0.05749769],"study_design_scores_gemma":[0.0012746233,0.00018001633,0.00036757707,0.0005031411,0.00004419341,0.000019768782,0.0007342904,0.97201717,0.017943986,0.00023860105,0.006102558,0.0005741023],"about_ca_topic_score_codex":0.000013073575,"about_ca_topic_score_gemma":0.000064051856,"teacher_disagreement_score":0.9487893,"about_ca_system_score_codex":0.000051535277,"about_ca_system_score_gemma":0.000010610207,"threshold_uncertainty_score":0.78981125},"labels":[],"label_agreement":null},{"id":"W3088732684","doi":"10.1109/tcomm.2021.3062649","title":"Multiple-Association Supporting HTC/MTC in Limited-Backhaul Capacity Ultra-Dense Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backhaul (telecommunications); Telecommunications link; Bottleneck; Stochastic geometry; Computer science; Computer network; Path loss; Cellular network; Coverage probability; Distributed computing; Electronic engineering; Engineering; Base station; Telecommunications; Wireless; Mathematics; Embedded system","score_opus":0.02376324035062772,"score_gpt":0.2482431692812244,"score_spread":0.22447992893059668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088732684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014406303,0.00028693522,0.98060226,0.0004163171,0.00061878475,0.00036272468,0.00006919465,0.000571857,0.002665601],"genre_scores_gemma":[0.9855827,0.0012457741,0.012376755,0.00006485304,0.00003210306,0.00019046677,0.00008052281,0.000064977095,0.00036182103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834114,0.00023499379,0.0006402192,0.00024023971,0.00016313493,0.00038029853],"domain_scores_gemma":[0.99738693,0.00087260926,0.00013572202,0.0012986868,0.0002141769,0.00009187483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031688472,0.0002145866,0.00026405154,0.00019751418,0.00030902892,0.000060300303,0.00034276416,0.00023545824,0.000051557774],"category_scores_gemma":[0.00009850061,0.00028226577,0.0001190297,0.0009304859,0.000039118037,0.0003487282,0.0000032759626,0.0008040082,0.000053125947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004481331,0.00016631614,0.00060265197,0.000020644817,0.000053021933,0.0000024296846,0.0005591303,0.9913204,0.004387145,0.000053209802,0.000111313464,0.0027193115],"study_design_scores_gemma":[0.00087103073,0.000018933351,0.00074375037,0.00015430452,0.000056491626,0.00002062063,0.00056634156,0.9766668,0.019213742,0.000085225256,0.0011731874,0.0004295778],"about_ca_topic_score_codex":0.00008459096,"about_ca_topic_score_gemma":0.004377169,"teacher_disagreement_score":0.97117645,"about_ca_system_score_codex":0.00072260224,"about_ca_system_score_gemma":0.000044106422,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W3089835555","doi":"10.1109/tcomm.2020.3028302","title":"Construction of Irregular Protograph-Based QC-LDPC Codes With Low Error Floor","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Tanner graph; Algorithm; Error floor; Computer science; Block code; Set (abstract data type); Block (permutation group theory); Graph; Decoding methods; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.032120189380703906,"score_gpt":0.2695646230738625,"score_spread":0.23744443369315857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089835555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048411437,0.00003446154,0.9864389,0.0061749946,0.000094790725,0.0009048033,0.000030488283,0.000983709,0.0004967234],"genre_scores_gemma":[0.65970325,0.000017848308,0.33969155,0.00022578773,0.000005685287,0.00032570222,0.0000037302711,0.000016744716,0.000009687897],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985218,0.00023356777,0.0003778974,0.00035498646,0.00030937704,0.00020235771],"domain_scores_gemma":[0.99681807,0.00020771459,0.00021832035,0.002331928,0.00029747013,0.00012650054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017907459,0.00020465035,0.00025566007,0.00025369215,0.00039765416,0.00006077143,0.0019264736,0.00009180703,0.000019639147],"category_scores_gemma":[0.000014454039,0.00019850174,0.00014077213,0.0013951433,0.0004551478,0.0003197818,0.00001304103,0.00045722025,0.000016572689],"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.0014640284,0.011188601,0.0022268987,0.0015848244,0.0015748241,0.000031354946,0.022154823,0.12340617,0.20727628,0.06288969,0.0019209657,0.5642815],"study_design_scores_gemma":[0.0012336195,0.0012822418,0.00030794766,0.00042292735,0.00011751106,0.00003853384,0.0003784503,0.4466178,0.54633516,0.00095165597,0.0016503504,0.00066379417],"about_ca_topic_score_codex":0.00010009505,"about_ca_topic_score_gemma":0.00017598186,"teacher_disagreement_score":0.6548621,"about_ca_system_score_codex":0.00004441545,"about_ca_system_score_gemma":0.00020176076,"threshold_uncertainty_score":0.80946666},"labels":[],"label_agreement":null},{"id":"W3093368304","doi":"10.1109/tcomm.2020.3030780","title":"Energy-Efficient Multi-Cell Massive MIMO Subject to Minimum User-Rate Constraints","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":22,"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; Queen's University; Queen's University Belfast; Royal Academy of Engineering; Princeton University; National Science Foundation","keywords":"Beamforming; Computer science; MIMO; Scheduling (production processes); Throughput; Bottleneck; Enhanced Data Rates for GSM Evolution; Computer network; Electronic engineering; Real-time computing; Wireless; Embedded system; Engineering; Telecommunications","score_opus":0.028997463480214418,"score_gpt":0.24918654100462753,"score_spread":0.2201890775244131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093368304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000991371,0.00014377393,0.99379355,0.0012041274,0.00031798618,0.00044876602,0.00020772759,0.00062925956,0.0022634142],"genre_scores_gemma":[0.9573674,0.00018460941,0.0413631,0.00036848296,0.000022649072,0.00027237905,0.00002532075,0.00007493227,0.00032109205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879706,0.00013164205,0.00040886799,0.00026714153,0.000116010655,0.00027930184],"domain_scores_gemma":[0.99818206,0.00023350028,0.000059209022,0.0011319019,0.00012602822,0.00026727695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007874516,0.0002491737,0.00023033784,0.00016908284,0.00030166397,0.00004534138,0.00063041755,0.00010795658,0.00007549536],"category_scores_gemma":[0.000011619198,0.0002941175,0.000107284555,0.00066364143,0.00010610908,0.00011271868,0.000007241876,0.00032061216,0.00031639505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010051966,0.00016285873,0.0000012259212,0.00002040598,0.000036617836,0.0000012418516,0.0010005478,0.9768548,0.019024067,0.00009298146,0.0003646544,0.0024305733],"study_design_scores_gemma":[0.00072399684,0.000066028566,0.000007112814,0.00004808218,0.000044121207,0.0000026480673,0.0005642326,0.9469943,0.045722734,0.0000044316043,0.005462202,0.00036007818],"about_ca_topic_score_codex":0.00002393708,"about_ca_topic_score_gemma":0.0001191079,"teacher_disagreement_score":0.9563761,"about_ca_system_score_codex":0.00014748379,"about_ca_system_score_gemma":0.000045751385,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W3095023944","doi":"10.1109/tcomm.2020.3034934","title":"Computation Over Multi-Access Channels: Multi-Hop Implementation and Resource Allocation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","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":"Computer science; Computation; Wireless; Hop (telecommunications); Superposition principle; Fading; Wireless network; Distributed computing; Computer network; Resource allocation; Channel (broadcasting); Algorithm; Mathematics; Telecommunications","score_opus":0.08917838698410775,"score_gpt":0.345838731161207,"score_spread":0.25666034417709926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095023944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044892593,0.00015322158,0.98628414,0.007935866,0.0001688176,0.00042391123,0.000012313363,0.0004195703,0.00011292538],"genre_scores_gemma":[0.91602486,0.00025593597,0.08215475,0.0013054406,0.00002736003,0.000112414324,0.00004176222,0.000026151789,0.000051330233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998313,0.00030574668,0.00040583138,0.00047255194,0.00025386477,0.0002490199],"domain_scores_gemma":[0.9981817,0.00028516448,0.00017784738,0.0010344745,0.00013945902,0.00018132877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018215,0.00020959167,0.0001763468,0.00017746339,0.00071888434,0.000343469,0.0013623569,0.00009374741,0.000013523621],"category_scores_gemma":[0.000008206952,0.00023832837,0.00007171143,0.00083100173,0.00012143024,0.0007694838,0.0000462726,0.00035597812,0.000024128361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017879709,0.00055652164,0.00007198573,0.000024134031,0.00007271877,0.0000014110631,0.004815766,0.8851854,0.0017498488,0.0029200618,0.0005400234,0.104044214],"study_design_scores_gemma":[0.0009958593,0.00007177582,0.0005831025,0.000023956278,0.000023400244,0.0000038682933,0.0002983459,0.99252415,0.0028283554,0.00002191137,0.0023803907,0.0002449054],"about_ca_topic_score_codex":0.00013686187,"about_ca_topic_score_gemma":0.0002793146,"teacher_disagreement_score":0.9115356,"about_ca_system_score_codex":0.000077750105,"about_ca_system_score_gemma":0.00004829951,"threshold_uncertainty_score":0.9718749},"labels":[],"label_agreement":null},{"id":"W3101768914","doi":"10.1109/tcomm.2020.3038772","title":"Dual Pilot Scheme (DPS) and Its Application in Massive MIMO","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Rayleigh fading; Computer science; Channel state information; Wireless; Interference (communication); Fading; Channel (broadcasting); Precoding; Multi-user MIMO; Electronic engineering; Algorithm; Computer network; Engineering; Telecommunications","score_opus":0.035471273778957826,"score_gpt":0.25852618789724185,"score_spread":0.22305491411828404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101768914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032735176,0.0005341727,0.9919023,0.0018097591,0.00006943631,0.00057788816,0.00004774725,0.0003855781,0.0013996265],"genre_scores_gemma":[0.98967177,0.00090385054,0.008846366,0.000106114225,0.00001820309,0.0003665655,0.000017655984,0.000038330785,0.00003117106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992901,0.00004959953,0.00027442357,0.00017137862,0.00007519327,0.00013928475],"domain_scores_gemma":[0.99916863,0.00011027452,0.000038047758,0.00054120255,0.00005080397,0.00009100882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055034343,0.00013620344,0.00014256874,0.00011298076,0.00013998548,0.000018532897,0.00023213238,0.00006422246,0.000013620678],"category_scores_gemma":[0.000008248955,0.0001679335,0.000025087515,0.00045320368,0.00003873914,0.00024410296,0.0000039658366,0.0003252063,0.00008268446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022497637,0.00015020835,0.000026277019,0.00007490558,0.000039985443,8.118236e-7,0.0009895345,0.9466224,0.04537941,0.0016714635,0.000098679426,0.0049238605],"study_design_scores_gemma":[0.0005806409,0.00006448039,0.00007004193,0.00003814416,0.000016875156,0.0000037713064,0.00019231431,0.9886352,0.008310321,0.000093340954,0.0017712475,0.00022364312],"about_ca_topic_score_codex":0.000013183336,"about_ca_topic_score_gemma":0.00013970377,"teacher_disagreement_score":0.9863982,"about_ca_system_score_codex":0.000079922844,"about_ca_system_score_gemma":0.000014757623,"threshold_uncertainty_score":0.68481296},"labels":[],"label_agreement":null},{"id":"W3103340483","doi":"10.1109/tcomm.2020.3037345","title":"Height Optimization and Resource Allocation for NOMA Enhanced UAV-Aided Relay Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Carleton University","funders":"Engineering and Physical Sciences Research Council","keywords":"Relay; Computer science; Resource allocation; Protocol (science); Enhanced Data Rates for GSM Evolution; Noma; Macrocell; Relay channel; Optimization problem; Computer network; Transmitter power output; Mathematical optimization; Channel (broadcasting); Power (physics); Base station; Algorithm; Telecommunications link; Mathematics; Telecommunications","score_opus":0.018905719672310417,"score_gpt":0.2198769175134163,"score_spread":0.20097119784110587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103340483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003933772,0.00029670645,0.99385875,0.0026809578,0.00007135075,0.00073557795,0.00004117042,0.0004888374,0.0014332465],"genre_scores_gemma":[0.8924087,0.0017259313,0.10445576,0.00032177477,0.000046283258,0.00071717927,0.00017444488,0.000060727078,0.00008919676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991284,0.000047421494,0.000335459,0.00022902597,0.00008650586,0.0001731723],"domain_scores_gemma":[0.99872243,0.0002333006,0.000060433093,0.0007532195,0.00010703084,0.00012355775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092168666,0.0001736831,0.00015846452,0.000089233785,0.00047859966,0.00006739264,0.00033026948,0.00013429283,0.00003800345],"category_scores_gemma":[0.000008904281,0.00020234582,0.00006509936,0.00045669253,0.00007383601,0.00020694027,0.0000041331846,0.00024266343,0.000011488749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015980082,0.00004873896,8.8679315e-7,0.000017911656,0.000036155423,2.4689292e-8,0.0003627332,0.98830897,0.0008687853,0.0005012627,0.0004949232,0.009343614],"study_design_scores_gemma":[0.00044755256,0.0000574133,0.000012378117,0.00001979657,0.00006318942,0.0000011923928,0.000096884825,0.98820716,0.0035364346,0.000029990357,0.007327226,0.00020076703],"about_ca_topic_score_codex":0.0000047909098,"about_ca_topic_score_gemma":0.000025310634,"teacher_disagreement_score":0.89201534,"about_ca_system_score_codex":0.000060627604,"about_ca_system_score_gemma":0.00001643057,"threshold_uncertainty_score":0.8251423},"labels":[],"label_agreement":null},{"id":"W3111673929","doi":"10.1109/tcomm.2021.3081746","title":"Federated Learning in Unreliable and Resource-Constrained Cellular Wireless Networks","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","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","keywords":"Computer science; Wireless; Federated learning; Convergence (economics); Train; Scheduling (production processes); Distributed computing; Wireless network; Machine learning; Computation; Artificial intelligence; Resource (disambiguation); Computer network; Algorithm; Mathematical optimization; Telecommunications","score_opus":0.03637400621240366,"score_gpt":0.26826778355044845,"score_spread":0.23189377733804478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111673929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059205485,0.001277466,0.9728625,0.016954469,0.00035762775,0.00041646787,0.000024644793,0.0011434278,0.0010428673],"genre_scores_gemma":[0.8861274,0.0033347309,0.109908916,0.0001166382,0.000010161303,0.00023345024,0.00010967365,0.000035232653,0.00012376861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971671,0.00067884376,0.00058677327,0.0008786561,0.00025076882,0.0004378367],"domain_scores_gemma":[0.9852608,0.0009516314,0.00022315884,0.013332168,0.00013337369,0.0000989069],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00066833687,0.00036679208,0.00045249422,0.00045742522,0.0008232302,0.00076585036,0.019017898,0.00063008594,0.000016007434],"category_scores_gemma":[0.0004965461,0.00044548002,0.00011165602,0.0010326859,0.00038118794,0.00034235933,0.0073253177,0.0042539565,0.000006447892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005025926,0.0023185906,0.00030673275,0.00033398625,0.0006405914,0.00013846076,0.0018376625,0.5186484,0.0034283197,0.0020252606,0.008810836,0.46146092],"study_design_scores_gemma":[0.00031536122,0.000031339496,0.000044059416,0.0005132934,0.000025468773,0.000013765958,0.0002732704,0.9924531,0.0019610978,0.0030757608,0.0008800305,0.00041345163],"about_ca_topic_score_codex":0.00040965553,"about_ca_topic_score_gemma":0.0006639583,"teacher_disagreement_score":0.8802069,"about_ca_system_score_codex":0.00021106261,"about_ca_system_score_gemma":0.0002845517,"threshold_uncertainty_score":0.99979967},"labels":[],"label_agreement":null},{"id":"W3118326706","doi":"10.1109/tcomm.2021.3051680","title":"Antenna Clustering for Simultaneous Wireless Information and Power Transfer in a MIMO Full-Duplex System: A Deep Reinforcement Learning-Based Design","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":33,"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":"MIMO; Precoding; Cluster analysis; Reinforcement learning; Computer science; Multi-user MIMO; Antenna (radio); Electronic engineering; Wireless; 3G MIMO; Maximum power transfer theorem; Energy harvesting; Zero-forcing precoding; Beamforming; Control theory (sociology); Energy (signal processing); Power (physics); Engineering; Mathematics; Telecommunications; Artificial intelligence; Physics","score_opus":0.01772217575845923,"score_gpt":0.2253980461397645,"score_spread":0.20767587038130528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118326706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007190802,0.00021812331,0.99123096,0.00012749975,0.0001726775,0.00048127782,0.000010576553,0.0004110329,0.0001570643],"genre_scores_gemma":[0.98696935,0.000345174,0.01195199,0.000054863747,0.000008106786,0.0005378035,0.000048936825,0.00004573221,0.000038066457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875647,0.00014217892,0.0005230435,0.0001557384,0.00013662934,0.00028596708],"domain_scores_gemma":[0.9979429,0.0010929886,0.000039284394,0.0006867152,0.00015434438,0.000083772495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023167455,0.00021515517,0.00023519206,0.00021290101,0.0003378343,0.0001018602,0.00027479345,0.00015301444,0.0000107458245],"category_scores_gemma":[0.000023365528,0.00025806294,0.00007739231,0.0003907325,0.000064354805,0.000280256,0.000003953615,0.00046203472,0.0000062998456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051629882,0.000047976315,0.000002122707,0.00017790166,0.00004291396,0.0000025397926,0.00076684204,0.9925814,0.001612209,0.000092198155,0.0000034748568,0.004618735],"study_design_scores_gemma":[0.0009676017,0.00009361979,0.000007775192,0.00038050028,0.00004020171,0.000021037627,0.0005468252,0.9953872,0.0018036482,0.0000015921398,0.00049977074,0.00025024437],"about_ca_topic_score_codex":0.000034009394,"about_ca_topic_score_gemma":0.0008880912,"teacher_disagreement_score":0.9797785,"about_ca_system_score_codex":0.00022086773,"about_ca_system_score_gemma":0.000059380087,"threshold_uncertainty_score":0.9999872},"labels":[],"label_agreement":null},{"id":"W3122586336","doi":"10.1109/tcomm.2020.3030057","title":"Capacity-Approaching Polar Codes With Long Codewords and Successive Cancellation Decoding Based on Improved Gaussian Approximation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Additive white Gaussian noise; Decoding methods; Algorithm; Code word; Polar code; Code (set theory); Binary symmetric channel; Channel capacity; Polar; Gaussian; Mathematics; Binary number; List decoding; Channel (broadcasting); Low-density parity-check code; Concatenated error correction code; Computer science; Linear code; Telecommunications; Block code; Physics; Arithmetic","score_opus":0.03976994118903215,"score_gpt":0.26594717886165586,"score_spread":0.2261772376726237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122586336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048566805,0.000034498946,0.9846553,0.007983615,0.00006975032,0.0005551098,0.000020931473,0.00071796484,0.0011061138],"genre_scores_gemma":[0.785013,0.000028301747,0.21427602,0.00049879245,0.000012502787,0.00012878767,0.000008999861,0.000023143337,0.000010451756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845886,0.0003017704,0.00029811164,0.00045492308,0.00025456687,0.00023177809],"domain_scores_gemma":[0.9975376,0.000584136,0.00021410019,0.0013843476,0.00012897748,0.00015083917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030549994,0.00023590247,0.00021290619,0.00022371676,0.0009965125,0.0002517668,0.0010269278,0.00010003217,0.00000404622],"category_scores_gemma":[0.000033339973,0.00022969999,0.000057687557,0.00071374286,0.0001396461,0.0006180656,0.000014772664,0.00070047786,0.000004066221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007716137,0.0029203487,0.004444648,0.0007437695,0.000512162,0.00001622546,0.054412972,0.32703462,0.038186736,0.04327975,0.00021344256,0.52746373],"study_design_scores_gemma":[0.0003786306,0.0002629677,0.00027258293,0.0001375021,0.0000313602,0.0000058448295,0.00009934281,0.9830301,0.015259504,0.00020436091,0.000050554787,0.0002672566],"about_ca_topic_score_codex":0.0002809526,"about_ca_topic_score_gemma":0.0009912493,"teacher_disagreement_score":0.7801563,"about_ca_system_score_codex":0.00014909625,"about_ca_system_score_gemma":0.0001077602,"threshold_uncertainty_score":0.9366894},"labels":[],"label_agreement":null},{"id":"W3124703125","doi":"10.1109/tcomm.2021.3053040","title":"Joint Resource Allocation for Linear Precoding in Downlink Massive MIMO Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; Telecommunications link; Zero-forcing precoding; MIMO; Mathematical optimization; Maximization; Optimization problem; Computer science; Resource allocation; Mathematics; Control theory (sociology); Telecommunications; Beamforming; Computer network","score_opus":0.042261741950461465,"score_gpt":0.26972668549204704,"score_spread":0.22746494354158558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124703125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004220758,0.0007368606,0.99482787,0.0006137491,0.00042838661,0.0007418599,0.00009516453,0.000319827,0.0018142387],"genre_scores_gemma":[0.95149434,0.0007370498,0.045797337,0.00002994122,0.000044428656,0.0010630506,0.00013797703,0.000065988446,0.000629868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988524,0.00012304763,0.00050857634,0.000209398,0.00009513202,0.0002114618],"domain_scores_gemma":[0.99813175,0.0003340741,0.0000711853,0.0012175511,0.00018522958,0.000060217684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019062044,0.00016223505,0.00022016834,0.00021639142,0.00024007961,0.000043794415,0.00027717985,0.00013255166,0.000011086963],"category_scores_gemma":[0.000027073991,0.00020076656,0.00008765254,0.00048929447,0.000035392353,0.00021178457,0.000003454487,0.00032042683,0.000025438369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053216368,0.00008643404,0.0000022125496,0.00008856474,0.000034359156,5.078561e-7,0.00042846476,0.9910312,0.0054189144,0.00048414426,0.00012502045,0.0022948312],"study_design_scores_gemma":[0.00055215135,0.000022275437,0.000011358824,0.00027600655,0.000033087916,0.000009099597,0.0008470424,0.97296304,0.016553866,0.000066279834,0.008435744,0.00023003848],"about_ca_topic_score_codex":0.000023266772,"about_ca_topic_score_gemma":0.0002927431,"teacher_disagreement_score":0.9510723,"about_ca_system_score_codex":0.00031701315,"about_ca_system_score_gemma":0.00005121059,"threshold_uncertainty_score":0.8187023},"labels":[],"label_agreement":null},{"id":"W3124815611","doi":"10.1109/tcomm.2021.3053613","title":"Achievable Rate Characterization of NOMA-Aided Cell-Free Massive MIMO With Imperfect Successive Interference Cancellation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":30,"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; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; MIMO; Noma; Power control; Single antenna interference cancellation; Path loss; Transmitter power output; Channel state information; Moment (physics); Context (archaeology); Control theory (sociology); Topology (electrical circuits); Computer network; Channel (broadcasting); Mathematics; Telecommunications; Power (physics); Wireless; Transmitter","score_opus":0.014609455880716883,"score_gpt":0.22909796706560284,"score_spread":0.21448851118488596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124815611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091040574,0.0003380374,0.90455925,0.00088482245,0.00013222995,0.00032531537,0.00017623644,0.00055433135,0.0019891968],"genre_scores_gemma":[0.9854894,0.0037479496,0.010034703,0.000026585156,0.0000059030713,0.00024696087,0.00011881262,0.000051478855,0.0002782067],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988402,0.0001627008,0.00042858772,0.00022165789,0.000138096,0.00020875409],"domain_scores_gemma":[0.99563783,0.0004338312,0.00019198564,0.003324729,0.00036035143,0.000051242754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008677617,0.00023029673,0.00028118156,0.00021774325,0.0003027172,0.000041502466,0.0011898238,0.00013121204,0.00007269027],"category_scores_gemma":[0.000022563881,0.00024297785,0.00007528615,0.00083614385,0.00022769212,0.00040858926,0.000026072046,0.0005268195,0.000017790424],"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.0000402498,0.00024652507,0.00003682254,0.00008924924,0.000107144006,0.0000015970573,0.0005903866,0.21011953,0.7789276,0.00062893954,0.000029885796,0.009182048],"study_design_scores_gemma":[0.00063151296,0.00008341419,0.0003493095,0.00016727483,0.00005180833,0.0000042920333,0.0004728792,0.048872706,0.94844174,0.0002379476,0.00040302583,0.000284065],"about_ca_topic_score_codex":0.00002789684,"about_ca_topic_score_gemma":0.0004208587,"teacher_disagreement_score":0.8945246,"about_ca_system_score_codex":0.00016225563,"about_ca_system_score_gemma":0.000102591075,"threshold_uncertainty_score":0.99083495},"labels":[],"label_agreement":null},{"id":"W3126241668","doi":"10.1109/tcomm.2021.3057625","title":"Error Floor Estimation of LDPC Coded Modulation Systems Using Importance Sampling","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Low-density parity-check code; Phase-shift keying; Algorithm; Quadrature amplitude modulation; Keying; Modulation (music); QAM; Pulse-amplitude modulation; Binary number; Computer science; Estimator; Bit error rate; Mathematics; Decoding methods; Theoretical computer science; Statistics; Telecommunications; Arithmetic","score_opus":0.11458966318581643,"score_gpt":0.3540887267497274,"score_spread":0.23949906356391099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126241668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031975854,0.00019834802,0.9660076,0.0003390735,0.00042998142,0.0002677072,0.000021984402,0.0004677617,0.00029172536],"genre_scores_gemma":[0.6529186,0.000043665586,0.34689346,0.000024523306,0.000006310957,0.000044577126,0.000010241697,0.000013681012,0.00004494895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842983,0.00025597206,0.0005592733,0.00030437508,0.00027266666,0.00017786768],"domain_scores_gemma":[0.9961693,0.00032438463,0.0002920727,0.0027687075,0.00038806658,0.000057437323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036821218,0.0001516563,0.00022584354,0.0002135822,0.00046741017,0.00009616925,0.0010349347,0.000109958535,0.000008513382],"category_scores_gemma":[0.000042089618,0.00018088253,0.00009875775,0.0009260097,0.000073594034,0.00054854614,0.00001850689,0.00033582788,0.000009381643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070611827,0.00047027593,0.000082994324,0.000066585075,0.000063276486,0.0000016775979,0.0011640639,0.9243986,0.04286679,0.007491877,0.000025009922,0.02336178],"study_design_scores_gemma":[0.0001360017,0.000025053068,0.00023060181,0.00014408866,0.00002816683,0.000035034955,0.00011063746,0.97071266,0.027585927,0.0007739449,0.00005752624,0.0001603386],"about_ca_topic_score_codex":0.00021698214,"about_ca_topic_score_gemma":0.00016415498,"teacher_disagreement_score":0.6209428,"about_ca_system_score_codex":0.00017398917,"about_ca_system_score_gemma":0.00019258833,"threshold_uncertainty_score":0.73761755},"labels":[],"label_agreement":null},{"id":"W3131407158","doi":"10.1109/tcomm.2021.3058369","title":"A Trellis-Coded Quantization Approach to Transmitting Correlated Gaussian Sources Over a Fading MAC Without Transmitter-CSI","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":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; Encoder; Codebook; Algorithm; Fading; Rayleigh fading; Transmitter; Trellis modulation; Vector quantization; Quantization (signal processing); MIMO; Precoding; Decoding methods; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering","score_opus":0.025862579811998628,"score_gpt":0.27161996544117073,"score_spread":0.2457573856291721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131407158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011457763,0.0005205318,0.97580934,0.0006503022,0.00014278217,0.00061903324,0.000073435105,0.0019815522,0.008745243],"genre_scores_gemma":[0.884368,0.001650021,0.11264036,0.00021944212,0.000015674861,0.0005220832,0.00009429568,0.00014033914,0.0003497772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978745,0.00028999642,0.0007194989,0.00041022743,0.00028938733,0.00041637628],"domain_scores_gemma":[0.9965076,0.0003088642,0.00009096908,0.0027279947,0.00016762604,0.00019694911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021003906,0.00039179964,0.00041541117,0.00042722304,0.0007336863,0.0001315219,0.0011269999,0.00023404021,0.000063764026],"category_scores_gemma":[0.000011926592,0.0004644568,0.00022262459,0.0015143725,0.00013385207,0.00040729475,0.000009730214,0.0009683706,0.00004666566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005267296,0.0012365027,0.000117981006,0.00017006973,0.0003773691,0.0000027906287,0.011556704,0.8458834,0.07041718,0.0032320071,0.00024138423,0.06671194],"study_design_scores_gemma":[0.0011020853,0.00006434955,0.00028661345,0.00042888225,0.0001994024,0.00004711909,0.0012938586,0.81446946,0.16936587,0.00043470063,0.011280782,0.0010268982],"about_ca_topic_score_codex":0.000045637724,"about_ca_topic_score_gemma":0.00017046537,"teacher_disagreement_score":0.87291026,"about_ca_system_score_codex":0.00020229758,"about_ca_system_score_gemma":0.00005742297,"threshold_uncertainty_score":0.9997807},"labels":[],"label_agreement":null},{"id":"W3131641277","doi":"10.1109/tcomm.2021.3058964","title":"Energy-Efficient Resource Allocation for NOMA-MEC Networks With Imperfect CSI","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":114,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Probabilistic logic; Resource allocation; Base station; Mathematical optimization; Channel state information; Computational complexity theory; Energy consumption; Optimization problem; Resource management (computing); Noma; Distributed computing; Computer network; Algorithm; Telecommunications link; Wireless; Engineering; Telecommunications; Mathematics","score_opus":0.0159310288920092,"score_gpt":0.23365854456456564,"score_spread":0.21772751567255644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131641277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011500436,0.0015913423,0.9921079,0.0011921504,0.000101240345,0.00027440462,0.000041171697,0.0012917349,0.0022499792],"genre_scores_gemma":[0.9541511,0.0022563532,0.042096704,0.000098443095,0.000013826813,0.0009984464,0.00009354879,0.00006574335,0.00022582931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895304,0.0000889543,0.00031465534,0.00023460893,0.0001349049,0.00027381539],"domain_scores_gemma":[0.9958039,0.0006427329,0.00006346748,0.0032171505,0.00020798086,0.000064766136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111273956,0.00021928667,0.00020485322,0.00016315906,0.0006104787,0.000053076878,0.0009054952,0.00014979913,0.000017458931],"category_scores_gemma":[0.000010295883,0.00023288908,0.000108142514,0.00070660596,0.00018338462,0.000108081,0.0000120307295,0.00043770173,0.000008653676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013606899,0.00016748275,0.0000012226068,0.000013688926,0.00007469513,3.571276e-7,0.00011450176,0.95150375,0.0017329219,0.0028049578,0.0001855719,0.043387223],"study_design_scores_gemma":[0.0004998567,0.00006850338,0.00001505512,0.000072797244,0.000051147574,0.000017081336,0.0005373644,0.89087707,0.06338089,0.00013954105,0.044016875,0.00032382537],"about_ca_topic_score_codex":0.000009534766,"about_ca_topic_score_gemma":0.00023917436,"teacher_disagreement_score":0.9530011,"about_ca_system_score_codex":0.00018746179,"about_ca_system_score_gemma":0.000052926014,"threshold_uncertainty_score":0.94969416},"labels":[],"label_agreement":null},{"id":"W3131701009","doi":"10.1109/tcomm.2021.3060797","title":"Construction of Time Invariant Spatially Coupled LDPC Codes Free of Small Trapping Sets","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Low-density parity-check code; Decoding methods; Tanner graph; Algorithm; Error floor; Invariant (physics); Computer science; Constraint (computer-aided design); Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.0372330144525903,"score_gpt":0.2670990262776684,"score_spread":0.2298660118250781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131701009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010983649,0.00010029698,0.9846182,0.0015025013,0.00020519247,0.0002226172,0.000049530736,0.00032970455,0.0019883325],"genre_scores_gemma":[0.61877584,0.0002271829,0.38083768,0.000042748445,0.000003775092,0.00003410128,0.0000064749793,0.000011920194,0.000060269955],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841774,0.00033082085,0.0005806854,0.00027223217,0.000232692,0.00016584904],"domain_scores_gemma":[0.99480367,0.00078332704,0.00030878044,0.0035141313,0.0005300978,0.000059984573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038416282,0.00015413096,0.000311017,0.00024698395,0.0002632209,0.00003840607,0.0019716546,0.000111903355,0.000045063392],"category_scores_gemma":[0.000068265836,0.00018013972,0.00015905489,0.0008564145,0.00025506158,0.00022681711,0.00004155895,0.00035487412,0.000009080644],"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.00007709187,0.0036904728,0.00023279572,0.00025567462,0.0007180246,0.000013502826,0.00825517,0.017828368,0.79761183,0.045070946,0.00038541137,0.1258607],"study_design_scores_gemma":[0.00068719377,0.00020828324,0.0003267477,0.00037817942,0.00010555382,0.00010955612,0.00019038797,0.41249183,0.57733,0.0076331715,0.00017874278,0.0003603215],"about_ca_topic_score_codex":0.00035202483,"about_ca_topic_score_gemma":0.0012596,"teacher_disagreement_score":0.6077922,"about_ca_system_score_codex":0.00006115996,"about_ca_system_score_gemma":0.00033886454,"threshold_uncertainty_score":0.73458844},"labels":[],"label_agreement":null},{"id":"W3132925507","doi":"10.1109/tcomm.2021.3078776","title":"Belief-Propagation Decoding of LDPC Codes With Variable Node–Centric Dynamic Schedules","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Ministry of Science and Technology, Taiwan","keywords":"Decoding methods; Low-density parity-check code; Belief propagation; Sequential decoding; Computer science; Schedule; List decoding; Scheduling (production processes); Tanner graph; Algorithm; Berlekamp–Welch algorithm; Node (physics); Theoretical computer science; Concatenated error correction code; Block code; Mathematical optimization; Mathematics","score_opus":0.022493775674910444,"score_gpt":0.27730869346690273,"score_spread":0.2548149177919923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132925507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004564197,0.00024462244,0.99119246,0.0011837162,0.00015354411,0.00020036395,0.000017666229,0.0005028848,0.0019405456],"genre_scores_gemma":[0.5790243,0.0002711125,0.42047608,0.000057582478,0.000002463265,0.000055786742,0.000006539133,0.000013171209,0.000092957984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985792,0.00024311297,0.00036094157,0.00032831103,0.00026912332,0.0002192942],"domain_scores_gemma":[0.99595904,0.00053865684,0.00018454967,0.0027722158,0.00048049638,0.000065025924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029859206,0.00016416084,0.0002132245,0.00026809564,0.0005750739,0.00009434707,0.0014494391,0.00008521998,0.000022550208],"category_scores_gemma":[0.00003140039,0.00016889971,0.00007675491,0.0015920985,0.00013095471,0.0004522036,0.00002735159,0.0004071099,0.000015487092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012255333,0.008093519,0.0013467559,0.00045379074,0.00091889815,0.000027941796,0.0061002015,0.12572202,0.2170247,0.33540818,0.00025771078,0.30452374],"study_design_scores_gemma":[0.0006365866,0.00021064977,0.0004123653,0.0005299335,0.00012246166,0.000098870914,0.0003306039,0.7085892,0.28282624,0.0050818515,0.0006313874,0.0005298126],"about_ca_topic_score_codex":0.00008925661,"about_ca_topic_score_gemma":0.00045510838,"teacher_disagreement_score":0.5828672,"about_ca_system_score_codex":0.0001439465,"about_ca_system_score_gemma":0.00029282706,"threshold_uncertainty_score":0.688753},"labels":[],"label_agreement":null},{"id":"W3135395337","doi":"10.1109/tcomm.2021.3063347","title":"Robust Resource Allocation for Cooperative MISO-NOMA-Based Heterogeneous Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Carleton University","funders":"","keywords":"Computer science; Resource allocation; Beamforming; Channel state information; Noma; Matching (statistics); Mathematical optimization; Channel (broadcasting); Transmitter; Distributed computing; Computer network; Mathematics; Telecommunications; Wireless; Telecommunications link","score_opus":0.046216600452990635,"score_gpt":0.25766599503143406,"score_spread":0.21144939457844342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135395337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041192913,0.0016498761,0.9931113,0.002226429,0.00013700196,0.0004560293,0.00009095031,0.0012918573,0.0006246106],"genre_scores_gemma":[0.93556106,0.0014294655,0.061227538,0.00022027946,0.000013564368,0.0010811278,0.00018781531,0.00007401193,0.00020513489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988857,0.00012503026,0.00037755995,0.00023968749,0.00011090878,0.00026110382],"domain_scores_gemma":[0.99575776,0.0008097966,0.00006186435,0.0030270258,0.00027694882,0.00006659514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000105289924,0.00022583696,0.00021991112,0.00014680735,0.0006758781,0.000061937746,0.0009618,0.00018799098,0.000038342772],"category_scores_gemma":[0.000027049504,0.00027355543,0.00014001034,0.0005751688,0.0001955015,0.00013479212,0.000009348499,0.00051053584,0.000019224452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010466245,0.00016109105,7.859794e-7,0.000014616022,0.0000636934,4.6873265e-7,0.000065559834,0.9806144,0.0014954336,0.0005086009,0.0003152134,0.016749633],"study_design_scores_gemma":[0.00044924588,0.000045332243,0.0000050218437,0.000052021962,0.000033169865,0.00000723759,0.0002326686,0.87511694,0.10158609,0.00012580982,0.022076637,0.00026981957],"about_ca_topic_score_codex":0.0000038730386,"about_ca_topic_score_gemma":0.0002497446,"teacher_disagreement_score":0.93514913,"about_ca_system_score_codex":0.00019705528,"about_ca_system_score_gemma":0.0000645354,"threshold_uncertainty_score":0.9999717},"labels":[],"label_agreement":null},{"id":"W3136003212","doi":"10.1109/tcomm.2022.3159836","title":"Self-Organizing mmWave MIMO Cell-Free Networks With Hybrid Beamforming: A Hierarchical DRL-Based Design","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":45,"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":"Beamforming; Computer science; MIMO; Cluster analysis; Telecommunications link; Electronic engineering; Computer network; Engineering; Artificial intelligence; Telecommunications","score_opus":0.025813781980052738,"score_gpt":0.20871692085527205,"score_spread":0.1829031388752193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136003212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018601215,0.00023586588,0.99443626,0.00055292057,0.00018422186,0.0005132925,0.00005617802,0.0008592617,0.0013018951],"genre_scores_gemma":[0.83261216,0.00017710113,0.16635297,0.00022295002,0.000016677766,0.00042444761,0.000034769022,0.00008470443,0.00007422001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985552,0.00023970053,0.0003521372,0.00023600913,0.00028520214,0.0003317637],"domain_scores_gemma":[0.9975224,0.0003763882,0.000057870988,0.0018307061,0.00007025839,0.00014234944],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00030905163,0.00024051649,0.00019813381,0.00027377732,0.0013468082,0.00006192424,0.000978405,0.000044058626,0.00015249195],"category_scores_gemma":[0.000003375874,0.00026261265,0.000105209125,0.0005187427,0.000067140994,0.00011902975,0.000016509168,0.0011106349,0.000016471224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002829366,0.00028587124,0.0000012782338,0.000019035817,0.00006354983,0.0000028231425,0.00037972507,0.99539346,0.0019873397,0.000021686647,0.00023944769,0.001577484],"study_design_scores_gemma":[0.00079368695,0.00016232315,0.0000011044206,0.000019849636,0.000092676884,0.000032597545,0.00016633963,0.9639486,0.03161454,0.00008654472,0.00276942,0.00031229187],"about_ca_topic_score_codex":0.000013387599,"about_ca_topic_score_gemma":0.000025804527,"teacher_disagreement_score":0.830752,"about_ca_system_score_codex":0.00025533448,"about_ca_system_score_gemma":0.00010690801,"threshold_uncertainty_score":0.9999826},"labels":[],"label_agreement":null},{"id":"W3136372906","doi":"10.1109/tcomm.2021.3065980","title":"Lightweight Continuous Authentication via Intelligently Arranged Pseudo-Random Access in 5G-and-Beyond","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":41,"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; Canada Research Chairs","keywords":"Computer science; Computer network; Random access; Cryptography; Authentication (law); Overhead (engineering); Transceiver; Distributed computing; Computer engineering; Wireless; Computer security; Telecommunications","score_opus":0.025724177900297625,"score_gpt":0.28288387184848235,"score_spread":0.2571596939481847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136372906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03632286,0.0027795979,0.9396492,0.0049374467,0.00035318956,0.00084264774,0.00007238775,0.0013575238,0.013685124],"genre_scores_gemma":[0.98171264,0.009565128,0.0077944663,0.00016267676,0.000011988207,0.00048014542,0.00004935521,0.000057547393,0.00016606344],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984125,0.00029264303,0.000591949,0.0002635059,0.00018775198,0.00025167415],"domain_scores_gemma":[0.996483,0.0005467194,0.000072417584,0.0026158695,0.00017629655,0.000105662766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027846624,0.00024011912,0.0003298247,0.00037158892,0.00029969562,0.00016239162,0.0012070838,0.00017807787,0.00012234703],"category_scores_gemma":[0.000016665392,0.00028672873,0.0001104484,0.00080503424,0.0001791565,0.00044804873,0.000021662072,0.0007690584,0.000056380395],"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.00025548626,0.0073513705,0.0008772663,0.00064051134,0.0013089331,0.000035993566,0.03291694,0.020646088,0.27825862,0.031111773,0.0029471077,0.6236499],"study_design_scores_gemma":[0.0029385053,0.00009307872,0.0024538452,0.0004900699,0.00026541084,0.00011111917,0.0011763654,0.26033238,0.69050086,0.012695984,0.02735781,0.0015845749],"about_ca_topic_score_codex":0.0000812732,"about_ca_topic_score_gemma":0.0014088532,"teacher_disagreement_score":0.94538975,"about_ca_system_score_codex":0.00015132081,"about_ca_system_score_gemma":0.000046382527,"threshold_uncertainty_score":0.9999585},"labels":[],"label_agreement":null},{"id":"W3136518070","doi":"10.1109/tcomm.2021.3065976","title":"ADMM Check Node Penalized Decoders for LDPC Codes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Low-density parity-check code; Code word; Algorithm; Node (physics); Mathematics; Parity-check matrix; Computer science; Mathematical optimization","score_opus":0.06324101790705305,"score_gpt":0.3371862364926889,"score_spread":0.27394521858563586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136518070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042779345,0.0002246847,0.9860917,0.007950528,0.00039960007,0.00035353738,0.00003844,0.0010089461,0.0035047955],"genre_scores_gemma":[0.50276047,0.0002762136,0.49487555,0.00063274126,0.000010526724,0.00044259496,0.0000112843945,0.000023444845,0.00096717104],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99851227,0.00022713302,0.00035770412,0.0004057481,0.0002040319,0.00029313547],"domain_scores_gemma":[0.9946546,0.0010340643,0.00011086465,0.003693188,0.00040083122,0.00010643286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034029724,0.00018911748,0.00022910451,0.00017220774,0.00084725633,0.00017090734,0.002267023,0.00010954914,0.00003948687],"category_scores_gemma":[0.000058672602,0.00021576537,0.00024270103,0.00068288826,0.0001117669,0.00036000944,0.00002586667,0.0003960881,0.000049958708],"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.00025293825,0.010155557,0.00019862049,0.0003714235,0.0014474515,0.0000347706,0.0179216,0.017404046,0.20577526,0.21771409,0.041262195,0.48746204],"study_design_scores_gemma":[0.0015917417,0.00021318703,0.000095736905,0.00022350089,0.00015011159,0.00012094152,0.00050376076,0.31613627,0.60885453,0.01648132,0.05464094,0.0009879327],"about_ca_topic_score_codex":0.000059340804,"about_ca_topic_score_gemma":0.0009525349,"teacher_disagreement_score":0.5023327,"about_ca_system_score_codex":0.0001255548,"about_ca_system_score_gemma":0.00027542977,"threshold_uncertainty_score":0.87986565},"labels":[],"label_agreement":null},{"id":"W3139528444","doi":"10.1109/tcomm.2021.3067058","title":"Covert Surveillance via Proactive Eavesdropping Under Channel Uncertainty","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Eavesdropping; Computer science; Covert; Transmitter; False alarm; Real-time computing; Transmission (telecommunications); Channel (broadcasting); Wireless; Decoding methods; Computer security; Computer network; Artificial intelligence; Telecommunications","score_opus":0.030790753083949397,"score_gpt":0.26549407510601253,"score_spread":0.23470332202206312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139528444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021079986,0.0007356996,0.98297274,0.002110413,0.00023746116,0.00032788626,0.00010552478,0.0013981004,0.01000418],"genre_scores_gemma":[0.98877496,0.0035917896,0.006692678,0.00020334224,0.000015893034,0.00034027346,0.000066337496,0.00006470104,0.00025003732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865013,0.0002655468,0.00036751418,0.00023673977,0.00020801491,0.000272057],"domain_scores_gemma":[0.9959732,0.00042995717,0.000055413217,0.003169377,0.00027161787,0.00010042192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001794882,0.00023548046,0.00025603035,0.00016085099,0.0004958724,0.0000707394,0.0009496288,0.00015420579,0.000083178],"category_scores_gemma":[0.000008662532,0.0002878507,0.00014248141,0.00068787916,0.00016793684,0.00024481036,0.000016302583,0.0007843085,0.00006827485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004391121,0.0019151458,0.000024735002,0.00013681402,0.001184009,0.0000071987893,0.0044100783,0.8723015,0.061295956,0.0080329655,0.0022183268,0.04842936],"study_design_scores_gemma":[0.0009966535,0.00008184895,0.00059195084,0.00022783774,0.00009555743,0.00009307432,0.0015070362,0.7008518,0.26163307,0.006415911,0.026091117,0.001414132],"about_ca_topic_score_codex":0.000082979794,"about_ca_topic_score_gemma":0.0010013751,"teacher_disagreement_score":0.986667,"about_ca_system_score_codex":0.0003139638,"about_ca_system_score_gemma":0.00008436624,"threshold_uncertainty_score":0.9999574},"labels":[],"label_agreement":null},{"id":"W3143629415","doi":"10.1109/tcomm.2021.3068958","title":"Popularity and Size-Aware Caching With Cooperative Transmission in Hybrid Microwave/ Millimeter Wave Heterogeneous Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Computer science; Cache; Computer network; Heterogeneous network; Transmission (telecommunications); Base station; Wireless network; Algorithm; Wireless; Telecommunications","score_opus":0.016208010567981726,"score_gpt":0.2294756949494414,"score_spread":0.21326768438145965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143629415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012211046,0.0012959504,0.98547727,0.00017260824,0.000092071416,0.00029969963,0.000040066177,0.0001535306,0.00025776014],"genre_scores_gemma":[0.9761531,0.0017877594,0.021738572,0.00005454697,0.000009035228,0.00009139001,0.000043893575,0.00005232435,0.00006940077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990211,0.00017289545,0.00029501345,0.0002278157,0.00007797488,0.00020519094],"domain_scores_gemma":[0.9987923,0.00023029788,0.000031340285,0.0007701856,0.0000908991,0.00008499612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076383425,0.00020267341,0.00022619696,0.00007068246,0.00030106772,0.00005012298,0.0001510077,0.00008724224,0.000022953624],"category_scores_gemma":[0.0000037499315,0.00020917381,0.000046591285,0.00031388184,0.00006697695,0.00019952987,0.0000037480415,0.00051577983,0.00000223846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014888744,0.00009035013,0.000018557908,0.000021320795,0.000053306667,0.0000150671185,0.00030756605,0.99017966,0.0029079288,0.000009589527,0.0000047813746,0.0063769678],"study_design_scores_gemma":[0.0007883125,0.00005508798,0.00007901228,0.0002592696,0.00006047442,0.00024109114,0.00024348196,0.96338046,0.0342616,0.000036222034,0.00023656513,0.00035840896],"about_ca_topic_score_codex":0.000077017685,"about_ca_topic_score_gemma":0.0017646989,"teacher_disagreement_score":0.96394205,"about_ca_system_score_codex":0.00016879667,"about_ca_system_score_gemma":0.000028723942,"threshold_uncertainty_score":0.85298604},"labels":[],"label_agreement":null},{"id":"W3146700414","doi":"","title":"Linear estimation of correlated data in wireless sensor networks with optimum power allocation and analog modulation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Nortel (Canada)","funders":"","keywords":"Fusion center; Fading; Distortion (music); Minimum mean square error; Additive white Gaussian noise; Mean squared error; Estimator; Algorithm; Mathematics; Sensor fusion; Wireless sensor network; Gaussian; Computer science; Mathematical optimization; Statistics; White noise; Telecommunications; Wireless; Decoding methods; Cognitive radio; Artificial intelligence; Bandwidth (computing)","score_opus":0.032384170415019765,"score_gpt":0.26128573440116365,"score_spread":0.2289015639861439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146700414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019838369,0.00004884751,0.97883093,0.0006115123,0.00011294725,0.0002545507,0.000031747095,0.00011550722,0.00015557717],"genre_scores_gemma":[0.92060983,0.00047345844,0.07869221,0.000044350174,0.000005211536,0.000019999641,0.00010196545,0.000011558046,0.00004143384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998803,0.00014850595,0.00037775774,0.00031713105,0.00019764736,0.00015593457],"domain_scores_gemma":[0.9972095,0.00023271824,0.00016226235,0.002169308,0.0001587837,0.00006741189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020760196,0.0001396233,0.00018128456,0.00022418835,0.0003270421,0.000033584056,0.0007789864,0.00011093121,0.0000062082268],"category_scores_gemma":[0.000006794382,0.00013882664,0.000026046964,0.0010583163,0.00018009989,0.0006113971,0.000019771893,0.00034254786,0.000004107579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025288762,0.0002485371,0.000057358196,0.0000031372756,0.000025954549,0.0000016413665,0.00020070375,0.9772121,0.000056158413,0.00035779554,0.0000245237,0.021786828],"study_design_scores_gemma":[0.000492575,0.000105627696,0.0025644677,0.000044710036,0.000014496571,0.000049146165,0.000035662924,0.996295,0.00017076163,0.00003338502,0.00005430044,0.00013986834],"about_ca_topic_score_codex":0.00013842463,"about_ca_topic_score_gemma":0.00015593319,"teacher_disagreement_score":0.90077144,"about_ca_system_score_codex":0.000046132158,"about_ca_system_score_gemma":0.00005541381,"threshold_uncertainty_score":0.5661186},"labels":[],"label_agreement":null},{"id":"W3150752166","doi":"10.1109/tcomm.2021.3070892","title":"Spectrum Sensing for Symmetric α-Stable Noise Model With Convolutional Neural Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Carleton University","funders":"","keywords":"Gaussian noise; Computer science; Noise (video); Robustness (evolution); Impulse noise; Detector; Convolutional neural network; Additive white Gaussian noise; Cognitive radio; Noise measurement; Algorithm; Artificial intelligence; Channel (broadcasting); Noise reduction; Telecommunications; Wireless","score_opus":0.029720792999199462,"score_gpt":0.24856221361330144,"score_spread":0.21884142061410197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150752166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014855579,0.00023831685,0.99367857,0.004070542,0.00039510385,0.00024745532,0.00008182192,0.00028234,0.000857308],"genre_scores_gemma":[0.8100985,0.00016063794,0.18832612,0.00045671474,0.000038822887,0.000049929775,0.00003855966,0.000021358164,0.0008093436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864364,0.0001046307,0.0002818627,0.00038148652,0.00022226557,0.00036614176],"domain_scores_gemma":[0.9971916,0.00046871317,0.000093482355,0.0017604663,0.0003429685,0.00014274228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001451846,0.00018441597,0.00019444444,0.00017469027,0.0010909403,0.00024610164,0.00069291325,0.00009274741,0.000010571188],"category_scores_gemma":[0.0000075678026,0.00018808914,0.0001489852,0.0015087216,0.00010663396,0.00035553117,0.000013937133,0.00042390765,0.00000864062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001742032,0.00020534138,0.0000011521098,0.0000033675194,0.00005063325,0.0000023381435,0.000029737446,0.97120094,0.000048912436,0.012874254,0.00028944202,0.015276449],"study_design_scores_gemma":[0.0005648494,0.00007329557,0.000016941105,0.00001734475,0.00003892269,0.00008743818,0.000029662164,0.99521565,0.0008494495,0.001511419,0.0013715158,0.00022348377],"about_ca_topic_score_codex":0.000021194797,"about_ca_topic_score_gemma":0.00023120457,"teacher_disagreement_score":0.80994993,"about_ca_system_score_codex":0.00012266541,"about_ca_system_score_gemma":0.00016193232,"threshold_uncertainty_score":0.83907413},"labels":[],"label_agreement":null},{"id":"W3153816843","doi":"10.1109/tcomm.2021.3104225","title":"Multi-Point Coordination in Massive MIMO Systems With Sectorized Antennas","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"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":"New York University; National Science Foundation","keywords":"Precoding; MIMO; Computer science; Telecommunications link; Throughput; Transmitter power output; Base station; Power control; Computer network; Cellular network; Channel (broadcasting); Power (physics); Transmitter; Telecommunications; Wireless; Physics","score_opus":0.028411254150382773,"score_gpt":0.2605340669703282,"score_spread":0.23212281281994546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153816843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013873489,0.0014055091,0.99279237,0.00028280963,0.0013460763,0.0015125688,0.00016783526,0.0006461097,0.00045939078],"genre_scores_gemma":[0.94675285,0.001227016,0.04935593,0.000010685696,0.00002843357,0.0018786875,0.00025665155,0.00014164756,0.00034807977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980732,0.00030596237,0.0007317245,0.00038647396,0.00019756528,0.00030505314],"domain_scores_gemma":[0.9964509,0.00024403473,0.00019567569,0.0026431773,0.00036798458,0.000098210534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019955712,0.0004540174,0.0005838388,0.00055606104,0.00021208612,0.00016737967,0.00073773816,0.00040754338,0.000019774548],"category_scores_gemma":[0.000012791812,0.0005026514,0.0001326904,0.0006900488,0.000095671414,0.0003086738,0.00001725735,0.0015052547,0.000018333258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140234615,0.0002433337,0.000011897487,0.00026837454,0.00015386139,0.0000051575557,0.0013277334,0.99515057,0.0024160824,0.000024238605,0.000031141808,0.00035358057],"study_design_scores_gemma":[0.0011499984,0.00003234723,0.00005316226,0.0016289493,0.00009374762,0.000017427454,0.0020386628,0.99289507,0.0013780864,0.0000118585895,0.0001391652,0.0005615022],"about_ca_topic_score_codex":0.0004326184,"about_ca_topic_score_gemma":0.0033775773,"teacher_disagreement_score":0.9453655,"about_ca_system_score_codex":0.0009329037,"about_ca_system_score_gemma":0.00014210764,"threshold_uncertainty_score":0.9997425},"labels":[],"label_agreement":null},{"id":"W3157654480","doi":"10.1109/tcomm.2021.3077935","title":"Robust Deception Scheme for Secure Interference Exploitation Under PSK Modulations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Key Science and Technology Program of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Deception; Channel state information; Transmission (telecommunications); Interference (communication); Artificial noise; Overhead (engineering); Channel (broadcasting); Precoding; Transmitter; Relaxation (psychology); Antenna (radio); Wireless; Computer network; Electronic engineering; Telecommunications; MIMO; Engineering","score_opus":0.09581227425649212,"score_gpt":0.2970397573741499,"score_spread":0.20122748311765776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157654480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004592476,0.0003840688,0.98914784,0.0020219695,0.00022499028,0.00045601605,0.0001524435,0.0011597733,0.0018604085],"genre_scores_gemma":[0.8349734,0.0016885691,0.16174556,0.000121272766,0.000018473085,0.0009831892,0.000197664,0.000060709594,0.00021117245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879813,0.00013558315,0.00044541337,0.00023851875,0.00015863802,0.00022368567],"domain_scores_gemma":[0.996519,0.00049110345,0.000066515146,0.0023844626,0.00045091388,0.000087976885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001572863,0.0002158668,0.0001989234,0.00022903724,0.0005596611,0.000103032115,0.0007522399,0.00017931765,0.00013488907],"category_scores_gemma":[0.000019415455,0.00027648633,0.00016268187,0.0005790112,0.000112203204,0.00044672817,0.000010959997,0.00050380395,0.000054005483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035665293,0.0013675495,0.000022639279,0.00017888314,0.00041487545,6.296721e-7,0.0039701955,0.8039456,0.082687676,0.05996785,0.0046757916,0.042732656],"study_design_scores_gemma":[0.00076356804,0.00007457512,0.00023817299,0.00023459728,0.00010676938,0.000016682121,0.0016871383,0.886618,0.08760584,0.010805819,0.01115939,0.00068943197],"about_ca_topic_score_codex":0.000011805819,"about_ca_topic_score_gemma":0.00063461566,"teacher_disagreement_score":0.8303809,"about_ca_system_score_codex":0.00022866372,"about_ca_system_score_gemma":0.000070403396,"threshold_uncertainty_score":0.9999687},"labels":[],"label_agreement":null},{"id":"W3160735954","doi":"10.1109/tcomm.2021.3075523","title":"K-Means Clustering-Aided Non-Coherent Detection for Molecular Communications","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","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","funders":"European Commission","keywords":"Cluster analysis; Computer science; Transmission (telecommunications); Detector; Interference (communication); Bit error rate; Channel (broadcasting); Algorithm; Artificial intelligence; Decoding methods; Telecommunications","score_opus":0.026966955219374342,"score_gpt":0.2640879482571508,"score_spread":0.23712099303777648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160735954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061338214,0.0014361714,0.98715407,0.0014788499,0.00042532012,0.0006824961,0.00008303752,0.0005308398,0.007595854],"genre_scores_gemma":[0.94200975,0.004108548,0.051660746,0.00030323942,0.000019360372,0.0012689943,0.00014471021,0.000100352074,0.00038431524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984667,0.0002239432,0.00053687685,0.0002614442,0.00017971786,0.00033135692],"domain_scores_gemma":[0.9929271,0.00040889165,0.00007563477,0.006147401,0.00029047672,0.00015053488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002100188,0.0002785605,0.0002756817,0.0001965231,0.00081734685,0.00010301213,0.0015857414,0.00020155217,0.0000670994],"category_scores_gemma":[0.000015277088,0.0003508081,0.00031393894,0.00068491406,0.00016044582,0.00014684454,0.00003275201,0.0006731506,0.000082112485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006134525,0.0015665425,0.0000053402464,0.0001866482,0.0008974482,0.000004702429,0.0011149974,0.46047378,0.30345276,0.0022735544,0.0015089485,0.22845393],"study_design_scores_gemma":[0.000859334,0.00005778271,0.000027278455,0.00009115572,0.00014300378,0.000024745555,0.0001813932,0.8284767,0.11282589,0.0003303474,0.05654758,0.00043478888],"about_ca_topic_score_codex":0.000021234098,"about_ca_topic_score_gemma":0.0016421512,"teacher_disagreement_score":0.94139636,"about_ca_system_score_codex":0.00018936588,"about_ca_system_score_gemma":0.00007260806,"threshold_uncertainty_score":0.9998944},"labels":[],"label_agreement":null},{"id":"W3164808597","doi":"10.1109/tcomm.2023.3256415","title":"Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"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":"Intersymbol interference; Computer science; Markov chain; Markov process; Nyquist ISI criterion; Mathematical optimization; Secrecy; Iterative method; Interference (communication); Algorithm; Mathematics; Decoding methods; Computer network; Channel (broadcasting); Statistics; Computer security","score_opus":0.06085588529188848,"score_gpt":0.28098068462304443,"score_spread":0.22012479933115595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164808597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048753016,0.00010515857,0.93858683,0.001154197,0.00045110696,0.00055868505,0.00035182762,0.003282113,0.006757048],"genre_scores_gemma":[0.9937391,0.0016121115,0.0040961406,0.000042846965,0.000009195328,0.0002969584,0.000042856755,0.000048459016,0.00011227622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987039,0.00017358597,0.0005355104,0.00017103141,0.0001702358,0.00024573674],"domain_scores_gemma":[0.9961617,0.0008533294,0.0000840361,0.00264179,0.00016701914,0.000092105096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027887535,0.0002199326,0.0002993725,0.0005243921,0.00022364879,0.000037005262,0.0016113041,0.00015016453,0.000110159825],"category_scores_gemma":[0.000026334024,0.00025920023,0.00015676297,0.0010170982,0.00042957018,0.00021335448,0.000021366359,0.0006917237,0.00014989875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001606595,0.0031534538,0.00018942881,0.0012461565,0.0022292675,0.000008238795,0.07091508,0.3676917,0.28712747,0.048317555,0.0067493813,0.21221161],"study_design_scores_gemma":[0.00066067174,0.00018234612,0.00016689133,0.0006210501,0.000087052795,0.000012897796,0.001342549,0.6881235,0.300764,0.0045081805,0.0027881225,0.000742685],"about_ca_topic_score_codex":0.000076054625,"about_ca_topic_score_gemma":0.00019632986,"teacher_disagreement_score":0.94498616,"about_ca_system_score_codex":0.00008995311,"about_ca_system_score_gemma":0.000036189747,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W3164862323","doi":"10.1109/tcomm.2021.3082779","title":"Covert Transmission Assisted by Intelligent Reflecting Surface","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Beamforming; Channel state information; Transmission (telecommunications); Transmitter power output; Optimization problem; Algorithm; Mathematical optimization; Relaxation (psychology); Channel (broadcasting); Mathematics; Wireless; Telecommunications","score_opus":0.054788839119600995,"score_gpt":0.3152848826105058,"score_spread":0.2604960434909048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164862323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002147455,0.0037382764,0.98590344,0.0022351677,0.00015927793,0.00016703377,0.000057268957,0.0017710235,0.0038210407],"genre_scores_gemma":[0.91306883,0.016442968,0.06933158,0.00006585207,0.0000032221965,0.000074983946,0.000053075895,0.000058168866,0.00090132316],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988367,0.00013307227,0.00040370232,0.00021621352,0.00017032471,0.00024000676],"domain_scores_gemma":[0.9965606,0.00045918018,0.00005026795,0.002717183,0.00013320909,0.00007956261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106609674,0.0002089751,0.0002087873,0.00009384749,0.0005466154,0.000052245847,0.0009879597,0.00016704807,0.00012582708],"category_scores_gemma":[0.000013407032,0.00024472616,0.000116887226,0.0007204133,0.00013303869,0.00020126281,0.000010539362,0.0008313314,0.000078926765],"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.000009264853,0.00047469363,0.0000063029775,0.000035690315,0.00013286962,0.0000016582375,0.00038983548,0.34092078,0.3802525,0.00040551988,0.002007091,0.27536377],"study_design_scores_gemma":[0.00023082845,0.000025023088,0.000011927495,0.00009463762,0.000025459627,0.000017889864,0.00049858866,0.066413194,0.82266337,0.00038352574,0.10932374,0.0003117907],"about_ca_topic_score_codex":0.00001456357,"about_ca_topic_score_gemma":0.00007597474,"teacher_disagreement_score":0.91657186,"about_ca_system_score_codex":0.00022642345,"about_ca_system_score_gemma":0.000043306725,"threshold_uncertainty_score":0.9979643},"labels":[],"label_agreement":null},{"id":"W3166530189","doi":"10.1109/tcomm.2021.3094509","title":"Joint Active and Passive Beamforming Design for IRS-Assisted Multi-User MIMO Systems: A VAMP-Based Approach","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coordinate descent; Beamforming; Computer science; Optimization problem; MIMO; Telecommunications link; Minimum mean square error; Robustness (evolution); Mathematical optimization; Base station; Algorithm; Control theory (sociology); Mathematics; Telecommunications; Estimator","score_opus":0.10417126347042943,"score_gpt":0.29000979088003387,"score_spread":0.18583852740960444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166530189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044438057,0.0020749434,0.99154866,0.0004005534,0.00035500954,0.0027235737,0.0005445468,0.0017567637,0.00015155568],"genre_scores_gemma":[0.5601306,0.0027232969,0.429322,0.000021510647,0.000008246623,0.0073569627,0.00026638995,0.00009391842,0.00007706938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977456,0.0003040285,0.0007813455,0.0005548278,0.00021195273,0.00040225958],"domain_scores_gemma":[0.9927438,0.001357257,0.00030382923,0.0050618555,0.00041556667,0.00011772076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018396099,0.0005979415,0.00074745284,0.0005534679,0.00082783814,0.00021593955,0.0016556152,0.0007036051,0.0000046319533],"category_scores_gemma":[0.000061529274,0.0006884673,0.0002939113,0.00041926134,0.0003663731,0.0002492297,0.000080507445,0.0019981514,0.0000023695313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021813501,0.00046467173,4.634408e-7,0.0005058978,0.00040626046,4.932881e-7,0.0006371319,0.9754852,0.0022408455,0.0002443503,0.0000540199,0.019938862],"study_design_scores_gemma":[0.0010037072,0.00005153607,0.000020281595,0.0007706616,0.00022771179,0.000011297251,0.0040920204,0.9576921,0.03370923,0.00011010345,0.0015357594,0.00077558815],"about_ca_topic_score_codex":0.00006254242,"about_ca_topic_score_gemma":0.0001060602,"teacher_disagreement_score":0.56222665,"about_ca_system_score_codex":0.0006639053,"about_ca_system_score_gemma":0.00022248992,"threshold_uncertainty_score":0.99955666},"labels":[],"label_agreement":null},{"id":"W3170007158","doi":"10.1109/tcomm.2021.3086535","title":"Caching Transient Content for IoT Sensing: Multi-Agent Soft Actor-Critic","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":69,"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; Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Cache; Computer science; Upload; Cloud computing; Markov decision process; Reinforcement learning; Distributed computing; Computer network; Smart Cache; Enhanced Data Rates for GSM Evolution; Cache algorithms; Real-time computing; Markov process; CPU cache; Telecommunications; Artificial intelligence","score_opus":0.1064839323359109,"score_gpt":0.30545701768773714,"score_spread":0.19897308535182623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170007158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027634617,0.00011358627,0.9882828,0.009469704,0.0005690261,0.00047769948,0.00004910167,0.0003102539,0.0004514675],"genre_scores_gemma":[0.5671532,0.00010365629,0.43124953,0.000742822,0.000010718975,0.000075235606,0.000028495939,0.000017278795,0.00061902765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985186,0.00017115261,0.00050500885,0.00028537298,0.00024482384,0.0002750559],"domain_scores_gemma":[0.9965877,0.0004980516,0.00011774372,0.002072678,0.0005892059,0.00013460357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506833,0.00018723558,0.00019035376,0.00017858345,0.0010345549,0.00022928989,0.0009718205,0.00009171113,0.000020501682],"category_scores_gemma":[0.00004504271,0.00020901635,0.00020788563,0.00043642047,0.000084679596,0.00054516067,0.000013161064,0.0003130138,0.000048940878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003069311,0.0020766002,0.0000048806205,0.00010984507,0.00028490368,0.000007701193,0.011555901,0.75469095,0.012465369,0.01681707,0.00084509456,0.20111099],"study_design_scores_gemma":[0.00093306514,0.000053185962,0.00005247482,0.000067678426,0.000042976128,0.00003800518,0.00047525702,0.97536343,0.0149932485,0.000119396056,0.0075873504,0.00027392225],"about_ca_topic_score_codex":0.000029385197,"about_ca_topic_score_gemma":0.00025442155,"teacher_disagreement_score":0.5668769,"about_ca_system_score_codex":0.00019431167,"about_ca_system_score_gemma":0.00025724314,"threshold_uncertainty_score":0.8523439},"labels":[],"label_agreement":null},{"id":"W3172818029","doi":"10.1109/tcomm.2021.3088898","title":"Secrecy-Energy Efficient Hybrid Beamforming for Satellite-Terrestrial Integrated Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":406,"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; McGill University","funders":"Shanghai Aerospace Science and Technology Innovation Foundation; Nanjing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Beamforming; Telecommunications link; Computer science; Mathematical optimization; Optimization problem; Convex optimization; Iterative method; Base station; Communications satellite; Satellite; Algorithm; Mathematics; Telecommunications; Regular polygon; Engineering","score_opus":0.03608583246600989,"score_gpt":0.25723979008194703,"score_spread":0.22115395761593715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172818029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011591307,0.005081032,0.9878729,0.00026999708,0.0013712283,0.00036659764,0.00012866815,0.0006880929,0.003062367],"genre_scores_gemma":[0.9790705,0.007105357,0.012150582,0.00009305705,0.000079366895,0.00061502494,0.00036056235,0.00009451782,0.0004310742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983046,0.00024253882,0.00066131965,0.00026038295,0.0001742147,0.00035695912],"domain_scores_gemma":[0.99543345,0.0010872147,0.00007992062,0.0030463114,0.00021259859,0.00014051607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002692444,0.00027556636,0.00031297567,0.00020182332,0.0005684714,0.00012846722,0.0010284103,0.00014292423,0.00005103992],"category_scores_gemma":[0.00001977293,0.00031401956,0.0002553324,0.0006669217,0.000106183994,0.000119269,0.000010987417,0.000502851,0.000034394474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003522196,0.00029554547,0.0000041456824,0.000026087288,0.00022091414,0.0000014955906,0.00030313892,0.86812663,0.0021932523,0.001558018,0.00020527733,0.12703028],"study_design_scores_gemma":[0.0006482548,0.00002771066,0.0000071129934,0.00011461575,0.00006358178,0.000031648633,0.0003106676,0.7740075,0.022315338,0.00016058832,0.2019802,0.00033279962],"about_ca_topic_score_codex":0.00005465017,"about_ca_topic_score_gemma":0.00031434244,"teacher_disagreement_score":0.97791135,"about_ca_system_score_codex":0.00024787284,"about_ca_system_score_gemma":0.00009618344,"threshold_uncertainty_score":0.9999312},"labels":[],"label_agreement":null},{"id":"W3173445790","doi":"10.1109/tcomm.2021.3093331","title":"Joint Sparse Observation and Coding Design for Multiple Phenomena Monitoring","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":2,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Linear network coding; Computer science; Coding (social sciences); Energy consumption; Power consumption; Convex optimization; Power (physics); Real-time computing; Algorithm; Regular polygon; Computer network; Mathematics; Engineering","score_opus":0.14802491627745495,"score_gpt":0.2861491786325252,"score_spread":0.13812426235507025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173445790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005892176,0.00021998194,0.99658823,0.0014791811,0.00051982066,0.0002634191,0.000025143525,0.00019612245,0.000118877884],"genre_scores_gemma":[0.65773696,0.0007086121,0.34100473,0.00008083534,0.00003813593,0.00016562386,0.000007430065,0.000011282443,0.00024636823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990759,0.00012267286,0.00024460355,0.00026023568,0.000115776216,0.00018083763],"domain_scores_gemma":[0.99789655,0.00061218295,0.00007229289,0.0011105931,0.00022081856,0.00008757201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021058603,0.00011498778,0.0001302322,0.000079142505,0.0008263538,0.00021250937,0.00038638213,0.00005848812,0.000004204985],"category_scores_gemma":[0.000024233463,0.00013122946,0.00007108991,0.00043028453,0.00004542142,0.00033637788,0.000011202816,0.00019547831,0.000007275084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005016785,0.001288774,0.00006942365,0.000059657115,0.00026388216,0.0000054698203,0.0020820994,0.25818133,0.035687122,0.014854155,0.00061353063,0.68684435],"study_design_scores_gemma":[0.00055160886,0.00006174687,0.0002656659,0.000045237324,0.000022666614,0.000013958826,0.00016371516,0.95235157,0.041092206,0.0009658534,0.004283949,0.00018182406],"about_ca_topic_score_codex":0.000014285042,"about_ca_topic_score_gemma":0.000020889824,"teacher_disagreement_score":0.69417024,"about_ca_system_score_codex":0.000070099166,"about_ca_system_score_gemma":0.000053350443,"threshold_uncertainty_score":0.63557285},"labels":[],"label_agreement":null},{"id":"W3178826893","doi":"10.1109/tcomm.2021.3096559","title":"UAV-Aided Ultra-Reliable Low-Latency Computation Offloading in Future IoT Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":78,"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; Computation; Computation offloading; Latency (audio); Internet of Things; Computer network; Embedded system; Distributed computing; Telecommunications; Edge computing; Algorithm","score_opus":0.01105959361391108,"score_gpt":0.22766019802114404,"score_spread":0.21660060440723297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178826893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068058698,0.0008093323,0.98562735,0.00085102697,0.00043453253,0.0003012068,0.000022391221,0.00040281852,0.004745461],"genre_scores_gemma":[0.976116,0.0034560496,0.019717226,0.00011125099,0.00005084146,0.00020490898,0.00012459229,0.00004956592,0.00016957143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891865,0.00007016961,0.00042556468,0.00021735467,0.00012256324,0.00024570443],"domain_scores_gemma":[0.9985805,0.00015194704,0.000046690944,0.0010047503,0.00013937046,0.000076740915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118475626,0.00018370246,0.00018914364,0.0001992963,0.00035687984,0.000071679606,0.00034016822,0.00016779134,0.00010341813],"category_scores_gemma":[0.0000028448324,0.00022420293,0.000087039276,0.0012269466,0.00004718717,0.00017070679,0.000002672291,0.00054966094,0.00006170346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032294256,0.00019357906,0.000029448795,0.000016744274,0.000027562684,8.809588e-7,0.00022631891,0.9874198,0.0015042889,0.00043217323,0.00028939772,0.0098566],"study_design_scores_gemma":[0.0004309731,0.000012701498,0.00042591896,0.00008689739,0.00003360634,0.00000860875,0.00027523423,0.99181753,0.004413373,0.00022445076,0.0020146917,0.00025602482],"about_ca_topic_score_codex":0.00004261267,"about_ca_topic_score_gemma":0.0005883735,"teacher_disagreement_score":0.9693101,"about_ca_system_score_codex":0.00017579983,"about_ca_system_score_gemma":0.000047650727,"threshold_uncertainty_score":0.914273},"labels":[],"label_agreement":null},{"id":"W3188476661","doi":"10.1109/tcomm.2021.3102641","title":"A Unified MIMO Optimization Framework Relying on the KKT Conditions","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Engineering and Physical Sciences Research Council; European Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Karush–Kuhn–Tucker conditions; Mathematics; MIMO; Weighting; Mathematical optimization; Covariance matrix; Covariance; Applied mathematics; Topology (electrical circuits); Algorithm; Beamforming; Combinatorics","score_opus":0.03432338657052311,"score_gpt":0.27284112252192116,"score_spread":0.23851773595139805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188476661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021201077,0.00020963122,0.98391175,0.002573618,0.00051738136,0.00038973682,0.00010041845,0.00062790734,0.011457515],"genre_scores_gemma":[0.9337112,0.0011512644,0.06360902,0.000335845,0.000032934484,0.00045418984,0.000088925444,0.00007554562,0.00054111786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882776,0.00021242356,0.00036963468,0.00020948307,0.00016100616,0.00021971468],"domain_scores_gemma":[0.9963159,0.0011179836,0.00006487093,0.0022346433,0.00019273478,0.00007384504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012994767,0.00020420342,0.00016932191,0.00014668322,0.0009781295,0.000085324114,0.0005009709,0.00015697365,0.00032284376],"category_scores_gemma":[0.000057996847,0.00019999138,0.00011509296,0.00091723097,0.00010768521,0.0002083551,0.0000047627314,0.0007105835,0.0001518645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035713686,0.00011170315,7.913967e-7,0.000010162696,0.00006820884,0.0000010148816,0.00032807412,0.9868627,0.0007816226,0.0109780645,0.00037181893,0.00048224698],"study_design_scores_gemma":[0.0003357272,0.00003660097,0.000013511053,0.00034783297,0.000102662234,0.000023093946,0.0009359987,0.97971064,0.012332941,0.0022446818,0.0035088402,0.0004074871],"about_ca_topic_score_codex":0.00000741478,"about_ca_topic_score_gemma":0.000059685044,"teacher_disagreement_score":0.93349916,"about_ca_system_score_codex":0.00017663183,"about_ca_system_score_gemma":0.00005397549,"threshold_uncertainty_score":0.81554115},"labels":[],"label_agreement":null},{"id":"W3189202224","doi":"10.1109/tcomm.2021.3097726","title":"Deep Learning Optimized Sparse Antenna Activation for Reconfigurable Intelligent Surface Assisted Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":112,"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; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Beamforming; Computer science; Antenna (radio); Reconfigurable antenna; Electronic engineering; Smart antenna; Channel state information; Channel (broadcasting); Directional antenna; Wireless; Engineering; Computer network; Telecommunications; Radiation pattern; Antenna efficiency","score_opus":0.050836460090818845,"score_gpt":0.28157925751726753,"score_spread":0.23074279742644868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189202224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018177492,0.0017537071,0.98896694,0.0022226216,0.00013755445,0.00057028024,0.000023296696,0.0017271027,0.0027807357],"genre_scores_gemma":[0.816876,0.017553793,0.16409415,0.00006660207,0.0000047091785,0.0004962239,0.00020861573,0.00007939107,0.00062049564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836963,0.0002869001,0.0005959387,0.00027133312,0.00015995331,0.0003162133],"domain_scores_gemma":[0.99426526,0.001480869,0.00015565513,0.003549976,0.0004708663,0.00007739813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002773973,0.00027671197,0.0003317869,0.00018989092,0.0010179166,0.00010353068,0.0012730975,0.00022823743,0.00012575295],"category_scores_gemma":[0.00009807152,0.0003413636,0.00018542065,0.0007805438,0.00019844715,0.00042369365,0.00001499332,0.0009879952,0.000055781045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002917338,0.00025710274,0.0000035846158,0.00003264646,0.00013531935,2.1286941e-7,0.0003328205,0.88477945,0.038372677,0.00090964686,0.00009799729,0.07504939],"study_design_scores_gemma":[0.00069914054,0.000041813906,0.000034487402,0.00015088427,0.000048014805,0.000009845617,0.0015496605,0.7363792,0.24331225,0.00090501877,0.016484084,0.00038560692],"about_ca_topic_score_codex":0.000020481944,"about_ca_topic_score_gemma":0.00015286737,"teacher_disagreement_score":0.8248728,"about_ca_system_score_codex":0.00032656567,"about_ca_system_score_gemma":0.000054639542,"threshold_uncertainty_score":0.99990386},"labels":[],"label_agreement":null},{"id":"W3194106282","doi":"10.1109/tcomm.2022.3160540","title":"Modulating Intelligent Surfaces for Multiuser MIMO Systems: Beamforming and Modulation Design","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Base station; Telecommunications link; Modulation (music); Optimization problem; Notation; MIMO; Set (abstract data type); Computer science; Mathematics; Mathematical optimization; Algorithm; Telecommunications; Acoustics; Arithmetic","score_opus":0.06546507744018185,"score_gpt":0.27681455023122487,"score_spread":0.21134947279104302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194106282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007736608,0.0012967375,0.98845565,0.00025333595,0.0002072917,0.00091680407,0.000091130125,0.00095957343,0.00008289283],"genre_scores_gemma":[0.8815506,0.0011498249,0.115258224,0.000012604829,0.0000043411965,0.0018833167,0.000021664651,0.00004924436,0.000070154085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899864,0.00012272407,0.00037290753,0.00017215374,0.00013711059,0.00019648236],"domain_scores_gemma":[0.9975398,0.000842682,0.00008179348,0.0014266823,0.00006956489,0.00003944113],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00028349622,0.00016792733,0.00017630747,0.00024390746,0.0013309824,0.00004682079,0.0007268042,0.00006296115,0.000009645611],"category_scores_gemma":[0.00001515446,0.00020345011,0.000055953908,0.00032762805,0.00009602526,0.00023534938,0.00002409581,0.00042891307,0.0000030906251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007644868,0.000058240195,0.0000044781045,0.00002470218,0.000040650575,4.6717343e-8,0.00046138855,0.9580965,0.0033477857,0.00071681914,0.00002605056,0.03721568],"study_design_scores_gemma":[0.00021187826,0.000053715637,0.000016808035,0.000025057634,0.00001739107,0.0000052237747,0.0019509235,0.9879477,0.0058692507,0.00056789437,0.003131415,0.00020272084],"about_ca_topic_score_codex":0.000029390352,"about_ca_topic_score_gemma":0.00002443424,"teacher_disagreement_score":0.873814,"about_ca_system_score_codex":0.0002345195,"about_ca_system_score_gemma":0.000015704078,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W3195227469","doi":"10.1109/tcomm.2021.3106099","title":"Exploiting Impacts of Antenna Selection and Energy Harvesting for Massive Network Connectivity","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Memorial University of Newfoundland; Exfo Electro-Optical Engineering (Canada)","funders":"","keywords":"Computer science; Energy harvesting; Throughput; Interference (communication); Transmission (telecommunications); Stochastic geometry; Small cell; Antenna (radio); Selection (genetic algorithm); Cellular network; Noma; Energy (signal processing); Communications system; Electronic engineering; Efficient energy use; Computer network; Distributed computing; Wireless; Telecommunications; Telecommunications link; Engineering; Electrical engineering; Channel (broadcasting); Mathematics","score_opus":0.0251014766377111,"score_gpt":0.2444844166799369,"score_spread":0.2193829400422258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195227469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03314087,0.0007603829,0.96448225,0.00015256491,0.00027036216,0.00007974905,0.00003169237,0.0003016554,0.0007804864],"genre_scores_gemma":[0.9661788,0.0011506603,0.03225565,0.000033004522,0.00006321896,0.00014661442,0.000016578208,0.0000501994,0.00010531613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904543,0.00012136548,0.00031572045,0.0001757442,0.00008339353,0.00025835537],"domain_scores_gemma":[0.9975372,0.0015135949,0.0000885549,0.0005705466,0.00021014038,0.000079944846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001802867,0.00015823415,0.00022501181,0.000079040474,0.00044137205,0.000042958593,0.00018302635,0.00010922714,0.0000069071175],"category_scores_gemma":[0.00005443064,0.00019562438,0.00008193818,0.00046737192,0.00008017421,0.0002042131,0.0000056249705,0.00027765904,5.134148e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010206081,0.000087324144,0.00013365102,0.0000726066,0.00014188304,6.414351e-7,0.00016602439,0.94493514,0.02631017,0.0032121593,0.00007061853,0.024859553],"study_design_scores_gemma":[0.0003815852,0.000057001293,0.00035893547,0.00036107076,0.000078670215,0.000025930822,0.00015355521,0.9543936,0.04242013,0.00057696755,0.00094548403,0.00024702854],"about_ca_topic_score_codex":0.000100818004,"about_ca_topic_score_gemma":0.0023290776,"teacher_disagreement_score":0.9330379,"about_ca_system_score_codex":0.00007141364,"about_ca_system_score_gemma":0.000049300423,"threshold_uncertainty_score":0.79773307},"labels":[],"label_agreement":null},{"id":"W3195752840","doi":"10.1109/tcomm.2021.3107582","title":"Nonconvex Regularized Gradient Projection Sparse Reconstruction for Massive MIMO Channel Estimation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; MIMO; Stiefel manifold; Benchmark (surveying); Rate of convergence; Convergence (economics); Mathematics; Channel (broadcasting); Norm (philosophy); Projection (relational algebra); Compressed sensing; Computer science; Mathematical optimization","score_opus":0.041401377492737014,"score_gpt":0.2680507651052697,"score_spread":0.2266493876125327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195752840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052374965,0.00012450859,0.98958975,0.00083887344,0.0012806015,0.00060185377,0.00005671951,0.0009352987,0.0013348802],"genre_scores_gemma":[0.90427303,0.00065327954,0.09389504,0.000051937994,0.00004048362,0.0005957809,0.00006833623,0.000047231497,0.00037488274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908507,0.00008514503,0.00030893998,0.0002187196,0.00010987174,0.00019228066],"domain_scores_gemma":[0.99832326,0.00016067887,0.00006899419,0.0011260789,0.00026228922,0.000058714173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100481964,0.00017724327,0.00018959006,0.00019592159,0.00044548692,0.0000603327,0.00022013007,0.00013791649,0.000020645812],"category_scores_gemma":[0.000013139763,0.00020996702,0.0001523782,0.00035872537,0.00008545821,0.00021177049,0.0000033078195,0.00028428028,0.000017027276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015120207,0.0010036475,0.00000522548,0.00015121943,0.00071209064,0.000006428005,0.0021864567,0.530986,0.13647944,0.0031951324,0.005276756,0.3198464],"study_design_scores_gemma":[0.00042754438,0.000053012238,0.000019256748,0.00012545883,0.00009104932,0.000055467117,0.00020878376,0.74894637,0.2447682,0.0033442874,0.0017444481,0.00021612282],"about_ca_topic_score_codex":0.000021507261,"about_ca_topic_score_gemma":0.00016825787,"teacher_disagreement_score":0.8990355,"about_ca_system_score_codex":0.00016701037,"about_ca_system_score_gemma":0.000054628672,"threshold_uncertainty_score":0.85622066},"labels":[],"label_agreement":null},{"id":"W3199320363","doi":"10.1109/tcomm.2021.3113948","title":"Scalable Deep Reinforcement Learning for Routing and Spectrum Access in Physical Layer","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Computer network; Scalability; Dynamic Source Routing; Bottleneck; Distributed computing; Wireless network; Physical layer; Static routing; Wireless Routing Protocol; Routing (electronic design automation); Routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Network topology; Wireless; Artificial intelligence; Telecommunications","score_opus":0.03049595639539128,"score_gpt":0.29311828541247237,"score_spread":0.2626223290170811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199320363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029249107,0.0001385757,0.99459726,0.0002533724,0.000093613016,0.00025861958,0.0000026023495,0.00015311775,0.0015779051],"genre_scores_gemma":[0.9932768,0.00040792619,0.005734703,0.000017278113,0.000016545728,0.00022491593,0.0000169878,0.000030542236,0.00027430287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940044,0.00004242825,0.0002039309,0.0001295712,0.000055885386,0.0001677293],"domain_scores_gemma":[0.99917215,0.00023140333,0.000028820985,0.00048494732,0.00004408299,0.00003856605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007607451,0.000102821665,0.00013704393,0.00009124239,0.00024831586,0.000058832225,0.00018373618,0.000044504664,0.000012186618],"category_scores_gemma":[0.000011513097,0.00012497342,0.000040457213,0.00030721034,0.000026601168,0.00028790196,0.0000060304396,0.00026876168,0.0000056584813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003205201,0.000043802578,0.000025412675,0.000025951618,0.000017330807,2.437315e-7,0.00038296182,0.9953469,0.0014678985,0.00032466097,0.000004773321,0.0023568596],"study_design_scores_gemma":[0.00037073888,0.000015876532,0.000056963447,0.000059203445,0.000016892263,0.0000034592917,0.00023768003,0.9830782,0.015472307,0.00019819624,0.0003661973,0.00012430978],"about_ca_topic_score_codex":0.000021484513,"about_ca_topic_score_gemma":0.00044652517,"teacher_disagreement_score":0.9903519,"about_ca_system_score_codex":0.000115793126,"about_ca_system_score_gemma":0.000017744456,"threshold_uncertainty_score":0.5096268},"labels":[],"label_agreement":null},{"id":"W3199707837","doi":"10.1109/tcomm.2021.3111609","title":"Group-Based Random Access and Data Transmission Scheme for Massive MTC Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Queue; Random access; Markov chain; Partition (number theory); Computer network; Distributed computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.07620587417700127,"score_gpt":0.3394941081480693,"score_spread":0.26328823397106804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199707837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007159081,0.0009708734,0.9946594,0.0011221102,0.00015516889,0.0021219573,0.00016149507,0.00020228738,0.00053509447],"genre_scores_gemma":[0.89451903,0.003587306,0.09402784,0.00034962082,0.0001037842,0.006447291,0.0007090879,0.00009885294,0.0001571714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912125,0.00009308509,0.0002555068,0.00023646209,0.00008568415,0.00020802273],"domain_scores_gemma":[0.9972298,0.0006733893,0.000030642263,0.0018971757,0.00007208132,0.000096873904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019586486,0.00016057515,0.0001953362,0.00006246029,0.00047605883,0.00013976957,0.0008888506,0.00012949124,0.00006843425],"category_scores_gemma":[0.0000035512037,0.00016860646,0.00007702788,0.0002817111,0.00006846301,0.00028572622,0.000010000092,0.0003693965,0.0000027577885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021090869,0.00036403723,0.000012443263,0.00018848703,0.00021933044,0.0000022354009,0.0001046476,0.7573881,0.0017370316,0.00044899472,0.0045371,0.23478666],"study_design_scores_gemma":[0.0018907349,0.000026065765,0.000019447338,0.00012477548,0.0000652034,0.00000269855,0.000014199074,0.92568064,0.0018141301,0.00022324976,0.069949955,0.0001888996],"about_ca_topic_score_codex":0.0000082234,"about_ca_topic_score_gemma":0.00012323636,"teacher_disagreement_score":0.9006316,"about_ca_system_score_codex":0.000028737644,"about_ca_system_score_gemma":0.0000415966,"threshold_uncertainty_score":0.6875572},"labels":[],"label_agreement":null},{"id":"W3200381634","doi":"10.1109/tcomm.2021.3111615","title":"Performance Analysis of Minimum Hop Count-Based Routing Techniques in Millimeter Wave Networks: A Stochastic Geometry Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Stochastic geometry; Relay; Computer science; Hop (telecommunications); Extremely high frequency; Probability distribution; Computer network; Electronic engineering; Millimeter; Spectral efficiency; Topology (electrical circuits); Algorithm; Mathematics; Telecommunications; Engineering; Electrical engineering; Statistics; Physics; Optics","score_opus":0.036632621309998045,"score_gpt":0.24754512677167867,"score_spread":0.2109125054616806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200381634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058970083,0.00028565756,0.93948823,0.000048382863,0.00005985482,0.0001816245,0.000042337848,0.00015514568,0.0007686594],"genre_scores_gemma":[0.9646657,0.0004252792,0.03455591,0.000058348982,0.000007118132,0.00014450836,0.00008529898,0.00003011525,0.000027687429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988062,0.000101678685,0.00051685254,0.00019622734,0.00016499627,0.00021408629],"domain_scores_gemma":[0.9982828,0.00027387135,0.000069084126,0.0011678702,0.00015336239,0.000053049236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002890416,0.00016892664,0.00032325165,0.0008194624,0.00015052425,0.000026909198,0.00028807437,0.000115705916,0.000042457723],"category_scores_gemma":[0.000009238336,0.00019313209,0.00018627108,0.0022274754,0.000067753994,0.000107681626,0.0000052436258,0.00042408129,0.000002397649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006791668,0.00019084079,0.000029192961,0.00003188075,0.00024888464,2.9199816e-7,0.00023627088,0.98718053,0.0048393984,0.0000061132814,0.0000040955874,0.0072257277],"study_design_scores_gemma":[0.000185953,0.00001920736,0.00014263627,0.00007868944,0.00034127288,0.0000017727239,0.00016640573,0.97155637,0.027316155,0.0000033280628,0.000013068457,0.00017517216],"about_ca_topic_score_codex":0.000024637055,"about_ca_topic_score_gemma":0.00013280765,"teacher_disagreement_score":0.9056957,"about_ca_system_score_codex":0.000118600685,"about_ca_system_score_gemma":0.0000453925,"threshold_uncertainty_score":0.7875698},"labels":[],"label_agreement":null},{"id":"W3203055641","doi":"10.1109/tcomm.2021.3114764","title":"Weighted Online Fountain Codes With Limited Buffer Size and Feedback Transmissions","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Fountain code; Computer science; Overhead (engineering); Transmission (telecommunications); Real-time computing; Computer network; Block code; Decoding methods; Algorithm; Concatenated error correction code; Telecommunications","score_opus":0.029588972418161785,"score_gpt":0.28177046987122895,"score_spread":0.25218149745306717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203055641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014940978,0.00030057473,0.9683179,0.013745459,0.00010490425,0.00026301364,0.000049572358,0.00096300384,0.0013145512],"genre_scores_gemma":[0.667096,0.0007841639,0.33088496,0.0004620593,0.0000072104795,0.000073413634,0.000010668617,0.000023030952,0.0006584897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984273,0.00032502928,0.00030822324,0.00043584662,0.00024093153,0.00026268992],"domain_scores_gemma":[0.9953557,0.0013161425,0.00008062536,0.0027688197,0.00031553963,0.00016315823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016491183,0.00023131447,0.0002431646,0.000155045,0.00080495415,0.00015861171,0.0012305899,0.00011545349,0.000042999614],"category_scores_gemma":[0.000023189867,0.00021402679,0.00008685555,0.0009768438,0.00020657195,0.00036522152,0.00002224924,0.0006525254,0.000011967542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000371268,0.018439054,0.00083370396,0.00026810027,0.0015050495,0.00017493447,0.0203579,0.0025372624,0.13850006,0.0580073,0.0028113045,0.75619406],"study_design_scores_gemma":[0.0074005416,0.002381484,0.015800636,0.0025670838,0.0009081538,0.002060351,0.0034239152,0.52646285,0.3431654,0.023943828,0.06725668,0.0046290806],"about_ca_topic_score_codex":0.000106645515,"about_ca_topic_score_gemma":0.0015442013,"teacher_disagreement_score":0.751565,"about_ca_system_score_codex":0.000074228665,"about_ca_system_score_gemma":0.00020155164,"threshold_uncertainty_score":0.8727759},"labels":[],"label_agreement":null},{"id":"W3203387279","doi":"10.1109/tcomm.2021.3117599","title":"Multi-RIS-Aided Wireless Systems: Statistical Characterization and Performance Analysis","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":238,"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":"Ministry of Science and Technology, Taiwan; National Science Foundation","keywords":"Ergodic theory; Fading; Independent and identically distributed random variables; Wireless; Channel (broadcasting); Computer science; Outage probability; Topology (electrical circuits); Algorithm; Random variable; Mathematics; Computer network; Telecommunications; Statistics","score_opus":0.02745581189989359,"score_gpt":0.26052869973748877,"score_spread":0.23307288783759517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203387279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06548881,0.0005110099,0.93240166,0.00021492517,0.0001352334,0.00016273599,0.00018086047,0.0007841026,0.00012066771],"genre_scores_gemma":[0.9622434,0.013067096,0.023981256,0.000021150743,0.0000051388683,0.00023502689,0.00021001621,0.000033426506,0.00020349331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989872,0.0001188752,0.00037532486,0.00020216363,0.000129986,0.0001864819],"domain_scores_gemma":[0.9973555,0.00028672678,0.000059734153,0.0020806417,0.00014993505,0.000067459114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088689056,0.00017789302,0.00027575,0.00029488665,0.00041647264,0.00007827413,0.00050246745,0.00012366848,0.000024725545],"category_scores_gemma":[0.000010437165,0.00020704792,0.00005774684,0.0010722479,0.00019622158,0.00026937563,0.000013721913,0.0004498135,0.000027525637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025548034,0.000884892,0.0012946624,0.00030706517,0.0019325224,0.0000053726967,0.0010511312,0.5912602,0.09512497,0.003654022,0.000052334388,0.3044073],"study_design_scores_gemma":[0.0002630463,0.0000190119,0.006824823,0.000045092573,0.00018755064,0.0000095310825,0.00030262428,0.9774954,0.0132250115,0.000011821729,0.0013595718,0.00025651898],"about_ca_topic_score_codex":0.000011651017,"about_ca_topic_score_gemma":0.00008832924,"teacher_disagreement_score":0.9084204,"about_ca_system_score_codex":0.00009835879,"about_ca_system_score_gemma":0.000027707798,"threshold_uncertainty_score":0.8443169},"labels":[],"label_agreement":null},{"id":"W3203705619","doi":"10.1109/tcomm.2021.3115115","title":"Joint Optimization of Trajectory and Communication Resource Allocation for Unmanned Surface Vehicle Enabled Maritime Wireless Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Key Research and Development Program of China","keywords":"Resource allocation; Computer science; Throughput; Wireless; Transmission (telecommunications); Base station; Telecommunications link; Wireless network; Computer network; Optimization problem; Real-time computing; Telecommunications; Algorithm","score_opus":0.016451570641529255,"score_gpt":0.21763369664278237,"score_spread":0.20118212600125313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203705619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066615837,0.0010763609,0.9896213,0.000769287,0.0000579363,0.0005835863,0.00007414299,0.0002347546,0.000921039],"genre_scores_gemma":[0.91131043,0.004599183,0.083163545,0.000052667234,0.000010804052,0.00026102047,0.00036038124,0.000056396966,0.00018556336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988491,0.00014963251,0.0004911997,0.00021122301,0.000117122254,0.00018172359],"domain_scores_gemma":[0.9976442,0.00039364348,0.00010935802,0.0014465667,0.00033310673,0.000073166215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025188693,0.0001743705,0.00023629404,0.00010882587,0.0004661441,0.00005517413,0.0003180206,0.00016316165,0.000034784207],"category_scores_gemma":[0.000009137054,0.00021952014,0.00008741244,0.00052723644,0.00013646677,0.00021255067,0.000008784196,0.00025212194,0.0000022767306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149408215,0.00018267568,0.000007250697,0.00004845062,0.000061622726,5.1132176e-8,0.00022631338,0.990452,0.003874378,0.0009632041,0.00018260616,0.0039865226],"study_design_scores_gemma":[0.0005958743,0.000032387106,0.00011228751,0.00007456457,0.00009089293,0.0000035264743,0.00025901388,0.9824511,0.015172483,0.000100281104,0.000910887,0.00019674817],"about_ca_topic_score_codex":0.000029145811,"about_ca_topic_score_gemma":0.0001622566,"teacher_disagreement_score":0.9064578,"about_ca_system_score_codex":0.00009890963,"about_ca_system_score_gemma":0.00004736462,"threshold_uncertainty_score":0.8951771},"labels":[],"label_agreement":null},{"id":"W3205682784","doi":"10.1109/tcomm.2021.3096959","title":"Outage Performance Analysis of Widely Linear Receivers in Uplink Multi-User MIMO Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"China Scholarship Council","keywords":"Telecommunications link; Diversity gain; Single antenna interference cancellation; Computer science; Coding gain; Dirty paper coding; MIMO; Base station; Array gain; Computer network; Fading; Automatic gain control; Spectral efficiency; Decoding methods; Topology (electrical circuits); Electronic engineering; Channel (broadcasting); Telecommunications; Precoding; Engineering; Antenna (radio); Antenna array; Electrical engineering; Amplifier","score_opus":0.032943870387021845,"score_gpt":0.2715823383833993,"score_spread":0.23863846799637745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205682784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014520985,0.00052977697,0.9834169,0.000057950743,0.0002771111,0.00023276175,0.00008942048,0.00016853651,0.0007065132],"genre_scores_gemma":[0.9686392,0.0024175982,0.027963147,0.0000090420435,0.0000050869235,0.0001006047,0.000059390917,0.000032795026,0.0007731483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989407,0.000098959536,0.00052985945,0.00016659092,0.00010388739,0.00016000665],"domain_scores_gemma":[0.99806404,0.00018056462,0.000078626,0.0014417979,0.00018510941,0.000049842918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014144575,0.00014480784,0.00032784732,0.0005224854,0.00012075446,0.000015323858,0.00035662783,0.00010890612,0.000027717077],"category_scores_gemma":[0.000009341597,0.00017555739,0.00012609763,0.0020023433,0.000055326585,0.00023636392,0.0000036375436,0.00032023704,0.00002112201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039978927,0.00012705603,0.00031293402,0.000050396895,0.0002856943,6.8299016e-7,0.00047052812,0.9962034,0.0016966691,0.000045440887,0.00000771906,0.0007954748],"study_design_scores_gemma":[0.0003462862,0.000011078012,0.0005182581,0.00010104273,0.0002351883,0.0000018320344,0.00044642526,0.99313813,0.004378863,7.268807e-7,0.000665486,0.00015666614],"about_ca_topic_score_codex":0.00009666134,"about_ca_topic_score_gemma":0.0010219965,"teacher_disagreement_score":0.9554538,"about_ca_system_score_codex":0.00016843072,"about_ca_system_score_gemma":0.00003725016,"threshold_uncertainty_score":0.71590227},"labels":[],"label_agreement":null},{"id":"W3212556128","doi":"10.1109/tcomm.2021.3126626","title":"Deep Reinforcement Learning-Based Multidimensional Resource Management for Energy Harvesting Cognitive NOMA Communications","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Concordia University","funders":"Chongqing University of Posts and Telecommunications; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Cognitive radio; Energy harvesting; Wireless; Network packet; Battery (electricity); Mathematical optimization; Noma; Resource allocation; Spectral efficiency; Efficient energy use; Resource management (computing); Distributed computing; Computer network; Energy (signal processing); Power (physics); Telecommunications link; Engineering; Telecommunications; Electrical engineering; Artificial intelligence; Mathematics","score_opus":0.025881027198448255,"score_gpt":0.2515816174549294,"score_spread":0.22570059025648115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212556128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017749242,0.00068751676,0.9836769,0.0005773275,0.00018222722,0.00029313774,0.00002183838,0.0006910483,0.013692515],"genre_scores_gemma":[0.9084687,0.00079171907,0.086117215,0.00032850786,0.000029199746,0.0012566604,0.0005563053,0.00010457932,0.0023470677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827313,0.00026537164,0.00053326465,0.00030665295,0.00023525677,0.00038634494],"domain_scores_gemma":[0.9948813,0.0023326436,0.00010402014,0.0022415726,0.00029785922,0.00014264112],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002255216,0.00029115862,0.00024414159,0.00020277557,0.0013317977,0.00007601496,0.0008168525,0.00014264284,0.000053657157],"category_scores_gemma":[0.00003520751,0.00037088123,0.00019435312,0.0005555918,0.00022919441,0.0001388334,0.000030409614,0.00062016124,0.000015844413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016489326,0.0002321036,0.000005571561,0.00004272755,0.00021452086,0.0000023440396,0.00012135067,0.97225267,0.00023378863,0.003653991,0.00015800624,0.023066444],"study_design_scores_gemma":[0.0009499623,0.000051169176,0.000036171692,0.0003427654,0.00015907333,0.0000077657505,0.00034745067,0.9429303,0.004910819,0.000052209198,0.049856804,0.0003555044],"about_ca_topic_score_codex":0.000033006352,"about_ca_topic_score_gemma":0.000608528,"teacher_disagreement_score":0.9082913,"about_ca_system_score_codex":0.00020114062,"about_ca_system_score_gemma":0.00006028761,"threshold_uncertainty_score":0.99996835},"labels":[],"label_agreement":null},{"id":"W3215609878","doi":"10.1109//tcomm.2012.051012.100594","title":"Performance Analysis of Hop-by-Hop Beamforming for Dual-Hop MIMO AF Relay Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Relay; Beamforming; Moment-generating function; MIMO; Fading; Cumulative distribution function; Computer science; Bit error rate; Diversity gain; Array gain; Monte Carlo method; Probability density function; Electronic engineering; Control theory (sociology); Topology (electrical circuits); Algorithm; Telecommunications; Channel (broadcasting); Engineering; Mathematics; Antenna array; Statistics; Electrical engineering","score_opus":0.050222495464122385,"score_gpt":0.30027585539856294,"score_spread":0.25005335993444056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215609878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072539477,0.0015211455,0.9875236,0.0013849472,0.0003019044,0.00039740544,0.000041032876,0.00016032082,0.0014156748],"genre_scores_gemma":[0.9421089,0.0073061064,0.04941545,0.00025198332,0.00002549379,0.00029423714,0.000051096424,0.000021222604,0.0005254971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998212,0.00026943913,0.00061079295,0.0002641677,0.0002206401,0.00042299667],"domain_scores_gemma":[0.994577,0.0010619037,0.0002613546,0.0036334095,0.00030482613,0.00016151369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008137524,0.00022561439,0.00037446962,0.00047748932,0.001223021,0.00007589609,0.0021076258,0.00012244357,0.000043718523],"category_scores_gemma":[0.000017046406,0.00023454698,0.00032759443,0.0025364903,0.00017528012,0.0008765489,0.00005219972,0.0004558135,0.000014931588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009465564,0.0036384102,0.0012773366,0.00006385035,0.0031986444,1.8186108e-7,0.0114250695,0.53143966,0.007610806,0.022164876,0.0057395063,0.413347],"study_design_scores_gemma":[0.00037036347,0.00008677829,0.00043365936,0.000049261802,0.00038941164,0.000002606157,0.0001162412,0.9741441,0.002454912,0.000012280312,0.02163966,0.00030071568],"about_ca_topic_score_codex":0.000016476282,"about_ca_topic_score_gemma":0.00015008597,"teacher_disagreement_score":0.93810815,"about_ca_system_score_codex":0.00011346787,"about_ca_system_score_gemma":0.000056528435,"threshold_uncertainty_score":0.9564549},"labels":[],"label_agreement":null},{"id":"W3217279469","doi":"10.1109/tcomm.2021.3130198","title":"A POMDP-Based Antenna Selection for Massive MIMO Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Partially observable Markov decision process; Computer science; Channel state information; MIMO; Beamforming; Telecommunications link; Antenna (radio); Quantization (signal processing); Multi-user MIMO; Fading; Selection (genetic algorithm); Markov chain; Channel (broadcasting); Algorithm; Base station; Precoding; Mathematical optimization; Markov model; Mathematics; Computer network; Telecommunications; Machine learning; Wireless","score_opus":0.02405551029369564,"score_gpt":0.2661404194294252,"score_spread":0.24208490913572955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217279469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002689149,0.00057658297,0.9948965,0.0011104066,0.00026447707,0.00057297794,0.00012751122,0.0006665794,0.0015160517],"genre_scores_gemma":[0.85897005,0.00063959684,0.13871865,0.00010930294,0.000018264716,0.00087682065,0.00017553085,0.00007251826,0.00041925072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893755,0.00014428521,0.00038242034,0.00020401638,0.000106677355,0.00022502581],"domain_scores_gemma":[0.99726605,0.00048524368,0.000076313845,0.0016581542,0.00043945463,0.00007480448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012862262,0.00019399404,0.00020120737,0.00018535822,0.0006153095,0.000059017224,0.00044049713,0.00013776043,0.00005678764],"category_scores_gemma":[0.000022461056,0.00024309175,0.00014498211,0.00064976653,0.00007612318,0.00025970436,0.0000030225758,0.00033626962,0.000037433434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000194545,0.0002487599,0.0000081567005,0.00006231353,0.00009214707,2.421711e-7,0.00021948307,0.96705043,0.025705583,0.00080866413,0.0005014151,0.0052833715],"study_design_scores_gemma":[0.00075945485,0.000041867846,0.0000142370445,0.00011340967,0.00007504705,0.000008698632,0.00023042882,0.9392393,0.053218722,0.00037530746,0.0056509706,0.00027252926],"about_ca_topic_score_codex":0.000017859285,"about_ca_topic_score_gemma":0.0005606868,"teacher_disagreement_score":0.85870117,"about_ca_system_score_codex":0.00026372122,"about_ca_system_score_gemma":0.000094217634,"threshold_uncertainty_score":0.9912994},"labels":[],"label_agreement":null},{"id":"W4205439215","doi":"10.1109/tcomm.2022.3144986","title":"Joint Design of Hybrid Beamforming and Reflection Coefficients in RIS-Aided mmWave MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":131,"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":"National Natural Science Foundation of China; Canada Research Chairs","keywords":"Beamforming; MIMO; Relaxation (psychology); Telecommunications link; Computer science; Base station; Optimization problem; Mathematical optimization; Reduction (mathematics); Algorithm; Electronic engineering; Mathematics; Telecommunications; Engineering","score_opus":0.058585240517986116,"score_gpt":0.2675568819341841,"score_spread":0.20897164141619798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205439215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021279786,0.0010112578,0.9759942,0.00014146267,0.00018081113,0.0005209303,0.000060063987,0.00045380017,0.0003576509],"genre_scores_gemma":[0.98423135,0.0021865931,0.012816305,0.000008591562,0.0000017533539,0.00067006715,0.000010925157,0.000033158314,0.000041280036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988199,0.0002092605,0.000468097,0.00014439585,0.00016379468,0.00019455673],"domain_scores_gemma":[0.99797237,0.00031756598,0.0001006117,0.0015243825,0.00004992379,0.000035168938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035140934,0.00013947146,0.00022060193,0.0005358837,0.0004766139,0.00001659871,0.0006261318,0.000039921888,0.000011912644],"category_scores_gemma":[0.000014895006,0.00017385534,0.00004201526,0.000651689,0.00014344607,0.00014818653,0.000026048137,0.000656666,0.0000031538843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000987285,0.00014867118,0.0000060245234,0.00002281682,0.000023741883,3.9038167e-7,0.00031254906,0.97865754,0.01204029,0.00025643603,0.00002172633,0.008499954],"study_design_scores_gemma":[0.00053960946,0.00012392353,0.000052588228,0.000082069,0.000020478745,0.000039017603,0.0023436137,0.95398,0.04055847,0.00040753663,0.0016005422,0.0002521355],"about_ca_topic_score_codex":0.000077232835,"about_ca_topic_score_gemma":0.00003468054,"teacher_disagreement_score":0.9631779,"about_ca_system_score_codex":0.0003492503,"about_ca_system_score_gemma":0.000026895377,"threshold_uncertainty_score":0.7089615},"labels":[],"label_agreement":null},{"id":"W4205676769","doi":"10.1109/tcomm.2021.3137834","title":"Mobility-Aware Performance in Hybrid RF and Terahertz Wireless Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Terahertz radiation; Computer science; Electronic engineering; Radio frequency; Computer network; Electrical engineering; Telecommunications; Engineering; Materials science; Optoelectronics","score_opus":0.014121172441853487,"score_gpt":0.23152525699588367,"score_spread":0.21740408455403018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205676769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036839206,0.0006742183,0.9608045,0.00012383018,0.0002065329,0.00020762386,0.000021615338,0.0002223699,0.00090011006],"genre_scores_gemma":[0.99248916,0.004344206,0.0027651365,0.000027831513,0.0000104626115,0.00017010131,0.000023000335,0.000032287397,0.00013780451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992986,0.000060014907,0.00026531235,0.00015620608,0.000058030244,0.00016184007],"domain_scores_gemma":[0.9987105,0.00014084838,0.000022935776,0.0010114617,0.00006331557,0.000050923107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008139506,0.00012747539,0.00014981328,0.00009184849,0.00018658058,0.00002982646,0.00020671621,0.00006112364,0.000020526139],"category_scores_gemma":[0.0000020895332,0.00015573103,0.00003183473,0.00034085792,0.000060369617,0.00024448536,0.000004193477,0.00037475288,0.000009179002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032023434,0.000094810006,0.0001313591,0.000034587756,0.0000187709,0.0000012246254,0.00016272104,0.9719789,0.00027466557,0.000025131536,0.000014541591,0.027260084],"study_design_scores_gemma":[0.00027868652,0.000012303293,0.00039144544,0.00010693945,0.000013242316,0.000023149372,0.00013160626,0.99464196,0.0033857403,0.000019163432,0.0008327402,0.0001630278],"about_ca_topic_score_codex":0.000013812371,"about_ca_topic_score_gemma":0.0003271395,"teacher_disagreement_score":0.95803934,"about_ca_system_score_codex":0.00011034589,"about_ca_system_score_gemma":0.000020988817,"threshold_uncertainty_score":0.63505274},"labels":[],"label_agreement":null},{"id":"W4205901604","doi":"10.1109/tcomm.2014.03.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"","field":"","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science; Computer network","score_opus":0.04393415479868875,"score_gpt":0.30270536682158994,"score_spread":0.2587712120229012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205901604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076190536,0.00007770029,0.8481935,0.0065369876,0.00046936568,0.00051315356,0.00034614504,0.0014550147,0.13478903],"genre_scores_gemma":[0.9891102,0.00008236598,0.007867982,0.00019110503,0.000024204062,0.00020928665,0.00002494814,0.00008828048,0.0024016288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984662,0.00042786376,0.00032313453,0.00024441505,0.0002559159,0.0002825045],"domain_scores_gemma":[0.99465233,0.0005925089,0.00009317888,0.0043562516,0.00015056097,0.0001551542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037346786,0.00019124572,0.00018060723,0.0002702739,0.000999914,0.000077791134,0.0013986826,0.000090339614,0.00052842987],"category_scores_gemma":[0.00002122142,0.00020808898,0.00015303733,0.0006606838,0.00034489023,0.00022716529,0.00000477581,0.0005609656,0.006423803],"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.00045657626,0.025912903,0.00028911466,0.000108394845,0.0012290818,0.0000033755666,0.008608132,0.06276081,0.122274294,0.26689872,0.06700379,0.4444548],"study_design_scores_gemma":[0.0015312191,0.0003679969,0.00031231297,0.000071286486,0.0002233271,0.000024875744,0.00048008517,0.049000036,0.021799814,0.0030721915,0.9222866,0.0008302312],"about_ca_topic_score_codex":0.000160687,"about_ca_topic_score_gemma":0.0016547652,"teacher_disagreement_score":0.98149115,"about_ca_system_score_codex":0.00014052553,"about_ca_system_score_gemma":0.00005276662,"threshold_uncertainty_score":0.99434984},"labels":[],"label_agreement":null},{"id":"W4206110203","doi":"10.1109/tcomm.2021.3131622","title":"Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scrambling; Fading; Permutation (music); Computer science; Repetition (rhetorical device); Algorithm; Random access; Telecommunications; Electronic engineering; Mathematics; Computer network; Decoding methods; Physics; Engineering; Acoustics","score_opus":0.07834630463077291,"score_gpt":0.33405389797550694,"score_spread":0.25570759334473403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206110203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025183074,0.00049921783,0.9925085,0.0007337513,0.00035714396,0.0011191106,0.00009520473,0.00031913724,0.0018496641],"genre_scores_gemma":[0.99425936,0.00134332,0.002938293,0.00015166462,0.000075380885,0.0008141028,0.00018181039,0.000043633318,0.0001924528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990105,0.00012242846,0.0003053501,0.0002444069,0.00012850945,0.00018878166],"domain_scores_gemma":[0.997416,0.0003612187,0.00004116061,0.0019862868,0.00011331467,0.00008199106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000239575,0.00015324946,0.00017770033,0.00011731169,0.0006192865,0.0002472871,0.00070542196,0.000093768445,0.00018567505],"category_scores_gemma":[0.000012111914,0.00017625825,0.00004895251,0.00046154825,0.00007053044,0.0005714911,0.000021620268,0.00038091344,0.000017304214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003998995,0.00018822831,0.000045393506,0.00011923021,0.0002587674,0.000005556249,0.0012023185,0.95508313,0.0037114772,0.00029372392,0.0018844525,0.037167728],"study_design_scores_gemma":[0.0014572113,0.00001658669,0.00017794703,0.0002104774,0.00009790631,0.000041899228,0.00010086327,0.96931964,0.0053809737,0.00095360354,0.02188885,0.00035403235],"about_ca_topic_score_codex":0.000029964716,"about_ca_topic_score_gemma":0.00016319341,"teacher_disagreement_score":0.99174106,"about_ca_system_score_codex":0.0000425932,"about_ca_system_score_gemma":0.000033279943,"threshold_uncertainty_score":0.71876025},"labels":[],"label_agreement":null},{"id":"W4206658746","doi":"10.1109/tcomm.2022.3142159","title":"Non-Coherent Multi-Level Index Modulation","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Code word; Mathematics; Binary number; Discrete mathematics; Algorithm; Metric (unit); Notation; Code rate; Modulation (music); Decoding methods; Arithmetic","score_opus":0.06547698234084603,"score_gpt":0.2831065720946803,"score_spread":0.21762958975383428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206658746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035912683,0.00023109553,0.9919673,0.0005903707,0.00027527034,0.00040396443,0.00016563752,0.0014141499,0.001360934],"genre_scores_gemma":[0.9767295,0.00071781414,0.0205438,0.000052725147,0.0000046395285,0.0014862772,0.000041605177,0.000057961977,0.00036564918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990015,0.00007603294,0.00033246764,0.00016887335,0.000210827,0.00021028738],"domain_scores_gemma":[0.99675137,0.00014578708,0.00006289894,0.0029339883,0.000057166675,0.000048767335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113762726,0.00018151979,0.00016005544,0.00032691445,0.0010763621,0.000024758805,0.0015844351,0.00007310784,0.00017460261],"category_scores_gemma":[0.0000038192375,0.00022901157,0.000093614995,0.0006608353,0.00012488556,0.00018981477,0.000033328823,0.0009821515,0.00006269004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004497217,0.00023724501,0.000021756145,0.0000057196257,0.00003750053,2.0474505e-7,0.00022600411,0.9060745,0.0019334158,0.00024089616,0.00015686834,0.091061346],"study_design_scores_gemma":[0.00051145605,0.00003817177,0.0011627859,0.000011969914,0.000010883277,0.0000051112074,0.0006698037,0.9825812,0.0045451224,0.0004169241,0.009752288,0.00029428885],"about_ca_topic_score_codex":0.000028795876,"about_ca_topic_score_gemma":0.00015374465,"teacher_disagreement_score":0.9731383,"about_ca_system_score_codex":0.00036159254,"about_ca_system_score_gemma":0.000026475233,"threshold_uncertainty_score":0.93388206},"labels":[],"label_agreement":null},{"id":"W4206740046","doi":"10.1109/tcomm.2014.01.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"","field":"","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; Institut National de la Recherche Scientifique","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science; Engineering; Electrical engineering; Telecommunications","score_opus":0.04393415479868875,"score_gpt":0.30270536682158994,"score_spread":0.2587712120229012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206740046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076190536,0.00007770029,0.8481935,0.0065369876,0.00046936568,0.00051315356,0.00034614504,0.0014550147,0.13478903],"genre_scores_gemma":[0.9891102,0.00008236598,0.007867982,0.00019110503,0.000024204062,0.00020928665,0.00002494814,0.00008828048,0.0024016288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984662,0.00042786376,0.00032313453,0.00024441505,0.0002559159,0.0002825045],"domain_scores_gemma":[0.99465233,0.0005925089,0.00009317888,0.0043562516,0.00015056097,0.0001551542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037346786,0.00019124572,0.00018060723,0.0002702739,0.000999914,0.000077791134,0.0013986826,0.000090339614,0.00052842987],"category_scores_gemma":[0.00002122142,0.00020808898,0.00015303733,0.0006606838,0.00034489023,0.00022716529,0.00000477581,0.0005609656,0.006423803],"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.00045657626,0.025912903,0.00028911466,0.000108394845,0.0012290818,0.0000033755666,0.008608132,0.06276081,0.122274294,0.26689872,0.06700379,0.4444548],"study_design_scores_gemma":[0.0015312191,0.0003679969,0.00031231297,0.000071286486,0.0002233271,0.000024875744,0.00048008517,0.049000036,0.021799814,0.0030721915,0.9222866,0.0008302312],"about_ca_topic_score_codex":0.000160687,"about_ca_topic_score_gemma":0.0016547652,"teacher_disagreement_score":0.98149115,"about_ca_system_score_codex":0.00014052553,"about_ca_system_score_gemma":0.00005276662,"threshold_uncertainty_score":0.99434984},"labels":[],"label_agreement":null},{"id":"W4210790754","doi":"10.1109/tcomm.2022.3148261","title":"Uplink Outage Performance of NOMA-Based Hybrid Satellite-Terrestrial Relay Networks Over Generalized Inhomogeneous Fading Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Nanjing University of Posts and Telecommunications","keywords":"Telecommunications link; Single antenna interference cancellation; Decoding methods; Relay; Computer science; Fading; Noma; Communications satellite; Channel (broadcasting); Quality of service; Interference (communication); Satellite; Power (physics); Topology (electrical circuits); Computer network; Electronic engineering; Telecommunications; Electrical engineering; Engineering; Physics","score_opus":0.03603204741687708,"score_gpt":0.2505246991599449,"score_spread":0.21449265174306784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210790754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5886338,0.008158267,0.39392227,0.00035229264,0.0037774916,0.0016229415,0.00029787043,0.0012392695,0.0019958145],"genre_scores_gemma":[0.992651,0.0037184972,0.002418256,0.00007771705,0.000052861567,0.00066604523,0.00013687198,0.00010077453,0.00017801282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977875,0.00044580747,0.0008597682,0.00024584762,0.0003222832,0.00033883803],"domain_scores_gemma":[0.99576247,0.00051746785,0.00016838405,0.0033763687,0.00006656392,0.000108768065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049478444,0.00028864836,0.0003873923,0.00039810728,0.00084462593,0.000049156075,0.0017464445,0.00009339147,0.00021450716],"category_scores_gemma":[0.0000056417184,0.00035614418,0.00024491674,0.0007171697,0.00013965003,0.00015553234,0.000028738546,0.00090036524,0.00002691852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068512745,0.00018279804,0.00006671365,0.000025817566,0.000099280034,0.0000012551102,0.0003823992,0.9874613,0.0021021287,0.000026647404,0.000055292992,0.009527815],"study_design_scores_gemma":[0.001050822,0.000107234744,0.000067568064,0.000053315285,0.00005852203,0.000026097887,0.00006309173,0.9677201,0.010509833,0.0000069201496,0.019986058,0.00035043515],"about_ca_topic_score_codex":0.00008253205,"about_ca_topic_score_gemma":0.000032925203,"teacher_disagreement_score":0.40401718,"about_ca_system_score_codex":0.00032321483,"about_ca_system_score_gemma":0.00006685632,"threshold_uncertainty_score":0.9998891},"labels":[],"label_agreement":null},{"id":"W4211026530","doi":"10.1109/tcomm.2021.3075507","title":"IEEE Communications Society","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","field":"Engineering","cited_by":0,"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":"Chinese University of Hong Kong; National University of Singapore","keywords":"Computer science; Telecommunications; Electronic engineering; Electrical engineering; Engineering","score_opus":0.08469967876516518,"score_gpt":0.3152166116791916,"score_spread":0.23051693291402645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211026530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086207,0.00094872457,0.9198116,0.0051943082,0.0021603585,0.00044094367,0.00018896905,0.0020152072,0.060619205],"genre_scores_gemma":[0.9713884,0.0067458563,0.017148057,0.0004933623,0.000076457094,0.00024218393,0.00009558107,0.000059866026,0.0037502493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988859,0.00017903931,0.00034224865,0.00017407634,0.00021194694,0.00020678066],"domain_scores_gemma":[0.99582607,0.00022269842,0.00003581,0.0036113905,0.00019741137,0.0001065986],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019104601,0.00017325855,0.00015964784,0.0000837524,0.000838845,0.000077389384,0.00086216984,0.00013112738,0.0038830542],"category_scores_gemma":[0.0000049224845,0.00021305447,0.00023498907,0.0004557978,0.00021288516,0.00021512072,0.0000069591188,0.0006137213,0.004285212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016632464,0.0029808984,0.00004193537,0.00017879579,0.0011129561,0.0000031447664,0.013587822,0.33780652,0.18296714,0.0014296466,0.31195417,0.14792034],"study_design_scores_gemma":[0.00095725816,0.000041803436,0.0006068222,0.00009933039,0.00020283261,0.000031494797,0.0017149514,0.5870868,0.01979434,0.00064867066,0.38807195,0.0007437731],"about_ca_topic_score_codex":0.000002449257,"about_ca_topic_score_gemma":0.00031058802,"teacher_disagreement_score":0.96276766,"about_ca_system_score_codex":0.0002043861,"about_ca_system_score_gemma":0.000082453415,"threshold_uncertainty_score":0.9970275},"labels":[],"label_agreement":null},{"id":"W4214508141","doi":"10.1109/tcomm.2021.3069654","title":"IEEE Communications Society","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","field":"Engineering","cited_by":0,"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":"Chinese University of Hong Kong; National University of Singapore","keywords":"Computer science; Telecommunications; Electronic engineering; Electrical engineering; Engineering","score_opus":0.08469967876516518,"score_gpt":0.3152166116791916,"score_spread":0.23051693291402645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214508141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086207,0.00094872457,0.9198116,0.0051943082,0.0021603585,0.00044094367,0.00018896905,0.0020152072,0.060619205],"genre_scores_gemma":[0.9713884,0.0067458563,0.017148057,0.0004933623,0.000076457094,0.00024218393,0.00009558107,0.000059866026,0.0037502493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988859,0.00017903931,0.00034224865,0.00017407634,0.00021194694,0.00020678066],"domain_scores_gemma":[0.99582607,0.00022269842,0.00003581,0.0036113905,0.00019741137,0.0001065986],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019104601,0.00017325855,0.00015964784,0.0000837524,0.000838845,0.000077389384,0.00086216984,0.00013112738,0.0038830542],"category_scores_gemma":[0.0000049224845,0.00021305447,0.00023498907,0.0004557978,0.00021288516,0.00021512072,0.0000069591188,0.0006137213,0.004285212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016632464,0.0029808984,0.00004193537,0.00017879579,0.0011129561,0.0000031447664,0.013587822,0.33780652,0.18296714,0.0014296466,0.31195417,0.14792034],"study_design_scores_gemma":[0.00095725816,0.000041803436,0.0006068222,0.00009933039,0.00020283261,0.000031494797,0.0017149514,0.5870868,0.01979434,0.00064867066,0.38807195,0.0007437731],"about_ca_topic_score_codex":0.000002449257,"about_ca_topic_score_gemma":0.00031058802,"teacher_disagreement_score":0.96276766,"about_ca_system_score_codex":0.0002043861,"about_ca_system_score_gemma":0.000082453415,"threshold_uncertainty_score":0.9970275},"labels":[],"label_agreement":null},{"id":"W4214926958","doi":"10.1109/tcomm.2022.3156065","title":"Efficient Channel Estimation for Wideband Millimeter Wave Massive MIMO Systems With Beam Squint","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Queen's University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wideband; Computer science; Precoding; Cramér–Rao bound; Channel (broadcasting); Estimator; Subcarrier; MIMO; Algorithm; Bandwidth (computing); Electronic engineering; Estimation theory; Orthogonal frequency-division multiplexing; Telecommunications; Mathematics; Statistics; Engineering","score_opus":0.03915403437497746,"score_gpt":0.23971287613088954,"score_spread":0.20055884175591207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214926958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009273434,0.0003267832,0.9875219,0.00038522287,0.0004649399,0.0010366488,0.00028548506,0.00028858223,0.0004169908],"genre_scores_gemma":[0.98588955,0.000065180895,0.011161694,0.000067131514,0.000014548717,0.0024473073,0.00008468605,0.00005986844,0.00021001138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894464,0.00007804954,0.00033051052,0.00019880719,0.00022174316,0.00022624125],"domain_scores_gemma":[0.99858075,0.00022647029,0.00006762997,0.0009270918,0.000117781514,0.00008026547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002103785,0.0001856726,0.00018214057,0.0002525727,0.00095235795,0.00005444939,0.00030294407,0.000046722824,0.000042873045],"category_scores_gemma":[0.0000035930561,0.00018771892,0.00009973444,0.0002805266,0.00005232656,0.000058341153,0.0000061360133,0.0003348629,0.000013133963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026960186,0.00013629903,1.1231944e-7,0.000038314796,0.00008625509,3.3173245e-7,0.00091018324,0.9933267,0.003423675,0.000033512133,0.0001334447,0.00188419],"study_design_scores_gemma":[0.0005543945,0.00016935014,0.0000013204635,0.000039709146,0.00008967779,0.000016295739,0.00069110503,0.9833741,0.013914226,0.000048034963,0.0008739632,0.00022778945],"about_ca_topic_score_codex":0.000027747283,"about_ca_topic_score_gemma":0.000022440036,"teacher_disagreement_score":0.97661614,"about_ca_system_score_codex":0.00023894708,"about_ca_system_score_gemma":0.000033304954,"threshold_uncertainty_score":0.76549554},"labels":[],"label_agreement":null},{"id":"W4225486508","doi":"10.1109/tcomm.2022.3168280","title":"Sparse and Low-Rank Optimization for Pliable Index Coding via Alternating Projection","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Coding (social sciences); Computer science; Mathematical optimization; Greedy algorithm; Algorithm; Convergence (economics); Sparse matrix; Theoretical computer science; Mathematics","score_opus":0.05500643778611547,"score_gpt":0.29587582894695347,"score_spread":0.240869391160838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225486508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008690834,0.00019134374,0.9945165,0.002474973,0.000327503,0.00068818557,0.000017519778,0.00024212635,0.0006727479],"genre_scores_gemma":[0.92299163,0.001076672,0.07413572,0.00033979688,0.000017277353,0.0011018637,0.000018443374,0.00002036082,0.00029825934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986503,0.00031142886,0.0003220523,0.00031190287,0.00019602357,0.00020825885],"domain_scores_gemma":[0.99764276,0.0004479938,0.00014915782,0.0015308663,0.0001626057,0.00006659916],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005214225,0.00014669837,0.00014652715,0.00027020517,0.0033500933,0.00017092853,0.001355372,0.00003827533,0.00005511351],"category_scores_gemma":[0.000013079653,0.00017625756,0.00007076702,0.0007410699,0.00007174883,0.00047938057,0.000080023376,0.00043702187,0.0000033753893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032261745,0.0005238536,0.000032084703,0.000020561953,0.00006084019,3.32837e-7,0.0018698775,0.8314203,0.00173397,0.011091142,0.00022366719,0.15299113],"study_design_scores_gemma":[0.0005493973,0.00010224291,0.000023204499,0.000024321327,0.0000139355125,0.000015145943,0.00013295465,0.99450094,0.0007734973,0.00031206897,0.003366623,0.00018566416],"about_ca_topic_score_codex":0.00003197439,"about_ca_topic_score_gemma":0.000078054996,"teacher_disagreement_score":0.92212254,"about_ca_system_score_codex":0.00018082521,"about_ca_system_score_gemma":0.00007737656,"threshold_uncertainty_score":0.9979474},"labels":[],"label_agreement":null},{"id":"W4226303299","doi":"10.1109/tcomm.2022.3170615","title":"Fair and Energy-Efficient Coverage Optimization for UAV Placement Problem in the Cellular Network","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Simon Fraser University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Backhaul (telecommunications); Quality of service; Mathematical optimization; Base station; Optimization problem; Energy consumption; Cellular network; Efficient energy use; Real-time computing; Distributed computing; Computer network; Algorithm; Engineering","score_opus":0.012299090056973749,"score_gpt":0.20712894805253082,"score_spread":0.19482985799555708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226303299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062122016,0.00031447236,0.9958117,0.0007615674,0.000098783785,0.0005653056,0.00007839098,0.00010621959,0.001642348],"genre_scores_gemma":[0.96582913,0.00067961053,0.029108532,0.0001492894,0.000014750325,0.003954003,0.00013314144,0.000027908152,0.00010363115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992433,0.00010369286,0.00023586459,0.00013526983,0.00012452695,0.00015732356],"domain_scores_gemma":[0.9990078,0.0002128601,0.00003715641,0.0006887825,0.000029363833,0.000023995293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027528874,0.00010813284,0.000089048626,0.00010078014,0.00090256584,0.000044746717,0.00037457625,0.00003630416,0.00004515293],"category_scores_gemma":[8.7478406e-7,0.000108606335,0.00004154194,0.0005002364,0.000035443056,0.000050309303,0.000006847145,0.00021770765,0.0000011109013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077529785,0.00017551001,0.0000014316131,0.000007596485,0.00001390516,6.686213e-8,0.0004488381,0.99214166,0.00006345186,0.0038814028,0.0005203059,0.0027380604],"study_design_scores_gemma":[0.00033661298,0.000045464316,0.000005980313,0.0000064341893,0.000025135694,0.0000017772956,0.00027735368,0.9784291,0.00010636076,0.00023488994,0.020417172,0.000113758695],"about_ca_topic_score_codex":0.000025876136,"about_ca_topic_score_gemma":0.00008317648,"teacher_disagreement_score":0.9667032,"about_ca_system_score_codex":0.00012036425,"about_ca_system_score_gemma":0.000018253879,"threshold_uncertainty_score":0.6941898},"labels":[],"label_agreement":null},{"id":"W4230998896","doi":"10.1109/tcomm.2015.2432433","title":"IEEE Communications Society Information","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.14249385993036548,"score_gpt":0.26309510870931524,"score_spread":0.12060124877894976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230998896","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072447065,0.0010312798,0.28573343,0.0073975828,0.0032294483,0.0005279288,0.0017758154,0.00031912452,0.6992609],"genre_scores_gemma":[0.9489041,0.0026667102,0.01556652,0.0011902289,0.00003263488,0.0002526004,0.000067265624,0.00002294098,0.031297017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988973,0.000032238007,0.00060013,0.00019498881,0.00005295967,0.00022239552],"domain_scores_gemma":[0.99656546,0.0001189379,0.00024611293,0.0028104172,0.0001224213,0.00013662234],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062617095,0.00014409678,0.00024068593,0.00019055216,0.0007390862,0.0001417044,0.0013809506,0.00009043759,0.00046512103],"category_scores_gemma":[0.000018079756,0.0001776325,0.00020492311,0.0003862368,0.000393106,0.00090874167,0.000024060348,0.00030198626,0.021433767],"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.00003906229,0.0014602493,0.00036502327,0.00003045975,0.00069427275,2.2573184e-7,0.024625855,0.0076162885,0.000018946033,0.24167766,0.7109657,0.012506272],"study_design_scores_gemma":[0.0007473681,0.00004212173,0.00006756308,0.000012233863,0.00002247802,0.0000026926537,0.0031082206,0.029605124,0.00008237329,0.0049675796,0.9610443,0.00029794744],"about_ca_topic_score_codex":0.00026282895,"about_ca_topic_score_gemma":0.00007594304,"teacher_disagreement_score":0.9481796,"about_ca_system_score_codex":0.00023886548,"about_ca_system_score_gemma":0.00005455408,"threshold_uncertainty_score":0.97932816},"labels":[],"label_agreement":null},{"id":"W4231803097","doi":"10.1109/tcomm.2014.2340651","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network; Electronic engineering; Engineering","score_opus":0.06669348793432638,"score_gpt":0.23936717180943456,"score_spread":0.17267368387510817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231803097","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044755588,0.00027246794,0.4879538,0.0046558375,0.0017358748,0.0003186986,0.00080977345,0.00021803533,0.50358796],"genre_scores_gemma":[0.96500707,0.0022680887,0.0119407335,0.0012676062,0.00002917606,0.00018985341,0.00004507038,0.000018674118,0.019233737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988762,0.00004039057,0.00060570496,0.00020827937,0.00004234878,0.00022709154],"domain_scores_gemma":[0.9962971,0.00022387117,0.00025801707,0.0030673735,0.000072400784,0.000081198596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061871577,0.00014703257,0.0002507328,0.00018618218,0.0011371244,0.00013885098,0.0014038141,0.00009075443,0.0008455776],"category_scores_gemma":[0.000017227685,0.00018156705,0.00024119735,0.00032705202,0.00039521832,0.0007086372,0.0000206558,0.00030749143,0.018600179],"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.000024632307,0.0013476128,0.00033855377,0.000055586053,0.000684026,6.3391646e-8,0.011838599,0.0061667957,0.000058571346,0.66893756,0.27314308,0.037404887],"study_design_scores_gemma":[0.0004831044,0.00003376423,0.00015428138,0.000013506868,0.000020156283,0.0000013705783,0.000690317,0.06083519,0.000103726736,0.0046478943,0.93274504,0.00027165303],"about_ca_topic_score_codex":0.0001646318,"about_ca_topic_score_gemma":0.00006804636,"teacher_disagreement_score":0.9645595,"about_ca_system_score_codex":0.00013023401,"about_ca_system_score_gemma":0.000019217365,"threshold_uncertainty_score":0.98216397},"labels":[],"label_agreement":null},{"id":"W4233470818","doi":"10.1109/twc.2011.09.4416-tc1310-filler","title":"Call for papers","year":2013,"lang":"en","type":"paratext","venue":"IEEE Transactions on Communications","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":0,"is_retracted":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; Telecommunications; Engineering","score_opus":0.06486297646993994,"score_gpt":0.30716628557203274,"score_spread":0.2423033091020928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233470818","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028483187,0.00048006477,0.87417716,0.0042117466,0.00332349,0.0016103857,0.0006261708,0.00027609817,0.11529202],"genre_scores_gemma":[0.23770005,0.003589803,0.047818087,0.0019491656,0.00030665213,0.012187852,0.00041271973,0.00020883793,0.6958268],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757475,0.00036040795,0.00063360773,0.00067301723,0.00033243472,0.0004257922],"domain_scores_gemma":[0.9916624,0.0018188981,0.0003418573,0.0054994915,0.00048006506,0.00019728212],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025103524,0.00044479358,0.00054539397,0.00045262082,0.00093106186,0.00041973506,0.0044512837,0.00045330345,0.00076605164],"category_scores_gemma":[0.000013337652,0.00047800987,0.00050181564,0.0005182379,0.00016592075,0.00053686864,0.000026036332,0.0009411347,0.013729056],"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.0000135021455,0.0009052516,1.5744358e-7,0.00014579622,0.0004905642,5.2768286e-7,0.0007582464,0.0006763049,0.00075705873,0.0010886551,0.64680874,0.34835517],"study_design_scores_gemma":[0.00049579435,0.00012575352,0.0000024150636,0.00020111764,0.00006481124,0.000017817347,0.000041230964,0.011447618,0.0011084451,0.0001422332,0.9857586,0.0005941479],"about_ca_topic_score_codex":0.0003091454,"about_ca_topic_score_gemma":0.00044732928,"teacher_disagreement_score":0.8263591,"about_ca_system_score_codex":0.00026758405,"about_ca_system_score_gemma":0.00037840582,"threshold_uncertainty_score":0.9997672},"labels":[],"label_agreement":null},{"id":"W4234617096","doi":"10.1109/tcomm.2006.876882","title":"Spectral-Efficient Differential Space–Time Coding Using Non-Full-Diverse Constellations","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":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; Decoding methods; Algorithm; Space–time code; Constellation; Computer science; Coding (social sciences); Code (set theory); Antenna (radio); Differential (mechanical device); Transmit diversity; Theoretical computer science; Mathematics; Block code; Topology (electrical circuits); Telecommunications; Fading; Engineering; Beamforming","score_opus":0.03159270436252829,"score_gpt":0.28822678721589323,"score_spread":0.2566340828533649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234617096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005775592,0.000029242477,0.9888417,0.0006148428,0.00026909143,0.00044854017,0.00011200047,0.0006158658,0.0032931105],"genre_scores_gemma":[0.75436014,0.000045763783,0.24520075,0.00003314182,0.000025076863,0.000037872698,0.000019030576,0.00001903327,0.00025918183],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831903,0.00015755296,0.00043510043,0.00042740096,0.0003200409,0.00034085123],"domain_scores_gemma":[0.9961392,0.00033865703,0.0001828253,0.0030873572,0.00014459359,0.00010733973],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00012734749,0.0002502144,0.0002438021,0.00039192915,0.0013254051,0.00018287628,0.0019819362,0.00010112028,0.00013859387],"category_scores_gemma":[0.000004178143,0.00026755474,0.00016050515,0.0007490205,0.0002625953,0.00046097633,0.000058484035,0.00044420102,0.00015883174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030880256,0.00231776,0.000018768085,0.000017754102,0.00008518552,0.0000080214,0.00049866125,0.41023082,0.52891785,0.045364723,0.0021383918,0.010371191],"study_design_scores_gemma":[0.00037527617,0.000043002052,0.00007959722,0.000071630995,0.00004011696,0.000028133494,0.000037584603,0.9291696,0.06764302,0.00096478476,0.0012093873,0.00033786177],"about_ca_topic_score_codex":0.00012838653,"about_ca_topic_score_gemma":0.000037440397,"teacher_disagreement_score":0.74858457,"about_ca_system_score_codex":0.00022443144,"about_ca_system_score_gemma":0.000095227515,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W4234843542","doi":"10.1109/tcomm.2006.877972","title":"Applications of algebraic soft-decision decoding of Reed-Solomon codes","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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; McGill University","funders":"","keywords":"Decoding methods; Computer science; List decoding; Algorithm; Berlekamp–Welch algorithm; Computational complexity theory; Reed–Solomon error correction; Rayleigh fading; Fading; Sequential decoding; Concatenated error correction code; Electronic engineering; Theoretical computer science; Computer engineering; Block code; Engineering","score_opus":0.01607861547041342,"score_gpt":0.2638310748973232,"score_spread":0.2477524594269098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234843542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004296637,0.00025893957,0.9920653,0.0002948724,0.000081355356,0.00025041497,0.00004383114,0.00014075538,0.0025678943],"genre_scores_gemma":[0.8933409,0.0001551946,0.106290184,0.000026427686,0.000008076791,0.00011361372,0.00000616139,0.000009838714,0.00004963948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987471,0.00013421485,0.00051360304,0.00022914616,0.00021803445,0.0001579176],"domain_scores_gemma":[0.99588066,0.0010402238,0.00022057527,0.00262623,0.00018544636,0.000046883484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000359294,0.00012528726,0.0002109625,0.00041652282,0.00041970258,0.000032650827,0.0020113532,0.00007832492,0.000023778786],"category_scores_gemma":[0.000006815861,0.00013787189,0.00020278407,0.0012640242,0.00027495288,0.00025262946,0.000020915157,0.00021538786,0.000015580837],"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.00003105634,0.0014785419,0.00011884038,0.000031554213,0.00006479216,2.4018792e-7,0.00049065566,0.0034366501,0.015460976,0.5329793,0.00014579554,0.44576162],"study_design_scores_gemma":[0.0017135924,0.00062359823,0.0019003282,0.00044678035,0.0002340562,0.000035056542,0.00033451285,0.07266575,0.20720877,0.7018544,0.011996157,0.0009869926],"about_ca_topic_score_codex":0.00013465506,"about_ca_topic_score_gemma":0.00028449262,"teacher_disagreement_score":0.8890442,"about_ca_system_score_codex":0.000025825604,"about_ca_system_score_gemma":0.000049730384,"threshold_uncertainty_score":0.5622252},"labels":[],"label_agreement":null},{"id":"W4235436422","doi":"10.1109/tcomm.2013.011613.120145","title":"Efficient Parallel Search Algorithm for Determining Optimal R=1/2 Systematic Convolutional Self-Doubly Orthogonal Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"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":"Convolutional code; Algorithm; Computer science; Turbo code; Concatenated error correction code; Linear code; Codec; Mathematics; Block code; Decoding methods; Telecommunications","score_opus":0.02986627749641636,"score_gpt":0.2824168001553823,"score_spread":0.25255052265896594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235436422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00408136,0.0003552137,0.9912485,0.00021023897,0.00011749681,0.0019466217,0.00014505649,0.0015693891,0.0003261065],"genre_scores_gemma":[0.5662949,0.00021494378,0.4296603,0.000027635833,0.000010172624,0.0036522981,0.00003072664,0.000048810696,0.000060206567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983221,0.00017513431,0.0006338065,0.00022559808,0.0002701689,0.00037319126],"domain_scores_gemma":[0.99628943,0.0011698705,0.000087276014,0.001973319,0.00034140795,0.00013871587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002946638,0.00027288907,0.00035698852,0.00027128877,0.000745668,0.00008837063,0.0012053709,0.00013496613,0.000055998615],"category_scores_gemma":[0.000008919084,0.00029471362,0.00018383648,0.00032356757,0.00018827652,0.00018673307,0.000014949303,0.00051494455,0.00013519589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005827887,0.00053094764,0.0000033040994,0.00087031996,0.00027151615,3.2107246e-7,0.00074974314,0.97904795,0.0013355658,0.002476436,0.0001739826,0.014534078],"study_design_scores_gemma":[0.0004033731,0.00005780077,0.000032720753,0.00039665567,0.000061005016,0.000016911345,0.00019040809,0.9957926,0.002389757,0.00020184688,0.00015624435,0.00030062132],"about_ca_topic_score_codex":0.000017131822,"about_ca_topic_score_gemma":0.000015642374,"teacher_disagreement_score":0.56221354,"about_ca_system_score_codex":0.0002696411,"about_ca_system_score_gemma":0.00006858772,"threshold_uncertainty_score":0.9999505},"labels":[],"label_agreement":null},{"id":"W4238337071","doi":"10.1109/tcomm.2014.05.cover3","title":"Staff list","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"","field":"","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"Indian Institute of Technology Bombay; King's College London; Universitat Pompeu Fabra; Drexel University; Jackson State University; Arizona State University; George Washington University","keywords":"Computer science","score_opus":0.04393415479868875,"score_gpt":0.30270536682158994,"score_spread":0.2587712120229012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238337071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076190536,0.00007770029,0.8481935,0.0065369876,0.00046936568,0.00051315356,0.00034614504,0.0014550147,0.13478903],"genre_scores_gemma":[0.9891102,0.00008236598,0.007867982,0.00019110503,0.000024204062,0.00020928665,0.00002494814,0.00008828048,0.0024016288],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984662,0.00042786376,0.00032313453,0.00024441505,0.0002559159,0.0002825045],"domain_scores_gemma":[0.99465233,0.0005925089,0.00009317888,0.0043562516,0.00015056097,0.0001551542],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037346786,0.00019124572,0.00018060723,0.0002702739,0.000999914,0.000077791134,0.0013986826,0.000090339614,0.00052842987],"category_scores_gemma":[0.00002122142,0.00020808898,0.00015303733,0.0006606838,0.00034489023,0.00022716529,0.00000477581,0.0005609656,0.006423803],"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.00045657626,0.025912903,0.00028911466,0.000108394845,0.0012290818,0.0000033755666,0.008608132,0.06276081,0.122274294,0.26689872,0.06700379,0.4444548],"study_design_scores_gemma":[0.0015312191,0.0003679969,0.00031231297,0.000071286486,0.0002233271,0.000024875744,0.00048008517,0.049000036,0.021799814,0.0030721915,0.9222866,0.0008302312],"about_ca_topic_score_codex":0.000160687,"about_ca_topic_score_gemma":0.0016547652,"teacher_disagreement_score":0.98149115,"about_ca_system_score_codex":0.00014052553,"about_ca_system_score_gemma":0.00005276662,"threshold_uncertainty_score":0.99434984},"labels":[],"label_agreement":null},{"id":"W4242178054","doi":"10.1109/tcomm.2015.2513639","title":"IEEE Communications Society","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Telecommunications; Electrical engineering; Engineering; Electronic engineering; Computer network","score_opus":0.0792515733670414,"score_gpt":0.3074151961265445,"score_spread":0.22816362275950308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242178054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005837117,0.00017375071,0.9656726,0.0052698273,0.0011209565,0.0003976728,0.00014816181,0.0015639698,0.019815942],"genre_scores_gemma":[0.9843902,0.0049198577,0.0067812228,0.00022905144,0.00006777751,0.00029466892,0.000013606909,0.0000541248,0.0032494967],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989342,0.00013645079,0.00034069482,0.00016151978,0.00020354449,0.00022360616],"domain_scores_gemma":[0.9960115,0.00033768572,0.00004236754,0.0033858498,0.000111315436,0.000111298665],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023573377,0.00018113347,0.00014521698,0.00011852677,0.00069087493,0.00004080007,0.0011509274,0.00012581557,0.0033275115],"category_scores_gemma":[0.000004429454,0.00015908328,0.00020435272,0.00027425302,0.00033107234,0.00029067302,0.0000055060573,0.000332703,0.007867504],"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.00002552665,0.0014237611,0.000052992964,0.000071465074,0.0006594482,4.5763608e-7,0.005941799,0.027701573,0.27667528,0.0011599961,0.25735384,0.4289339],"study_design_scores_gemma":[0.0027794864,0.00016115625,0.0016316195,0.00034020073,0.0002851733,0.000021313228,0.0009072755,0.24800871,0.023457902,0.0018384248,0.71903205,0.0015367182],"about_ca_topic_score_codex":0.000002408796,"about_ca_topic_score_gemma":0.00016471774,"teacher_disagreement_score":0.97855306,"about_ca_system_score_codex":0.00026190467,"about_ca_system_score_gemma":0.0000377467,"threshold_uncertainty_score":0.99758357},"labels":[],"label_agreement":null},{"id":"W4243853725","doi":"10.1109/tcomm.2007.906433","title":"Precise Outage Analysis of Selection Diversity and Switched Diversity in Bandlimited Microcellular Systems With Cochannel Interference","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Independent and identically distributed random variables; Nakagami distribution; Rayleigh fading; Diversity combining; Electronic engineering; Interference (communication); Fading distribution; Computer science; Mathematics; Topology (electrical circuits); Telecommunications; Control theory (sociology); Random variable; Statistics; Engineering; Channel (broadcasting)","score_opus":0.034387275844938385,"score_gpt":0.24979258444161978,"score_spread":0.2154053085966814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243853725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35702816,0.00017318226,0.6422302,0.000015438998,0.000018219738,0.00018774053,0.000026487698,0.00016995282,0.00015061622],"genre_scores_gemma":[0.99459726,0.0011644196,0.004159396,0.000004919821,0.0000013591426,0.000022907083,0.000013319583,0.000013485113,0.000022941013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992141,0.000071954746,0.00029351734,0.00014933199,0.00012454014,0.0001465435],"domain_scores_gemma":[0.998529,0.00029432678,0.00008616589,0.00089791475,0.00013492472,0.000057645306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026475245,0.00014109486,0.00027122317,0.00079956703,0.00056925585,0.000011592207,0.0005695502,0.00009482849,0.000006311841],"category_scores_gemma":[0.000003758458,0.00015528417,0.000056514615,0.0014545823,0.00013950626,0.00019619724,0.00006380996,0.00036514853,8.193377e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035660595,0.0011670453,0.05632009,0.00020103432,0.0020488033,0.0000027615256,0.018868543,0.87038976,0.040208124,0.0004949442,0.000011875954,0.009930421],"study_design_scores_gemma":[0.0012398582,0.00021771458,0.048083402,0.0003244314,0.0011996278,0.000007963566,0.0030187503,0.8298712,0.1151841,0.000091647555,0.0000683449,0.0006930033],"about_ca_topic_score_codex":0.0006459231,"about_ca_topic_score_gemma":0.003811661,"teacher_disagreement_score":0.6380708,"about_ca_system_score_codex":0.00016971344,"about_ca_system_score_gemma":0.000007865417,"threshold_uncertainty_score":0.63323045},"labels":[],"label_agreement":null},{"id":"W4244152842","doi":"10.1109/tcomm.2014.2350266","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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":"Institut National de la Recherche Scientifique; University of Waterloo","funders":"","keywords":"Computer science; Telecommunications; Computer network; Electronic engineering; Electrical engineering; Engineering","score_opus":0.06669348793432638,"score_gpt":0.23936717180943456,"score_spread":0.17267368387510817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244152842","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044755588,0.00027246794,0.4879538,0.0046558375,0.0017358748,0.0003186986,0.00080977345,0.00021803533,0.50358796],"genre_scores_gemma":[0.96500707,0.0022680887,0.0119407335,0.0012676062,0.00002917606,0.00018985341,0.00004507038,0.000018674118,0.019233737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988762,0.00004039057,0.00060570496,0.00020827937,0.00004234878,0.00022709154],"domain_scores_gemma":[0.9962971,0.00022387117,0.00025801707,0.0030673735,0.000072400784,0.000081198596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061871577,0.00014703257,0.0002507328,0.00018618218,0.0011371244,0.00013885098,0.0014038141,0.00009075443,0.0008455776],"category_scores_gemma":[0.000017227685,0.00018156705,0.00024119735,0.00032705202,0.00039521832,0.0007086372,0.0000206558,0.00030749143,0.018600179],"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.000024632307,0.0013476128,0.00033855377,0.000055586053,0.000684026,6.3391646e-8,0.011838599,0.0061667957,0.000058571346,0.66893756,0.27314308,0.037404887],"study_design_scores_gemma":[0.0004831044,0.00003376423,0.00015428138,0.000013506868,0.000020156283,0.0000013705783,0.000690317,0.06083519,0.000103726736,0.0046478943,0.93274504,0.00027165303],"about_ca_topic_score_codex":0.0001646318,"about_ca_topic_score_gemma":0.00006804636,"teacher_disagreement_score":0.9645595,"about_ca_system_score_codex":0.00013023401,"about_ca_system_score_gemma":0.000019217365,"threshold_uncertainty_score":0.98216397},"labels":[],"label_agreement":null},{"id":"W4245340520","doi":"10.1109/tcomm.2007.902541","title":"Equalization for DS-UWB Systems---Part II: 4BOK Modulation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Ultra-Wideband Communications Technology","field":"Engineering","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":"MIMO; Computer science; Equalization (audio); Intersymbol interference; Electronic engineering; Transmission (telecommunications); Filter (signal processing); Bit error rate; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.03750000190879173,"score_gpt":0.27680409319304683,"score_spread":0.23930409128425512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245340520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00882915,0.00059505564,0.9825255,0.0007092668,0.0006802952,0.00090328424,0.00010800549,0.0014841085,0.0041652843],"genre_scores_gemma":[0.985741,0.0009093922,0.011608209,0.000054874625,0.000038233484,0.0007029848,0.00014733526,0.000074476586,0.0007234494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856883,0.00007262519,0.00064669386,0.00020606637,0.00016524551,0.00034055745],"domain_scores_gemma":[0.9959367,0.0007856468,0.000095048155,0.0028816625,0.00021584747,0.00008512132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048299792,0.00022453092,0.00022824187,0.00046993638,0.0010310934,0.000048372374,0.001039337,0.00025981516,0.000027395445],"category_scores_gemma":[0.000027485557,0.00026696414,0.00012561264,0.000722433,0.00013780114,0.00025993108,0.000007906397,0.00040737083,0.000054950946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000734495,0.0013035435,0.000050284816,0.00015933462,0.00046559115,5.32366e-7,0.0017257292,0.7528949,0.02795939,0.09590488,0.004726447,0.11473596],"study_design_scores_gemma":[0.001558242,0.0002831053,0.0002593955,0.00018914675,0.00022310049,0.000030627096,0.0008681818,0.6721795,0.039522827,0.002466072,0.2814342,0.0009855481],"about_ca_topic_score_codex":0.00003142954,"about_ca_topic_score_gemma":0.0003794981,"teacher_disagreement_score":0.9769119,"about_ca_system_score_codex":0.00025304494,"about_ca_system_score_gemma":0.000030774605,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W4245810436","doi":"10.1109/tcomm.2014.2329232","title":"IEEE Communications Society Information","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Telecommunications; Electronic engineering; Computer network; Electrical engineering; Engineering","score_opus":0.06669348793432638,"score_gpt":0.23936717180943456,"score_spread":0.17267368387510817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245810436","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044755588,0.00027246794,0.4879538,0.0046558375,0.0017358748,0.0003186986,0.00080977345,0.00021803533,0.50358796],"genre_scores_gemma":[0.96500707,0.0022680887,0.0119407335,0.0012676062,0.00002917606,0.00018985341,0.00004507038,0.000018674118,0.019233737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988762,0.00004039057,0.00060570496,0.00020827937,0.00004234878,0.00022709154],"domain_scores_gemma":[0.9962971,0.00022387117,0.00025801707,0.0030673735,0.000072400784,0.000081198596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061871577,0.00014703257,0.0002507328,0.00018618218,0.0011371244,0.00013885098,0.0014038141,0.00009075443,0.0008455776],"category_scores_gemma":[0.000017227685,0.00018156705,0.00024119735,0.00032705202,0.00039521832,0.0007086372,0.0000206558,0.00030749143,0.018600179],"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.000024632307,0.0013476128,0.00033855377,0.000055586053,0.000684026,6.3391646e-8,0.011838599,0.0061667957,0.000058571346,0.66893756,0.27314308,0.037404887],"study_design_scores_gemma":[0.0004831044,0.00003376423,0.00015428138,0.000013506868,0.000020156283,0.0000013705783,0.000690317,0.06083519,0.000103726736,0.0046478943,0.93274504,0.00027165303],"about_ca_topic_score_codex":0.0001646318,"about_ca_topic_score_gemma":0.00006804636,"teacher_disagreement_score":0.9645595,"about_ca_system_score_codex":0.00013023401,"about_ca_system_score_gemma":0.000019217365,"threshold_uncertainty_score":0.98216397},"labels":[],"label_agreement":null},{"id":"W4247032108","doi":"10.1109/tcomm.2019.2962931","title":"IEEE Communications Society","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human auditory perception and evaluation","field":"Engineering","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":"Khalifa University of Science, Technology and Research; Jinan University; Linköpings Universitet; Queen's University; Queen's University Belfast; Mitsubishi Electric Research Laboratories; Institut national de recherche en informatique et en automatique (INRIA); Queen Mary University of London; Hamad Bin Khalifa University; Purdue University","keywords":"Computer science; Telecommunications; Electronic engineering; Engineering; Electrical engineering","score_opus":0.11878727707518973,"score_gpt":0.30981089710015713,"score_spread":0.19102362002496742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247032108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004357407,0.00030350173,0.95261675,0.013665783,0.0008076749,0.00056084315,0.00014930555,0.0023125487,0.02522617],"genre_scores_gemma":[0.985298,0.0026903679,0.009833518,0.0013536811,0.00009866825,0.00020035864,0.000042607157,0.00005600651,0.00042681434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00012560554,0.00034125047,0.00016745232,0.00020462592,0.00019260406],"domain_scores_gemma":[0.9973188,0.00016370631,0.000040135827,0.002209395,0.000092514645,0.00017544859],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014069471,0.00018182685,0.00016206909,0.0000638556,0.00069525826,0.000060523627,0.0012145378,0.000115759234,0.0025097353],"category_scores_gemma":[0.0000046264763,0.00021451456,0.00021012027,0.00040967972,0.00022290167,0.00022815737,0.00000628499,0.00065320195,0.006663907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031123058,0.0010332199,0.000027099411,0.00016286943,0.00066118984,6.567381e-7,0.026494266,0.42059597,0.08409127,0.0005572752,0.37929565,0.0870494],"study_design_scores_gemma":[0.00049617793,0.00005637072,0.00014855374,0.000026459084,0.00008707433,0.0000026470043,0.0007046143,0.8073848,0.0025574882,0.00010296898,0.18806916,0.00036367113],"about_ca_topic_score_codex":0.0000022609781,"about_ca_topic_score_gemma":0.000063797044,"teacher_disagreement_score":0.9809406,"about_ca_system_score_codex":0.00012862285,"about_ca_system_score_gemma":0.000037814385,"threshold_uncertainty_score":0.9984021},"labels":[],"label_agreement":null},{"id":"W4250121933","doi":"10.1109/tcomm.2011.122110.090548","title":"Linear Precoding for Orthogonal Space-Time Block Coded MIMO-OFDM Cognitive Radio","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Precoding; MIMO; Transmitter; Orthogonal frequency-division multiplexing; Subcarrier; Cognitive radio; Transmitter power output; Rayleigh fading; Computer science; MIMO-OFDM; Convex optimization; Algorithm; Mathematics; Electronic engineering; Fading; Telecommunications; Beamforming; Wireless; Engineering; Regular polygon; Decoding methods; Channel (broadcasting)","score_opus":0.02480730036098968,"score_gpt":0.28760023525765516,"score_spread":0.2627929348966655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250121933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108890375,0.00014996668,0.9814443,0.0009727502,0.00028899868,0.0010555303,0.00047879113,0.0018194957,0.0029011602],"genre_scores_gemma":[0.8817245,0.0007243547,0.11567399,0.00004897201,0.000039289604,0.0011290712,0.00007850373,0.00009950441,0.00048185044],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988193,0.000081562255,0.0004203025,0.00022928703,0.00014687888,0.0003026546],"domain_scores_gemma":[0.99633586,0.0011196203,0.000087712506,0.0020744845,0.00025188105,0.00013041878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021359303,0.0002705879,0.0002730624,0.00025474204,0.00066849584,0.0000432838,0.0010608501,0.00020757841,0.00010591948],"category_scores_gemma":[0.000037378617,0.00032236986,0.0001883057,0.00035237876,0.00024752913,0.00027859787,0.000010403238,0.0010833279,0.0001225757],"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.00024437896,0.00220978,0.000030164118,0.0002166272,0.0010563533,0.0000015767441,0.003027521,0.13737266,0.6648375,0.008350799,0.0026398485,0.18001284],"study_design_scores_gemma":[0.001155258,0.00011691127,0.0000461736,0.00015985317,0.00016096677,0.000026218308,0.00014913043,0.6558151,0.31355718,0.0011336434,0.026924534,0.00075501634],"about_ca_topic_score_codex":0.00000896736,"about_ca_topic_score_gemma":0.00020621036,"teacher_disagreement_score":0.8708354,"about_ca_system_score_codex":0.00007633219,"about_ca_system_score_gemma":0.000051578172,"threshold_uncertainty_score":0.9999228},"labels":[],"label_agreement":null},{"id":"W4250310517","doi":"10.1109/tcomm.2009.5336832","title":"Policy allocation for transmission of embedded bit streams over noisy channels with feedback - [Transactions letters","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"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; Channel (broadcasting); Transmission (telecommunications); Rayleigh fading; Computer network; Automatic repeat request; Real-time computing; Fading; Bitstream; Algorithm; Hybrid automatic repeat request; Decoding methods; Telecommunications","score_opus":0.012811417657053988,"score_gpt":0.2546309348805072,"score_spread":0.2418195172234532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250310517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037783012,0.000094304785,0.9926859,0.0016553744,0.00012427529,0.00080352946,0.000098761426,0.00040115608,0.000358401],"genre_scores_gemma":[0.9260014,0.0011345611,0.07216879,0.00012924345,0.000038781884,0.00024451042,0.000079740465,0.00006827466,0.00013467752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987783,0.000050955146,0.0004415296,0.00022861599,0.00019853708,0.00030209724],"domain_scores_gemma":[0.9983119,0.00019074023,0.00009991333,0.0011429058,0.000138966,0.00011559492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007945156,0.00027785279,0.000273709,0.00039500013,0.00037022668,0.00003123315,0.000447446,0.00013140007,0.00003437482],"category_scores_gemma":[0.000001942489,0.0002897011,0.00014750063,0.00090811576,0.00012779026,0.0004085045,6.4201424e-7,0.0003047807,0.0000050881054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006466369,0.00024979952,4.2397767e-7,0.000026208138,0.000071029914,1.0006588e-7,0.00045989218,0.8765113,0.01974135,0.00023072085,0.000061831845,0.102582686],"study_design_scores_gemma":[0.0014773877,0.0002685364,0.000053720207,0.0002159727,0.00015178898,0.0000064663045,0.00013240858,0.92729163,0.068816975,0.00030908154,0.00084040576,0.0004356176],"about_ca_topic_score_codex":0.000030386213,"about_ca_topic_score_gemma":0.00007302106,"teacher_disagreement_score":0.9222231,"about_ca_system_score_codex":0.00016206136,"about_ca_system_score_gemma":0.00005672939,"threshold_uncertainty_score":0.99995553},"labels":[],"label_agreement":null},{"id":"W4285170208","doi":"10.1109/tcomm.2022.3176851","title":"Learning-Based User Clustering in NOMA-Aided MIMO Networks With Spatially Correlated Channels","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Ericsson (Canada); Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; MIMO; Spatial multiplexing; Computer science; Transmitter power output; Beamforming; Telecommunications link; Multi-user MIMO; Interference (communication); Noma; 3G MIMO; Channel (broadcasting); Algorithm; Computer network; Transmitter; Telecommunications; Artificial intelligence","score_opus":0.01612280484982464,"score_gpt":0.2266190071807459,"score_spread":0.21049620233092126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285170208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011077731,0.0002999142,0.9849471,0.00075462775,0.00021797842,0.00046614444,0.000017845334,0.0016809047,0.0005377539],"genre_scores_gemma":[0.9891172,0.0004713208,0.00882909,0.00006866577,0.0000045297793,0.0011993371,0.000049765404,0.00008764933,0.00017245386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986729,0.00023232776,0.0003901868,0.00021023466,0.0001868509,0.00030747376],"domain_scores_gemma":[0.99728,0.00043583757,0.00009019956,0.0020867267,0.000056218225,0.00005103946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017695397,0.00023311308,0.00023893084,0.0004582415,0.0008126288,0.000037593727,0.0013753612,0.00010502477,0.000110139066],"category_scores_gemma":[0.000007836349,0.00027392464,0.000068082736,0.0011835616,0.00015771242,0.00016590396,0.0000307504,0.0019730723,0.00001461315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003586392,0.00016959292,0.00007317567,0.0000076068086,0.000035115452,0.0000020977789,0.00025226548,0.9918796,0.00018736698,0.00003896944,0.000019130222,0.0072992574],"study_design_scores_gemma":[0.00079470256,0.00016175058,0.00013217956,0.00005223429,0.000016186652,0.000008261515,0.0004906258,0.9940343,0.00102077,0.000023893965,0.002960744,0.00030433363],"about_ca_topic_score_codex":0.00008523279,"about_ca_topic_score_gemma":0.0012625201,"teacher_disagreement_score":0.97803944,"about_ca_system_score_codex":0.00036286292,"about_ca_system_score_gemma":0.000044530036,"threshold_uncertainty_score":0.9999713},"labels":[],"label_agreement":null},{"id":"W4285181159","doi":"10.1109/tcomm.2022.3186997","title":"Robust Task Scheduling for Delay-Aware IoT Applications in Civil Aircraft-Augmented SAGIN","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Distributed computing; Transmission delay; Queuing delay; Optimization problem; Queueing theory; Real-time computing; Data transmission; Computer network; Mathematical optimization; Algorithm","score_opus":0.030315066493719796,"score_gpt":0.2542974678061702,"score_spread":0.2239824013124504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285181159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006077361,0.0004979992,0.9953318,0.0003551868,0.00023744721,0.0015163169,0.00042307636,0.0005730342,0.0004573908],"genre_scores_gemma":[0.9399865,0.00022830653,0.051015913,0.000051093226,0.000017731598,0.008197947,0.00023275542,0.00009135735,0.00017836413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986957,0.00010739074,0.0004929359,0.00026312657,0.00014880995,0.00029204102],"domain_scores_gemma":[0.9979697,0.00034980167,0.000073271025,0.0014446065,0.00008725472,0.00007538453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002134005,0.00021144365,0.00021804741,0.0004170781,0.0009733987,0.000035496556,0.00074208697,0.0000734935,0.00006998621],"category_scores_gemma":[0.0000050625886,0.00028067507,0.0001124246,0.0010039995,0.00005488195,0.00017916024,0.000011282548,0.0005869898,0.000015192837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008490638,0.00023308929,0.000011054455,0.000031726813,0.000039156574,2.15001e-7,0.0003669346,0.9954215,0.00077410333,0.0002519152,0.00008759831,0.0027741713],"study_design_scores_gemma":[0.00075289473,0.000042093925,0.000014615483,0.000036278183,0.000045325072,0.00000782102,0.0014522402,0.9856266,0.0006529165,0.00019328693,0.010861982,0.00031394837],"about_ca_topic_score_codex":0.000050600665,"about_ca_topic_score_gemma":0.0010109078,"teacher_disagreement_score":0.9443159,"about_ca_system_score_codex":0.00059134397,"about_ca_system_score_gemma":0.000056133315,"threshold_uncertainty_score":0.99996454},"labels":[],"label_agreement":null},{"id":"W4285244839","doi":"10.1109/tcomm.2022.3178752","title":"An Analysis of the Error Rate Performance for Uplink Asynchronous Signal Detection in Non-Orthogonal Multiple Access","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Asynchronous communication; Telecommunications link; Quadrature amplitude modulation; Single antenna interference cancellation; Multiuser detection; Iterative method; Algorithm; Detection theory; Computer science; Notation; Mathematics; Bit error rate; Detector; Arithmetic; Decoding methods; Telecommunications","score_opus":0.029364823971240947,"score_gpt":0.2896016232259396,"score_spread":0.2602367992546986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285244839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34946463,0.000047253347,0.649553,0.0001221825,0.00007972165,0.0003940979,0.00012759323,0.00017617988,0.000035358175],"genre_scores_gemma":[0.9946823,0.00024410665,0.0031471697,0.000021217575,0.000002647195,0.0018280711,0.000036267036,0.0000284892,0.000009724293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999037,0.00013182149,0.00038700248,0.00015457979,0.000121352576,0.00016823856],"domain_scores_gemma":[0.9971008,0.0004445403,0.00011256713,0.0022451596,0.00007220629,0.00002473226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002612336,0.00013407764,0.00021192156,0.0005701557,0.0007906026,0.000019275987,0.0021223454,0.0000617161,0.00003627205],"category_scores_gemma":[0.0000072258717,0.0001387612,0.00016013815,0.001728724,0.00014200999,0.00028916646,0.000030009736,0.0006040367,9.678374e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021895085,0.00020124827,0.000464254,0.00001139466,0.00011154439,2.3208042e-8,0.00020400784,0.95385253,0.009597509,0.00003249907,0.0000012523327,0.035501815],"study_design_scores_gemma":[0.00030236543,0.00006284045,0.013835415,0.000008327591,0.00009785015,6.818099e-7,0.00028779003,0.93318504,0.05190227,0.0000706411,0.00011395888,0.00013279704],"about_ca_topic_score_codex":0.000049190825,"about_ca_topic_score_gemma":0.00193346,"teacher_disagreement_score":0.6464058,"about_ca_system_score_codex":0.0002602476,"about_ca_system_score_gemma":0.000033763612,"threshold_uncertainty_score":0.60807556},"labels":[],"label_agreement":null},{"id":"W4285274232","doi":"10.1109/tcomm.2022.3171450","title":"Grant Free Age-Optimal Random Access Protocol for Satellite-Based Internet of Things","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","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 New Brunswick","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Random access; Computer science; Computer network; Throughput; Frame (networking); Markov chain; Protocol (science); Markov process; Transmission (telecommunications); Real-time computing; Distributed computing; Telecommunications; Wireless; Mathematics","score_opus":0.059858787999661,"score_gpt":0.3227953658612915,"score_spread":0.2629365778616305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285274232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014804008,0.0000048764664,0.9631397,0.002338789,0.000119595126,0.032319084,0.00004440159,0.0002058158,0.0018129186],"genre_scores_gemma":[0.15146442,0.000008068122,0.4888691,0.0008338826,0.0000071296436,0.35806873,0.000052873937,0.000028728045,0.00066705805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984542,0.0002238965,0.0005876695,0.00020476965,0.00035179156,0.00017768597],"domain_scores_gemma":[0.9963779,0.00056747126,0.00034060195,0.002422289,0.00023332721,0.000058431622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053610053,0.00015030874,0.00019466071,0.00035524854,0.00070756057,0.00016745785,0.004781474,0.000045757024,0.00014366063],"category_scores_gemma":[0.000022491591,0.00015872027,0.00018325432,0.00065309834,0.00012111188,0.0011867877,0.000073864685,0.00032522812,0.000006112504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065956183,0.0017292326,0.000008783831,0.00013775217,0.00010599058,0.0000011447022,0.0058630295,0.92373604,0.00027090916,0.015007199,0.0033213012,0.049159076],"study_design_scores_gemma":[0.004345191,0.00028625643,0.000014537434,0.00003715779,0.000019449883,0.000004844502,0.000085376145,0.95822567,0.010048821,0.00068164483,0.026039053,0.00021201972],"about_ca_topic_score_codex":0.00005989508,"about_ca_topic_score_gemma":0.00002105981,"teacher_disagreement_score":0.4742706,"about_ca_system_score_codex":0.00012527994,"about_ca_system_score_gemma":0.00016843113,"threshold_uncertainty_score":0.8885248},"labels":[],"label_agreement":null},{"id":"W4285282375","doi":"10.1109/tcomm.2022.3189072","title":"Spectrum Reconstruction via Deep Convolutional Neural Networks for Satellite Communication Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Data transmission; Spectrum (functional analysis); Satellite; Transmission (telecommunications); Artificial neural network; Artificial intelligence; Remote sensing; Algorithm; Telecommunications; Computer network; Engineering; Physics","score_opus":0.024181353669605263,"score_gpt":0.23487012382597253,"score_spread":0.21068877015636728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285282375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019881043,0.0029466203,0.9907119,0.00049340667,0.0010331289,0.0006668629,0.00007755477,0.0009899777,0.0010924077],"genre_scores_gemma":[0.99125,0.0013232116,0.006094568,0.00006435386,0.0000387711,0.0009942695,0.00010796991,0.00004987069,0.00007697877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888206,0.00021871817,0.0003568494,0.00016804911,0.00014459052,0.00022973727],"domain_scores_gemma":[0.99793845,0.00033982014,0.00008229279,0.0015040464,0.0000784776,0.00005691533],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00019749308,0.0001707871,0.00017879186,0.00019778368,0.0013741043,0.000057084202,0.00068855955,0.00007286026,0.00004680353],"category_scores_gemma":[0.000001876115,0.00021608928,0.00013383599,0.0003279947,0.00012676671,0.00015269397,0.00001158649,0.0006049066,0.0000057907405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022691247,0.000084844825,0.000010042219,0.000005089888,0.00007315224,1.8698357e-7,0.000093570234,0.97447675,0.00041925075,0.001609371,0.00028291764,0.022922117],"study_design_scores_gemma":[0.00024919695,0.00006544196,0.00005448444,0.000018368513,0.00005008346,0.0000893073,0.00017243675,0.98979783,0.000637542,0.00094127544,0.0077094226,0.00021463248],"about_ca_topic_score_codex":0.00006176325,"about_ca_topic_score_gemma":0.00014187422,"teacher_disagreement_score":0.9892619,"about_ca_system_score_codex":0.0002767194,"about_ca_system_score_gemma":0.000015972239,"threshold_uncertainty_score":0.999926},"labels":[],"label_agreement":null},{"id":"W4285291292","doi":"10.1109/tcomm.2022.3189398","title":"Multi-IRS-Assisted mmWave MIMO Communication Using Twin-Timescale Channel State Information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Channel state information; MIMO; Computer science; Precoding; Spectral efficiency; Channel (broadcasting); Overhead (engineering); Computational complexity theory; Base station; Algorithm; Electronic engineering; Wireless; Telecommunications; Engineering","score_opus":0.045724442038667004,"score_gpt":0.26985905295118423,"score_spread":0.22413461091251724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285291292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048108287,0.0010663216,0.98806715,0.00083009026,0.0002980736,0.00076268305,0.0004521612,0.002393736,0.001318965],"genre_scores_gemma":[0.92743915,0.0024785555,0.068629585,0.00013498274,0.0000034755221,0.0008922715,0.00018225207,0.00006865045,0.00017106507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980679,0.00034168916,0.00072590035,0.00018310019,0.000323054,0.00035831862],"domain_scores_gemma":[0.9945083,0.00037970956,0.0002125248,0.004635469,0.00017627588,0.00008766837],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00031513156,0.0003066305,0.00028401762,0.00063909416,0.002240058,0.00008619715,0.0025288668,0.00011267991,0.00014393743],"category_scores_gemma":[0.000016602347,0.00039344226,0.0001505952,0.0011587999,0.00029009322,0.0009776055,0.00009768676,0.0014349457,0.00009999165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016578051,0.0003411004,0.0000034789018,0.00002724861,0.00009350917,2.5716238e-7,0.001551416,0.9617389,0.004260687,0.00014098575,0.00027270298,0.031553164],"study_design_scores_gemma":[0.0009094767,0.000059303435,0.00015333094,0.0000475522,0.000045563364,0.00003053019,0.0028350141,0.96184355,0.010703948,0.0006186521,0.022200309,0.0005527584],"about_ca_topic_score_codex":0.000111100206,"about_ca_topic_score_gemma":0.00016774531,"teacher_disagreement_score":0.92262834,"about_ca_system_score_codex":0.0008099444,"about_ca_system_score_gemma":0.000070044254,"threshold_uncertainty_score":0.99985176},"labels":[],"label_agreement":null},{"id":"W4285292779","doi":"10.1109/tcomm.2022.3175915","title":"New Antenna Selection Schemes for Full-Duplex Cooperative MIMO-NOMA Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Shahrekord University","keywords":"Computer science; Relay; MIMO; Antenna (radio); Quality of service; Computer network; Interference (communication); Topology (electrical circuits); Electronic engineering; Telecommunications; Engineering; Electrical engineering; Channel (broadcasting); Power (physics)","score_opus":0.0332674395243072,"score_gpt":0.2705876941051294,"score_spread":0.2373202545808222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285292779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001812635,0.0017108637,0.99173605,0.0010006119,0.00041180482,0.0008867109,0.00022212342,0.001898935,0.00032025945],"genre_scores_gemma":[0.9554631,0.0012284094,0.039251484,0.000037364895,0.000018116378,0.0028779353,0.00006233571,0.00007230931,0.0009889477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882776,0.00012180315,0.000396305,0.00021724429,0.00017035236,0.00026655718],"domain_scores_gemma":[0.99743414,0.00043422883,0.00008322011,0.001828709,0.00014995021,0.0000697452],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00014063269,0.00022353191,0.0002371415,0.0003180655,0.0015913515,0.000060922426,0.0013659336,0.000089830544,0.00010203828],"category_scores_gemma":[0.000014393198,0.0002708813,0.000115191804,0.0008559995,0.000101706806,0.0002523317,0.00002111408,0.0007621135,0.000026686452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029803261,0.00014145285,0.0000025748943,0.000020664003,0.00012363389,1.2345946e-7,0.00027601686,0.9507708,0.020181473,0.0053583873,0.0017066863,0.021388413],"study_design_scores_gemma":[0.0006114417,0.0002078116,0.000007313283,0.000025843226,0.000036059613,0.000023970944,0.0017752314,0.85545516,0.0108197015,0.00015079297,0.1305305,0.0003561388],"about_ca_topic_score_codex":0.000051717372,"about_ca_topic_score_gemma":0.00015462318,"teacher_disagreement_score":0.9536505,"about_ca_system_score_codex":0.00040614887,"about_ca_system_score_gemma":0.000083866646,"threshold_uncertainty_score":0.9999743},"labels":[],"label_agreement":null},{"id":"W4285412026","doi":"10.1109/tcomm.2022.3190904","title":"Scheduling Versus Contention for Massive Random Access in Massive MIMO Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; MIMO; Scheduling (production processes); Random access; Distributed computing; Computer network; Electronic engineering; Telecommunications; Engineering; Mathematics; Mathematical optimization; Beamforming","score_opus":0.07794852188147287,"score_gpt":0.32419180367179923,"score_spread":0.24624328179032634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285412026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022498271,0.00059529947,0.98349947,0.00063554273,0.0021725586,0.008243553,0.00023804446,0.00027563082,0.0020900986],"genre_scores_gemma":[0.9604825,0.0001775642,0.0010929392,0.000022262588,0.000034228655,0.037965707,0.000046245892,0.000037955862,0.00014062168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990054,0.00017009054,0.00033195806,0.00014544753,0.00012881237,0.00021828894],"domain_scores_gemma":[0.9984089,0.0006720358,0.0000620952,0.00074664917,0.00006455616,0.00004573022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026657697,0.00013613605,0.00019792531,0.00020717987,0.0006502462,0.00009158042,0.00069607934,0.000062289066,0.000060802013],"category_scores_gemma":[0.000006101602,0.00016217532,0.000121911704,0.00039714586,0.000037522906,0.00019907628,0.000008747897,0.0005087198,0.000008226439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027552247,0.00009778682,0.000003799492,0.000035808607,0.00007197709,5.739766e-7,0.00017577207,0.9957337,0.00022599736,0.00062185945,0.00023942141,0.00251783],"study_design_scores_gemma":[0.0053819823,0.00011461765,0.00001743798,0.00007904154,0.000050447383,0.0000018746048,0.00079541124,0.97952,0.0004509163,0.00016964386,0.01318826,0.00023033543],"about_ca_topic_score_codex":0.00007981064,"about_ca_topic_score_gemma":0.00020268484,"teacher_disagreement_score":0.9824065,"about_ca_system_score_codex":0.00027828102,"about_ca_system_score_gemma":0.000036193003,"threshold_uncertainty_score":0.6613318},"labels":[],"label_agreement":null},{"id":"W4288064493","doi":"10.1109/tcomm.2022.3194018","title":"Superposition-Based URLLC Traffic Scheduling in 5G and Beyond Wireless Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund; Concordia University","keywords":"Computer science; Quality of service; Scheduling (production processes); Telecommunications link; Mobile broadband; Mathematical optimization; Network packet; Computer network; Multiplexing; Wireless; Mathematics; Telecommunications","score_opus":0.014778589685058324,"score_gpt":0.23351615323855734,"score_spread":0.21873756355349902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288064493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15721796,0.0024081345,0.8352554,0.0020703287,0.0002112209,0.0004974076,0.000082219405,0.0015297525,0.0007275771],"genre_scores_gemma":[0.98726225,0.0018925779,0.009629594,0.00012418193,0.0000041138574,0.0009781981,0.000039901992,0.00005211502,0.00001707117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892044,0.00015359986,0.0003442505,0.00019150754,0.00014568484,0.00024451985],"domain_scores_gemma":[0.997614,0.00051461405,0.000041921317,0.0017451032,0.00003236012,0.000051949115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017256722,0.00018451632,0.00019538117,0.00042212807,0.0008597171,0.000034656456,0.0009828189,0.000090864494,0.0000514829],"category_scores_gemma":[0.0000038767876,0.00024294146,0.00006110307,0.00085245824,0.0002107544,0.00016677286,0.000015804017,0.001232468,0.0000052084747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000800961,0.00017056469,0.000013671464,0.00000811669,0.000016751163,6.967611e-7,0.00019658841,0.9486237,0.0006782997,0.00060215057,0.000013902806,0.049667556],"study_design_scores_gemma":[0.00045965024,0.000043534103,0.00008251091,0.000024453046,0.000012404081,0.0000065899667,0.0009387014,0.995737,0.0015981228,0.0001597725,0.0006935743,0.00024368482],"about_ca_topic_score_codex":0.000018817176,"about_ca_topic_score_gemma":0.00029821647,"teacher_disagreement_score":0.83004427,"about_ca_system_score_codex":0.00025731281,"about_ca_system_score_gemma":0.000032409713,"threshold_uncertainty_score":0.99068654},"labels":[],"label_agreement":null},{"id":"W4288064661","doi":"10.1109/tcomm.2022.3194134","title":"Fine-Grained Analysis of Reconfigurable Intelligent Surface-Assisted mmWave Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":20,"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 Key Research and Development Program of China; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Key Technology Research and Development Program of Shandong; Department for the Economy","keywords":"Stochastic geometry; Non-line-of-sight propagation; Path loss; Beamforming; Computer science; Base station; Coverage probability; Enhanced Data Rates for GSM Evolution; Scalability; Electronic engineering; Cellular network; Extremely high frequency; Midpoint; Topology (electrical circuits); Spectral efficiency; Computer network; Telecommunications; Wireless; Engineering; Mathematics; Electrical engineering; Geometry","score_opus":0.037606325234539294,"score_gpt":0.2638831526853431,"score_spread":0.22627682745080382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288064661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008008006,0.001398395,0.98476815,0.000657635,0.00020287436,0.00032268767,0.00026437067,0.0010377875,0.003340099],"genre_scores_gemma":[0.98936737,0.002613122,0.007254058,0.00002312013,0.0000018360379,0.00030573085,0.00011749996,0.000039420844,0.00027784417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986652,0.00018852741,0.0005634499,0.00017601422,0.00018762096,0.00021918127],"domain_scores_gemma":[0.99560475,0.0006341479,0.00013379693,0.003476195,0.00010199915,0.000049135073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022514821,0.00018400894,0.00036475202,0.0006142958,0.0006245976,0.00001685427,0.0016593959,0.00008124339,0.0005163957],"category_scores_gemma":[0.000009498038,0.0002248577,0.00026125627,0.0031778726,0.00018257175,0.00009847369,0.000020665226,0.0008421069,0.000008747817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009368231,0.00020538567,0.000015011991,0.000005403272,0.00071238325,2.116675e-7,0.00018135467,0.9599952,0.0018342915,0.00060835766,0.00013701916,0.03629602],"study_design_scores_gemma":[0.00019119184,0.000060040165,0.00020448194,0.000012600986,0.00034043417,0.0000027396954,0.0008209403,0.9793851,0.011694261,0.00020185752,0.0068240864,0.0002622803],"about_ca_topic_score_codex":0.00006311959,"about_ca_topic_score_gemma":0.0006411374,"teacher_disagreement_score":0.98135936,"about_ca_system_score_codex":0.00025876073,"about_ca_system_score_gemma":0.000025637533,"threshold_uncertainty_score":0.9169431},"labels":[],"label_agreement":null},{"id":"W4291805098","doi":"10.1109/tcomm.2022.3199018","title":"Learning-Based Resource Allocation for Ultra-Reliable V2X Networks With Partial CSI","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; Shaanxi Province Postdoctoral Science Foundation; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Throughput; Reliability (semiconductor); Probabilistic logic; Constraint (computer-aided design); Mathematical optimization; Resource management (computing); Artificial neural network; Transformation (genetics); Signal-to-noise ratio (imaging); Distributed computing; Power (physics); Computer network; Artificial intelligence; Engineering; Mathematics; Wireless","score_opus":0.012999795496169734,"score_gpt":0.21804364489659991,"score_spread":0.2050438494004302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291805098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020665422,0.00027519168,0.9936812,0.0009950581,0.00021210992,0.00075269624,0.00004640959,0.0007847699,0.0011860485],"genre_scores_gemma":[0.9919282,0.00009243745,0.0047100154,0.00017854075,0.000044027656,0.0021979099,0.00024332035,0.00010514687,0.00050040067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986951,0.00017767155,0.0002888212,0.00022927945,0.00023077893,0.0003783602],"domain_scores_gemma":[0.9980071,0.00042437276,0.00006523772,0.0013270605,0.000070914924,0.00010526945],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033514685,0.00020773837,0.00018583234,0.00013934237,0.0014650817,0.0000545135,0.0006654936,0.000080068225,0.00010851694],"category_scores_gemma":[0.0000042337597,0.00023820855,0.00012082171,0.00057453883,0.00009103394,0.000101576115,0.0000036187423,0.000993012,0.000013075368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724089,0.00017296195,0.000009071675,0.000012112747,0.00008004554,4.821012e-7,0.00015098686,0.9950727,0.00019191121,0.00007288587,0.0015658936,0.0026036634],"study_design_scores_gemma":[0.00063455134,0.00024317524,0.000008087355,0.000020419442,0.00008494123,0.000007076837,0.00015490879,0.8294376,0.0011345281,0.000010767634,0.16803555,0.00022839167],"about_ca_topic_score_codex":0.000031127856,"about_ca_topic_score_gemma":0.00020493273,"teacher_disagreement_score":0.98986167,"about_ca_system_score_codex":0.00024881007,"about_ca_system_score_gemma":0.000065461536,"threshold_uncertainty_score":0.9998349},"labels":[],"label_agreement":null},{"id":"W4293255001","doi":"10.1109/tcomm.2022.3161021","title":"UAV-Assisted Edge Caching Under Uncertain Demand: A Data-Driven Distributionally Robust Joint Strategy","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Western University","funders":"China Postdoctoral Science Foundation","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Robust optimization; Latency (audio); Mathematical optimization","score_opus":0.09997441899558798,"score_gpt":0.28153602154583934,"score_spread":0.18156160255025136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293255001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015086137,0.00024913187,0.99168926,0.0011811194,0.0001817196,0.000406658,0.0019321908,0.00050310075,0.0023482],"genre_scores_gemma":[0.9852282,0.00035140745,0.01104569,0.00008798841,0.000022194426,0.00063943875,0.0023195294,0.000049717928,0.000255853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986148,0.00018077472,0.0004186753,0.00028913852,0.00025249113,0.00024412126],"domain_scores_gemma":[0.9970162,0.00016927489,0.00007290295,0.0025644035,0.00007980341,0.0000974371],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00026276955,0.00019654479,0.00017996867,0.00018259395,0.0016710438,0.00008554372,0.0012607536,0.00006639827,0.00039472728],"category_scores_gemma":[0.000003537887,0.00023395252,0.00008456128,0.0006905579,0.00008748664,0.00026369758,0.000035971992,0.0006997637,0.000040846193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051267366,0.00029342013,0.0000025518696,0.000008645968,0.00008804983,4.7466227e-7,0.00010113468,0.9928858,0.0005028215,0.0018095314,0.0013215841,0.002980807],"study_design_scores_gemma":[0.0003514735,0.0000345877,0.00046752996,0.00001253883,0.00009014603,0.000022948696,0.00044813167,0.99079645,0.00009534512,0.00024486508,0.0071662473,0.00026973948],"about_ca_topic_score_codex":0.00017139377,"about_ca_topic_score_gemma":0.00056971156,"teacher_disagreement_score":0.9837196,"about_ca_system_score_codex":0.00044345536,"about_ca_system_score_gemma":0.000119075616,"threshold_uncertainty_score":0.99962866},"labels":[],"label_agreement":null},{"id":"W4294811270","doi":"10.1109/tcomm.2022.3204846","title":"Delay-Aware and Energy-Efficient Carrier Aggregation in 5G Using Double Deep Q-Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Calgary; Ericsson (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overhead (engineering); Quality of service; Energy consumption; User equipment; Scheme (mathematics); Distributed computing; Computer network; Mathematical optimization; Real-time computing; Base station; Engineering; Mathematics","score_opus":0.020509438444781973,"score_gpt":0.2438146212081365,"score_spread":0.2233051827633545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043170457,0.0012432821,0.99300086,0.00005688481,0.00038700856,0.00015997606,0.000036776666,0.0001909606,0.00060721516],"genre_scores_gemma":[0.9948987,0.00054702273,0.004025704,0.000026008076,0.000010063615,0.00029786126,0.000035441888,0.000044914992,0.000114278984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914086,0.00011281952,0.00029068973,0.0001654608,0.00011275828,0.00017744179],"domain_scores_gemma":[0.99897337,0.00009767532,0.000047027464,0.0007757711,0.00005233152,0.00005383793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001117027,0.00013281348,0.00013291951,0.00022424619,0.00059880706,0.000025602094,0.00022918967,0.00006038814,0.000036660196],"category_scores_gemma":[0.0000012074037,0.00017686542,0.000039035174,0.0006496775,0.000044917244,0.00012179795,0.000007817465,0.000368831,0.0000013378541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092405535,0.00006754002,0.000008459976,0.0000065637346,0.000016583039,0.0000011984247,0.00038332408,0.99150527,0.00016446375,0.0002471608,0.000007390095,0.0075827893],"study_design_scores_gemma":[0.00047248846,0.000012278248,0.0000084675185,0.000021461574,0.000022561158,0.000031493902,0.00041366302,0.9971485,0.0005453992,0.000043026997,0.0011168651,0.00016376255],"about_ca_topic_score_codex":0.00017979431,"about_ca_topic_score_gemma":0.0011673035,"teacher_disagreement_score":0.99058163,"about_ca_system_score_codex":0.00041043048,"about_ca_system_score_gemma":0.000029550893,"threshold_uncertainty_score":0.7212363},"labels":[],"label_agreement":null},{"id":"W4298335015","doi":"10.1109/tcomm.2022.3196648","title":"Adaptive Physical Layer Authentication Using Machine Learning With Antenna Diversity","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","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 Victoria","funders":"","keywords":"Computer science; Physical layer; Computer network; Wireless; Support vector machine; Antenna diversity; Real-time computing; Electronic engineering; Artificial intelligence; Engineering; Telecommunications","score_opus":0.09099514232114575,"score_gpt":0.27726405819970656,"score_spread":0.18626891587856081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298335015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030107208,0.000030051815,0.9674264,0.0015571123,0.00009698398,0.00027263956,0.000027924905,0.00027853207,0.00020314871],"genre_scores_gemma":[0.9771367,0.000011844493,0.022406006,0.00007887926,0.00001042901,0.00010890047,0.000014029749,0.000017284952,0.00021593248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983286,0.00049514463,0.00018641437,0.00034202452,0.00046245236,0.00018535659],"domain_scores_gemma":[0.99784756,0.000270082,0.00017570062,0.0014752098,0.00015587933,0.00007559017],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00022100992,0.00014822517,0.00014109667,0.00024015825,0.0037699833,0.00006737541,0.001509593,0.00002818942,0.000035260236],"category_scores_gemma":[0.0000039513316,0.0001565129,0.00008332833,0.00095144956,0.0001231775,0.000504652,0.00009893347,0.00065962755,0.000025296153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017479794,0.003656473,0.0009531327,0.000012476277,0.0002711774,0.0000051106713,0.015047775,0.8581646,0.048035957,0.0494527,0.000021073809,0.024204697],"study_design_scores_gemma":[0.0003102458,0.00017936101,0.0007735864,0.000009089672,0.000042093314,0.000015807724,0.00024772674,0.99591744,0.0013447795,0.000749672,0.00022541985,0.00018479834],"about_ca_topic_score_codex":0.00019327922,"about_ca_topic_score_gemma":0.00007115326,"teacher_disagreement_score":0.9470295,"about_ca_system_score_codex":0.00031452396,"about_ca_system_score_gemma":0.00008698623,"threshold_uncertainty_score":0.99752694},"labels":[],"label_agreement":null},{"id":"W4309757106","doi":"10.1109/tcomm.2022.3211101","title":"Decoding Reed-Muller Codes With Successive Codeword Permutations","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"McGill University","funders":"","keywords":"Code word; Decoding methods; Permutation (music); Algorithm; List decoding; Error detection and correction; Hadamard transform; Computational complexity theory; Computer science; Sequential decoding; Mathematics; Discrete mathematics; Arithmetic; Block code; Concatenated error correction code","score_opus":0.03302514777196357,"score_gpt":0.2903340931662864,"score_spread":0.2573089453943228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309757106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002020927,0.00008077755,0.98503,0.0060624774,0.00026228407,0.00040012284,0.000049255617,0.0012217768,0.004872375],"genre_scores_gemma":[0.8726299,0.00006119256,0.12528113,0.00039991844,0.000007506599,0.0009439672,0.000010214503,0.00002957247,0.00063662365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998127,0.00042602632,0.00032290246,0.0004113442,0.00042045096,0.00029227277],"domain_scores_gemma":[0.9954909,0.0010201,0.00017751835,0.0030113943,0.00020188814,0.000098214194],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003652791,0.0002038879,0.00019342525,0.00041426957,0.0032576423,0.00015974685,0.0032192396,0.000045786663,0.0001074934],"category_scores_gemma":[0.000016153284,0.00021502521,0.000106309606,0.0013987541,0.00017091227,0.0004979598,0.00006369162,0.0009373993,0.00003131869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027797767,0.0073137325,0.00082857336,0.000073681076,0.00091701216,0.00008436903,0.043882567,0.41802877,0.009768658,0.30379108,0.0081645595,0.20686902],"study_design_scores_gemma":[0.0017051231,0.0015747907,0.0004148209,0.00019169365,0.00022058561,0.00050684763,0.0048450194,0.9332067,0.019114029,0.008362643,0.027948774,0.0019089711],"about_ca_topic_score_codex":0.00022643193,"about_ca_topic_score_gemma":0.0010552647,"teacher_disagreement_score":0.870609,"about_ca_system_score_codex":0.0002913418,"about_ca_system_score_gemma":0.00020807738,"threshold_uncertainty_score":0.99803996},"labels":[],"label_agreement":null},{"id":"W4312040304","doi":"10.1109/tcomm.2022.3217574","title":"Age of Information With Hybrid-ARQ: A Unified Explicit Result","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","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 Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hybrid automatic repeat request; Computer science; Automatic repeat request; Decoding methods; Robustness (evolution); Minification; Real-time computing; Coding (social sciences); Algorithm; Computer network; Mathematics; Telecommunications link","score_opus":0.021544466944623218,"score_gpt":0.2362473509092995,"score_spread":0.21470288396467627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312040304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006947953,0.000010599747,0.9867591,0.0020556424,0.00010909581,0.00036430694,0.00007367648,0.00022325349,0.009709516],"genre_scores_gemma":[0.89392644,0.000054539443,0.10497488,0.00038887592,0.0000025752147,0.00029910725,0.00010197855,0.000008481148,0.00024310994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986329,0.00016486425,0.0004958013,0.0001195812,0.00043652445,0.00015029847],"domain_scores_gemma":[0.9970426,0.00017854497,0.0003043928,0.0021940877,0.00022154646,0.000058840327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030734576,0.0001235233,0.00013755799,0.00044675783,0.0008937706,0.00009038739,0.0019246417,0.000025523057,0.00006404223],"category_scores_gemma":[0.000008437504,0.00012808465,0.000063275496,0.0010588098,0.00007821141,0.0018451769,0.000035242407,0.00035358628,0.000034091343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009226577,0.0005171524,0.0000047496806,0.000023118339,0.0000758099,0.0000019351733,0.00828189,0.8889325,0.00027795893,0.070424534,0.00084786315,0.030520184],"study_design_scores_gemma":[0.0024482852,0.000843502,0.00020504373,0.000056906847,0.000054422697,0.00011137488,0.0025768904,0.93121076,0.010345625,0.0014103012,0.050092433,0.0006444562],"about_ca_topic_score_codex":0.00007650942,"about_ca_topic_score_gemma":0.000028836206,"teacher_disagreement_score":0.89323163,"about_ca_system_score_codex":0.00013790565,"about_ca_system_score_gemma":0.00015007996,"threshold_uncertainty_score":0.68742514},"labels":[],"label_agreement":null},{"id":"W4312050867","doi":"10.1109/tcomm.2022.3218822","title":"On Distributed Lossy Coding of Symmetrically Correlated Gaussian Sources","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"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); McMaster University","funders":"","keywords":"Upper and lower bounds; Encoder; Lossy compression; Gaussian; Mathematics; Distortion (music); Algorithm; Discrete mathematics; Cramér–Rao bound; Combinatorics; Computer science; Mathematical analysis; Statistics; Telecommunications; Physics","score_opus":0.0212321375510016,"score_gpt":0.2501063285394391,"score_spread":0.2288741909884375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312050867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030216778,0.0006749893,0.95072716,0.0018130374,0.0004093114,0.0007576395,0.0013954516,0.0023548426,0.011650757],"genre_scores_gemma":[0.9963146,0.00079934625,0.0022378599,0.00006479645,0.0000040374093,0.0003458728,0.00011437976,0.000049692484,0.00006942904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985374,0.00028501658,0.0004966593,0.00015794003,0.0003203231,0.00020263504],"domain_scores_gemma":[0.99635184,0.00087310205,0.00011263486,0.0024977042,0.00008522258,0.00007950264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025432685,0.00018385057,0.00024756367,0.00053016696,0.0007823692,0.00002779502,0.001644268,0.00008479793,0.0002531866],"category_scores_gemma":[0.000017477962,0.00022282962,0.00014418093,0.0014579193,0.00016296726,0.00009655586,0.000025636164,0.0011284127,0.000025362417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117724114,0.0031950881,0.00007199137,0.000099103105,0.00053708104,0.0000033933495,0.0029886186,0.8947452,0.009174565,0.05473049,0.005348738,0.028988047],"study_design_scores_gemma":[0.0022023262,0.0010287253,0.0009301508,0.00036960817,0.00029162105,0.000057665075,0.0021584602,0.8414284,0.090417705,0.005039375,0.05442802,0.0016479164],"about_ca_topic_score_codex":0.00005589534,"about_ca_topic_score_gemma":0.000035187648,"teacher_disagreement_score":0.96609783,"about_ca_system_score_codex":0.00028165587,"about_ca_system_score_gemma":0.000034952907,"threshold_uncertainty_score":0.9086728},"labels":[],"label_agreement":null},{"id":"W4312050976","doi":"10.1109/tcomm.2022.3220319","title":"RIS-Aided Mobile Localization Error Bounds Under Hardware Impairments","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Lakehead University","funders":"","keywords":"Transceiver; Cramér–Rao bound; Estimator; Position (finance); Computer science; Interference (communication); Mean squared error; Algorithm; Computer hardware; Mathematics; Telecommunications; Statistics; Estimation theory; Wireless","score_opus":0.028594535705980476,"score_gpt":0.27934001001857856,"score_spread":0.2507454743125981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312050976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004030246,0.00089518615,0.98882335,0.00073853607,0.00036295183,0.0006006237,0.00022078397,0.0026411926,0.0016871524],"genre_scores_gemma":[0.9895976,0.0014529007,0.0053317035,0.00015504537,0.0000056809013,0.0027912373,0.00011349253,0.00008026472,0.00047206608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986668,0.00017280855,0.00040254157,0.00021053803,0.00027401574,0.00027326358],"domain_scores_gemma":[0.99634653,0.00019961581,0.00007945642,0.003231252,0.00007803026,0.0000651108],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00014341414,0.00022166931,0.00019723948,0.00034369898,0.0017302168,0.000046084744,0.001717701,0.00008920798,0.0004241487],"category_scores_gemma":[0.0000047686926,0.00027759402,0.0001172548,0.00093083904,0.00020186542,0.00027094004,0.000043080952,0.0008821737,0.00008740287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069835064,0.0002861434,0.000009544318,0.000010114128,0.00006278118,4.6184593e-7,0.00035462267,0.9846613,0.0007495263,0.0005759799,0.0007927006,0.0124898525],"study_design_scores_gemma":[0.0011849577,0.0002972948,0.00011249983,0.000044705354,0.00007963354,0.000041164894,0.0076182475,0.81385607,0.012899237,0.0046800226,0.15828629,0.0008998847],"about_ca_topic_score_codex":0.000028546165,"about_ca_topic_score_gemma":0.00009941818,"teacher_disagreement_score":0.9855674,"about_ca_system_score_codex":0.0005964269,"about_ca_system_score_gemma":0.000044908207,"threshold_uncertainty_score":0.99996763},"labels":[],"label_agreement":null},{"id":"W4312051168","doi":"10.1109/tcomm.2022.3217575","title":"Constellation Design for Multiuser Non-Coherent Massive SIMO Based on DMPSK Modulation","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Agencia Estatal de Investigación; Secretaría de Estado de Investigación, Desarrollo e Innovación; HORIZON EUROPE Marie Sklodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science; Bit error rate; Algorithm; Phase-shift keying; Keying; Channel (broadcasting); Constellation; Modulation (music); Reduction (mathematics); Theoretical computer science; Computer engineering; Decoding methods; Mathematics; Telecommunications","score_opus":0.038651794184268895,"score_gpt":0.2640161425969967,"score_spread":0.2253643484127278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312051168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028219153,0.00002858269,0.994871,0.0002788185,0.0005236748,0.0018814994,0.0002139923,0.00039997118,0.0015202534],"genre_scores_gemma":[0.9339795,0.000032463828,0.06446549,0.000075311014,0.000018283255,0.0010982252,0.00014335607,0.00007674248,0.00011061911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885005,0.00015731457,0.0003782327,0.00022175889,0.00019081775,0.00020185219],"domain_scores_gemma":[0.9977481,0.0007812655,0.000099696466,0.0012036313,0.00010521155,0.000062104664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020640476,0.00020400663,0.00017901746,0.00030137863,0.0008920145,0.00003098836,0.0003742967,0.00007461923,0.00011845492],"category_scores_gemma":[0.0000061564824,0.0002525114,0.00011283342,0.00040324838,0.000045275927,0.00016604127,0.0000034426357,0.00034016932,0.00002222796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049821152,0.0001822403,0.000002556298,0.000017586473,0.000032761513,1.421756e-7,0.00020343048,0.9897282,0.0023719117,0.000060889426,0.00027615525,0.007074289],"study_design_scores_gemma":[0.0009439252,0.00014954904,0.000011909744,0.00002801079,0.00003973731,0.0000010557497,0.00017756727,0.99138194,0.0053357235,0.000115467556,0.001576921,0.00023820017],"about_ca_topic_score_codex":0.0000099511,"about_ca_topic_score_gemma":0.000018407574,"teacher_disagreement_score":0.93369734,"about_ca_system_score_codex":0.00050826813,"about_ca_system_score_gemma":0.00004901622,"threshold_uncertainty_score":0.9999927},"labels":[],"label_agreement":null},{"id":"W4312051182","doi":"10.1109/tcomm.2022.3218651","title":"Throughput of Hybrid UAV Networks With Scale-Free Topology","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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 Windsor","funders":"National Key Research and Development Program of China; Beijing Municipal Natural Science Foundation; Young Elite Scientists Sponsorship Program by Tianjin; National Natural Science Foundation of China","keywords":"Network topology; Computer science; Computer network; Distributed computing; Throughput; Wireless ad hoc network; Resilience (materials science); Topology (electrical circuits); Network performance; Hierarchical network model; Engineering; Wireless; Telecommunications","score_opus":0.01096488450062982,"score_gpt":0.21302590059510776,"score_spread":0.20206101609447794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312051182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046980185,0.00024497535,0.987434,0.00068441033,0.00013970018,0.00027801463,0.00014254863,0.0002464866,0.006131836],"genre_scores_gemma":[0.9788198,0.0005684489,0.019757751,0.000061166145,0.000009785018,0.00053580926,0.000044864886,0.000035106466,0.0001672784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992993,0.00006710548,0.00023877002,0.00012467083,0.00012441377,0.00014574335],"domain_scores_gemma":[0.9978309,0.00012428004,0.000049421793,0.0018988863,0.000057013523,0.00003949416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008866181,0.000112065325,0.00014202601,0.00012414099,0.00053645833,0.0000106678835,0.00079605763,0.000026246731,0.00025751058],"category_scores_gemma":[8.6572646e-7,0.00012189165,0.00005675751,0.0004903099,0.00014686573,0.000079336714,0.0000115281755,0.00038166053,0.000006286091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111255185,0.00017377714,0.000016613334,0.0000051453985,0.000044409437,2.0657852e-7,0.00012908186,0.99466205,0.00010994506,0.0008456965,0.00065349095,0.0033484346],"study_design_scores_gemma":[0.00062688737,0.00016764259,0.00009332568,0.000011496882,0.000089974885,0.000044748045,0.0003609664,0.9827041,0.0026738476,0.00042150993,0.012560685,0.0002448104],"about_ca_topic_score_codex":0.00005893948,"about_ca_topic_score_gemma":0.00022326234,"teacher_disagreement_score":0.97412175,"about_ca_system_score_codex":0.00008594141,"about_ca_system_score_gemma":0.000025460828,"threshold_uncertainty_score":0.49705973},"labels":[],"label_agreement":null},{"id":"W4312237357","doi":"10.1109/tcomm.2022.3217516","title":"Polarization-Enabled MIMO Bidirectional Device-to-Device Communications via RIS","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nakagami distribution; Computer science; MIMO; Fading; Spectral efficiency; Electronic engineering; Wireless; Communications system; Polarization (electrochemistry); Bit error rate; Channel (broadcasting); Computer network; Telecommunications; Engineering","score_opus":0.03142694127445828,"score_gpt":0.2736240886959142,"score_spread":0.24219714742145593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312237357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027643372,0.0016953768,0.9722712,0.008237922,0.0005797803,0.0011199164,0.00050489575,0.004230463,0.008596128],"genre_scores_gemma":[0.9406894,0.0017051174,0.053094663,0.000518064,0.000014431531,0.0028438605,0.00018570074,0.00012631013,0.00082247355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766403,0.00040616887,0.0007087616,0.00035311285,0.00043308883,0.0004348455],"domain_scores_gemma":[0.99105287,0.00084807706,0.00013614357,0.0075558773,0.00023996225,0.0001670836],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003411233,0.0003602189,0.00033223684,0.0008775901,0.0034476493,0.00007600292,0.004934055,0.00013707642,0.0004473799],"category_scores_gemma":[0.000029296307,0.00047148776,0.00017794492,0.0028061662,0.00029223546,0.0003885308,0.00017510245,0.001694799,0.00034436656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002790677,0.0010136376,0.00007520557,0.000028893613,0.00028543297,8.342105e-7,0.00092585006,0.9015291,0.019679867,0.0036321597,0.0019689044,0.070832245],"study_design_scores_gemma":[0.0010965873,0.00021234615,0.00054122164,0.00007197356,0.00013321798,0.00006461443,0.002368632,0.41204783,0.021142282,0.0026537832,0.5581878,0.0014797001],"about_ca_topic_score_codex":0.00016601932,"about_ca_topic_score_gemma":0.0006184318,"teacher_disagreement_score":0.93792504,"about_ca_system_score_codex":0.0007108373,"about_ca_system_score_gemma":0.000096494245,"threshold_uncertainty_score":0.9997737},"labels":[],"label_agreement":null},{"id":"W4312288984","doi":"10.1109/tcomm.2022.3225163","title":"Deep Reinforcement Learning for Resource Allocation in Multi-Band and Hybrid OMA-NOMA Wireless Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Resource allocation; Wireless network; Mathematical optimization; Wireless; Greedy algorithm; Heuristic; Power control; Optimization problem; Spectral efficiency; Noma; Distributed computing; Channel (broadcasting); Power (physics); Algorithm; Mathematics; Artificial intelligence; Computer network; Telecommunications link; Telecommunications","score_opus":0.026820198413611003,"score_gpt":0.2564614589231429,"score_spread":0.22964126050953193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312288984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006502217,0.001055601,0.99019796,0.0006762461,0.00007210641,0.0006244046,0.0000068593163,0.00061869057,0.00024592975],"genre_scores_gemma":[0.9878104,0.0023794458,0.007169265,0.000055728247,0.0000035429462,0.002315137,0.00007567358,0.00005185168,0.00013896845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895495,0.00012759867,0.00037632577,0.00018861784,0.00011424532,0.00023826619],"domain_scores_gemma":[0.9980232,0.0004899964,0.00007786343,0.0013261646,0.000040371284,0.000042402266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002321901,0.00016973591,0.0001791732,0.00029917297,0.0009861621,0.00003069219,0.0007934494,0.00005932021,0.000015519387],"category_scores_gemma":[0.000011367636,0.00022207187,0.00005481839,0.00039786403,0.00013041872,0.00015027898,0.000026256905,0.00088058575,0.000002007927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015852265,0.00008689335,0.0000205582,0.000011871299,0.000023804594,2.30362e-7,0.0003441532,0.9542002,0.0005287445,0.0003471945,0.00003098992,0.04438949],"study_design_scores_gemma":[0.0007042443,0.00007073639,0.00007329757,0.000022351796,0.00001250797,0.0000069396106,0.0012151928,0.9863269,0.0027980926,0.00009174437,0.008462816,0.00021522367],"about_ca_topic_score_codex":0.000024048093,"about_ca_topic_score_gemma":0.00021909756,"teacher_disagreement_score":0.9830287,"about_ca_system_score_codex":0.00028445772,"about_ca_system_score_gemma":0.000014820159,"threshold_uncertainty_score":0.9055828},"labels":[],"label_agreement":null},{"id":"W4312392926","doi":"10.1109/tcomm.2022.3227304","title":"A POMDP-Based Approach to Joint Antenna Selection and User Scheduling for Multi-User Massive MIMO Communication","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially observable Markov decision process; Computer science; MIMO; Scheduling (production processes); Beamforming; Rayleigh fading; Base station; Channel (broadcasting); Channel state information; Mathematical optimization; Markov chain; Wireless; Markov model; Fading; Computer network; Telecommunications; Mathematics; Machine learning","score_opus":0.04856729260952792,"score_gpt":0.2736771149631247,"score_spread":0.22510982235359678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312392926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011102156,0.00028224333,0.9954292,0.0005786684,0.0001537157,0.0015676008,0.00016147712,0.0005024828,0.00021436872],"genre_scores_gemma":[0.60142845,0.00008820757,0.39530364,0.0000949425,0.0000075127955,0.002736775,0.00007459435,0.00006329952,0.00020254779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987457,0.00019869707,0.00040631907,0.0002667338,0.00013788506,0.0002446724],"domain_scores_gemma":[0.9981855,0.00020130737,0.00008947731,0.0012427056,0.00017604898,0.0001049559],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00028672742,0.00021629276,0.00022475897,0.0003882027,0.0014106769,0.000058609432,0.00048886845,0.00007864461,0.000016455848],"category_scores_gemma":[0.000016871294,0.0002717567,0.000094436924,0.0006598833,0.000052154573,0.00023268319,0.0000147669725,0.0005050628,0.000006939545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000252639,0.00029113275,0.00000615251,0.00004162622,0.000051944793,4.0538087e-8,0.00056944636,0.98668957,0.010795823,0.0005957291,0.00010232005,0.0008309662],"study_design_scores_gemma":[0.0009087986,0.00007756748,0.00002459121,0.00003984443,0.00005658256,0.000007024694,0.00092348375,0.98924965,0.003990423,0.000028865768,0.00440996,0.00028320504],"about_ca_topic_score_codex":0.000049005423,"about_ca_topic_score_gemma":0.00013653813,"teacher_disagreement_score":0.60031825,"about_ca_system_score_codex":0.00038636627,"about_ca_system_score_gemma":0.00004515786,"threshold_uncertainty_score":0.9999735},"labels":[],"label_agreement":null},{"id":"W4312497239","doi":"10.1109/tcomm.2022.3223706","title":"Energy-Efficient Design of STAR-RIS Aided MIMO-NOMA Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":81,"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":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Beamforming; MIMO; Precoding; Computer science; Efficient energy use; Optimization problem; Mathematical optimization; Convex optimization; Spectral efficiency; Electronic engineering; Algorithm; Telecommunications; Mathematics; Regular polygon; Engineering; Electrical engineering","score_opus":0.030850913700618134,"score_gpt":0.23956988260553802,"score_spread":0.2087189689049199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312497239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012400966,0.0016985358,0.99449664,0.00040254887,0.00019936243,0.00025459545,0.00008241082,0.0010058715,0.00061996054],"genre_scores_gemma":[0.9625343,0.0026686226,0.03371289,0.00004053994,0.0000039001,0.0008657871,0.000020903926,0.000054025928,0.00009902693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986943,0.00025052615,0.0004485789,0.00016191066,0.00021044542,0.00023424678],"domain_scores_gemma":[0.9958889,0.00063644815,0.00010359406,0.003249171,0.00007363942,0.000048264817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019395267,0.00018563835,0.00022582311,0.00033145904,0.0007525942,0.000013625658,0.0018941527,0.000078533645,0.00013932449],"category_scores_gemma":[0.0000054489665,0.0002291187,0.00010886835,0.0009102849,0.00022492536,0.0000797323,0.000038540456,0.00071975327,0.0000069016583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012624917,0.000258499,0.0000011130556,0.000004908628,0.00005842604,2.9122498e-7,0.0001619067,0.97337514,0.0014943396,0.0013964627,0.0002278654,0.023008412],"study_design_scores_gemma":[0.00025929778,0.0000826919,0.000012865721,0.000014778301,0.00002334013,0.0000052179576,0.0005941753,0.9825545,0.011227317,0.00043428034,0.0045758053,0.00021571941],"about_ca_topic_score_codex":0.000038423048,"about_ca_topic_score_gemma":0.000032895987,"teacher_disagreement_score":0.96129423,"about_ca_system_score_codex":0.00024245666,"about_ca_system_score_gemma":0.00003596904,"threshold_uncertainty_score":0.93431896},"labels":[],"label_agreement":null},{"id":"W4312849087","doi":"10.1109/tcomm.2022.3222374","title":"Joint Optimization Framework for User Clustering, Downlink Beamforming, and Power Allocation in MIMO NOMA Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Beamforming; MIMO; Mathematical optimization; Cluster analysis; Computer science; Transmitter power output; Optimization problem; Benchmark (surveying); Computational complexity theory; Mathematics; Algorithm; Computer network; Transmitter","score_opus":0.028579321233462116,"score_gpt":0.2618756455393728,"score_spread":0.23329632430591069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312849087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017658076,0.0009844713,0.99406934,0.0009470373,0.00030838427,0.0008862885,0.000102071535,0.00067694555,0.00025965058],"genre_scores_gemma":[0.8232995,0.0016738225,0.17220134,0.000044053853,0.000004819358,0.0026146069,0.000046231904,0.00005157088,0.00006404084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889046,0.00009119154,0.00046182747,0.0002003497,0.00013775208,0.00021840986],"domain_scores_gemma":[0.997668,0.00036568596,0.00009786478,0.0017594211,0.000066139495,0.0000428468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023012124,0.00018346914,0.000208898,0.0004174628,0.0006767422,0.000052255957,0.000745084,0.00012419255,0.000032252876],"category_scores_gemma":[0.000021727568,0.0002304697,0.0000583894,0.00049909257,0.00010478476,0.00025302338,0.000033478664,0.00070042873,0.0000036248246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009825773,0.000114756585,0.000007161002,0.000028496297,0.00002525583,1.1170222e-7,0.0004874535,0.9904902,0.00029598954,0.004677963,0.000043966418,0.0038188237],"study_design_scores_gemma":[0.00041277512,0.000085880725,0.0000423239,0.00006905023,0.000015492587,0.0000101552905,0.0018083983,0.9878409,0.0007631954,0.00076758506,0.00790889,0.00027533283],"about_ca_topic_score_codex":0.000032758442,"about_ca_topic_score_gemma":0.00009899746,"teacher_disagreement_score":0.821868,"about_ca_system_score_codex":0.00034118164,"about_ca_system_score_gemma":0.000023815614,"threshold_uncertainty_score":0.9398281},"labels":[],"label_agreement":null},{"id":"W4313167004","doi":"10.1109/tcomm.2022.3226186","title":"Optimizing Caching in a C-RAN With a Hybrid Millimeter-Wave/Microwave Fronthaul Link via Dynamic Programming","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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; Radio access network; Cache; Computer network; Backup; Latency (audio); Cellular network; Cloud computing; Key (lock); Markov decision process; Distributed computing; Markov process; Base station; Telecommunications","score_opus":0.025801369291841035,"score_gpt":0.2385912547649464,"score_spread":0.21278988547310534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313167004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020477096,0.00046741264,0.9749772,0.0028708137,0.00021256268,0.00042641963,0.000023712953,0.0002884844,0.00025630093],"genre_scores_gemma":[0.91564643,0.00008777183,0.083361104,0.00024895283,0.0000062147164,0.00045343928,0.000015938773,0.000027824564,0.00015234564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981084,0.00042294656,0.0003600443,0.000436218,0.0003053311,0.00036707646],"domain_scores_gemma":[0.9972004,0.00031106267,0.00012130706,0.0022229035,0.00005445639,0.00008986441],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00041759145,0.0002157218,0.00022909918,0.00047102734,0.0014655372,0.0001733796,0.0016970653,0.000033559918,0.000011455562],"category_scores_gemma":[0.0000028151817,0.00023359865,0.00014316889,0.0007299306,0.00008777826,0.00039574088,0.000045822122,0.0012033088,0.000010329753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009804325,0.0015440191,0.000033798817,0.000021661497,0.0001931167,0.00009066794,0.0094216755,0.29968974,0.009649266,0.00021616912,0.000022843189,0.679019],"study_design_scores_gemma":[0.0009021022,0.00031136489,0.000040691506,0.000077485754,0.000042260494,0.00027394487,0.00060417556,0.99512494,0.0006943731,0.00014677897,0.0013759898,0.00040587797],"about_ca_topic_score_codex":0.00071494136,"about_ca_topic_score_gemma":0.0018666047,"teacher_disagreement_score":0.8951693,"about_ca_system_score_codex":0.00037494837,"about_ca_system_score_gemma":0.00010444386,"threshold_uncertainty_score":0.9998344},"labels":[],"label_agreement":null},{"id":"W4313195381","doi":"10.1109/tcomm.2022.3228611","title":"Future Space Networks: Toward the Next Giant Leap for Humankind","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":103,"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; St. Francis Xavier University; Carleton University","funders":"National Research Council Canada; Mitacs","keywords":"Standardization; Software deployment; Space (punctuation); Communications satellite; Telecommunications; Satellite; Systems engineering; Computer science; Space technology; Architecture; Space exploration; Engineering; Aerospace engineering; Software engineering","score_opus":0.07624539177131777,"score_gpt":0.2821979077412448,"score_spread":0.20595251596992703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313195381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031913576,0.00087641226,0.9481656,0.047124468,0.0014245408,0.00057138584,0.00004931221,0.00019200104,0.0015643591],"genre_scores_gemma":[0.97536695,0.0007813571,0.019757774,0.0018186009,0.00015779244,0.0008896414,0.000022858938,0.00002423568,0.0011808076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.00028315556,0.0003033061,0.000311295,0.00027299573,0.00033244654],"domain_scores_gemma":[0.99599975,0.000708525,0.00012763306,0.0029761468,0.00009312631,0.0000948135],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047678486,0.00017910475,0.00017438737,0.00009547613,0.0032833833,0.00021558827,0.0033877052,0.0000659737,0.00010731162],"category_scores_gemma":[0.0000010009056,0.00015409446,0.00020963827,0.00060436653,0.00014821473,0.00024970993,0.00005581419,0.0008356621,0.000016946475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079303,0.0011098775,0.000002974229,0.000015081004,0.00022321536,0.000006058603,0.0067196116,0.1808563,0.000059572492,0.16547918,0.0389425,0.60650635],"study_design_scores_gemma":[0.00029612813,0.0001281383,0.0000104463015,0.0000072909024,0.000039671973,0.00002931975,0.0010356992,0.8082734,0.000013770703,0.0018143327,0.18816856,0.00018325397],"about_ca_topic_score_codex":0.00002961455,"about_ca_topic_score_gemma":0.00007207011,"teacher_disagreement_score":0.975335,"about_ca_system_score_codex":0.00009755635,"about_ca_system_score_gemma":0.00013949005,"threshold_uncertainty_score":0.9980142},"labels":[],"label_agreement":null},{"id":"W4317553693","doi":"10.1109/tcomm.2023.3238368","title":"Analysis of Massive Ultra-Reliable and Low-Latency Communications Over the <i>κ</i>-<i>μ</i> Shadowed Fading Channel","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Beijing Institute of Technology Research Fund Program for Young Scholars; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Fading; Channel state information; Channel (broadcasting); Probability density function; Algorithm; Mathematics; MIMO; Computer science; Statistics; Decoding methods; Wireless; Telecommunications","score_opus":0.02711708926833861,"score_gpt":0.2677241242540996,"score_spread":0.24060703498576097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317553693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11028774,0.007651559,0.8405117,0.015232872,0.00066627184,0.0025965294,0.0015174684,0.008463162,0.013072732],"genre_scores_gemma":[0.965134,0.032511298,0.0015976814,0.000066472465,0.0000033338338,0.00045033023,0.00007925011,0.000047462996,0.000110145826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986562,0.00010254344,0.00055079744,0.00020393549,0.00019733535,0.00028918908],"domain_scores_gemma":[0.9925266,0.0012175463,0.00014223164,0.005916483,0.00013595102,0.00006121725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026749473,0.00023515534,0.00036685448,0.00086628366,0.0008863798,0.000044042605,0.0026298815,0.0001484762,0.000026574346],"category_scores_gemma":[0.000022706932,0.00021854536,0.0001961054,0.0043076864,0.00073588244,0.0002584847,0.000051905587,0.00072581077,0.000033288732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071308204,0.00018892858,0.0001597148,0.00004269656,0.0012411624,3.4786353e-7,0.0019793233,0.9735858,0.009282151,0.003092712,0.00036563893,0.010054438],"study_design_scores_gemma":[0.00036257115,0.00003207671,0.002278529,0.00010431799,0.0005755618,0.0000018456453,0.0022237522,0.9790371,0.011522137,0.0014441329,0.00203719,0.00038076425],"about_ca_topic_score_codex":0.000077143355,"about_ca_topic_score_gemma":0.00038658403,"teacher_disagreement_score":0.8548463,"about_ca_system_score_codex":0.00008379671,"about_ca_system_score_gemma":0.000024076944,"threshold_uncertainty_score":0.89120215},"labels":[],"label_agreement":null},{"id":"W4318821623","doi":"10.1109/tcomm.2023.3241355","title":"RIS-Assisted Energy- and Spectrum-Efficient Symbiotic Transmission in NOMA Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"National Key Research and Development Program of China","keywords":"Noma; Computer science; Telecommunications link; Optimization problem; Convex optimization; Resource allocation; Efficient energy use; Quality of service; Transmission (telecommunications); Spectral efficiency; Distributed computing; Computer network; Mathematical optimization; Channel (broadcasting); Telecommunications; Algorithm; Engineering; Regular polygon; Mathematics","score_opus":0.025162206452299423,"score_gpt":0.24681921717346308,"score_spread":0.22165701072116367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318821623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036845997,0.0031634376,0.951828,0.0018272208,0.00027387153,0.00041754593,0.000049759063,0.0036430769,0.0019511023],"genre_scores_gemma":[0.9871391,0.010677775,0.0016911937,0.000010035057,0.0000037053942,0.00026415454,0.000017255614,0.000046690417,0.0001500671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893016,0.00010334335,0.00037965964,0.00018911579,0.00013553693,0.00026216902],"domain_scores_gemma":[0.9976104,0.0003991698,0.000039747392,0.0018578399,0.000025645746,0.00006721567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013737116,0.00018937493,0.00021535065,0.0006437852,0.00032239524,0.000042299253,0.00077018933,0.00014845947,0.0000085695],"category_scores_gemma":[0.000004657496,0.00020862844,0.00005434785,0.0013290861,0.0001704663,0.00009787767,0.000011269039,0.00042217597,0.000032009182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007812609,0.00020459625,0.00001718617,0.000057890855,0.000043278334,0.0000025654147,0.00039499177,0.91794074,0.0064721256,0.0031420435,0.00009389565,0.07162291],"study_design_scores_gemma":[0.0004252233,0.000032509255,0.0006921344,0.00019036199,0.000017148412,0.000013370045,0.0006870932,0.98476976,0.008713437,0.00040545972,0.0037685176,0.00028496585],"about_ca_topic_score_codex":0.00007861474,"about_ca_topic_score_gemma":0.00022956132,"teacher_disagreement_score":0.9502931,"about_ca_system_score_codex":0.00016270824,"about_ca_system_score_gemma":0.00001745957,"threshold_uncertainty_score":0.85076207},"labels":[],"label_agreement":null},{"id":"W4320015699","doi":"10.1109/tcomm.2023.3240393","title":"Cognitive NOMA With Blind Transmission-Mode Identification","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Cognitive radio; Noma; Detector; Underlay; Transmission (telecommunications); Throughput; Algorithm; Transmitter power output; Network packet; Real-time computing; Electronic engineering; Telecommunications link; Computer network; Transmitter; Signal-to-noise ratio (imaging); Telecommunications; Channel (broadcasting); Engineering; Wireless","score_opus":0.03852526292210831,"score_gpt":0.30531319393813855,"score_spread":0.26678793101603027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320015699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013664525,0.0002578499,0.97763175,0.0012463223,0.000093054034,0.00047665456,0.00011250288,0.004217073,0.0023002813],"genre_scores_gemma":[0.98682517,0.0055418466,0.0062609212,0.00002627691,0.0000059108816,0.000759167,0.000095322604,0.00007234652,0.0004130271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892217,0.00006833214,0.00034192065,0.00021366106,0.00020068629,0.00025321543],"domain_scores_gemma":[0.99712086,0.0005391851,0.000058473684,0.0020721864,0.0001353069,0.00007400814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011148132,0.00021128937,0.00017509896,0.0004915951,0.00059315196,0.000049881426,0.0010506632,0.00013164645,0.000058772],"category_scores_gemma":[0.000008322443,0.00021482931,0.00007410672,0.0015354699,0.0002930307,0.00031907455,0.000006487505,0.000592482,0.00026872233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009206856,0.00038423124,0.000015928657,0.00006571257,0.00025889088,0.0000029625487,0.0015897036,0.51351434,0.017651595,0.0013349436,0.00047494026,0.46461472],"study_design_scores_gemma":[0.0028658875,0.0002111145,0.0011463277,0.0005851453,0.00018532158,0.000031666703,0.0043348377,0.7086555,0.2615744,0.0032767565,0.015822552,0.0013105161],"about_ca_topic_score_codex":0.000008775755,"about_ca_topic_score_gemma":0.000083846215,"teacher_disagreement_score":0.9731607,"about_ca_system_score_codex":0.00008828196,"about_ca_system_score_gemma":0.000032615368,"threshold_uncertainty_score":0.8760485},"labels":[],"label_agreement":null},{"id":"W4320015708","doi":"10.1109/tcomm.2023.3240440","title":"Lightweight Flexible Group Authentication Utilizing Historical Collaboration Process Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Process (computing); Computer science; Authentication (law); Group (periodic table); Computer network; Embedded system; Engineering; Computer security; Operating system","score_opus":0.02182675359350712,"score_gpt":0.2588762021408052,"score_spread":0.2370494485472981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320015708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024405323,0.00044535147,0.9495415,0.0039393255,0.0021760343,0.0013446182,0.000104219536,0.0067230873,0.011320523],"genre_scores_gemma":[0.9963429,0.00083656196,0.0015394279,0.00005867833,0.000040137165,0.00051985955,0.00024012799,0.00004443669,0.00037784685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868774,0.000080493955,0.00046984936,0.00015205752,0.00030077904,0.0003090651],"domain_scores_gemma":[0.9982749,0.00015532911,0.00007327482,0.0012055727,0.00017628731,0.00011464193],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026055105,0.00019552457,0.00017121449,0.00047808164,0.0005721553,0.000120011435,0.0005550097,0.00016049074,0.000043760632],"category_scores_gemma":[0.000011511837,0.00022500718,0.00008399748,0.002083049,0.000048715097,0.0010685079,0.0000044311114,0.000427384,0.0008180761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013774505,0.00013714684,0.000009350899,0.00008040595,0.00007618007,5.572976e-7,0.0024496745,0.9718978,0.0016621267,0.0018692001,0.006112835,0.015690949],"study_design_scores_gemma":[0.0003146478,0.000039580802,0.0001564063,0.000057313744,0.00006026358,0.000004986598,0.0004407392,0.9226602,0.0034292736,0.00050886866,0.07204241,0.00028532237],"about_ca_topic_score_codex":0.000016921871,"about_ca_topic_score_gemma":0.00012834916,"teacher_disagreement_score":0.9719376,"about_ca_system_score_codex":0.0006570147,"about_ca_system_score_gemma":0.000052913423,"threshold_uncertainty_score":0.9999599},"labels":[],"label_agreement":null},{"id":"W4320713259","doi":"10.1109/tcomm.2023.3244960","title":"Optimal Power Allocation for Multiuser Photon-Counting Underwater Optical Wireless Communications Under Poisson Shot Noise","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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 Manitoba","funders":"Science and Technology Innovation Plan Of Shanghai Science and Technology Commission; National Natural Science Foundation of China","keywords":"Shot noise; Convexity; Poisson distribution; Photon counting; Mathematical optimization; Wireless; Computer science; Optical wireless; Power (physics); Signal-to-noise ratio (imaging); Photon; Mathematics; Telecommunications; Physics; Statistics; Optics","score_opus":0.05447320542319371,"score_gpt":0.2984343982703953,"score_spread":0.24396119284720158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320713259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082112506,0.0004286191,0.88782024,0.01555108,0.00052057963,0.0018356962,0.00026850734,0.0066836276,0.0047791493],"genre_scores_gemma":[0.9478714,0.003050421,0.0462036,0.00016382828,0.000014648941,0.0019551287,0.00022966095,0.00016661355,0.0003446989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976737,0.0001346873,0.0008000487,0.00040297623,0.00032850265,0.0006601224],"domain_scores_gemma":[0.9912588,0.0018774094,0.00010254769,0.006265788,0.00033517776,0.00016028344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004965665,0.00043063075,0.0004044777,0.000601976,0.0012264092,0.00019005452,0.0033388908,0.00040698843,0.000058304955],"category_scores_gemma":[0.000041532217,0.0004800148,0.00026940048,0.0012886033,0.0006873633,0.0004702813,0.000086653425,0.0010706681,0.00051620847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016249779,0.002921195,0.00006559992,0.00027912614,0.0013342334,0.0000022312192,0.0037159456,0.6906042,0.1518974,0.08698176,0.0039968872,0.058038898],"study_design_scores_gemma":[0.0011076387,0.00011406763,0.00036552123,0.0001451942,0.0001263118,0.000008225913,0.0023004476,0.90533847,0.07848913,0.0013843018,0.009755782,0.0008648844],"about_ca_topic_score_codex":0.00003362602,"about_ca_topic_score_gemma":0.00023241306,"teacher_disagreement_score":0.8657589,"about_ca_system_score_codex":0.00034686617,"about_ca_system_score_gemma":0.00006790295,"threshold_uncertainty_score":0.99976516},"labels":[],"label_agreement":null},{"id":"W4320713284","doi":"10.1109/tcomm.2023.3244954","title":"UAV-Aided Secure Short-Packet Data Collection and Transmission","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Base station; Network packet; Data transmission; Real-time computing; Transmitter power output; Eavesdropping; Transmission (telecommunications); Wireless; Computer network; Data collection; Scheduling (production processes); Channel (broadcasting); Mathematical optimization; Transmitter; Telecommunications","score_opus":0.062392837115184674,"score_gpt":0.28916976607328115,"score_spread":0.22677692895809648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320713284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046296837,0.00038079827,0.985827,0.0019893658,0.00019660819,0.00048572104,0.00017586873,0.0014702136,0.004844733],"genre_scores_gemma":[0.979421,0.011036124,0.008366608,0.000032127427,0.000021326847,0.0002230348,0.0003753861,0.000054121396,0.00047023385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909544,0.00007256268,0.0002616778,0.00023792605,0.00016045346,0.00017191222],"domain_scores_gemma":[0.9976709,0.000167656,0.000019321922,0.001977774,0.00007324363,0.000091117465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025425776,0.00015493631,0.0001361209,0.00028533346,0.0006511881,0.00004910911,0.0006131,0.000114225644,0.000075727905],"category_scores_gemma":[0.000004135467,0.00016479884,0.0000320847,0.0012099681,0.00010426629,0.00028517353,0.000008185211,0.0002883351,0.0000745851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029899616,0.00036168398,0.0000484027,0.00012159092,0.0002744625,9.942031e-7,0.003012509,0.5380435,0.010764447,0.0015838263,0.044059817,0.40169886],"study_design_scores_gemma":[0.00025139577,0.000023249962,0.00029930027,0.000038396967,0.00008709264,0.0000058972805,0.00019574059,0.9662395,0.0010425149,0.0003968322,0.03122629,0.00019375003],"about_ca_topic_score_codex":0.00003913388,"about_ca_topic_score_gemma":0.0002219377,"teacher_disagreement_score":0.9774604,"about_ca_system_score_codex":0.000057945446,"about_ca_system_score_gemma":0.000023661773,"threshold_uncertainty_score":0.6720302},"labels":[],"label_agreement":null},{"id":"W4321021465","doi":"10.1109/tcomm.2023.3245659","title":"Physical-Layer Authentication for Ambient Backscatter-Aided NOMA Symbiotic Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":157,"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; Université Laval","funders":"CHIST-ERA; Basic and Applied Basic Research Foundation of Guangdong Province; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Authentication (law); Multiplexing; Noma; Physical layer; Computer network; Wireless; Backscatter (email); Telecommunications; Telecommunications link; Computer security","score_opus":0.044549290945610755,"score_gpt":0.27801917021509515,"score_spread":0.2334698792694844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321021465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15639938,0.00013326401,0.8354693,0.0009417098,0.0017737191,0.0009410097,0.00014342567,0.002875372,0.0013227776],"genre_scores_gemma":[0.99594146,0.0002589919,0.0014608161,0.000027270507,0.0000837544,0.0011184482,0.000086562075,0.00009206947,0.00093061867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988946,0.00007853735,0.0003275802,0.00021668579,0.00015752419,0.00032509823],"domain_scores_gemma":[0.9972374,0.0007851406,0.000052900905,0.0017316288,0.000097726166,0.00009522483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001669855,0.00020152752,0.00020690926,0.00022037543,0.00043810933,0.00008731626,0.0006654486,0.00010265379,0.000007612516],"category_scores_gemma":[0.0000089073055,0.00022819781,0.00014445375,0.000687879,0.0000934195,0.00014217744,0.0000050895746,0.00030414877,0.00035340813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045313723,0.00018982987,0.000007169739,0.00008239662,0.00011708899,2.9744137e-7,0.00049070874,0.975259,0.017121008,0.00211302,0.0018559983,0.0027589384],"study_design_scores_gemma":[0.00028537173,0.00003926986,0.00024501918,0.0001318064,0.000070040034,0.000003025308,0.00011997811,0.98610294,0.009696972,0.0002296201,0.002820331,0.0002555983],"about_ca_topic_score_codex":0.000026477164,"about_ca_topic_score_gemma":0.00005367959,"teacher_disagreement_score":0.8395421,"about_ca_system_score_codex":0.00013865554,"about_ca_system_score_gemma":0.000019236457,"threshold_uncertainty_score":0.9305637},"labels":[],"label_agreement":null},{"id":"W4323338322","doi":"10.1109/tcomm.2023.3253721","title":"Dynamic Transmission and Computation Resource Optimization for Dense LEO Satellite Assisted Mobile-Edge Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"ZTE Corporation","keywords":"Precoding; Computer science; Mobile edge computing; Mathematical optimization; Lyapunov optimization; MIMO; Optimization problem; Resource allocation; Mathematics; Enhanced Data Rates for GSM Evolution; Algorithm; Computer network; Lyapunov equation; Lyapunov exponent; Telecommunications","score_opus":0.04445506079455381,"score_gpt":0.3064221589831568,"score_spread":0.261967098188603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323338322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065960987,0.0023935272,0.9867359,0.00041650777,0.00019632446,0.0011583201,0.00006988492,0.0016682042,0.0007652817],"genre_scores_gemma":[0.94084936,0.0069771167,0.051184364,0.000038718557,0.000010927895,0.0003794598,0.00031081706,0.00010109979,0.00014812624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843836,0.0002450948,0.00059038494,0.00026749205,0.00017803814,0.0002806301],"domain_scores_gemma":[0.99710846,0.0012826023,0.00009475505,0.001246492,0.00014633326,0.00012134124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045381984,0.00024590033,0.00026123077,0.00046177756,0.0007987815,0.00011139108,0.0005300532,0.00016917358,0.000008288207],"category_scores_gemma":[0.000008083433,0.00028870173,0.000117671676,0.0009908734,0.00012484322,0.00018491324,0.0000084,0.00033713444,0.000040124425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016135404,0.00006320866,0.000005012387,0.00009992705,0.000056128705,2.2445526e-7,0.001272438,0.75633067,0.0022552023,0.000038037913,0.00006441843,0.23979859],"study_design_scores_gemma":[0.0005856449,0.000050364677,0.00032989247,0.00015565143,0.00005247603,0.000013733648,0.00059207797,0.9803559,0.00061015645,0.000053326847,0.016928462,0.00027228313],"about_ca_topic_score_codex":0.00000816703,"about_ca_topic_score_gemma":0.000028266375,"teacher_disagreement_score":0.93555146,"about_ca_system_score_codex":0.00015237623,"about_ca_system_score_gemma":0.000024788971,"threshold_uncertainty_score":0.9999565},"labels":[],"label_agreement":null},{"id":"W4323338515","doi":"10.1109/tcomm.2023.3253718","title":"Decentralized Aggregation for Energy-Efficient Federated Learning via D2D Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","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 British Columbia, Okanagan Campus; University of British Columbia; Carleton University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Efficient energy use; Energy (signal processing); Computer network; Distributed computing; Electronic engineering; Electrical engineering; Engineering","score_opus":0.06539950561102888,"score_gpt":0.31741512092832697,"score_spread":0.2520156153172981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323338515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034578232,0.00022276997,0.9478217,0.046833064,0.0002878411,0.00049409084,0.00007319654,0.0034259737,0.00049561705],"genre_scores_gemma":[0.7698241,0.002531305,0.22598864,0.00017504573,0.000007651652,0.0009860048,0.00019086395,0.00003716091,0.00025923364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777216,0.00041881116,0.0005223176,0.0004898553,0.00030511947,0.0004917326],"domain_scores_gemma":[0.98277646,0.0017333399,0.00021031933,0.014874829,0.00029716798,0.00010790404],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006257982,0.00024446717,0.00023821715,0.00055598386,0.0027094213,0.00029612205,0.026948849,0.00018963662,0.000012520627],"category_scores_gemma":[0.0006363481,0.000275572,0.00017046154,0.002442883,0.000312313,0.0004255223,0.0019989118,0.00061574904,0.0001461291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049897473,0.0015804578,0.000023555545,0.000041905572,0.000324453,0.000002344069,0.0007866777,0.033387464,0.009610909,0.026229747,0.037602603,0.89036],"study_design_scores_gemma":[0.000517339,0.000065526256,0.000024515533,0.00004920102,0.000027236822,0.0000063997336,0.00008662939,0.9467778,0.007962498,0.019307774,0.024906047,0.00026901273],"about_ca_topic_score_codex":0.00012311312,"about_ca_topic_score_gemma":0.0002651781,"teacher_disagreement_score":0.91339034,"about_ca_system_score_codex":0.00022021009,"about_ca_system_score_gemma":0.00012626583,"threshold_uncertainty_score":0.99996966},"labels":[],"label_agreement":null},{"id":"W4327522659","doi":"10.1109/tcomm.2023.3257371","title":"On the Performance of Training-Based IRS-Assisted Communications Under Correlated Rayleigh Fading","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Estimator; Rayleigh fading; Transmitter; Minimum mean square error; Channel state information; Channel (broadcasting); Fading; Computer science; Mean squared error; Communications system; Algorithm; Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics; Wireless","score_opus":0.08409364230072279,"score_gpt":0.28237486345245516,"score_spread":0.19828122115173236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327522659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21784239,0.0007628942,0.7391302,0.017987454,0.0006736827,0.0018324293,0.0003464284,0.009550795,0.011873762],"genre_scores_gemma":[0.9922803,0.0030827282,0.0035923456,0.0001314537,0.0000031511556,0.00061932445,0.000066349974,0.00007667021,0.00014767236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843925,0.00022722983,0.00057963235,0.00018164619,0.0002533445,0.00031887306],"domain_scores_gemma":[0.9889986,0.0037268957,0.00014904648,0.006927256,0.00014251906,0.00005570507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034840172,0.00026566355,0.00028310917,0.00053805555,0.0011203878,0.00003194425,0.0034896154,0.00018810395,0.000056177345],"category_scores_gemma":[0.000044954846,0.00024387446,0.00015747549,0.0021526285,0.0007790403,0.00016096435,0.000032810003,0.0012047786,0.00019503913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015168779,0.00020947895,0.000009621958,0.000021595428,0.00012046249,1.6341369e-7,0.0006298082,0.9629361,0.0047991513,0.00884566,0.00035007825,0.022062697],"study_design_scores_gemma":[0.0005081197,0.00010356328,0.0005473886,0.00026673038,0.00004768554,0.0000031148202,0.0015662055,0.9635529,0.030530721,0.00084996916,0.0016890569,0.0003345614],"about_ca_topic_score_codex":0.000011522729,"about_ca_topic_score_gemma":0.000094784904,"teacher_disagreement_score":0.7744379,"about_ca_system_score_codex":0.00019105508,"about_ca_system_score_gemma":0.000071878014,"threshold_uncertainty_score":0.99449116},"labels":[],"label_agreement":null},{"id":"W4327796594","doi":"10.1109/tcomm.2023.3258487","title":"Deep Reinforcement Learning for Latency-Sensitive Communication With Adaptive Redundant Retransmissions","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Channel (broadcasting); Network packet; Estimator; Erasure; Reinforcement learning; Acknowledgement; Communication source; Binary erasure channel; Transmission (telecommunications); Upper and lower bounds; Computer network; Markov process; Latency (audio); Real-time computing; Artificial intelligence; Channel capacity; Telecommunications; Mathematics","score_opus":0.061484670496015435,"score_gpt":0.29618449034481087,"score_spread":0.23469981984879543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327796594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012210014,0.00025452324,0.9851785,0.008267961,0.00009590069,0.00087020843,0.000004346862,0.000819587,0.0043868963],"genre_scores_gemma":[0.91683686,0.008826034,0.07142583,0.00024747432,0.000010430228,0.00074797246,0.00006641449,0.00003571177,0.0018032743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795765,0.0005313478,0.00044447,0.00039049608,0.00028916003,0.00038684992],"domain_scores_gemma":[0.9943587,0.0013782572,0.00018201543,0.0033731533,0.0005516135,0.00015626692],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00061254273,0.00025639153,0.00025132412,0.000380871,0.0030469985,0.0001589845,0.0022932691,0.000101857855,0.000021491096],"category_scores_gemma":[0.000024843115,0.00024148106,0.00014955857,0.0018011344,0.00025213757,0.0005195284,0.00005431419,0.0007563529,0.00010871085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019336921,0.00050462363,0.000008546032,0.00002367416,0.00035762825,0.0000029980474,0.012497911,0.5907386,0.0018388566,0.10843681,0.0011362721,0.2842607],"study_design_scores_gemma":[0.0007337313,0.00037091676,0.00011614738,0.00018358315,0.000042316766,0.000009177333,0.0006359477,0.98493963,0.0022354354,0.00071152375,0.009682592,0.00033899795],"about_ca_topic_score_codex":0.00002008471,"about_ca_topic_score_gemma":0.0002988603,"teacher_disagreement_score":0.9167147,"about_ca_system_score_codex":0.00015955944,"about_ca_system_score_gemma":0.00015609265,"threshold_uncertainty_score":0.9982509},"labels":[],"label_agreement":null},{"id":"W4360597077","doi":"10.1109/tcomm.2023.3260249","title":"Binary Modeling and Capacity-Approaching Coding for the IM/DD Channel","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Channel capacity; Decoding methods; Algorithm; Coding (social sciences); Computer science; Channel (broadcasting); Binary code; Wireless; Binary erasure channel; Electronic engineering; Topology (electrical circuits); Theoretical computer science; Mathematics; Telecommunications; Engineering; Statistics; Arithmetic","score_opus":0.10276714110586883,"score_gpt":0.278147380541027,"score_spread":0.17538023943515818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360597077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011488296,0.0007738523,0.9790636,0.0051878407,0.00017114783,0.00049541553,0.00006157473,0.0021384745,0.00061982445],"genre_scores_gemma":[0.9817204,0.008672193,0.00864142,0.000035171324,0.000009703097,0.00081808027,0.000010273546,0.00004461609,0.000048163558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925023,0.000046256722,0.00024022165,0.00013770038,0.000093834155,0.00023177224],"domain_scores_gemma":[0.99687195,0.0012718212,0.000023832796,0.0017388741,0.000051305447,0.00004224012],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003106321,0.00014641978,0.00013955473,0.00021867114,0.0013556081,0.00007263005,0.0009770701,0.00010569459,0.0000027577066],"category_scores_gemma":[0.000026064123,0.00013191286,0.000076917815,0.000511199,0.00021378697,0.00016029915,0.000021081762,0.0005789305,0.00002310734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048962684,0.000053392963,9.457365e-7,0.000043342687,0.000094710296,8.7368456e-8,0.0009428268,0.9586442,0.0017553179,0.008581237,0.00012291841,0.029756099],"study_design_scores_gemma":[0.0001583469,0.000018105395,0.000013014589,0.00003785753,0.000029265137,0.0000023214805,0.0012757403,0.99446505,0.0013309286,0.0018940035,0.0006308513,0.00014449982],"about_ca_topic_score_codex":0.000022041295,"about_ca_topic_score_gemma":0.000054340333,"teacher_disagreement_score":0.97042215,"about_ca_system_score_codex":0.000054225606,"about_ca_system_score_gemma":0.000009798219,"threshold_uncertainty_score":0.9999445},"labels":[],"label_agreement":null},{"id":"W4360993814","doi":"10.1109/tcomm.2023.3262305","title":"Spectrum Sharing Between High Altitude Platform Network and Terrestrial Network: Modeling and Performance Analysis","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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 Windsor","funders":"National Natural Science Foundation of China; National Key Research and Development Program of China; China Association for Science and Technology","keywords":"Stochastic geometry; Poisson point process; Computer science; Interference (communication); Network performance; Base station; Cellular network; Coverage probability; Network topology; Transmission (telecommunications); Poisson distribution; Topology (electrical circuits); Distributed computing; Computer network; Telecommunications; Engineering; Mathematics; Electrical engineering","score_opus":0.07377783082778891,"score_gpt":0.27478291019527135,"score_spread":0.20100507936748244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360993814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7098453,0.0021940009,0.28357494,0.00054554484,0.00048142276,0.0005513844,0.000056021752,0.001529205,0.0012221462],"genre_scores_gemma":[0.9825856,0.014733308,0.0022355993,0.000014473066,0.00013520551,0.00011061808,0.00007637225,0.00004540048,0.000063437015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986802,0.00006135985,0.0004911061,0.00023510125,0.00015751513,0.0003747535],"domain_scores_gemma":[0.9974977,0.0004107236,0.00005668008,0.0018909974,0.000022966844,0.00012092659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048962975,0.00020867374,0.00033776803,0.00034636928,0.000818091,0.00012757168,0.0007175606,0.00012411235,0.000012694133],"category_scores_gemma":[0.0000027105084,0.00023806078,0.00008732357,0.0016836876,0.0000854565,0.00027993444,0.000033270455,0.00050860184,0.00003716405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007375079,0.000010038443,0.004628294,0.000017269254,0.00047509684,1.8817971e-7,0.00029378184,0.9876477,0.0000091761485,0.00013510077,0.000023635792,0.0067523513],"study_design_scores_gemma":[0.00029387162,0.000020736477,0.009825214,0.00006811918,0.00029208043,0.000002348082,0.00006989093,0.9881145,0.000033313656,0.00038954083,0.0006555052,0.00023488684],"about_ca_topic_score_codex":0.00014825798,"about_ca_topic_score_gemma":0.00074534694,"teacher_disagreement_score":0.28133935,"about_ca_system_score_codex":0.00007754836,"about_ca_system_score_gemma":0.000013371425,"threshold_uncertainty_score":0.97078365},"labels":[],"label_agreement":null},{"id":"W4361802077","doi":"10.1109/tcomm.2023.3262833","title":"Achieving Cooperative Mobile-Edge Computing Using Helper Scheduling","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Distributed computing; Mobile edge computing; Computer network; Server; Fair-share scheduling; Energy consumption; Engineering; Quality of service","score_opus":0.07867904597553951,"score_gpt":0.33519266204172016,"score_spread":0.2565136160661806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361802077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09098733,0.00013561953,0.902748,0.0007303185,0.0032721946,0.00031484815,0.0000020082316,0.0010169166,0.0007927581],"genre_scores_gemma":[0.9080243,0.0001049396,0.09118273,0.00020784531,0.00022388302,0.00003838033,0.0000062260538,0.00003346469,0.0001782237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980447,0.00030251258,0.0004530372,0.00044077556,0.00025865252,0.0005002754],"domain_scores_gemma":[0.9966108,0.0008084862,0.00012180669,0.0021197232,0.0002097597,0.00012942383],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00059428654,0.0002461103,0.00025143218,0.00045939587,0.0026147952,0.00032658773,0.0021411185,0.00010519876,0.000005099205],"category_scores_gemma":[0.000017937351,0.00026736886,0.00016057493,0.0022018158,0.00014340809,0.0005657696,0.000085221414,0.00070681015,0.00032726463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009571065,0.000543928,0.00011929355,0.00004392605,0.00018713914,0.000010766823,0.014839511,0.8098215,0.018073065,0.002257453,0.000521436,0.15357243],"study_design_scores_gemma":[0.00025516935,0.00005421977,0.00013836219,0.00014173872,0.00002064191,0.000020485375,0.0002479525,0.9936091,0.002782336,0.00008714204,0.0023262822,0.00031658422],"about_ca_topic_score_codex":0.000062241284,"about_ca_topic_score_gemma":0.00001136533,"teacher_disagreement_score":0.817037,"about_ca_system_score_codex":0.00014791754,"about_ca_system_score_gemma":0.00015499549,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W4361985268","doi":"10.1109/tcomm.2023.3263566","title":"Relay-Assisted Federated Edge Learning: Performance Analysis and System Optimization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":61,"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 Guangdong Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Relay; Computer science; Bandwidth (computing); Notation; Computer network; Multiplexing; Wireless; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Mathematics; Artificial intelligence; Telecommunications; Arithmetic","score_opus":0.04689439866739662,"score_gpt":0.2800039392541482,"score_spread":0.23310954058675157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361985268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005775442,0.00005082591,0.9815969,0.008126259,0.0001391409,0.00018003155,0.000018501167,0.0032829125,0.0008299992],"genre_scores_gemma":[0.8499401,0.0010355591,0.14858188,0.000021652728,0.0000031606335,0.000113811846,0.000051229737,0.000013360652,0.00023926218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861795,0.00024299603,0.00031188375,0.00038102566,0.00020898662,0.00023717825],"domain_scores_gemma":[0.99164224,0.00039251542,0.00012298791,0.007637984,0.00013900633,0.00006524166],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0004128155,0.00015249252,0.0002013065,0.0008508063,0.0014678069,0.00025572802,0.008941196,0.00013281275,0.000006890749],"category_scores_gemma":[0.00025788645,0.00016236209,0.00007602512,0.0052876077,0.00014221674,0.00057784247,0.0009561756,0.0005207789,0.00008025444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020717636,0.00035812813,0.0009508973,0.00010147872,0.0010508326,0.0000062559684,0.0004902347,0.87758154,0.0006856974,0.0011825992,0.0047465493,0.11282509],"study_design_scores_gemma":[0.00016853659,0.000043233584,0.0015648389,0.00003542921,0.00010587424,0.000009119433,0.00012268676,0.9965884,0.00083239574,0.000058840382,0.00031016502,0.00016045172],"about_ca_topic_score_codex":0.000051244264,"about_ca_topic_score_gemma":0.000054275424,"teacher_disagreement_score":0.84416467,"about_ca_system_score_codex":0.0001270776,"about_ca_system_score_gemma":0.000047115405,"threshold_uncertainty_score":0.99983215},"labels":[],"label_agreement":null},{"id":"W4362683604","doi":"10.1109/tcomm.2023.3265123","title":"Energy-Efficient Optimization of Multi-User NOMA-Assisted Cooperative THz-SIMO MEC Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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); Carleton University; McMaster University","funders":"King Fahd University of Petroleum and Minerals","keywords":"Computer science; Mobile edge computing; Beamforming; Noma; Spectral efficiency; Telecommunications link; Computer network; Base station; Efficient energy use; Optimization problem; Transmission (telecommunications); Electronic engineering; Cellular network; Distributed computing; Engineering; Telecommunications; Server; Electrical engineering","score_opus":0.04163928372749435,"score_gpt":0.27322972817536983,"score_spread":0.2315904444478755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362683604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010515851,0.00063536566,0.9939833,0.0002920759,0.00027758942,0.00034013003,0.0001524082,0.0023310084,0.0009364881],"genre_scores_gemma":[0.97449297,0.0040553547,0.020052651,0.0000123764785,0.0000045339407,0.0006294823,0.000077266544,0.00006586497,0.0006095302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986955,0.00015517464,0.0005371518,0.00018994784,0.00019131001,0.000230948],"domain_scores_gemma":[0.99643224,0.00045529293,0.0001133679,0.0026812926,0.00026210988,0.000055687055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014199867,0.00022253094,0.00028195625,0.00051685434,0.0004257984,0.00003526062,0.0011935212,0.00016687109,0.000022149565],"category_scores_gemma":[0.00001655108,0.00024021615,0.00009938838,0.0016609078,0.00025514286,0.00014992055,0.000020893842,0.00037245158,0.000051796607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045185593,0.00020775564,0.0000015916874,0.000021066173,0.000084152896,2.908214e-7,0.00023336255,0.98765814,0.0032362752,0.0030009209,0.00013313825,0.0054188035],"study_design_scores_gemma":[0.00037290814,0.000029081051,0.000031803425,0.00007914317,0.000026510632,0.000002586481,0.0010134585,0.97754025,0.018347327,0.000012932516,0.002325252,0.00021872023],"about_ca_topic_score_codex":0.00005590312,"about_ca_topic_score_gemma":0.00011731291,"teacher_disagreement_score":0.9739307,"about_ca_system_score_codex":0.00016536556,"about_ca_system_score_gemma":0.000037218495,"threshold_uncertainty_score":0.979573},"labels":[],"label_agreement":null},{"id":"W4366201171","doi":"10.1109/tcomm.2023.3263694","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"National and Kapodistrian University of Athens; Chinese University of Hong Kong; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366201171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4366957259","doi":"10.1109/tcomm.2023.3269839","title":"Robust Task Offloading and Resource Allocation in Mobile Edge Computing With Uncertain Distribution of Computation Burden","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","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 Windsor; University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Mobile edge computing; Computer science; Computation offloading; Computation; Task (project management); Edge computing; Resource allocation; Distributed computing; Enhanced Data Rates for GSM Evolution; Resource management (computing); Mathematical optimization; Computer network; Algorithm; Engineering; Mathematics; Telecommunications","score_opus":0.041510134733567516,"score_gpt":0.2769400113834664,"score_spread":0.2354298766498989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366957259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10521457,0.00008838742,0.89265627,0.0009494303,0.00027685726,0.0003323772,0.00000451586,0.0002472625,0.00023034376],"genre_scores_gemma":[0.98725986,0.00008394544,0.012425339,0.000022957332,0.00004620852,0.00004143164,0.00007126427,0.000014027288,0.000034939556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986061,0.00021940072,0.00040219873,0.00030834577,0.00021192187,0.00025203056],"domain_scores_gemma":[0.9981789,0.00065465976,0.00016045086,0.0008119465,0.00013236213,0.00006165723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005605443,0.00015053732,0.00019779483,0.00034052168,0.000517267,0.00008418213,0.0006834291,0.000073506104,4.10435e-7],"category_scores_gemma":[0.000010785992,0.00015805986,0.000042764543,0.0018204665,0.00014166468,0.000290014,0.000033111148,0.00031337765,0.000010777049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017453847,0.00017776772,0.00017912623,0.0000515642,0.000032705968,0.0000020548264,0.005598771,0.8396284,0.0010147868,0.00077597535,0.0003285271,0.15219286],"study_design_scores_gemma":[0.00046045808,0.00011991026,0.0023064925,0.00021428677,0.000014805135,0.000011130069,0.00045575295,0.99426275,0.0007170162,0.00020046326,0.0010521063,0.00018482495],"about_ca_topic_score_codex":0.00018992444,"about_ca_topic_score_gemma":0.00005420452,"teacher_disagreement_score":0.8820453,"about_ca_system_score_codex":0.00012027804,"about_ca_system_score_gemma":0.000072965755,"threshold_uncertainty_score":0.6445494},"labels":[],"label_agreement":null},{"id":"W4367277145","doi":"10.1109/tcomm.2023.3270907","title":"Energy Consumption Optimization in RIS-Assisted Cooperative RSMA Cellular Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Concordia University","funders":"","keywords":"Precoding; Telecommunications link; Computer science; Optimization problem; Mathematical optimization; Base station; Beamforming; Transmitter power output; Karush–Kuhn–Tucker conditions; Convex optimization; Energy consumption; Quality of service; MIMO; Algorithm; Mathematics; Computer network; Regular polygon; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.03623933895583812,"score_gpt":0.2610534787965382,"score_spread":0.22481413984070006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367277145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015993641,0.0006110531,0.9932701,0.00045704262,0.00018544655,0.00023478566,0.0000433585,0.0025542043,0.001044662],"genre_scores_gemma":[0.96971494,0.019642983,0.009572257,0.000037198777,0.000006914244,0.00060462975,0.00021967168,0.000058980615,0.00014239948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987536,0.00017503923,0.0004303673,0.00019514002,0.00012753798,0.0003183022],"domain_scores_gemma":[0.9972756,0.00045310156,0.000060625025,0.0020625999,0.000088073284,0.000059990674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016608823,0.00021184862,0.00021335679,0.0005963413,0.00039504815,0.00004220978,0.0009144868,0.00021240764,0.00007377083],"category_scores_gemma":[0.000010973023,0.00025407385,0.0000677878,0.001649708,0.00021166698,0.00027072927,0.000015292348,0.0005992651,0.00007395576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005897298,0.00008935564,0.000014177329,0.0000070981982,0.00002980601,9.545422e-7,0.00011131197,0.9674924,0.0011017739,0.0006593687,0.00015741418,0.030330427],"study_design_scores_gemma":[0.00036545377,0.000021289408,0.0001810196,0.00005997884,0.000011950476,0.0000021520677,0.00022189759,0.9897289,0.007539463,0.00010306937,0.0015213329,0.00024349248],"about_ca_topic_score_codex":0.000046115798,"about_ca_topic_score_gemma":0.0006680867,"teacher_disagreement_score":0.98369783,"about_ca_system_score_codex":0.00025529295,"about_ca_system_score_gemma":0.000022063954,"threshold_uncertainty_score":0.9999912},"labels":[],"label_agreement":null},{"id":"W4376481190","doi":"10.1109/tcomm.2023.3275590","title":"Doppler Shift and Channel Estimation for Intelligent Transparent Surface Assisted Communication Systems on High-Speed Railways","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"National Natural Science Foundation of China","keywords":"Estimator; Cramér–Rao bound; Channel (broadcasting); Computer science; Benchmark (surveying); Doppler effect; Algorithm; Wireless; Estimation theory; Mean squared error; Electronic engineering; Real-time computing; Telecommunications; Engineering; Mathematics; Statistics","score_opus":0.08266190891484038,"score_gpt":0.3013899624863311,"score_spread":0.21872805357149072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376481190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007540016,0.0011422813,0.9827446,0.0021277277,0.00044291082,0.0015079018,0.0004009195,0.0035958916,0.00049779186],"genre_scores_gemma":[0.97444654,0.011937302,0.012147747,0.000029330264,0.000008474987,0.0008679052,0.00033496495,0.00009079786,0.00013692986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984679,0.00015978572,0.00057481026,0.00027057767,0.00021019291,0.0003166869],"domain_scores_gemma":[0.99527955,0.0012162603,0.000115208815,0.0031551877,0.00014415637,0.00008960928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003303043,0.000310041,0.0003328593,0.00040770404,0.0008423872,0.00009756208,0.0012055449,0.00021578568,0.0000075507032],"category_scores_gemma":[0.000035396086,0.00034448353,0.00010059414,0.00081623497,0.00024974515,0.00020063293,0.00001724065,0.00057098083,0.0000881846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024768453,0.00014513372,0.0000015755023,0.00006555176,0.00008815771,1.1224667e-7,0.00064447,0.97488093,0.00056034815,0.0075857183,0.000564122,0.0154391145],"study_design_scores_gemma":[0.0007092864,0.00013503715,0.00025404993,0.00024754376,0.000057536312,0.0000029524103,0.0008768402,0.98196876,0.008603003,0.002371462,0.004348704,0.00042485158],"about_ca_topic_score_codex":0.000055462337,"about_ca_topic_score_gemma":0.00013104033,"teacher_disagreement_score":0.9705968,"about_ca_system_score_codex":0.00022762995,"about_ca_system_score_gemma":0.00002113394,"threshold_uncertainty_score":0.9999007},"labels":[],"label_agreement":null},{"id":"W4376870731","doi":"10.1109/tcomm.2023.3264893","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376870731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4377001514","doi":"10.1109/tcomm.2023.3277033","title":"RSMA Precoding Design Based on Interference Nulling and Sum Rate Upper Bound","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Precoding; Upper and lower bounds; Maximization; Mathematical optimization; Mathematics; Zero-forcing precoding; Interference (communication); Computer science; Optimization problem; Algorithm; Topology (electrical circuits); MIMO; Beamforming; Telecommunications; Channel (broadcasting); Statistics; Combinatorics","score_opus":0.06948614300454585,"score_gpt":0.2835017649438014,"score_spread":0.21401562193925555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377001514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00636898,0.00017690384,0.9878302,0.0014988087,0.00016372999,0.00031130188,0.000030714116,0.0026275984,0.0009917137],"genre_scores_gemma":[0.97328806,0.004390939,0.021690423,0.000060743965,0.000004565259,0.0003682909,0.000012896641,0.00005225303,0.0001318398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999049,0.00014732314,0.00027392557,0.00019296091,0.000093481256,0.00024331023],"domain_scores_gemma":[0.9962323,0.0014988218,0.00004267678,0.0021190853,0.000051764488,0.00005538688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002595956,0.00019615679,0.00016752574,0.00045172442,0.00059518445,0.00007857848,0.0009157809,0.00011364383,0.000027224258],"category_scores_gemma":[0.000030439007,0.00021923396,0.00005471435,0.00069487083,0.00020323186,0.00019956105,0.000013398893,0.00063758134,0.00013757643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013989095,0.000064477674,0.00001222387,0.00002204013,0.000032025673,4.5171456e-7,0.00025487557,0.950997,0.0058741616,0.00056321407,0.00016551687,0.042000037],"study_design_scores_gemma":[0.00025348517,0.00005804862,0.00013006646,0.0001607211,0.00001493368,0.0000014864532,0.000285704,0.9513114,0.04510802,0.0011049282,0.0013225563,0.00024864197],"about_ca_topic_score_codex":0.0000069221833,"about_ca_topic_score_gemma":0.000038805814,"teacher_disagreement_score":0.96691906,"about_ca_system_score_codex":0.000108128486,"about_ca_system_score_gemma":0.00002285624,"threshold_uncertainty_score":0.8940101},"labels":[],"label_agreement":null},{"id":"W4377001549","doi":"10.1109/tcomm.2023.3277041","title":"Power Allocation for Adaptive-Connectivity Wireless Networks Under Imperfect CSI","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"National Research Foundation of Korea","keywords":"Computer science; MIMO; Channel state information; Transmitter power output; Transmission (telecommunications); Power control; Wireless; Channel (broadcasting); Throughput; Wireless network; Computer network; Signal-to-noise ratio (imaging); Interference (communication); Real-time computing; Power (physics); Transmitter; Telecommunications","score_opus":0.028603687142327083,"score_gpt":0.2676376317139196,"score_spread":0.2390339445715925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377001549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027209474,0.000110709945,0.9929909,0.0003094523,0.0006250679,0.00078803976,0.000068156114,0.0013951068,0.0009916384],"genre_scores_gemma":[0.9931899,0.0005420443,0.004715292,0.000035388624,0.000028880197,0.0010606073,0.00006511873,0.000089326386,0.00027346285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999037,0.00009093117,0.00028867464,0.00020970282,0.00009330179,0.0002803917],"domain_scores_gemma":[0.99781805,0.00070366997,0.000051174968,0.0012185929,0.00013717891,0.000071338436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022770469,0.00019561342,0.00019034845,0.00022663546,0.0004951946,0.000036405792,0.00039040425,0.00014472913,0.00001917486],"category_scores_gemma":[0.000007276356,0.00023004427,0.00012066799,0.0007772699,0.000068696354,0.00030053174,0.0000036624288,0.00029858545,0.000073527095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013598917,0.000058661983,0.0000021729884,0.0000121010735,0.000071290604,9.150628e-8,0.00018880128,0.99131143,0.0016140616,0.0014026327,0.0003383203,0.0049868333],"study_design_scores_gemma":[0.00039790384,0.000060322043,0.000092803784,0.000043775166,0.000033455734,0.0000026540906,0.00027294812,0.995528,0.0023513027,0.0003577364,0.0006125232,0.00024660685],"about_ca_topic_score_codex":0.0000165134,"about_ca_topic_score_gemma":0.00024006079,"teacher_disagreement_score":0.9904689,"about_ca_system_score_codex":0.00021177274,"about_ca_system_score_gemma":0.000027107742,"threshold_uncertainty_score":0.93809336},"labels":[],"label_agreement":null},{"id":"W4378421727","doi":"10.1109/tcomm.2023.3280213","title":"Impact of Channel Aging on Dual-Function Radar-Communication Systems: Performance Analysis and Resource Allocation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Radar Systems and Signal Processing","field":"Engineering","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":"Western University","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Real-time computing; Resource allocation; Channel (broadcasting); Communications system; Radar; Electronic engineering; Retransmission; Engineering; Transmission (telecommunications); Computer network; Telecommunications","score_opus":0.022686372734460367,"score_gpt":0.25690553870756927,"score_spread":0.2342191659731089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378421727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6415164,0.0015215805,0.35180306,0.00028213835,0.00021426241,0.00056095724,0.00008697697,0.00092514185,0.0030895015],"genre_scores_gemma":[0.99765575,0.0017411918,0.00021490028,0.0000067459887,0.0000150445685,0.000098105294,0.00006591208,0.000034500168,0.00016782305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886763,0.00015270775,0.00043117357,0.00016416896,0.00020679568,0.00017754534],"domain_scores_gemma":[0.99806833,0.0002820607,0.000115646406,0.0013675296,0.00010158393,0.000064847416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043121973,0.00017390047,0.00026456907,0.00085023907,0.0005145532,0.00006794186,0.0003028904,0.00009327265,0.0000063337766],"category_scores_gemma":[0.0000056214744,0.00017382318,0.0001430427,0.0018891599,0.00007792093,0.00025785048,0.0000050321983,0.00031266396,0.000021370133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018036011,0.00006428527,0.00011579507,0.00009703056,0.0005328953,1.3402729e-7,0.00085501245,0.9877827,0.0017857228,0.0000924996,0.0001270127,0.0085288575],"study_design_scores_gemma":[0.0002662754,0.00012762204,0.012941928,0.00029314306,0.00032395884,0.0000046025225,0.0005464315,0.98380256,0.001177744,0.000026395768,0.00026988867,0.00021943745],"about_ca_topic_score_codex":0.00024122327,"about_ca_topic_score_gemma":0.000054748976,"teacher_disagreement_score":0.3561394,"about_ca_system_score_codex":0.00013629743,"about_ca_system_score_gemma":0.000024458179,"threshold_uncertainty_score":0.70883036},"labels":[],"label_agreement":null},{"id":"W4378421815","doi":"10.1109/tcomm.2023.3280219","title":"Coverage Analysis of SAGIN With Sectorized Beam Pattern Under Shadowed-Rician Fading Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Rician fading; Fading; Telecommunications link; Path loss; Stochastic geometry; Computer science; Interference (communication); Applied mathematics; Topology (electrical circuits); Telecommunications; Mathematics; Mathematical optimization; Statistics; Decoding methods; Wireless; Channel (broadcasting)","score_opus":0.046390646691294404,"score_gpt":0.27213380369793155,"score_spread":0.22574315700663716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378421815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08252732,0.0005532628,0.90955245,0.0004883718,0.00040569188,0.00054221955,0.0003075607,0.0013543031,0.004268817],"genre_scores_gemma":[0.99686295,0.002083348,0.0003210148,0.000050096645,0.000012200232,0.00021485028,0.0001243294,0.00006588198,0.00026532324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986143,0.00015983058,0.0005010075,0.00019447946,0.0002707834,0.0002595938],"domain_scores_gemma":[0.99598444,0.0006680279,0.00010288986,0.0030292247,0.00012755953,0.00008785296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027425564,0.00021846606,0.00041181693,0.001174426,0.00028494166,0.0000517536,0.0010411983,0.000104828134,0.00009676064],"category_scores_gemma":[0.0000033745848,0.0002275137,0.00020135636,0.004340498,0.00010355658,0.0001664332,0.000009300348,0.00038231356,0.000116022195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008922505,0.00012298262,0.0004619344,0.00003798887,0.0018611465,6.7395735e-7,0.0021943676,0.98310876,0.004654396,0.00007673569,0.00005381506,0.007418263],"study_design_scores_gemma":[0.0020785218,0.00016996372,0.015351233,0.00044037972,0.0024428554,0.00001362455,0.0030346136,0.9455211,0.016929464,0.00015251961,0.012470394,0.0013953336],"about_ca_topic_score_codex":0.00019067821,"about_ca_topic_score_gemma":0.0008815244,"teacher_disagreement_score":0.9143356,"about_ca_system_score_codex":0.00015299178,"about_ca_system_score_gemma":0.000028023711,"threshold_uncertainty_score":0.9277739},"labels":[],"label_agreement":null},{"id":"W4378421951","doi":"10.1109/tcomm.2023.3280212","title":"Value of Service Maximization in Integrated Localization and Communication System Through Joint Resource Allocation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Huawei Technologies (Canada); Western University","funders":"","keywords":"Computer science; Resource allocation; Maximization; Particle swarm optimization; Distributed computing; Wireless; Mathematical optimization; Computer network; Bandwidth (computing); Provisioning; Telecommunications; Algorithm; Mathematics","score_opus":0.027918244147136596,"score_gpt":0.23940948211350205,"score_spread":0.21149123796636546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378421951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01294217,0.00034271902,0.9815559,0.0011780296,0.00013881849,0.0005397842,0.00004358696,0.0016922166,0.0015667893],"genre_scores_gemma":[0.99355686,0.0026680985,0.0031900178,0.00006832854,0.00000405077,0.0002492466,0.0001892105,0.000041493673,0.000032672913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879515,0.0001761004,0.0005464551,0.00015907148,0.0001583164,0.00016491978],"domain_scores_gemma":[0.9983024,0.00018900503,0.00009270547,0.0012214587,0.00016623538,0.000028176908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000244189,0.00016442701,0.00021123873,0.0004953567,0.00024675555,0.000029959072,0.0004380026,0.00018681647,0.0000068099753],"category_scores_gemma":[0.000020615678,0.00018429851,0.00003830199,0.002333321,0.0001281164,0.00025767004,0.000011957719,0.0002961545,0.000024172024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010087902,0.000079104604,0.00004248132,0.0002701226,0.000034419383,3.319633e-7,0.00245869,0.9752561,0.0015217041,0.0153007815,0.00026329214,0.0047629126],"study_design_scores_gemma":[0.00043179176,0.000023451628,0.0003176265,0.000381874,0.000032987373,0.0000037635514,0.0037028624,0.96193886,0.030824535,0.0006278276,0.0015334163,0.00018097807],"about_ca_topic_score_codex":0.00032136915,"about_ca_topic_score_gemma":0.0004761421,"teacher_disagreement_score":0.9806147,"about_ca_system_score_codex":0.00018366883,"about_ca_system_score_gemma":0.00002727956,"threshold_uncertainty_score":0.7515475},"labels":[],"label_agreement":null},{"id":"W4379116684","doi":"10.1109/tcomm.2023.3282220","title":"Power Control With QoS Guarantees: A Differentiable Projection-Based Unsupervised Learning Framework","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Smart Grid Energy Management","field":"Engineering","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Projection (relational algebra); Differentiable function; Power control; Quality of service; Unsupervised learning; Control (management); Competitive learning; Power (physics); Artificial intelligence; Computer network; Mathematics; Algorithm","score_opus":0.014030329029693233,"score_gpt":0.22561910392406992,"score_spread":0.2115887748943767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379116684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013017469,0.000078106685,0.97890824,0.00079131674,0.0004766347,0.000492635,0.000025301895,0.002678169,0.0035320984],"genre_scores_gemma":[0.9951785,0.000237279,0.0030423189,0.00010141615,0.000027246073,0.0006185874,0.000025736541,0.000089198984,0.0006797119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884945,0.000117560376,0.00025184205,0.00021340724,0.000236985,0.00033078037],"domain_scores_gemma":[0.9979384,0.00049003446,0.00003277068,0.001394475,0.000071973045,0.00007237672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001361258,0.00023247594,0.00020359649,0.0004206472,0.0005890777,0.00007874427,0.00052684295,0.0001036158,0.00023192144],"category_scores_gemma":[0.0000075081543,0.00022820424,0.00010531898,0.0012189442,0.00009202516,0.00012650507,0.000003138354,0.0006841281,0.00029450606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028917259,0.00014317413,0.00010377715,0.000027167614,0.00021322921,0.00000147767,0.0003463408,0.9971434,0.0003197317,0.00020885534,0.00053547247,0.00092846784],"study_design_scores_gemma":[0.0011254507,0.00014783096,0.0007655347,0.00017393377,0.00010715778,0.0000018561028,0.00053649215,0.98129874,0.0012421993,0.00006362761,0.0141796805,0.00035749289],"about_ca_topic_score_codex":0.000044299104,"about_ca_topic_score_gemma":0.00012173127,"teacher_disagreement_score":0.98216105,"about_ca_system_score_codex":0.00011495019,"about_ca_system_score_gemma":0.00003445966,"threshold_uncertainty_score":0.93058985},"labels":[],"label_agreement":null},{"id":"W4380434584","doi":"10.1109/tcomm.2023.3285799","title":"Joint Trajectory and Radio Resource Optimization for Autonomous Mobile Robots Exploiting Multi-Agent Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Florida Center for Cybersecurity, University of South Florida","keywords":"Reinforcement learning; Computer science; Mathematical optimization; Robot; Mobile robot; Greedy algorithm; Markov decision process; Trajectory; Wireless sensor network; Wireless; Distributed computing; Real-time computing; Markov process; Artificial intelligence; Computer network; Algorithm; Mathematics","score_opus":0.056437383574556445,"score_gpt":0.2757989399046327,"score_spread":0.21936155633007628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380434584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002175397,0.0005454145,0.9926708,0.00025991112,0.000090502064,0.0007849251,0.00001607165,0.0032112983,0.00024572833],"genre_scores_gemma":[0.8936532,0.0058295885,0.09767404,0.000018143948,0.000007796645,0.002305138,0.00008062236,0.00007477851,0.00035669687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894154,0.0000719752,0.0004123617,0.00019892205,0.00010673048,0.00026845638],"domain_scores_gemma":[0.99805117,0.00041742867,0.00008450322,0.0013199986,0.00006371833,0.00006320143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022131488,0.0001958128,0.00020062964,0.00037659172,0.00085433474,0.000047929774,0.0005106104,0.000116759846,0.000015687237],"category_scores_gemma":[0.000027543305,0.000236939,0.00008663064,0.00046839833,0.00013732507,0.00020348729,0.000018864219,0.0004885933,0.000019044794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036808606,0.00003819948,0.0000015019625,0.000033320022,0.000039289294,1.4556045e-7,0.0007555513,0.9600729,0.0018634752,0.000086433625,0.00006408721,0.037041415],"study_design_scores_gemma":[0.00046358068,0.00006627662,0.000019153525,0.00006227926,0.00002143077,0.0000027481813,0.0019692504,0.9829369,0.00872181,0.000022519574,0.0054845796,0.00022944875],"about_ca_topic_score_codex":0.000007781729,"about_ca_topic_score_gemma":0.000018817324,"teacher_disagreement_score":0.8949967,"about_ca_system_score_codex":0.00020965433,"about_ca_system_score_gemma":0.000019121131,"threshold_uncertainty_score":0.96620923},"labels":[],"label_agreement":null},{"id":"W4380793125","doi":"10.1109/tcomm.2023.3280273","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380793125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4383220456","doi":"10.1109/tcomm.2023.3292482","title":"Minimum Symbol Error Probability Discrete Symbol Level Precoding for MU-MIMO Systems With PSK Modulation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Manitoba","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Fundação de Amparo à Pesquisa do Estado de São Paulo; Agence Nationale de la Recherche","keywords":"Precoding; Symbol (formal); Modulation (music); MIMO; Phase-shift keying; Quadrature amplitude modulation; Mathematics; Computer science; Algorithm; Electronic engineering; Bit error rate; Telecommunications; Decoding methods; Channel (broadcasting); Engineering; Physics","score_opus":0.0829865496730114,"score_gpt":0.29299418660000004,"score_spread":0.21000763692698865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383220456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056404523,0.00007366008,0.9882195,0.00027404318,0.00055294594,0.0025676358,0.0005027315,0.0015056022,0.0006634214],"genre_scores_gemma":[0.97585195,0.00011767955,0.019705359,0.0000064403116,0.00003746426,0.003197983,0.00018263726,0.00011448195,0.000786011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984716,0.00011301002,0.0005488657,0.00032610705,0.00018519159,0.000355197],"domain_scores_gemma":[0.9973376,0.00048193123,0.00010845155,0.0017525034,0.00021664586,0.00010286892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029766047,0.00028169618,0.00030555043,0.00029546316,0.00062796887,0.000080935235,0.00049983634,0.00014859751,0.000007593639],"category_scores_gemma":[0.000019193967,0.00028674366,0.00011123396,0.000822292,0.000093001785,0.00048482922,0.000005126507,0.00029300005,0.000049921422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002335463,0.000062974,0.000025435344,0.00022043496,0.00009374219,1.6742145e-7,0.0006583774,0.99543256,0.0015744803,0.00026789817,0.00010424252,0.0015363148],"study_design_scores_gemma":[0.0005958654,0.000073788484,0.00018433009,0.00023127034,0.000078847064,0.0000062959894,0.00069575297,0.99624395,0.0009670571,0.00018422597,0.0003988389,0.00033978562],"about_ca_topic_score_codex":0.00004296237,"about_ca_topic_score_gemma":0.0003994027,"teacher_disagreement_score":0.9702115,"about_ca_system_score_codex":0.00029100294,"about_ca_system_score_gemma":0.000045426394,"threshold_uncertainty_score":0.99995846},"labels":[],"label_agreement":null},{"id":"W4384304709","doi":"10.1109/tcomm.2023.3290802","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384304709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4384787755","doi":"10.1109/tcomm.2023.3296619","title":"Active RIS-Aided EH-NOMA Networks: A Deep Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Noma; Reinforcement learning; Computer science; Artificial intelligence; Computer network; Telecommunications link","score_opus":0.031140085127844,"score_gpt":0.2611409502011849,"score_spread":0.2300008650733409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384787755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012560014,0.00034281609,0.983851,0.0004305045,0.00015265106,0.00043546595,0.0000068280624,0.0053646523,0.008160058],"genre_scores_gemma":[0.9789035,0.009214893,0.010143966,0.000029243096,0.000013360227,0.0010876432,0.000097492426,0.000080133854,0.00042981224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986645,0.00012532093,0.0004095335,0.00022220697,0.00018793487,0.0003905059],"domain_scores_gemma":[0.9964618,0.00046688542,0.00008502143,0.0028323345,0.000076102944,0.00007782969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015899626,0.00025911894,0.00024330763,0.00032483024,0.0008778068,0.000049177455,0.0015150121,0.00018418266,0.000040078306],"category_scores_gemma":[0.000016909153,0.00029964797,0.00013214948,0.0015162729,0.00028678152,0.0003055181,0.000030990497,0.0012685567,0.00021929902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007680225,0.000067495486,0.00000344808,0.000011730504,0.000092025904,3.3640276e-7,0.00040608546,0.93284047,0.0002592091,0.0006357287,0.00012338872,0.06555238],"study_design_scores_gemma":[0.00031155322,0.000039670205,0.00009491175,0.000033749642,0.000025421568,0.0000039194724,0.0015107202,0.9892827,0.0031255835,0.00023426783,0.0050396947,0.0002977571],"about_ca_topic_score_codex":0.000019567771,"about_ca_topic_score_gemma":0.00006168313,"teacher_disagreement_score":0.9776475,"about_ca_system_score_codex":0.00027044164,"about_ca_system_score_gemma":0.000016021002,"threshold_uncertainty_score":0.9999456},"labels":[],"label_agreement":null},{"id":"W4385575065","doi":"10.1109/tcomm.2023.3302067","title":"Redundancy Management in Federated Learning for Fast Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","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":"Huawei Technologies (Canada); Queen's University","funders":"Huawei Technologies","keywords":"Retransmission; Redundancy (engineering); Computer science; Decoding methods; Network packet; Wireless; Error detection and correction; Cyclic redundancy check; Real-time computing; Baseline (sea); Machine learning; Computer network; Artificial intelligence; Computer engineering; Algorithm; Telecommunications","score_opus":0.06826406456159706,"score_gpt":0.3272213245812685,"score_spread":0.25895726001967145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385575065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074986456,0.000090237256,0.9503365,0.042834014,0.00015022235,0.0006370373,0.000018436012,0.0019248897,0.003258789],"genre_scores_gemma":[0.73913544,0.0023470123,0.25675488,0.00008095807,0.000002783203,0.0009911171,0.00006681025,0.000021246644,0.0005997337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985915,0.00022967522,0.00035237538,0.00034258622,0.00017131622,0.00031258847],"domain_scores_gemma":[0.9875893,0.0006714558,0.000095197196,0.011521513,0.00008296611,0.000039551578],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005949596,0.00014528022,0.00014744786,0.00060025055,0.0010375148,0.00018758344,0.020079732,0.000102156315,0.0000066844677],"category_scores_gemma":[0.00030789486,0.00017088332,0.000069528636,0.0020490182,0.00012614294,0.0005013455,0.0016204836,0.0005755599,0.00013588677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000312078,0.00083903864,0.000056115678,0.00007131775,0.00017357605,0.0000047937806,0.00089452346,0.015771037,0.00095983624,0.02291151,0.03980028,0.9184868],"study_design_scores_gemma":[0.0006634043,0.00006139928,0.00042723524,0.00011232512,0.000013836741,0.0000032489322,0.00041756785,0.9204937,0.0018380776,0.060050853,0.015658464,0.00025985355],"about_ca_topic_score_codex":0.00004933127,"about_ca_topic_score_gemma":0.00025727536,"teacher_disagreement_score":0.9182269,"about_ca_system_score_codex":0.0001550387,"about_ca_system_score_gemma":0.00003516404,"threshold_uncertainty_score":0.9852221},"labels":[],"label_agreement":null},{"id":"W4385833862","doi":"10.1109/tcomm.2023.3299397","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385833862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4386124425","doi":"10.1109/tcomm.2023.3308150","title":"Extreme Learning Machine-Based Channel Estimation in IRS-Assisted Multi-User ISAC System","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":39,"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; Fundamental Research Funds for the Central Universities; State Key Laboratory of Rail Traffic Control and Safety; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Channel (broadcasting); Computer science; Extreme learning machine; Base station; Transmission (telecommunications); Real-time computing; Communications system; Computational complexity theory; Artificial neural network; Computer engineering; Computer network; Algorithm; Artificial intelligence; Telecommunications","score_opus":0.06699789630198195,"score_gpt":0.2853595238666975,"score_spread":0.21836162756471555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386124425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033768842,0.00034095187,0.9874973,0.00076730945,0.00018571496,0.00044344572,0.000046661833,0.0067770598,0.00056466606],"genre_scores_gemma":[0.9705675,0.0007975921,0.027298564,0.00001704846,0.0000029669357,0.00084961316,0.00009586526,0.00008350453,0.00028729922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985928,0.0001981025,0.0004977416,0.00021674452,0.00017834154,0.0003162993],"domain_scores_gemma":[0.9968473,0.0006124157,0.00008568981,0.0023241544,0.00007304892,0.000057409965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025852182,0.0002494211,0.0002541776,0.00089548994,0.0005239606,0.00004426195,0.001157761,0.00019071395,0.000012498449],"category_scores_gemma":[0.00003349729,0.0002947051,0.0000997823,0.0017607111,0.00013282143,0.00025156507,0.000014889265,0.0010113732,0.00028563035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005789017,0.00011841344,0.000028705303,0.000061104976,0.000024718483,0.0000012724379,0.00022261534,0.97702956,0.0015029678,0.00032532326,0.000032463297,0.020647049],"study_design_scores_gemma":[0.0006325438,0.00002046109,0.00079022587,0.0002060813,0.000014460851,0.0000030917047,0.0008045298,0.99134237,0.0048709265,0.00004060045,0.0010078476,0.00026688466],"about_ca_topic_score_codex":0.00006807244,"about_ca_topic_score_gemma":0.0006494473,"teacher_disagreement_score":0.9671907,"about_ca_system_score_codex":0.00044205485,"about_ca_system_score_gemma":0.000031856976,"threshold_uncertainty_score":0.9999505},"labels":[],"label_agreement":null},{"id":"W4386124507","doi":"10.1109/tcomm.2023.3308153","title":"Efficient Constrained Codes That Enable Page Separation in Modern Flash Memories","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Storage Technologies","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":"University of California, San Diego; University of Oxford; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; University of Warwick; California Institute of Technology; York University; Massachusetts Institute of Technology; Princeton University; National Science Foundation","keywords":"Computer science; Decoding methods; Coding (social sciences); Flash memory; Variable-length code; Flash file system; Theoretical computer science; Algorithm; Computer engineering; Computer hardware; Mathematics; Computer memory","score_opus":0.055586202226156456,"score_gpt":0.31395266680229666,"score_spread":0.2583664645761402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386124507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008849537,0.000095025585,0.9838514,0.0030864663,0.00021575594,0.0003612494,0.000095575684,0.001772325,0.0016727104],"genre_scores_gemma":[0.94236255,0.00034869628,0.056470662,0.00006937102,0.0000039013894,0.0002838963,0.000026938247,0.000014186651,0.0004198214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866563,0.00012764269,0.00028617468,0.00035444958,0.00024775253,0.00031837836],"domain_scores_gemma":[0.99627256,0.0005568976,0.00008658958,0.0029666112,0.000067713954,0.000049642764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003045741,0.0001734949,0.00019068294,0.0005193763,0.0005366023,0.00011239821,0.002055223,0.000103601546,0.000008510987],"category_scores_gemma":[0.000027768034,0.00018430423,0.000063903484,0.001617729,0.0003306137,0.00041295405,0.000049335933,0.00040913487,0.00021059923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001771016,0.00064677256,0.000031335465,0.000025611118,0.00005179515,0.000017804123,0.0041034217,0.8343007,0.012964163,0.039736237,0.0008197568,0.10728469],"study_design_scores_gemma":[0.00038017123,0.000045643712,0.00007559693,0.000040383275,0.00000883671,0.000008903702,0.00071754685,0.9587722,0.024825923,0.013590904,0.0012834725,0.00025045223],"about_ca_topic_score_codex":0.00002928616,"about_ca_topic_score_gemma":0.00055321306,"teacher_disagreement_score":0.933513,"about_ca_system_score_codex":0.00014523978,"about_ca_system_score_gemma":0.00008664644,"threshold_uncertainty_score":0.7515708},"labels":[],"label_agreement":null},{"id":"W4386766959","doi":"10.1109/tcomm.2023.3309118","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network; Electrical engineering; Engineering","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386766959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4386869660","doi":"10.1109/tcomm.2023.3317300","title":"Joint Age-Based Client Selection and Resource Allocation for Communication-Efficient Federated Learning Over NOMA Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","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":"Western University","funders":"","keywords":"Computer science; Resource allocation; Selection (genetic algorithm); Convergence (economics); Throughput; Wireless; Noma; Distributed computing; Computer network; Dual (grammatical number); Wireless network; Joint (building); Resource management (computing); Artificial intelligence; Telecommunications; Engineering","score_opus":0.05404172855537724,"score_gpt":0.29405518640086536,"score_spread":0.2400134578454881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386869660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006681635,0.00011513781,0.966115,0.024069805,0.00010423881,0.00069448695,0.000015922195,0.0020267747,0.00017700662],"genre_scores_gemma":[0.9048906,0.0003513531,0.09363154,0.00020223681,0.0000090370995,0.0006462781,0.00013506359,0.00003094904,0.00010296706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981086,0.00038660612,0.0004362655,0.0004749735,0.00023700114,0.0003565477],"domain_scores_gemma":[0.9923468,0.0012271238,0.00019551368,0.0059625623,0.00018527941,0.00008270804],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00090598105,0.00020873512,0.00019678958,0.00046409538,0.002293675,0.0003444384,0.006635235,0.00018248614,0.00000565865],"category_scores_gemma":[0.0006507913,0.00023532304,0.00009283491,0.001672852,0.0002072727,0.00025653382,0.00086150883,0.0007337135,0.000021252496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038852286,0.0005632106,0.00003972394,0.00003342976,0.00009336877,8.806688e-7,0.00038717693,0.90695655,0.0025108752,0.0032974337,0.016566303,0.06951219],"study_design_scores_gemma":[0.0005211841,0.00009346613,0.0008041529,0.00006906427,0.000022426968,0.000003562501,0.000088054905,0.9891445,0.002222291,0.0015086746,0.0052948543,0.00022774095],"about_ca_topic_score_codex":0.00008501829,"about_ca_topic_score_gemma":0.00023658523,"teacher_disagreement_score":0.8982089,"about_ca_system_score_codex":0.00020445754,"about_ca_system_score_gemma":0.000081129976,"threshold_uncertainty_score":0.9990052},"labels":[],"label_agreement":null},{"id":"W4387385575","doi":"10.1109/tcomm.2023.3322174","title":"A Family of Binary Locally Repairable Codes for Coded Distributed Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Stochastic Gradient Optimization Techniques","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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Block code; Decoding methods; Linear code; Matrix multiplication; Computational complexity theory; Concatenated error correction code; Coding (social sciences); Theoretical computer science; Multiplication (music); List decoding; Binary number; Algorithm; Mathematics; Arithmetic","score_opus":0.05301074733122166,"score_gpt":0.30565334862846394,"score_spread":0.25264260129724225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387385575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076445885,0.00004001266,0.99532634,0.0012088827,0.00017529371,0.00060856977,0.00022823698,0.0014119854,0.00023621498],"genre_scores_gemma":[0.6849274,0.000100944664,0.314533,0.00007628245,0.000004097689,0.00018931694,0.000061096805,0.000015455349,0.00009242749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873334,0.0001086813,0.0004525015,0.00027063297,0.00019705035,0.00023780462],"domain_scores_gemma":[0.9962667,0.0011379593,0.00016555775,0.0020157287,0.00034704228,0.00006700188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000420861,0.00013884756,0.00021583434,0.00035159886,0.0005512452,0.000047922866,0.0016641757,0.0000770982,0.0000028717689],"category_scores_gemma":[0.000040908842,0.00015326933,0.00014250934,0.0016608738,0.00016875372,0.00019677487,0.000026981817,0.0001713832,0.000015070443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007843129,0.001715869,0.000033246466,0.0001397056,0.00027359673,0.0000022966237,0.00214251,0.822473,0.018440107,0.1159784,0.009311378,0.02941147],"study_design_scores_gemma":[0.00036948727,0.00019610547,0.00015488866,0.0000861102,0.000022226495,0.0000026747985,0.000101902944,0.98982745,0.006084588,0.002449765,0.0005505819,0.00015420587],"about_ca_topic_score_codex":0.000042399446,"about_ca_topic_score_gemma":0.000014177764,"teacher_disagreement_score":0.6841629,"about_ca_system_score_codex":0.00006355524,"about_ca_system_score_gemma":0.00010318665,"threshold_uncertainty_score":0.6250141},"labels":[],"label_agreement":null},{"id":"W4387709849","doi":"10.1109/tcomm.2023.3320966","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387709849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4388206377","doi":"10.1109/tcomm.2023.3327778","title":"M22: A Communication-Efficient Algorithm for Federated Learning Inspired by Rate-Distortion","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","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; McMaster University","funders":"","keywords":"Computer science; Algorithm; Distortion (music); Computer network; Bandwidth (computing)","score_opus":0.04696945932755964,"score_gpt":0.3033612843625715,"score_spread":0.25639182503501184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388206377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076767616,0.00018475323,0.9646567,0.02950752,0.00024583781,0.0007044772,0.00018845918,0.003412779,0.0003317879],"genre_scores_gemma":[0.6788264,0.0011878266,0.31689635,0.00019734529,0.000008294523,0.0016534758,0.0004663523,0.00004963588,0.00071431074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979846,0.00042004642,0.00046977127,0.0004736054,0.00024863746,0.00040335092],"domain_scores_gemma":[0.98666763,0.0012522055,0.00019595426,0.011538771,0.0002581771,0.00008723341],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00087631255,0.00022420775,0.00021659225,0.00039729115,0.002452838,0.00028584254,0.018786376,0.0001764683,0.000010384426],"category_scores_gemma":[0.00082350924,0.0002535213,0.00012440457,0.0019440547,0.00024850736,0.00042648555,0.0012262926,0.00071121554,0.00018589498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001820939,0.0011837775,0.000007408345,0.000026964595,0.0001786615,0.0000012646215,0.0007309621,0.0144759845,0.005099719,0.0012554844,0.14653459,0.83048695],"study_design_scores_gemma":[0.00038577788,0.00008442652,0.000026234824,0.000042664644,0.000018090097,0.0000029213797,0.00014752617,0.96553874,0.0092593,0.004635855,0.01959169,0.00026679315],"about_ca_topic_score_codex":0.00009957131,"about_ca_topic_score_gemma":0.000071191374,"teacher_disagreement_score":0.95106274,"about_ca_system_score_codex":0.00024466563,"about_ca_system_score_gemma":0.00011077969,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W4388757405","doi":"10.1109/tcomm.2023.3329856","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388757405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4388878400","doi":"10.1109/tcomm.2023.3335414","title":"Multi-Objective Multi-Dimensional Resource Allocation for Categorized QoS Provisioning in Beyond 5G and 6G Radio Access Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Backhaul (telecommunications); Quality of service; Computer network; Provisioning; Resource allocation; Radio access network; Optimization problem; Distributed computing; Mathematical optimization; Base station; Algorithm","score_opus":0.055631326846803365,"score_gpt":0.3173117384049071,"score_spread":0.26168041155810373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388878400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022043441,0.000405591,0.9930942,0.002389351,0.0003844527,0.001018084,0.000020045269,0.00044223346,0.00004167607],"genre_scores_gemma":[0.9002664,0.00039790018,0.09762227,0.00025524086,0.00003887809,0.0010174412,0.000054058946,0.000036288406,0.00031151067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829245,0.00023703628,0.00041266863,0.00050464354,0.00018321899,0.0003699706],"domain_scores_gemma":[0.99641204,0.0017658656,0.00012903943,0.0014232873,0.00015501448,0.000114776034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058997254,0.00021476795,0.0002437638,0.00043105814,0.0009780369,0.00022172296,0.0013424217,0.00015490995,0.0000030716205],"category_scores_gemma":[0.00004135355,0.00022285864,0.00009685724,0.0014806797,0.00012881936,0.0005906727,0.00004547403,0.0004905408,0.000010895351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087771994,0.00076890294,0.00021728809,0.000022893031,0.00008866636,0.0000023187586,0.002406355,0.91778624,0.0005405188,0.0014879946,0.0010421674,0.07554891],"study_design_scores_gemma":[0.001743102,0.00006767513,0.0034425799,0.00006630871,0.000021054151,0.000006388419,0.000095170144,0.9925765,0.0003188752,0.00033506632,0.0010817631,0.00024555545],"about_ca_topic_score_codex":0.00021477771,"about_ca_topic_score_gemma":0.0009216119,"teacher_disagreement_score":0.89806205,"about_ca_system_score_codex":0.000114376664,"about_ca_system_score_gemma":0.0001074908,"threshold_uncertainty_score":0.9087911},"labels":[],"label_agreement":null},{"id":"W4389161164","doi":"10.1109/tcomm.2023.3337785","title":"A Resource-Efficient Coexistence Scheme for Massive Machine-Type and Human-to-Human Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","cited_by":2,"is_retracted":false,"has_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":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Markov chain; Mathematical optimization; Quality of service; Queueing theory; Markov process; Transmission (telecommunications); Resource allocation; Markov model; Distributed computing; Computer network; Mathematics; Machine learning; Telecommunications; Statistics","score_opus":0.07661140621436864,"score_gpt":0.34583299120069194,"score_spread":0.2692215849863233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389161164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03475483,0.0015522204,0.85824263,0.018648984,0.0009959221,0.036305573,0.0016494138,0.0071932324,0.04065719],"genre_scores_gemma":[0.9807137,0.00019091814,0.011119163,0.00014132446,0.00002699878,0.006837978,0.00012446711,0.000070119866,0.0007753112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989591,0.00009081382,0.0003313053,0.0001999417,0.00012306165,0.0002957505],"domain_scores_gemma":[0.99664575,0.00047590988,0.000042537667,0.0025656382,0.00013240789,0.00013775457],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00026923846,0.00019156492,0.00019542145,0.00026294525,0.0015727798,0.00008053803,0.0010859884,0.00010306444,0.000022822895],"category_scores_gemma":[0.00000996502,0.00021410432,0.000078086756,0.0009724064,0.00018589248,0.000055394827,0.000028040457,0.00043492106,0.00009296958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073571435,0.0007787805,0.00005661526,0.00027550635,0.00038792286,0.0000018750245,0.0052027535,0.8982309,0.024997402,0.029179646,0.025248725,0.015566316],"study_design_scores_gemma":[0.0008537975,0.00026570132,0.0003262425,0.00023023934,0.00007505286,0.000005227139,0.00040218938,0.7460993,0.0012827641,0.0006418313,0.24926068,0.00055697793],"about_ca_topic_score_codex":0.000037213147,"about_ca_topic_score_gemma":0.00027138146,"teacher_disagreement_score":0.9459589,"about_ca_system_score_codex":0.00007898512,"about_ca_system_score_gemma":0.000019903782,"threshold_uncertainty_score":0.999727},"labels":[],"label_agreement":null},{"id":"W4389252359","doi":"10.1109/tcomm.2023.3338737","title":"Near-Field Beamforming Optimization for Holographic XL-MIMO Multiuser Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Beamforming; Computer science; MIMO; Electronic engineering; Overhead (engineering); Weighting; Antenna (radio); Telecommunications link; Interference (communication); Optimization problem; Algorithm; Mathematical optimization; Engineering; Mathematics; Channel (broadcasting); Telecommunications; Physics; Acoustics","score_opus":0.035924376837295345,"score_gpt":0.2651196178104822,"score_spread":0.22919524097318686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389252359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011355776,0.0002053461,0.9962864,0.00045162832,0.0002838997,0.00032413006,0.000054794775,0.00092199,0.00033626],"genre_scores_gemma":[0.9829931,0.001567639,0.014337236,0.000053628843,0.000019102597,0.000491184,0.000057220557,0.00004600199,0.00043487057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926466,0.00003872651,0.00025913084,0.00013118949,0.000093743234,0.0002125281],"domain_scores_gemma":[0.9985626,0.00038580678,0.00003221262,0.0008774816,0.000081396414,0.000060541708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015832362,0.00013224273,0.00015931154,0.0003135259,0.0005878948,0.000077075994,0.00039278966,0.000109935485,0.000023859871],"category_scores_gemma":[0.000008862077,0.00014160138,0.00016366507,0.0009540666,0.000053643314,0.00015534906,0.0000022254017,0.00021671155,0.000065224194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047721305,0.000041582472,0.000011710407,0.000028679788,0.00010912364,2.5323425e-7,0.00022619627,0.99580663,0.0013517352,0.00007803079,0.00039183602,0.0019494424],"study_design_scores_gemma":[0.00020836391,0.000030260551,0.000013385044,0.00004026202,0.00008477144,0.00000174112,0.0003690597,0.9962503,0.00034068146,0.000022493781,0.00248851,0.00015020273],"about_ca_topic_score_codex":0.000040086623,"about_ca_topic_score_gemma":0.00005988279,"teacher_disagreement_score":0.98194915,"about_ca_system_score_codex":0.00003193298,"about_ca_system_score_gemma":0.000013925964,"threshold_uncertainty_score":0.5774337},"labels":[],"label_agreement":null},{"id":"W4389692244","doi":"10.1109/tcomm.2023.3342237","title":"Media-Based Modulation for Next-Generation Wireless: Latest Progress and New Applications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Computer science; Transmitter; MIMO; Bit error rate; Channel state information; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Computer engineering; Engineering","score_opus":0.11169321078531082,"score_gpt":0.29868933042418583,"score_spread":0.18699611963887502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389692244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028499076,0.0005929097,0.98804426,0.0038697869,0.0001288155,0.0011028292,0.00011691689,0.003179872,0.000114673676],"genre_scores_gemma":[0.94932103,0.002671834,0.04411404,0.000045549914,0.00003972283,0.0033141312,0.00033092703,0.00006934997,0.00009342644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990059,0.000042102343,0.00035169034,0.00022850277,0.00013686766,0.0002348984],"domain_scores_gemma":[0.99719214,0.00068061316,0.0000682075,0.0018310737,0.000113574024,0.00011436473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013316236,0.00020377157,0.00018548271,0.00040996616,0.00061467604,0.00008688516,0.0006889022,0.00016448366,0.00001137542],"category_scores_gemma":[0.000018163813,0.00023866573,0.000072375464,0.00093093683,0.00022263115,0.00032042494,0.000008889403,0.00029622615,0.000059562626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008749042,0.000120938916,0.000025522513,0.000054445634,0.000053281543,9.967374e-8,0.00023739084,0.57195294,0.011801002,0.0037079146,0.0011888987,0.41084886],"study_design_scores_gemma":[0.00047448362,0.000030290257,0.00017368609,0.000033191267,0.000027765604,0.0000011168647,0.00014141855,0.9700187,0.014465464,0.0016506313,0.012719987,0.00026329118],"about_ca_topic_score_codex":0.000008452924,"about_ca_topic_score_gemma":0.00019671908,"teacher_disagreement_score":0.9464711,"about_ca_system_score_codex":0.000105930965,"about_ca_system_score_gemma":0.000057404588,"threshold_uncertainty_score":0.9732506},"labels":[],"label_agreement":null},{"id":"W4389799364","doi":"10.1109/tcomm.2023.3342242","title":"Secure Offloading in NOMA-Enabled Multi-Access Edge Computing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 Windsor","funders":"Fundamental Research Funds for the Central Universities; Australian Research Council; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Eavesdropping; Mobile edge computing; Transmitter power output; Base station; Wireless; Performance metric; Computation offloading; Wireless network; Decoding methods; Node (physics); Edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Algorithm; Channel (broadcasting); Server; Transmitter","score_opus":0.05679806892226748,"score_gpt":0.3131329780830248,"score_spread":0.25633490916075735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389799364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012359691,0.00054860744,0.98051816,0.000618129,0.00033266336,0.00039733644,0.000022941716,0.0041494747,0.0010530135],"genre_scores_gemma":[0.9835845,0.0045798314,0.011343354,0.000040804018,0.000011129127,0.00023783927,0.000035798595,0.0000723192,0.00009437634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986901,0.000105434076,0.00046719797,0.00021647435,0.000115682466,0.00040505835],"domain_scores_gemma":[0.99657,0.0007622269,0.00006523867,0.002480924,0.00006173694,0.000059887196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022105455,0.00023072319,0.00025558675,0.0006625121,0.0005126247,0.00008116708,0.0021619329,0.00019146616,0.000019442134],"category_scores_gemma":[0.000023653534,0.0002796892,0.000087517314,0.0023402744,0.00015932618,0.00038610905,0.000047342608,0.0011238693,0.000105842446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025218928,0.00008649157,0.000080456135,0.000015852167,0.000028329105,0.0000013001467,0.000304949,0.97123,0.00059046195,0.00029141313,0.00016131692,0.027206916],"study_design_scores_gemma":[0.00042784767,0.00001002189,0.0009995431,0.00015422153,0.000008623315,0.0000029078612,0.00044450688,0.99371815,0.002531787,0.0001768299,0.0012459314,0.0002796313],"about_ca_topic_score_codex":0.000037260674,"about_ca_topic_score_gemma":0.0006564586,"teacher_disagreement_score":0.97122484,"about_ca_system_score_codex":0.0002122979,"about_ca_system_score_gemma":0.000021095202,"threshold_uncertainty_score":0.99996555},"labels":[],"label_agreement":null},{"id":"W4389887843","doi":"10.1109/tcomm.2023.3337957","title":"IEEE Transactions on Communications Publication Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.0607253098547467,"score_gpt":0.3039589558871199,"score_spread":0.2432336460323732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389887843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039824346,0.00004534051,0.9418531,0.045873456,0.0013557675,0.0007409181,0.00013253995,0.002891465,0.0067091547],"genre_scores_gemma":[0.98037165,0.00096140715,0.013148413,0.0013140717,0.000021743552,0.0017069833,0.000108407774,0.000031177162,0.0023361137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731404,0.0004196557,0.00088910316,0.00041818043,0.00047137917,0.00048767432],"domain_scores_gemma":[0.98911566,0.00087958394,0.00032706856,0.008922194,0.0005526647,0.00020282023],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007829407,0.00032072613,0.0002811469,0.0016339006,0.0024725788,0.00039153223,0.005664959,0.0003398221,0.00007897329],"category_scores_gemma":[0.000030529092,0.0003542087,0.00023143359,0.0041273786,0.0003850725,0.0024067375,0.0000146702505,0.0011014091,0.006662521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999373,0.0033378657,0.00003226135,0.0000802611,0.00046251158,0.0000013759305,0.013754657,0.016807267,0.0013171242,0.1451023,0.046188723,0.77286464],"study_design_scores_gemma":[0.0021703367,0.0005494647,0.0010484238,0.00026796642,0.00016932335,0.00010722259,0.0032112547,0.4400853,0.022217203,0.007199991,0.5211161,0.0018574409],"about_ca_topic_score_codex":0.00011362804,"about_ca_topic_score_gemma":0.00016583533,"teacher_disagreement_score":0.97997344,"about_ca_system_score_codex":0.00027562337,"about_ca_system_score_gemma":0.00029206186,"threshold_uncertainty_score":0.999891},"labels":[],"label_agreement":null},{"id":"W4390204295","doi":"10.1109/tcomm.2023.3346930","title":"Analysis of One-Bit Quantized Linear Precoding Schemes in Multi-Cell Massive MIMO Downlink","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Precoding; Telecommunications link; MIMO; Converters; Zero-forcing precoding; Electronic engineering; Computer science; Quantization (signal processing); Multi-user MIMO; Bit error rate; Algorithm; Mathematics; Channel (broadcasting); Engineering; Decoding methods; Telecommunications; Electrical engineering","score_opus":0.06886396547341693,"score_gpt":0.3110609133776165,"score_spread":0.24219694790419954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390204295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012272414,0.00021045962,0.98582953,0.00012499382,0.00013178831,0.00036863735,0.00014276011,0.000475627,0.000443764],"genre_scores_gemma":[0.9387144,0.001681777,0.059042633,0.000005735418,0.000004556487,0.0001812264,0.000093545765,0.000038701462,0.00023743563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885535,0.00009818103,0.00055242283,0.00017669825,0.00011699512,0.0002003407],"domain_scores_gemma":[0.9981052,0.0003980167,0.000097266966,0.0012454905,0.00010374334,0.000050269664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018648793,0.00015474414,0.0003515341,0.0012426946,0.00013766224,0.000013249415,0.00045114322,0.000116917625,0.000037606573],"category_scores_gemma":[0.000015367958,0.00018944778,0.00016994319,0.0033620254,0.00005916839,0.0001871713,0.000005448932,0.0003314991,0.00006397435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006393959,0.00018807757,0.00009449268,0.000042583793,0.00027101795,2.9433798e-7,0.0006275389,0.9870376,0.010615981,0.000031859876,0.000007317399,0.0010768174],"study_design_scores_gemma":[0.0006009169,0.000012752726,0.00021108544,0.000071314316,0.00025379876,1.612856e-7,0.00033901003,0.9810538,0.017141612,0.0000075581515,0.00014251913,0.00016547182],"about_ca_topic_score_codex":0.00007314956,"about_ca_topic_score_gemma":0.0009826246,"teacher_disagreement_score":0.9267869,"about_ca_system_score_codex":0.0001150996,"about_ca_system_score_gemma":0.000023021286,"threshold_uncertainty_score":0.7725456},"labels":[],"label_agreement":null},{"id":"W4390357257","doi":"10.1109/tcomm.2023.3347768","title":"IRS-Assisted Covert Communication With Equal and Unequal Transmit Prior Probabilities","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Covert; Transmitter power output; Transmission (telecommunications); Computer science; Signal-to-noise ratio (imaging); Wireless; Throughput; Statistical power; Computer network; Power (physics); Algorithm; Channel (broadcasting); Mathematics; Telecommunications; Transmitter; Statistics","score_opus":0.03447038401678132,"score_gpt":0.25948539314202695,"score_spread":0.22501500912524564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390357257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17531896,0.0032555878,0.77200675,0.009882667,0.00023127465,0.0033858025,0.0005125123,0.015862912,0.019543521],"genre_scores_gemma":[0.97311795,0.008327436,0.017194368,0.00007271065,0.00000594004,0.00089526805,0.0000880209,0.00008589125,0.00021242973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843824,0.00029457873,0.000465038,0.00023037803,0.00026716953,0.00030460051],"domain_scores_gemma":[0.9952808,0.0010118488,0.00006638698,0.0033790846,0.0001454289,0.0001164455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003708211,0.00028314764,0.0002890649,0.00037558074,0.0008022039,0.00011404279,0.0012439472,0.00016699063,0.00003893048],"category_scores_gemma":[0.000008448452,0.00029367502,0.00008179681,0.00096275605,0.0005235758,0.00039857725,0.000019011237,0.00075148244,0.000066483146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040119598,0.0027786442,0.00022062563,0.0011562166,0.0015578103,0.000007942738,0.052382387,0.08975737,0.017409729,0.064717755,0.0062406263,0.7633697],"study_design_scores_gemma":[0.0060159247,0.0011917716,0.006325129,0.0018840574,0.00068571494,0.00013850468,0.010838764,0.78943247,0.053903274,0.011977089,0.1134392,0.0041680783],"about_ca_topic_score_codex":0.00009968853,"about_ca_topic_score_gemma":0.0011944324,"teacher_disagreement_score":0.797799,"about_ca_system_score_codex":0.00015857925,"about_ca_system_score_gemma":0.00006081874,"threshold_uncertainty_score":0.99995154},"labels":[],"label_agreement":null},{"id":"W4390357323","doi":"10.1109/tcomm.2023.3347772","title":"Coded Reactive Stragglers Mitigation in Distributed Computing Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Redundancy (engineering); Computer science; Erasure; Erasure code; Exploit; Computation; Distributed computing; Real-time computing; Decoding methods; Algorithm; Computer security; Operating system","score_opus":0.040177227710613383,"score_gpt":0.29294832556789424,"score_spread":0.25277109785728086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390357323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021120189,0.00002058979,0.9932513,0.0017236662,0.00034114005,0.0005305542,0.000067268054,0.0013214069,0.0006320224],"genre_scores_gemma":[0.97211283,0.00007082982,0.027419075,0.000047419413,0.000006725159,0.00018906676,0.00007337468,0.000015727323,0.000064955864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853724,0.00023159274,0.00041336005,0.00030599308,0.00024820297,0.0002635944],"domain_scores_gemma":[0.9972974,0.0007034684,0.00013734358,0.0016301759,0.00015419158,0.00007741873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037116776,0.00015064843,0.00017500894,0.0005794682,0.00041514824,0.00013564051,0.0013355024,0.00009168633,0.0000030058586],"category_scores_gemma":[0.000026788694,0.00017462611,0.00006502365,0.0024809164,0.00010748557,0.00038981056,0.0000174046,0.00035997,0.000066172746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010667256,0.00050054345,0.000076428674,0.000022553937,0.000061199724,0.000005386858,0.0031040641,0.913403,0.0013023311,0.06997517,0.0007773103,0.010761386],"study_design_scores_gemma":[0.00030319137,0.000044533594,0.0006328541,0.000103539285,0.000008082906,0.0000069113826,0.00033869763,0.9951619,0.0017417591,0.0013196998,0.00015851416,0.00018032627],"about_ca_topic_score_codex":0.00013465308,"about_ca_topic_score_gemma":0.000065422726,"teacher_disagreement_score":0.9700008,"about_ca_system_score_codex":0.00025403788,"about_ca_system_score_gemma":0.00007269794,"threshold_uncertainty_score":0.7121046},"labels":[],"label_agreement":null},{"id":"W4390494415","doi":"10.1109/tcomm.2023.3349166","title":"Energy-Delay Tradeoff in Helper-Assisted NOMA-MEC Systems: A Four-Sided Matching Algorithm","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Karush–Kuhn–Tucker conditions; Mathematical optimization; Energy consumption; Optimization problem; Algorithm; Convex optimization; Mobile edge computing; Blossom algorithm; Resource allocation; Computational complexity theory; Energy (signal processing); Matching (statistics); Enhanced Data Rates for GSM Evolution; Mathematics; Regular polygon; Computer network; Engineering","score_opus":0.03402669637067395,"score_gpt":0.2610717514449532,"score_spread":0.22704505507427925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390494415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014066545,0.007210472,0.98331463,0.0010940906,0.0005917319,0.00030702286,0.00011876193,0.0037880563,0.0021685536],"genre_scores_gemma":[0.96077615,0.007029576,0.030838825,0.000030822877,0.000016140684,0.0009332569,0.00003042759,0.000094980925,0.00024979343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998333,0.00017237847,0.00063860026,0.00029319458,0.00021108017,0.00035174473],"domain_scores_gemma":[0.9961198,0.00086405664,0.000046405316,0.0028398442,0.00005350538,0.000076404394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019634882,0.00031429695,0.0003235495,0.0007937098,0.00033635108,0.00015966843,0.0014991866,0.000241265,0.00002485289],"category_scores_gemma":[0.0000067500664,0.0003516944,0.00015110828,0.0013026132,0.00016759796,0.00044762823,0.000016906473,0.0011016839,0.000082476625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049644773,0.0003026829,0.0000015695449,0.00012270636,0.00022312065,0.000021298358,0.0013297651,0.46991134,0.0057704514,0.008843927,0.00023778075,0.5132304],"study_design_scores_gemma":[0.00035686768,0.000038494785,0.00002745414,0.00073540217,0.000043715692,0.000114701776,0.0018831498,0.9728388,0.0044979714,0.0017690808,0.017163143,0.00053121976],"about_ca_topic_score_codex":0.00030691124,"about_ca_topic_score_gemma":0.00084241806,"teacher_disagreement_score":0.95936954,"about_ca_system_score_codex":0.00048636153,"about_ca_system_score_gemma":0.00005800812,"threshold_uncertainty_score":0.9998935},"labels":[],"label_agreement":null},{"id":"W4390873725","doi":"10.1109/tcomm.2024.3354204","title":"RL-Based Hyperparameter Selection for Spectrum Sensing With CNNs","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Hyperparameter; Computer science; Convolutional neural network; Selection (genetic algorithm); Artificial intelligence; Reinforcement learning; Cognitive radio; Detector; Hyperparameter optimization; Machine learning; Artificial neural network; Channel (broadcasting); Pattern recognition (psychology); Wireless","score_opus":0.02687445469216907,"score_gpt":0.2662217112580339,"score_spread":0.23934725656586484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390873725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022984398,0.00009066888,0.9915916,0.0055263382,0.0005797104,0.00035532625,0.000043418215,0.0009035382,0.00067959994],"genre_scores_gemma":[0.8053125,0.000036617017,0.19383934,0.00025116283,0.00003967497,0.00008045855,0.000011142735,0.00002530206,0.00040375566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890643,0.000085830674,0.0002168426,0.00035844592,0.00017296331,0.00025949313],"domain_scores_gemma":[0.9980473,0.00054993725,0.000040722723,0.001163793,0.00010930348,0.00008893337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015725214,0.00017059929,0.00013794596,0.00026407273,0.00070446887,0.00044373746,0.000554081,0.00008154051,0.00001747545],"category_scores_gemma":[0.0000031789948,0.0001552073,0.00014480544,0.0010984412,0.00008721706,0.00031456092,0.000003447972,0.00038124764,0.00005027427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012561222,0.0008178078,0.0000043049113,0.00007916308,0.00042656893,0.000007373912,0.00048273857,0.41897273,0.001816839,0.01886718,0.002955848,0.5554438],"study_design_scores_gemma":[0.00025992375,0.00024568755,0.0000066723674,0.00006436945,0.000045217683,0.00004947084,0.00001785672,0.9601009,0.008258047,0.0008755142,0.029877158,0.00019917221],"about_ca_topic_score_codex":0.00004484922,"about_ca_topic_score_gemma":0.00028882624,"teacher_disagreement_score":0.8050827,"about_ca_system_score_codex":0.00012831119,"about_ca_system_score_gemma":0.00012899676,"threshold_uncertainty_score":0.632917},"labels":[],"label_agreement":null},{"id":"W4390908051","doi":"10.1109/tcomm.2023.3348311","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390908051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011699929,0.00033613548,0.9392879,0.045855492,0.0020617396,0.0006646474,0.00013563015,0.002383658,0.009157805],"genre_scores_gemma":[0.9733114,0.0010737213,0.020894216,0.0011752152,0.000029623943,0.001368549,0.000059118724,0.000032783915,0.0020553467],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747074,0.00036851256,0.0008708011,0.00045885294,0.00042653145,0.00040457788],"domain_scores_gemma":[0.99057126,0.00088828045,0.00018528744,0.007731511,0.00043522174,0.00018843378],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065514346,0.00033305198,0.0002585003,0.0013797267,0.001786969,0.00080998166,0.004880835,0.00034102544,0.000121740646],"category_scores_gemma":[0.00001777561,0.0003512709,0.0002615118,0.0026190698,0.00038524353,0.0031767765,0.000010525398,0.0013742094,0.0037803506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021368964,0.0018026914,0.0000042994716,0.00009522854,0.00036722815,0.0000011597667,0.008060757,0.003719784,0.00067643553,0.21922427,0.017495774,0.748531],"study_design_scores_gemma":[0.0006835571,0.00032432863,0.00009855005,0.0003769403,0.00015229855,0.00014280567,0.0010395242,0.35684574,0.013472281,0.0050490396,0.6207647,0.0010502496],"about_ca_topic_score_codex":0.00011175275,"about_ca_topic_score_gemma":0.00014409097,"teacher_disagreement_score":0.9731944,"about_ca_system_score_codex":0.00037338908,"about_ca_system_score_gemma":0.00041168413,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W4391092817","doi":"10.1109/tcomm.2024.3356792","title":"Joint Port Selection Based Channel Acquisition for FDD Cell-Free Massive MIMO","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; Joint (building); Selection (genetic algorithm); Computer science; Channel (broadcasting); Electronic engineering; Port (circuit theory); Telecommunications; Engineering","score_opus":0.023577014986526444,"score_gpt":0.2511629988034114,"score_spread":0.22758598381688497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391092817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000085213025,0.0005065643,0.99285847,0.001100764,0.000906776,0.0008547952,0.0002968257,0.001384339,0.0020062332],"genre_scores_gemma":[0.9531649,0.00029749313,0.04419015,0.000071143026,0.000070603586,0.0013671383,0.00014181867,0.00010878716,0.0005880209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989594,0.000054519533,0.0003802206,0.00024355802,0.00012484286,0.00023742826],"domain_scores_gemma":[0.9983427,0.00022880804,0.000045261735,0.001151893,0.00015351546,0.00007785496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015600385,0.00021780822,0.00018389712,0.00038851204,0.0003998124,0.00008216339,0.0003683417,0.00014766825,0.000058752776],"category_scores_gemma":[0.00000615019,0.00025404786,0.00017149797,0.00057044055,0.000046566678,0.00034934343,0.000002764795,0.00032901776,0.00006815583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010007247,0.00010364858,2.1067869e-7,0.00017811214,0.00005358028,4.6184005e-7,0.00017734081,0.9840705,0.0105082365,0.00029173892,0.0027855015,0.0018206679],"study_design_scores_gemma":[0.00042235592,0.00007403908,0.0000044157937,0.00015443085,0.00009159508,0.000006029114,0.0001002501,0.94161654,0.052966613,0.00059401453,0.003717419,0.00025228676],"about_ca_topic_score_codex":0.000014032588,"about_ca_topic_score_gemma":0.00007532157,"teacher_disagreement_score":0.95307964,"about_ca_system_score_codex":0.00035208606,"about_ca_system_score_gemma":0.00006505052,"threshold_uncertainty_score":0.9999912},"labels":[],"label_agreement":null},{"id":"W4391467973","doi":"10.1109/tcomm.2024.3361504","title":"Two-Timescale Design for Simultaneous Transmitting and Reflecting RIS-Assisted Massive MIMO Systems With Imperfect CSI","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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":"Fundamental Research Funds for the Central Universities; Southeast University; National Natural Science Foundation of China","keywords":"MIMO; Imperfect; Electronic engineering; Computer science; Telecommunications; Engineering; Beamforming","score_opus":0.03868857414904158,"score_gpt":0.28771474013117754,"score_spread":0.24902616598213595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391467973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011643869,0.0029814627,0.99367744,0.0002751436,0.0001322693,0.0005262827,0.000060771377,0.0007151638,0.00046708522],"genre_scores_gemma":[0.9718811,0.0006022001,0.026609037,0.000014754675,0.00002733537,0.00034532134,0.000009667667,0.000076767974,0.00043380033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989637,0.00013270896,0.00029991535,0.00023931738,0.00011059942,0.00025374003],"domain_scores_gemma":[0.997121,0.002044426,0.000030603245,0.000628648,0.00008496473,0.00009038156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002460701,0.00022260171,0.00025420086,0.00023788755,0.00064205006,0.00019462532,0.00026295922,0.000085410735,0.0000085992515],"category_scores_gemma":[0.000007995934,0.00020039632,0.00012703582,0.0005388275,0.00009979199,0.0001556264,0.0000014474263,0.00039740364,0.000011460032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006452452,0.00013661527,0.0000036860677,0.00042748562,0.0012117549,0.000015427951,0.0022405593,0.8875917,0.071105696,0.00024289048,0.00009302571,0.03686659],"study_design_scores_gemma":[0.0003429958,0.00011705735,0.0000018281067,0.00034306894,0.00041951382,0.000047893274,0.00089557207,0.9950767,0.0020405888,0.0000287126,0.0004385328,0.00024752534],"about_ca_topic_score_codex":0.000064706954,"about_ca_topic_score_gemma":0.000105580824,"teacher_disagreement_score":0.9707167,"about_ca_system_score_codex":0.000100234116,"about_ca_system_score_gemma":0.000039056886,"threshold_uncertainty_score":0.8171925},"labels":[],"label_agreement":null},{"id":"W4391677760","doi":"10.1109/tcomm.2024.3362973","title":"Performance of Multi-RIS-Aided Cell-Free Massive MIMO: Do More RISs Always Help?","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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 British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Computer science; MIMO; Rician fading; Throughput; Spectral efficiency; Channel state information; Beamforming; Channel (broadcasting); Electronic engineering; Algorithm; Wireless; Fading; Computer network; Engineering; Telecommunications","score_opus":0.026610401920520225,"score_gpt":0.26838194155181927,"score_spread":0.24177153963129905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391677760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052369487,0.009632979,0.9263274,0.002016737,0.00054446456,0.0006803727,0.00041633143,0.0039649913,0.004047216],"genre_scores_gemma":[0.93828124,0.016510334,0.044418287,0.000015351965,0.0000073303845,0.00036502234,0.000018207313,0.00007776075,0.00030646226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987617,0.000061123574,0.00049852487,0.00022293304,0.00019637158,0.00025934543],"domain_scores_gemma":[0.9945451,0.0004632255,0.00006771064,0.0047407607,0.00012029372,0.00006292186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117493386,0.00026393883,0.00026497326,0.00043336782,0.00032958915,0.000045837824,0.0024099166,0.00018812179,0.000057729132],"category_scores_gemma":[0.000013867076,0.00028495965,0.00015607449,0.0008659029,0.0003896843,0.0003643086,0.000035603935,0.0009353887,0.00011079382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014750152,0.00043378328,0.000033039905,0.00039048272,0.00019944011,0.0000017807984,0.00203216,0.87883824,0.035828892,0.00074979366,0.0010208499,0.0804568],"study_design_scores_gemma":[0.000481871,0.000073292525,0.00014365597,0.0003431641,0.00006802983,0.000006502404,0.0012079827,0.7767373,0.21361193,0.00024505547,0.006674171,0.00040706183],"about_ca_topic_score_codex":0.000020731994,"about_ca_topic_score_gemma":0.00004409451,"teacher_disagreement_score":0.88591176,"about_ca_system_score_codex":0.00016150341,"about_ca_system_score_gemma":0.00004604273,"threshold_uncertainty_score":0.99996024},"labels":[],"label_agreement":null},{"id":"W4391849703","doi":"10.1109/tcomm.2024.3359723","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391849703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011699929,0.00033613548,0.9392879,0.045855492,0.0020617396,0.0006646474,0.00013563015,0.002383658,0.009157805],"genre_scores_gemma":[0.9733114,0.0010737213,0.020894216,0.0011752152,0.000029623943,0.001368549,0.000059118724,0.000032783915,0.0020553467],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747074,0.00036851256,0.0008708011,0.00045885294,0.00042653145,0.00040457788],"domain_scores_gemma":[0.99057126,0.00088828045,0.00018528744,0.007731511,0.00043522174,0.00018843378],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065514346,0.00033305198,0.0002585003,0.0013797267,0.001786969,0.00080998166,0.004880835,0.00034102544,0.000121740646],"category_scores_gemma":[0.00001777561,0.0003512709,0.0002615118,0.0026190698,0.00038524353,0.0031767765,0.000010525398,0.0013742094,0.0037803506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021368964,0.0018026914,0.0000042994716,0.00009522854,0.00036722815,0.0000011597667,0.008060757,0.003719784,0.00067643553,0.21922427,0.017495774,0.748531],"study_design_scores_gemma":[0.0006835571,0.00032432863,0.00009855005,0.0003769403,0.00015229855,0.00014280567,0.0010395242,0.35684574,0.013472281,0.0050490396,0.6207647,0.0010502496],"about_ca_topic_score_codex":0.00011175275,"about_ca_topic_score_gemma":0.00014409097,"teacher_disagreement_score":0.9731944,"about_ca_system_score_codex":0.00037338908,"about_ca_system_score_gemma":0.00041168413,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W4391878022","doi":"10.1109/tcomm.2024.3366816","title":"Multi-Band Wireless Communication Networks: Fundamentals, Challenges, and Resource Allocation","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":49,"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; University of Victoria; University of Guelph; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless; Computer science; Computer network; Resource allocation; Wireless network; Resource management (computing); Telecommunications; Radio resource management; Distributed computing","score_opus":0.03237932125287004,"score_gpt":0.2570997276444319,"score_spread":0.22472040639156185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391878022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007900851,0.056494594,0.93759936,0.0011835141,0.000247844,0.00042176017,0.000025630268,0.0012930327,0.0019441615],"genre_scores_gemma":[0.84506017,0.14285015,0.011406821,0.0000440365,0.00002701039,0.00026313603,0.00008624846,0.0000843131,0.00017813637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988625,0.0001572121,0.00035070552,0.0002626918,0.00013391908,0.00023297315],"domain_scores_gemma":[0.99788445,0.00042661547,0.000036981142,0.0015040999,0.000049607326,0.00009825708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021308722,0.00023798236,0.0001823378,0.00021128716,0.00043639148,0.000115912444,0.0004744399,0.00015584934,0.000016365808],"category_scores_gemma":[0.0000023589187,0.00027566974,0.00006203577,0.00038347958,0.000192938,0.00041301805,0.000007652998,0.00059442804,0.000030317377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007311792,0.00010578819,0.0000010197745,0.000065577784,0.00009423827,5.3491385e-7,0.0009591376,0.78082275,0.0005834633,0.0014225086,0.00023114977,0.2157065],"study_design_scores_gemma":[0.0002619933,0.000024346808,0.000060209677,0.00030386692,0.000056936784,0.000012575983,0.0003373654,0.98234546,0.0007088145,0.00011894718,0.015498045,0.00027144188],"about_ca_topic_score_codex":0.000009955187,"about_ca_topic_score_gemma":0.00027791914,"teacher_disagreement_score":0.9261926,"about_ca_system_score_codex":0.00018600991,"about_ca_system_score_gemma":0.000016988595,"threshold_uncertainty_score":0.99996954},"labels":[],"label_agreement":null},{"id":"W4391952694","doi":"10.1109/tcomm.2024.3367941","title":"Spectrally-Efficient Beamforming Design for STAR-RIS-Aided URLLC NOMA Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"National Science and Technology Council","keywords":"Noma; Beamforming; Computer science; Star (game theory); Electronic engineering; Telecommunications; Engineering; Telecommunications link; Physics","score_opus":0.051019262363660486,"score_gpt":0.2807499190507882,"score_spread":0.22973065668712772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391952694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008570339,0.004705651,0.9870169,0.00079805567,0.0006548291,0.0010970461,0.0001488911,0.003979327,0.0007422754],"genre_scores_gemma":[0.8834484,0.0025493053,0.11198301,0.000016263064,0.000018213663,0.0016133313,0.00002114869,0.000095091986,0.00025519423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986827,0.00007331551,0.0004842335,0.00024557003,0.00016450287,0.00034967347],"domain_scores_gemma":[0.9959977,0.001198361,0.000043477845,0.0026064776,0.00009332869,0.0000606097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026980566,0.00026357695,0.00024355784,0.00043181336,0.0005729403,0.0001535278,0.001359559,0.0001570799,0.000015984602],"category_scores_gemma":[0.000015161029,0.00028404384,0.0001581532,0.00066280866,0.00016869494,0.00022982241,0.000010198683,0.0006406457,0.00009701431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093851595,0.00009547523,1.3358274e-7,0.00009517493,0.00011148595,5.8031816e-7,0.00032192943,0.97459495,0.0037574947,0.0056392043,0.00048793497,0.014886257],"study_design_scores_gemma":[0.00019363317,0.00006488256,0.0000021124392,0.00019583761,0.000048162412,0.000012610974,0.0005334464,0.94815814,0.026969852,0.0006447847,0.022868391,0.0003081179],"about_ca_topic_score_codex":0.000017158816,"about_ca_topic_score_gemma":0.00003252136,"teacher_disagreement_score":0.8825914,"about_ca_system_score_codex":0.0003782293,"about_ca_system_score_gemma":0.00005916899,"threshold_uncertainty_score":0.9999612},"labels":[],"label_agreement":null},{"id":"W4391952742","doi":"10.1109/tcomm.2024.3367784","title":"Performance Analysis of User-Centric Clustering and Limited Cooperation in Cell Free Architecture","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Natural Science Foundation of Inner Mongolia; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Computer architecture; User-centered design; Architecture; Computer network; Human–computer interaction; Artificial intelligence","score_opus":0.012390946427618512,"score_gpt":0.22926695424423663,"score_spread":0.21687600781661812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391952742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051209968,0.000764343,0.94664526,0.00008991066,0.00011288354,0.00020737654,0.00005897528,0.00019244982,0.00071883237],"genre_scores_gemma":[0.9881468,0.0025402745,0.0091077015,0.00000684854,0.0000045866655,0.00006107151,0.000026605314,0.000023363113,0.00008277116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993749,0.000045628178,0.00028828677,0.00012299154,0.00006414156,0.00010405542],"domain_scores_gemma":[0.998979,0.00016734921,0.00002206757,0.0007652267,0.000036514848,0.000029839837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008379009,0.00010730818,0.00016279923,0.0008857423,0.00008338116,0.00002909629,0.00022793896,0.00006475628,0.000012969592],"category_scores_gemma":[0.000003257634,0.000117506694,0.00004843372,0.0019166477,0.00003695184,0.00018757391,0.000004260942,0.00025673248,0.000003232444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036010024,0.000035518577,0.000045061937,0.000097906144,0.000090147645,2.1440681e-7,0.0006744076,0.99012,0.0027374197,0.000021670714,0.000007837959,0.0061662397],"study_design_scores_gemma":[0.00016250041,0.000018084507,0.00034619612,0.00009058178,0.0001739673,0.0000016813741,0.000054971948,0.9964376,0.0023645714,0.0000045007587,0.00024400838,0.000101327365],"about_ca_topic_score_codex":0.000031567124,"about_ca_topic_score_gemma":0.0008467968,"teacher_disagreement_score":0.93753755,"about_ca_system_score_codex":0.00008086219,"about_ca_system_score_gemma":0.000013340204,"threshold_uncertainty_score":0.4791784},"labels":[],"label_agreement":null},{"id":"W4392172655","doi":"10.1109/tcomm.2024.3369731","title":"Performance-Complexity-Latency Trade-Offs of Concatenated RS-BCH Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"BCH code; Computer science; Concatenated error correction code; Serial concatenated convolutional codes; Turbo code; Decoding methods; Block code; Algorithm","score_opus":0.07034727249593856,"score_gpt":0.3143094297924595,"score_spread":0.24396215729652096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012188658,0.0004550608,0.970038,0.0044397735,0.0007222409,0.00038346744,0.00004134646,0.0023329833,0.009398471],"genre_scores_gemma":[0.9395825,0.00080599857,0.059075616,0.000081860184,0.000010437011,0.00011590399,0.000007000426,0.000026401183,0.00029427145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842274,0.00019967477,0.00049609394,0.0003502542,0.00026956273,0.00026166494],"domain_scores_gemma":[0.9966069,0.0005480565,0.000092082424,0.002567117,0.000105810264,0.00008004931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039778833,0.00020822902,0.0002487847,0.0004450428,0.00046077208,0.00011319734,0.0025518234,0.000115920884,0.000038712325],"category_scores_gemma":[0.000008597671,0.0002066418,0.00017091045,0.0013435871,0.0003367229,0.0005743553,0.000022477965,0.00068490015,0.000075533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006430848,0.0031983445,0.00036505322,0.0007212522,0.0007845441,0.0000178163,0.020508155,0.004052307,0.06808386,0.16451329,0.0046547437,0.73303634],"study_design_scores_gemma":[0.00029046793,0.00042128787,0.0010252538,0.0005633578,0.00009400823,0.00008926928,0.00011680558,0.84381247,0.14119734,0.005801021,0.006040257,0.0005484629],"about_ca_topic_score_codex":0.00014876894,"about_ca_topic_score_gemma":0.00012953782,"teacher_disagreement_score":0.92739385,"about_ca_system_score_codex":0.00012378354,"about_ca_system_score_gemma":0.00015079141,"threshold_uncertainty_score":0.8426608},"labels":[],"label_agreement":null},{"id":"W4392824349","doi":"10.1109/tcomm.2024.3375815","title":"Secure Transmission of UAV Control Information via NOMA","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Western University","funders":"Natural Science Foundation of Anhui Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Noma; Transmission (telecommunications); Computer science; Computer network; Information transmission; Control (management); Electronic engineering; Telecommunications; Engineering; Telecommunications link","score_opus":0.006643681355305813,"score_gpt":0.21452768196223632,"score_spread":0.2078840006069305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392824349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004370816,0.0005747474,0.99259025,0.0005922566,0.00017570087,0.00032098696,0.00013424332,0.00051187165,0.004662885],"genre_scores_gemma":[0.98860085,0.0012007618,0.00982532,0.00003677509,0.000010911043,0.0001855198,0.000055556095,0.0000241441,0.000060137132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929106,0.00003057275,0.00035937372,0.00008235519,0.00012275625,0.00011390287],"domain_scores_gemma":[0.9989591,0.00013498253,0.000026958984,0.00074206025,0.000081820464,0.000055058958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094180534,0.00012453567,0.00012338,0.00025772076,0.00016239959,0.00004727205,0.0003110905,0.000102420294,0.00012829625],"category_scores_gemma":[9.667873e-7,0.00012739658,0.00010016682,0.0005320737,0.00005968191,0.00047386327,9.606954e-7,0.00026939713,0.0001226219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013846461,0.00014259925,0.0000020491677,0.00018451425,0.00013780511,1.8680699e-7,0.001288198,0.68593454,0.006319445,0.0032295545,0.0007637254,0.3019835],"study_design_scores_gemma":[0.00024632114,0.000031985313,0.000035444777,0.00007649259,0.00007196119,0.000005117774,0.000046751764,0.9469783,0.0062259375,0.00030279934,0.045842588,0.00013633403],"about_ca_topic_score_codex":0.000022692362,"about_ca_topic_score_gemma":0.000018420627,"teacher_disagreement_score":0.98816377,"about_ca_system_score_codex":0.00006170393,"about_ca_system_score_gemma":0.0000297066,"threshold_uncertainty_score":0.5195082},"labels":[],"label_agreement":null},{"id":"W4392824812","doi":"10.1109/tcomm.2024.3375816","title":"Joint Spectrum, Precoding, and Phase Shifts Design for RIS-Aided Multiuser MIMO THz Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Precoding; Electronic engineering; Joint (building); MIMO; Zero-forcing precoding; Computer science; Telecommunications; Engineering; Physics; Electrical engineering; Beamforming","score_opus":0.08285189962042602,"score_gpt":0.3117082542903233,"score_spread":0.22885635466989726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392824812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016811455,0.006999402,0.9853494,0.0011518287,0.00042327665,0.0010658199,0.00016419713,0.0027919237,0.00037299658],"genre_scores_gemma":[0.93610984,0.00877451,0.053214125,0.000013533427,0.000015094616,0.0015399382,0.000016389611,0.00008223666,0.00023434848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998899,0.00009066756,0.00041462592,0.00023971706,0.00010266067,0.0002533175],"domain_scores_gemma":[0.9968502,0.00096026494,0.000042766995,0.002026584,0.000049458475,0.000070704235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022935068,0.00023834895,0.00024264719,0.00035918746,0.0004510028,0.00016052563,0.00072594034,0.00015081193,0.000014472289],"category_scores_gemma":[0.000018675584,0.00025201958,0.00010148505,0.00037631526,0.00018208352,0.00032900446,0.00001088681,0.0005603636,0.00003587108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004102341,0.0005270904,0.000001431004,0.00048474452,0.00051585987,0.0000018508055,0.0017414137,0.8221867,0.022012819,0.012709074,0.0022823436,0.13749562],"study_design_scores_gemma":[0.00063674455,0.00010966918,0.0000065559693,0.00027076065,0.00006966274,0.00001113234,0.0005030257,0.94393784,0.036611468,0.0019125971,0.015598612,0.00033193475],"about_ca_topic_score_codex":0.000022479697,"about_ca_topic_score_gemma":0.00006779257,"teacher_disagreement_score":0.9344287,"about_ca_system_score_codex":0.00016370948,"about_ca_system_score_gemma":0.000029796867,"threshold_uncertainty_score":0.9999932},"labels":[],"label_agreement":null},{"id":"W4392910296","doi":"10.1109/tcomm.2024.3371758","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392910296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011699929,0.00033613548,0.9392879,0.045855492,0.0020617396,0.0006646474,0.00013563015,0.002383658,0.009157805],"genre_scores_gemma":[0.9733114,0.0010737213,0.020894216,0.0011752152,0.000029623943,0.001368549,0.000059118724,0.000032783915,0.0020553467],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747074,0.00036851256,0.0008708011,0.00045885294,0.00042653145,0.00040457788],"domain_scores_gemma":[0.99057126,0.00088828045,0.00018528744,0.007731511,0.00043522174,0.00018843378],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065514346,0.00033305198,0.0002585003,0.0013797267,0.001786969,0.00080998166,0.004880835,0.00034102544,0.000121740646],"category_scores_gemma":[0.00001777561,0.0003512709,0.0002615118,0.0026190698,0.00038524353,0.0031767765,0.000010525398,0.0013742094,0.0037803506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021368964,0.0018026914,0.0000042994716,0.00009522854,0.00036722815,0.0000011597667,0.008060757,0.003719784,0.00067643553,0.21922427,0.017495774,0.748531],"study_design_scores_gemma":[0.0006835571,0.00032432863,0.00009855005,0.0003769403,0.00015229855,0.00014280567,0.0010395242,0.35684574,0.013472281,0.0050490396,0.6207647,0.0010502496],"about_ca_topic_score_codex":0.00011175275,"about_ca_topic_score_gemma":0.00014409097,"teacher_disagreement_score":0.9731944,"about_ca_system_score_codex":0.00037338908,"about_ca_system_score_gemma":0.00041168413,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W4392940210","doi":"10.1109/tcomm.2024.3379368","title":"Distributed-Optimization With Centralized-Refining for Efficient Resource Allocation in Future Wireless Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Western University","funders":"Canada Research Chairs","keywords":"Computer science; Resource allocation; Wireless; Distributed computing; Refining (metallurgy); Wireless network; Computer network; Resource management (computing); Telecommunications","score_opus":0.010284369780962782,"score_gpt":0.23265946193595569,"score_spread":0.2223750921549929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392940210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059237913,0.0009862084,0.9956946,0.00068652286,0.00037016653,0.00048634905,0.00010338293,0.0008253306,0.00025506687],"genre_scores_gemma":[0.9594601,0.001615217,0.0374568,0.000030851406,0.00007638197,0.0006459513,0.0005661585,0.00010225961,0.00004632539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.000067172,0.0003537214,0.00025879213,0.0001382412,0.0003112552],"domain_scores_gemma":[0.99871683,0.00032249233,0.00003958751,0.00077832537,0.00007362314,0.0000691354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014373475,0.0002260073,0.00018218129,0.00023773867,0.00028313603,0.00009388331,0.0003266577,0.0001498414,0.000011510021],"category_scores_gemma":[0.0000021461433,0.00023390052,0.000067962166,0.0011454141,0.00006980201,0.00018886535,0.0000026614352,0.00045869328,0.000003974833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003403104,0.000081013764,0.0000031195912,0.000050212755,0.000041264513,6.08734e-7,0.00023804679,0.9824323,0.0000341523,0.0009379664,0.00013505199,0.016012253],"study_design_scores_gemma":[0.00042521374,0.00003583299,0.000012957317,0.00027833515,0.000049866674,0.0000046486407,0.00017047788,0.99231946,0.00024918834,0.000009870752,0.0061971317,0.0002470253],"about_ca_topic_score_codex":0.0000063841785,"about_ca_topic_score_gemma":0.00015257724,"teacher_disagreement_score":0.95886767,"about_ca_system_score_codex":0.0003180236,"about_ca_system_score_gemma":0.000033692646,"threshold_uncertainty_score":0.9538186},"labels":[],"label_agreement":null},{"id":"W4393118835","doi":"10.1109/tcomm.2024.3381726","title":"Learning-to-Learn the Wave Angle Estimation","year":2024,"lang":"en","type":"preprint","venue":"IEEE Transactions on Communications","topic":"Speech and Audio Processing","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":"Estimation; Computer science; Artificial intelligence; Economics; Management","score_opus":0.04476140233275326,"score_gpt":0.3017466270132261,"score_spread":0.2569852246804728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393118835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082722324,0.0005552758,0.9563867,0.03513965,0.0009803856,0.00044282936,0.000019711902,0.00080304366,0.004845196],"genre_scores_gemma":[0.85792893,0.00031729083,0.13776158,0.0005543998,0.00004538813,0.00040954715,0.000013607484,0.00003693144,0.0029323264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998291,0.00026246381,0.0003479047,0.0004990956,0.0003327994,0.00026674246],"domain_scores_gemma":[0.995546,0.0003997381,0.00012501887,0.0036564262,0.00015900683,0.000113840884],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00043030776,0.0002652653,0.00020210285,0.00032240793,0.001155761,0.0008727214,0.003126552,0.00018414042,0.00002476344],"category_scores_gemma":[0.000028068223,0.00022017954,0.00020473762,0.00084439403,0.00012155979,0.0001572954,0.00020689283,0.002606047,0.00055214413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004720183,0.00021083411,7.2991776e-7,0.00007544258,0.000111005065,0.0000030759943,0.0057561216,0.25469595,0.00042065416,0.0013575933,0.0017714513,0.7355924],"study_design_scores_gemma":[0.00014648552,0.00014688299,0.00004083419,0.000629184,0.00013642143,0.00003654592,0.00028906052,0.92318857,0.019945467,0.0374035,0.017444957,0.0005920739],"about_ca_topic_score_codex":0.00006140809,"about_ca_topic_score_gemma":0.00009979216,"teacher_disagreement_score":0.85710174,"about_ca_system_score_codex":0.00015932796,"about_ca_system_score_gemma":0.0003015575,"threshold_uncertainty_score":0.999695},"labels":[],"label_agreement":null},{"id":"W4393241092","doi":"10.1109/tcomm.2024.3382328","title":"Exploiting Parity-Polytope Geometry in Approximate and Randomized Scheduled ADMM-LP Decoding","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Polytope; Decoding methods; Parity (physics); Mathematics; Computer science; Combinatorics; Algorithm; Mathematical optimization; Physics","score_opus":0.022132572506266306,"score_gpt":0.2540489958127179,"score_spread":0.2319164233064516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393241092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25745875,0.008912373,0.7223964,0.00050988415,0.00090043154,0.000908517,0.000051855593,0.0013251574,0.0075366828],"genre_scores_gemma":[0.9946725,0.002293451,0.0024254736,0.000019699952,0.00001551395,0.0004462129,0.0000063820003,0.000040438714,0.000080365346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988463,0.00026035137,0.0004118434,0.00017586493,0.000091472386,0.00021417173],"domain_scores_gemma":[0.9981337,0.0010432672,0.000021942864,0.00071315916,0.00001832693,0.000069569745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082466414,0.0001700754,0.00032331463,0.00049121276,0.00025251086,0.00013196512,0.00030666514,0.00009717351,0.00003786179],"category_scores_gemma":[0.000016426813,0.00017225588,0.00012515933,0.000636987,0.00013885662,0.000264287,0.000004743222,0.00057220337,0.00003278021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036445307,0.0015815258,0.00032897646,0.0043737735,0.0033144632,0.000064204716,0.030098764,0.19386643,0.050933193,0.40824863,0.0004683442,0.30307716],"study_design_scores_gemma":[0.012561309,0.000021866354,0.000029901366,0.0010641643,0.00016244424,0.000048780046,0.0017179701,0.96693015,0.008822325,0.006883825,0.0012096566,0.0005476255],"about_ca_topic_score_codex":0.00003420735,"about_ca_topic_score_gemma":0.00013004371,"teacher_disagreement_score":0.7730637,"about_ca_system_score_codex":0.000055464585,"about_ca_system_score_gemma":0.000015058436,"threshold_uncertainty_score":0.70243907},"labels":[],"label_agreement":null},{"id":"W4394805297","doi":"10.1109/tcomm.2024.3388501","title":"Multi-UAV Aided Multi-Access Edge Computing in Marine Communication Networks: A Joint System-Welfare and Energy-Efficient Design","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","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 New Brunswick","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China; National Research Foundation","keywords":"Joint (building); Computer science; Enhanced Data Rates for GSM Evolution; Communications system; Efficient energy use; Telecommunications; Energy (signal processing); Computer network; Engineering; Electrical engineering","score_opus":0.07157588372520994,"score_gpt":0.2966938969345554,"score_spread":0.22511801320934544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394805297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012722856,0.0015321703,0.991917,0.0017557337,0.0020496843,0.0003739656,0.0000023122639,0.00081449444,0.00028235078],"genre_scores_gemma":[0.8136174,0.00034266736,0.18567401,0.00008353804,0.000055047563,0.000109059656,0.000011286986,0.00003332754,0.000073670104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727356,0.00078576925,0.000731279,0.00056083966,0.00020914023,0.00043943673],"domain_scores_gemma":[0.99625003,0.0007786764,0.00013637896,0.0025534877,0.00014038198,0.00014102692],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009886719,0.0003138526,0.0003372903,0.0006082427,0.0013179205,0.0007675457,0.002364839,0.00014812262,0.0000025385405],"category_scores_gemma":[0.000012588272,0.00032691908,0.00012532473,0.0014329848,0.00016999106,0.0004710653,0.00023881881,0.0007811319,0.000014696918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017818931,0.0012885097,0.00007971998,0.00021124579,0.00014153944,0.0000204578,0.004572918,0.75218004,0.00038931766,0.008368667,0.00028902333,0.23244077],"study_design_scores_gemma":[0.0005182045,0.000034874884,0.00089989044,0.0005783132,0.00002705839,0.000043892025,0.00014268357,0.9961348,0.00028222142,0.000033953733,0.0009810927,0.00032297726],"about_ca_topic_score_codex":0.00080112414,"about_ca_topic_score_gemma":0.00027557625,"teacher_disagreement_score":0.8123451,"about_ca_system_score_codex":0.00033634662,"about_ca_system_score_gemma":0.000098927216,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W4394894309","doi":"10.1109/tcomm.2024.3384855","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394894309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011699929,0.00033613548,0.9392879,0.045855492,0.0020617396,0.0006646474,0.00013563015,0.002383658,0.009157805],"genre_scores_gemma":[0.9733114,0.0010737213,0.020894216,0.0011752152,0.000029623943,0.001368549,0.000059118724,0.000032783915,0.0020553467],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747074,0.00036851256,0.0008708011,0.00045885294,0.00042653145,0.00040457788],"domain_scores_gemma":[0.99057126,0.00088828045,0.00018528744,0.007731511,0.00043522174,0.00018843378],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065514346,0.00033305198,0.0002585003,0.0013797267,0.001786969,0.00080998166,0.004880835,0.00034102544,0.000121740646],"category_scores_gemma":[0.00001777561,0.0003512709,0.0002615118,0.0026190698,0.00038524353,0.0031767765,0.000010525398,0.0013742094,0.0037803506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021368964,0.0018026914,0.0000042994716,0.00009522854,0.00036722815,0.0000011597667,0.008060757,0.003719784,0.00067643553,0.21922427,0.017495774,0.748531],"study_design_scores_gemma":[0.0006835571,0.00032432863,0.00009855005,0.0003769403,0.00015229855,0.00014280567,0.0010395242,0.35684574,0.013472281,0.0050490396,0.6207647,0.0010502496],"about_ca_topic_score_codex":0.00011175275,"about_ca_topic_score_gemma":0.00014409097,"teacher_disagreement_score":0.9731944,"about_ca_system_score_codex":0.00037338908,"about_ca_system_score_gemma":0.00041168413,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W4395056573","doi":"10.1109/tcomm.2024.3392801","title":"Toward Generic Cross-Modal Transmission Strategy","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Smart Grid Security and Resilience","field":"Engineering","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":"Natural Science Research of Jiangsu Higher Education Institutions of China; National Natural Science Foundation of China","keywords":"Electronic engineering; Computer science; Transmission (telecommunications); Modal; Telecommunications; Engineering; Materials science","score_opus":0.047068633690698976,"score_gpt":0.29647147032742865,"score_spread":0.24940283663672969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395056573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014861758,0.0056851283,0.964401,0.00073212484,0.0011367403,0.00020769182,0.000075712676,0.0014085146,0.011491329],"genre_scores_gemma":[0.9929654,0.0048781596,0.001401412,0.000030164214,0.00004469688,0.00008050201,0.00001016876,0.00003534743,0.00055417744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921906,0.00004248076,0.00022272168,0.00016935734,0.00014349438,0.00020285677],"domain_scores_gemma":[0.99893564,0.00013780096,0.0000074673144,0.0007903518,0.000028336004,0.00010042744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008588336,0.00015139556,0.00010958334,0.00015503677,0.00031917114,0.00014946164,0.000549939,0.00011541206,0.00020359161],"category_scores_gemma":[7.621018e-7,0.00014672145,0.00012892709,0.0004615288,0.00014740234,0.00024669815,0.0000017293263,0.0005509813,0.0002650558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011345712,0.00021255176,0.000003282711,0.00019979678,0.0001225967,0.000010308079,0.0021373453,0.8122917,0.01486696,0.0017634495,0.0012014566,0.16717926],"study_design_scores_gemma":[0.0002060758,0.000070957205,0.00017505493,0.00014359808,0.000054832995,0.000047075046,0.00013100867,0.8768156,0.023717787,0.00066506147,0.09760165,0.0003712663],"about_ca_topic_score_codex":0.000025989119,"about_ca_topic_score_gemma":0.000037576378,"teacher_disagreement_score":0.97810364,"about_ca_system_score_codex":0.00006940326,"about_ca_system_score_gemma":0.000051327243,"threshold_uncertainty_score":0.5983127},"labels":[],"label_agreement":null},{"id":"W4395680492","doi":"10.1109/tcomm.2024.3393977","title":"Multipath Identification, User Localization, and Environment Mapping in Radio SLAM","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Natural Science Foundation of Beijing Municipality","keywords":"Multipath propagation; Computer science; Identification (biology); Simultaneous localization and mapping; Mobile radio; Electronic engineering; Telecommunications; Engineering; Artificial intelligence; Mobile robot; Robot","score_opus":0.017238302473879533,"score_gpt":0.2263310459018137,"score_spread":0.20909274342793416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395680492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026944673,0.0018889874,0.99290276,0.00064998027,0.00023921611,0.00025639974,0.00003425216,0.00087901455,0.00045493516],"genre_scores_gemma":[0.9892901,0.007796329,0.0022072296,0.000030130037,0.000008567682,0.00029716274,0.000019840816,0.000036866688,0.0003137819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917126,0.000045172656,0.00033896617,0.00018720758,0.00010535926,0.00015205695],"domain_scores_gemma":[0.9990098,0.00011952365,0.000016327667,0.000798426,0.00002061015,0.000035354133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014747273,0.00013940663,0.000113560294,0.00042376207,0.00020718455,0.00009396122,0.0003002588,0.00010971457,0.000056983685],"category_scores_gemma":[0.000005522339,0.00015424908,0.000039826155,0.0005028538,0.00013620213,0.00021703487,0.0000048602433,0.00029645785,0.00009928167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041039402,0.0002336616,0.00032177128,0.00023770273,0.00014061862,0.000005347528,0.005928775,0.8701006,0.0051044747,0.010687449,0.001528443,0.10570705],"study_design_scores_gemma":[0.00025349137,0.000011850421,0.00070295174,0.00013572566,0.000028503093,0.000009946683,0.00071061065,0.9247899,0.015607659,0.0010600103,0.05639713,0.00029224498],"about_ca_topic_score_codex":0.000018402336,"about_ca_topic_score_gemma":0.00008241153,"teacher_disagreement_score":0.99069554,"about_ca_system_score_codex":0.00014473939,"about_ca_system_score_gemma":0.000014238128,"threshold_uncertainty_score":0.6290095},"labels":[],"label_agreement":null},{"id":"W4396564070","doi":"10.1109/tcomm.2024.3392785","title":"Multiplexed Streaming Codes for Multi-Hop Multi-Link Communication Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Computer network; Erasure; Multiplexing; Hop (telecommunications); Telecommunications","score_opus":0.11563991827086129,"score_gpt":0.35260650149080514,"score_spread":0.23696658321994385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396564070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007105817,0.00690423,0.98346317,0.006549296,0.0004783407,0.00096498424,0.00005817391,0.0011794156,0.00033131996],"genre_scores_gemma":[0.6260563,0.00996839,0.3618868,0.00028634278,0.00003120706,0.00078794785,0.000073892734,0.000043732918,0.00086537504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976228,0.0005749773,0.00064370886,0.0005456348,0.00019586108,0.00041701633],"domain_scores_gemma":[0.9922088,0.002015673,0.0001237441,0.00510169,0.00038953265,0.00016056056],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007595121,0.00034038845,0.00030741928,0.00037149515,0.0020427734,0.00064646336,0.004075236,0.0001823771,0.000027059576],"category_scores_gemma":[0.000043265165,0.00035536592,0.00029544355,0.0011382003,0.00026441703,0.00083516946,0.00008588286,0.0009173934,0.000076610566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023511133,0.00110237,0.000011336486,0.00005563683,0.00031582417,0.0000013992598,0.0036708151,0.04895478,0.0045631295,0.06279514,0.0012518242,0.87725425],"study_design_scores_gemma":[0.00072412315,0.00005734354,0.000077801975,0.0002231415,0.000047660862,0.0000074573272,0.00012235019,0.96902984,0.0012326306,0.00016182565,0.027945269,0.0003705431],"about_ca_topic_score_codex":0.00003558041,"about_ca_topic_score_gemma":0.0011817619,"teacher_disagreement_score":0.92007506,"about_ca_system_score_codex":0.00021218423,"about_ca_system_score_gemma":0.00013981623,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W4396980047","doi":"10.1109/tcomm.2024.3397105","title":"IEEE Transactions on Communications Publication Information","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Technology and Education Systems","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":"Beijing Jiaotong University; Chinese University of Hong Kong; National and Kapodistrian University of Athens; Tsinghua University; Queen's University; Queen's University Belfast","keywords":"Computer science; Telecommunications; Computer network","score_opus":0.04577397546185246,"score_gpt":0.3001926099905355,"score_spread":0.254418634528683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396980047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011699929,0.00033613548,0.9392879,0.045855492,0.0020617396,0.0006646474,0.00013563015,0.002383658,0.009157805],"genre_scores_gemma":[0.9733114,0.0010737213,0.020894216,0.0011752152,0.000029623943,0.001368549,0.000059118724,0.000032783915,0.0020553467],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747074,0.00036851256,0.0008708011,0.00045885294,0.00042653145,0.00040457788],"domain_scores_gemma":[0.99057126,0.00088828045,0.00018528744,0.007731511,0.00043522174,0.00018843378],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065514346,0.00033305198,0.0002585003,0.0013797267,0.001786969,0.00080998166,0.004880835,0.00034102544,0.000121740646],"category_scores_gemma":[0.00001777561,0.0003512709,0.0002615118,0.0026190698,0.00038524353,0.0031767765,0.000010525398,0.0013742094,0.0037803506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021368964,0.0018026914,0.0000042994716,0.00009522854,0.00036722815,0.0000011597667,0.008060757,0.003719784,0.00067643553,0.21922427,0.017495774,0.748531],"study_design_scores_gemma":[0.0006835571,0.00032432863,0.00009855005,0.0003769403,0.00015229855,0.00014280567,0.0010395242,0.35684574,0.013472281,0.0050490396,0.6207647,0.0010502496],"about_ca_topic_score_codex":0.00011175275,"about_ca_topic_score_gemma":0.00014409097,"teacher_disagreement_score":0.9731944,"about_ca_system_score_codex":0.00037338908,"about_ca_system_score_gemma":0.00041168413,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W4399110347","doi":"10.1109/tcomm.2024.3406400","title":"Latency Minimization for UAV-Assisted MEC Networks With Blockchain","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","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":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Blockchain; Computer science; Minification; Latency (audio); Computer network; Real-time computing; Embedded system; Telecommunications; Computer security","score_opus":0.033568293356906524,"score_gpt":0.2726619263693608,"score_spread":0.2390936330124543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399110347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003649981,0.00037446056,0.99022394,0.004204872,0.0026899837,0.00037217492,0.0000028345933,0.00067669834,0.0010900301],"genre_scores_gemma":[0.844762,0.000113729744,0.15342583,0.00019370507,0.00021071559,0.00024857002,0.00001513501,0.000034447825,0.0009958217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989049,0.000097372045,0.0002723789,0.0003218275,0.00014194084,0.00026157819],"domain_scores_gemma":[0.99764836,0.0006222446,0.00005199617,0.0014620515,0.0001389298,0.000076424185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021634574,0.00016407589,0.0001406539,0.00022810012,0.0007953082,0.00027487573,0.0011448243,0.00008877294,0.0000039109063],"category_scores_gemma":[0.0000041173366,0.00014937384,0.00011148805,0.0009813423,0.00007344079,0.00019768877,0.0000107275155,0.00031549815,0.00002401999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005567496,0.0009674165,0.000014579727,0.00011581666,0.00042743652,0.00000805656,0.005399581,0.26539153,0.00038956702,0.014679199,0.01043704,0.7021141],"study_design_scores_gemma":[0.00022790322,0.000114899514,0.000044105127,0.00012931634,0.000047566406,0.000021476046,0.00002879444,0.9818616,0.00031860173,0.00050220836,0.016505083,0.0001984781],"about_ca_topic_score_codex":0.0000272781,"about_ca_topic_score_gemma":0.00004884158,"teacher_disagreement_score":0.84439707,"about_ca_system_score_codex":0.00007779011,"about_ca_system_score_gemma":0.00012020083,"threshold_uncertainty_score":0.6116948},"labels":[],"label_agreement":null},{"id":"W4399169098","doi":"10.1109/tcomm.2024.3407208","title":"Decentralized Federated Learning Over Imperfect Communication Channels","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","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":"National Natural Science Foundation of China; National Science Foundation","keywords":"Imperfect; Computer science; Computer network; Telecommunications; Distributed computing","score_opus":0.04205023638544281,"score_gpt":0.3145488807666332,"score_spread":0.27249864438119037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399169098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015433232,0.0021736815,0.9533726,0.03644192,0.0006056087,0.00033566373,0.000026717184,0.0039563472,0.0015441508],"genre_scores_gemma":[0.911336,0.0060666334,0.08186901,0.00015405155,0.000008836968,0.00021555347,0.00003757917,0.000034029006,0.000278283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799305,0.0005070141,0.0003844117,0.00047031482,0.00027633068,0.00036885048],"domain_scores_gemma":[0.9849327,0.0010958713,0.00007443458,0.013705875,0.00010323981,0.0000878383],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00054978754,0.00023634818,0.00020107467,0.00039726522,0.0012841892,0.0009067216,0.022393923,0.00018126839,0.000091470276],"category_scores_gemma":[0.0004881219,0.0002443666,0.00014457852,0.0014912246,0.00022655625,0.0011537913,0.0015433759,0.0013384494,0.00030238164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057884514,0.0017051933,0.000056938894,0.00017237585,0.0010166906,0.000027353894,0.0028262695,0.010379601,0.016901745,0.052889656,0.14475001,0.7692163],"study_design_scores_gemma":[0.00029873053,0.000074889205,0.000032194617,0.00020352454,0.00003417141,0.00002710624,0.000059706417,0.92788327,0.010243191,0.022290485,0.038514934,0.00033781675],"about_ca_topic_score_codex":0.0001433845,"about_ca_topic_score_gemma":0.00009391607,"teacher_disagreement_score":0.91750365,"about_ca_system_score_codex":0.00023010682,"about_ca_system_score_gemma":0.0001266604,"threshold_uncertainty_score":0.99649805},"labels":[],"label_agreement":null},{"id":"W4399486976","doi":"10.1109/tcomm.2024.3411769","title":"Robust Security Energy Efficiency Optimization for RIS-Aided Cell-Free Networks With Multiple Eavesdroppers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Memorial University of Newfoundland; Université Laval","funders":"National Mobile Communications Research Laboratory, Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Efficient energy use; Energy (signal processing); Electronic engineering; Computer network; Engineering; Electrical engineering","score_opus":0.015550724406221848,"score_gpt":0.2173430108017894,"score_spread":0.20179228639556754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399486976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006242382,0.0012391286,0.99449253,0.00018050773,0.00053177273,0.00056482374,0.00014278677,0.0011655197,0.0016205308],"genre_scores_gemma":[0.87980646,0.0012318046,0.11777531,0.000022177897,0.00004121323,0.0006753775,0.000110842804,0.000114523944,0.00022228957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988892,0.000064001986,0.00035148667,0.00028309698,0.00012558057,0.000286597],"domain_scores_gemma":[0.99768186,0.0004818423,0.00004464492,0.001571617,0.00012660338,0.00009343968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011815094,0.00025299843,0.00019475746,0.00024828594,0.00046419987,0.00010610675,0.0006077146,0.00014908859,0.000026344249],"category_scores_gemma":[0.000007846548,0.00025921146,0.000110572706,0.000729616,0.00009571839,0.00035433646,0.0000049814107,0.00033037612,0.00000637702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015964144,0.000105832514,0.0000010877405,0.00006795875,0.000055530145,4.7844804e-7,0.0002922455,0.99730736,0.00012833142,0.0002700768,0.00049223925,0.0012628771],"study_design_scores_gemma":[0.0005769887,0.00007292296,6.511597e-7,0.00012459316,0.00008487604,0.0000069606326,0.00015965095,0.9955139,0.0016284395,0.000055906992,0.0014882355,0.0002868363],"about_ca_topic_score_codex":0.000051860563,"about_ca_topic_score_gemma":0.00050344516,"teacher_disagreement_score":0.87974405,"about_ca_system_score_codex":0.00021588302,"about_ca_system_score_gemma":0.00004517487,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W4399728424","doi":"10.1109/tcomm.2024.3415611","title":"Coverage Analysis of Single-Swarm mmWave UAV Networks Under Multiple Types of Blockages","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Key Research and Development Projects of Shaanxi Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Swarm behaviour; Electronic engineering; Computer network; Engineering; Artificial intelligence","score_opus":0.02220172154341891,"score_gpt":0.24211430117842742,"score_spread":0.21991257963500851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399728424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00938798,0.0009951417,0.986858,0.00012643595,0.000120331955,0.00015648213,0.00017249656,0.00021636608,0.0019667465],"genre_scores_gemma":[0.99307424,0.0021374652,0.004475111,0.000011572339,0.000008381364,0.000061021812,0.00007498916,0.000028134653,0.00012911344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992981,0.000036357815,0.00034027087,0.00012118021,0.00009974496,0.000104328814],"domain_scores_gemma":[0.99839216,0.0004484317,0.00004088576,0.0009961824,0.000086864726,0.000035450797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008164514,0.000113533264,0.00020615968,0.00044056075,0.00010159767,0.000025865727,0.000294331,0.000087745364,0.00008264151],"category_scores_gemma":[0.0000025748216,0.00012118439,0.00017584626,0.0016867971,0.00009060604,0.00009292056,0.000003142061,0.000190154,0.000008253941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025520912,0.00015830834,0.000016862356,0.000023263403,0.0007943377,7.341961e-8,0.00017590645,0.98971283,0.0028174678,0.0009041521,0.00005163568,0.0053425855],"study_design_scores_gemma":[0.000089571506,0.000021658963,0.00027772642,0.0000387667,0.00080539734,5.629766e-7,0.000058426805,0.99027437,0.007396019,0.00007271614,0.0008562396,0.000108555105],"about_ca_topic_score_codex":0.00005179308,"about_ca_topic_score_gemma":0.00042939206,"teacher_disagreement_score":0.9836862,"about_ca_system_score_codex":0.00005879117,"about_ca_system_score_gemma":0.000017056673,"threshold_uncertainty_score":0.4941756},"labels":[],"label_agreement":null},{"id":"W4399728456","doi":"10.1109/tcomm.2024.3415608","title":"Age of Information Minimization for Opportunistic Channel Access","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","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, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Minification; Computer science; Channel (broadcasting); Computer network; Electronic engineering; Telecommunications; Engineering","score_opus":0.06464501266160738,"score_gpt":0.31630535704874535,"score_spread":0.25166034438713797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399728456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010858982,0.000032029548,0.9921881,0.002304319,0.00052194006,0.0005497532,0.00012837964,0.00035673362,0.003907871],"genre_scores_gemma":[0.83722436,0.0005006591,0.16056412,0.00035307754,0.00001703003,0.00047450326,0.0004114365,0.000017860306,0.00043694087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.00005031267,0.0005413764,0.00012790863,0.00020461988,0.00013835588],"domain_scores_gemma":[0.9978887,0.00037974585,0.00015054677,0.001215411,0.00030373584,0.000061889186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002383253,0.00012473033,0.00013012392,0.00056534016,0.0003065829,0.0004040737,0.0015459846,0.00008215228,0.000020580592],"category_scores_gemma":[0.000026899559,0.00013119877,0.00010745903,0.000838804,0.00008092388,0.004144191,0.000015796119,0.00014391112,0.00004188862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037016332,0.00040744577,0.0000010566228,0.0005321411,0.00017616709,0.0000010783459,0.0076669147,0.3159695,0.00022987719,0.42450896,0.0049652946,0.24550454],"study_design_scores_gemma":[0.00020396573,0.00006527014,0.00001209688,0.0000895774,0.000026769303,0.0000049318164,0.000068902744,0.98414475,0.001266362,0.0025239827,0.011453736,0.00013964885],"about_ca_topic_score_codex":0.000013123007,"about_ca_topic_score_gemma":0.000011249196,"teacher_disagreement_score":0.8372135,"about_ca_system_score_codex":0.00007810811,"about_ca_system_score_gemma":0.00017048858,"threshold_uncertainty_score":0.535013},"labels":[],"label_agreement":null},{"id":"W4399939577","doi":"10.1109/tcomm.2024.3418915","title":"Robust Constant Curvature Curve Communications With Complex and Quaternion Neural Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"Army Research Laboratory; University of Waterloo; Cairo University","keywords":"Constant (computer programming); Constant curvature; Curvature; Quaternion; Artificial neural network; Computer science; Control theory (sociology); Mathematics; Topology (electrical circuits); Mathematical analysis; Geometry; Artificial intelligence; Combinatorics; Control (management)","score_opus":0.0450136031972007,"score_gpt":0.2781434220915432,"score_spread":0.23312981889434248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399939577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047269516,0.003500096,0.99017304,0.0019623186,0.00008051291,0.00028090068,0.00008638876,0.0016273358,0.0018167049],"genre_scores_gemma":[0.956351,0.0060218405,0.037108023,0.000100101046,0.000013928132,0.00020147275,0.00007576712,0.00006095044,0.00006693872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999017,0.00009656655,0.00030472002,0.00022495136,0.00013270277,0.00022406854],"domain_scores_gemma":[0.9972848,0.0004615612,0.00003204162,0.0020433688,0.000071284376,0.00010693219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105749634,0.00024101266,0.00023552951,0.00019876444,0.00044969877,0.0001188074,0.00073875196,0.00010460565,0.00004161132],"category_scores_gemma":[0.0000019071465,0.00021497463,0.000086238295,0.000752839,0.00048369513,0.0002752107,0.00001453662,0.00096120255,0.000013419525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029731149,0.00031870554,0.0000586394,0.00009664446,0.0006363541,0.000006296243,0.0005922794,0.85102123,0.0016236275,0.006712274,0.0013110151,0.13759321],"study_design_scores_gemma":[0.00011226047,0.000055938657,0.000047489048,0.00010167843,0.00013296091,0.00003105354,0.00007693991,0.9891932,0.00020358915,0.00031874396,0.0094669955,0.00025913995],"about_ca_topic_score_codex":0.000047616166,"about_ca_topic_score_gemma":0.0005230031,"teacher_disagreement_score":0.95587826,"about_ca_system_score_codex":0.000097955584,"about_ca_system_score_gemma":0.000013842406,"threshold_uncertainty_score":0.8766411},"labels":[],"label_agreement":null},{"id":"W4400020230","doi":"10.1109/tcomm.2024.3418889","title":"Two-Step Adaptive Grouping Access Based on RSMA for Multibeam Satellite System","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"National Natural Science Foundation of China","keywords":"Computer science; Communications satellite; Satellite; Electronic engineering; Remote sensing; Engineering; Geology; Aerospace engineering","score_opus":0.07875642421680518,"score_gpt":0.3226099651497055,"score_spread":0.24385354093290035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400020230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002551031,0.0038979293,0.9728968,0.00043259046,0.0012485251,0.0015393795,0.0003786118,0.0027949177,0.016556099],"genre_scores_gemma":[0.9789144,0.0011640112,0.01745029,0.000087621025,0.00006483024,0.0019127557,0.00006783679,0.00015475885,0.00018349482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981576,0.00025502808,0.00063191226,0.00035242215,0.00025776765,0.00034527076],"domain_scores_gemma":[0.99409765,0.0020709743,0.00006222184,0.003474228,0.00016122598,0.00013371631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004495586,0.00034788554,0.00031682837,0.0005797058,0.0005705468,0.0003383615,0.001788138,0.00015451275,0.000020148833],"category_scores_gemma":[0.000007646675,0.00037588715,0.00028790583,0.00085463666,0.00010892699,0.00039196265,0.000009780322,0.0006413467,0.00030207308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013309313,0.00053939136,0.000025734276,0.0013224515,0.0008319481,0.0000035482396,0.0015233817,0.74735636,0.003530434,0.01924578,0.00046694186,0.22502097],"study_design_scores_gemma":[0.00052544184,0.00006684173,0.000034287255,0.00092536677,0.00009294253,0.000009907523,0.00048061952,0.9465768,0.0041767186,0.000033216726,0.046701625,0.00037623753],"about_ca_topic_score_codex":0.00007900026,"about_ca_topic_score_gemma":0.0001646514,"teacher_disagreement_score":0.9786593,"about_ca_system_score_codex":0.00059924857,"about_ca_system_score_gemma":0.00006737947,"threshold_uncertainty_score":0.9998693},"labels":[],"label_agreement":null},{"id":"W4400188705","doi":"10.1109/tcomm.2024.3420736","title":"Signal-Dependent Shot and Relative Intensity Noise in Channel Estimation of Laser Diode-Based Indoor VLC Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Semiconductor Lasers and Optical Devices","field":"Engineering","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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relative intensity noise; Visible light communication; Electronic engineering; Channel (broadcasting); SIGNAL (programming language); Computer science; Noise (video); Laser; Acoustics; Optics; Semiconductor laser theory; Telecommunications; Light-emitting diode; Physics; Engineering","score_opus":0.03303700034403073,"score_gpt":0.2577344935715171,"score_spread":0.2246974932274864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400188705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38638502,0.0030201152,0.6063362,0.00070648175,0.00070218137,0.00071098696,0.00028699814,0.00043821798,0.0014138111],"genre_scores_gemma":[0.99877834,0.00028016238,0.0007486239,0.000017670174,0.000005923631,0.00008997512,0.000014627754,0.000020641934,0.000044026634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993245,0.000053956883,0.00027742938,0.00013020127,0.00010484205,0.00010909028],"domain_scores_gemma":[0.9990095,0.00042634486,0.000021388072,0.000438656,0.00005174802,0.00005239874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014154654,0.0001198794,0.00017582192,0.00023267156,0.00007320705,0.00004261607,0.00016885153,0.0000883358,0.000015234581],"category_scores_gemma":[0.0000058391824,0.00011797358,0.000048263326,0.00030892348,0.00009060268,0.00022491187,0.0000026884327,0.00036819803,0.000015351849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019915642,0.0001363064,0.000020243977,0.00021908096,0.00008276206,0.000001995433,0.0008393958,0.9927134,0.0036632586,0.0003971471,0.00003079213,0.001875699],"study_design_scores_gemma":[0.00022010037,0.00003573908,0.00020035326,0.000380016,0.00005447383,0.0000030835733,0.00023554922,0.9818674,0.016674744,0.00012877259,0.00007517043,0.00012461252],"about_ca_topic_score_codex":0.00015258844,"about_ca_topic_score_gemma":0.00020286388,"teacher_disagreement_score":0.6123933,"about_ca_system_score_codex":0.00008683851,"about_ca_system_score_gemma":0.000022779475,"threshold_uncertainty_score":0.48108226},"labels":[],"label_agreement":null},{"id":"W4400230279","doi":"10.1109/tcomm.2024.3422221","title":"Weighted Sum Rate Maximization for RIS Backscatter Aided NOMA Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"National Natural Science Foundation of China","keywords":"Noma; Backscatter (email); Maximization; Computer science; Maximum likelihood; Electronic engineering; Algorithm; Mathematics; Telecommunications link; Statistics; Telecommunications; Wireless; Mathematical optimization; Engineering","score_opus":0.022960376343134185,"score_gpt":0.26213629902454855,"score_spread":0.23917592268141435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400230279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047605747,0.0020873675,0.9890267,0.0027917947,0.0005575306,0.00057563663,0.0001221331,0.0034094588,0.0009533108],"genre_scores_gemma":[0.95299673,0.0070260675,0.037990183,0.000095070245,0.000025949017,0.00118474,0.00012561507,0.00010667083,0.00044894553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989304,0.00007886096,0.0004014442,0.00022961643,0.00008568684,0.00027400308],"domain_scores_gemma":[0.9965212,0.0008562815,0.000038154252,0.002425733,0.00010308717,0.00005554878],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015754387,0.00023715901,0.00019705227,0.00034569562,0.00045043303,0.00011706291,0.0010706072,0.0001977254,0.00007440026],"category_scores_gemma":[0.000008201416,0.00025913905,0.00015051405,0.00075644377,0.00016965208,0.00036489303,0.000010177815,0.00062078837,0.00011615154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015759428,0.00011761711,0.0000033416507,0.00007724752,0.00020127841,5.335872e-7,0.00019981149,0.85657847,0.0019476378,0.0044360003,0.0033745489,0.13304773],"study_design_scores_gemma":[0.00024668366,0.000030944244,0.000024457991,0.000102116705,0.000050037386,0.000003916876,0.00008408724,0.94643724,0.011173143,0.0020646905,0.039496206,0.0002864872],"about_ca_topic_score_codex":0.000007208845,"about_ca_topic_score_gemma":0.00009111963,"teacher_disagreement_score":0.9525207,"about_ca_system_score_codex":0.00017701887,"about_ca_system_score_gemma":0.000025228117,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W4400276324","doi":"10.1109/tcomm.2024.3422220","title":"Optimal Configuration of Reconfigurable Intelligent Surfaces With Arbitrary Discrete Phase Shifts","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Computer science; Phase (matter); Electronic engineering; Topology (electrical circuits); Physics; Engineering; Electrical engineering","score_opus":0.03418049745005786,"score_gpt":0.2869608673854388,"score_spread":0.25278036993538094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400276324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018718947,0.001423252,0.9707774,0.00034088345,0.00027098227,0.00027524107,0.00011369841,0.00034238832,0.007737202],"genre_scores_gemma":[0.9919881,0.0023273872,0.0051649935,0.000013620297,0.000010103251,0.000083645304,0.000030070563,0.0000383466,0.0003436985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991477,0.000048239905,0.000336685,0.00016510925,0.0001433193,0.00015892554],"domain_scores_gemma":[0.998779,0.00018341704,0.000027377764,0.00088274723,0.00005945629,0.00006797969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012046535,0.00016580234,0.00017041396,0.00016083116,0.0001490692,0.000073157345,0.0003852946,0.00006722955,0.00031421662],"category_scores_gemma":[0.0000016048152,0.00014655688,0.000082345214,0.0003405755,0.00017494665,0.0002518086,0.0000011339899,0.00038359815,0.00006529843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039640912,0.00024586954,8.826489e-7,0.00013868147,0.00027066586,0.0000035970781,0.0015638282,0.90776443,0.014442915,0.0034166537,0.00019345368,0.07191937],"study_design_scores_gemma":[0.00017574763,0.00023699418,0.000006400719,0.00031047114,0.000090814865,0.000011986741,0.00047577085,0.5530134,0.4398145,0.00017871606,0.005420286,0.00026490015],"about_ca_topic_score_codex":0.000048097238,"about_ca_topic_score_gemma":0.00009578577,"teacher_disagreement_score":0.97326916,"about_ca_system_score_codex":0.000047695234,"about_ca_system_score_gemma":0.00004924309,"threshold_uncertainty_score":0.5976416},"labels":[],"label_agreement":null},{"id":"W4400351845","doi":"10.1109/tcomm.2024.3424233","title":"On Power-Line-Based Front-Hauling for IoT Cellular Indoor Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Line (geometry); Power-line communication; Computer science; Power (physics); Electrical engineering; Internet of Things; Telecommunications; Engineering; Cellular radio; Electronic engineering; Embedded system; Base station; Physics","score_opus":0.038067462171337926,"score_gpt":0.28450116704071315,"score_spread":0.24643370486937521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400351845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021053997,0.0055702166,0.9732182,0.0062916996,0.0009296924,0.001004306,0.0007690348,0.0018367458,0.008274722],"genre_scores_gemma":[0.95300317,0.0013751186,0.043153048,0.0002765413,0.000029364151,0.0013096364,0.00018999222,0.00015073322,0.00051237317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982156,0.00016802244,0.0006901331,0.00032033786,0.00021258749,0.00039332296],"domain_scores_gemma":[0.9905825,0.0023360094,0.000057444027,0.0067007225,0.00015482515,0.00016850134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042197818,0.00037222786,0.00030879033,0.00057942676,0.0010145737,0.00019053393,0.0026373833,0.0002051906,0.00015173845],"category_scores_gemma":[0.000028066455,0.00040617128,0.00037616078,0.0006304534,0.00024803067,0.00016072708,0.000019255263,0.0011122732,0.00043506056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022218382,0.004721937,0.0000091818365,0.0006320837,0.0015556929,0.0000065318204,0.0037132064,0.7530436,0.038354255,0.07374139,0.020608647,0.10339132],"study_design_scores_gemma":[0.0006327223,0.00021532898,0.000007027127,0.00035652946,0.00015668575,0.0000029850667,0.00010833389,0.8262596,0.013352668,0.0018237792,0.15657723,0.0005070741],"about_ca_topic_score_codex":0.000029285493,"about_ca_topic_score_gemma":0.0002669139,"teacher_disagreement_score":0.9508978,"about_ca_system_score_codex":0.0002782712,"about_ca_system_score_gemma":0.00017893797,"threshold_uncertainty_score":0.999839},"labels":[],"label_agreement":null},{"id":"W4400526165","doi":"10.1109/tcomm.2024.3399202","title":"Semi-Passive Intelligent Reflecting Surface-Enabled Sensing Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Inertial Sensor and Navigation","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Fundo para o Desenvolvimento das Ciências e da Tecnologia; National Natural Science Foundation of China","keywords":"Computer science; Electronic engineering; Engineering; Electrical engineering","score_opus":0.0412102546407868,"score_gpt":0.29920993725060285,"score_spread":0.25799968260981604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400526165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015237902,0.0016797774,0.9690976,0.0005351354,0.002260043,0.00036099067,0.00004102552,0.0016713066,0.009116216],"genre_scores_gemma":[0.99637693,0.0009523831,0.0016650008,0.000016791113,0.000060077855,0.000019620335,0.0000172251,0.000057872236,0.0008340821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906147,0.00009455707,0.00032592236,0.0001637664,0.00014029715,0.00021397493],"domain_scores_gemma":[0.9986924,0.00034142996,0.000021194066,0.0007984176,0.00007974847,0.0000668214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013903239,0.00016365161,0.00014546824,0.00015092052,0.0004003788,0.00016624841,0.00023561157,0.000106114814,0.000027064305],"category_scores_gemma":[0.0000043411924,0.00017256568,0.000099845725,0.00053501537,0.00004545962,0.0001822631,0.000002267429,0.00058432797,0.00023043827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048982083,0.000034043056,7.020037e-7,0.00009420343,0.00013547139,0.000004018643,0.0010846473,0.93575263,0.045874644,0.00053646707,0.0005015196,0.015976759],"study_design_scores_gemma":[0.00006878798,0.000021529468,0.0000025435102,0.00030824947,0.0000678097,0.000028599996,0.00041096163,0.9181708,0.06823501,0.00010464203,0.012373311,0.00020776023],"about_ca_topic_score_codex":0.00021075491,"about_ca_topic_score_gemma":0.00013532546,"teacher_disagreement_score":0.98113906,"about_ca_system_score_codex":0.00028800117,"about_ca_system_score_gemma":0.00002677088,"threshold_uncertainty_score":0.7037024},"labels":[],"label_agreement":null},{"id":"W4400681763","doi":"10.1109/tcomm.2024.3429170","title":"Federated Unfolding Learning for CSI Feedback in Distributed Edge Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Neural Networks and Applications","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":"Western University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Distributed learning; Distributed computing; Electronic engineering; Artificial intelligence; Engineering","score_opus":0.035331092696284025,"score_gpt":0.29249002089749704,"score_spread":0.257158928201213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400681763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005097487,0.0005475261,0.990934,0.0061825225,0.00035226037,0.00046073776,0.000022948412,0.00054682966,0.00044340867],"genre_scores_gemma":[0.9906826,0.00054407434,0.0074986764,0.00012271144,0.000036718226,0.0006185981,0.000052450854,0.000022915923,0.000421278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988026,0.00011231513,0.00033198722,0.00035090448,0.000099010016,0.0003032067],"domain_scores_gemma":[0.9980411,0.00090956513,0.000045211782,0.0008443931,0.00007806859,0.00008167065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022970665,0.00015980432,0.00015386703,0.00017440894,0.00088170514,0.00047144556,0.000990131,0.00009497157,0.000009871176],"category_scores_gemma":[0.0000061957926,0.00016583789,0.00012423082,0.0014985853,0.00006502485,0.0003816644,0.000014891111,0.00066612696,0.000034801982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001245363,0.00038126804,0.000016115913,0.000029153509,0.0000691115,0.0000026762,0.00030253726,0.7350203,0.00091728545,0.037009582,0.0024173118,0.22382222],"study_design_scores_gemma":[0.00019339375,0.000038852482,0.00006014663,0.00010166821,0.000014227224,0.000006330141,0.00003499008,0.970805,0.00048728858,0.00086297025,0.027220007,0.00017510768],"about_ca_topic_score_codex":0.00003411319,"about_ca_topic_score_gemma":0.00020305581,"teacher_disagreement_score":0.9901728,"about_ca_system_score_codex":0.000112264766,"about_ca_system_score_gemma":0.00006539582,"threshold_uncertainty_score":0.67814523},"labels":[],"label_agreement":null},{"id":"W4400878106","doi":"10.1109/tcomm.2024.3432455","title":"Phase-Shift and Transmit Power Optimization for RIS-Aided Massive MIMO SWIPT IoT Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":23,"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; Queen's University; Queen's University Belfast; European Commission; Department for the Economy","keywords":"MIMO; Computer science; Power (physics); Electronic engineering; Transmitter power output; Telecommunications; Engineering; Transmitter; Beamforming; Channel (broadcasting); Physics","score_opus":0.019004879734326185,"score_gpt":0.26550850821662664,"score_spread":0.24650362848230045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400878106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012785381,0.0030647458,0.9906583,0.0016257919,0.00062199583,0.000670856,0.00016055183,0.00093568466,0.0009835346],"genre_scores_gemma":[0.97856945,0.0022307131,0.018189365,0.0000738838,0.00005574534,0.0005769004,0.00007343814,0.000110013796,0.0001204634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890566,0.00006540795,0.00035767743,0.00026065367,0.000110273606,0.0003003069],"domain_scores_gemma":[0.9982159,0.0006319511,0.000026853288,0.0009486515,0.000057762587,0.000118845324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014864987,0.00025248976,0.00021912562,0.00022088693,0.00043239412,0.00015696722,0.00039729674,0.0002054918,0.00010989891],"category_scores_gemma":[0.0000029556118,0.0002812017,0.00014834755,0.00045838158,0.00013275341,0.00021902012,0.000002715579,0.00055969,0.0000136859035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021380862,0.00016108967,4.0763126e-7,0.000046208534,0.00017714997,9.80108e-7,0.00059606176,0.9747852,0.00013138131,0.0007058189,0.0010714498,0.022302883],"study_design_scores_gemma":[0.00080713746,0.00010626148,0.0000063059,0.00015218466,0.00015480538,0.000005278457,0.00007846465,0.9893148,0.0005035919,0.00020828303,0.008382075,0.00028079696],"about_ca_topic_score_codex":0.000010846202,"about_ca_topic_score_gemma":0.000105830564,"teacher_disagreement_score":0.9772909,"about_ca_system_score_codex":0.00010248656,"about_ca_system_score_gemma":0.00003106204,"threshold_uncertainty_score":0.999964},"labels":[],"label_agreement":null},{"id":"W4401070703","doi":"10.1109/tcomm.2024.3435404","title":"Optimal Binary Signaling for a Two Sensor Gaussian MAC Network","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Binary number; Gaussian; Computer science; Wireless sensor network; Computer network; Topology (electrical circuits); Electronic engineering; Mathematics; Engineering; Physics; Electrical engineering","score_opus":0.03203395873517382,"score_gpt":0.2960845230958686,"score_spread":0.26405056436069474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401070703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015471102,0.0008282974,0.99066836,0.00453728,0.0014600618,0.00040099295,0.00010577141,0.00095415505,0.0008903741],"genre_scores_gemma":[0.696156,0.00027659634,0.30167413,0.00028472015,0.00019130882,0.00032226468,0.000025445766,0.000036996957,0.001032533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985376,0.00013679308,0.0003464329,0.0004107048,0.00018212422,0.00038635734],"domain_scores_gemma":[0.99728376,0.0007347608,0.000052042356,0.001678517,0.00010692415,0.00014401425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039458,0.00020253405,0.00017801112,0.00018882888,0.0010196951,0.00035288962,0.0011655156,0.000091975184,0.000041457602],"category_scores_gemma":[0.000003708165,0.00020564372,0.00025902488,0.0011072821,0.00009609518,0.00036546242,0.000013774953,0.00048246185,0.00012400819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023385954,0.00023992223,3.4423937e-7,0.000022790466,0.00016233313,0.000008900301,0.00028890537,0.88424206,0.0009541473,0.014660271,0.0053799697,0.09401696],"study_design_scores_gemma":[0.00026687776,0.00013204376,0.000002669188,0.00009081972,0.000045589684,0.000038371843,0.000052597345,0.93713677,0.0014370584,0.0009305026,0.0596289,0.00023780926],"about_ca_topic_score_codex":0.000022356968,"about_ca_topic_score_gemma":0.000027141996,"teacher_disagreement_score":0.6960013,"about_ca_system_score_codex":0.00009196543,"about_ca_system_score_gemma":0.000093067814,"threshold_uncertainty_score":0.8385908},"labels":[],"label_agreement":null},{"id":"W4401070793","doi":"10.1109/tcomm.2024.3435514","title":"Device-to-Device Communications With Selection-Based Cooperative RIS","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","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":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Selection (genetic algorithm); Computer science; Electronic engineering; Engineering; Artificial intelligence","score_opus":0.028222871578996365,"score_gpt":0.2770088932361451,"score_spread":0.24878602165714872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401070793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006638077,0.0023832223,0.9708364,0.0058717793,0.00022202951,0.0008201908,0.00010126767,0.0018615007,0.017239798],"genre_scores_gemma":[0.95865816,0.0013988777,0.03734217,0.0007064333,0.000020460551,0.0010176549,0.00007762031,0.00011513229,0.0006634895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844974,0.00029889218,0.0004153742,0.00028527397,0.00023732528,0.0003133637],"domain_scores_gemma":[0.99482137,0.00079906895,0.00003214221,0.0038924206,0.00024383735,0.00021115025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023014058,0.00031995625,0.00024162183,0.0004799107,0.00092084374,0.00023177081,0.0017820725,0.00014443239,0.00020844788],"category_scores_gemma":[0.0000056565327,0.0003202248,0.00013137881,0.0022752916,0.00021376928,0.00021595314,0.000014877356,0.0010899468,0.0007700363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005622032,0.0007126223,0.000022048933,0.000119861834,0.0007317673,0.000003439623,0.0016098379,0.9227226,0.005447001,0.0044655954,0.006941386,0.057167623],"study_design_scores_gemma":[0.00031565138,0.000108635235,0.00003201173,0.00030158387,0.00013803769,0.00001395217,0.00012175186,0.78427005,0.0058759307,0.00003128122,0.20835203,0.00043909825],"about_ca_topic_score_codex":0.000081373866,"about_ca_topic_score_gemma":0.0025020088,"teacher_disagreement_score":0.95799434,"about_ca_system_score_codex":0.00025660679,"about_ca_system_score_gemma":0.00018896193,"threshold_uncertainty_score":0.99992496},"labels":[],"label_agreement":null},{"id":"W4401358046","doi":"10.1109/tcomm.2024.3439445","title":"User Sensing in RIS-Aided Wideband mmWave System With Beam-Squint and Beam-Split","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Wideband; Beam (structure); Computer science; Electronic engineering; Telecommunications; Optics; Physics; Engineering","score_opus":0.023981186207659683,"score_gpt":0.23591484589771358,"score_spread":0.2119336596900539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401358046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981953,0.0010680631,0.925951,0.00032651838,0.0001934563,0.0003103567,0.000031209926,0.0005536868,0.0017461906],"genre_scores_gemma":[0.99124664,0.00060477084,0.007823418,0.000035423018,0.000014619472,0.00005314518,0.000010077442,0.00005551471,0.00015637334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906635,0.00005578713,0.00032089776,0.00020993155,0.00012585128,0.00022120889],"domain_scores_gemma":[0.9988465,0.00020859082,0.00001940235,0.0007820765,0.000049103837,0.00009435174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021962542,0.00018313489,0.00018320367,0.00032557058,0.00021688972,0.0001258055,0.00016663694,0.00008526454,0.000014194784],"category_scores_gemma":[0.0000024645494,0.00017587088,0.00005091496,0.00037418958,0.00007264292,0.0001991205,0.0000040056393,0.00048367426,0.000033724875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059079986,0.00018118034,0.000032003652,0.0009861395,0.0005049673,0.000030811876,0.0075702644,0.8377354,0.07911628,0.00090550294,0.00020413955,0.07267419],"study_design_scores_gemma":[0.00046224194,0.000053127642,0.00005375949,0.0010353875,0.000103830025,0.000100085635,0.0009873105,0.9505726,0.044320803,0.00006453843,0.0018764549,0.0003698761],"about_ca_topic_score_codex":0.00014613854,"about_ca_topic_score_gemma":0.0007763582,"teacher_disagreement_score":0.92142713,"about_ca_system_score_codex":0.00019383732,"about_ca_system_score_gemma":0.000034022956,"threshold_uncertainty_score":0.71718067},"labels":[],"label_agreement":null},{"id":"W4401415032","doi":"10.1109/tcomm.2024.3440875","title":"Learned Trimmed-Ridge Regression for Channel Estimation in Millimeter-Wave Massive MIMO","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ridge; MIMO; Extremely high frequency; Channel (broadcasting); Computer science; Regression; Electronic engineering; Geology; Telecommunications; Statistics; Mathematics; Engineering","score_opus":0.08766293036883493,"score_gpt":0.3098626632485247,"score_spread":0.22219973287968975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401415032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040051052,0.0011924529,0.9903998,0.0017104435,0.0006285389,0.0006558383,0.00015423313,0.0005113608,0.00074222527],"genre_scores_gemma":[0.9785491,0.0016438686,0.018472368,0.00007087682,0.000022263546,0.00068507245,0.000113033835,0.00006770756,0.00037566855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988768,0.000080473335,0.0004230779,0.00024326809,0.0001340171,0.00024232922],"domain_scores_gemma":[0.99860966,0.00041225736,0.00003194179,0.00080259895,0.00006654668,0.00007699053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024991704,0.0002095884,0.00019695808,0.00054258143,0.00024549355,0.00008571504,0.00026637843,0.00014222396,0.000037121255],"category_scores_gemma":[0.000012545923,0.00021117764,0.00015541723,0.00045930967,0.000048940256,0.00025442027,0.0000037301527,0.0004562394,0.000071391274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048530906,0.00023739308,2.775442e-7,0.00028927904,0.000146012,0.0000031698357,0.0026384026,0.74038476,0.04304384,0.00023022432,0.0010065761,0.21197152],"study_design_scores_gemma":[0.00039007716,0.00005294323,0.0000037476013,0.000316792,0.000047569138,0.0000051134093,0.00013588778,0.9253632,0.07046976,0.0008530341,0.0021523628,0.00020951596],"about_ca_topic_score_codex":0.000017115844,"about_ca_topic_score_gemma":0.00008192139,"teacher_disagreement_score":0.97454405,"about_ca_system_score_codex":0.00018477079,"about_ca_system_score_gemma":0.000041953062,"threshold_uncertainty_score":0.8611574},"labels":[],"label_agreement":null},{"id":"W4401568031","doi":"10.1109/tcomm.2024.3443740","title":"Parallelized Block-Based Distribution Matching","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Network Technologies","field":"Engineering","cited_by":0,"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","funders":"Huawei Technologies","keywords":"Block (permutation group theory); Computer science; Matching (statistics); Algorithm; Distribution (mathematics); Mathematics; Statistics","score_opus":0.020111770240884414,"score_gpt":0.25652057856643934,"score_spread":0.23640880832555491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401568031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068092076,0.0010434262,0.9819233,0.002559386,0.00044970826,0.00019490594,0.0001286006,0.004867744,0.002023752],"genre_scores_gemma":[0.9845697,0.00078569644,0.014281052,0.000028487393,0.000013549742,0.00016940394,0.00003857842,0.000034187295,0.00007932163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993374,0.000033318734,0.00020366328,0.000130509,0.000104077815,0.00019108498],"domain_scores_gemma":[0.9984764,0.00036828106,0.000008191863,0.001078754,0.00002344979,0.000044956625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008733173,0.00013678648,0.000112437774,0.00010640324,0.00022394104,0.00008985379,0.00047243797,0.00011516016,0.00004225996],"category_scores_gemma":[0.0000035627388,0.00014106823,0.00010259355,0.00047832614,0.00011313474,0.000110012115,0.0000027197043,0.0005808032,0.000254163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075141256,0.0001472999,0.0000012729006,0.000075924196,0.00012211288,0.0000035085702,0.00009057496,0.92923135,0.0015786316,0.015665743,0.0021729497,0.05090314],"study_design_scores_gemma":[0.00016182299,0.000028378057,0.000020253303,0.00014690799,0.000060158025,0.0000055942646,0.000045517467,0.9616519,0.003990312,0.0024287335,0.031231107,0.00022926992],"about_ca_topic_score_codex":0.000009441141,"about_ca_topic_score_gemma":0.00004330358,"teacher_disagreement_score":0.9777605,"about_ca_system_score_codex":0.00013353403,"about_ca_system_score_gemma":0.000020673378,"threshold_uncertainty_score":0.57525957},"labels":[],"label_agreement":null},{"id":"W4401568511","doi":"10.1109/tcomm.2024.3443737","title":"Counterfactual Quantum Protocols for Dialogue, Teleportation, and Comparison","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Quantum Computing Algorithms and Architecture","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":"Memorial University of Newfoundland","funders":"Queen's University; Kyung Hee University; Queen's University Belfast","keywords":"Teleportation; Quantum teleportation; Computer science; Quantum channel; Superdense coding; Counterfactual thinking; Quantum; Quantum entanglement; Electronic engineering; Computer network; Telecommunications; Physics; Quantum mechanics; Engineering; Psychology","score_opus":0.047096189818737665,"score_gpt":0.34189919099485916,"score_spread":0.2948030011761215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401568511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001490017,0.0002532047,0.99087095,0.0036055406,0.0003513382,0.0027613179,0.000059116413,0.0004917267,0.00011677191],"genre_scores_gemma":[0.930574,0.000043863536,0.06559639,0.000121048506,0.000036443693,0.0034834244,0.000010412322,0.000019522953,0.00011492451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00007935546,0.00033661767,0.00033334957,0.00015393994,0.00019939663],"domain_scores_gemma":[0.997809,0.00084036414,0.00005860298,0.0011199573,0.00009281476,0.00007923824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025921015,0.00015564673,0.00016992514,0.0001788838,0.0006344608,0.00040223316,0.00087215396,0.000064661566,0.000004259494],"category_scores_gemma":[0.000009434951,0.00014356257,0.00008707728,0.0003534936,0.00012077081,0.00023976424,0.000010782423,0.00034558718,0.00001955862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038354017,0.0010802515,0.0000256033,0.00030552445,0.0002602989,0.000005961881,0.009589669,0.044500247,0.0015965886,0.13073774,0.0046718903,0.80718786],"study_design_scores_gemma":[0.00019551102,0.00019753381,0.000062618914,0.00011992975,0.000016702483,0.00002002192,0.000046172478,0.9603164,0.0010673475,0.005379568,0.03240497,0.00017318253],"about_ca_topic_score_codex":0.000025407018,"about_ca_topic_score_gemma":0.00005900939,"teacher_disagreement_score":0.92908394,"about_ca_system_score_codex":0.000030702366,"about_ca_system_score_gemma":0.00010415721,"threshold_uncertainty_score":0.58543116},"labels":[],"label_agreement":null},{"id":"W4401879106","doi":"10.1109/tcomm.2024.3447781","title":"Fast Successive-Cancellation Decoding of 2 × 2 Kernel Non-Binary Polar Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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; Huawei Technologies (Canada)","funders":"","keywords":"Decoding methods; Binary number; Computer science; Polar; Algorithm; Binary code; Kernel (algebra); Sequential decoding; Single antenna interference cancellation; Electronic engineering; Mathematics; Arithmetic; Block code; Discrete mathematics; Physics; Engineering","score_opus":0.019163258678105723,"score_gpt":0.2856103899155721,"score_spread":0.2664471312374664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401879106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004233185,0.002383479,0.98493296,0.00036592467,0.00024034939,0.00027915664,0.00015215867,0.0012281908,0.006184612],"genre_scores_gemma":[0.9632135,0.006683179,0.02958066,0.000015742064,0.000014091331,0.00018099698,0.00003664037,0.000065270666,0.00020989656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990003,0.0000719438,0.00043383215,0.0001666458,0.00015225892,0.0001749796],"domain_scores_gemma":[0.9974214,0.00056572846,0.000056030112,0.0018013272,0.00009674657,0.000058793034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001397882,0.00018913107,0.00020954238,0.00036596594,0.00027139252,0.000047950918,0.0008922083,0.0001117218,0.00006891332],"category_scores_gemma":[0.0000051118373,0.00021698287,0.00012428942,0.00064194674,0.00017866869,0.00040026195,0.000009693889,0.0005447886,0.000048940594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023271365,0.00038882846,0.00004654011,0.00048915826,0.0003490427,0.0000025733002,0.0027571525,0.5801401,0.17342089,0.0077432394,0.0010435856,0.2335956],"study_design_scores_gemma":[0.0001485803,0.000047691676,0.00008891094,0.0005130314,0.000060605485,0.000004971372,0.00020912694,0.84168047,0.15131176,0.0009718134,0.0046532988,0.0003097577],"about_ca_topic_score_codex":0.000053355507,"about_ca_topic_score_gemma":0.00012531456,"teacher_disagreement_score":0.9589803,"about_ca_system_score_codex":0.00017416678,"about_ca_system_score_gemma":0.00004462928,"threshold_uncertainty_score":0.8848304},"labels":[],"label_agreement":null},{"id":"W4401906854","doi":"10.1109/tcomm.2024.3450586","title":"SF-Adaptive Duty-Cycled LoRa Networks: Scalability, Reliability, and Latency Tradeoffs","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","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":"Engineering and Physical Sciences Research Council","keywords":"Scalability; Computer science; Reliability (semiconductor); Latency (audio); Reliability engineering; Computer network; Embedded system; Electronic engineering; Real-time computing; Engineering; Telecommunications; Operating system","score_opus":0.02739282850427004,"score_gpt":0.2634692032686514,"score_spread":0.23607637476438137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401906854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049622604,0.003734866,0.9711884,0.0024695317,0.0011674669,0.004538924,0.000102457336,0.0019971968,0.009838888],"genre_scores_gemma":[0.9925563,0.002115352,0.0029107265,0.000046489185,0.00007026212,0.0020176354,0.0000088908,0.000060181676,0.00021421211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987807,0.00015107157,0.00037018233,0.00028147225,0.00013107769,0.0002854825],"domain_scores_gemma":[0.9977777,0.00064769754,0.000017983635,0.0013842965,0.00004824971,0.00012409857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003350284,0.00023258869,0.00022027365,0.00013040079,0.00037082043,0.00015077292,0.00046097246,0.00018005581,0.000108803],"category_scores_gemma":[0.0000035989858,0.00023325082,0.0001311308,0.0005623776,0.00023256047,0.00027335156,0.000008600089,0.0008824083,0.000068604095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004936758,0.00037537745,0.000044037246,0.00022889045,0.00025388694,0.0000046528407,0.0011828435,0.82833874,0.00021040835,0.003567531,0.0023996313,0.1633446],"study_design_scores_gemma":[0.00022871197,0.00009701365,0.0003063912,0.00022157271,0.0000769269,0.000013410503,0.000056688605,0.9805092,0.0002159028,0.003956854,0.014011332,0.00030596304],"about_ca_topic_score_codex":0.000044450175,"about_ca_topic_score_gemma":0.00018053735,"teacher_disagreement_score":0.987594,"about_ca_system_score_codex":0.00011768326,"about_ca_system_score_gemma":0.00003365635,"threshold_uncertainty_score":0.9511692},"labels":[],"label_agreement":null},{"id":"W4402129557","doi":"10.1109/tcomm.2024.3453399","title":"Rate Adaptation in Delay-Sensitive and Energy-Constrained Large-Scale IoT Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"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 Abdullah University of Science and Technology","keywords":"Computer science; Adaptation (eye); Scale (ratio); Energy (signal processing); Computer network; Electronic engineering; Engineering; Mathematics; Statistics; Physics","score_opus":0.01671568903830576,"score_gpt":0.24189795354700083,"score_spread":0.22518226450869508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402129557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021779167,0.00072608236,0.9922791,0.0025172164,0.0004224348,0.00010309165,0.000014013062,0.00037882334,0.0013813337],"genre_scores_gemma":[0.96841407,0.0012158478,0.029490678,0.00035721654,0.000023998287,0.00007986184,0.000012712232,0.000023638519,0.00038198623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837345,0.0003851469,0.00033911163,0.00043146487,0.00014383701,0.00032700735],"domain_scores_gemma":[0.9976266,0.00090289296,0.000049384747,0.0012407792,0.000078944126,0.00010142617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038514062,0.00019520895,0.00017760307,0.0003652851,0.0003922783,0.0002188208,0.00067106885,0.00013903514,0.000006762787],"category_scores_gemma":[0.0000035981243,0.00021017269,0.000081531456,0.0011601968,0.00016588114,0.00028708344,0.00001757877,0.0005313324,0.00001279961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008330509,0.00018934191,0.0000018279329,0.000004858263,0.00003419406,0.000012718395,0.0015988266,0.8962955,0.00017555794,0.036540445,0.000055620952,0.06508278],"study_design_scores_gemma":[0.00024921188,0.000041239113,0.000061107974,0.00012367066,0.00001763312,0.000027969245,0.0002185521,0.99604404,0.0003778232,0.0002971409,0.0023369696,0.00020466484],"about_ca_topic_score_codex":0.00013464876,"about_ca_topic_score_gemma":0.0033975367,"teacher_disagreement_score":0.9662361,"about_ca_system_score_codex":0.00009714443,"about_ca_system_score_gemma":0.00007702259,"threshold_uncertainty_score":0.85705936},"labels":[],"label_agreement":null},{"id":"W4402265864","doi":"10.1109/tcomm.2024.3454702","title":"Profit Maximization for Multi-Time-Scale Hierarchical DRL-Based Joint Optimization in MEC-Enabled Air-Ground Integrated Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","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":"Carleton University","funders":"Scientific Research Foundation of Education Department of Anhui Province of China; National Natural Science Foundation of China","keywords":"Maximization; Profit maximization; Computer science; Joint (building); Scale (ratio); Mathematical optimization; Profit (economics); Engineering; Mathematics; Economics; Geography; Civil engineering","score_opus":0.03500127704073615,"score_gpt":0.2687114211379617,"score_spread":0.23371014409722557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402265864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007411556,0.000821426,0.9937452,0.0015046668,0.00035300993,0.0011384486,0.00016133014,0.0009981373,0.0005365984],"genre_scores_gemma":[0.79364145,0.0010352631,0.20244202,0.000093467905,0.000023232613,0.0015748048,0.0006040883,0.00011660078,0.00046905034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839664,0.00020192469,0.00063790614,0.00029750416,0.00013357979,0.00033246374],"domain_scores_gemma":[0.997553,0.00045761353,0.00004446878,0.0016800556,0.00015495588,0.000109941946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003900776,0.00028843907,0.00028677148,0.0006223469,0.00039475897,0.00013468646,0.00070798345,0.00019653545,0.000101422884],"category_scores_gemma":[0.000016438948,0.00030698744,0.00018398419,0.0012879106,0.0001268146,0.00032850023,0.000008641457,0.00083296053,0.000038180122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026258365,0.00027681713,0.0000044589733,0.000051612024,0.00005384334,5.253187e-7,0.00018050255,0.99250174,0.0005101819,0.00022205936,0.0002754838,0.0058965194],"study_design_scores_gemma":[0.0007592648,0.00005304907,0.00006166636,0.00025240873,0.00007010616,0.00000331271,0.000052275213,0.99394614,0.0010825631,0.00007444407,0.0033403654,0.00030443651],"about_ca_topic_score_codex":0.00005846552,"about_ca_topic_score_gemma":0.00043137764,"teacher_disagreement_score":0.7929003,"about_ca_system_score_codex":0.0003525268,"about_ca_system_score_gemma":0.00012909438,"threshold_uncertainty_score":0.99993825},"labels":[],"label_agreement":null},{"id":"W4402475164","doi":"10.1109/tcomm.2024.3459851","title":"Reduced-Complexity Projection-Aggregation List Decoder for Reed-Muller Codes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","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":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Soft-decision decoder; Reed–Muller code; Decoding methods; Projection (relational algebra); Algorithm; Theoretical computer science; Electronic engineering; Telecommunications; Block code; Concatenated error correction code; Engineering","score_opus":0.1000569589430676,"score_gpt":0.36026396986538434,"score_spread":0.26020701092231674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402475164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000683832,0.0002812749,0.9831151,0.0076029417,0.0012073591,0.000878146,0.000053456406,0.0028550562,0.0033228784],"genre_scores_gemma":[0.6977246,0.0001770456,0.29975876,0.00015233348,0.000043234002,0.0009290501,0.000014012426,0.000034073426,0.0011669111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983487,0.00018902528,0.00042032532,0.00052426534,0.00023609833,0.00028156475],"domain_scores_gemma":[0.99598545,0.0009619484,0.000088227236,0.0025944256,0.00028699508,0.00008292557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005510018,0.00022515462,0.00019042811,0.00045288625,0.0010860678,0.00043581286,0.0017819495,0.00013421412,0.000025913982],"category_scores_gemma":[0.000039662475,0.00023644736,0.00022311525,0.0010390081,0.00019576211,0.0007773646,0.000019524676,0.0005499967,0.00007027227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007596643,0.0017737527,0.00002594693,0.00028815804,0.00041726363,0.000004059412,0.008159273,0.0015568972,0.017152619,0.28229544,0.019996043,0.66825455],"study_design_scores_gemma":[0.00029814267,0.00029353698,0.000068189656,0.0004039144,0.000091907554,0.00008024676,0.00013365332,0.8320456,0.07050015,0.04326902,0.05218341,0.000632217],"about_ca_topic_score_codex":0.00025565588,"about_ca_topic_score_gemma":0.0012014211,"teacher_disagreement_score":0.83048874,"about_ca_system_score_codex":0.00026212042,"about_ca_system_score_gemma":0.00021475235,"threshold_uncertainty_score":0.9642043},"labels":[],"label_agreement":null},{"id":"W4402571484","doi":"10.1109/tcomm.2024.3462688","title":"Output-Constrained Lossy Source Coding With Application to Rate-Distortion-Perception Theory","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Data Compression Techniques","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":"Lossy compression; Rate–distortion theory; Computer science; Rate distortion; Electronic engineering; Coding (social sciences); Distortion (music); Perception; Algorithm; Mathematics; Data compression; Telecommunications; Engineering; Artificial intelligence; Statistics; Bandwidth (computing); Amplifier; Psychology","score_opus":0.02080988183123293,"score_gpt":0.293523723734041,"score_spread":0.27271384190280806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402571484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026423862,0.000075514894,0.99254006,0.0031084507,0.00016892927,0.0006241073,0.000048764632,0.0020495635,0.0011203921],"genre_scores_gemma":[0.84260404,0.00011077925,0.15530625,0.00037604236,0.000019913597,0.0006956944,0.000024414794,0.000031069107,0.00083180703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839497,0.00025791203,0.00033438124,0.000536615,0.00024060904,0.00023550319],"domain_scores_gemma":[0.9960109,0.00057606626,0.000069084665,0.0030734614,0.00012367297,0.00014683748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004530023,0.00021873118,0.00016255635,0.00041289482,0.0006783285,0.0002581504,0.001815014,0.000082935134,0.00003252562],"category_scores_gemma":[0.000011400514,0.00020106236,0.000082526385,0.0010442542,0.0001697267,0.00083989254,0.000028906654,0.0004640674,0.00030845145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003782963,0.0002772151,0.0000024806259,0.000029525123,0.000055785345,0.000002013341,0.0015886826,0.013619538,0.019577153,0.06224318,0.00080388045,0.9017627],"study_design_scores_gemma":[0.000669068,0.0005822298,0.00029333073,0.0009705146,0.00014796278,0.0001292593,0.00077199197,0.755184,0.062134482,0.023688037,0.15390363,0.0015255088],"about_ca_topic_score_codex":0.000028655779,"about_ca_topic_score_gemma":0.00005330165,"teacher_disagreement_score":0.9002372,"about_ca_system_score_codex":0.00022174684,"about_ca_system_score_gemma":0.000104275576,"threshold_uncertainty_score":0.8199085},"labels":[],"label_agreement":null},{"id":"W4402673386","doi":"10.1109/tcomm.2024.3465375","title":"Enhanced Learning-Based Hybrid Optimization Framework for RSMA-Aided Underlay LEO Communication With Non-Collaborative Terrestrial Primary Network","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"Underlay; Computer science; Computer network; Computer architecture; Distributed computing; Telecommunications; Signal-to-noise ratio (imaging)","score_opus":0.022098703310058077,"score_gpt":0.2694166547637589,"score_spread":0.24731795145370083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402673386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021181165,0.004188333,0.98563534,0.0010511831,0.00062448095,0.001768846,0.000088248424,0.0015296581,0.0049021193],"genre_scores_gemma":[0.8194664,0.0028749234,0.17440723,0.000090204834,0.00009579284,0.0021995218,0.00047194597,0.00016697028,0.00022700812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997749,0.00048642562,0.0007118553,0.00036875368,0.00029123027,0.0003927892],"domain_scores_gemma":[0.9928985,0.0033826928,0.00014973365,0.0031731287,0.00027291654,0.00012300228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051306334,0.00040389106,0.00041878305,0.00032505524,0.0009935485,0.0003494435,0.0013280013,0.00022759357,0.000055271874],"category_scores_gemma":[0.000026406617,0.00042130117,0.00018410219,0.0014147571,0.0002501256,0.00043971758,0.000010957978,0.0011647284,0.00007998706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011108349,0.00012386721,0.0000018419619,0.000102080914,0.00024616896,3.7936354e-7,0.00076070917,0.9815089,0.00022702433,0.0005419575,0.0004953241,0.015880678],"study_design_scores_gemma":[0.0009975749,0.00022924294,0.000012612206,0.0009148308,0.00018950562,0.0000053921594,0.00036866736,0.9662133,0.0057321796,0.00061673875,0.024153009,0.0005669608],"about_ca_topic_score_codex":0.000020903632,"about_ca_topic_score_gemma":0.00015475677,"teacher_disagreement_score":0.8192546,"about_ca_system_score_codex":0.0004558603,"about_ca_system_score_gemma":0.00028139184,"threshold_uncertainty_score":0.99982387},"labels":[],"label_agreement":null},{"id":"W4402831789","doi":"10.1109/tcomm.2024.3468211","title":"Linearization of Fully-Connected Hybrid Beamforming Transmitters Using Analytical Multi-Input Models for Millimeter-Wave Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Natural Science Basic Research Program of Shaanxi Province; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Beamforming; Linearization; Extremely high frequency; Transmitter; Electronic engineering; Computer science; Telecommunications; Engineering; Physics; Nonlinear system","score_opus":0.13458883250029358,"score_gpt":0.3085188945485586,"score_spread":0.173930062048265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402831789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077682245,0.00088032044,0.9885396,0.00046549414,0.0003069877,0.0007427038,0.0005187598,0.0005376727,0.00024023479],"genre_scores_gemma":[0.8007132,0.0011054422,0.19765669,0.00005168763,0.000018478138,0.00016632237,0.00015341275,0.000084807136,0.000049994367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998317,0.00010832855,0.000806953,0.00027749024,0.0001900557,0.00030014775],"domain_scores_gemma":[0.99713445,0.0006092385,0.0000657216,0.0018267337,0.00024176679,0.0001221009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030144208,0.0002800347,0.00032829613,0.00058938976,0.00039905784,0.00009253603,0.0006672336,0.00013294535,0.000028693661],"category_scores_gemma":[0.000012221292,0.00031231914,0.00033016113,0.00060985517,0.00019256659,0.0004309812,0.00001033008,0.0004967317,0.000008874703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017364451,0.00025836952,4.192537e-7,0.00023097967,0.00036398834,4.885634e-7,0.0012555575,0.8964329,0.072778195,0.00057299377,0.000027819582,0.02806092],"study_design_scores_gemma":[0.0004189795,0.000048091228,9.344905e-7,0.00023373254,0.0003044681,0.0000139620015,0.00012720384,0.94820166,0.049301356,0.0003717159,0.0006914248,0.00028646216],"about_ca_topic_score_codex":0.000042953383,"about_ca_topic_score_gemma":0.00007046309,"teacher_disagreement_score":0.7929449,"about_ca_system_score_codex":0.00019023368,"about_ca_system_score_gemma":0.00009324053,"threshold_uncertainty_score":0.9999329},"labels":[],"label_agreement":null},{"id":"W4402915682","doi":"10.1109/tcomm.2024.3469542","title":"Rate-Splitting for Cell-Free Massive MIMO: Performance Analysis and Generative AI Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"MIMO; Computer science; Electronic engineering; Theoretical computer science; Algorithm; Telecommunications; Engineering; Beamforming","score_opus":0.019266319526402943,"score_gpt":0.2542887351162682,"score_spread":0.23502241558986525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402915682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011183204,0.0009634548,0.99483424,0.00041749788,0.0001683226,0.00047864017,0.0001418152,0.00041147327,0.0014662548],"genre_scores_gemma":[0.8577949,0.0010308936,0.1398,0.000030301644,0.000022509577,0.00067935145,0.0000652361,0.000045050117,0.0005317513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992298,0.000060137205,0.00025201906,0.00022284659,0.00006391159,0.0001713018],"domain_scores_gemma":[0.9984537,0.0003252401,0.000029868024,0.0010450934,0.00008972132,0.00005641298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016336491,0.0001707116,0.00019342382,0.000354923,0.00041858354,0.000103654165,0.00033109018,0.00008417855,0.0000076251604],"category_scores_gemma":[0.00000525278,0.00018125091,0.00011186871,0.0008720263,0.000066319204,0.00033814125,0.0000046538185,0.00029301023,0.0000076153574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004452303,0.000041732193,0.000004944425,0.0001531804,0.00032013239,1.1595323e-7,0.00073814683,0.99138004,0.0021339692,0.00028718563,0.0001898004,0.004746305],"study_design_scores_gemma":[0.00020774658,0.000025807885,0.000011288161,0.000034689456,0.00037396085,0.000001510442,0.00021506763,0.98606,0.011828807,0.00007252931,0.000987837,0.00018070698],"about_ca_topic_score_codex":0.000008424681,"about_ca_topic_score_gemma":0.000042286658,"teacher_disagreement_score":0.8566766,"about_ca_system_score_codex":0.000107360145,"about_ca_system_score_gemma":0.000023664637,"threshold_uncertainty_score":0.73911977},"labels":[],"label_agreement":null},{"id":"W4402915697","doi":"10.1109/tcomm.2024.3469555","title":"Quantum Property Learning for NISQ Networks: Universal Quantum Witness Machines","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Quantum Computing Algorithms and Architecture","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":"Memorial University of Newfoundland","funders":"Queen's University; Kyung Hee University; Queen's University Belfast","keywords":"Computer science; Property (philosophy); Quantum; Quantum computer; Theoretical computer science; Quantum network; Physics; Quantum mechanics","score_opus":0.02382551532390113,"score_gpt":0.27054382374946895,"score_spread":0.24671830842556783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402915697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007032484,0.0006145456,0.985176,0.010573898,0.0011810408,0.00037662082,0.000015402038,0.0011263817,0.0002328475],"genre_scores_gemma":[0.96820915,0.00024976744,0.030162329,0.00017712935,0.00008835524,0.00012289148,0.000013968201,0.00004258534,0.0009338436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985001,0.00022018651,0.00029141124,0.00045475434,0.00018255864,0.00035099426],"domain_scores_gemma":[0.9972842,0.0009677398,0.00005950799,0.001444367,0.0001364031,0.0001078345],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003287891,0.00023896604,0.0002047246,0.00025533387,0.0013481658,0.0003734767,0.0018574051,0.00009846535,0.000009229315],"category_scores_gemma":[0.0000119327615,0.00018213346,0.00019553959,0.0009932311,0.00014660564,0.00033850307,0.000029169561,0.00085456285,0.000035409645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015838295,0.00022827771,0.0000022707588,0.000052371524,0.00010598135,0.0000043274586,0.0012359327,0.69165903,0.00020295651,0.05725866,0.0004750359,0.24875933],"study_design_scores_gemma":[0.00020451755,0.00015912214,0.000012188924,0.00015373435,0.00003274696,0.000031430292,0.00005437729,0.97088075,0.000102391044,0.003399076,0.024708802,0.00026089477],"about_ca_topic_score_codex":0.00013360943,"about_ca_topic_score_gemma":0.00008991359,"teacher_disagreement_score":0.9675059,"about_ca_system_score_codex":0.00006786729,"about_ca_system_score_gemma":0.00015618351,"threshold_uncertainty_score":0.99995196},"labels":[],"label_agreement":null},{"id":"W4403059543","doi":"10.1109/tcomm.2024.3472001","title":"Non-Coherent Communication Over Ultra-Fast Fading Channels in the Presence of Barrage Jamming","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"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":"Fading; Jamming; Electronic engineering; Computer science; Telecommunications; Computer network; Engineering; Channel (broadcasting); Physics","score_opus":0.020352973862138267,"score_gpt":0.2688338815762117,"score_spread":0.2484809077140734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403059543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067686928,0.0015121244,0.98478025,0.0003894864,0.00042408946,0.0007062374,0.00004213936,0.00025859926,0.005118389],"genre_scores_gemma":[0.995,0.0017295472,0.0026748064,0.000014958084,0.000014914702,0.00039196742,0.000017766211,0.000040846422,0.00011518663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989632,0.00013826098,0.00042836802,0.00014417445,0.00015138049,0.00017465564],"domain_scores_gemma":[0.9975006,0.00066675636,0.00004382985,0.0017113663,0.000046269743,0.00003115024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033106,0.00015655861,0.00016247739,0.00026832012,0.00020667259,0.00006709361,0.00093540136,0.000082917904,0.000029084615],"category_scores_gemma":[0.00000792571,0.00014577706,0.000082798804,0.00079734565,0.00009997235,0.0003983579,0.000004256931,0.0005489811,0.000021379989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031159143,0.00008124942,0.0000053219424,0.000106910935,0.000036616595,5.7337996e-7,0.0098516345,0.9727672,0.0069370973,0.00037023076,0.00012506693,0.0097150095],"study_design_scores_gemma":[0.00021790463,0.000028619661,0.00004695913,0.0007601246,0.000036508354,0.000009811459,0.0017961496,0.9824766,0.01302783,0.00020185231,0.0011952164,0.00020242331],"about_ca_topic_score_codex":0.000097418226,"about_ca_topic_score_gemma":0.00026761665,"teacher_disagreement_score":0.9882313,"about_ca_system_score_codex":0.00012838078,"about_ca_system_score_gemma":0.000022479971,"threshold_uncertainty_score":0.59446156},"labels":[],"label_agreement":null},{"id":"W4403060886","doi":"10.1109/tcomm.2024.3471968","title":"Exploiting Active STAR-RIS to Enable URLLC in Digitally-Twinned Internet-of-Things Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","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":"Memorial University of Newfoundland","funders":"National Science and Technology Council; Engineering and Physical Sciences Research Council; Canada Excellence Research Chairs, Government of Canada","keywords":"The Internet; Computer science; Star (game theory); Computer network; Physics; World Wide Web","score_opus":0.03136073566344771,"score_gpt":0.2727278462796461,"score_spread":0.24136711061619837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403060886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006911622,0.00021313057,0.9832559,0.0018801645,0.002328827,0.0002667429,0.0000011355964,0.0003374341,0.0048050242],"genre_scores_gemma":[0.95906,0.00007269689,0.040034775,0.00023179948,0.00007000934,0.00008615634,0.0000039520637,0.000024053765,0.00041654735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985345,0.00012335191,0.00044993265,0.00036219327,0.00018319166,0.0003468398],"domain_scores_gemma":[0.9975302,0.0008051976,0.00006409178,0.0013985749,0.00009946467,0.00010243848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030734608,0.00017805406,0.00021011094,0.00048603409,0.00022894844,0.00028745015,0.0018323357,0.000083427236,0.0000065612176],"category_scores_gemma":[0.000016280288,0.0001924493,0.00012778411,0.001443773,0.00006491589,0.0010714147,0.00006475502,0.00062996865,0.000059519352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004134008,0.00076897064,0.00003219385,0.00008753013,0.00019275198,0.00001603112,0.03927453,0.027029809,0.0012060356,0.0053141173,0.002542928,0.92349374],"study_design_scores_gemma":[0.00018696777,0.00013056862,0.000065366716,0.00055838213,0.000016261041,0.0000091176225,0.00024357614,0.9766628,0.0069173924,0.0014792767,0.013431003,0.0002992512],"about_ca_topic_score_codex":0.00036375187,"about_ca_topic_score_gemma":0.000046355806,"teacher_disagreement_score":0.9521484,"about_ca_system_score_codex":0.00018600874,"about_ca_system_score_gemma":0.000102723796,"threshold_uncertainty_score":0.78478545},"labels":[],"label_agreement":null},{"id":"W4403183026","doi":"10.1109/tcomm.2024.3475270","title":"Joint Channel Estimation, User Activity Identification, and Pilot Contamination Attack Detection for mmWave Grant-Free Massive MTC Networks: A Three-Dimensional Compressive Sensing-Based Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":1,"is_retracted":false,"has_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":"Natural Science Basic Research Program of Shaanxi Province; National Natural Science Foundation of China","keywords":"Compressed sensing; Joint (building); Identification (biology); Channel (broadcasting); Electronic engineering; Computer science; Engineering; Telecommunications; Algorithm; Structural engineering","score_opus":0.06367440333539089,"score_gpt":0.2648081269570482,"score_spread":0.20113372362165732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403183026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066765514,0.00043166446,0.98941875,0.00076286955,0.00057569623,0.0012489611,0.0001868296,0.0006305104,0.00006815796],"genre_scores_gemma":[0.97893244,0.000100319725,0.020023283,0.000059925893,0.000044053875,0.00053506886,0.0001516353,0.000077934055,0.00007536254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985332,0.0001288639,0.00047610616,0.00038815837,0.00022689211,0.00024678482],"domain_scores_gemma":[0.9978644,0.00050512236,0.00010315584,0.0010703992,0.00035100966,0.00010590803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036929882,0.00029063076,0.00024957888,0.00040157992,0.0007812635,0.00021597446,0.0002606961,0.0001430374,0.000007977646],"category_scores_gemma":[0.000028833723,0.00031750865,0.00013336487,0.000388919,0.00014689752,0.00040610143,0.000009182552,0.00046132877,0.000010777232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041318257,0.0001420813,2.3176909e-7,0.00014108677,0.00012695379,3.3285892e-7,0.00020582479,0.9579536,0.018139841,0.000066788125,0.00020136584,0.022980595],"study_design_scores_gemma":[0.00070274627,0.000090018664,0.000071004295,0.00015674758,0.00016719432,0.000012008646,0.000046689893,0.9599964,0.037773855,0.0005893344,0.00009667737,0.00029734368],"about_ca_topic_score_codex":0.000052615535,"about_ca_topic_score_gemma":0.00048516793,"teacher_disagreement_score":0.9722559,"about_ca_system_score_codex":0.00020391417,"about_ca_system_score_gemma":0.000051013012,"threshold_uncertainty_score":0.9999277},"labels":[],"label_agreement":null},{"id":"W4403278240","doi":"10.1109/tcomm.2024.3476090","title":"THz Network Placement and Mobility-Aware Resource Allocation for Indoor Hybrid THz/VLC Wireless Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless; Computer network; Electronic engineering; Resource allocation; Terahertz radiation; Visible light communication; Telecommunications; Electrical engineering; Engineering; Optoelectronics; Materials science; Light-emitting diode","score_opus":0.02784014856313798,"score_gpt":0.255103599195668,"score_spread":0.22726345063253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403278240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005147882,0.0019276335,0.98997813,0.0006677563,0.00038819667,0.000768812,0.00007982052,0.0005903761,0.00045138234],"genre_scores_gemma":[0.99191916,0.0021194858,0.0045963605,0.00013085578,0.00008247715,0.00076348905,0.00010908517,0.00006298186,0.00021611442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989324,0.00008265612,0.00036415,0.0002505126,0.000116346455,0.00025394003],"domain_scores_gemma":[0.9984422,0.00046060845,0.000028156714,0.0009054631,0.00006892469,0.00009464691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003580228,0.00019533104,0.0001674448,0.00012507055,0.00049742596,0.00012891862,0.00029528185,0.000089598536,0.000027023616],"category_scores_gemma":[0.000002834164,0.00021021636,0.0000982581,0.00025001107,0.000072077855,0.00014959935,0.0000069043913,0.00042994888,0.000012658683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017522481,0.000074486576,0.0000016516948,0.00009825914,0.00011772257,2.4003668e-7,0.0003765594,0.95083535,0.0005003658,0.00021414888,0.001375545,0.046388123],"study_design_scores_gemma":[0.00023849888,0.000044076114,0.000005686876,0.00016041726,0.0000852691,0.000006274596,0.00016700664,0.9842882,0.0028776738,0.00021294234,0.011704659,0.00020926076],"about_ca_topic_score_codex":0.000010884289,"about_ca_topic_score_gemma":0.000091830916,"teacher_disagreement_score":0.9867713,"about_ca_system_score_codex":0.00010002043,"about_ca_system_score_gemma":0.000029753315,"threshold_uncertainty_score":0.85723746},"labels":[],"label_agreement":null},{"id":"W4403296935","doi":"10.1109/tcomm.2024.3478111","title":"Joint Task Offloading and Resource Allocation Strategy for Hybrid MEC-Enabled LEO Satellite Networks: A Hierarchical Game Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Joint (building); Resource allocation; Resource management (computing); Task (project management); Satellite; Game theory; Distributed computing; Communications satellite; Computer network; Engineering; Systems engineering","score_opus":0.05598929363202184,"score_gpt":0.26930614316860846,"score_spread":0.2133168495365866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403296935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011212741,0.021319944,0.9677911,0.0008280214,0.00026171692,0.0011164414,0.000094448165,0.0012462038,0.006220877],"genre_scores_gemma":[0.9773194,0.012623575,0.008149723,0.00006222703,0.00007174564,0.0010473226,0.00017395546,0.00012053885,0.00043151496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980748,0.00028739445,0.00068353745,0.0003834786,0.00019407079,0.00037668803],"domain_scores_gemma":[0.9964677,0.0009573511,0.000055559274,0.0022516248,0.00009744128,0.000170331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006603279,0.0003139153,0.00032994768,0.0003968156,0.0004505545,0.0003487256,0.00076660456,0.00015842466,0.000012821472],"category_scores_gemma":[0.000011624022,0.00034036528,0.00017470634,0.0006047345,0.00019611536,0.00031791674,0.000012916854,0.00083798676,0.000034483262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000622758,0.0003842732,0.0000050292992,0.0007868291,0.00076071994,0.0000020188236,0.0034434905,0.6628302,0.009204201,0.01340862,0.0010384145,0.30807397],"study_design_scores_gemma":[0.00031331222,0.00005193126,0.000040220595,0.00022736244,0.000099718556,0.00005342604,0.0003733872,0.88929474,0.0013414208,0.00054172275,0.10731376,0.0003490166],"about_ca_topic_score_codex":0.000023733974,"about_ca_topic_score_gemma":0.00004162945,"teacher_disagreement_score":0.97619814,"about_ca_system_score_codex":0.00021090859,"about_ca_system_score_gemma":0.00005721688,"threshold_uncertainty_score":0.9999048},"labels":[],"label_agreement":null},{"id":"W4403678738","doi":"10.1109/tcomm.2024.3485587","title":"Reconfigurable Massive MIMO: Precoding Design and Channel Estimation in the Electromagnetic Domain","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"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":"Beijing Nova Program; Beijing Municipal Natural Science Foundation; Natural Sciences and Engineering Research Council of Canada; Killam Trusts; Government of Jiangxi Province; Deutsche Forschungsgemeinschaft; Queen's University Belfast; National Natural Science Foundation of China; Northwestern University; Beijing Institute of Technology; Royal Academy of Engineering; Northwestern Polytechnical University; Queen's University; European Commission; Tsinghua University; Chalmers Tekniska Högskola; Alexander von Humboldt-Stiftung; Natural Science Foundation of Shandong Province; Leverhulme Trust","keywords":"Precoding; Electronic engineering; MIMO; Computer science; Channel (broadcasting); Zero-forcing precoding; Engineering; Telecommunications","score_opus":0.023852624585781728,"score_gpt":0.25262624621510255,"score_spread":0.22877362162932083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403678738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005484436,0.0014428919,0.99386925,0.00093391846,0.00017035722,0.00060826825,0.00000965215,0.00028636277,0.0021308386],"genre_scores_gemma":[0.9506328,0.0015523497,0.04707394,0.000021239166,0.00000766228,0.0005705358,0.000008503676,0.00003140195,0.000101565325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923176,0.00017516331,0.00022932125,0.0001371837,0.00006872274,0.00015784123],"domain_scores_gemma":[0.9987724,0.0005942747,0.000018644521,0.00056780706,0.000020454887,0.000026446603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002879272,0.00012423954,0.00010047827,0.00021593944,0.00021389511,0.000101622645,0.0002599601,0.00006546737,0.000015042458],"category_scores_gemma":[0.000005561711,0.00011504201,0.000029477458,0.00048106982,0.000046169152,0.00027955306,8.705015e-7,0.00034421156,0.00002635172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003215498,0.000025982534,1.0775491e-7,0.00004169248,0.000019613843,9.246823e-7,0.001967647,0.9852661,0.0027269106,0.00057653314,0.00011259359,0.009258683],"study_design_scores_gemma":[0.0001283719,0.000047063917,0.0000062746676,0.00015278428,0.000022962324,0.000023426232,0.0003391158,0.9937194,0.0023611656,0.0027542543,0.00032085285,0.00012430178],"about_ca_topic_score_codex":0.000014994045,"about_ca_topic_score_gemma":0.00007812798,"teacher_disagreement_score":0.9500843,"about_ca_system_score_codex":0.00011356163,"about_ca_system_score_gemma":0.000020099264,"threshold_uncertainty_score":0.46912768},"labels":[],"label_agreement":null},{"id":"W4403863666","doi":"10.1109/tcomm.2024.3487801","title":"A Riemannian Manifold Approach to Constrained Resource Allocation in ISAC","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"National Science Foundation","keywords":"Computer science; Riemannian manifold; Manifold (fluid mechanics); Resource (disambiguation); Mathematical optimization; Mathematics; Topology (electrical circuits); Engineering; Pure mathematics; Combinatorics; Computer network; Mechanical engineering","score_opus":0.018745533012262474,"score_gpt":0.24577700594199559,"score_spread":0.2270314729297331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403863666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025360743,0.00036461695,0.96603984,0.0010263267,0.00018887287,0.000655579,0.000052014377,0.00087164086,0.0305475],"genre_scores_gemma":[0.9756096,0.00011711839,0.02283808,0.000084722116,0.000022724364,0.00069613254,0.000035655008,0.000060286926,0.00053565874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897665,0.00008487035,0.00036379276,0.00022729962,0.00013492926,0.00021245705],"domain_scores_gemma":[0.99857956,0.0001792533,0.000016773934,0.0010998268,0.000036567486,0.000088007015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018019137,0.00017298247,0.00016534753,0.00044946725,0.0001373424,0.00008110018,0.00043466353,0.00009853938,0.000014089021],"category_scores_gemma":[0.000006056216,0.00020191356,0.000065722124,0.0009160464,0.00003852592,0.00022073011,0.0000027391777,0.00038756558,0.00013540706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069286493,0.000099046505,9.3127306e-7,0.00005399319,0.000044422693,7.315149e-7,0.0012271277,0.9794086,0.0021947292,0.0070842146,0.00023493604,0.009644319],"study_design_scores_gemma":[0.00027384018,0.000025281961,0.00002335769,0.00017152622,0.000028708957,0.00001401272,0.00038993073,0.97502124,0.00043696782,0.00018069935,0.023183092,0.0002513484],"about_ca_topic_score_codex":0.000034358545,"about_ca_topic_score_gemma":0.00021227647,"teacher_disagreement_score":0.97535604,"about_ca_system_score_codex":0.00026479436,"about_ca_system_score_gemma":0.000030929168,"threshold_uncertainty_score":0.8233796},"labels":[],"label_agreement":null},{"id":"W4404057520","doi":"10.1109/tcomm.2024.3492057","title":"Signal Enhancement and Suppression Schemes for Bi-Static ISAC With IRS-Mounted Target","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Systems and Laser Technology","field":"Engineering","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Electronic engineering; Computer science; SIGNAL (programming language); Signal processing; Telecommunications; Electrical engineering; Engineering; Radar","score_opus":0.015752107354227992,"score_gpt":0.2663865365476073,"score_spread":0.2506344291933793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404057520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069661727,0.00091088086,0.98924786,0.0012009992,0.0001416472,0.00038884094,0.000094975236,0.0004873864,0.0005612674],"genre_scores_gemma":[0.9792188,0.00030091815,0.019582978,0.000021989918,0.000008950499,0.00050310296,0.00001577406,0.000029485738,0.00031801054],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994494,0.000018591494,0.00017208463,0.00013471996,0.000071288756,0.0001539666],"domain_scores_gemma":[0.9991947,0.00022234205,0.00001069964,0.0004927213,0.00003082554,0.000048735208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006421688,0.000118545395,0.00012348869,0.00011686669,0.00018937378,0.000051264353,0.00018597291,0.000073803545,0.00007462317],"category_scores_gemma":[0.000001607656,0.00009875321,0.000036622434,0.0001914093,0.0000960814,0.00010241311,0.0000023228745,0.00023274813,0.000020338404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036650855,0.0026307888,0.000050296698,0.0049863453,0.0036077087,0.000017826254,0.005514316,0.12591684,0.40026164,0.1190762,0.020368403,0.31720313],"study_design_scores_gemma":[0.000383442,0.00024188183,0.0000052413334,0.00032794737,0.00008676423,0.000010194959,0.00020935465,0.78224546,0.06637728,0.00073593773,0.14914739,0.00022913056],"about_ca_topic_score_codex":0.000010808902,"about_ca_topic_score_gemma":0.000044286047,"teacher_disagreement_score":0.9722526,"about_ca_system_score_codex":0.000051417734,"about_ca_system_score_gemma":0.000017853732,"threshold_uncertainty_score":0.4027039},"labels":[],"label_agreement":null},{"id":"W4404563375","doi":"10.1109/tcomm.2024.3502667","title":"Quantum-Enhanced Federated Learning for Metaverse-Empowered Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Privacy-Preserving Technologies in Data","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":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada; National Science and Technology Council; Canada Research Chairs","keywords":"Computer science; Computer network","score_opus":0.048211720136368964,"score_gpt":0.30970884862535425,"score_spread":0.26149712848898526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404563375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027635344,0.00082877715,0.9760452,0.018130193,0.00081134227,0.00044873834,0.000027643018,0.0029298665,0.0005019142],"genre_scores_gemma":[0.8585266,0.0010789635,0.13959286,0.00010358811,0.000014750573,0.0003841547,0.000034742916,0.00003178728,0.00023256824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998375,0.00020819312,0.000348277,0.000516636,0.00019613646,0.00035576892],"domain_scores_gemma":[0.9896793,0.0012105185,0.00006943152,0.008830574,0.00014008101,0.00007011245],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00046136198,0.00021412827,0.00021094058,0.0002882197,0.001138093,0.0005490391,0.015242437,0.0001873861,0.000022399014],"category_scores_gemma":[0.0005244093,0.00022109532,0.00018938197,0.001151388,0.00015830767,0.00071441586,0.0007287791,0.0009774236,0.00009889513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009058911,0.001336236,0.0000039847064,0.0002063205,0.001789705,0.000022295906,0.0012075348,0.34333777,0.021084787,0.051987313,0.10149939,0.47743407],"study_design_scores_gemma":[0.00020180734,0.00009129506,0.000003459861,0.00008973949,0.000043330296,0.0000071120567,0.00006203106,0.95619345,0.008767684,0.012537274,0.021772563,0.00023024317],"about_ca_topic_score_codex":0.00003154601,"about_ca_topic_score_gemma":0.000053125183,"teacher_disagreement_score":0.85825026,"about_ca_system_score_codex":0.0001386806,"about_ca_system_score_gemma":0.00010749201,"threshold_uncertainty_score":0.9900856},"labels":[],"label_agreement":null},{"id":"W4404788505","doi":"10.1109/tcomm.2024.3506932","title":"Secure 3D Directional Modulation Using Subarrays Based on Planar Frequency Diverse Array With Nonuniform Frequency Offsets","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Optimization","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Institute for Information and Communications Technology Promotion; Iran Telecommunication Research Center; National Research Foundation of Korea; Ministry of Science and ICT, South Korea; Queen's University; National Research Foundation; Queen's University Belfast","keywords":"Frequency modulation; Modulation (music); Planar; Electronic engineering; Computer science; Acoustics; Radio frequency; Telecommunications; Physics; Engineering","score_opus":0.02550333099564002,"score_gpt":0.23710782122754911,"score_spread":0.21160449023190908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023943398,0.00015584214,0.9893078,0.00028361272,0.00045069648,0.00033965378,0.00022902247,0.00083285396,0.006006147],"genre_scores_gemma":[0.9296716,0.0002103819,0.069655314,0.000059771515,0.000041611376,0.000083613195,0.00014519377,0.00006685909,0.00006568174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989244,0.00006864144,0.00027185754,0.00024761047,0.00026816255,0.00021936621],"domain_scores_gemma":[0.9987497,0.00016991804,0.00003553106,0.0008493912,0.000101504316,0.00009396205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105311694,0.000252281,0.00015616695,0.00043312207,0.00056068157,0.00009136197,0.00029722517,0.00014570664,0.00022152447],"category_scores_gemma":[0.0000029177704,0.0002451264,0.00009755047,0.00070962304,0.00009749973,0.00042228034,8.528759e-7,0.0005322617,0.000077298515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034270688,0.00017672904,0.000056983674,0.00006455488,0.000103053055,0.0000046563196,0.0005266208,0.9866578,0.008585145,0.00081568735,0.00007539441,0.0028990952],"study_design_scores_gemma":[0.00030363136,0.0000951554,0.00017809516,0.0003145327,0.000086476684,0.000013950601,0.00010775659,0.99703807,0.0011253937,0.0002081228,0.00023176943,0.00029705482],"about_ca_topic_score_codex":0.0001534079,"about_ca_topic_score_gemma":0.0004352628,"teacher_disagreement_score":0.9272772,"about_ca_system_score_codex":0.00034553587,"about_ca_system_score_gemma":0.00009964358,"threshold_uncertainty_score":0.9995965},"labels":[],"label_agreement":null},{"id":"W4404788734","doi":"10.1109/tcomm.2024.3507640","title":"Cooperative Relaying for Connected Construction Equipment Networks With Hybrid Hierarchical Proximal Policy Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Beijing Jiaotong University","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.034839173393217356,"score_gpt":0.29640736590646694,"score_spread":0.2615681925132496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012177976,0.0005660037,0.9834997,0.012565988,0.00031955488,0.0009915447,0.0000310601,0.000699994,0.0012043612],"genre_scores_gemma":[0.7453933,0.0020584308,0.2509921,0.0003728302,0.00006012939,0.00080257346,0.000055086937,0.00003301743,0.0002325897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823797,0.0003623393,0.00041161876,0.00046321086,0.0002011362,0.00032371312],"domain_scores_gemma":[0.9966884,0.00095894653,0.00008188901,0.0017525214,0.00038687224,0.0001313464],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00033170823,0.00025109053,0.00021861603,0.00040414807,0.0014879337,0.0005171109,0.0012685073,0.00008137571,0.000028517685],"category_scores_gemma":[0.000024550258,0.00022949789,0.00011125721,0.0014154026,0.00030138076,0.00067958777,0.000032965792,0.00065522396,0.00001240981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051023067,0.00021233014,0.0000015780644,0.000016274831,0.00014627508,0.0000015105512,0.0006744902,0.73896164,0.00019617668,0.15696381,0.00023866216,0.10253621],"study_design_scores_gemma":[0.0005140877,0.00027118888,0.0000052654777,0.00019198845,0.0000374388,0.00006228583,0.000058120117,0.99232954,0.000996333,0.0002936207,0.0049632136,0.00027689745],"about_ca_topic_score_codex":0.0000094550605,"about_ca_topic_score_gemma":0.00005423406,"teacher_disagreement_score":0.7452715,"about_ca_system_score_codex":0.00027953746,"about_ca_system_score_gemma":0.000432121,"threshold_uncertainty_score":0.999812},"labels":[],"label_agreement":null},{"id":"W4405056253","doi":"10.1109/tcomm.2024.3511942","title":"Performance Analysis of Multi-RIS-Aided LoRa Systems With Outdated and Imperfect CSI","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT Networks and Protocols","field":"Engineering","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é du Québec à Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Imperfect; Electronic engineering; Engineering","score_opus":0.027767240087969297,"score_gpt":0.2690430596930529,"score_spread":0.24127581960508362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405056253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11843855,0.0037166183,0.87046945,0.00015751357,0.00038009652,0.0036303804,0.0002503425,0.00092830055,0.0020287752],"genre_scores_gemma":[0.9963657,0.0012589726,0.0010634311,0.0000045146385,0.000008017648,0.0011149979,0.00001777445,0.000026000442,0.00014059499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993927,0.000052144118,0.00023037934,0.000116564566,0.000084835,0.00012336053],"domain_scores_gemma":[0.9989004,0.00016894641,0.00002184507,0.0008134726,0.000050236882,0.000045091656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013339173,0.00012460061,0.00021440494,0.00032333576,0.00014936607,0.00006231073,0.00022536224,0.0000646116,0.000019107592],"category_scores_gemma":[6.3172604e-7,0.00010732849,0.000068820074,0.001122096,0.00007889979,0.00014326515,0.000002004649,0.0002762922,0.000010223823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012867591,0.000060332895,0.00013060121,0.00018093352,0.0012656684,5.699833e-7,0.00051749486,0.98796624,0.00071415293,0.00004774906,0.00006937645,0.009034004],"study_design_scores_gemma":[0.00016642046,0.00006132422,0.00057452085,0.00018634571,0.0005673932,0.0000038461194,0.00006166791,0.9960555,0.00079401647,0.0000010285553,0.0014037554,0.00012420144],"about_ca_topic_score_codex":0.000086931934,"about_ca_topic_score_gemma":0.00022705994,"teacher_disagreement_score":0.8779271,"about_ca_system_score_codex":0.00003734581,"about_ca_system_score_gemma":0.000018998164,"threshold_uncertainty_score":0.43767288},"labels":[],"label_agreement":null},{"id":"W4405056259","doi":"10.1109/tcomm.2024.3511940","title":"Online Digital Twin-Empowered Content Resale Mechanism in Age of Information-Aware Edge Caching Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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":"China Scholarship Council; Science and Technology Commission of Shanghai Municipality; Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; National Natural Science Foundation of China","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Mechanism (biology); Computer network; Telecommunications","score_opus":0.04553048250129581,"score_gpt":0.2670242672641039,"score_spread":0.22149378476280807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405056259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006501652,0.0003265808,0.9898123,0.0014268364,0.00059790723,0.00022160177,0.00014966163,0.0002793955,0.00068404054],"genre_scores_gemma":[0.997458,0.00029507474,0.0017096193,0.00015631662,0.000011902625,0.00004315144,0.000081110455,0.000010858837,0.00023399775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988229,0.00011792914,0.0004956705,0.00017830612,0.00019753716,0.00018760304],"domain_scores_gemma":[0.9978396,0.00048942136,0.00006904611,0.0014458582,0.00008993012,0.00006610403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026864727,0.0001432714,0.00018047816,0.00041648184,0.000206614,0.00030198589,0.0012957418,0.00008132408,0.000005965976],"category_scores_gemma":[0.000012308718,0.00014595619,0.00015270154,0.00063771446,0.00006976208,0.0014052296,0.000028570741,0.0005992313,0.000026801623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015543238,0.0049015735,0.00011308056,0.00029093356,0.0006802648,0.00007994308,0.019866263,0.33836478,0.005106235,0.17028126,0.0010446775,0.45911556],"study_design_scores_gemma":[0.0003934799,0.000090531095,0.0001974882,0.00037126913,0.000020275305,0.000017822762,0.00051935326,0.99476165,0.00025007335,0.0009439132,0.0022052948,0.00022884132],"about_ca_topic_score_codex":0.00038706008,"about_ca_topic_score_gemma":0.00048812275,"teacher_disagreement_score":0.9909563,"about_ca_system_score_codex":0.000104795465,"about_ca_system_score_gemma":0.000096490105,"threshold_uncertainty_score":0.5951921},"labels":[],"label_agreement":null},{"id":"W4405056279","doi":"10.1109/tcomm.2024.3511959","title":"Aerial Reconfigurable Intelligent Surfaces-Enabled Secured Wireless Communications: Performance Analysis and Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; European Commission; McMaster University","keywords":"Wireless; Computer science; Computer network; Computer architecture; Telecommunications","score_opus":0.02467703200065774,"score_gpt":0.260722545284927,"score_spread":0.23604551328426926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405056279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007959542,0.005613878,0.97918624,0.0012018109,0.0002980752,0.00047676338,0.00010716715,0.0026794216,0.00247708],"genre_scores_gemma":[0.87058145,0.09280187,0.035805218,0.000022491122,0.000007916495,0.0004175007,0.00010507969,0.00006150647,0.00019699839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985083,0.00015871423,0.0005777032,0.0002998912,0.0001731196,0.00028230192],"domain_scores_gemma":[0.99482,0.0006261977,0.00006756003,0.004266886,0.00013302469,0.00008632544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027902215,0.00029540888,0.00034643777,0.0008333107,0.00071299,0.00022165217,0.0017191072,0.00020261097,0.000114276656],"category_scores_gemma":[0.000010432108,0.0003262994,0.0001444425,0.0023505995,0.00042615185,0.000601314,0.00002756323,0.0008607383,0.000059041988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008684718,0.00008620881,0.00001054069,0.00006247523,0.0005504295,2.684433e-7,0.00042383335,0.9081926,0.0010436666,0.00091266446,0.00006235833,0.088646315],"study_design_scores_gemma":[0.00014669371,0.00003462839,0.000034654233,0.000118195865,0.0002622777,0.000005895562,0.00032374682,0.97814155,0.0153383985,0.00017268758,0.0050851163,0.00033612948],"about_ca_topic_score_codex":0.000048439015,"about_ca_topic_score_gemma":0.00031512152,"teacher_disagreement_score":0.9433811,"about_ca_system_score_codex":0.00022977756,"about_ca_system_score_gemma":0.000048391787,"threshold_uncertainty_score":0.9999189},"labels":[],"label_agreement":null},{"id":"W4405907220","doi":"10.1109/tcomm.2024.3523961","title":"Smart Helper-Aided F-RANs: Improving Delay and Reducing Fronthaul Load","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":1,"is_retracted":false,"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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Reynolds-averaged Navier–Stokes equations; Computer science; Computer network; Electronic engineering; Engineering; Computational fluid dynamics; Aerospace engineering","score_opus":0.021889517049378512,"score_gpt":0.26064661059643196,"score_spread":0.23875709354705343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405907220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011770143,0.022521878,0.9484387,0.00107959,0.0011686804,0.0006980762,0.00012403935,0.0023398679,0.011859045],"genre_scores_gemma":[0.9834513,0.004139477,0.011227893,0.000038951413,0.00002330166,0.00030711506,0.000010737059,0.000086527536,0.00071470067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986828,0.000116281226,0.0004652846,0.00027549505,0.00019725146,0.00026287633],"domain_scores_gemma":[0.9966717,0.0005737337,0.00003301154,0.002519687,0.00008160945,0.00012031026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003112566,0.0002427839,0.00022758562,0.00021994858,0.0004811341,0.00015335252,0.0007158472,0.000120845914,0.00007557672],"category_scores_gemma":[0.000010139144,0.0002705788,0.00011079002,0.00045138446,0.00014953218,0.0004158231,0.000012096826,0.000792313,0.00013718262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043525775,0.00040488856,0.000014292237,0.0009181986,0.0009430209,0.000013728782,0.020784695,0.22086541,0.11568582,0.0026469433,0.0018942511,0.6357852],"study_design_scores_gemma":[0.00047662298,0.000058288995,0.000033242224,0.00065725896,0.00014403717,0.00012984395,0.0012033285,0.8958222,0.013161135,0.00037133525,0.08729982,0.00064283615],"about_ca_topic_score_codex":0.0003512718,"about_ca_topic_score_gemma":0.0008054426,"teacher_disagreement_score":0.9716812,"about_ca_system_score_codex":0.00038449475,"about_ca_system_score_gemma":0.00009698138,"threshold_uncertainty_score":0.99997467},"labels":[],"label_agreement":null},{"id":"W4406311201","doi":"10.1109/tcomm.2025.3529209","title":"Performance Analysis of Holographic MIMO Based Integrated Sensing and Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"CHIST-ERA; Engineering and Physical Sciences Research Council; China Scholarship Council","keywords":"MIMO; Electronic engineering; Computer science; Telecommunications; Engineering; Beamforming","score_opus":0.01906864819779537,"score_gpt":0.2487661049935463,"score_spread":0.22969745679575093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406311201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13179082,0.0008254573,0.8592343,0.0005815943,0.00015413153,0.00017695047,0.00006750343,0.0005124895,0.0066568134],"genre_scores_gemma":[0.97136533,0.0026473873,0.025756445,0.000062971994,0.000001728407,0.00003552435,0.00004893684,0.000018532157,0.00006312168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911946,0.00014879937,0.00036976047,0.00013536688,0.00007879927,0.00014779989],"domain_scores_gemma":[0.99633604,0.00082733296,0.00005563752,0.0026082941,0.00012959543,0.000043091775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018674944,0.00015105432,0.00026825877,0.0010085108,0.00037913537,0.000025601064,0.00069972395,0.00011491658,0.000008005471],"category_scores_gemma":[0.000009075731,0.00016997839,0.00011886617,0.0032154114,0.00043778485,0.00008336097,0.00000881677,0.0004841525,0.0000013966744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062753975,0.00011593786,0.0008777058,0.00003636279,0.0008301858,1.0496791e-7,0.00011400246,0.9548141,0.0014549247,0.00034012884,0.00004205423,0.04136822],"study_design_scores_gemma":[0.0001617496,0.000014438787,0.0044844444,0.00015512553,0.00070935214,5.934497e-7,0.000059495957,0.9916104,0.0019347062,0.000018692668,0.00072481623,0.00012619716],"about_ca_topic_score_codex":0.00012216116,"about_ca_topic_score_gemma":0.0015297752,"teacher_disagreement_score":0.8395745,"about_ca_system_score_codex":0.000050732822,"about_ca_system_score_gemma":0.000035537818,"threshold_uncertainty_score":0.6931518},"labels":[],"label_agreement":null},{"id":"W4406311207","doi":"10.1109/tcomm.2025.3529260","title":"Explainable Application Intent for Zero-Touch Networking: An Incorporation of Hypergraph and Transformer","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Hypergraph; Transformer; Computer science; Zero (linguistics); Electronic engineering; Electrical engineering; Mathematics; Engineering; Discrete mathematics; Voltage","score_opus":0.048377073338598295,"score_gpt":0.36221044477659864,"score_spread":0.31383337143800033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406311207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033729307,0.00026403324,0.97687227,0.0093001565,0.00017063615,0.0011130155,0.000022565053,0.00016731827,0.008717066],"genre_scores_gemma":[0.9809169,0.0029583448,0.014598719,0.00015252031,0.000010150436,0.0009183105,0.000033416178,0.000009991377,0.00040160815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990091,0.00020692087,0.00033638586,0.00017792704,0.00010789667,0.00016179508],"domain_scores_gemma":[0.9979147,0.00047292523,0.00011908383,0.0011717428,0.00026107885,0.00006048488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045579742,0.00009898311,0.00016174755,0.0003120893,0.0011679947,0.00002909846,0.00073151133,0.0001664806,0.000010007087],"category_scores_gemma":[0.00001916703,0.00011147942,0.0000695566,0.00064668484,0.0006072489,0.00021218357,0.000004206242,0.00021458085,0.0000021285646],"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.00008605893,0.0010402296,0.00024694495,0.000037924194,0.000087965185,2.4398787e-8,0.00575435,0.000340877,0.0054806857,0.5060554,0.00024404906,0.48062545],"study_design_scores_gemma":[0.0032133344,0.00052514224,0.0006702948,0.00023105365,0.0004079666,0.000002071406,0.01927354,0.083091386,0.025792878,0.16079473,0.70521206,0.0007855127],"about_ca_topic_score_codex":0.00084098976,"about_ca_topic_score_gemma":0.0067399093,"teacher_disagreement_score":0.977544,"about_ca_system_score_codex":0.00007058328,"about_ca_system_score_gemma":0.00013558147,"threshold_uncertainty_score":0.89833885},"labels":[],"label_agreement":null},{"id":"W4406417209","doi":"10.1109/tcomm.2025.3529659","title":"Joint Interference Management and Traffic Offloading in Integrated Terrestrial and Non-Terrestrial Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Université Laval","funders":"","keywords":"Interference (communication); Joint (building); Computer science; Computer network; Telecommunications; Engineering","score_opus":0.020545441888456365,"score_gpt":0.2503002576300801,"score_spread":0.22975481574162376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406417209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015113012,0.0003530623,0.9820593,0.000116404815,0.00057144713,0.0004975339,0.000006608732,0.00016190017,0.0011207222],"genre_scores_gemma":[0.99192744,0.0021420647,0.0056000133,0.000013429567,0.000011659979,0.00017110984,0.0000107165815,0.00001732675,0.00010622123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992216,0.00006806961,0.00035238828,0.00016740647,0.000040302715,0.00015021826],"domain_scores_gemma":[0.99925303,0.00012708882,0.00003056079,0.0005395924,0.000008996642,0.000040732575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112555004,0.00015111518,0.0001817837,0.00035710132,0.0001481296,0.00005809054,0.0002081813,0.000089204754,0.0000033011236],"category_scores_gemma":[0.000003467807,0.00016769921,0.000028446339,0.00043428122,0.000079616686,0.00015224442,0.000007489083,0.0003855301,0.0000018766801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003123227,0.000053621534,0.000010729116,0.000021070511,0.000051392995,8.2271293e-7,0.00024091448,0.9319097,0.00011822677,0.00005498178,0.00006054628,0.06744678],"study_design_scores_gemma":[0.0010278726,0.000024147863,0.00013452712,0.00041073217,0.00003604474,0.00000240329,0.00028761328,0.9973845,0.00019184293,0.0000405247,0.0003203272,0.00013950079],"about_ca_topic_score_codex":0.000042445783,"about_ca_topic_score_gemma":0.0006279133,"teacher_disagreement_score":0.97681445,"about_ca_system_score_codex":0.00011983443,"about_ca_system_score_gemma":0.000012469792,"threshold_uncertainty_score":0.6838575},"labels":[],"label_agreement":null},{"id":"W4406858232","doi":"10.1109/tcomm.2025.3534576","title":"NOMA-Assisted Semi-Grant-Free Transmission for UAV Networks: A Multi-User Scheduling Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Western University","funders":"Natural Science Foundation of Anhui Province; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Noma; Scheduling (production processes); Computer science; Computer network; Transmission (telecommunications); Telecommunications; Engineering; Telecommunications link","score_opus":0.03938552843464514,"score_gpt":0.2853721639322381,"score_spread":0.24598663549759292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406858232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023568873,0.0029400259,0.99047595,0.0012095494,0.00020836873,0.0009595317,0.00007702751,0.002402354,0.0014914958],"genre_scores_gemma":[0.6051409,0.0032615184,0.38940078,0.00006325293,0.0000062022036,0.001371135,0.00005220885,0.000057353034,0.0006465991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856347,0.00009457584,0.000556379,0.0002984172,0.00012312095,0.00036405027],"domain_scores_gemma":[0.99439454,0.0006853605,0.000071557166,0.0046243635,0.00015052634,0.00007368104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001940151,0.0003173201,0.00033745397,0.00043823765,0.00091349595,0.00006410716,0.0026877401,0.00031235407,0.000009661928],"category_scores_gemma":[0.000028046976,0.00034888013,0.00023651743,0.0010162856,0.00023975625,0.00024701282,0.00002344359,0.00088194775,0.000008617442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020041389,0.0004389935,0.000004992167,0.000085310814,0.00015613984,1.00133065e-7,0.00013196774,0.89360183,0.0024169984,0.002744574,0.0003456488,0.10005341],"study_design_scores_gemma":[0.0014461224,0.000025509016,0.000051649615,0.00019635749,0.00008812162,0.0000030210174,0.00047234286,0.96313196,0.0077171144,0.0005381842,0.025978304,0.00035128658],"about_ca_topic_score_codex":0.000013465723,"about_ca_topic_score_gemma":0.000096657226,"teacher_disagreement_score":0.60490525,"about_ca_system_score_codex":0.00019748356,"about_ca_system_score_gemma":0.00004744799,"threshold_uncertainty_score":0.99989635},"labels":[],"label_agreement":null},{"id":"W4406858266","doi":"10.1109/tcomm.2025.3534527","title":"RIS Alignment via Virtual Partitioning for Resilient Uplink Multi-RIS-Assisted UAV Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"Telecommunications link; Computer science; Computer network; Electronic engineering; Engineering","score_opus":0.06650032825176445,"score_gpt":0.321050210440961,"score_spread":0.25454988218919655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406858266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051166746,0.0037463715,0.9845919,0.0029752087,0.00075425144,0.0015735975,0.00022164275,0.0011083576,0.004516978],"genre_scores_gemma":[0.9330181,0.0058285217,0.05528444,0.0002496163,0.000018940591,0.0036629997,0.00023179775,0.00008909333,0.0016165067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974681,0.0004160582,0.0011036008,0.00035074633,0.00022878469,0.00043268176],"domain_scores_gemma":[0.9894202,0.0016810758,0.00015499517,0.008249835,0.00033991717,0.00015401727],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005826808,0.000378251,0.00041372818,0.0005211988,0.0017558585,0.00014452422,0.0029865731,0.00025049952,0.000044416647],"category_scores_gemma":[0.000030346331,0.0004534726,0.00030863218,0.0010026656,0.00036463884,0.0002581262,0.000049413706,0.0007393533,0.00018199539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002644456,0.009032996,0.0005167992,0.0006980694,0.0040867557,0.0000016937394,0.010349924,0.26661408,0.05819885,0.030467842,0.011540101,0.60822845],"study_design_scores_gemma":[0.0025490345,0.00012768526,0.0010534564,0.000586845,0.0003638111,0.0000110020965,0.0015776756,0.6835401,0.017772283,0.0005754272,0.2909378,0.00090486184],"about_ca_topic_score_codex":0.00010097329,"about_ca_topic_score_gemma":0.0009069115,"teacher_disagreement_score":0.93250644,"about_ca_system_score_codex":0.00060557673,"about_ca_system_score_gemma":0.00010384597,"threshold_uncertainty_score":0.9997917},"labels":[],"label_agreement":null},{"id":"W4406949003","doi":"10.1109/tcomm.2025.3535882","title":"Constituent Automorphism Decoding of Reed-Muller Codes","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Coding theory and cryptography","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Reed–Muller code; List decoding; Computer science; Mathematics; Concatenated error correction code; Telecommunications; Block code","score_opus":0.026309699697830938,"score_gpt":0.2870004848657971,"score_spread":0.2606907851679662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012335764,0.0002166592,0.9760909,0.0025935816,0.0003763618,0.00015648498,0.00001914087,0.00021436496,0.019098949],"genre_scores_gemma":[0.9499385,0.00026468435,0.049094748,0.00030162843,0.0000028910863,0.000055580498,0.0000017337092,0.000004514319,0.00033573198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990672,0.00016899087,0.00030455764,0.00019401936,0.000120817764,0.00014444062],"domain_scores_gemma":[0.99687296,0.0006322687,0.00008094622,0.002248802,0.00011858728,0.000046437093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029806458,0.00011265979,0.00016525819,0.0003883779,0.00054228876,0.00005116129,0.0017987371,0.000060098035,0.00004231655],"category_scores_gemma":[0.000009576409,0.00011909612,0.0001517244,0.00094015966,0.0003438195,0.00018192802,0.000020661591,0.00025866195,0.000020495641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012643557,0.00045149296,0.00003522983,0.000015208541,0.00010774802,5.0376815e-7,0.00048165148,0.0011396607,0.0026433389,0.94773006,0.00046950372,0.046912953],"study_design_scores_gemma":[0.0042886958,0.00061313907,0.0015453651,0.0018086812,0.000554459,0.000053930245,0.0010296858,0.31092578,0.23235533,0.29269606,0.15232721,0.0018016681],"about_ca_topic_score_codex":0.000036551,"about_ca_topic_score_gemma":0.00007570709,"teacher_disagreement_score":0.9487049,"about_ca_system_score_codex":0.00004084392,"about_ca_system_score_gemma":0.000115932315,"threshold_uncertainty_score":0.4856599},"labels":[],"label_agreement":null},{"id":"W4406949338","doi":"10.1109/tcomm.2025.3535878","title":"Personalized Federated Learning for Cellular VR: Online Learning and Dynamic Caching","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Caching and Content Delivery","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":"King Abdullah University of Science and Technology","keywords":"Computer science; Human–computer interaction; Online learning; Multimedia","score_opus":0.02282307567392406,"score_gpt":0.2909144032025605,"score_spread":0.26809132752863646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406949338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01839658,0.0008359649,0.9764861,0.0030436479,0.00017215927,0.0002180269,0.000008362872,0.00033954938,0.0004996091],"genre_scores_gemma":[0.9839708,0.00060094363,0.008960764,0.0001848889,0.0000050670546,0.00007210132,0.000025443294,0.000012255387,0.006167689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989548,0.00026247263,0.0002214379,0.00027664902,0.00009812513,0.00018651284],"domain_scores_gemma":[0.9985442,0.00067328505,0.00006515465,0.00055310916,0.00011220075,0.000052025818],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00025594237,0.00013889387,0.0001649312,0.00022498441,0.002039316,0.00022537897,0.00060231076,0.00006869937,0.0000039480133],"category_scores_gemma":[0.000027318292,0.00015286996,0.00011200926,0.00034083138,0.0000835508,0.00020250324,0.000017264298,0.000691163,0.0000045990955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013560674,0.0014132517,0.0002094924,0.00014122215,0.0006075249,0.000004023596,0.004207301,0.115666844,0.09867338,0.015666405,0.00013456038,0.7631404],"study_design_scores_gemma":[0.0006231433,0.000071365524,0.000040371127,0.00009286442,0.00004811338,0.0000043241025,0.0005044931,0.9881206,0.00046251246,0.0002472504,0.009622588,0.00016233242],"about_ca_topic_score_codex":0.00012092205,"about_ca_topic_score_gemma":0.00022241112,"teacher_disagreement_score":0.96752536,"about_ca_system_score_codex":0.00007767605,"about_ca_system_score_gemma":0.00006778209,"threshold_uncertainty_score":0.9992599},"labels":[],"label_agreement":null},{"id":"W4407129048","doi":"10.1109/tcomm.2025.3538830","title":"QoE-Oriented Hybrid Semantic and Bit Communications Under Mismatched Knowledge","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Robotics and Automated Systems","field":"Engineering","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Bit (key); Electronic engineering; Bit error rate; Computer network; Computer architecture; Engineering; Channel (broadcasting)","score_opus":0.02362569454684672,"score_gpt":0.27473106836976885,"score_spread":0.25110537382292214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407129048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007986316,0.0043040053,0.95533866,0.003634436,0.0007733748,0.00058217195,0.000094517636,0.0012127288,0.026073817],"genre_scores_gemma":[0.9912388,0.0030877464,0.0040826146,0.00008018513,0.0000072938014,0.00017034312,0.000028125109,0.000036842,0.0012680526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989848,0.00013606323,0.0004103072,0.00017074871,0.00008317132,0.00021492252],"domain_scores_gemma":[0.9964791,0.00040630985,0.000037853704,0.0028910825,0.00010292843,0.000082711136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015437086,0.00020080221,0.00023741278,0.00031922356,0.00069293985,0.000077360564,0.00084383576,0.00009126768,0.000016905627],"category_scores_gemma":[0.0000044245867,0.00022169926,0.00008774937,0.0006092165,0.00021835789,0.00011206532,0.000017841889,0.00045315776,0.00009466905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005740744,0.006960524,0.00028673132,0.0018756103,0.0050022276,0.00000675095,0.010286924,0.5885382,0.07650918,0.13978834,0.026563132,0.14412497],"study_design_scores_gemma":[0.00068262394,0.000024273377,0.00028814885,0.00035454353,0.00018231642,0.000014833968,0.0006532402,0.959833,0.0059114653,0.000936429,0.030750195,0.00036891195],"about_ca_topic_score_codex":0.000057775498,"about_ca_topic_score_gemma":0.00034758088,"teacher_disagreement_score":0.98325247,"about_ca_system_score_codex":0.00010403163,"about_ca_system_score_gemma":0.000049749782,"threshold_uncertainty_score":0.90406334},"labels":[],"label_agreement":null},{"id":"W4407129083","doi":"10.1109/tcomm.2025.3538825","title":"Joint Transmission Mode Selection and Scheduling for AoI Minimization in NOMA-Capable WP-IoT Networks: A Deep Transfer Learning Solution","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Body Area Networks","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noma; Computer science; Joint (building); Scheduling (production processes); Transmission (telecommunications); Selection (genetic algorithm); Internet of Things; Minification; Transfer of learning; Data transmission; Distributed computing; Electronic engineering; Computer network; Artificial intelligence; Telecommunications link; Mathematical optimization; Engineering; Telecommunications; Embedded system; Mathematics","score_opus":0.017097912223009798,"score_gpt":0.2476384517630057,"score_spread":0.2305405395399959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407129083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01771585,0.0010153566,0.9790537,0.000563439,0.0001706038,0.0006871156,0.000005696247,0.00041748575,0.00037076182],"genre_scores_gemma":[0.96930957,0.0024011969,0.027501132,0.00003832151,0.000023590655,0.00053583883,0.00003954016,0.000052063766,0.00009873284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869025,0.00013813392,0.00048481624,0.0002635572,0.000094991155,0.00032823905],"domain_scores_gemma":[0.9990981,0.00030029548,0.000028806598,0.0004181632,0.000084871295,0.00006973283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000240883,0.00022696947,0.00026067154,0.0004564779,0.00068221614,0.00006514149,0.00021728854,0.00025225032,0.000011964176],"category_scores_gemma":[0.00000694909,0.00027847476,0.00010370405,0.00079378806,0.00006050763,0.000228635,0.0000024123133,0.00070758077,0.0000018212546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044450713,0.000115694056,0.00002129559,0.00007274886,0.00004920975,1.0473396e-7,0.0004506851,0.9483258,0.004359323,0.00027918402,0.00002085814,0.046260625],"study_design_scores_gemma":[0.0009110723,0.000046403933,0.00014277452,0.00030973664,0.00008142232,0.0000027120013,0.00014363094,0.993503,0.0035748156,0.00020458638,0.0008501882,0.00022969041],"about_ca_topic_score_codex":0.00007547385,"about_ca_topic_score_gemma":0.001357591,"teacher_disagreement_score":0.95159376,"about_ca_system_score_codex":0.00024586494,"about_ca_system_score_gemma":0.000042467113,"threshold_uncertainty_score":0.99996674},"labels":[],"label_agreement":null},{"id":"W4407168756","doi":"10.1109/tcomm.2025.3538832","title":"Transmission Design and Optimization for STAR-RIS-Assisted Symbiotic Radio Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":2,"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 Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Transmission (telecommunications); Computer science; Star (game theory); Radio frequency; Telecommunications; Electronic engineering; Engineering; Physics","score_opus":0.04765365984188698,"score_gpt":0.2746973401533905,"score_spread":0.22704368031150352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407168756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001563379,0.007816843,0.9880694,0.00056431594,0.00042477227,0.0015255897,0.000042134066,0.00061973144,0.00078088307],"genre_scores_gemma":[0.84438,0.00969144,0.14432988,0.00003556564,0.000009830196,0.00092369085,0.000043378237,0.000059089878,0.0005270832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998619,0.00031875688,0.00052859547,0.00020617248,0.00011842809,0.00020904183],"domain_scores_gemma":[0.9966316,0.0011926409,0.000058679103,0.001870399,0.00015679683,0.00008988024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003873008,0.00021982094,0.00027213313,0.00036766732,0.00061570376,0.00012699114,0.00070383126,0.00017515244,0.000012514393],"category_scores_gemma":[0.000008284676,0.00024286413,0.00008991354,0.0005731047,0.0001054133,0.00018374887,0.0000037998052,0.00029046336,0.000008175723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034704368,0.00014729846,0.0000023459913,0.00025113294,0.0001770545,1.1204736e-7,0.00043278982,0.9644795,0.002732231,0.0008388297,0.00033129292,0.03057272],"study_design_scores_gemma":[0.00069085666,0.00004159827,0.000025959558,0.00031386525,0.00011333386,0.0000069523758,0.00024391808,0.98067397,0.0026028492,0.00006952363,0.014996852,0.00022033419],"about_ca_topic_score_codex":0.000027018876,"about_ca_topic_score_gemma":0.000009767259,"teacher_disagreement_score":0.84422374,"about_ca_system_score_codex":0.00019516662,"about_ca_system_score_gemma":0.00005790777,"threshold_uncertainty_score":0.99037117},"labels":[],"label_agreement":null},{"id":"W4407360756","doi":"10.1109/tcomm.2025.3541031","title":"Computation-and-Communication Efficient Coordinated Multicast Beamforming in Massive MIMO Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamforming; Computer science; Multicast; MIMO; Computer network; 3G MIMO; Computation; Electronic engineering; Telecommunications; Engineering; Algorithm","score_opus":0.010845922898898469,"score_gpt":0.2595270424442462,"score_spread":0.24868111954534772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407360756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018986923,0.0008170446,0.9930925,0.00049443456,0.00020972175,0.0005589871,0.000014314007,0.00034137213,0.002572959],"genre_scores_gemma":[0.9632266,0.00086568017,0.03542328,0.00004324263,0.000003727958,0.00027400954,0.00003500621,0.000029574514,0.00009889148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896145,0.00012733332,0.0004631784,0.00017595437,0.00006788993,0.00020422043],"domain_scores_gemma":[0.998277,0.0005406298,0.00005918772,0.0009535984,0.000108219225,0.00006132986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001718661,0.00017974997,0.0002049744,0.00042985828,0.00038594092,0.000046631714,0.0003829379,0.00012464005,0.0000075280213],"category_scores_gemma":[0.000016917988,0.00021594632,0.000046688165,0.0008946222,0.00012673903,0.00015623962,0.000009784284,0.00047896232,0.000009051943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006797184,0.00010105529,0.000016130787,0.000020939193,0.000029704654,2.1030596e-7,0.00035329387,0.9858914,0.00018672478,0.00069406495,0.000028093931,0.012671569],"study_design_scores_gemma":[0.0005753217,0.000009896456,0.000108077584,0.0002349217,0.00002821457,0.000002015766,0.0003997707,0.9976607,0.00049684336,0.00012666556,0.000191579,0.00016597704],"about_ca_topic_score_codex":0.000064167296,"about_ca_topic_score_gemma":0.00031075042,"teacher_disagreement_score":0.9613279,"about_ca_system_score_codex":0.00025806588,"about_ca_system_score_gemma":0.000028198536,"threshold_uncertainty_score":0.8806035},"labels":[],"label_agreement":null},{"id":"W4407361295","doi":"10.1109/tcomm.2025.3541047","title":"Conditional Generative Adversarial Networks for Channel Estimation in RIS-Assisted ISAC Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","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":"Memorial University of Newfoundland","funders":"Canada Research Chairs","keywords":"Computer science; Channel (broadcasting); Adversarial system; Generative grammar; Computer network; Electronic engineering; Engineering; Artificial intelligence","score_opus":0.04958479910581601,"score_gpt":0.3073108358533916,"score_spread":0.25772603674757555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407361295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017596454,0.00011576362,0.9919978,0.0047791707,0.0009879192,0.0010532389,0.000074281954,0.0001980133,0.00061785494],"genre_scores_gemma":[0.9608056,0.000047369835,0.03674091,0.00020872508,0.000027503265,0.0016397028,0.00014936019,0.000012522445,0.00036830458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829143,0.00032969733,0.0005541354,0.00037372782,0.00019552758,0.0002554642],"domain_scores_gemma":[0.9969579,0.0010508522,0.000182807,0.0014371184,0.0003045687,0.00006675681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042522687,0.0001803334,0.00021730257,0.00051083876,0.0007129703,0.00017413545,0.001119833,0.00016493963,0.00000548035],"category_scores_gemma":[0.000028480228,0.00020741473,0.00010801638,0.001034785,0.000113322014,0.0005679903,0.00001083709,0.0003197923,0.0000150368305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025002202,0.00035995196,0.0000062575186,0.000012943285,0.000050723207,1.6495915e-7,0.00020346281,0.8845597,0.0003029624,0.10725762,0.00037332662,0.006847868],"study_design_scores_gemma":[0.0009280802,0.000041735082,0.0014757314,0.00007936754,0.000025169034,0.0000020836599,0.00006353816,0.99157107,0.00054792134,0.0045169466,0.0005785533,0.00016978908],"about_ca_topic_score_codex":0.00009349004,"about_ca_topic_score_gemma":0.00023241242,"teacher_disagreement_score":0.96062964,"about_ca_system_score_codex":0.00042592813,"about_ca_system_score_gemma":0.00022818777,"threshold_uncertainty_score":0.84581274},"labels":[],"label_agreement":null},{"id":"W4407374643","doi":"10.1109/tcomm.2025.3541092","title":"Robust and Secure Multi-User STAR-RIS-Aided Communications: Optimization Versus Machine Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Space Satellite Systems and Control","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Canada Excellence Research Chairs, Government of Canada; National Science and Technology Council; Canada Research Chairs","keywords":"Computer science; Star (game theory); Robustness (evolution); Electronic engineering; Engineering; Physics","score_opus":0.03455601189354794,"score_gpt":0.2572922130072263,"score_spread":0.22273620111367837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407374643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005560426,0.007908905,0.9841118,0.0018067338,0.00044639845,0.0005688047,0.000069875576,0.0006966508,0.0038348136],"genre_scores_gemma":[0.93070036,0.01604166,0.05059348,0.00007019276,0.00001183386,0.00032186133,0.00007296586,0.000053544205,0.002134128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892426,0.00021177954,0.0003606184,0.00018906481,0.00010749983,0.00020681106],"domain_scores_gemma":[0.9972944,0.00047078513,0.00005560165,0.0019856603,0.000119644916,0.000073874355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019068232,0.00021903036,0.00022948763,0.00027202544,0.00078197283,0.00010163998,0.0006990036,0.00014728264,0.000044448305],"category_scores_gemma":[0.0000166611,0.00024337647,0.00008533234,0.0005190748,0.00013887897,0.00021390415,0.000014942168,0.0007241759,0.00002370764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039446775,0.00016433331,0.0000583343,0.00004572728,0.0002668017,2.5260434e-7,0.0005946324,0.98590577,0.00038384704,0.0013805209,0.00011100573,0.011049321],"study_design_scores_gemma":[0.0015948534,0.000035635658,0.00007675898,0.00009725218,0.00011766515,0.0000017616082,0.00062656734,0.9610488,0.00022170127,0.000014499368,0.035945967,0.00021858313],"about_ca_topic_score_codex":0.00023079952,"about_ca_topic_score_gemma":0.0020022965,"teacher_disagreement_score":0.9335183,"about_ca_system_score_codex":0.00012663705,"about_ca_system_score_gemma":0.000034811066,"threshold_uncertainty_score":0.9924605},"labels":[],"label_agreement":null},{"id":"W4407693351","doi":"10.1109/tcomm.2025.3543216","title":"Ground-to-AAV and RIS-Assisted AAV-to-Ground Communication Under Channel Aging: Statistical Characterization and Outage Performance","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","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":"Channel (broadcasting); Characterization (materials science); Computer science; Communications system; Engineering; Electronic engineering; Telecommunications; Reliability engineering; Materials science","score_opus":0.019745642242155026,"score_gpt":0.25689375706329287,"score_spread":0.23714811482113785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407693351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07286279,0.00014140584,0.92178154,0.0030447624,0.00011704966,0.0006662583,0.00014172863,0.0003175025,0.000926935],"genre_scores_gemma":[0.97844857,0.0024902225,0.017228417,0.00046057065,0.000010372206,0.0005316008,0.00022123847,0.000041632356,0.0005674026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888176,0.00009830829,0.000396121,0.0002696286,0.00012748476,0.00022668735],"domain_scores_gemma":[0.99803,0.00026152015,0.00004733428,0.0013805829,0.0001275921,0.00015295311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019360904,0.0002264072,0.00021395687,0.0004179334,0.0008827114,0.00018903977,0.0004314321,0.000120047356,0.000019665627],"category_scores_gemma":[0.000007257075,0.0002657788,0.000029408204,0.0008085408,0.0001344661,0.00030863183,0.000023939088,0.00035313997,0.00003555168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018171126,0.0018265629,0.0005270759,0.00066973234,0.00077041576,8.9149074e-7,0.009275173,0.3762717,0.03979791,0.041547056,0.001054347,0.5280774],"study_design_scores_gemma":[0.0011168147,0.00013724585,0.1447282,0.00035594945,0.00026741027,0.000015303589,0.0007707791,0.8350382,0.0016816942,0.0006132621,0.014433498,0.00084168225],"about_ca_topic_score_codex":0.000079907375,"about_ca_topic_score_gemma":0.00026674746,"teacher_disagreement_score":0.90558577,"about_ca_system_score_codex":0.00015702599,"about_ca_system_score_gemma":0.000031265954,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W4407938071","doi":"10.1109/tcomm.2025.3545702","title":"NOMA-Based Ze-RIS Empowered Backscatter Communication With Energy-Efficient Resource Management","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","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":"Memorial University of Newfoundland","funders":"Project 333 of Jiangsu Province","keywords":"Backscatter (email); Resource management (computing); Computer science; Telecommunications; Noma; Electronic engineering; Telecommunications link; Business; Engineering; Computer network; Wireless","score_opus":0.007771064357079768,"score_gpt":0.2130028045903966,"score_spread":0.20523174023331683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407938071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016255701,0.0007374213,0.9146952,0.001632413,0.00015655046,0.0002678734,0.000023401595,0.00090772245,0.07995382],"genre_scores_gemma":[0.9673337,0.0004705096,0.029198406,0.00049255363,0.000008396907,0.00054501893,0.000066512715,0.00006715149,0.0018178028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986537,0.00019660573,0.0003900759,0.0002559271,0.00020372466,0.00029994245],"domain_scores_gemma":[0.9955528,0.0004674366,0.000061476705,0.0037539573,0.00008387469,0.000080459795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017766228,0.00027484924,0.00020976315,0.00038006098,0.00065907434,0.00008802246,0.0013103909,0.0001292429,0.000044289398],"category_scores_gemma":[0.0000014503133,0.0002906497,0.000098905395,0.0009429337,0.00023792282,0.000075313874,0.000013983774,0.00052562356,0.00003070979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021978782,0.0002915629,0.000010511906,0.00004022375,0.00016919883,9.121046e-7,0.000090106034,0.9775379,0.000056673514,0.0023763557,0.002256763,0.017147863],"study_design_scores_gemma":[0.0010721291,0.000044495282,0.00030296348,0.00068414694,0.00019677219,0.0000032246792,0.0002135813,0.88616884,0.004252283,0.0000829436,0.10650155,0.00047706373],"about_ca_topic_score_codex":0.000059120466,"about_ca_topic_score_gemma":0.0003646057,"teacher_disagreement_score":0.9657081,"about_ca_system_score_codex":0.00024188161,"about_ca_system_score_gemma":0.00003398284,"threshold_uncertainty_score":0.9999546},"labels":[],"label_agreement":null},{"id":"W4407938106","doi":"10.1109/tcomm.2025.3545678","title":"Predictive Beamforming Approach for Secure Integrated Sensing and Communication With Multiple Aerial Eavesdroppers","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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; Memorial University of Newfoundland","funders":"","keywords":"Beamforming; Computer science; Computer network; Telecommunications","score_opus":0.011092105826457796,"score_gpt":0.22477026845793838,"score_spread":0.2136781626314806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407938106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023085924,0.00029716696,0.99330115,0.00024144101,0.00008421787,0.0006176246,0.0001016878,0.00074067543,0.0023074164],"genre_scores_gemma":[0.8705364,0.0005958065,0.12837842,0.000036781687,0.0000043825517,0.000267372,0.000082616716,0.000025457475,0.00007275797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993645,0.000045866575,0.00021396375,0.00014681208,0.000066873756,0.0001619821],"domain_scores_gemma":[0.99861103,0.00027968854,0.0000337435,0.0009143771,0.00013079231,0.00003038216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098788005,0.0001636131,0.00016432264,0.00024197833,0.00065242144,0.00005669946,0.000340208,0.00014350345,0.0000021431024],"category_scores_gemma":[0.000013554559,0.0001554616,0.000045245506,0.00043866163,0.0002581455,0.0001505424,0.0000062263925,0.00035762697,7.4520636e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004681539,0.00044497955,0.00015009253,0.00034690642,0.00094584696,3.4733156e-7,0.0053530973,0.75429136,0.004625515,0.006724082,0.0012344298,0.22541521],"study_design_scores_gemma":[0.0008746993,0.00005878844,0.000025888321,0.00011161883,0.00009481252,0.000004479336,0.003097978,0.9746497,0.017555764,0.00028446928,0.003059948,0.00018182686],"about_ca_topic_score_codex":0.000059281007,"about_ca_topic_score_gemma":0.00029443484,"teacher_disagreement_score":0.86822784,"about_ca_system_score_codex":0.000113000824,"about_ca_system_score_gemma":0.00003810502,"threshold_uncertainty_score":0.63395405},"labels":[],"label_agreement":null},{"id":"W4408145489","doi":"10.1109/tcomm.2025.3547764","title":"Toward Zero Touch Networks: Cross-Layer Automated Security Solutions for 6G Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University; Ontario Tech University","funders":"","keywords":"Computer science; Wireless; Computer network; Layer (electronics); Zero (linguistics); Physical layer; Wireless network; Telecommunications; Materials science","score_opus":0.03211102483972217,"score_gpt":0.3004036182890676,"score_spread":0.2682925934493454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408145489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025265795,0.0007969552,0.9911159,0.00035008384,0.0013737957,0.0010463258,0.00014430378,0.0029050256,0.0020149536],"genre_scores_gemma":[0.987663,0.0013016124,0.008968269,0.00009263567,0.000041190044,0.001317968,0.00011691036,0.00007369614,0.00042474718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983894,0.00010097491,0.00060071406,0.00028408776,0.00009760761,0.00052717206],"domain_scores_gemma":[0.99725354,0.00055026746,0.000077886645,0.0017381549,0.00028200127,0.00009813854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021375233,0.0002919152,0.0003118158,0.0002472072,0.0011676566,0.00012368856,0.0007742703,0.0002985143,0.00001802134],"category_scores_gemma":[0.000011944147,0.00035263848,0.00019420248,0.00093519763,0.00016360875,0.00035537325,0.000012101912,0.0005608542,0.000015032364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016095119,0.00014140952,0.000008220339,0.000049084807,0.00014109242,1.7718509e-7,0.0001610178,0.9922705,0.00012629833,0.002091782,0.0023954306,0.0025988559],"study_design_scores_gemma":[0.0006183819,0.00002249393,0.000027739696,0.0001291735,0.00009198206,0.000003312865,0.0000710022,0.9950023,0.00052064494,0.00051214587,0.0027129396,0.00028783194],"about_ca_topic_score_codex":0.000044046013,"about_ca_topic_score_gemma":0.00032103434,"teacher_disagreement_score":0.9874103,"about_ca_system_score_codex":0.00034227845,"about_ca_system_score_gemma":0.000060095048,"threshold_uncertainty_score":0.99989253},"labels":[],"label_agreement":null},{"id":"W4408324641","doi":"10.1109/tcomm.2025.3550371","title":"Optimizing Multi-User Uplink Cooperative Rate-Splitting Multiple Access: Efficient User Pairing and Resource Allocation With Gradient-Based Meta Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Telecommunications link; Computer science; Pairing; Resource allocation; Computer network; Resource management (computing); Resource (disambiguation); Distributed computing","score_opus":0.03390401326356322,"score_gpt":0.27480089268033675,"score_spread":0.24089687941677354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005472232,0.0005797824,0.99178356,0.00033970858,0.00008792624,0.0007845459,0.000012000436,0.0006703424,0.00026989274],"genre_scores_gemma":[0.8933859,0.00015491009,0.1052019,0.00006653256,0.000005937846,0.0006068937,0.00003596433,0.00006487256,0.00047711586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856406,0.00026586218,0.00045053274,0.0003425683,0.00010482743,0.00027214765],"domain_scores_gemma":[0.9977248,0.0008953122,0.000103358,0.0009970042,0.00021050878,0.000069023394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037007278,0.00029921706,0.00031664156,0.0003669471,0.0010527697,0.00017364032,0.0004401735,0.00010775037,0.000008687775],"category_scores_gemma":[0.000046741592,0.00029336748,0.000081991064,0.0008205232,0.00012864832,0.00034048737,0.000013768861,0.0006171344,0.0000052344126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024818459,0.00011306726,0.00007741723,0.00006229482,0.0003086576,3.510219e-7,0.00062781974,0.9954298,0.002015691,0.00015363298,0.00000872324,0.0011777055],"study_design_scores_gemma":[0.0010913999,0.000030848892,0.0000668469,0.00024737086,0.00033994924,0.0000014047945,0.00059334043,0.98207575,0.013783925,0.0000015076853,0.001486116,0.00028152185],"about_ca_topic_score_codex":0.00004701973,"about_ca_topic_score_gemma":0.00029845978,"teacher_disagreement_score":0.88791364,"about_ca_system_score_codex":0.00020212127,"about_ca_system_score_gemma":0.000049408383,"threshold_uncertainty_score":0.99995184},"labels":[],"label_agreement":null},{"id":"W4408540244","doi":"10.1109/tcomm.2025.3552299","title":"Hierarchical Digital Twin for Efficient 6G Network Orchestration via Adaptive Attribute Selection and Scalable Network Modeling","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Software-Defined Networks and 5G","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; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Orchestration; Scalability; Selection (genetic algorithm); Distributed computing; Computer network; Computer architecture; Artificial intelligence; Database","score_opus":0.03393740673714284,"score_gpt":0.26806203071405205,"score_spread":0.2341246239769092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408540244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012151406,0.0004164839,0.9947875,0.0019127416,0.00038421198,0.0006139934,0.00002028563,0.00033416162,0.00031547155],"genre_scores_gemma":[0.9010116,0.00014550859,0.09807307,0.0002061439,0.0000766228,0.0003093338,0.0000204528,0.00001526012,0.00014200433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984861,0.00013523652,0.00038748427,0.0004188551,0.00015850177,0.00041379908],"domain_scores_gemma":[0.9975871,0.0010535037,0.00007702133,0.0009781171,0.00020167942,0.000102590726],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00037525588,0.00020223629,0.00022182273,0.00012935109,0.0015352493,0.00030936138,0.00072905753,0.00014708449,0.0000024267279],"category_scores_gemma":[0.000013952265,0.00021464775,0.00012204666,0.001222434,0.00009152652,0.0003480883,0.00002747007,0.00046861244,0.0000063502684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038008024,0.00016751635,0.000031333944,0.000006087271,0.00005389627,1.0145132e-7,0.00008896374,0.9424777,0.00001019175,0.015146914,0.00039137047,0.041587885],"study_design_scores_gemma":[0.00041059215,0.00013627796,0.000073932,0.00008741468,0.000042735668,0.0000055259547,0.000013191253,0.9844685,0.00004402381,0.013194218,0.0013367927,0.00018675263],"about_ca_topic_score_codex":0.00003886018,"about_ca_topic_score_gemma":0.0001517836,"teacher_disagreement_score":0.8997965,"about_ca_system_score_codex":0.00011909864,"about_ca_system_score_gemma":0.00014205939,"threshold_uncertainty_score":0.9997646},"labels":[],"label_agreement":null},{"id":"W4409058078","doi":"10.1109/tcomm.2025.3556779","title":"RIS-Aided MIMO Beamforming: Piecewise Near-Field Channel Model","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"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 Key Research and Development Program of China; National High-tech Research and Development Program; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Beamforming; MIMO; Channel (broadcasting); Electronic engineering; Piecewise; Precoding; Field (mathematics); Computer science; Engineering; Telecommunications; Mathematics","score_opus":0.022868776150361328,"score_gpt":0.26848977757457554,"score_spread":0.24562100142421422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409058078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040255862,0.00029166156,0.98003936,0.0008814052,0.0004204486,0.00040465558,0.000041170046,0.00074108556,0.016777663],"genre_scores_gemma":[0.9520653,0.0007564971,0.044692993,0.00018948143,0.000010419668,0.00037480853,0.000016620914,0.000046259604,0.0018476491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905086,0.000039969746,0.00038590832,0.00018234656,0.00009772177,0.00024317761],"domain_scores_gemma":[0.9977923,0.00023805109,0.000042754116,0.0017529953,0.00010051271,0.00007341165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010014319,0.00020523644,0.0002043299,0.00023714644,0.0005783908,0.000056753353,0.00063538103,0.0001531841,0.000020084113],"category_scores_gemma":[0.000012571633,0.00024334023,0.00011052954,0.0005948358,0.00007046984,0.00030530643,0.0000059589765,0.0004465219,0.00005995514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007650064,0.000093242925,8.684777e-7,0.000030337189,0.00005784589,1.4715232e-7,0.00035913463,0.99227047,0.0013097121,0.0005611589,0.0006632466,0.0046461825],"study_design_scores_gemma":[0.00033349518,0.000018497785,0.0000020984376,0.00010057905,0.000053118867,0.000002045892,0.00012959824,0.9828105,0.013597021,0.00090971106,0.0018430124,0.00020035225],"about_ca_topic_score_codex":0.000033006152,"about_ca_topic_score_gemma":0.00020690628,"teacher_disagreement_score":0.9516627,"about_ca_system_score_codex":0.00016252711,"about_ca_system_score_gemma":0.000064809545,"threshold_uncertainty_score":0.99231267},"labels":[],"label_agreement":null},{"id":"W4409581412","doi":"10.1109/tcomm.2025.3562320","title":"Channel Estimation and Localization for Cylindrical RIS-Assisted Multi-User ISAC Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China; Queen's University Belfast; Queen's University; European Commission; Royal Academy of Engineering; Engineering and Physical Sciences Research Council; Leverhulme Trust; National Science Foundation","keywords":"Computer science; Channel (broadcasting); Electronic engineering; Electrical engineering; Engineering; Telecommunications","score_opus":0.036938874910843744,"score_gpt":0.2989945903976763,"score_spread":0.26205571548683254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409581412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003291937,0.0002752248,0.99615395,0.0015010694,0.0007993926,0.00061112246,0.000057841895,0.00032861545,0.00023987683],"genre_scores_gemma":[0.9210602,0.00029708608,0.07629247,0.0002800135,0.000015187103,0.00049898046,0.00003977573,0.000014503883,0.0015017601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988869,0.00014497961,0.00035419868,0.00029978857,0.00012593622,0.00018821261],"domain_scores_gemma":[0.99794203,0.0004106159,0.00009623579,0.0012262097,0.00024377329,0.000081131155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020408946,0.00015131895,0.00017540494,0.00024406926,0.000980987,0.00026334584,0.00063710706,0.00013932993,0.0000017323816],"category_scores_gemma":[0.000017806982,0.00015806257,0.00008013197,0.0007989754,0.00009422573,0.0003006246,0.000012163402,0.00022170918,0.000010808517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004067151,0.0012415675,0.0000070381916,0.00008564727,0.0001828042,6.070417e-7,0.0004031154,0.7668894,0.00010036979,0.040544912,0.0021615615,0.18834229],"study_design_scores_gemma":[0.0006800047,0.000052088988,0.00011676952,0.0000620613,0.00003984205,0.000006733407,0.00007120695,0.9876138,0.0003057985,0.00040109883,0.010507841,0.00014276335],"about_ca_topic_score_codex":0.00006119069,"about_ca_topic_score_gemma":0.000070021466,"teacher_disagreement_score":0.9210273,"about_ca_system_score_codex":0.00009519428,"about_ca_system_score_gemma":0.000054517765,"threshold_uncertainty_score":0.75450575},"labels":[],"label_agreement":null},{"id":"W4409581518","doi":"10.1109/tcomm.2025.3562327","title":"Multi-Objective Regular Mapping QoS Path Planning for Mega LEO Constellation Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Chengdu Science and Technology Program; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Constellation; Quality of service; Computer science; Computer network; Path (computing); Motion planning; Mega-; Real-time computing; Telecommunications; Artificial intelligence; Physics","score_opus":0.05681788074542186,"score_gpt":0.29650450401546286,"score_spread":0.239686623270041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409581518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042466947,0.004341985,0.9844582,0.00037564384,0.0009196733,0.0011397322,0.000055456592,0.0007635079,0.007521143],"genre_scores_gemma":[0.9666394,0.0014344088,0.030694036,0.000098795295,0.00003617054,0.0005341533,0.00006129273,0.00005552649,0.00044620343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855965,0.0002119979,0.0005883293,0.00023925834,0.00011825359,0.00028249578],"domain_scores_gemma":[0.9959412,0.001228657,0.00009460596,0.0024636374,0.0002044014,0.00006746204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038300094,0.00024705575,0.00028784332,0.0004136467,0.0007934368,0.00009037933,0.00090644945,0.00020533403,0.000013766451],"category_scores_gemma":[0.000014468805,0.00029834115,0.00017254877,0.0007751857,0.00013640612,0.00020261141,0.00000940473,0.00052179693,0.000015312973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021223725,0.00015982136,0.000078080426,0.00008647799,0.00034490423,2.55283e-7,0.0014801162,0.96234924,0.0026893518,0.00056545984,0.0010353643,0.031189732],"study_design_scores_gemma":[0.00081527565,0.000019487245,0.00029796563,0.00041331112,0.000069813024,0.000004029241,0.0013149476,0.9292062,0.0023636753,0.000120235134,0.06506922,0.00030586732],"about_ca_topic_score_codex":0.00003069199,"about_ca_topic_score_gemma":0.000042707037,"teacher_disagreement_score":0.9662147,"about_ca_system_score_codex":0.00027969686,"about_ca_system_score_gemma":0.000053091044,"threshold_uncertainty_score":0.9999469},"labels":[],"label_agreement":null},{"id":"W4409916814","doi":"10.1109/tcomm.2025.3565584","title":"Mobile Edge Computing Networks: Online Low-Latency and Fresh Service Provisioning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","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":"China Scholarship Council; Science and Technology Commission of Shanghai Municipality; Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Mobile edge computing; Provisioning; Latency (audio); Mobile telephony; Edge computing; Telecommunications; Enhanced Data Rates for GSM Evolution; Mobile radio; Server","score_opus":0.01964552470552086,"score_gpt":0.28527458108404097,"score_spread":0.2656290563785201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409916814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012399036,0.00088528165,0.9800896,0.0017863706,0.0025383374,0.00036313783,0.0000022061645,0.0004398664,0.0014961597],"genre_scores_gemma":[0.9298047,0.0003975789,0.0682235,0.0010809939,0.00013599383,0.000041150113,0.0000106658,0.000017068845,0.00028837105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855894,0.00016877161,0.00041784276,0.0003895359,0.0001345892,0.00033029445],"domain_scores_gemma":[0.99709564,0.0005755246,0.00010206718,0.0019293623,0.00020477865,0.00009260383],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00028716994,0.0002020781,0.00021410706,0.0002630089,0.0015347359,0.00023923205,0.0017835716,0.00010754945,0.0000025008376],"category_scores_gemma":[0.000007982253,0.00021405888,0.00007676458,0.001323987,0.00009209116,0.0003386293,0.000097493816,0.00063870236,0.000017392136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017183977,0.0017134325,0.00024292053,0.00014320778,0.00017641876,0.0000038094179,0.0053435625,0.11704846,0.00069377123,0.0034604238,0.002988678,0.8681681],"study_design_scores_gemma":[0.00035430322,0.000057278594,0.00046158812,0.00033221548,0.000025358795,0.000007960328,0.00012817272,0.9923947,0.00029600904,0.00051955215,0.005201711,0.00022115483],"about_ca_topic_score_codex":0.00012104887,"about_ca_topic_score_gemma":0.00010904954,"teacher_disagreement_score":0.91740566,"about_ca_system_score_codex":0.00006801669,"about_ca_system_score_gemma":0.00011873545,"threshold_uncertainty_score":0.99976516},"labels":[],"label_agreement":null},{"id":"W4410086878","doi":"10.1109/tcomm.2025.3567007","title":"DBRAA: Sub-6 GHz and Millimeter Wave Dual-Band Reconfigurable Antenna Array for ISAC","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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":"National Natural Science Foundation of China","keywords":"Extremely high frequency; Antenna (radio); Antenna array; Reconfigurable antenna; Multi-band device; Electrical engineering; Physics; Electronic engineering; Computer science; Microstrip antenna; Optoelectronics; Telecommunications; Engineering; Coaxial antenna","score_opus":0.028513677166250966,"score_gpt":0.2458977564579314,"score_spread":0.21738407929168044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410086878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020853211,0.0013725142,0.9896392,0.001577842,0.00018248447,0.0002236082,0.00013333322,0.00020105923,0.004584643],"genre_scores_gemma":[0.985018,0.0049764174,0.0055831783,0.00021348168,0.000010511456,0.00017627065,0.000020494028,0.000027042202,0.0039745895],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992738,0.000047849713,0.0002565629,0.0001714277,0.00005657976,0.0001938044],"domain_scores_gemma":[0.99854267,0.00037208974,0.000023613788,0.00090727356,0.00009413116,0.00006022818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113164235,0.0001542146,0.00021039322,0.00021152434,0.0004245546,0.000057090296,0.0001763262,0.00009283516,0.000042125554],"category_scores_gemma":[0.000006904151,0.00016150811,0.00014404905,0.00038028066,0.00011247591,0.0001199272,9.733693e-7,0.00023842936,0.00002297331],"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.000035000485,0.00025303935,0.000016212723,0.00012198436,0.0008478969,0.0000010907556,0.0004432945,0.001137851,0.98082453,0.00061788247,0.0018100176,0.0138911875],"study_design_scores_gemma":[0.0019784546,0.00011895033,0.00024584372,0.00037117975,0.0011928207,0.000029709669,0.0009751495,0.3273551,0.61106706,0.0061561298,0.049556144,0.0009534963],"about_ca_topic_score_codex":0.000016991096,"about_ca_topic_score_gemma":0.00020563128,"teacher_disagreement_score":0.984056,"about_ca_system_score_codex":0.00004307503,"about_ca_system_score_gemma":0.000027725544,"threshold_uncertainty_score":0.65861094},"labels":[],"label_agreement":null},{"id":"W4410537232","doi":"10.1109/tcomm.2025.3571910","title":"Triple IRS-Aided Communications: Row-Column Sparsity Enhanced Bayesian Tensor Learning for Channel Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Blind Source Separation Techniques","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":"National Natural Science Foundation of China","keywords":"Channel (broadcasting); Computer science; Column (typography); Bayesian probability; Algorithm; Tensor (intrinsic definition); Electronic engineering; Mathematics; Artificial intelligence; Telecommunications; Engineering","score_opus":0.040754293905622026,"score_gpt":0.3243394170097982,"score_spread":0.28358512310417616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410537232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011981495,0.0001538852,0.9733697,0.016872702,0.00022466715,0.0013806534,0.000021704143,0.0011576903,0.0066991528],"genre_scores_gemma":[0.7287076,0.0004282646,0.26670998,0.0007458053,0.0000064924684,0.0012854103,0.00004389425,0.00001917343,0.0020533751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978128,0.0005968691,0.00061602215,0.00044351237,0.000221099,0.00030966685],"domain_scores_gemma":[0.993112,0.0013475909,0.00025450523,0.004741237,0.00045168292,0.00009293059],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00080787024,0.000248927,0.00030821495,0.0005733277,0.0021623082,0.0003037571,0.003710403,0.00019345191,0.000010036049],"category_scores_gemma":[0.0001279499,0.0002976395,0.00022227403,0.001278783,0.0002219526,0.0008107137,0.000063276806,0.0007362982,0.000035662244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022080544,0.0053415727,0.00003035395,0.00021367242,0.000659524,7.219557e-7,0.013481562,0.14670613,0.0117480755,0.41515535,0.006348716,0.40009353],"study_design_scores_gemma":[0.0008436126,0.0001449891,0.00010895565,0.00013103808,0.00006530444,0.0000025141183,0.00022186789,0.94418913,0.02743185,0.015541237,0.010979996,0.00033951714],"about_ca_topic_score_codex":0.00009191909,"about_ca_topic_score_gemma":0.00045078885,"teacher_disagreement_score":0.79748297,"about_ca_system_score_codex":0.00023155892,"about_ca_system_score_gemma":0.00026286842,"threshold_uncertainty_score":0.99994755},"labels":[],"label_agreement":null},{"id":"W4410738567","doi":"10.1109/tcomm.2025.3573444","title":"Ordered Reliability Direct Error Pattern Testing Decoding Algorithm","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Huawei Technologies (Canada); Dalhousie University","funders":"","keywords":"Decoding methods; Algorithm; Computer science; Reliability (semiconductor); Sequential decoding; List decoding; Error detection and correction; Reliability engineering; Concatenated error correction code; Engineering; Block code","score_opus":0.02729509991514346,"score_gpt":0.2736570403137389,"score_spread":0.24636194039859544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410738567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023314697,0.00023479422,0.9639575,0.00061822304,0.0010285474,0.00036151733,0.00005849878,0.0012587832,0.030150682],"genre_scores_gemma":[0.99290925,0.000088185276,0.005816236,0.00009190039,0.000016089198,0.0003124247,0.0000039806446,0.000025726114,0.00073621055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902153,0.00012521143,0.00036480263,0.0001828332,0.00010387143,0.00020176919],"domain_scores_gemma":[0.9978376,0.0005697566,0.000032133685,0.001405728,0.00009606441,0.000058709375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020964256,0.00016312653,0.00019781286,0.00019747061,0.00052402046,0.000060256225,0.00046355664,0.00009683699,0.000036242676],"category_scores_gemma":[0.000026658417,0.00017981678,0.00010504103,0.0006885613,0.000059435988,0.00011175599,0.0000035554824,0.00041538148,0.00007361514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004965745,0.00018705887,0.000091564114,0.000056924975,0.00013856337,5.9659567e-7,0.00021367788,0.11057649,0.0021485053,0.00001912857,0.0004392565,0.88612324],"study_design_scores_gemma":[0.00037548103,0.000019912164,0.00028326875,0.00010600875,0.00004647067,0.0000033677154,0.00015777387,0.98566836,0.002401062,0.00006777089,0.010687672,0.00018284132],"about_ca_topic_score_codex":0.0002640842,"about_ca_topic_score_gemma":0.00052062736,"teacher_disagreement_score":0.99057776,"about_ca_system_score_codex":0.00017537507,"about_ca_system_score_gemma":0.000034046127,"threshold_uncertainty_score":0.73327154},"labels":[],"label_agreement":null},{"id":"W4411270537","doi":"10.1109/tcomm.2025.3579703","title":"Mobile Traffic Prediction Using LLMs With Efficient In-Context Demonstration Selection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Traffic Prediction and Management Techniques","field":"Engineering","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); University of Ottawa","funders":"Mitacs","keywords":"Selection (genetic algorithm); Context (archaeology); Computer science; Mobile telephony; Mobile radio; Telecommunications; Artificial intelligence; Geography","score_opus":0.013213217808181934,"score_gpt":0.24524226073041358,"score_spread":0.23202904292223164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411270537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10367048,0.00013938356,0.88914055,0.00007522596,0.00025697012,0.00068306684,0.000019360508,0.0027738286,0.0032411641],"genre_scores_gemma":[0.9955465,0.00037667408,0.0034106495,0.000046999827,0.0000075066273,0.00049261743,0.000011863059,0.000022267337,0.000084889696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917626,0.00006351101,0.000309027,0.00015642181,0.00012113702,0.00017363831],"domain_scores_gemma":[0.9992621,0.00005207733,0.000030999563,0.00056453614,0.000053166284,0.000037121838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013025224,0.00015995496,0.0001338105,0.0006007866,0.00028955907,0.000043839376,0.00024381717,0.000103977414,0.000010265958],"category_scores_gemma":[0.0000012413007,0.00017271165,0.000053600375,0.00096061674,0.00008214131,0.00016095111,0.00000218058,0.00037877873,0.0000072794082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001672319,0.00025695178,0.00001756166,0.000020472125,0.00004793284,1.8387162e-7,0.0003137617,0.9282928,0.001241043,0.00031460475,0.0003308253,0.069147155],"study_design_scores_gemma":[0.00048481594,0.00009260223,0.0002897305,0.00011688761,0.000067538414,0.0000053470308,0.0005268717,0.99200565,0.00428005,0.000012646352,0.0019819445,0.00013590255],"about_ca_topic_score_codex":0.00002629535,"about_ca_topic_score_gemma":0.00091034145,"teacher_disagreement_score":0.89187604,"about_ca_system_score_codex":0.000323107,"about_ca_system_score_gemma":0.00004521724,"threshold_uncertainty_score":0.70429766},"labels":[],"label_agreement":null},{"id":"W4411688153","doi":"10.1109/tcomm.2025.3583637","title":"Cell-Free Full-Duplex Communication—An Overview","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Duplex (building); Computer science; Electronic engineering; Telecommunications; Engineering","score_opus":0.042732577135999934,"score_gpt":0.2929486101944307,"score_spread":0.25021603305843076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411688153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07786165,0.06042366,0.73404515,0.020743763,0.0019155763,0.00345769,0.0011665772,0.009133941,0.09125199],"genre_scores_gemma":[0.94101965,0.026933383,0.028737102,0.000447766,0.000013847955,0.0009616954,0.00014167666,0.00010284874,0.0016420056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977198,0.00045176508,0.0007855345,0.00033666755,0.0002707019,0.00043549135],"domain_scores_gemma":[0.98398787,0.0009027935,0.00009311303,0.014583095,0.000246004,0.00018709867],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00034568936,0.0004211962,0.00039228838,0.0005568382,0.0014554174,0.00017319563,0.0063363025,0.00025547374,0.0002957282],"category_scores_gemma":[0.000021976783,0.00050643575,0.00024102547,0.0014718034,0.00040491504,0.0005621209,0.000067043366,0.001280829,0.00033237293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024647834,0.0015409851,0.000011083255,0.00014955067,0.000253078,5.7061965e-7,0.0010158281,0.93297076,0.006232652,0.025828421,0.012903303,0.019069105],"study_design_scores_gemma":[0.0015668115,0.000090741596,0.00031834436,0.0003372467,0.00025499106,0.000010334828,0.00079701835,0.8897034,0.008234519,0.000752876,0.09704828,0.00088542013],"about_ca_topic_score_codex":0.00015552036,"about_ca_topic_score_gemma":0.0017388889,"teacher_disagreement_score":0.86315805,"about_ca_system_score_codex":0.0003370632,"about_ca_system_score_gemma":0.0001360353,"threshold_uncertainty_score":0.99984455},"labels":[],"label_agreement":null},{"id":"W4411983358","doi":"10.1109/tcomm.2025.3585578","title":"Toward Multicast NFV-Enabled IoT Frameworks: Game Theory for Mixed-AoAI","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"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 Ningbo; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Multicast; Computer science; Game theory; Distributed computing; Computer network; Internet of Things; Embedded system; Mathematics","score_opus":0.03771412842204852,"score_gpt":0.3085123847551772,"score_spread":0.2707982563331287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411983358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003808717,0.00026779893,0.98010063,0.008388225,0.0054790904,0.0005264231,0.0000063232815,0.00046936903,0.004381243],"genre_scores_gemma":[0.8228371,0.00010582124,0.17343095,0.001307407,0.0001409593,0.00035133568,0.000006106466,0.00002332355,0.001796998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998333,0.00027717178,0.0004207316,0.00040150943,0.00015599698,0.0004116351],"domain_scores_gemma":[0.99413496,0.0024901587,0.00009171833,0.0029501806,0.00023444332,0.00009852023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056339666,0.00022367123,0.00025023456,0.0003415236,0.0010139906,0.0002395402,0.0028645785,0.00024127527,0.000007294926],"category_scores_gemma":[0.000062017025,0.00023217055,0.0002438178,0.0008819181,0.00017126442,0.00022250478,0.000043917702,0.0008852384,0.000075678014],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090939444,0.0019465633,0.000011459115,0.00012558328,0.00044245514,0.00000236565,0.00557835,0.009350421,0.000818299,0.19357453,0.012630113,0.77542895],"study_design_scores_gemma":[0.0017509115,0.00018716927,0.00022328,0.00043002845,0.0001757341,0.0000143826355,0.00041983466,0.7489686,0.009605054,0.09797032,0.13948299,0.0007716967],"about_ca_topic_score_codex":0.000024352083,"about_ca_topic_score_gemma":0.000018590614,"teacher_disagreement_score":0.82245624,"about_ca_system_score_codex":0.00012057617,"about_ca_system_score_gemma":0.00017872003,"threshold_uncertainty_score":0.94676405},"labels":[],"label_agreement":null},{"id":"W4411983365","doi":"10.1109/tcomm.2025.3585699","title":"Spectrally Efficient RIS-Assisted Full Duplex Communication Using Quadrature Channel Modulation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Full-Duplex Wireless Communications","field":"Engineering","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":"Electronic engineering; Quadrature (astronomy); Quadrature amplitude modulation; Modulation (music); Channel (broadcasting); Duplex (building); Materials science; Computer science; Physics; Telecommunications; Engineering; Acoustics; Bit error rate","score_opus":0.028330621357194687,"score_gpt":0.2706327238314235,"score_spread":0.24230210247422881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411983365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14316311,0.00212961,0.8435504,0.003029196,0.00066221814,0.0011174267,0.00017140759,0.0016920648,0.004484554],"genre_scores_gemma":[0.9742548,0.0014452426,0.023251778,0.00013823851,0.000017143833,0.00033135005,0.00014422258,0.00008599111,0.00033124024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773985,0.00039492617,0.0007988695,0.0003390486,0.0002921547,0.0004351203],"domain_scores_gemma":[0.9929585,0.0005850796,0.00014125911,0.00590793,0.0002977452,0.000109500645],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003325067,0.00042217565,0.000381158,0.0007425995,0.0016042171,0.00016439558,0.0022304668,0.00032477442,0.00006500076],"category_scores_gemma":[0.000020008514,0.0005067252,0.00025099516,0.0018401543,0.00031065827,0.00027449062,0.00003387767,0.0013099287,0.00008609336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027239743,0.00047472474,0.000003024841,0.000041848518,0.00016462649,3.0552883e-7,0.0005429262,0.9781683,0.014671608,0.0018132837,0.0003304711,0.003761604],"study_design_scores_gemma":[0.0005889966,0.00002534268,0.00071871857,0.00025279264,0.00013831763,0.000011487611,0.00031755198,0.99179935,0.0040547512,0.0000982073,0.0015815016,0.00041299412],"about_ca_topic_score_codex":0.00016752954,"about_ca_topic_score_gemma":0.0010864665,"teacher_disagreement_score":0.8310917,"about_ca_system_score_codex":0.000692255,"about_ca_system_score_gemma":0.00013039369,"threshold_uncertainty_score":0.99973845},"labels":[],"label_agreement":null},{"id":"W4411983370","doi":"10.1109/tcomm.2025.3585509","title":"Joint Optimization of 3-D Placement and Transmission Power for a Relay Based Covert Communication System","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Joint (building); Relay; Computer science; Transmission (telecommunications); Power (physics); Electronic engineering; Communications system; Engineering; Computer network; Telecommunications; Physics","score_opus":0.034511773974405524,"score_gpt":0.28388432599865493,"score_spread":0.2493725520242494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411983370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013011027,0.0011542164,0.98996913,0.004757559,0.00009852212,0.0007990675,0.000017804441,0.00016801518,0.0029055746],"genre_scores_gemma":[0.7370858,0.0016462251,0.26055667,0.00020888195,0.00000121289,0.00031009133,0.000014594813,0.000008289428,0.00016820677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855244,0.00039203034,0.00051957724,0.00024624483,0.00014574309,0.00014397246],"domain_scores_gemma":[0.9959492,0.00074867165,0.00016619814,0.0027137636,0.00036062492,0.00006152867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000563115,0.00015867222,0.00024609917,0.000326806,0.00088408886,0.00008116677,0.0012851807,0.00009149536,0.000011549723],"category_scores_gemma":[0.000011559611,0.00016383578,0.000111536516,0.00066179177,0.00014069011,0.00024773122,0.000029258055,0.00023184826,0.0000016861363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013090593,0.0011669609,0.00000779149,0.0002250456,0.00018308569,1.1211819e-7,0.0026429787,0.79260933,0.0042836093,0.14063075,0.00093012594,0.05718933],"study_design_scores_gemma":[0.0010036434,0.000110364344,0.000033144875,0.00049562793,0.000044301985,0.0000012543793,0.00021657789,0.9852462,0.0073406687,0.000072266324,0.005285996,0.00014998719],"about_ca_topic_score_codex":0.0000078162875,"about_ca_topic_score_gemma":0.000018979286,"teacher_disagreement_score":0.7369557,"about_ca_system_score_codex":0.00013934863,"about_ca_system_score_gemma":0.00015058577,"threshold_uncertainty_score":0.6799786},"labels":[],"label_agreement":null},{"id":"W4412375702","doi":"10.1109/tcomm.2025.3587046","title":"Enhancing Resilience Against Jamming Attacks: A Cooperative Anti-Jamming Method Using Direction Estimation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":2,"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":"Jamming; Resilience (materials science); Computer science; Electronic engineering; Computer security; Computer network; Engineering; Physics","score_opus":0.029858865139317254,"score_gpt":0.3414343569913991,"score_spread":0.3115754918520819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010941102,0.00019688247,0.9840895,0.0014905946,0.0008107388,0.00043633545,0.000006698553,0.00048208152,0.0015460898],"genre_scores_gemma":[0.64429045,0.0002594695,0.3549678,0.00026478167,0.000014618168,0.000066663066,0.000003881033,0.000013952031,0.00011836377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974804,0.0007202319,0.0005920932,0.00055032317,0.00028682032,0.0003701174],"domain_scores_gemma":[0.99537003,0.0015404685,0.00019308773,0.0024840883,0.0003265184,0.00008580696],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00069235195,0.00026773644,0.0003062144,0.00056125876,0.0020743469,0.0003303878,0.0017021328,0.00016749401,0.0000058300348],"category_scores_gemma":[0.00007374486,0.0003113095,0.00013353718,0.0022673688,0.00016298135,0.0010294185,0.000039153907,0.0007596913,0.000023826084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006862581,0.00023170427,0.0000068488107,0.000021264152,0.00006847471,0.0000017816781,0.0025404997,0.80623764,0.023110246,0.0035796296,0.000029204082,0.16416585],"study_design_scores_gemma":[0.00024348857,0.000034815228,0.000039687304,0.0003748948,0.000043444903,0.000013339615,0.00043987765,0.9232643,0.074616246,0.00024460128,0.00043201423,0.00025328403],"about_ca_topic_score_codex":0.00016835425,"about_ca_topic_score_gemma":0.00039335925,"teacher_disagreement_score":0.63334936,"about_ca_system_score_codex":0.00041013779,"about_ca_system_score_gemma":0.00022306936,"threshold_uncertainty_score":0.9999339},"labels":[],"label_agreement":null},{"id":"W4412375768","doi":"10.1109/tcomm.2025.3587048","title":"Power-Efficient Optimization for Coexisting Semantic and Bit-Based Users in NOMA Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","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","keywords":"Noma; Computer science; Power (physics); Bit (key); Electronic engineering; Power optimization; Computer network; Telecommunications link; Engineering; Physics; Power consumption","score_opus":0.015502145950213013,"score_gpt":0.2546892917713081,"score_spread":0.2391871458210951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412375768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020661629,0.00084842474,0.9935524,0.0007252084,0.00018008928,0.00052181305,0.000012139337,0.0002047064,0.0018890555],"genre_scores_gemma":[0.9667786,0.00049989147,0.032161158,0.00017090052,0.0000029980715,0.00029080154,0.000026529828,0.000025869438,0.00004328325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992151,0.000092502276,0.00030888012,0.00014259154,0.000059480466,0.00018139703],"domain_scores_gemma":[0.9982738,0.0005042481,0.000034741683,0.0010831278,0.000059612998,0.000044466335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020407503,0.00013773236,0.00015048546,0.00031661714,0.0003311437,0.000048077643,0.00038534024,0.00010977603,0.000013413318],"category_scores_gemma":[0.000010455124,0.00016712482,0.000063425905,0.00063687086,0.000082430175,0.000041037136,0.000005254447,0.0003035178,0.0000016159398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116608635,0.00010687431,0.000018628965,0.000021538388,0.000022704198,1.182876e-7,0.00006481075,0.99476844,0.00008577574,0.00047831328,0.00006593719,0.0043552164],"study_design_scores_gemma":[0.0006284583,0.000018607094,0.00011062069,0.00014274055,0.000026648719,6.3297745e-7,0.000055758424,0.9975045,0.00029472288,0.000021436235,0.0010584168,0.00013751173],"about_ca_topic_score_codex":0.00001633283,"about_ca_topic_score_gemma":0.0001774112,"teacher_disagreement_score":0.9647124,"about_ca_system_score_codex":0.00009307343,"about_ca_system_score_gemma":0.000031630785,"threshold_uncertainty_score":0.6815152},"labels":[],"label_agreement":null},{"id":"W4412536758","doi":"10.1109/tcomm.2025.3591165","title":"Radiation Footprint Control in Cell-Free Cooperative ISAC: Optimal Joint BS Activation and Beamforming Coordination","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Nanoplatforms for cancer theranostics","field":"Engineering","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","keywords":"Beamforming; Joint (building); Footprint; Computer science; Control (management); Electronic engineering; Engineering; Telecommunications","score_opus":0.011926483358400774,"score_gpt":0.23175504064301816,"score_spread":0.2198285572846174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412536758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048621345,0.00027976625,0.94681597,0.0010924565,0.0002456328,0.00065300567,0.000049800416,0.00019616642,0.0020458475],"genre_scores_gemma":[0.99539953,0.0005455505,0.003466646,0.000096946045,0.0000096009535,0.00028670407,0.000016976397,0.000026091606,0.0001519496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991243,0.00004992164,0.0003716782,0.00015968388,0.00011211785,0.00018233819],"domain_scores_gemma":[0.9987008,0.00029872727,0.000051131414,0.0008181312,0.00008726828,0.00004395197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017493959,0.00017566803,0.00019465623,0.00042628383,0.00029086106,0.000056623456,0.00030871943,0.00011924213,0.00001044851],"category_scores_gemma":[0.000017494916,0.00020241641,0.000050776245,0.00051521475,0.00007609559,0.0003027096,0.000005756322,0.00043158117,0.0000053738577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075837044,0.00030302952,0.000076199794,0.00008663945,0.00014195488,3.9242863e-7,0.0016065174,0.7669512,0.16290152,0.0021264856,0.000164271,0.06556595],"study_design_scores_gemma":[0.0041298536,0.00010562567,0.0012109498,0.0001986998,0.000090397334,0.0000021239505,0.0005911877,0.6622744,0.32747456,0.00086371077,0.0026754325,0.00038306188],"about_ca_topic_score_codex":0.00009047205,"about_ca_topic_score_gemma":0.0002598349,"teacher_disagreement_score":0.9467782,"about_ca_system_score_codex":0.000451413,"about_ca_system_score_gemma":0.000060061895,"threshold_uncertainty_score":0.82543015},"labels":[],"label_agreement":null},{"id":"W4412623610","doi":"10.1109/tcomm.2025.3592583","title":"Cooperative Jamming Detection Using Low-Rank Structure of Received Signal Matrix","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":1,"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":"Jamming; Detection theory; Computer science; Signal processing; Matrix (chemical analysis); Rank (graph theory); Matrix algebra; Electronic engineering; Algorithm; Telecommunications; Mathematics; Engineering; Detector; Physics; Materials science","score_opus":0.01547889449179436,"score_gpt":0.2689468440726552,"score_spread":0.25346794958086083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15129246,0.00044427073,0.8467128,0.00004338756,0.0003064245,0.0002052926,0.000046711055,0.00014214906,0.0008064909],"genre_scores_gemma":[0.9956228,0.000085408705,0.0041181864,0.00001152575,0.000013588027,0.000012931008,0.0000034138748,0.000021521339,0.00011060634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991922,0.000089591624,0.00035932864,0.00012067107,0.00010521907,0.00013303],"domain_scores_gemma":[0.99902946,0.00015722944,0.00005555509,0.00057919446,0.00014543944,0.000033122797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007842868,0.00014345285,0.00020142198,0.00025072866,0.000457442,0.00004681665,0.00030541135,0.000112267124,0.0000381727],"category_scores_gemma":[0.0000041185267,0.0001522146,0.000077873614,0.00060016825,0.00008159265,0.00017628988,0.0000023826785,0.0003797741,0.000003137295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011566953,0.000032474076,0.0000025980444,0.00008576979,0.00008376773,1.6010665e-7,0.00040573257,0.5861757,0.40125608,0.000042892447,0.0000073918654,0.011895908],"study_design_scores_gemma":[0.00029233855,0.000023230603,0.000025025513,0.00032265895,0.00007093492,0.0000051923234,0.00044795292,0.605268,0.39296287,0.00010750635,0.00032250516,0.00015180289],"about_ca_topic_score_codex":0.00009257402,"about_ca_topic_score_gemma":0.00019776127,"teacher_disagreement_score":0.8443304,"about_ca_system_score_codex":0.00012986467,"about_ca_system_score_gemma":0.00005963161,"threshold_uncertainty_score":0.6207132},"labels":[],"label_agreement":null},{"id":"W4412623651","doi":"10.1109/tcomm.2025.3592606","title":"A Novel Deep Learning-Based Receiver for Non-Coherent Chaotic Communication Systems With Temporal Dependencies and Spectral Properties of Chaotic Signals","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":1,"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":"Science and Technology Projects of Fujian Province","keywords":"Chaotic; Computer science; Chaotic systems; Spread spectrum; Electronic engineering; Artificial intelligence; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.022459891474809097,"score_gpt":0.24060137253277575,"score_spread":0.21814148105796666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034834545,0.0004925468,0.96221346,0.0007152125,0.000054386266,0.0010924814,0.000050395236,0.000042824297,0.00050415547],"genre_scores_gemma":[0.99667096,0.000052970034,0.0021597529,0.00001660378,0.000011098413,0.0005981445,0.0000518612,0.000018103507,0.0004205242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999127,0.0001102906,0.00032643543,0.00017051327,0.0001132671,0.00015250043],"domain_scores_gemma":[0.99853504,0.00024785474,0.00017169754,0.0007454289,0.00026064622,0.00003935301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017081312,0.00016135359,0.0002587285,0.00016171472,0.00056371704,0.00006225663,0.0003346064,0.00004858261,0.000015698457],"category_scores_gemma":[0.000004018404,0.0001403945,0.00007995103,0.0002562754,0.00020405708,0.000144812,0.0000054703814,0.00023514288,0.0000017282712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009045257,0.004817307,0.006516924,0.00085272087,0.0016451573,1.7197239e-7,0.0056373607,0.8885049,0.048725467,0.01811966,0.000052536907,0.024223221],"study_design_scores_gemma":[0.0030346438,0.0003157015,0.001030128,0.0008004285,0.00034225613,0.0000012037241,0.0024982612,0.9758687,0.0152253015,0.00021471112,0.00036353417,0.00030514225],"about_ca_topic_score_codex":0.0006571833,"about_ca_topic_score_gemma":0.000538007,"teacher_disagreement_score":0.9618364,"about_ca_system_score_codex":0.00005318061,"about_ca_system_score_gemma":0.00013521712,"threshold_uncertainty_score":0.57251215},"labels":[],"label_agreement":null},{"id":"W4412623658","doi":"10.1109/tcomm.2025.3592581","title":"Handoff Design in User-Centric Cell-Free Massive MIMO Networks Using DRL","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; University of Toronto; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Computer science; Handover; Computer network; Electronic engineering; Telecommunications; Engineering","score_opus":0.023007865553227185,"score_gpt":0.2539787545558812,"score_spread":0.23097088900265403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021622487,0.0010615442,0.9941008,0.0001485273,0.0005033676,0.0006374184,0.00001839087,0.00031220034,0.0030015293],"genre_scores_gemma":[0.9186909,0.0016062157,0.0789206,0.000038302533,0.0000125687275,0.00020713468,0.0000095266605,0.00004682244,0.00046793366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988623,0.00018368383,0.00041870977,0.00018276782,0.000082249266,0.000270271],"domain_scores_gemma":[0.99758583,0.00045159436,0.000054893288,0.0017762014,0.0000778943,0.000053558215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014229749,0.00019674479,0.00021541204,0.000491876,0.00030311404,0.000045830224,0.0006924428,0.00015039083,0.00001857849],"category_scores_gemma":[0.000010633307,0.00024077603,0.00007301248,0.0013131364,0.00006503018,0.00024083431,0.000008201629,0.00048415526,0.000013615245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010039067,0.00012045627,0.000012212144,0.00002209382,0.00002937581,7.8784313e-7,0.00010919607,0.9971072,0.0008323955,0.00014398784,0.000289435,0.0013228167],"study_design_scores_gemma":[0.00089670287,0.000011812132,0.000017242708,0.00015818074,0.00005097706,0.0000016722564,0.00012119647,0.9932908,0.004576825,0.00017663944,0.0005026763,0.00019530344],"about_ca_topic_score_codex":0.000072237555,"about_ca_topic_score_gemma":0.0002804842,"teacher_disagreement_score":0.9184747,"about_ca_system_score_codex":0.00042832003,"about_ca_system_score_gemma":0.00006168804,"threshold_uncertainty_score":0.98185617},"labels":[],"label_agreement":null},{"id":"W4412722439","doi":"10.1109/tcomm.2025.3593643","title":"Cross-Modal Semantic Transmission Strategy for Mobile Scenarios","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Qinglan Project of Jiangsu Province of China; National Natural Science Foundation of China","keywords":"Computer science; Modal; Transmission (telecommunications); Mobile telephony; Electronic engineering; Computer network; Telecommunications; Mobile radio; Engineering; Materials science","score_opus":0.023340102178004613,"score_gpt":0.3099964418576507,"score_spread":0.2866563396796461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012299318,0.0014962994,0.97982234,0.00027782048,0.00076116953,0.001420999,0.00020618919,0.0007142993,0.0030015656],"genre_scores_gemma":[0.9920108,0.0009896528,0.004384551,0.000064709646,0.00002835021,0.0012337519,0.00004422937,0.000049138147,0.0011948448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986627,0.00008770084,0.00046811605,0.00027662964,0.00014048723,0.000364337],"domain_scores_gemma":[0.9974549,0.0004758802,0.00003505002,0.0017989876,0.0001362873,0.00009892739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000250025,0.00025821303,0.00027090992,0.00019811833,0.00073231396,0.00011622535,0.00082833786,0.00022614043,0.0001405763],"category_scores_gemma":[0.000003896432,0.00028969513,0.00024228048,0.00050073216,0.00018760463,0.00023560847,0.000004777621,0.0006179506,0.000030278423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007362397,0.0006725985,0.000018947374,0.0002572181,0.00016739877,4.172559e-7,0.00046902336,0.8892863,0.0022606805,0.00070822594,0.0005524095,0.105533205],"study_design_scores_gemma":[0.0017076745,0.00014811437,0.00023277079,0.00019334277,0.00021488582,0.0000043470945,0.00015771395,0.91326684,0.012228845,0.0020920616,0.0692833,0.0004701163],"about_ca_topic_score_codex":0.00006146093,"about_ca_topic_score_gemma":0.0007363092,"teacher_disagreement_score":0.9797115,"about_ca_system_score_codex":0.00018698514,"about_ca_system_score_gemma":0.00008930695,"threshold_uncertainty_score":0.99995553},"labels":[],"label_agreement":null},{"id":"W4412939912","doi":"10.1109/tcomm.2025.3595728","title":"Spectral Efficiency Analysis of Near-Field Holographic MIMO Over Ricean Fading Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Analysis","field":"Engineering","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":"European Research Council; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Fading; MIMO; Electronic engineering; Computer science; Field (mathematics); Fading distribution; Spectral efficiency; Telecommunications; Channel (broadcasting); Engineering; Rayleigh fading; Mathematics","score_opus":0.017016397045830543,"score_gpt":0.26355113786251255,"score_spread":0.246534740816682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412939912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053665362,0.00037220155,0.9413725,0.0003562664,0.00014925457,0.00009741383,0.000028721848,0.00019090858,0.0037673449],"genre_scores_gemma":[0.9976719,0.00084797235,0.0010878391,0.00007620772,0.000004321568,0.000025196572,0.000008112067,0.000011520609,0.00026694493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.00006047849,0.00031544134,0.00014345834,0.0001055188,0.00017980773],"domain_scores_gemma":[0.9984222,0.0003042744,0.000039783892,0.0011375424,0.00005193305,0.000044244007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001272817,0.0001338063,0.00028316537,0.0010797809,0.00030253042,0.000035027268,0.00056362594,0.0000869671,0.00012956683],"category_scores_gemma":[0.00000534159,0.00014211042,0.0004160962,0.004199946,0.00012069813,0.0000790431,0.0000031885984,0.00030958906,0.000008696967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002369812,0.0008556923,0.0014715367,0.00006282193,0.0077262586,0.0000018370854,0.0016686084,0.9423536,0.03628337,0.0025910302,0.00032822488,0.0066332854],"study_design_scores_gemma":[0.00016056922,0.000030013058,0.0019063649,0.000037791568,0.0017875748,3.8489807e-7,0.00016223165,0.99225944,0.0031600525,0.00012457052,0.00021652978,0.00015445348],"about_ca_topic_score_codex":0.00012863758,"about_ca_topic_score_gemma":0.00025894455,"teacher_disagreement_score":0.9440065,"about_ca_system_score_codex":0.00003599868,"about_ca_system_score_gemma":0.000018915483,"threshold_uncertainty_score":0.5795095},"labels":[],"label_agreement":null},{"id":"W4413212913","doi":"10.1109/tcomm.2025.3597660","title":"Cell-Free Massive MIMO SWIPT With Beyond Diagonal Reconfigurable Intelligent Surfaces","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":5,"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; Queen's University; Queen's University Belfast; European Commission; Department for the Economy","keywords":"MIMO; Computer science; Diagonal; Electronic engineering; Engineering; Telecommunications; Beamforming; Mathematics","score_opus":0.015529626569516893,"score_gpt":0.24173722365507233,"score_spread":0.22620759708555543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036397225,0.0032350905,0.92545635,0.004530076,0.0002760071,0.0005253023,0.0001391013,0.0017695029,0.060428824],"genre_scores_gemma":[0.9632882,0.008989841,0.025438584,0.000092193775,0.0000033363829,0.00050583336,0.00002144985,0.00004420664,0.0016163457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988988,0.000076852826,0.00037613622,0.0002213878,0.0001490505,0.00027778719],"domain_scores_gemma":[0.9946728,0.0006592414,0.000068075235,0.0044011455,0.00014016943,0.00005856656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000099795725,0.0002598041,0.00024457366,0.0003620813,0.00055712607,0.00006063197,0.0023341973,0.00015142316,0.00010001901],"category_scores_gemma":[0.000012663245,0.0002627667,0.000086752014,0.0008372323,0.0003469506,0.00024384586,0.000017767992,0.00083862455,0.000079043624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030864303,0.0004519889,0.000029504705,0.000072033945,0.00024669542,0.0000010925688,0.00038579752,0.9336028,0.0048759268,0.007154668,0.0040261606,0.049122456],"study_design_scores_gemma":[0.0015436169,0.00019482445,0.00020010858,0.00041553195,0.00017148035,0.0000080691825,0.0037889883,0.11521477,0.7835938,0.014510021,0.07923566,0.0011231705],"about_ca_topic_score_codex":0.000035032233,"about_ca_topic_score_gemma":0.00045829167,"teacher_disagreement_score":0.9596485,"about_ca_system_score_codex":0.00021065323,"about_ca_system_score_gemma":0.00007148343,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W4413212977","doi":"10.1109/tcomm.2025.3597810","title":"A Multi-Agent DRL-Based Dynamic Resource Allocation in O-RAN-Enabled TN-NTN Metaverse Services","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"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":"Qatar National Research Fund","keywords":"Computer science; Resource allocation; Resource (disambiguation); Computer network; Distributed computing","score_opus":0.02391676841734021,"score_gpt":0.2875243269563546,"score_spread":0.2636075585390144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052297628,0.0002129612,0.9847643,0.0063137566,0.0012590664,0.00044619708,0.0000025660981,0.00035123358,0.0014201818],"genre_scores_gemma":[0.9199686,0.00007727191,0.07783105,0.00095426757,0.00001650342,0.00016451094,0.000018049584,0.000016176678,0.0009535852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981741,0.00038892252,0.00048191525,0.0004198897,0.0002041465,0.00033106594],"domain_scores_gemma":[0.9963583,0.0005436482,0.000115283714,0.002777412,0.0001296615,0.00007570843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997125,0.00021833174,0.00023099454,0.00070621143,0.00077244587,0.00017645773,0.002462028,0.00011713036,0.000005382081],"category_scores_gemma":[0.000009250196,0.00024047843,0.00014498684,0.0017165332,0.000087681176,0.0003496075,0.00003412202,0.000516727,0.0000929028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018478332,0.0102308355,0.00047266288,0.00061082176,0.00063746254,0.000019827952,0.019470636,0.6568369,0.01758024,0.003861962,0.0018060204,0.28828782],"study_design_scores_gemma":[0.0009975408,0.000029311643,0.0009407484,0.00019680304,0.000040404786,0.0000015769887,0.00020015975,0.977855,0.0019303457,0.00019546409,0.017385079,0.0002275468],"about_ca_topic_score_codex":0.00040884753,"about_ca_topic_score_gemma":0.0014293272,"teacher_disagreement_score":0.91473883,"about_ca_system_score_codex":0.0002871986,"about_ca_system_score_gemma":0.00020403143,"threshold_uncertainty_score":0.9806426},"labels":[],"label_agreement":null},{"id":"W4413277705","doi":"10.1109/tcomm.2025.3599900","title":"Fundamental Tradeoff Between Computation and Communication With Joint Coding and Interference Management in Wireless Distributed Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"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 Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Coding (social sciences); Interference (communication); Computation; Joint (building); Computer network; Distributed computing; Telecommunications; Electronic engineering; Engineering; Algorithm; Mathematics; Channel (broadcasting)","score_opus":0.036934669478127326,"score_gpt":0.28132045936146954,"score_spread":0.24438578988334222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413277705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033703733,0.00012721661,0.9622593,0.002255351,0.00008532659,0.00038753147,0.000010040361,0.00010673902,0.0010647953],"genre_scores_gemma":[0.9810189,0.00038386357,0.018391892,0.0000832108,0.0000036747401,0.00005326572,0.000017119324,0.000006832347,0.000041232226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987745,0.00027720025,0.00039675366,0.00027992215,0.00010562158,0.00016600345],"domain_scores_gemma":[0.998633,0.00036618128,0.00010847123,0.00078435673,0.000058659938,0.000049321934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033486585,0.00014863996,0.00021114585,0.00029927364,0.00060587475,0.00023659489,0.0005633876,0.00005787358,0.000001274645],"category_scores_gemma":[0.0000011958228,0.00014866286,0.000028191213,0.00058902317,0.00016163576,0.00028195867,0.000047305235,0.00035750878,0.0000014945973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072043695,0.0008390202,0.003961346,0.00026092638,0.0005238255,0.000005103164,0.007962692,0.01360596,0.00028019884,0.17923199,0.00019565386,0.79306126],"study_design_scores_gemma":[0.0012969604,0.00012362935,0.015626473,0.0010731651,0.000048389746,0.000019360241,0.0017972608,0.97755164,0.00034458732,0.0016247771,0.00020704189,0.0002867399],"about_ca_topic_score_codex":0.00012573291,"about_ca_topic_score_gemma":0.00031958503,"teacher_disagreement_score":0.9639456,"about_ca_system_score_codex":0.00013338182,"about_ca_system_score_gemma":0.000020250749,"threshold_uncertainty_score":0.60622954},"labels":[],"label_agreement":null},{"id":"W4413277782","doi":"10.1109/tcomm.2025.3599901","title":"Hybrid Beamforming Design for RSMA-Enabled Near-Field Integrated Sensing and Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":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; Electronic engineering; Field (mathematics); Computer science; Engineering","score_opus":0.030205145550511923,"score_gpt":0.2591823782947144,"score_spread":0.22897723274420248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413277782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029217114,0.00047016796,0.993969,0.0015398274,0.00018192598,0.0006798597,0.00003845123,0.00044989074,0.0023786973],"genre_scores_gemma":[0.6722948,0.0015443796,0.3250604,0.00023946528,0.0000051754078,0.00014649636,0.000029773137,0.000032433036,0.00064710004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914074,0.00010426016,0.00032994273,0.00015371968,0.000062160434,0.00020915967],"domain_scores_gemma":[0.9967991,0.0014169983,0.00003868885,0.0015275177,0.00015806417,0.000059638012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022911343,0.00018029407,0.00019205057,0.00021933821,0.0011007496,0.00012859928,0.0005355871,0.00009718601,0.000013319156],"category_scores_gemma":[0.000037461392,0.00020007938,0.00007803405,0.00039014468,0.00015529434,0.00019468725,0.00000868902,0.00038597843,0.000009793054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019745264,0.00048349373,0.000011341717,0.0002178178,0.0007045225,0.000001016258,0.0018501877,0.58159554,0.018463293,0.0041127065,0.010648718,0.38171393],"study_design_scores_gemma":[0.0004153228,0.000043785025,0.0000040679874,0.00013123766,0.000104042345,0.0000056801464,0.00023237751,0.9774207,0.010950216,0.00082286086,0.009689674,0.00018006562],"about_ca_topic_score_codex":0.00006281146,"about_ca_topic_score_gemma":0.00012444973,"teacher_disagreement_score":0.6720026,"about_ca_system_score_codex":0.00009621262,"about_ca_system_score_gemma":0.0000771585,"threshold_uncertainty_score":0.8466187},"labels":[],"label_agreement":null},{"id":"W4413359259","doi":"10.1109/tcomm.2025.3600568","title":"Performance Analysis and Enhancement of P-LDPC Codes for Lossy Compression of Binary Sources","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"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; National Science Foundation","keywords":"Low-density parity-check code; Lossy compression; Electronic engineering; Computer science; Binary number; Compression (physics); Decoding methods; Algorithm; Materials science; Mathematics; Engineering; Arithmetic","score_opus":0.026199155251223852,"score_gpt":0.313538639331471,"score_spread":0.2873394840802472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413359259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13638051,0.00021721718,0.8621644,0.0004516636,0.000056444176,0.00022418899,0.000014424928,0.00008300287,0.00040817016],"genre_scores_gemma":[0.87216836,0.000627804,0.12689999,0.00002495579,0.0000010278256,0.00010716832,0.0000026794944,0.0000035167975,0.00016451435],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991924,0.00008882878,0.00034084055,0.00017402302,0.00010792683,0.00009593468],"domain_scores_gemma":[0.9975492,0.0006019773,0.00016543166,0.001476754,0.00018450408,0.00002213528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002706367,0.00009187073,0.00023299234,0.0005065066,0.0002945711,0.000016425673,0.0010080693,0.000047967,0.000003286127],"category_scores_gemma":[0.0000074471136,0.00009149086,0.000109435874,0.0010317428,0.00016903527,0.00014953509,0.0000254021,0.00012350011,3.5807975e-7],"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.00026161477,0.0053451224,0.011507601,0.0011790356,0.002882001,2.719359e-7,0.010248963,0.028515529,0.46616355,0.013991426,0.00057404523,0.45933086],"study_design_scores_gemma":[0.00021225552,0.0002125081,0.002758048,0.00022072882,0.000244158,4.5978257e-7,0.00009123105,0.4117402,0.5837856,0.00034970217,0.0002775681,0.0001075281],"about_ca_topic_score_codex":0.0000936622,"about_ca_topic_score_gemma":0.000109515946,"teacher_disagreement_score":0.7357878,"about_ca_system_score_codex":0.000026163687,"about_ca_system_score_gemma":0.000047364265,"threshold_uncertainty_score":0.3730889},"labels":[],"label_agreement":null},{"id":"W4413359266","doi":"10.1109/tcomm.2025.3600529","title":"A Hypernetwork Framework for Learning Adaptive Beamforming Schemes in RIS Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Energy Efficient Wireless Sensor Networks","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":"Beamforming; Computer science; Adaptive beamformer; Electronic engineering; Computer architecture; Telecommunications; Engineering","score_opus":0.03158023583484575,"score_gpt":0.29312365746922214,"score_spread":0.2615434216343764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413359266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089633773,0.00090298324,0.9943098,0.0010649344,0.00067033316,0.00046186274,0.00000440215,0.00030686715,0.0013825065],"genre_scores_gemma":[0.7106397,0.0003036716,0.28798166,0.00009433025,0.000017112192,0.00044921853,0.000002779446,0.000013958835,0.00049754424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845016,0.00023430724,0.00039977624,0.00035477354,0.00015441359,0.00040655935],"domain_scores_gemma":[0.99569356,0.002258208,0.0001141285,0.0017445917,0.00012923194,0.00006030295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004131831,0.00018226742,0.00024301444,0.00038458576,0.0007750155,0.00014454873,0.0017438678,0.00017769802,0.0000017721198],"category_scores_gemma":[0.000035667286,0.00020269275,0.00012506937,0.0014479347,0.00010136933,0.00024337633,0.000022499304,0.0008406288,0.000010502548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011722611,0.00017567308,0.000020934403,0.000009583693,0.00003774477,3.1536416e-7,0.000309122,0.7960061,0.000033706245,0.1843903,0.00003238492,0.018972436],"study_design_scores_gemma":[0.0002938892,0.000059585553,0.000019138184,0.00047242237,0.000018910858,0.000001974714,0.00027472322,0.9864097,0.0005377284,0.0017770054,0.009944282,0.00019062521],"about_ca_topic_score_codex":0.000114768154,"about_ca_topic_score_gemma":0.00018565357,"teacher_disagreement_score":0.7097434,"about_ca_system_score_codex":0.00021243085,"about_ca_system_score_gemma":0.000103336206,"threshold_uncertainty_score":0.82655704},"labels":[],"label_agreement":null},{"id":"W4413554257","doi":"10.1109/tcomm.2025.3602366","title":"A Novel CNN-Based Standalone Detector for Faster-Than-Nyquist Signaling","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":2,"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 Saskatchewan","funders":"","keywords":"Detector; Computer science; Nyquist–Shannon sampling theorem; Electronic engineering; Telecommunications; Engineering","score_opus":0.03585470650869732,"score_gpt":0.28586555918146267,"score_spread":0.25001085267276535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413554257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033042138,0.00021321315,0.99112314,0.00091170304,0.00083773356,0.00053420645,0.00032517454,0.0006437874,0.0021068545],"genre_scores_gemma":[0.9584581,0.00005579607,0.03971336,0.00010862229,0.00002611954,0.00082269206,0.000018649782,0.00004594235,0.0007507082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990659,0.00003733307,0.00035414868,0.0001829974,0.000121298646,0.00023836306],"domain_scores_gemma":[0.99780154,0.0005789179,0.00003868579,0.0013736141,0.00013757858,0.0000696409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014508073,0.00019175209,0.00019219123,0.00034734048,0.0005445846,0.000062565,0.00060264487,0.00010906891,0.00005371841],"category_scores_gemma":[0.000014158367,0.00022975856,0.00017138508,0.0005268204,0.00012452711,0.00010210076,0.000002455679,0.00034299213,0.00002833519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005582338,0.00053569005,0.0000061826468,0.00018003493,0.00030575684,1.9493359e-7,0.00028516047,0.7223949,0.26183128,0.00069680787,0.0009355203,0.012772688],"study_design_scores_gemma":[0.002700774,0.00012020079,0.00007147523,0.00035519508,0.00025858052,0.000004875992,0.00038720644,0.50415343,0.4295579,0.00040834973,0.061360702,0.0006213117],"about_ca_topic_score_codex":0.000026785317,"about_ca_topic_score_gemma":0.00015684433,"teacher_disagreement_score":0.9551539,"about_ca_system_score_codex":0.0002433497,"about_ca_system_score_gemma":0.000091667,"threshold_uncertainty_score":0.9369282},"labels":[],"label_agreement":null},{"id":"W4413925946","doi":"10.1109/tcomm.2025.3605463","title":"Super-Resolution Angle Estimation for RIS-Aided Wideband mmWave Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":0,"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":"Wideband; Electronic engineering; Computer science; Remote sensing; Engineering; Geology","score_opus":0.04902322468381776,"score_gpt":0.29535819902970367,"score_spread":0.24633497434588592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413925946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008780877,0.00079062843,0.9876975,0.002642338,0.00038192607,0.000846716,0.000163162,0.0006005458,0.0059991092],"genre_scores_gemma":[0.91317517,0.001339465,0.08348689,0.00021498447,0.000011982088,0.00088130723,0.00017643497,0.00003982934,0.00067396276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987817,0.00011714131,0.0005169529,0.00020666199,0.00012568268,0.00025188358],"domain_scores_gemma":[0.9964267,0.00065899483,0.000053737207,0.0025613694,0.00022199539,0.00007718472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027582087,0.0002145912,0.00021487116,0.0003999393,0.0010119646,0.00008584792,0.0008638183,0.00014789867,0.000033906483],"category_scores_gemma":[0.000034143388,0.00025071113,0.00016946922,0.00052002346,0.00015186051,0.00027451073,0.000011084821,0.0003923589,0.00005136199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000618135,0.00080796756,0.000008084234,0.00020780746,0.00042736248,1.8001315e-7,0.0015493543,0.79014397,0.044261634,0.006412445,0.0062155505,0.1499038],"study_design_scores_gemma":[0.0006359083,0.00003606515,0.000016206515,0.000107476815,0.00012917319,0.000002080162,0.00016865639,0.9500592,0.03506,0.0025758666,0.010978671,0.00023074177],"about_ca_topic_score_codex":0.000050366834,"about_ca_topic_score_gemma":0.0004334219,"teacher_disagreement_score":0.91229707,"about_ca_system_score_codex":0.00022207497,"about_ca_system_score_gemma":0.00006673265,"threshold_uncertainty_score":0.9999945},"labels":[],"label_agreement":null},{"id":"W4413925949","doi":"10.1109/tcomm.2025.3605466","title":"QoS-Aware NOMA Design for Downlink Pinching-Antenna Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"National Natural Science Foundation of China","keywords":"Noma; Telecommunications link; Computer science; Quality of service; Antenna (radio); Electronic engineering; Computer network; Telecommunications; Engineering","score_opus":0.04436238810960799,"score_gpt":0.28950746102610675,"score_spread":0.24514507291649876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413925949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011315528,0.0018214544,0.9913257,0.0014537964,0.0006778718,0.0010116093,0.00012961932,0.0023321253,0.0011346776],"genre_scores_gemma":[0.9374217,0.0032427094,0.05658238,0.00006050345,0.000011757581,0.0021116005,0.00002582857,0.00004938529,0.0004941373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886304,0.00010534261,0.00045822677,0.00020334957,0.00009843993,0.00027160777],"domain_scores_gemma":[0.995025,0.0011822046,0.00006353693,0.003520796,0.00016274248,0.000045751207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019065842,0.00023760379,0.00026986006,0.00041898325,0.000748142,0.00007497302,0.0018723211,0.00019205282,0.000007790097],"category_scores_gemma":[0.000023757488,0.00026464768,0.00013276706,0.0006439261,0.00018575044,0.00020760602,0.000013495167,0.0005745592,0.000039459595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023885907,0.00023541301,0.0000030173314,0.00012829434,0.00023704476,2.402602e-7,0.00017218964,0.9419992,0.0049386467,0.009272018,0.0019060886,0.041083954],"study_design_scores_gemma":[0.0006111431,0.000058386002,0.000022527372,0.0002587307,0.000069101574,0.000003987493,0.00062422105,0.9551261,0.0125691295,0.002136762,0.028142357,0.0003775489],"about_ca_topic_score_codex":0.00001838197,"about_ca_topic_score_gemma":0.000050390612,"teacher_disagreement_score":0.93730855,"about_ca_system_score_codex":0.00023137653,"about_ca_system_score_gemma":0.00005134372,"threshold_uncertainty_score":0.99998057},"labels":[],"label_agreement":null},{"id":"W4414008401","doi":"10.1109/tcomm.2025.3606647","title":"Knowledge Sharing-Enabled Semantic Rate Maximization for Multi-Cell Task-Oriented Hybrid Semantic-Bit Communication Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","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":"Western University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Maximization; Bit error rate; Computer network; Computer architecture; Distributed computing; Channel (broadcasting); Engineering; Mathematics","score_opus":0.035913565002770986,"score_gpt":0.290979862205952,"score_spread":0.255066297203181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414008401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035077662,0.00091252924,0.99070436,0.0018244977,0.0015122299,0.0013646614,0.000024362032,0.00052626454,0.0027803262],"genre_scores_gemma":[0.9615162,0.00087870413,0.02837057,0.0003687037,0.000033029624,0.0009366776,0.000083172796,0.00003823643,0.0077747214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974101,0.00055820413,0.00085086084,0.0006018954,0.00013520064,0.0004437369],"domain_scores_gemma":[0.99357074,0.00085626054,0.00028873226,0.004486779,0.0006868063,0.000110679604],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000995222,0.00032734306,0.00038544045,0.00049663783,0.0020172428,0.00038330702,0.002980797,0.000172093,0.000014761571],"category_scores_gemma":[0.000026590642,0.00035498742,0.00027801105,0.0013139338,0.0001334485,0.00059673114,0.00007571807,0.00059711235,0.00005912185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020074847,0.007051784,0.00013827016,0.00045472002,0.00077477185,0.0000025147026,0.0036087881,0.7888086,0.0015644003,0.144306,0.016881606,0.03620781],"study_design_scores_gemma":[0.0014497814,0.00006950051,0.000057088975,0.00026926686,0.00008841953,0.000006189737,0.00011836107,0.9814906,0.0013316055,0.00063275016,0.014173628,0.00031277438],"about_ca_topic_score_codex":0.00013456841,"about_ca_topic_score_gemma":0.00077711587,"teacher_disagreement_score":0.9623338,"about_ca_system_score_codex":0.00023239962,"about_ca_system_score_gemma":0.000134175,"threshold_uncertainty_score":0.9998902},"labels":[],"label_agreement":null},{"id":"W4414008967","doi":"10.1109/tcomm.2025.3606641","title":"Efficient STAR-RIS Mode for Energy Minimization in WPT-FL Networks With NOMA","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of the Fraser Valley; Université Laval","funders":"","keywords":"Noma; Minification; Electronic engineering; Computer science; Energy (signal processing); Mode (computer interface); Electrical engineering; Physics; Engineering; Telecommunications; Telecommunications link","score_opus":0.01217439715830907,"score_gpt":0.24447084893080984,"score_spread":0.23229645177250077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414008967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004281371,0.00064094516,0.9899067,0.0016542107,0.00011133133,0.00038018072,0.000040486804,0.0007111755,0.002273588],"genre_scores_gemma":[0.9556637,0.0014586039,0.04152099,0.000070123264,0.0000035616158,0.0010632632,0.000031309683,0.000034696877,0.00015375728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907535,0.000060339797,0.00035715106,0.00017724001,0.00008985282,0.00024005047],"domain_scores_gemma":[0.9971213,0.0006339331,0.000037903956,0.0020655284,0.000104086146,0.000037263977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007469025,0.00018063479,0.00020248978,0.00040906935,0.00028462586,0.00004073018,0.00093638664,0.000166389,0.000008487041],"category_scores_gemma":[0.00001074073,0.00018884742,0.00006531643,0.00096068083,0.0001704754,0.000062875275,0.000010303709,0.0003745373,0.000003547917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025976286,0.00024285255,0.000008883148,0.000014432486,0.000047036592,9.863808e-8,0.000076581375,0.9669634,0.000091242524,0.00891446,0.00014426826,0.023470758],"study_design_scores_gemma":[0.000539618,0.000043227843,0.00009300768,0.00009823726,0.000027527649,6.023098e-7,0.00018686488,0.9921615,0.0029617173,0.0003579524,0.0033490015,0.00018074631],"about_ca_topic_score_codex":0.00006876037,"about_ca_topic_score_gemma":0.0015014956,"teacher_disagreement_score":0.95138234,"about_ca_system_score_codex":0.00021492683,"about_ca_system_score_gemma":0.000041374067,"threshold_uncertainty_score":0.77009743},"labels":[],"label_agreement":null},{"id":"W4414230458","doi":"10.1109/tcomm.2025.3610221","title":"Resilience of Mega-Satellite Constellations: How Node Failures Impact Inter-Satellite Networking Over Time?","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","cited_by":5,"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":"Division of Electrical, Communications and Cyber Systems; Japan Science and Technology Agency; China Scholarship Council; Ministry of Education, India; Queen's University; National Natural Science Foundation of China; Queen's University Belfast; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Resilience (materials science); Node (physics); Constellation; Survivability; Betweenness centrality; Satellite constellation; Satellite; Leverage (statistics)","score_opus":0.021820230298060742,"score_gpt":0.28371442148037734,"score_spread":0.2618941911823166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414230458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012417991,0.069494955,0.7962268,0.0043936386,0.0022002617,0.0027357477,0.00041918422,0.0025245398,0.10958687],"genre_scores_gemma":[0.9746855,0.01997909,0.0039375485,0.00006667124,0.000023275925,0.00012164966,0.00003785637,0.000056708748,0.0010917226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788153,0.00040084208,0.000810639,0.00028912406,0.0002540478,0.00036381575],"domain_scores_gemma":[0.9936401,0.0016451278,0.0001791883,0.0041769436,0.00024991218,0.00010871353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043150355,0.00035961106,0.00046853643,0.00066075893,0.00040784408,0.00014868342,0.0017367424,0.00021041416,0.000113890754],"category_scores_gemma":[0.000020234644,0.00038276453,0.00031016456,0.0015635851,0.00042101773,0.0003799786,0.00002449021,0.0006536652,0.00008790731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018193058,0.0010868439,0.0047539175,0.0005875466,0.002531059,0.0000028821828,0.0045579188,0.29948908,0.067395456,0.0037826295,0.003032781,0.61259794],"study_design_scores_gemma":[0.0019405746,0.00014207515,0.0049362234,0.0028634565,0.00046559857,0.00003172701,0.0012602537,0.35876077,0.05368028,0.00096104364,0.5732693,0.0016886896],"about_ca_topic_score_codex":0.00009010401,"about_ca_topic_score_gemma":0.00018797844,"teacher_disagreement_score":0.96226746,"about_ca_system_score_codex":0.00028648973,"about_ca_system_score_gemma":0.000100933496,"threshold_uncertainty_score":0.99986243},"labels":[],"label_agreement":null},{"id":"W4414603553","doi":"10.1109/tcomm.2025.3615770","title":"Tracking and Positioning Dynamic Targets in VLC: Signal Dependent Noises and Bayesian Bound Analysis","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kalman filter; Tracking (education); Position (finance); Bayesian probability; Noise (video); Visible light communication; Upper and lower bounds; Particle filter; Noise measurement","score_opus":0.012754772127856062,"score_gpt":0.3002715988149857,"score_spread":0.28751682668712963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414603553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23963031,0.0053924466,0.74309886,0.0019403504,0.00003211189,0.00012971091,0.000101443984,0.00013027292,0.009544469],"genre_scores_gemma":[0.99579716,0.0014632547,0.0019010323,0.00007558004,0.0000029759767,0.00005010071,0.00002403928,0.0000096041795,0.0006762267],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991472,0.000045030985,0.000281482,0.00025318988,0.000102601625,0.0001705147],"domain_scores_gemma":[0.9988344,0.00038203056,0.000060470687,0.00062225736,0.00004444918,0.000056430497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102290134,0.00014326158,0.00024192956,0.00075093826,0.0005962822,0.00011590168,0.00027141147,0.00009757353,0.00024433344],"category_scores_gemma":[0.000007896334,0.00016271089,0.00008969417,0.0013280927,0.00015628968,0.00014286417,0.000007910024,0.00038745665,0.0000015961756],"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.0005876347,0.009792186,0.083785184,0.0010711554,0.02128459,0.000048235168,0.011377161,0.062305477,0.6133044,0.0069919745,0.00012439083,0.18932764],"study_design_scores_gemma":[0.0043928255,0.00014067444,0.04401767,0.0005481349,0.015506089,0.00005524337,0.011528447,0.42134684,0.49153465,0.0084090335,0.0005508932,0.0019694795],"about_ca_topic_score_codex":0.00037407872,"about_ca_topic_score_gemma":0.0039648153,"teacher_disagreement_score":0.7561669,"about_ca_system_score_codex":0.00013845792,"about_ca_system_score_gemma":0.000041073457,"threshold_uncertainty_score":0.66351575},"labels":[],"label_agreement":null},{"id":"W4414603913","doi":"10.1109/tcomm.2025.3615774","title":"Full-Diversity Construction-D Lattices: Design and Decoding Perspective on Block-Fading Channels","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":1,"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":"Decoding methods; Lattice (music); Algebraic number; Additive white Gaussian noise; Error detection and correction; Coding (social sciences); Generator matrix; List decoding; Concatenated error correction code","score_opus":0.037425545459896375,"score_gpt":0.2737209845405429,"score_spread":0.2362954390806465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414603913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00384614,0.00026923948,0.98425156,0.00061747147,0.0002981579,0.00036934335,0.000019680972,0.0007614888,0.009566902],"genre_scores_gemma":[0.96889156,0.0014224619,0.029368393,0.000078572884,0.000010286265,0.00008041735,0.0000012614134,0.000016203034,0.00013084995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931324,0.00009445901,0.00016658801,0.00017762171,0.00008601206,0.00016209538],"domain_scores_gemma":[0.9986565,0.0005141113,0.000026903692,0.0006608541,0.00008563152,0.00005600296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015714888,0.00015892247,0.00015392415,0.00035188903,0.0010530768,0.00005890394,0.0003657365,0.00010786397,0.000019515599],"category_scores_gemma":[0.000008143487,0.0001829468,0.000062534185,0.00037341862,0.0001561546,0.000157804,0.000010139521,0.0004107648,0.000014396226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029548822,0.0010437842,0.00011180816,0.00023462756,0.0018538882,0.00000868565,0.017442638,0.75322086,0.023505889,0.09626381,0.003673216,0.10234529],"study_design_scores_gemma":[0.0019908529,0.0005845747,0.00013697549,0.0009898911,0.00066453655,0.00007479229,0.008248843,0.82206863,0.13758698,0.022927724,0.0033030005,0.0014232111],"about_ca_topic_score_codex":0.0000428657,"about_ca_topic_score_gemma":0.000031561558,"teacher_disagreement_score":0.9650454,"about_ca_system_score_codex":0.00023833306,"about_ca_system_score_gemma":0.00002279197,"threshold_uncertainty_score":0.80995214},"labels":[],"label_agreement":null},{"id":"W4414692552","doi":"10.1109/tcomm.2025.3616229","title":"Cooperative Inference for Real-Time 3D Human Pose Estimation in Multi-Device Edge Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Human Pose and Action Recognition","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Inference; Approximate inference; Transmission (telecommunications); Pose; Enhanced Data Rates for GSM Evolution; Reduction (mathematics); Filter (signal processing)","score_opus":0.05838340793875502,"score_gpt":0.3588135928364608,"score_spread":0.3004301848977058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414692552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012961066,0.000033596712,0.99327403,0.0011051769,0.00022092862,0.0006930824,0.000023723727,0.00024121752,0.0031121308],"genre_scores_gemma":[0.922085,0.00022670369,0.07518766,0.00033371855,0.000009527251,0.00065010285,0.00005785745,0.000011571717,0.0014378637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.00021628886,0.00040899907,0.00030483637,0.00009269428,0.00021100386],"domain_scores_gemma":[0.9976143,0.00071371964,0.00009805303,0.0012655813,0.0002553697,0.00005293859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026779322,0.00016494647,0.00018946394,0.00039753795,0.00092019583,0.00016676908,0.0009812114,0.00011633187,0.000034461682],"category_scores_gemma":[0.000020323001,0.00018420395,0.000080707745,0.0008205631,0.00009219626,0.00062804046,0.000013977301,0.00035223368,0.000068935726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083241466,0.0059704697,0.00006407645,0.000107737396,0.00028884606,0.0000025572765,0.0044368575,0.5198138,0.013626431,0.071129926,0.002240484,0.38223562],"study_design_scores_gemma":[0.00081622484,0.000077289544,0.000431418,0.00014605877,0.00002641925,0.0000010455661,0.000044179822,0.99439025,0.0021582418,0.001039231,0.0006777858,0.00019183083],"about_ca_topic_score_codex":0.00013778484,"about_ca_topic_score_gemma":0.0009696617,"teacher_disagreement_score":0.9207889,"about_ca_system_score_codex":0.00013982547,"about_ca_system_score_gemma":0.00011852606,"threshold_uncertainty_score":0.7511619},"labels":[],"label_agreement":null},{"id":"W4415124307","doi":"10.1109/tcomm.2025.3621045","title":"Cooperative Digital Twin-Enhanced UAV Topology Optimization for Multi-Target Tracking","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Optical Sensing Technologies","field":"Physics and Astronomy","cited_by":10,"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":"Info-communications Media Development Authority; Queen's University; National Research Foundation Singapore; National Research Foundation; Queen's University Belfast","keywords":"Network topology; Topology optimization; Graph; Tracking (education); Position (finance); Topology (electrical circuits)","score_opus":0.03873767822150669,"score_gpt":0.3340459563494326,"score_spread":0.2953082781279259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415124307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085307367,0.000031470143,0.9929595,0.0019177059,0.00017114526,0.00047691015,0.00016125597,0.00024020302,0.0031887086],"genre_scores_gemma":[0.76181245,0.000013471831,0.23704444,0.00006840861,0.000008487548,0.00019396868,0.000048975144,0.000013247996,0.00079655007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926394,0.000035051995,0.00024531034,0.00021336136,0.000046367713,0.00019596539],"domain_scores_gemma":[0.9984214,0.00045119744,0.0000618129,0.0008321351,0.00020429674,0.000029165343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004117264,0.00014534166,0.00017684072,0.0001176411,0.00065352203,0.00007475938,0.0004186264,0.00007516751,0.000053963697],"category_scores_gemma":[0.000023291788,0.0001513257,0.00010257459,0.00032545318,0.0002719108,0.00024545417,0.000008545052,0.000289429,0.000010278017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059828966,0.0012801565,0.00004968089,0.000009472441,0.00025726188,1.05922155e-7,0.00037302892,0.7709771,0.0018610982,0.062878035,0.000120738645,0.16213351],"study_design_scores_gemma":[0.001962689,0.00016444802,0.00003631838,0.00010355937,0.0001157505,5.6431287e-7,0.0022414175,0.80148584,0.16815005,0.02106807,0.0041749612,0.000496311],"about_ca_topic_score_codex":0.000014267982,"about_ca_topic_score_gemma":0.000018963872,"teacher_disagreement_score":0.7609594,"about_ca_system_score_codex":0.000059236612,"about_ca_system_score_gemma":0.0000520632,"threshold_uncertainty_score":0.6170883},"labels":[],"label_agreement":null},{"id":"W4415125084","doi":"10.1109/tcomm.2025.3621094","title":"RIS With Coupled Phase Shift and Amplitude: Capacity Maximization and Configuration Set Selection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Interconnection Networks and Systems","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":"Reflection (computer programming); Maximization; Amplitude; Reflection coefficient; Phase (matter); Set (abstract data type); Continuous phase modulation; Surface (topology)","score_opus":0.03237185869466722,"score_gpt":0.28570488005841255,"score_spread":0.2533330213637453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415125084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022850316,0.00007193251,0.9734223,0.0022923397,0.00015921042,0.00037932486,0.000013900607,0.00017759275,0.0006330965],"genre_scores_gemma":[0.99294955,0.00021298167,0.0062908805,0.00020105693,0.000009681582,0.000146956,0.000011779209,0.0000051489187,0.00017198443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902844,0.0001884143,0.00025852746,0.00027814897,0.000113425696,0.00013306734],"domain_scores_gemma":[0.99877995,0.0002600912,0.00009146616,0.0006444182,0.00016539024,0.000058695303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023300575,0.00013826202,0.00015233483,0.00016908559,0.0008740818,0.00027205062,0.00030732082,0.000085888256,0.000010234045],"category_scores_gemma":[0.0000048427632,0.00011934279,0.000028597833,0.00057167135,0.000103695194,0.00045096458,0.000006374331,0.00025781392,0.0000033925169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007931971,0.004717775,0.0014067016,0.00037519613,0.0015790703,0.0000042589745,0.019893257,0.06612413,0.023896512,0.5267426,0.0018549603,0.35261238],"study_design_scores_gemma":[0.001480548,0.0002910174,0.0010480372,0.00011203444,0.00006296873,0.000034831843,0.00014349176,0.9895568,0.0021231687,0.001234971,0.0036697027,0.00024244338],"about_ca_topic_score_codex":0.00028466518,"about_ca_topic_score_gemma":0.0016914883,"teacher_disagreement_score":0.9700992,"about_ca_system_score_codex":0.000066609915,"about_ca_system_score_gemma":0.00004750699,"threshold_uncertainty_score":0.6722819},"labels":[],"label_agreement":null},{"id":"W4415159121","doi":"10.1109/tcomm.2025.3621247","title":"Power Minimization Under Quality of Service Constraints for MIMO Systems With a RIS-Based Transmitter","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":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":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Computational complexity theory; MIMO; Transmitter power output; Minification; Quality of service; Transmitter; Power (physics)","score_opus":0.029691741313085124,"score_gpt":0.29307509423841427,"score_spread":0.26338335292532916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415159121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069819426,0.00015723775,0.99406284,0.0008376534,0.00023131292,0.0010560139,0.000281976,0.00025836006,0.002416401],"genre_scores_gemma":[0.9686849,0.000033637076,0.030307882,0.00017060633,0.0000038458056,0.0005865765,0.00005157678,0.000038610866,0.00012237014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889493,0.00012128423,0.0005423265,0.00016957289,0.000110719724,0.00016117885],"domain_scores_gemma":[0.9977723,0.0005744812,0.00010051449,0.0011325183,0.00037784822,0.000042333384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016011376,0.00018122428,0.00027771486,0.00023691065,0.00019156373,0.000024845065,0.00034801709,0.0001232532,0.000020029249],"category_scores_gemma":[0.0000043215587,0.00018717225,0.00008242218,0.0006314812,0.00013184824,0.00014745673,9.91854e-7,0.00017115816,0.0000038603075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055216977,0.00015851558,0.000010578559,0.00031197816,0.00013323344,3.2152535e-8,0.0002089202,0.99509245,0.001454534,0.0021068018,0.00005788177,0.00040986759],"study_design_scores_gemma":[0.0034018788,0.000107548076,0.00018647584,0.0007506559,0.00020384985,0.0000024783765,0.0013666749,0.98267627,0.009604847,0.0003081697,0.00091938855,0.00047175118],"about_ca_topic_score_codex":0.000049820803,"about_ca_topic_score_gemma":0.00036060755,"teacher_disagreement_score":0.9679867,"about_ca_system_score_codex":0.00011611813,"about_ca_system_score_gemma":0.00009142219,"threshold_uncertainty_score":0.7632663},"labels":[],"label_agreement":null},{"id":"W4415179915","doi":"10.1109/tcomm.2025.3621209","title":"From Rigid Isolation to Elastic Integration: Progressively Unified Resource Allocation in ISAC for Value of Service Maximization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Resource allocation; Maximization; Bandwidth (computing); Resource (disambiguation); Service (business); Scheme (mathematics); Resource management (computing); Isolation (microbiology); Heterogeneous network","score_opus":0.01652308937204438,"score_gpt":0.2663079426144888,"score_spread":0.24978485324244443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415179915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012401095,0.000114759656,0.9822711,0.0025236364,0.00038843715,0.0011029041,0.000072432595,0.00020629614,0.0009193584],"genre_scores_gemma":[0.992393,0.000037274047,0.0061670537,0.00016846055,0.000019175783,0.00092477805,0.00007576379,0.00002236647,0.00019210135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989931,0.00010909535,0.0004936589,0.00017010196,0.00010908285,0.00012496792],"domain_scores_gemma":[0.99852186,0.00041218475,0.00007045905,0.00076694245,0.00018784797,0.000040689818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001284867,0.00014086369,0.00018878526,0.0004182256,0.00015709778,0.00003549526,0.00035743735,0.00012128845,0.000009737226],"category_scores_gemma":[0.00002619085,0.0001615598,0.000061891296,0.0010496385,0.000024126377,0.00014528343,0.0000026739538,0.00019128059,0.000012728127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012982229,0.00022993708,0.000011084168,0.00009185081,0.00009569027,6.502539e-8,0.0017939056,0.94514376,0.027862169,0.0026892414,0.00023470193,0.021717764],"study_design_scores_gemma":[0.00087861536,0.000054525666,0.00043081833,0.0003553505,0.000063468884,3.7324116e-7,0.0005899555,0.97170097,0.020252934,0.00058039534,0.004940307,0.00015228776],"about_ca_topic_score_codex":0.00031050312,"about_ca_topic_score_gemma":0.0019150473,"teacher_disagreement_score":0.9799919,"about_ca_system_score_codex":0.000184641,"about_ca_system_score_gemma":0.00004713265,"threshold_uncertainty_score":0.65882176},"labels":[],"label_agreement":null},{"id":"W4415398673","doi":"10.1109/tcomm.2025.3624157","title":"On the Fundamental Limits of Integrated Sensing and Communications Under Logarithmic Loss","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":2,"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); McMaster University","funders":"","keywords":"Transmitter; Logarithm; Channel (broadcasting); Function (biology); Gaussian; Distortion (music); Log amplifier","score_opus":0.04461909036190977,"score_gpt":0.2924702234357977,"score_spread":0.24785113307388792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415398673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026884228,0.0010873474,0.95659775,0.03311245,0.0009132282,0.0007742205,0.0003673713,0.00015289102,0.004306348],"genre_scores_gemma":[0.9846067,0.005450157,0.007304123,0.0014715826,0.000010512009,0.000048743124,0.000025952464,0.000025057714,0.0010571723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966541,0.0011566854,0.0009128456,0.00052722445,0.00034421,0.00040495372],"domain_scores_gemma":[0.9886253,0.003414188,0.0003380115,0.006983358,0.0004987135,0.00014042792],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00061226584,0.00041899955,0.0004318538,0.00049152214,0.0029307306,0.00042359182,0.003219139,0.00026722936,0.000060405848],"category_scores_gemma":[0.000037412927,0.00037249678,0.00026172752,0.0025203351,0.0021453355,0.00025953297,0.00009817588,0.0017364867,0.00004304394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001879787,0.004118295,0.00001659659,0.000066848785,0.001380271,0.0000031239204,0.0018784822,0.033120573,0.0011875778,0.29311693,0.0019520586,0.66297126],"study_design_scores_gemma":[0.0009454969,0.00030655297,0.00023082644,0.00073120213,0.0002632765,0.00003715168,0.0016605754,0.97509426,0.003359156,0.008548319,0.008396288,0.0004268671],"about_ca_topic_score_codex":0.00045746163,"about_ca_topic_score_gemma":0.0008820119,"teacher_disagreement_score":0.9819183,"about_ca_system_score_codex":0.0003015673,"about_ca_system_score_gemma":0.0003548963,"threshold_uncertainty_score":0.9998727},"labels":[],"label_agreement":null},{"id":"W4415624518","doi":"10.1109/tcomm.2025.3626652","title":"Beamforming for Massive MIMO Aerial Communications: A Robust and Scalable DRL Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":1,"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; École de Technologie Supérieure","funders":"","keywords":"Beamforming; Scalability; Robustness (evolution); Telecommunications link; Base station; MIMO; Channel state information; Overhead (engineering)","score_opus":0.03286685200953706,"score_gpt":0.26466470695522565,"score_spread":0.23179785494568858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415624518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000121350684,0.003836666,0.97023296,0.00452523,0.00051276863,0.0030445792,0.0006290072,0.00035138856,0.016746022],"genre_scores_gemma":[0.43994868,0.022135818,0.5293495,0.00020123411,0.00005713611,0.0054056584,0.00032815672,0.000117604795,0.002456233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732864,0.00020936808,0.0010904279,0.00060634833,0.00019695838,0.00056823966],"domain_scores_gemma":[0.99222094,0.0012115057,0.00022130391,0.0056938236,0.00046187287,0.00019058546],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00049296377,0.00054603966,0.0005711579,0.0007037002,0.0032922332,0.00038803744,0.0021676263,0.00047845018,0.00004626076],"category_scores_gemma":[0.00003384344,0.0006754211,0.0002769308,0.0015689579,0.00075076194,0.00054320437,0.000058941492,0.0009415396,0.000027282884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011193363,0.0019377582,0.0000078747225,0.00050770916,0.00076425256,8.700394e-8,0.0014550965,0.8899927,0.00079742324,0.04944471,0.0017089095,0.053271547],"study_design_scores_gemma":[0.0016369091,0.00008295343,0.000019695834,0.00030779454,0.00068009674,0.000004805002,0.0011680011,0.951708,0.0009220354,0.0012361226,0.041674167,0.0005593781],"about_ca_topic_score_codex":0.00017999044,"about_ca_topic_score_gemma":0.00030651898,"teacher_disagreement_score":0.4408835,"about_ca_system_score_codex":0.00042684592,"about_ca_system_score_gemma":0.00026911602,"threshold_uncertainty_score":0.9995697},"labels":[],"label_agreement":null},{"id":"W4415883602","doi":"10.1109/tcomm.2025.3628766","title":"2D-AoI: Age-of-Information of Distributed Sensors for Spatio-Temporal Processes","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":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":"Deutsche Forschungsgemeinschaft","keywords":"Covariance; Wireless sensor network; Offset (computer science); Gaussian; Measure (data warehouse); Network topology; Gaussian process; Exponential function","score_opus":0.026065578182485005,"score_gpt":0.28333200764214417,"score_spread":0.25726642945965916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415883602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039009564,0.0001564536,0.9900017,0.0031530047,0.00063987606,0.0017486511,0.0014713744,0.00014804283,0.0022908477],"genre_scores_gemma":[0.8589941,0.00089355226,0.13830025,0.00012870089,0.000008563351,0.0003172928,0.0009815922,0.000014814499,0.00036113188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966954,0.00020816975,0.0020681147,0.00025803715,0.00044589632,0.0003243626],"domain_scores_gemma":[0.9919537,0.0011179473,0.0012851352,0.0028498396,0.0026935306,0.00009984826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005700454,0.00034925927,0.00052425114,0.0010133346,0.00088285643,0.0002106626,0.002449571,0.00027427106,0.00004563693],"category_scores_gemma":[0.0002168811,0.00040295866,0.00028960305,0.0029050508,0.0005292519,0.0030449214,0.0000334579,0.0003780017,0.000023170109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038393296,0.0019129156,0.000064591455,0.0028228988,0.0005406579,2.6603976e-7,0.0101656765,0.85875714,0.00010936085,0.035027895,0.001940195,0.08827448],"study_design_scores_gemma":[0.0018564806,0.0003538651,0.0001589938,0.00089051167,0.0002867955,0.0000035015582,0.001184754,0.9507933,0.02403328,0.0014471824,0.018523939,0.0004673429],"about_ca_topic_score_codex":0.00012250198,"about_ca_topic_score_gemma":0.00018654269,"teacher_disagreement_score":0.858604,"about_ca_system_score_codex":0.00021161699,"about_ca_system_score_gemma":0.0012278436,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W4416323737","doi":"10.1109/tcomm.2025.3634201","title":"Combating AI-Based Jamming in LEO Satellite Networks Using Quantum Adversarial Deep Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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":"Mitacs","keywords":"Jamming; Reinforcement learning; Satellite; Communications satellite; Adversarial system; Quality of service; Q-learning","score_opus":0.038270743336895514,"score_gpt":0.2993720070131984,"score_spread":0.2611012636763029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416323737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014473244,0.01083371,0.9775631,0.0011434519,0.002137889,0.0015296786,0.000008746728,0.0004974388,0.0048386524],"genre_scores_gemma":[0.9808795,0.010449387,0.0074911285,0.0003326602,0.000060176644,0.00032396684,0.00007662255,0.00014919277,0.00023738404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932895,0.0019073342,0.0026064606,0.0006702172,0.00050052564,0.0010260139],"domain_scores_gemma":[0.99046594,0.003089748,0.0004844339,0.0053588087,0.00038713426,0.00021392872],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00174193,0.0008091518,0.0009257169,0.0017002408,0.0021216068,0.00040207017,0.0026406841,0.0006626651,0.000118975724],"category_scores_gemma":[0.000084200656,0.0011021689,0.00046541647,0.0034802703,0.00039379785,0.0005880644,0.00005604994,0.004073746,0.00007543129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100036064,0.0003447277,0.00041318624,0.00019149322,0.00028212141,0.0000020134776,0.0017970828,0.9619882,0.0006582444,0.0011782543,0.0000052279374,0.033039425],"study_design_scores_gemma":[0.002175868,0.00009370656,0.00013620614,0.0024325426,0.000251861,0.0000040247664,0.0022029844,0.9811322,0.00130237,0.000066918656,0.009416005,0.00078531675],"about_ca_topic_score_codex":0.0011044735,"about_ca_topic_score_gemma":0.002086298,"teacher_disagreement_score":0.97943217,"about_ca_system_score_codex":0.0020048288,"about_ca_system_score_gemma":0.00042539067,"threshold_uncertainty_score":0.9991775},"labels":[],"label_agreement":null},{"id":"W4416323772","doi":"10.1109/tcomm.2025.3634252","title":"Beamforming Designs for Multiple UAV Interference Systems With LOS Channels","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":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; WSDMA; Telecommunications link; Base station; Interference (communication); Channel (broadcasting); Antenna array","score_opus":0.04698644900073002,"score_gpt":0.2766050349413391,"score_spread":0.22961858594060908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416323772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019463686,0.0010815529,0.99036735,0.0006532851,0.0009160952,0.0030055183,0.00049930305,0.00036514062,0.0029171356],"genre_scores_gemma":[0.93564045,0.0018323144,0.05528618,0.00005652506,0.000038010654,0.0047466015,0.000085398395,0.00008719944,0.0022273145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980281,0.00010796064,0.0007780165,0.00045204422,0.00016180672,0.00047209157],"domain_scores_gemma":[0.9953706,0.0011124553,0.00015933208,0.0027656269,0.00045837025,0.00013359834],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002615398,0.00044767812,0.00042818312,0.00057580805,0.001550593,0.00030601321,0.001256785,0.00027299454,0.000031555075],"category_scores_gemma":[0.000014461165,0.00048052578,0.00017772744,0.0012598188,0.00022624929,0.00038819242,0.0000098708115,0.0006183525,0.000035280857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087038236,0.00055499614,0.000005289366,0.000332023,0.00037870568,1.4473764e-7,0.0006199273,0.9813641,0.0007955897,0.004019269,0.00025603012,0.011586933],"study_design_scores_gemma":[0.0011640359,0.00019399327,0.0000072633247,0.0010046578,0.00041543602,0.0000064546716,0.0007343606,0.98038536,0.0064858436,0.00014957298,0.008983266,0.0004697716],"about_ca_topic_score_codex":0.00015430208,"about_ca_topic_score_gemma":0.00042862733,"teacher_disagreement_score":0.93544585,"about_ca_system_score_codex":0.0004003029,"about_ca_system_score_gemma":0.00020366028,"threshold_uncertainty_score":0.9997646},"labels":[],"label_agreement":null},{"id":"W4416513336","doi":"10.1109/tcomm.2025.3635782","title":"Distributed Near-Field Channel Estimation for U6G XL-MIMO Systems Under Beam Squint","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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 Science Foundation of Jiangsu Province; Government of Jiangsu Province; European Commission; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Wideband; Channel (broadcasting); Overhead (engineering); Computational complexity theory; Parametric statistics; Upper and lower bounds; Path (computing); Beam (structure)","score_opus":0.021321261858657542,"score_gpt":0.27715116148665236,"score_spread":0.25582989962799485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014910987,0.00042261908,0.9943186,0.0009693778,0.001063562,0.001082571,0.0002690647,0.00071737595,0.0010077098],"genre_scores_gemma":[0.98215353,0.0002297224,0.015451626,0.00007299196,0.000017652434,0.0013870023,0.00019730697,0.000045482648,0.00044470138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897915,0.000050454353,0.0004517599,0.0001915011,0.00009416212,0.00023298145],"domain_scores_gemma":[0.9977793,0.000563887,0.00006511836,0.0013456477,0.00018432274,0.00006173356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013846178,0.00020273379,0.0002282129,0.00018678054,0.0006194507,0.000106184074,0.00045643916,0.00016869215,0.000007920075],"category_scores_gemma":[0.00002299136,0.00023626373,0.00010677422,0.0005499975,0.00005928337,0.000250349,0.0000042288784,0.000285577,0.000026247537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011546807,0.00008789784,5.492127e-7,0.00009397641,0.00008821568,5.6236594e-8,0.00010401052,0.99404377,0.0003536214,0.0017604708,0.0009835698,0.0024723166],"study_design_scores_gemma":[0.0004660167,0.0000416764,0.000009632691,0.00018762621,0.00008585275,0.0000024677743,0.0002640869,0.99119794,0.0042448076,0.0005773379,0.0027194982,0.00020307479],"about_ca_topic_score_codex":0.0000631232,"about_ca_topic_score_gemma":0.000110587025,"teacher_disagreement_score":0.9820044,"about_ca_system_score_codex":0.00028595547,"about_ca_system_score_gemma":0.000053156113,"threshold_uncertainty_score":0.96345556},"labels":[],"label_agreement":null},{"id":"W4416650073","doi":"10.1109/tcomm.2025.3637046","title":"Two-Timescales Optimization of Content Placement and Delivery in Satellite-Terrestrial Edge Computing Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Satellite Communication Systems","field":"Engineering","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 Science Foundation of Beijing Municipality; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Markov decision process; Leverage (statistics); Reinforcement learning; Optimization problem; Cache; Enhanced Data Rates for GSM Evolution; Edge device; Integer programming; Edge computing; Quality of service","score_opus":0.05139023337721987,"score_gpt":0.2743349580219171,"score_spread":0.22294472464469722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416650073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018818036,0.009380345,0.96591115,0.00021458045,0.0005125914,0.00068904477,0.000018277917,0.000220095,0.0042359005],"genre_scores_gemma":[0.977459,0.012383223,0.009963349,0.000029542345,0.000009907509,0.000062728825,0.000023689352,0.000019594676,0.000048971076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873257,0.00023370307,0.00063847675,0.00014261976,0.00009494061,0.00015766377],"domain_scores_gemma":[0.9978528,0.00074790383,0.00007642635,0.0012130762,0.0000678123,0.000042006515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029316853,0.00015459153,0.00025149639,0.00034295887,0.00015710288,0.00003614744,0.00046430985,0.000092455615,0.000008638427],"category_scores_gemma":[0.0000069017588,0.00018073569,0.00006120541,0.0005169606,0.00013485462,0.00011066566,0.000014519435,0.00032442636,0.0000029568187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002537868,0.000116699164,0.0002231269,0.000026930322,0.00006243417,1.1851152e-7,0.00037128618,0.97661346,0.0004094833,0.00022115327,0.000011478844,0.021918427],"study_design_scores_gemma":[0.0010997792,0.000020444253,0.0005608606,0.00033365632,0.000035442983,0.0000016077893,0.0006267645,0.9952451,0.0012517477,0.000013369479,0.0006620069,0.00014921893],"about_ca_topic_score_codex":0.00011315537,"about_ca_topic_score_gemma":0.0002857849,"teacher_disagreement_score":0.95864093,"about_ca_system_score_codex":0.0001321969,"about_ca_system_score_gemma":0.000029748875,"threshold_uncertainty_score":0.7370187},"labels":[],"label_agreement":null},{"id":"W4416650074","doi":"10.1109/tcomm.2025.3637109","title":"Enhancing Massive MIMO Symbol Detection in Unknown Noise Environments: A Generative Modeling Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":0,"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":"Noise (video); Detector; Gaussian noise; Prior probability; MIMO; Benchmark (surveying); Probability density function; Detection theory; Symbol (formal)","score_opus":0.04023166016438158,"score_gpt":0.27317580816424497,"score_spread":0.2329441479998634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416650074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044446597,0.000596203,0.98661506,0.0035572918,0.0008753862,0.0016654936,0.000034230106,0.00016747508,0.0020441792],"genre_scores_gemma":[0.9586035,0.0012991038,0.03710678,0.00029951445,0.000037931488,0.0014075,0.000023265928,0.00004931817,0.0011730705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944363,0.0014353346,0.001602122,0.0012983922,0.00058457244,0.00064323284],"domain_scores_gemma":[0.99397206,0.00064244407,0.0004220991,0.004529509,0.00024742936,0.00018647593],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007724187,0.0006188707,0.0005779628,0.0015455147,0.0018788909,0.00040773588,0.0026047837,0.0004749218,0.000029067349],"category_scores_gemma":[0.000039949886,0.00076746836,0.0003035753,0.0030432653,0.0003607593,0.0013494787,0.000058304955,0.0016853621,0.0001139468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004643142,0.0019496742,0.0000055997803,0.000049782033,0.00014430744,8.4603136e-7,0.0030418653,0.86098725,0.07227906,0.005571953,0.0000042106035,0.055919018],"study_design_scores_gemma":[0.00096632633,0.00008006186,0.00011830753,0.00035962078,0.000120570956,0.0000034795041,0.0008534361,0.91493523,0.08079801,0.0010578253,0.00018654545,0.00052057905],"about_ca_topic_score_codex":0.00029429558,"about_ca_topic_score_gemma":0.001170925,"teacher_disagreement_score":0.95415884,"about_ca_system_score_codex":0.0017499556,"about_ca_system_score_gemma":0.0004911607,"threshold_uncertainty_score":0.9994776},"labels":[],"label_agreement":null},{"id":"W7092293057","doi":"10.1109/tcomm.2025.3622931","title":"Channel Modeling for Molecular Communication With Heterogeneous Circular/Spherical Boundary","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":0,"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":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Boundary (topology); Boundary value problem; Molecular communication; Channel (broadcasting); Bounded function; Impulse (physics); Impulse response","score_opus":0.02317440386942953,"score_gpt":0.2614233357826782,"score_spread":0.23824893191324864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092293057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046335062,0.02994074,0.95712155,0.004395223,0.00040513932,0.0021823014,0.00013568855,0.00050445524,0.0048515503],"genre_scores_gemma":[0.9220628,0.017922694,0.05630016,0.0008501941,0.000017266584,0.0020219472,0.00017332763,0.00019151914,0.00046005903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963684,0.0006908559,0.0011595952,0.0006492865,0.00037693453,0.00075492915],"domain_scores_gemma":[0.9893498,0.00068779243,0.0001945071,0.008935473,0.000575292,0.00025716244],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000532142,0.0007414545,0.00071425806,0.0005006606,0.0024623128,0.00036308193,0.00337119,0.00056483055,0.00006514242],"category_scores_gemma":[0.000016311993,0.0008756607,0.0005867338,0.0015348187,0.0005393142,0.00026763525,0.000050353286,0.0016758813,0.0000437528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019056945,0.0009415354,6.085523e-7,0.00020195058,0.0011078889,0.0000021194626,0.00045302435,0.97059524,0.0010127615,0.0018801121,0.00017491753,0.023439279],"study_design_scores_gemma":[0.001842269,0.00018889636,0.0000013985751,0.0008068139,0.00073529896,0.00002362811,0.00024148577,0.973378,0.0048834225,0.0018806146,0.0152367065,0.00078148686],"about_ca_topic_score_codex":0.00010149073,"about_ca_topic_score_gemma":0.00031331522,"teacher_disagreement_score":0.9215995,"about_ca_system_score_codex":0.00054754614,"about_ca_system_score_gemma":0.00041437845,"threshold_uncertainty_score":0.9993694},"labels":[],"label_agreement":null},{"id":"W7092293895","doi":"10.1109/tcomm.2025.3622963","title":"Fluid Antenna Index Modulation for MIMO Systems: Robust Transmission and Low-Complexity Detection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Robustness (evolution); Detector; MIMO; Spectral efficiency; Spatial modulation; Bit error rate; Upper and lower bounds; Transmission (telecommunications); Transmission system","score_opus":0.03706253087122901,"score_gpt":0.2678976060728884,"score_spread":0.23083507520165936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092293895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044938875,0.0014140559,0.99062055,0.0006465877,0.00024447695,0.0008252779,0.00006501184,0.0012945675,0.00039558017],"genre_scores_gemma":[0.9835309,0.0037765945,0.011716296,0.000023174436,0.000006409722,0.00078392477,0.00002190896,0.00003610716,0.00010468466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989981,0.0000775201,0.0004104207,0.00021474551,0.000097854936,0.00020137886],"domain_scores_gemma":[0.9977032,0.00037295272,0.000055973775,0.0016786346,0.00014114055,0.000048118418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000143222,0.00020881087,0.00022420097,0.0004259444,0.00075291615,0.00006184366,0.0006178361,0.00020374513,0.0000042114025],"category_scores_gemma":[0.00001247984,0.00023620602,0.00008160413,0.00055255584,0.00023499849,0.000283713,0.000008070383,0.00041223818,0.000003981603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032811407,0.00012323895,0.0000071232084,0.00019379254,0.00006122065,5.4381076e-8,0.00011452151,0.8175867,0.028958458,0.0020965738,0.00003548666,0.15079],"study_design_scores_gemma":[0.0005000539,0.000030057221,0.00030328348,0.00018153072,0.000027611923,0.000002573587,0.00028519952,0.9791385,0.015263846,0.002021371,0.0020421403,0.00020380916],"about_ca_topic_score_codex":0.000039965907,"about_ca_topic_score_gemma":0.0001611264,"teacher_disagreement_score":0.979037,"about_ca_system_score_codex":0.00017756716,"about_ca_system_score_gemma":0.000022493825,"threshold_uncertainty_score":0.9632202},"labels":[],"label_agreement":null},{"id":"W7116676737","doi":"10.1109/tcomm.2025.3646885","title":"Non-Orthogonal Multiple-Access for Coherent-State Optical Quantum Communications Under Lossy Photon Channels","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":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":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Telecommunications link; Lossy compression; Photon; Interference (communication); Coherent states; Power (physics); Optical communication; Topology (electrical circuits); Key (lock)","score_opus":0.06032627751340057,"score_gpt":0.334258999771827,"score_spread":0.2739327222584264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116676737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007290177,0.003985521,0.95038766,0.023567116,0.0018518488,0.0043552658,0.0012414176,0.0016829486,0.005638024],"genre_scores_gemma":[0.9361622,0.028023563,0.027653662,0.00045520221,0.000028054716,0.005980351,0.00025452254,0.00022110024,0.0012213556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449795,0.00040432796,0.0022821266,0.0009782253,0.0005187648,0.0013185991],"domain_scores_gemma":[0.9752221,0.006771421,0.00038857706,0.016288955,0.0009566977,0.00037223104],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity"],"consensus_categories":["sts"],"category_scores_codex":[0.00076249975,0.0011282394,0.0012190982,0.0013694966,0.0033849946,0.00085882156,0.013069581,0.0009540302,0.00013041025],"category_scores_gemma":[0.00016608981,0.001368908,0.00088005926,0.0023875653,0.0028878297,0.000930645,0.00042981282,0.0034495462,0.00024371345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009154558,0.015762923,0.00020214159,0.001668346,0.0058845845,0.0000031206494,0.0018286717,0.38536772,0.013448524,0.35645124,0.0037222481,0.21474501],"study_design_scores_gemma":[0.0029723065,0.00026226795,0.0004035068,0.0010728535,0.0005472688,0.0000071461905,0.0008102009,0.9205099,0.034600504,0.019956335,0.017481836,0.0013759071],"about_ca_topic_score_codex":0.00018633938,"about_ca_topic_score_gemma":0.0011429559,"teacher_disagreement_score":0.928872,"about_ca_system_score_codex":0.0009580793,"about_ca_system_score_gemma":0.00055014464,"threshold_uncertainty_score":0.9998257},"labels":[],"label_agreement":null},{"id":"W7116909563","doi":"10.1109/tcomm.2025.3647766","title":"Cooperation-Based Federated Learning and Communication Optimization Under Intermittent Device Participation in Industrial IoT","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China; National Research Foundation","keywords":"Coordinate descent; Relay; Transmission (telecommunications); Convergence (economics); Optimization problem; Convex optimization; Block (permutation group theory); Relaxation (psychology); Selection (genetic algorithm); Rate of convergence","score_opus":0.08651429102178537,"score_gpt":0.3489656001974394,"score_spread":0.262451309175654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116909563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046923277,0.002544355,0.9664183,0.022065068,0.0004759308,0.0013325725,0.000012982703,0.00023751304,0.0022209117],"genre_scores_gemma":[0.97432727,0.010786113,0.011897801,0.0013726667,0.000016900403,0.0005804497,0.00009131816,0.00003858806,0.0008889067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929969,0.00394385,0.0014803247,0.00075552595,0.00032470102,0.0004987006],"domain_scores_gemma":[0.99360573,0.0021549163,0.00042500172,0.0027868883,0.00084760453,0.00017986418],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013806322,0.00052375544,0.0005395428,0.0010999071,0.0034765482,0.0010904387,0.0019335416,0.00044589298,0.00014396785],"category_scores_gemma":[0.00016717149,0.00063467567,0.00013583896,0.003613048,0.00054810103,0.00067950744,0.00012082863,0.0022820877,0.00002959282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008522651,0.0012741144,0.00026728556,0.000023841149,0.00009680176,4.6822822e-7,0.0009790616,0.79195786,0.00022830175,0.0063822707,0.00008498625,0.19861981],"study_design_scores_gemma":[0.0025648132,0.00016751785,0.00065015926,0.001101041,0.00011390662,0.0000017748205,0.00035324277,0.99078476,0.0010974802,0.0000985531,0.0025632016,0.0005035628],"about_ca_topic_score_codex":0.00015565063,"about_ca_topic_score_gemma":0.003553002,"teacher_disagreement_score":0.96963495,"about_ca_system_score_codex":0.00068896165,"about_ca_system_score_gemma":0.0008671777,"threshold_uncertainty_score":0.99994653},"labels":[],"label_agreement":null},{"id":"W7116967589","doi":"10.1109/tcomm.2025.3647758","title":"Synchronization, Identification, and Signal Detection for Underwater Photon-Counting Communications With Input-Dependent Shot Noise","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Optical Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":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":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Detection theory; Interference (communication); Transmission (telecommunications); Noise (video); Asynchronous communication; SIGNAL (programming language); Underwater; Multiuser detection; Shot noise; Signal-to-noise ratio (imaging)","score_opus":0.020520720528624338,"score_gpt":0.25534337010261415,"score_spread":0.23482264957398982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116967589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040546767,0.0010705951,0.98799413,0.002884188,0.0001157926,0.0010359426,0.00008197683,0.0011613755,0.0016013171],"genre_scores_gemma":[0.9786823,0.0040019434,0.0150823705,0.00010244849,0.0000075570456,0.0017040386,0.000050988925,0.000060648847,0.0003077437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847716,0.00010817855,0.0006362793,0.00030886938,0.00017870759,0.00029082186],"domain_scores_gemma":[0.99530286,0.0008592236,0.000109763474,0.0032408559,0.00041858637,0.000068722424],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00032234762,0.0002835093,0.0002578925,0.0005140525,0.0013633162,0.00018990603,0.0016199384,0.00020979204,0.000015889605],"category_scores_gemma":[0.000022700195,0.00029759514,0.00007295137,0.0008660612,0.0006006496,0.00039871995,0.000041084317,0.0006703321,0.000020064872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025492453,0.0021022847,0.00048991176,0.000891211,0.0018505553,8.5530723e-7,0.002484544,0.12829979,0.15191187,0.040581234,0.00065586745,0.670477],"study_design_scores_gemma":[0.0013663706,0.00012301152,0.00050406833,0.00028361677,0.0002807932,0.000013026678,0.0011370336,0.7719079,0.21282984,0.0045808805,0.0062858923,0.00068754156],"about_ca_topic_score_codex":0.00003387013,"about_ca_topic_score_gemma":0.00078318495,"teacher_disagreement_score":0.97462755,"about_ca_system_score_codex":0.000281369,"about_ca_system_score_gemma":0.00007409549,"threshold_uncertainty_score":0.9999476},"labels":[],"label_agreement":null}]}