{"meta":{"query_hash":"541fb6ba9b96","filters":{"venue":"Journal of Communications and Networks"},"cohort_total":41,"direct_labels_cover":0,"predictions_cover":41,"exported":41,"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/541fb6ba9b96","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Communications+and+Networks"},"results":[{"id":"W1964624053","doi":"10.1109/jcn.2009.6388407","title":"Build-in wiretap channel I with feedback and LDPC codes","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Security 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 Waterloo","funders":"","keywords":"Low-density parity-check code; Computer science; Channel (broadcasting); Computer network; Randomness; Binary erasure channel; Information-theoretic security; Decoding methods; Theoretical computer science; Binary symmetric channel; Transmission (telecommunications); Parity bit; Computer security; Telecommunications; Algorithm; Channel capacity; Cryptography; Mathematics; Statistics","score_opus":0.00975721931005988,"score_gpt":0.23394871656403124,"score_spread":0.22419149725397136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964624053","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.73900926,0.16560678,0.07414946,0.010338347,0.00007603427,0.0004666271,0.000004853621,0.00028911402,0.010059551],"genre_scores_gemma":[0.93271446,0.055940676,0.011219289,0.00008508521,0.000021083608,0.0000030250603,0.0000017866258,0.00000990927,0.0000046911573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.000060680733,0.00029656597,0.00004437121,0.00007212774,0.00010729674],"domain_scores_gemma":[0.9990887,0.00012897649,0.00010319496,0.0005418112,0.0000759578,0.00006134739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030603074,0.000092771654,0.00020507441,0.00011925784,0.00007538603,0.000049435203,0.0004072847,0.00006744584,0.0000016833519],"category_scores_gemma":[0.000005766686,0.00008004037,0.00002078468,0.00017697146,0.000092111455,0.00020045231,0.00006230388,0.00044605444,1.4843198e-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.00034980034,0.0011122744,0.022319289,0.00015374307,0.00050763664,0.000037336835,0.012739568,0.07991058,0.0024131676,0.05611371,0.008669326,0.8156736],"study_design_scores_gemma":[0.0020140198,0.000793964,0.108739935,0.0014525909,0.00009011515,0.0006121612,0.0008036318,0.8520623,0.0003455041,0.008792167,0.0236187,0.0006749263],"about_ca_topic_score_codex":0.0000053672916,"about_ca_topic_score_gemma":0.00006750265,"teacher_disagreement_score":0.8149986,"about_ca_system_score_codex":0.000022098016,"about_ca_system_score_gemma":0.000009284204,"threshold_uncertainty_score":0.32639518},"labels":[],"label_agreement":null},{"id":"W1972245690","doi":"10.1109/jcn.2000.6596716","title":"On higher layer protocol performance in CDMA S-ALOHA networks with packet combining in Rayleigh fading channels","year":2000,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Physical layer; Aloha; Media access control; Retransmission; Rayleigh fading; Data link layer; Protocol stack; Network packet; Fading; Network layer; Throughput; Link layer; Channel (broadcasting); Wireless; Layer (electronics); Wireless sensor network; Telecommunications","score_opus":0.03814669962710386,"score_gpt":0.308141098815762,"score_spread":0.26999439918865814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972245690","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.7101618,0.008728013,0.15920296,0.024286835,0.0006887215,0.046986964,0.0000022882678,0.00029786458,0.049644545],"genre_scores_gemma":[0.9889302,0.002845833,0.0057972637,0.00023923696,0.00007448889,0.0019607386,0.0000018275387,0.000020813713,0.0001295797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976332,0.0006282159,0.0007554642,0.00020226046,0.00034071188,0.0004401084],"domain_scores_gemma":[0.99691015,0.0008046046,0.00033026026,0.0016554742,0.0001585451,0.00014098069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016284981,0.00019956537,0.00037897285,0.00035181083,0.0002791739,0.00025406282,0.0026502977,0.00013922076,0.000043812637],"category_scores_gemma":[0.00001062479,0.00016103868,0.000049578444,0.0012789508,0.00016496594,0.0007857394,0.00045027514,0.0016233524,0.0000031901848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003079899,0.00045444872,0.01491402,0.000014409536,0.000032142067,0.000017988652,0.0006721008,0.81560564,0.0000031699892,0.0077778613,0.0004300373,0.15977019],"study_design_scores_gemma":[0.0021043736,0.0004868357,0.025023783,0.00094202,0.0000034455477,0.000051405466,0.000023851897,0.96129215,0.0000046457503,0.00037213258,0.009482183,0.000213175],"about_ca_topic_score_codex":0.000014536901,"about_ca_topic_score_gemma":0.00005604094,"teacher_disagreement_score":0.27876842,"about_ca_system_score_codex":0.00010744589,"about_ca_system_score_gemma":0.000079674894,"threshold_uncertainty_score":0.7052749},"labels":[],"label_agreement":null},{"id":"W2010444331","doi":"10.1109/jcn.2014.000094","title":"Power allocation framework for OFDMA-based decode-and-forward cellular relay networks","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Relay; Telecommunications link; Orthogonal frequency-division multiple access; Cellular network; Computer network; Power (physics); Resource allocation; Base station; Knapsack problem; Scheme (mathematics); Mathematical optimization; Orthogonal frequency-division multiplexing; Algorithm; Mathematics","score_opus":0.0236229432684266,"score_gpt":0.2850686972271793,"score_spread":0.2614457539587527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010444331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019627477,0.017151464,0.97089446,0.009299691,0.00024039774,0.00018738944,6.458682e-7,0.000032823318,0.00023040574],"genre_scores_gemma":[0.7812031,0.013743108,0.20380875,0.0010553784,0.00011752102,0.000025009555,0.0000042468605,0.000014316172,0.000028552222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984033,0.0004172523,0.0006183477,0.00017878434,0.00015087925,0.0002314272],"domain_scores_gemma":[0.9954251,0.0018998815,0.0005654084,0.0014224049,0.00051388587,0.0001733173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017323387,0.00017061229,0.00031736545,0.00014018475,0.0006158922,0.00025127517,0.0015901354,0.00016361516,0.000009017434],"category_scores_gemma":[0.00016855297,0.00015148812,0.000120224126,0.0003664216,0.00014927855,0.0003529948,0.0003681746,0.00060008554,6.041387e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005352055,0.00020662567,0.0013677076,0.000016546646,0.000116415096,5.216888e-7,0.00065771915,0.03738908,0.00011120854,0.63864124,0.0019549443,0.31948447],"study_design_scores_gemma":[0.00049425114,0.0002108452,0.00082253834,0.00019550891,0.000030175572,0.000009071632,0.000026267942,0.93839794,0.00002772671,0.0037859061,0.05582705,0.00017273496],"about_ca_topic_score_codex":0.0000010595552,"about_ca_topic_score_gemma":0.0000093072385,"teacher_disagreement_score":0.90100884,"about_ca_system_score_codex":0.00003217228,"about_ca_system_score_gemma":0.000055878463,"threshold_uncertainty_score":0.6177506},"labels":[],"label_agreement":null},{"id":"W2013592174","doi":"10.1109/jcn.2008.6388356","title":"Delay-margin based traffic engineering for MPLS-DiffServ networks","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Optical Network 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":"McGill University","funders":"","keywords":"Multiprotocol Label Switching; Computer science; Quality of service; Computer network; Traffic engineering; Heuristic; Margin (machine learning); Distributed computing","score_opus":0.01899451083958551,"score_gpt":0.22890553494535132,"score_spread":0.20991102410576581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013592174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044135164,0.024763323,0.9300733,0.00037703116,0.00021030316,0.00016273171,0.000002058356,0.00020268983,0.00007338106],"genre_scores_gemma":[0.8114139,0.014607914,0.1737317,0.000043422908,0.00013867122,0.000019006093,0.0000058250102,0.000033497236,0.0000060974016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910253,0.0000184009,0.00045416,0.00007421959,0.00008356688,0.0002671119],"domain_scores_gemma":[0.99847317,0.00068838353,0.000109434426,0.00052185805,0.00011202962,0.00009510051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020810825,0.00015829281,0.0002880454,0.00011736345,0.00018351969,0.000022344238,0.00052089925,0.00016551407,0.0000030333738],"category_scores_gemma":[0.000043086082,0.00014786958,0.0001114467,0.00026296478,0.00011864255,0.00015535446,0.000070526155,0.0005911183,3.243495e-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.0000138070445,0.000023934204,0.000074154756,0.000009733287,0.000039622017,0.0000034004008,0.000016694547,0.97762454,0.000014628488,0.0005696326,0.00095312623,0.02065671],"study_design_scores_gemma":[0.0004499084,0.00009196541,0.00033571018,0.00008499272,0.00002983317,0.000092640126,0.000018120227,0.9791729,0.000005104424,0.00008266124,0.019484911,0.00015125086],"about_ca_topic_score_codex":2.3456658e-7,"about_ca_topic_score_gemma":0.0000033191375,"teacher_disagreement_score":0.7672787,"about_ca_system_score_codex":0.000045798326,"about_ca_system_score_gemma":0.000013553435,"threshold_uncertainty_score":0.6029946},"labels":[],"label_agreement":null},{"id":"W2015629629","doi":"10.1109/jcn.2001.6596800","title":"Capacity improvement in cellular systems with reuse partitioning","year":2001,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Blocking (statistics); Computer science; Markov chain; Channel (broadcasting); Reuse; Channel capacity; Call blocking; Markov process; Product (mathematics); Algorithm; Mathematics; Telecommunications; Computer network; Statistics; Quality of service","score_opus":0.03840167273524295,"score_gpt":0.2655561828666617,"score_spread":0.22715451013141877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015629629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19870432,0.015372337,0.77589154,0.008274794,0.00011526269,0.0002798598,4.3557176e-7,0.000030082061,0.0013313873],"genre_scores_gemma":[0.9661724,0.012803474,0.020863585,0.00005677161,0.00004779304,0.000017466333,0.0000012480298,0.0000069330245,0.000030355985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986108,0.0003374336,0.000493478,0.00010126095,0.00024528184,0.00021172663],"domain_scores_gemma":[0.99674284,0.0003349671,0.00034481543,0.0021786005,0.00028794046,0.000110821245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305835,0.0000898758,0.00019903669,0.00016953339,0.00022693023,0.00023909246,0.0025927823,0.000056064968,0.0000022512472],"category_scores_gemma":[0.000026329752,0.000072489376,0.0000313215,0.00060749985,0.0001259813,0.000536727,0.00078748696,0.0006152373,7.8625914e-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.00023427041,0.001921376,0.11238826,0.000074543284,0.00036702474,0.00014581285,0.0050502876,0.43865198,0.0014506717,0.18011147,0.0033348158,0.25626948],"study_design_scores_gemma":[0.00065813184,0.00026255022,0.004371165,0.00028480287,0.000007696167,0.00014861574,0.00013988232,0.9807335,0.00001985378,0.0006922082,0.012550853,0.00013072455],"about_ca_topic_score_codex":0.00007099193,"about_ca_topic_score_gemma":0.00011179232,"teacher_disagreement_score":0.76746804,"about_ca_system_score_codex":0.000074112744,"about_ca_system_score_gemma":0.000060090762,"threshold_uncertainty_score":0.48180774},"labels":[],"label_agreement":null},{"id":"W2027478935","doi":"10.1109/jcn.2005.6387857","title":"Towards the next generation mobile communications","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":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":"Interoperation; Computer science; Software deployment; Mobile telephony; Telecommunications; Communications system; Mobile computing; Computer network; Distributed computing; Mobile radio; Interoperability; World Wide Web","score_opus":0.1411461511776464,"score_gpt":0.3474151161976295,"score_spread":0.2062689650199831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027478935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058190776,0.14358193,0.7267783,0.11761015,0.00023590245,0.0005295504,0.0000017130277,0.00007539029,0.0053679375],"genre_scores_gemma":[0.8085011,0.082330704,0.10818908,0.0005883379,0.00026032425,0.000044373435,0.0000053507906,0.000010071391,0.00007064141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978533,0.0008117963,0.00067628635,0.000115897215,0.00031949897,0.00022326366],"domain_scores_gemma":[0.99277234,0.0008066516,0.00047367698,0.005235625,0.00058176025,0.00012995055],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0019093036,0.00012675441,0.00020725356,0.00013658206,0.0009902307,0.00053198717,0.008270875,0.00008925426,0.000011414132],"category_scores_gemma":[0.000049537903,0.00009059355,0.00010553865,0.000629719,0.00042274562,0.0010992088,0.002663746,0.0009415961,0.00000716967],"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.000004675277,0.00019022769,0.00009543217,0.000001932387,0.000057463254,3.774495e-7,0.00095461233,0.008525954,0.00020110974,0.08557291,0.0067866277,0.8976087],"study_design_scores_gemma":[0.00018589546,0.00006488292,0.0003008408,0.000021837232,0.000011399427,0.00007102909,0.000089910536,0.7324108,0.000019202376,0.00041124652,0.26633263,0.000080342536],"about_ca_topic_score_codex":0.000013538301,"about_ca_topic_score_gemma":0.000107780215,"teacher_disagreement_score":0.89752835,"about_ca_system_score_codex":0.00007506307,"about_ca_system_score_gemma":0.00014981309,"threshold_uncertainty_score":0.99709487},"labels":[],"label_agreement":null},{"id":"W2031332034","doi":"10.1109/jcn.2008.6389840","title":"Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Dijkstra's algorithm; Algorithm; Shortest path problem; Constrained Shortest Path First; Heuristic; Routing (electronic design automation); Link-state routing protocol; Private Network-to-Network Interface; Scalability; Mathematical optimization; Destination-Sequenced Distance Vector routing; K shortest path routing; Routing protocol; Computer network; Mathematics; Theoretical computer science; Graph","score_opus":0.05751421122980483,"score_gpt":0.28816879013880614,"score_spread":0.23065457890900132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031332034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025812637,0.029861895,0.94077784,0.0027131988,0.00020629549,0.00013050638,0.0000011049801,0.000032598753,0.00046390534],"genre_scores_gemma":[0.86447763,0.12535135,0.00937402,0.00063928764,0.000098040946,0.000010089138,0.000004858028,0.00001220101,0.00003254608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978377,0.0006960342,0.0007891063,0.00020904472,0.0001737019,0.00029438938],"domain_scores_gemma":[0.99708086,0.0009444762,0.00044857958,0.0009817049,0.00037695593,0.00016740704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089081505,0.00020492513,0.0004437178,0.00017832921,0.00062739634,0.00016711427,0.0014910293,0.000099828925,0.0000032526805],"category_scores_gemma":[0.00004525313,0.00018315938,0.00006338172,0.0006290984,0.00028860132,0.0005088869,0.0010344055,0.00062541454,3.0838933e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012137519,0.0010367876,0.017718071,0.000018165832,0.00038738083,0.00019412766,0.010715376,0.028589323,0.00031579347,0.26650608,0.0045230514,0.6698745],"study_design_scores_gemma":[0.000735197,0.0001337972,0.0047423295,0.00015868412,0.000013284553,0.00047363478,0.00011388424,0.9876091,0.000004395396,0.00021808043,0.005579403,0.0002182153],"about_ca_topic_score_codex":0.00002445713,"about_ca_topic_score_gemma":0.00010849077,"teacher_disagreement_score":0.9590198,"about_ca_system_score_codex":0.000052594238,"about_ca_system_score_gemma":0.000085382046,"threshold_uncertainty_score":0.7469023},"labels":[],"label_agreement":null},{"id":"W2032301438","doi":"10.1109/jcn.2014.000008","title":"Robust relay design for two-way multi-antenna relay systems with imperfect CSI","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; Computer science; Robustness (evolution); Relay channel; Mathematical optimization; Channel state information; Semidefinite programming; Upper and lower bounds; Optimization problem; Beamforming; Convex optimization; Transmitter power output; Control theory (sociology); Channel (broadcasting); Algorithm; Wireless; Telecommunications; Power (physics); Regular polygon; Mathematics; Transmitter","score_opus":0.08228219557442572,"score_gpt":0.2903345700520073,"score_spread":0.20805237447758157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032301438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008246277,0.013045947,0.98379755,0.0015442371,0.0002299432,0.00032100023,5.9812027e-7,0.000036543264,0.00019957949],"genre_scores_gemma":[0.72198415,0.008886623,0.2687085,0.00016461937,0.0001064389,0.000031903437,0.0000021784745,0.000015951737,0.00009960785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979655,0.0008698471,0.00059200893,0.00017097454,0.0001576596,0.00024399659],"domain_scores_gemma":[0.9952081,0.0016727723,0.00059178105,0.0016795612,0.000694004,0.0001537682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026133955,0.00017727951,0.00036077658,0.00013939764,0.0007032723,0.0003262126,0.002018256,0.000077269775,0.0000015983723],"category_scores_gemma":[0.00009963157,0.00013016094,0.000093454066,0.0003913486,0.0001371047,0.00048030488,0.0004169276,0.0005212304,0.0000011634058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025267803,0.0006331365,0.0017165211,0.000046207697,0.00048165108,0.000005207854,0.0022984145,0.6538215,0.00093567814,0.14827947,0.0066433703,0.18488613],"study_design_scores_gemma":[0.0013071925,0.00047759278,0.00035713927,0.0002631205,0.0000389456,0.00012838098,0.000052684965,0.9842055,0.00001031066,0.000044291693,0.01293853,0.00017634698],"about_ca_topic_score_codex":0.000004289531,"about_ca_topic_score_gemma":0.00003222208,"teacher_disagreement_score":0.7211596,"about_ca_system_score_codex":0.00004703275,"about_ca_system_score_gemma":0.00006907239,"threshold_uncertainty_score":0.54090726},"labels":[],"label_agreement":null},{"id":"W2036170814","doi":"10.1109/jcn.2003.6596557","title":"Approaching near-capacity on a multi-antenna channel using successive decoding and interference cancellation receivers","year":2003,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"Communications Research Centre Canada","funders":"","keywords":"MIMO; Computer science; Transmitter; Decoding methods; Rayleigh fading; Minimum mean square error; Channel (broadcasting); Antenna (radio); Single antenna interference cancellation; 3G MIMO; Multi-user MIMO; Channel capacity; Interference (communication); Fading; Precoding; Telecommunications; Algorithm; Electronic engineering; Mathematics; Statistics; Engineering","score_opus":0.06800085096254285,"score_gpt":0.28908918730911193,"score_spread":0.22108833634656908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036170814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11698126,0.0053511676,0.8769408,0.000061936815,0.00007527727,0.00009793427,0.0000012351469,0.000040250467,0.00045017272],"genre_scores_gemma":[0.88077533,0.013557184,0.10561252,0.000021254704,0.000011749323,0.000003435117,0.0000010304351,0.000014198892,0.0000032831356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993031,0.00014253167,0.00031243562,0.00006594951,0.000060038452,0.00011593763],"domain_scores_gemma":[0.99892193,0.00027102124,0.00022962489,0.00040890914,0.00010368322,0.00006481653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035625286,0.00010847341,0.00017845459,0.00009513282,0.00029306198,0.000066249784,0.00027812875,0.00006835265,0.0000015115804],"category_scores_gemma":[0.00005825117,0.00010556121,0.000030201607,0.00014172138,0.00012113179,0.000282222,0.000068181456,0.0005348043,9.282553e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007639129,0.00023146573,0.0054236874,0.000110043235,0.00027758325,0.0000033770186,0.0072749006,0.8131642,0.0074352594,0.01137405,0.00010243993,0.15452665],"study_design_scores_gemma":[0.00022182481,0.000034575693,0.00026603616,0.00029840693,0.000016401684,0.000025831814,0.00026905,0.9978127,0.00021598766,0.0003656893,0.0003619665,0.000111517395],"about_ca_topic_score_codex":0.000010846239,"about_ca_topic_score_gemma":0.000026199867,"teacher_disagreement_score":0.7713283,"about_ca_system_score_codex":0.00008801953,"about_ca_system_score_gemma":0.000013787063,"threshold_uncertainty_score":0.43046612},"labels":[],"label_agreement":null},{"id":"W2036786089","doi":"10.1109/jcn.2009.6391334","title":"End-to-end quality of service constrained routing and admission control for MPLS networks","year":2009,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"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":"Multiprotocol Label Switching; Computer science; Computer network; End-to-end principle; Quality of service; End-to-end delay; Packet loss; Admission control; Network packet","score_opus":0.029095801548599316,"score_gpt":0.3049047324052127,"score_spread":0.2758089308566134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036786089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008023646,0.0053400653,0.96920955,0.01686154,0.000109634195,0.00025573268,0.000003223597,0.000019714513,0.0001768721],"genre_scores_gemma":[0.9675365,0.0009330919,0.029082997,0.002277247,0.00014665718,0.0000050209414,0.0000020595837,0.0000050235685,0.000011399886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846375,0.0002590775,0.00077569636,0.0001389804,0.00014964578,0.00021286799],"domain_scores_gemma":[0.99662584,0.0014457683,0.00066293636,0.0005875417,0.0004522184,0.0002256877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017244522,0.00013022988,0.00041587642,0.00007824919,0.0002640321,0.00010178297,0.00079136237,0.000097563556,0.0000031458057],"category_scores_gemma":[0.000080985534,0.00011080381,0.000088958695,0.0002769787,0.000072645154,0.00024237367,0.000115742776,0.0002922544,1.0590688e-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.00016719029,0.0001049976,0.0005179335,0.000008085102,0.00007060201,7.662386e-7,0.00030110977,0.019813314,0.00015785766,0.079793006,0.0003268316,0.8987383],"study_design_scores_gemma":[0.0018977103,0.0003755786,0.0069340873,0.00016525168,0.00004932102,0.00004060617,0.000076993034,0.98666704,0.000003475315,0.0014861972,0.002168831,0.00013491137],"about_ca_topic_score_codex":0.0000071996838,"about_ca_topic_score_gemma":0.000023130538,"teacher_disagreement_score":0.96685374,"about_ca_system_score_codex":0.000014590561,"about_ca_system_score_gemma":0.000072351366,"threshold_uncertainty_score":0.45184484},"labels":[],"label_agreement":null},{"id":"W2038489696","doi":"10.1109/jcn.2014.000091","title":"Composite differential evolution aided channel allocation in OFDMA systems with proportional rate constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Telecommunications link; Differential evolution; Orthogonal frequency-division multiple access; Code (set theory); Mathematical optimization; Orthogonal frequency-division multiplexing; Channel (broadcasting); Algorithm; Set (abstract data type); Telecommunications; Mathematics","score_opus":0.0072301761256411134,"score_gpt":0.2043708895328796,"score_spread":0.1971407134072385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038489696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08270854,0.002238254,0.9144178,0.00015491998,0.00015560501,0.00014941394,0.0000014886264,0.000026320315,0.00014763794],"genre_scores_gemma":[0.99411297,0.002824075,0.002866595,0.000009002051,0.00012347619,0.000016866496,0.000024228282,0.000016599166,0.0000062107115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991573,0.00012989566,0.0004271826,0.00006111727,0.000101207435,0.00012326031],"domain_scores_gemma":[0.9991954,0.00011465332,0.00024423312,0.00022061805,0.00017013824,0.000054984972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002839432,0.0001022348,0.00019945388,0.00012169579,0.00008987663,0.000038695176,0.00016859264,0.0000672341,0.0000027158878],"category_scores_gemma":[0.0000071188865,0.00008867953,0.000021810794,0.00018932571,0.0001132858,0.00022878646,0.000028045639,0.00024897765,2.310207e-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.00002912005,0.00003542848,0.0014976886,0.000015719115,0.000032358963,4.1003878e-7,0.000050016344,0.99192286,0.00023563729,0.0020656479,0.0000390962,0.0040760464],"study_design_scores_gemma":[0.0006398311,0.000053620308,0.011432197,0.00031768478,0.000024542753,0.000036619516,0.00004426531,0.98705626,0.000010423525,0.00018602925,0.00010122491,0.000097308766],"about_ca_topic_score_codex":0.000003524042,"about_ca_topic_score_gemma":0.00002674149,"teacher_disagreement_score":0.91155124,"about_ca_system_score_codex":0.00007118113,"about_ca_system_score_gemma":0.000017054046,"threshold_uncertainty_score":0.36162463},"labels":[],"label_agreement":null},{"id":"W2040608916","doi":"10.1109/jcn.2004.6596576","title":"Turbo decoding for precoded systems over multipath fading channels","year":2004,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"McGill University; Advantech AMT (Canada)","funders":"","keywords":"Computer science; Rician fading; Precoding; Fading; Turbo equalizer; Turbo code; Rayleigh fading; Channel state information; Algorithm; Decoding methods; Multipath propagation; Turbo; Serial concatenated convolutional codes; Channel (broadcasting); Electronic engineering; MIMO; Telecommunications; Concatenated error correction code; Block code; Wireless; Engineering","score_opus":0.024980513044098197,"score_gpt":0.2825244252757525,"score_spread":0.2575439122316543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040608916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020377995,0.02379162,0.9548312,0.00015381178,0.0002377478,0.00026387698,0.0000035251694,0.0001107478,0.00022951957],"genre_scores_gemma":[0.8955019,0.021337843,0.08296878,0.000018158922,0.00009370675,0.00004021899,0.0000045763245,0.000026467816,0.0000083216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992524,0.000036592533,0.0004501482,0.00005131615,0.00006718568,0.00014235778],"domain_scores_gemma":[0.9985834,0.00039847768,0.00021448215,0.0006004735,0.00013646421,0.00006670581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035445916,0.000105892825,0.00022179184,0.00011486441,0.00017943534,0.00006405179,0.0005466954,0.000083066356,9.87839e-7],"category_scores_gemma":[0.00003458486,0.000101705744,0.00006750175,0.00012009512,0.000046829224,0.00028777833,0.000094564704,0.00031571212,1.9576463e-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.000010467763,0.000034791377,0.000085484695,0.000034702145,0.000064533764,3.6323132e-7,0.0004629825,0.9642511,0.0006103808,0.0042539425,0.00018156109,0.030009711],"study_design_scores_gemma":[0.0007164112,0.00006839964,0.00007980183,0.00046749102,0.000028843499,0.000033804517,0.00013521263,0.98709124,0.00057477277,0.0021021117,0.008535608,0.00016630019],"about_ca_topic_score_codex":0.000004012886,"about_ca_topic_score_gemma":0.0000061537,"teacher_disagreement_score":0.8751239,"about_ca_system_score_codex":0.00010398679,"about_ca_system_score_gemma":0.000013040966,"threshold_uncertainty_score":0.414744},"labels":[],"label_agreement":null},{"id":"W2049091044","doi":"10.1109/jcn.2007.6182815","title":"Dual diversity over correlated Ricean fading channels","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Wireless Communication 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":"Medical Research Council; University of Ottawa","keywords":"Fading; Computer science; Probability density function; Algorithm; Signal-to-noise ratio (imaging); Bit error rate; Maximal-ratio combining; Convergence (economics); Diversity combining; Statistics; Diversity scheme; Mathematics; Telecommunications; Decoding methods","score_opus":0.01756772059990494,"score_gpt":0.2598982957517262,"score_spread":0.24233057515182124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049091044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19838212,0.015867347,0.78120315,0.00019934561,0.00030155535,0.00011988345,0.0000017605296,0.00019966463,0.0037251643],"genre_scores_gemma":[0.97326905,0.016360147,0.010235047,0.000038998292,0.00005892801,6.9174683e-7,0.0000031123423,0.000013746086,0.000020291558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993467,0.00003879622,0.0003452548,0.000038847676,0.00009476788,0.00013567085],"domain_scores_gemma":[0.99880755,0.00029651663,0.00016953629,0.0005346021,0.000110271576,0.000081514365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564222,0.00008588364,0.00015527668,0.00013631045,0.0002929491,0.000022773316,0.00049564795,0.00008708413,0.000008309138],"category_scores_gemma":[0.000013173392,0.00008583453,0.00004855631,0.00021995923,0.000083995816,0.00025189665,0.00044329258,0.00055283005,6.106481e-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.00018464038,0.00049228943,0.034475777,0.00007069251,0.00089003314,0.00005048513,0.00907981,0.34649864,0.0033287387,0.020948868,0.013312747,0.57066727],"study_design_scores_gemma":[0.001623378,0.00024810905,0.03808204,0.0005101059,0.00016369492,0.00034722802,0.00085416884,0.88839316,0.0009311301,0.004697284,0.06340426,0.00074545183],"about_ca_topic_score_codex":0.0000046217306,"about_ca_topic_score_gemma":0.000010854504,"teacher_disagreement_score":0.7748869,"about_ca_system_score_codex":0.00006528433,"about_ca_system_score_gemma":0.00000493192,"threshold_uncertainty_score":0.35002306},"labels":[],"label_agreement":null},{"id":"W2055168151","doi":"10.1109/jcn.2003.6596561","title":"Performance of multicarrier-CDMA uplink with antenna arrays and multiuser detection","year":2003,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"University of Alberta","funders":"","keywords":"Telecommunications link; Computer science; Multipath propagation; Rayleigh fading; Fading; Asynchronous communication; Multiuser detection; Code division multiple access; Antenna (radio); Channel (broadcasting); Electronic engineering; Antenna array; Algorithm; Telecommunications; Engineering","score_opus":0.018943008505360848,"score_gpt":0.2568081394470939,"score_spread":0.23786513094173306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055168151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34012994,0.0070808996,0.6514002,0.0007153128,0.000057989582,0.00015696298,3.1075933e-7,0.00001619425,0.0004421923],"genre_scores_gemma":[0.9009159,0.017364914,0.08164379,0.000029227924,0.00001594072,0.0000054395064,3.6618087e-7,0.000008277327,0.000016146185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880683,0.00029149724,0.0004317747,0.00010639389,0.00019364194,0.00016986848],"domain_scores_gemma":[0.99724776,0.0004818672,0.00040303663,0.0012616926,0.00048306157,0.00012256057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095268205,0.0001045965,0.00022642018,0.00014782949,0.0002930966,0.00008151432,0.0010565703,0.00007169379,0.0000019581141],"category_scores_gemma":[0.00004659143,0.00008062189,0.0000359465,0.00043753078,0.00030587544,0.00049774075,0.0003049765,0.00053157465,2.721797e-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.00037647094,0.00085824286,0.08661939,0.00011903701,0.00048320479,0.000007698507,0.0037738886,0.023695204,0.0066399365,0.02660896,0.00012776685,0.8506902],"study_design_scores_gemma":[0.00065461465,0.00034816263,0.01029756,0.00014010645,0.000016142638,0.00016354184,0.00008963365,0.98601943,0.00029442788,0.00008671899,0.0017846095,0.000105077335],"about_ca_topic_score_codex":0.0000055321266,"about_ca_topic_score_gemma":0.000020984076,"teacher_disagreement_score":0.9623242,"about_ca_system_score_codex":0.000020403248,"about_ca_system_score_gemma":0.000060606337,"threshold_uncertainty_score":0.3287665},"labels":[],"label_agreement":null},{"id":"W2070943779","doi":"10.1109/jcn.2014.000009","title":"An opportunistic channel access scheme for interweave cognitive radio systems","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cognitive radio; Channel (broadcasting); Idle; Throughput; Computer network; Cognition; Scheme (mathematics); Telecommunications; Wireless; Mathematics","score_opus":0.050708089932740466,"score_gpt":0.32132479115276263,"score_spread":0.2706167012200222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070943779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030307504,0.0030276754,0.99204546,0.00081929925,0.0003534691,0.00017753938,0.0000032636856,0.000020927595,0.00052158366],"genre_scores_gemma":[0.98743033,0.0021541768,0.009687719,0.00022971736,0.0004533825,0.000007780584,0.000009992271,0.0000121242065,0.000014777977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883556,0.00024846295,0.00044307383,0.00014517888,0.00011924022,0.000208492],"domain_scores_gemma":[0.99726176,0.0009744335,0.0004736854,0.0005904266,0.0005121912,0.00018748672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010632474,0.0001252852,0.00030096745,0.00013115384,0.0003427105,0.0005543686,0.0012256702,0.00006810666,8.7269314e-7],"category_scores_gemma":[0.00006760971,0.00010914,0.000083389146,0.00019392684,0.00010878083,0.0006890202,0.00024602446,0.0002988971,2.46407e-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.00022337875,0.00064551,0.00078452966,0.00007193637,0.0005313878,0.000029052999,0.0014374899,0.0048881164,0.00016578776,0.21454728,0.0019209773,0.7747546],"study_design_scores_gemma":[0.0005556868,0.0004112557,0.000433416,0.00029066394,0.00004029928,0.00029631515,0.000123792,0.99253255,0.0000038819944,0.0020301186,0.0031447362,0.00013730659],"about_ca_topic_score_codex":0.000006791448,"about_ca_topic_score_gemma":0.0000122939155,"teacher_disagreement_score":0.98764443,"about_ca_system_score_codex":0.000025655621,"about_ca_system_score_gemma":0.000048342874,"threshold_uncertainty_score":0.5345789},"labels":[],"label_agreement":null},{"id":"W2080191567","doi":"10.1109/jcn.2014.000088","title":"HDRE: Coverage hole detection with residual energy in wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless sensor network; Residual; Energy (signal processing); Computer network; Key distribution in wireless sensor networks; Wireless; Quality of service; Real-time computing; Wireless network; Telecommunications; Algorithm; Statistics","score_opus":0.007946799263076766,"score_gpt":0.2114718371504416,"score_spread":0.20352503788736484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080191567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07118509,0.0019193593,0.9253081,0.0006146298,0.00019422268,0.00005262209,2.1447211e-7,0.000032952274,0.0006928028],"genre_scores_gemma":[0.98244345,0.005204819,0.011741015,0.00029254556,0.000245898,0.000005411086,0.0000025000504,0.000019776851,0.00004455258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809164,0.00054327043,0.00057509134,0.00020689282,0.000259242,0.00032386367],"domain_scores_gemma":[0.9972734,0.00068222114,0.0005356665,0.0011549939,0.00021509556,0.00013866386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088564993,0.00018698629,0.00034534224,0.00022578624,0.00026414898,0.00019357905,0.0012000968,0.0001626468,0.0000012965309],"category_scores_gemma":[0.000016783815,0.00015623299,0.000055929635,0.0007100697,0.00015735159,0.00040265964,0.0003340786,0.00068710465,3.342989e-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.000055127883,0.00011616858,0.0009544477,0.0000026590224,0.00003012211,0.000010620909,0.000098392724,0.843091,0.00007925243,0.011216994,0.00010804092,0.14423719],"study_design_scores_gemma":[0.0008126119,0.00031409488,0.002191187,0.00014980607,0.000016151855,0.00016337293,0.000025542206,0.9916109,0.000074593176,0.00016880281,0.0042756144,0.00019731853],"about_ca_topic_score_codex":0.0000477464,"about_ca_topic_score_gemma":0.0005367635,"teacher_disagreement_score":0.91356707,"about_ca_system_score_codex":0.000056842768,"about_ca_system_score_gemma":0.00003657186,"threshold_uncertainty_score":0.6370996},"labels":[],"label_agreement":null},{"id":"W2081975130","doi":"10.1109/jcn.2013.000068","title":"Low complexity zero-forcing beamforming for distributed massive MIMO systems in large public venues","year":2013,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced MIMO Systems Optimization","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":"University of British Columbia","keywords":"Precoding; MIMO; Computer science; Beamforming; Algorithm; Computational complexity theory; Diagonal; Matrix decomposition; Matrix (chemical analysis); Control theory (sociology); Telecommunications; Topology (electrical circuits); Mathematics; Physics","score_opus":0.027305122728470056,"score_gpt":0.2539606991249963,"score_spread":0.22665557639652625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081975130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01188618,0.0076213623,0.9797122,0.0001808269,0.0001828491,0.00031160537,0.000020510717,0.000022677472,0.000061804116],"genre_scores_gemma":[0.9842468,0.0014483738,0.014105652,0.000008283958,0.000071905095,0.000044765933,0.000052801206,0.000016996224,0.000004452025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992156,0.000046192756,0.00045809944,0.000045474095,0.000051986164,0.00018262712],"domain_scores_gemma":[0.99904346,0.00018397694,0.00022645501,0.0002824529,0.00020118117,0.000062464314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030330295,0.00008444178,0.0002175208,0.00009781972,0.00013477424,0.00008609587,0.00024417927,0.00006737511,0.0000016950562],"category_scores_gemma":[0.000039275143,0.00008147944,0.00003854186,0.00016527192,0.00003412714,0.0004724334,0.000053334134,0.00022864922,4.6881232e-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.000005407719,0.000046902733,0.0015068823,0.00010500462,0.000041206018,5.320461e-7,0.00026507012,0.98921764,0.00014972233,0.0030554978,0.0007971167,0.0048090024],"study_design_scores_gemma":[0.0004822559,0.000025867519,0.0006131203,0.0002929944,0.000009724497,0.000014669297,0.00034260936,0.99465305,0.000007286741,0.0005177258,0.0029542523,0.000086447195],"about_ca_topic_score_codex":0.000010274712,"about_ca_topic_score_gemma":0.000031639906,"teacher_disagreement_score":0.9723606,"about_ca_system_score_codex":0.000090953894,"about_ca_system_score_gemma":0.000011686209,"threshold_uncertainty_score":0.3322635},"labels":[],"label_agreement":null},{"id":"W2085267507","doi":"10.1109/jcn.2014.000092","title":"Enhancing network service survivability in large-scale failure scenarios","year":2014,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced Optical Network Technologies","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":"Ontario Tech University","funders":"","keywords":"Survivability; Computer science; Probabilistic logic; Scale (ratio); Service (business); Network service; Service provider; Computer network; Telecommunications network; Computer security; Risk analysis (engineering); Reliability engineering; Distributed computing; Engineering","score_opus":0.008043594305962977,"score_gpt":0.22953035460002094,"score_spread":0.22148676029405798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085267507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2709672,0.012880042,0.7114486,0.002752443,0.00031489012,0.00020362719,0.0000016024841,0.00021112527,0.0012204727],"genre_scores_gemma":[0.8905469,0.0034174696,0.10578056,0.000100524194,0.00012838964,0.0000044240683,0.0000020102411,0.000016859083,0.0000028540549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989476,0.000102260965,0.00050213916,0.00007693703,0.00008704428,0.00028397088],"domain_scores_gemma":[0.99845904,0.00056256953,0.0001123595,0.00068924035,0.000107937005,0.00006888037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093662617,0.00012029768,0.0002946723,0.00006252941,0.00011041673,0.000030686948,0.0005481526,0.0001502066,0.000006109833],"category_scores_gemma":[0.000057650886,0.00011057437,0.000043830736,0.00047085914,0.00006859735,0.00018698107,0.00022375702,0.0008447372,0.0000012046713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012339512,0.000054289365,0.011729164,0.000030854477,0.000026822046,9.3753886e-7,0.0001960108,0.9633204,0.00007491276,0.0017736282,0.00033777085,0.022442909],"study_design_scores_gemma":[0.00038429737,0.00004859292,0.007814701,0.0002335971,0.000016572554,0.000018088198,0.00028044978,0.9662702,0.000009766629,0.0046125134,0.020147296,0.00016392382],"about_ca_topic_score_codex":0.0000029548762,"about_ca_topic_score_gemma":0.002269114,"teacher_disagreement_score":0.61957973,"about_ca_system_score_codex":0.000044780994,"about_ca_system_score_gemma":0.000008570059,"threshold_uncertainty_score":0.4509092},"labels":[],"label_agreement":null},{"id":"W2091421129","doi":"10.1109/jcn.2005.6389815","title":"Performance of convolutionally-coded MIMO systems with antenna selection","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"Concordia University","funders":"","keywords":"Space–time block code; Computer science; Fading; Coding gain; Algorithm; MIMO; Diversity gain; Antenna diversity; Convolutional code; Block code; Coding (social sciences); Diversity combining; Telecommunications; Antenna (radio); Electronic engineering; Channel (broadcasting); Statistics; Decoding methods; Mathematics; Engineering","score_opus":0.0100264706348921,"score_gpt":0.22584425837313438,"score_spread":0.21581778773824228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091421129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40304974,0.043018907,0.55123323,0.0004231246,0.000073291325,0.0002408453,0.000003525869,0.00014602224,0.0018112885],"genre_scores_gemma":[0.931519,0.03229265,0.036093224,0.000010017031,0.000042120697,0.00000763922,0.0000027169754,0.00001268001,0.000019986592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993482,0.000046075264,0.00039420673,0.000033456756,0.0000944401,0.00008362435],"domain_scores_gemma":[0.99892604,0.00011130564,0.00024176583,0.00039559876,0.00028701514,0.000038289025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022477802,0.00007597292,0.00017879879,0.00009754516,0.000089082736,0.000013172534,0.0003528395,0.000051554234,0.000002575762],"category_scores_gemma":[0.0000045377683,0.000064519896,0.00002593772,0.00018520669,0.00010186037,0.0002743316,0.000043218854,0.00029691038,2.7964904e-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.00009760648,0.00014653277,0.010709736,0.00008825761,0.00020453564,2.5687163e-7,0.000292728,0.9339467,0.0054235305,0.004067357,0.00061083154,0.044411875],"study_design_scores_gemma":[0.00023205184,0.00012223235,0.0024244168,0.00023560514,0.000020588364,0.000087785746,0.000049232898,0.99037737,0.00033856143,0.000017115799,0.006016538,0.00007850302],"about_ca_topic_score_codex":0.000002693567,"about_ca_topic_score_gemma":0.000012875424,"teacher_disagreement_score":0.5284692,"about_ca_system_score_codex":0.000051874693,"about_ca_system_score_gemma":0.000018127725,"threshold_uncertainty_score":0.26310453},"labels":[],"label_agreement":null},{"id":"W2105553752","doi":"10.1109/jcn.2008.6389854","title":"A family of concatenated network codes for improved performance with generations","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Linear network coding; Erasure; Decoding methods; Concatenated error correction code; Network packet; Erasure code; Coding (social sciences); Code rate; Algorithm; Theoretical computer science; Block code; Computer network; Mathematics; Statistics","score_opus":0.04821867966487738,"score_gpt":0.26781795201358133,"score_spread":0.21959927234870394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105553752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052672673,0.014754309,0.9299637,0.0017766237,0.00009220515,0.0002545083,0.000002037235,0.000022344948,0.00046160922],"genre_scores_gemma":[0.8139329,0.051977765,0.13373928,0.00021931056,0.00006209756,0.000015149177,0.0000052135065,0.0000071085024,0.00004121051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990142,0.00013724144,0.0005101847,0.00009128521,0.00008886466,0.00015821081],"domain_scores_gemma":[0.9973352,0.00041018473,0.0005143535,0.00086504227,0.0007996763,0.00007552172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005346324,0.00010715955,0.00027866138,0.00007803231,0.0006253585,0.000044438064,0.0011503822,0.000050511848,0.000001307893],"category_scores_gemma":[0.00001864008,0.00008222021,0.0000612209,0.00044804942,0.00023446903,0.00036374788,0.00025394862,0.00024282736,1.3208775e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007350549,0.0013258161,0.022512829,0.00008708621,0.0013411022,0.0000058960304,0.0057073147,0.12919028,0.010463815,0.23996359,0.025567831,0.5630994],"study_design_scores_gemma":[0.00093456317,0.0005630541,0.0077396953,0.00011350287,0.000030069661,0.00011489739,0.000027175936,0.975354,0.00010041736,0.00013875913,0.014746481,0.0001373664],"about_ca_topic_score_codex":0.000002060078,"about_ca_topic_score_gemma":0.000019809542,"teacher_disagreement_score":0.84616375,"about_ca_system_score_codex":0.000019740559,"about_ca_system_score_gemma":0.00013012846,"threshold_uncertainty_score":0.4809815},"labels":[],"label_agreement":null},{"id":"W2123762323","doi":"10.1109/jcn.2007.6182882","title":"Performance of SC-FDE system in UWB communications with imperfect channel estimation","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Ultra-Wideband Communications Technology","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 Victoria","funders":"","keywords":"Computer science; SC-FDE; Equalization (audio); Bit error rate; Channel (broadcasting); Transmission (telecommunications); Frequency domain; Ultra-wideband; Algorithm; Minimum mean square error; Mean squared error; Block (permutation group theory); Electronic engineering; Telecommunications; Mathematics; Statistics","score_opus":0.00898655779881579,"score_gpt":0.22530217390218826,"score_spread":0.21631561610337247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123762323","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.89112085,0.021737408,0.08126731,0.00050478405,0.000077726945,0.00029219667,0.00000309714,0.00011164059,0.0048849722],"genre_scores_gemma":[0.960392,0.014701489,0.024841951,0.000009377213,0.000012280789,0.000012739315,0.00000758909,0.000018932698,0.0000036217073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988622,0.00007712923,0.0007123761,0.000054405267,0.00010554477,0.00018831142],"domain_scores_gemma":[0.99722314,0.00048189666,0.0003029122,0.0017542797,0.0001853388,0.00005245496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010797485,0.00011893585,0.000285979,0.0003728907,0.00016086253,0.000016494449,0.0012367312,0.0001213536,0.0000011074494],"category_scores_gemma":[0.000016084128,0.00010563961,0.00004066561,0.0005971842,0.00025301782,0.000230509,0.00018412185,0.00062809064,6.3736144e-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.000346175,0.0009029077,0.07217854,0.0004951364,0.0006296785,0.000007282211,0.0039731828,0.43159813,0.0029878016,0.02328961,0.00035235728,0.46323922],"study_design_scores_gemma":[0.0005950921,0.00022678496,0.016025847,0.00064610294,0.000054770222,0.0002218885,0.0007063928,0.9802056,0.00030693813,0.00006495533,0.00079814234,0.0001474864],"about_ca_topic_score_codex":0.00001809543,"about_ca_topic_score_gemma":0.00020351677,"teacher_disagreement_score":0.54860747,"about_ca_system_score_codex":0.00009829768,"about_ca_system_score_gemma":0.000029484969,"threshold_uncertainty_score":0.4307858},"labels":[],"label_agreement":null},{"id":"W2124297703","doi":"10.1109/jcn.2002.6596934","title":"On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":370,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Routing protocol; Telecommunications","score_opus":0.02377303206741777,"score_gpt":0.2757971317582326,"score_spread":0.25202409969081485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124297703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12541649,0.007925099,0.86452717,0.001050622,0.00032704935,0.00040010418,0.0000012476133,0.000039978375,0.0003122202],"genre_scores_gemma":[0.98027796,0.0013581999,0.01799609,0.0002367778,0.00007422382,0.000023094053,0.000002662001,0.0000210032,0.000010006355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978953,0.00031693632,0.0009075671,0.00023142998,0.00021972612,0.0004290605],"domain_scores_gemma":[0.9950463,0.0027385117,0.0008175584,0.0009827316,0.00027531383,0.00013954735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014164869,0.00020031533,0.00040591013,0.00017199288,0.00046420004,0.0002085893,0.0013496306,0.00015846426,0.0000067314113],"category_scores_gemma":[0.00011130392,0.0001849383,0.00012817382,0.00063224474,0.00008273725,0.00022588491,0.0004458381,0.0008509772,5.7218193e-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.000035813853,0.00027844944,0.00049321784,0.000009790734,0.000046914814,0.000012855269,0.0014406402,0.618372,0.000011913292,0.018558478,0.0005273728,0.36021256],"study_design_scores_gemma":[0.0011103505,0.00026551133,0.0007965596,0.0005521766,0.000013408213,0.00006128227,0.00014155387,0.9963445,0.0000023525995,0.00024385791,0.0002793456,0.00018907087],"about_ca_topic_score_codex":0.0000031910367,"about_ca_topic_score_gemma":0.00002944666,"teacher_disagreement_score":0.85486144,"about_ca_system_score_codex":0.00010625054,"about_ca_system_score_gemma":0.000023545774,"threshold_uncertainty_score":0.7541565},"labels":[],"label_agreement":null},{"id":"W2157635692","doi":"10.1109/jcn.2002.6596933","title":"Multipath routing for mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","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 Alberta","funders":"","keywords":"Computer science; Computer network; Multipath routing; Wireless ad hoc network; Mobile ad hoc network; Multipath propagation; Routing (electronic design automation); Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Wireless Routing Protocol; Routing protocol; Telecommunications; Wireless","score_opus":0.03099292896093242,"score_gpt":0.27057946885483497,"score_spread":0.23958653989390255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157635692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013974202,0.12464803,0.87214905,0.0007543857,0.00034910985,0.00029764333,8.908157e-7,0.00003759839,0.00036586734],"genre_scores_gemma":[0.8238038,0.062489394,0.11291253,0.00031121107,0.0002999398,0.000053468586,0.0000020911145,0.00001808665,0.00010949976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.00016453679,0.0006764396,0.00017333598,0.00015758876,0.0003418487],"domain_scores_gemma":[0.9965765,0.0009788171,0.000628295,0.001350896,0.00029172862,0.00017375767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000946717,0.00016175961,0.0003212473,0.00008741152,0.00045178604,0.00022480049,0.0019525142,0.00013492556,0.00001138669],"category_scores_gemma":[0.000034289784,0.00014334105,0.0001628813,0.00035354812,0.000106421096,0.00051982433,0.00053965516,0.00057705643,0.0000014096751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012750868,0.00016738391,0.00027984206,0.0000048081106,0.0000620865,0.000003281117,0.0005643468,0.053855237,0.0000065263935,0.0048794975,0.0061197616,0.9340445],"study_design_scores_gemma":[0.0005707564,0.00028510723,0.00017640184,0.0000842598,0.000024370647,0.00008988221,0.000050405873,0.894609,0.0000013935431,0.00032516316,0.103643246,0.00014004575],"about_ca_topic_score_codex":8.0660976e-7,"about_ca_topic_score_gemma":0.000010560903,"teacher_disagreement_score":0.9339044,"about_ca_system_score_codex":0.000040417483,"about_ca_system_score_gemma":0.000018404015,"threshold_uncertainty_score":0.58452785},"labels":[],"label_agreement":null},{"id":"W2166955633","doi":"10.1109/jcn.2011.6157413","title":"IEEE 802.15.6 under saturation: Some problems to be expected","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Body Area Networks","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":"Toronto Metropolitan University; University of Manitoba","funders":"","keywords":"Computer science; Markov chain; IEEE 802.15; Distributed coordination function; IEEE 802.11; Wireless; Channel (broadcasting); Body area network; Computer network; Inter-Access Point Protocol; IEEE 802.11b-1999; Wireless network; Wi-Fi; Wireless sensor network; Telecommunications; Machine learning","score_opus":0.04977944791952341,"score_gpt":0.24064433962062634,"score_spread":0.19086489170110293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166955633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41429162,0.1027892,0.45118475,0.0069881743,0.0032337375,0.0011376861,0.000011103065,0.00055726006,0.019806463],"genre_scores_gemma":[0.9840792,0.007368533,0.0079168035,0.00026401138,0.00029078877,0.000012719959,0.000004044641,0.000028138826,0.000035773304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991373,0.000061848295,0.00043692908,0.00006677312,0.000114198905,0.00018298275],"domain_scores_gemma":[0.9988789,0.0001073299,0.00012493071,0.00059803255,0.00013948944,0.00015133421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022652191,0.00012731779,0.00020904378,0.000116245275,0.00014323388,0.00005041611,0.000495195,0.00010842273,0.00003093939],"category_scores_gemma":[0.000005847207,0.00011610624,0.00005749714,0.00024879695,0.00006125395,0.00031980764,0.00008051651,0.00047098077,0.0000027429787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012258346,0.00041177456,0.0013908757,0.000054383767,0.0008266103,0.00001674041,0.012258017,0.8262968,0.0023817953,0.021512846,0.06879986,0.065927684],"study_design_scores_gemma":[0.0024258993,0.00083411863,0.03237864,0.0009915717,0.00027315482,0.00055121304,0.00204401,0.85397226,0.0006728,0.009255464,0.09509071,0.0015101527],"about_ca_topic_score_codex":0.000005591644,"about_ca_topic_score_gemma":0.00006939894,"teacher_disagreement_score":0.56978756,"about_ca_system_score_codex":0.000042967436,"about_ca_system_score_gemma":0.000017522667,"threshold_uncertainty_score":0.4734675},"labels":[],"label_agreement":null},{"id":"W2199985122","doi":"10.1109/jcn.2011.6157410","title":"Wireless three-pad ECG system: Challenges, design, and evaluations","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Wireless Body Area Networks","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 British Columbia","funders":"Dalhousie University","keywords":"Computer science; Electrocardiography; Lead (geology); Wireless; Data mining; Artificial intelligence; Medicine; Telecommunications; Cardiology","score_opus":0.07770571878270267,"score_gpt":0.25515356949484264,"score_spread":0.17744785071213998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2199985122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02642591,0.19515169,0.77223206,0.00031835688,0.0003691979,0.00033271333,0.000001637122,0.00012876764,0.0050396933],"genre_scores_gemma":[0.91735715,0.06209841,0.020384872,0.000009779465,0.00010236825,0.000014570224,0.0000015079913,0.000026287988,0.000005075135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.00015839639,0.0004373452,0.00007464481,0.000119334654,0.00016907662],"domain_scores_gemma":[0.9986779,0.00029416004,0.00016753523,0.00057297834,0.00016235637,0.00012506572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000861517,0.00013542439,0.00025912435,0.00010210393,0.00019399394,0.00003703381,0.00040899275,0.000120880824,0.0000062456807],"category_scores_gemma":[0.000007550023,0.0001228835,0.000044658802,0.00012683525,0.00012147267,0.00021628311,0.00010851298,0.0004287661,0.0000010754919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008281219,0.00020594832,0.0024150691,0.0002146023,0.00077515136,0.000021003803,0.0040460113,0.07934315,0.00014559872,0.033372276,0.0016628456,0.8777155],"study_design_scores_gemma":[0.00034757875,0.00009126931,0.0065024938,0.00033241755,0.0001134011,0.00019199864,0.00031127123,0.990433,0.00001257699,0.0006819226,0.0008331355,0.0001489275],"about_ca_topic_score_codex":0.0000055054934,"about_ca_topic_score_gemma":0.00005267305,"teacher_disagreement_score":0.91108984,"about_ca_system_score_codex":0.000041712727,"about_ca_system_score_gemma":0.000021515745,"threshold_uncertainty_score":0.5011044},"labels":[],"label_agreement":null},{"id":"W2273990441","doi":"10.1109/jcn.2001.6596962","title":"SELFCON: An architecture for self-configuration of networks","year":2001,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Configuration Management (ITSM); Computer science; Network management application; Network management station; Element management system; Provisioning; Distributed computing; Directory service; Structure of Management Information; Network management; Computer network; Network architecture; Directory; Operating system","score_opus":0.01842326331975024,"score_gpt":0.26508163532772144,"score_spread":0.2466583720079712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273990441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034691684,0.0042518363,0.9896863,0.0016606045,0.00017234297,0.0002835422,5.3693975e-7,0.00002892034,0.0004467114],"genre_scores_gemma":[0.87897885,0.0069765165,0.11339932,0.0003461798,0.00023786313,0.000018854043,0.0000074287805,0.000010470198,0.000024529945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987427,0.00020654453,0.0005771861,0.00013075846,0.00015160574,0.00019118072],"domain_scores_gemma":[0.997467,0.00035597367,0.00063325494,0.0011437718,0.00028580308,0.00011423605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093502644,0.00012031634,0.00024432686,0.00013083724,0.00019984963,0.000105735315,0.001409905,0.00007793576,0.0000052607197],"category_scores_gemma":[0.000010333766,0.000104641644,0.00010042628,0.00035237396,0.0000753377,0.00038878148,0.00021776826,0.0002730134,1.917769e-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.00007742905,0.00035557177,0.0006526101,0.00002149647,0.00019082554,0.0000049090827,0.0006755869,0.33749327,0.00003512531,0.055058464,0.0032872232,0.6021475],"study_design_scores_gemma":[0.0005876677,0.0005020925,0.0007556122,0.000060569077,0.00005679087,0.000064557906,0.0000463386,0.9296056,0.000012802269,0.002037864,0.06615021,0.000119889395],"about_ca_topic_score_codex":0.000003932679,"about_ca_topic_score_gemma":0.000026170164,"teacher_disagreement_score":0.87628704,"about_ca_system_score_codex":0.000032419735,"about_ca_system_score_gemma":0.000046880938,"threshold_uncertainty_score":0.42671624},"labels":[],"label_agreement":null},{"id":"W2280203714","doi":"10.1109/jcn.2007.6182854","title":"Performance and energy consumption analysis of 802.11 with FEC codes over wireless sensor networks","year":2007,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":18,"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":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Energy consumption; Forward error correction; Wireless sensor network; Computer network; Wireless; Telecommunications; Decoding methods; Electrical engineering","score_opus":0.012621643007529094,"score_gpt":0.242734154081111,"score_spread":0.23011251107358188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280203714","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.50911725,0.0030683493,0.48750538,0.0000664768,0.000055247747,0.000023784729,6.127567e-7,0.000012597046,0.00015030903],"genre_scores_gemma":[0.9608811,0.01991287,0.018997692,0.00010166809,0.000060194354,0.0000013585277,0.000005862689,0.0000113465285,0.000027885457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843895,0.00016557904,0.0006717005,0.00017717792,0.00027058748,0.0002759759],"domain_scores_gemma":[0.996959,0.0007901395,0.0008395083,0.000920222,0.00033550034,0.0001556802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010174894,0.00017503506,0.0004884088,0.0004230474,0.0002513663,0.000091276255,0.00077375554,0.00013560512,0.0000037068567],"category_scores_gemma":[0.0000057743564,0.00014030767,0.00009642867,0.0011181772,0.00036879387,0.0003422893,0.00028807725,0.00033220602,5.5029894e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009430159,0.00015477401,0.18168555,0.000011313776,0.00063235726,0.000007879075,0.0002503801,0.742844,0.000073801755,0.007627054,0.00007607962,0.06654251],"study_design_scores_gemma":[0.0003854269,0.00014951416,0.112162046,0.00013326894,0.0002906121,0.000073804775,0.000036673686,0.88604766,0.000032863798,0.0000037896452,0.0005384855,0.00014587965],"about_ca_topic_score_codex":0.000039372248,"about_ca_topic_score_gemma":0.0004700929,"teacher_disagreement_score":0.46850768,"about_ca_system_score_codex":0.000031942203,"about_ca_system_score_gemma":0.000026700125,"threshold_uncertainty_score":0.5721581},"labels":[],"label_agreement":null},{"id":"W2284453291","doi":"10.1109/jcn.2005.6389819","title":"Interactive conflict detection and resolution for personalized features","year":2005,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Service-Oriented Architecture and Web Services","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":"Université du Québec en Outaouais; Institut national de psychiatrie légale Philippe-Pinel; University of Ottawa","funders":"","keywords":"Computer science; Telephony; Terminology; Feature (linguistics); Set (abstract data type); Voice over IP; User Friendly; Order (exchange); The Internet; Human–computer interaction; World Wide Web; Telecommunications; Programming language","score_opus":0.014871631935634469,"score_gpt":0.27885667315626383,"score_spread":0.2639850412206294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284453291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020667389,0.02767782,0.94107836,0.009704504,0.00016967118,0.00016343451,0.0000013938095,0.000021952721,0.00051544013],"genre_scores_gemma":[0.9494107,0.0039431127,0.04570886,0.0007164088,0.0001777519,0.0000058963997,0.0000013014288,0.0000038960366,0.000032089756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995046,0.00007919817,0.00018661091,0.00007478392,0.000067555746,0.000087240114],"domain_scores_gemma":[0.998937,0.00033826035,0.0002177754,0.0002790206,0.00017294077,0.00005500057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027683278,0.00006445352,0.00011278127,0.0000862699,0.00024008,0.00009925941,0.00040669396,0.000045275217,8.628298e-7],"category_scores_gemma":[0.000007118947,0.00005148991,0.00004382576,0.00011386525,0.000048326732,0.00037676396,0.00014700786,0.00021678058,1.2970553e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027803122,0.000118951444,0.00014831306,0.000020003057,0.00015099037,7.000186e-7,0.009990283,0.0013277336,0.0012741516,0.035058834,0.00051657704,0.9511154],"study_design_scores_gemma":[0.0013129379,0.0004075363,0.0045394367,0.00012159741,0.000056360674,0.00033386453,0.0005904197,0.5568024,0.00028988713,0.0018949343,0.43349892,0.00015172348],"about_ca_topic_score_codex":0.000012697846,"about_ca_topic_score_gemma":0.00017527897,"teacher_disagreement_score":0.95096374,"about_ca_system_score_codex":0.000015429783,"about_ca_system_score_gemma":0.000013677296,"threshold_uncertainty_score":0.20996976},"labels":[],"label_agreement":null},{"id":"W2286495892","doi":"10.1109/jcn.2011.6157479","title":"Recent advances in filter topologies and realizations for satellite communications","year":2011,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Microwave Engineering and Waveguides","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 Waterloo","funders":"","keywords":"Computer science; Network topology; Communications satellite; Implementation; Electronic engineering; Filter (signal processing); Microwave transmission; Waveguide filter; Modular design; Transfer function; Microwave; Satellite; Telecommunications; Topology (electrical circuits); Filter design; Electrical engineering; Prototype filter; Computer network; Aerospace engineering; Engineering","score_opus":0.04621030248702551,"score_gpt":0.2730182243535175,"score_spread":0.226807921866492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286495892","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004440599,0.87495375,0.11331944,0.0007534425,0.00017208455,0.00018277549,0.0000090331205,0.000048924492,0.006119923],"genre_scores_gemma":[0.41396457,0.5604834,0.025496418,0.000015386408,0.000013539077,0.0000070122937,0.0000046322684,0.0000067215456,0.00000832511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952537,0.000031793763,0.0002921701,0.000036175417,0.000023866196,0.000090605085],"domain_scores_gemma":[0.9991785,0.00021685786,0.00006180287,0.00043049734,0.00007500876,0.000037308895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002395438,0.00006532773,0.00012992157,0.00008783656,0.0000782538,0.000017054539,0.0002851254,0.000047778147,0.0000032688415],"category_scores_gemma":[0.000028551824,0.00005950054,0.000021859965,0.00010470316,0.00009731226,0.00015002361,0.000074399104,0.00016771303,1.05111475e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025266658,0.000102811005,0.0047033606,0.000065569264,0.00007884589,8.10974e-7,0.003153012,0.009202869,0.00011599449,0.025428379,0.00089380454,0.95622927],"study_design_scores_gemma":[0.00042460015,0.000096434764,0.006742457,0.00019275356,0.00003663975,0.00004290801,0.00046964953,0.14127432,0.00004601908,0.0053158957,0.8451848,0.00017352158],"about_ca_topic_score_codex":0.0000021270303,"about_ca_topic_score_gemma":0.000081018385,"teacher_disagreement_score":0.95605576,"about_ca_system_score_codex":0.0000143476955,"about_ca_system_score_gemma":0.00000615211,"threshold_uncertainty_score":0.24263616},"labels":[],"label_agreement":null},{"id":"W2328058829","doi":"10.1109/jcn.2016.000013","title":"Impact of trust-based security association and mobility on the delay metric in MANET","year":2016,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","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":"Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Metric (unit); Mobile ad hoc network; Computer network; Computer security; Association (psychology); Telecommunications; Business; Network packet","score_opus":0.01539669572079831,"score_gpt":0.27570271071491353,"score_spread":0.2603060149941152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328058829","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.91679245,0.0053736656,0.072957985,0.0042508757,0.000075008196,0.0002194826,0.0000038792696,0.00000874893,0.00031789741],"genre_scores_gemma":[0.99506235,0.0036190874,0.0011990205,0.00008186825,0.000024995514,0.000004777065,3.3797696e-7,0.0000032791684,0.0000042851675],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987455,0.00046653187,0.0004049884,0.00008373737,0.00016877719,0.00013044661],"domain_scores_gemma":[0.9955999,0.002822215,0.0005641843,0.00079718005,0.00015994979,0.00005655854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022110702,0.000077802746,0.00019450512,0.00012392351,0.00008343047,0.000044304637,0.00077698653,0.000078410056,0.000006998046],"category_scores_gemma":[0.00014602927,0.000041111172,0.00007423026,0.00047347028,0.0000750941,0.00020147194,0.00017636125,0.0003127395,2.4052304e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018806946,0.0013566687,0.5947182,0.00001439772,0.00027102994,0.0000053229082,0.00097297836,0.018028362,0.000075626034,0.027320223,0.0043331287,0.352716],"study_design_scores_gemma":[0.001017111,0.0006000033,0.40742972,0.00016146635,0.000023488747,0.00001574252,0.000017019014,0.58412635,0.000015434052,0.005624948,0.00085541693,0.000113286864],"about_ca_topic_score_codex":0.000029359311,"about_ca_topic_score_gemma":0.000053798234,"teacher_disagreement_score":0.56609803,"about_ca_system_score_codex":0.00013710876,"about_ca_system_score_gemma":0.000059576527,"threshold_uncertainty_score":0.1676465},"labels":[],"label_agreement":null},{"id":"W2601455897","doi":"10.1109/jcn.2017.000007","title":"Competition-based distributed BS power activation and user scheduling algorithm","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Advanced MIMO Systems 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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Scheduling (production processes); Base station; Computer network; Throughput; Distributed computing; Cellular network; Enhanced Data Rates for GSM Evolution; Maximum throughput scheduling; Algorithm; Fair-share scheduling; Quality of service; Round-robin scheduling; Telecommunications; Mathematical optimization; Wireless","score_opus":0.012057179836194299,"score_gpt":0.2514851949822896,"score_spread":0.2394280151460953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601455897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059851054,0.001543976,0.9917174,0.00038133844,0.00009650532,0.00006232405,0.0000052792197,0.000019370189,0.00018867818],"genre_scores_gemma":[0.9096658,0.0015260816,0.08870495,0.000016532937,0.000050948664,0.0000026965101,0.000017397584,0.000011353595,0.0000042034812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999569,0.000028475433,0.0002365689,0.000040283387,0.000051819607,0.000073880525],"domain_scores_gemma":[0.9990177,0.00011696307,0.00023628533,0.00043154447,0.0001463563,0.000051137282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001740217,0.000069900096,0.00012839936,0.0000477131,0.00035327073,0.00011490625,0.00020752024,0.000057959638,0.000003976981],"category_scores_gemma":[0.000032242726,0.00006751904,0.000022677938,0.000041136744,0.00007125809,0.00037265092,0.000045639863,0.00021272482,2.229839e-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.000012489758,0.000039551403,0.0023547404,0.000018606213,0.00007064423,0.0000011123271,0.000084829815,0.9710077,0.0003362215,0.0015350734,0.00017035095,0.024368692],"study_design_scores_gemma":[0.00044987103,0.000024564712,0.004395199,0.00019590338,0.000016374272,0.000012283797,0.000059493002,0.9916351,0.00006520245,0.00011485329,0.0029496201,0.00008155417],"about_ca_topic_score_codex":0.0000027653582,"about_ca_topic_score_gemma":0.000004168664,"teacher_disagreement_score":0.90368074,"about_ca_system_score_codex":0.000029051616,"about_ca_system_score_gemma":0.000010302756,"threshold_uncertainty_score":0.27533463},"labels":[],"label_agreement":null},{"id":"W2774231546","doi":"10.1109/jcn.2017.000082","title":"Risk-adaptive strategic network protection in disaster scenarios","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Computer security; Risk analysis (engineering); Computer network","score_opus":0.044119659109385416,"score_gpt":0.300355317562984,"score_spread":0.2562356584535986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774231546","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.53926635,0.005617101,0.42903304,0.0016841511,0.00026926762,0.0007663513,0.0000069742396,0.000033063927,0.02332368],"genre_scores_gemma":[0.9943165,0.00081092253,0.0043700775,0.000010748649,0.00043415825,0.000013561114,0.0000022726,0.000009716494,0.00003201979],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990488,0.00019850973,0.0004163678,0.0000867331,0.00008610701,0.00016342623],"domain_scores_gemma":[0.9978082,0.000092938644,0.0010124344,0.000909212,0.00011878007,0.00005842855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067273807,0.00010780306,0.00025491643,0.00006581714,0.00061220734,0.00019191287,0.000659022,0.000045148507,0.000027254755],"category_scores_gemma":[0.0000050891326,0.00009220618,0.00010580039,0.00010464169,0.0001417779,0.0002607806,0.0002572444,0.0006630985,7.3359666e-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.00021393919,0.00054382643,0.5214112,0.0000054516986,0.0005441763,0.000004070547,0.0006093914,0.0656971,0.000026529771,0.05072222,0.0013368267,0.35888532],"study_design_scores_gemma":[0.0010112523,0.00025527042,0.09551509,0.00037487742,0.00019538605,0.000011228179,0.00064958626,0.7838357,0.000004934829,0.11360531,0.0042221467,0.00031920781],"about_ca_topic_score_codex":0.00028012344,"about_ca_topic_score_gemma":0.00033583384,"teacher_disagreement_score":0.71813864,"about_ca_system_score_codex":0.000022106537,"about_ca_system_score_gemma":0.000027728332,"threshold_uncertainty_score":0.47086656},"labels":[],"label_agreement":null},{"id":"W2786118779","doi":"10.1109/jcn.2017.000094","title":"Software defined multihop wireless networks: Promises and challenges","year":2017,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Software-Defined Networks and 5G","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":"Computer science; Software-defined networking; Computer network; Wireless network; Distributed computing; Node (physics); Forwarding plane; Network topology; Wireless; Telecommunications","score_opus":0.05447947907822185,"score_gpt":0.2760178994619249,"score_spread":0.22153842038370306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786118779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016985359,0.28436613,0.6819406,0.015092082,0.00068601494,0.0002737334,0.000001806147,0.00010790523,0.0005463207],"genre_scores_gemma":[0.72983074,0.22159956,0.04817556,0.00013848841,0.00021028913,0.000007877953,0.0000010126114,0.000013298475,0.000023167035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879134,0.00013626918,0.0004514404,0.00019642456,0.00015981925,0.00026469523],"domain_scores_gemma":[0.99612886,0.00074047066,0.000775177,0.001915346,0.0002477217,0.00019244246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075704354,0.00018016198,0.0003647666,0.000080513666,0.0011123325,0.00057606184,0.0022676503,0.00014123117,0.0000017815953],"category_scores_gemma":[0.000120958066,0.00014739901,0.00008470595,0.000084398795,0.00029406807,0.0007884009,0.0012233446,0.00048367327,5.293293e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029711728,0.00011636725,0.008297195,0.00002067391,0.00009477838,0.000011565917,0.0003509188,0.0010440769,0.0000022646286,0.01638957,0.00086104334,0.97278184],"study_design_scores_gemma":[0.0023155895,0.0005024425,0.114304155,0.0007845059,0.00010990855,0.00052545755,0.00012974041,0.8295614,0.0000043680798,0.0069236006,0.04423932,0.0005995092],"about_ca_topic_score_codex":0.000013868818,"about_ca_topic_score_gemma":0.000060605096,"teacher_disagreement_score":0.97218233,"about_ca_system_score_codex":0.000015684196,"about_ca_system_score_gemma":0.00004535566,"threshold_uncertainty_score":0.85552746},"labels":[],"label_agreement":null},{"id":"W2907758373","doi":"10.1109/jcn.2019.000005","title":"Coverage protocols for wireless sensor networks: Review and future directions","year":2019,"lang":"en","type":"preprint","venue":"Journal of Communications and Networks","topic":"Energy Efficient Wireless 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":"Carleton University; Fisheries and Oceans Canada","funders":"","keywords":"Computer science; Wireless sensor network; Software deployment; Computer network; Open research; Scheduling (production processes); Energy consumption; Distributed computing; Engineering","score_opus":0.02424992602582755,"score_gpt":0.301829857882434,"score_spread":0.27757993185660645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907758373","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015541699,0.2776707,0.70602655,0.008311695,0.0009673019,0.006451357,0.000012102943,0.000060503404,0.0003443763],"genre_scores_gemma":[0.021324769,0.90671635,0.06716494,0.0013829408,0.001461557,0.0016580713,0.000037039666,0.00006087127,0.00019346709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744964,0.00046340868,0.0010797258,0.00040234503,0.00024377936,0.00036110438],"domain_scores_gemma":[0.9939839,0.00090544694,0.0016570401,0.0025246562,0.00072480086,0.00020410596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012784183,0.00038617238,0.0010387532,0.00016902607,0.0004262486,0.0004256258,0.0022571716,0.0004505466,0.000003038304],"category_scores_gemma":[0.000027605203,0.0003356169,0.00029257796,0.0003698458,0.00015602447,0.00028245454,0.0019722679,0.0017447991,3.9575158e-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.00008152651,0.0005522128,0.0004944229,0.002237688,0.00077456626,0.00000959495,0.0003936382,0.4841899,0.0000048443944,0.021100506,0.020869493,0.4692916],"study_design_scores_gemma":[0.00047903394,0.00015503493,0.00021983801,0.0036034475,0.00021130797,0.0001529982,0.000013411166,0.66435885,7.289342e-7,0.000269468,0.33019274,0.00034314246],"about_ca_topic_score_codex":0.000004869468,"about_ca_topic_score_gemma":0.000011821472,"teacher_disagreement_score":0.6388616,"about_ca_system_score_codex":0.00007136447,"about_ca_system_score_gemma":0.00015143467,"threshold_uncertainty_score":0.9999096},"labels":[],"label_agreement":null},{"id":"W2945709631","doi":"10.1109/jcn.2019.000021","title":"Error detection algorithm for Lempel-Ziv-77 compressed data","year":2019,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Computer science; Parity bit; Algorithm; Checksum; Hamming code; Error detection and correction; Cyclic redundancy check; Bit error rate; Data compression; Redundancy (engineering); Decoding methods; Block code","score_opus":0.0480410243959005,"score_gpt":0.31154297135214476,"score_spread":0.26350194695624424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945709631","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.00065861235,0.0043152,0.9936522,0.0006009746,0.00044337404,0.00017033434,0.000019933968,0.000018468925,0.00012086285],"genre_scores_gemma":[0.39363903,0.0032462238,0.6024775,0.00020579892,0.00025562994,0.0000061634546,0.0000708605,0.000013343001,0.000085435575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908274,0.00009947636,0.0003708472,0.00015855898,0.00014594359,0.00014241246],"domain_scores_gemma":[0.9967127,0.00040052025,0.00037988523,0.0022301145,0.000194273,0.00008252607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070401985,0.000092764305,0.00020234415,0.000079612364,0.00024070835,0.00017482723,0.0028018702,0.00007347702,0.0000051708907],"category_scores_gemma":[0.000013838545,0.00007491885,0.000045238743,0.00015843379,0.000043974214,0.0010415338,0.0013557973,0.00030865864,0.0000022535437],"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.000012560188,0.000088571556,0.000063231666,0.000006143225,0.000038580027,6.390345e-7,0.000066371686,0.000506449,0.00017660916,0.00096766854,0.0027603167,0.99531287],"study_design_scores_gemma":[0.0005222247,0.00014998985,0.00041552333,0.000048817117,0.000015444908,0.000049969105,0.000028923323,0.872525,0.000024325687,0.0005075153,0.12562998,0.00008231024],"about_ca_topic_score_codex":0.000011404525,"about_ca_topic_score_gemma":0.000009139552,"teacher_disagreement_score":0.99523056,"about_ca_system_score_codex":0.000014393145,"about_ca_system_score_gemma":0.000039916013,"threshold_uncertainty_score":0.5206619},"labels":[],"label_agreement":null},{"id":"W3139677063","doi":"10.23919/jcn.2020.000031","title":"5G NR mmWave indoor coverage with massive antenna system","year":2021,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Kyungpook National University","keywords":"Computer science; Relay; Architecture; Antenna (radio); Radio frequency; Computer network; Embedded system; Telecommunications; Power (physics)","score_opus":0.014895290216222198,"score_gpt":0.21204223572792702,"score_spread":0.1971469455117048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139677063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06302703,0.016774783,0.9157607,0.0003597447,0.00014927927,0.000070623624,0.000004340024,0.00003408983,0.0038194233],"genre_scores_gemma":[0.98457843,0.009152477,0.0060853115,0.000063575906,0.00007043972,0.0000024646963,0.000004794292,0.000014714405,0.000027780672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940985,0.00006293231,0.0002937346,0.00004619963,0.00009010811,0.000097195094],"domain_scores_gemma":[0.99913204,0.00008735894,0.00011849869,0.0003470516,0.00024210275,0.00007294283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018206032,0.00007883489,0.00017218449,0.00005412169,0.00010724619,0.00007286288,0.00015576376,0.00004861841,0.000013674121],"category_scores_gemma":[0.000007093517,0.000063694264,0.000042351618,0.00010601429,0.000028436849,0.0001136164,0.000041972948,0.00031986603,9.28435e-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.0002429692,0.00036083697,0.004755357,0.00061293953,0.0022113207,0.00032484016,0.004299764,0.72535175,0.031095713,0.011963746,0.0026777007,0.21610308],"study_design_scores_gemma":[0.0006813768,0.00007148228,0.00038021005,0.0005247815,0.00007678591,0.00044515938,0.00072471803,0.99350494,0.0006198479,0.00008851137,0.0027369577,0.00014523159],"about_ca_topic_score_codex":9.744373e-7,"about_ca_topic_score_gemma":0.000007885562,"teacher_disagreement_score":0.9215514,"about_ca_system_score_codex":0.000035417517,"about_ca_system_score_gemma":0.000029296365,"threshold_uncertainty_score":0.25973767},"labels":[],"label_agreement":null},{"id":"W4206341533","doi":"10.23919/jcn.2021.100036","title":"Inside front cover","year":2021,"lang":"en","type":"paratext","venue":"Journal of Communications and Networks","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 Victoria","funders":"","keywords":"Computer science; Front cover; Front (military); Cover (algebra); Telecommunications; Geology; Mechanical engineering","score_opus":0.05698833462839843,"score_gpt":0.2464076569589739,"score_spread":0.18941932233057546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206341533","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009068478,0.2954714,0.001889399,0.0005429771,0.004246573,0.000053490683,0.00016726405,0.0000020205484,0.6975362],"genre_scores_gemma":[0.01650202,0.33672354,0.0015494236,0.00039290686,0.0004890347,0.0000043149757,0.000053078624,0.00002069797,0.644265],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871826,0.000030808067,0.0008987034,0.00016625933,0.000026808819,0.00015914389],"domain_scores_gemma":[0.9976696,0.00013211297,0.0012624215,0.0007427332,0.00011389246,0.000079256366],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00061585783,0.00014296644,0.00070541305,0.00017883342,0.00020199864,0.00016850971,0.000598337,0.00017001005,0.01151986],"category_scores_gemma":[0.00003089507,0.00014954469,0.00019890333,0.0000907766,0.00017278151,0.00016112339,0.00045422348,0.000514249,0.004765871],"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.000005192275,0.000045220153,0.00012524758,0.000010191434,0.00025348805,0.0000015851579,0.00019803486,0.0004752274,1.1036121e-7,0.0038241742,0.9939497,0.001111842],"study_design_scores_gemma":[0.00026332217,0.000027059024,0.00012456646,0.00010296671,0.000025288016,0.000017887101,0.00018549334,0.00196923,2.5480963e-7,0.0004798195,0.9966528,0.00015135635],"about_ca_topic_score_codex":0.0000298249,"about_ca_topic_score_gemma":0.0000097352295,"teacher_disagreement_score":0.05327119,"about_ca_system_score_codex":0.000074306234,"about_ca_system_score_gemma":0.000050356542,"threshold_uncertainty_score":0.99600905},"labels":[],"label_agreement":null},{"id":"W4220873601","doi":"10.23919/jcn.2022.9737071","title":"Inside front cover","year":2022,"lang":"en","type":"paratext","venue":"Journal of Communications and Networks","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 Victoria","funders":"","keywords":"Computer science; Front cover; Cover (algebra); Front (military); Geology","score_opus":0.05562962457323,"score_gpt":0.24389277664736664,"score_spread":0.18826315207413663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220873601","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007706054,0.19326353,0.00087068684,0.00051613,0.005028519,0.000077917495,0.0003209733,0.0000027021617,0.7998425],"genre_scores_gemma":[0.01642903,0.25084525,0.00080598285,0.0004394255,0.00037833554,0.000010871985,0.000058548878,0.000024735169,0.7310078],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872667,0.00003662051,0.00088341243,0.00015959928,0.0000331075,0.00016058281],"domain_scores_gemma":[0.9975714,0.00014023753,0.0014494342,0.000714178,0.00005405591,0.00007069315],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00083750964,0.00013874397,0.0006276346,0.0002427495,0.00035438177,0.000113041955,0.00081817084,0.00010932334,0.045168035],"category_scores_gemma":[0.000021354692,0.00014872337,0.00018554472,0.00009482197,0.00016421005,0.00015717218,0.0006971162,0.00065587676,0.0052698185],"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.000009240266,0.00004600901,0.00011765628,0.000006872823,0.00020480924,9.134608e-7,0.00023580459,0.001216341,4.1759936e-8,0.004476116,0.9926198,0.0010663989],"study_design_scores_gemma":[0.00027297324,0.000051093306,0.000097186334,0.000029465446,0.000022433016,0.000014408777,0.00020697934,0.0022954382,5.3617292e-8,0.000653071,0.9962067,0.00015019394],"about_ca_topic_score_codex":0.0000415212,"about_ca_topic_score_gemma":0.000005016514,"teacher_disagreement_score":0.068834655,"about_ca_system_score_codex":0.00011919818,"about_ca_system_score_gemma":0.00003932494,"threshold_uncertainty_score":0.9955047},"labels":[],"label_agreement":null},{"id":"W4313886758","doi":"10.23919/jcn.2022.000054","title":"Slicing-based resource optimization in multi-access edge network using ensemble learning aided DDPG algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Caching and Content Delivery","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 Civil, Mechanical and Manufacturing Innovation; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Mobile edge computing; Wireless network; Distributed computing; Virtual network; Resource allocation; Wireless; Edge computing; Computer network; Server; Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence","score_opus":0.07294231477596194,"score_gpt":0.31744040555547004,"score_spread":0.2444980907795081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313886758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010911805,0.0024559826,0.98566866,0.0006390153,0.0001405249,0.000066834415,2.0404428e-7,0.00004818189,0.00006880198],"genre_scores_gemma":[0.8573427,0.0019214472,0.14027469,0.00026567522,0.00012870059,0.0000030872425,0.0000070182095,0.000013975421,0.00004270832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987339,0.0003642811,0.00042821135,0.00011686073,0.00014096357,0.00021582426],"domain_scores_gemma":[0.9985106,0.00043452837,0.00035149508,0.00049644336,0.00013515842,0.00007176853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012075009,0.00009680008,0.00020342608,0.00024847282,0.0003953261,0.00026154864,0.0009946097,0.000069466936,0.0000010145045],"category_scores_gemma":[0.000041600902,0.00009412627,0.000065947104,0.0009961794,0.00004235752,0.00041757768,0.00045573738,0.00055106013,4.9215805e-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.000008198445,0.00002958676,0.0018878762,0.0000023768305,0.000010513135,0.000006692811,0.00012960412,0.9625944,0.00001771613,0.00006534226,0.00019096029,0.035056774],"study_design_scores_gemma":[0.000534345,0.00004550776,0.0012770917,0.00021975585,0.000011279215,0.000023688564,0.00006580645,0.9965685,0.000002343187,0.00004787075,0.001105242,0.00009857227],"about_ca_topic_score_codex":0.00006185498,"about_ca_topic_score_gemma":0.00003067412,"teacher_disagreement_score":0.8464309,"about_ca_system_score_codex":0.00004524645,"about_ca_system_score_gemma":0.000060320843,"threshold_uncertainty_score":0.38383576},"labels":[],"label_agreement":null},{"id":"W4313887358","doi":"10.23919/jcn.2022.000051","title":"HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"Concordia University","funders":"","keywords":"Computer science; Broadcasting (networking); Heuristic; Clique; Network topology; Algorithm; Theoretical computer science; Genetic algorithm; Computer network; Mathematics; Artificial intelligence","score_opus":0.051666683221326996,"score_gpt":0.29256302870495576,"score_spread":0.24089634548362876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313887358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02176051,0.0038076895,0.97353,0.0005405172,0.00022434829,0.000059376867,0.0000016522065,0.000029416873,0.000046489153],"genre_scores_gemma":[0.8192228,0.002586135,0.1778585,0.00008363353,0.000171479,0.000001608959,0.0000019077927,0.000008268633,0.00006567495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993502,0.000079593,0.0002549501,0.00007836398,0.000093048584,0.00014386815],"domain_scores_gemma":[0.9986769,0.00043977358,0.0002130868,0.00042434558,0.00017824388,0.00006763907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004060321,0.0000655944,0.00013215249,0.00012926882,0.00033598294,0.0001257225,0.00073368306,0.000035789864,4.3478323e-7],"category_scores_gemma":[0.00003129917,0.00006200914,0.00007402109,0.00030258563,0.000045586366,0.0001814279,0.0003212737,0.00019461046,5.3299556e-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.000018992081,0.000086363936,0.00055343146,0.0000226188,0.00010308686,0.000040226732,0.0008797699,0.056088593,0.00022713706,0.0033980156,0.0020845707,0.9364972],"study_design_scores_gemma":[0.00027803643,0.000072126284,0.00084637577,0.00008676365,0.000026396317,0.00015059214,0.00009201874,0.995994,9.661273e-7,0.0006240944,0.0017603211,0.00006834899],"about_ca_topic_score_codex":0.000018793355,"about_ca_topic_score_gemma":0.0000027055914,"teacher_disagreement_score":0.93990535,"about_ca_system_score_codex":0.000025938392,"about_ca_system_score_gemma":0.00005233807,"threshold_uncertainty_score":0.25841433},"labels":[],"label_agreement":null},{"id":"W4392392437","doi":"10.23919/jcn.2024.000001","title":"Statistical analysis of cascaded Nakagami-m fading channels with generalized correlation","year":2024,"lang":"en","type":"article","venue":"Journal of Communications and Networks","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":"Memorial University of Newfoundland","funders":"","keywords":"Nakagami distribution; Fading; Computer science; Statistical analysis; Algorithm; Fading distribution; Telecommunications; Correlation; Statistics; Mathematics; Channel (broadcasting); Rayleigh fading","score_opus":0.014940584636000544,"score_gpt":0.2781283553238455,"score_spread":0.26318777068784494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392392437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026421502,0.019568294,0.95337623,0.00012747307,0.00005582243,0.00006364323,0.000007510689,0.00007048255,0.00030904627],"genre_scores_gemma":[0.92545766,0.018898753,0.05555379,0.000009269385,0.00002163395,0.0000061771316,0.000024030081,0.00001640331,0.000012308701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992428,0.00007790066,0.00043880206,0.000050471637,0.000105438296,0.00008463121],"domain_scores_gemma":[0.9987521,0.00046925826,0.0001302936,0.00047420844,0.00012497178,0.000049143047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027539462,0.00008626814,0.00027859648,0.0003667979,0.000062561114,0.000039619616,0.00029497378,0.00006105304,0.000012240541],"category_scores_gemma":[0.000009270541,0.00007153858,0.00006199773,0.0007326938,0.00010027318,0.0001905418,0.00005660384,0.00035180713,1.9057266e-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.00001956779,0.000026958622,0.00064950954,0.00003122699,0.0011405888,0.0000030215454,0.00062421546,0.92881346,0.00038546362,0.020239592,0.0003152033,0.047751214],"study_design_scores_gemma":[0.000111764566,0.00004924496,0.0010936983,0.00015043074,0.00045872675,0.000021320047,0.00005237334,0.9949045,0.00009621901,0.0005104632,0.0024710195,0.000080218095],"about_ca_topic_score_codex":0.000005199682,"about_ca_topic_score_gemma":0.00001427952,"teacher_disagreement_score":0.8990361,"about_ca_system_score_codex":0.000043036172,"about_ca_system_score_gemma":0.000015108064,"threshold_uncertainty_score":0.29172587},"labels":[],"label_agreement":null}]}