{"meta":{"query_hash":"a123376d5e9f","filters":{"venue":"Peer-to-Peer Networking and Applications"},"cohort_total":93,"direct_labels_cover":0,"predictions_cover":93,"exported":93,"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/a123376d5e9f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Peer-to-Peer+Networking+and+Applications"},"results":[{"id":"W1952462664","doi":"10.1007/s12083-015-0380-9","title":"Taking a free ride for routing topology inference in peer-to-peer networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Network topology; Network tomography; Routing (electronic design automation); Routing table; Distributed computing; Topology (electrical circuits); Computer network; Host (biology); Internet topology; Logical topology; The Internet; Peer-to-peer; Synchronization (alternating current); Routing protocol; Static routing; Engineering","score_opus":0.0513139108326722,"score_gpt":0.32470868129179836,"score_spread":0.2733947704591262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952462664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009195506,0.00024496796,0.8828282,0.100203246,0.0010886525,0.002769317,0.00004601537,0.0012142673,0.002409873],"genre_scores_gemma":[0.77628404,0.000009702933,0.21095149,0.0044411696,0.0016799662,0.003481149,0.00006210513,0.00009295451,0.0029974012],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928567,0.0001400121,0.0011432042,0.0021262341,0.0015560068,0.0021778704],"domain_scores_gemma":[0.9923802,0.0013403454,0.00037600423,0.0026265734,0.0021048982,0.0011719969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041061584,0.00076299644,0.0009192349,0.0009327678,0.0006900935,0.00087306934,0.004208638,0.000489178,0.000005639602],"category_scores_gemma":[0.004050732,0.0008306547,0.00015078949,0.004389441,0.00014909497,0.00037900024,0.0033150907,0.0009038694,0.000121840916],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095414245,0.00022762442,0.015255025,0.000031541964,0.0000879202,0.000022790928,0.004865668,0.3204254,0.00015900464,0.091951855,0.16765802,0.39921975],"study_design_scores_gemma":[0.0011672314,0.00040462226,0.005671462,0.00024703244,0.000048936152,0.000040085233,0.0005281413,0.1895832,0.00013845386,0.025528856,0.77511597,0.0015259964],"about_ca_topic_score_codex":0.0005373615,"about_ca_topic_score_gemma":0.0014202094,"teacher_disagreement_score":0.76708853,"about_ca_system_score_codex":0.00034629175,"about_ca_system_score_gemma":0.00023205305,"threshold_uncertainty_score":0.99941444},"labels":[],"label_agreement":null},{"id":"W1974835369","doi":"10.1007/s12083-009-0031-0","title":"DAg-stream: Distributed video adaptation for overlay streaming to heterogeneous devices","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Adaptation (eye); Metadata; Content adaptation; Overlay network; Distributed computing; Server; Scalability; Computer network; Mobile device; Multimedia; Ubiquitous computing; The Internet; World Wide Web; Operating system","score_opus":0.02397491502197232,"score_gpt":0.2813579684451634,"score_spread":0.2573830534231911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974835369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013628509,0.0002076941,0.94135493,0.040994585,0.00023706512,0.0020280976,0.00014300243,0.001130113,0.0002759882],"genre_scores_gemma":[0.8097902,0.0000093620865,0.184689,0.0029199221,0.00061266625,0.0013057496,0.00016462397,0.000032554442,0.00047593185],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965739,0.00003687591,0.00053712644,0.0012563934,0.0006580771,0.0009376136],"domain_scores_gemma":[0.997152,0.0003362609,0.00015429615,0.0012046047,0.0005769512,0.0005759442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551033,0.00042834264,0.00040990184,0.00035578234,0.00065930065,0.0006482094,0.0014824409,0.00016837718,0.0000017837731],"category_scores_gemma":[0.0001755112,0.00045477733,0.000101860496,0.0021225514,0.00003220619,0.0002279288,0.00045666128,0.00020242805,0.00006983519],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026305452,0.000103937076,0.0003396002,0.00001236706,0.000038495178,0.000003675496,0.0007537805,0.12628482,0.00062513945,0.0070744976,0.033044957,0.8316924],"study_design_scores_gemma":[0.0003406774,0.00046344072,0.004715193,0.00012773745,0.00004932948,0.0000259363,0.00014141698,0.077153765,0.0008854859,0.005875937,0.9093707,0.00085037143],"about_ca_topic_score_codex":0.000055645407,"about_ca_topic_score_gemma":0.00018909863,"teacher_disagreement_score":0.8763257,"about_ca_system_score_codex":0.00015596994,"about_ca_system_score_gemma":0.00005644408,"threshold_uncertainty_score":0.9997904},"labels":[],"label_agreement":null},{"id":"W1977012208","doi":"10.1007/s12083-015-0331-5","title":"A reliable QoS-aware routing scheme for neighbor area network in smart grid","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":52,"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 network; Computer science; Dynamic Source Routing; Wireless mesh network; Distributed computing; Routing protocol; Hazy Sighted Link State Routing Protocol; Zone Routing Protocol; Static routing; Link-state routing protocol; Network packet; Wireless network; Wireless; Telecommunications","score_opus":0.02833913441444281,"score_gpt":0.2575506896087158,"score_spread":0.229211555194273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977012208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16580276,0.004395247,0.7801918,0.014277576,0.0074556475,0.0070912377,0.00020359861,0.002251813,0.018330319],"genre_scores_gemma":[0.97860396,0.000051436404,0.012412487,0.00052366045,0.005562027,0.0017148934,0.00012359023,0.00007397683,0.0009339647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836046,0.000011253017,0.0003269859,0.00039541535,0.0002742016,0.0006316889],"domain_scores_gemma":[0.99892896,0.00014796619,0.00003706674,0.00033610887,0.00019410186,0.00035576455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746753,0.00021677034,0.00025703132,0.00009617907,0.00023385535,0.000114041264,0.00024858638,0.00012218165,0.00000357294],"category_scores_gemma":[0.0000606573,0.00022917705,0.00004765096,0.00083755143,0.000028419958,0.00008312358,0.00009180279,0.00024769202,0.000034634944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031949356,0.000051269264,0.018305408,0.000063866624,0.000029598135,0.0000022417853,0.0011521134,0.68810856,0.00011446168,0.0018189327,0.2826142,0.007707422],"study_design_scores_gemma":[0.00034117507,0.000031619595,0.0014106005,0.0001268234,0.000013771825,0.0000055605396,0.00019446932,0.1932733,0.000044451757,0.0006764826,0.80356205,0.0003197116],"about_ca_topic_score_codex":0.000053887034,"about_ca_topic_score_gemma":0.00015850345,"teacher_disagreement_score":0.8128012,"about_ca_system_score_codex":0.00008121191,"about_ca_system_score_gemma":0.00003502402,"threshold_uncertainty_score":0.9345569},"labels":[],"label_agreement":null},{"id":"W1977680444","doi":"10.1007/s12083-012-0136-8","title":"A social network approach to trust management in VANETs","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Voting; Simple (philosophy); Wireless ad hoc network; Scheme (mathematics); Path (computing); Event (particle physics); Computer security; Computer network; Wireless; Algorithm; Telecommunications; Mathematics","score_opus":0.016690978498574028,"score_gpt":0.2533627878151253,"score_spread":0.23667180931655124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977680444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07711587,0.0030312848,0.71054876,0.0063821343,0.0016338316,0.008376415,0.000044878216,0.0019875395,0.19087929],"genre_scores_gemma":[0.96839595,0.00003524004,0.021918867,0.00078165444,0.00472387,0.0023504386,0.000103236576,0.00011020821,0.0015805275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974778,0.000039639177,0.00038021037,0.00045693203,0.00044205604,0.0012033258],"domain_scores_gemma":[0.99890894,0.000048998285,0.000034506305,0.00041911387,0.00005942173,0.00052904605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007797392,0.00033177104,0.00033251045,0.00018424496,0.00027996078,0.00012142612,0.00033634223,0.00014364872,0.000008410947],"category_scores_gemma":[0.000005759479,0.00038244657,0.00006433392,0.0014090368,0.000023652892,0.00008392998,0.0002045749,0.0003315444,0.00019062973],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074835116,0.00006949998,0.0015225121,0.0000319561,0.000055569177,0.0000011316711,0.0008077075,0.84195065,0.000009527067,0.004905617,0.09370418,0.05693419],"study_design_scores_gemma":[0.00024244713,0.000011194914,0.010905002,0.000037277983,0.000048742866,0.000008569719,0.0001088076,0.09639108,0.0000034206798,0.000382759,0.8913777,0.0004829952],"about_ca_topic_score_codex":0.000015915699,"about_ca_topic_score_gemma":0.000028086868,"teacher_disagreement_score":0.8912801,"about_ca_system_score_codex":0.00014946451,"about_ca_system_score_gemma":0.000006833581,"threshold_uncertainty_score":0.99986273},"labels":[],"label_agreement":null},{"id":"W1978322408","doi":"10.1007/s12083-010-0083-1","title":"Optimizing BitTorrent-like peer-to-peer systems in the presence of network address translation devices","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Southeast University; British Columbia Knowledge Development Fund; University of Victoria","keywords":"BitTorrent; Computer science; Network address translation; Computer network; The Internet; NAT traversal; Peer-to-peer; Distributed computing; File sharing; Cover (algebra); World Wide Web; Internet Protocol","score_opus":0.03020005677212293,"score_gpt":0.2839757314842452,"score_spread":0.25377567471212226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978322408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041574463,0.0015451909,0.86259514,0.08048122,0.003310987,0.006095132,0.000082145845,0.0011737664,0.003141966],"genre_scores_gemma":[0.8890957,0.000022406084,0.10459419,0.0012240924,0.0015296233,0.002448341,0.00005481987,0.00006372045,0.00096707157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99368936,0.00021022433,0.0010666172,0.001467089,0.002233948,0.0013327365],"domain_scores_gemma":[0.99456143,0.0011064861,0.00032577902,0.0022860344,0.0012316443,0.000488605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040288307,0.00059307826,0.00068396097,0.0006075444,0.0006710781,0.0009077698,0.0040560206,0.00034631704,0.0000043719547],"category_scores_gemma":[0.0002850882,0.000527574,0.00013262907,0.00499612,0.00015113883,0.0004102937,0.00086022314,0.0010010367,0.00007052457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006392951,0.00032860308,0.008542703,0.00013241841,0.00010708381,0.000012771639,0.011533448,0.5384221,0.0019505757,0.02952676,0.12762043,0.28175914],"study_design_scores_gemma":[0.00037061164,0.00014249538,0.0066627767,0.0003242726,0.00005234722,0.00003506196,0.00051930913,0.07133214,0.00013925669,0.0010909152,0.9184899,0.00084093865],"about_ca_topic_score_codex":0.00039778597,"about_ca_topic_score_gemma":0.0010573476,"teacher_disagreement_score":0.84752125,"about_ca_system_score_codex":0.00006974749,"about_ca_system_score_gemma":0.000103165126,"threshold_uncertainty_score":0.9997176},"labels":[],"label_agreement":null},{"id":"W1979833825","doi":"10.1007/s12083-011-0109-3","title":"Towards an effective integration of cellular users to the structured Peer-to-Peer network","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Chord (peer-to-peer); Computer network; Computer science; Upload; Cellular network; Base station; The Internet; Peer-to-peer; Distributed computing; Network topology; World Wide Web","score_opus":0.018456046687856296,"score_gpt":0.27691235525684055,"score_spread":0.25845630856898427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979833825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05162343,0.00029025908,0.88692737,0.05338978,0.001529404,0.0041731023,0.000071458555,0.00087599776,0.001119186],"genre_scores_gemma":[0.8542505,0.0000067464143,0.13591145,0.003036092,0.002747025,0.002291348,0.000095729956,0.00008559467,0.0015755068],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937828,0.00026732485,0.00082770205,0.0014353537,0.0020286539,0.0016581626],"domain_scores_gemma":[0.9937186,0.0004246726,0.0002724116,0.0026658995,0.0017525926,0.001165806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034107172,0.00073113054,0.0007399237,0.0005298362,0.00090238376,0.0006010822,0.0032045152,0.00034401994,0.000010364337],"category_scores_gemma":[0.00052681554,0.00061587035,0.00017436626,0.0049126386,0.00013259085,0.00047867783,0.001344968,0.0007242886,0.00018845688],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008103152,0.00019877145,0.0028190478,0.000024859446,0.00014914684,0.0000025871166,0.010113992,0.08421324,0.0054124543,0.037966214,0.17689838,0.68212026],"study_design_scores_gemma":[0.00036957214,0.00053767924,0.02849961,0.00015554283,0.000120500896,0.000021830847,0.00061438256,0.011022042,0.0064259246,0.005922729,0.9450749,0.0012352685],"about_ca_topic_score_codex":0.00026272362,"about_ca_topic_score_gemma":0.00034991917,"teacher_disagreement_score":0.8026271,"about_ca_system_score_codex":0.00025608385,"about_ca_system_score_gemma":0.000086035354,"threshold_uncertainty_score":0.99962926},"labels":[],"label_agreement":null},{"id":"W1990417591","doi":"10.1007/s12083-015-0345-z","title":"Energy-efficient routing over coordinated sleep scheduling in wireless ad hoc networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Distributed computing; Wireless Routing Protocol; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Routing protocol; Routing (electronic design automation)","score_opus":0.017357168115842543,"score_gpt":0.25704727503097685,"score_spread":0.23969010691513432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990417591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032338776,0.0011881316,0.96095234,0.0027782843,0.00055865466,0.0006514575,0.0000028710535,0.00037077305,0.0011587311],"genre_scores_gemma":[0.98047334,0.00003772928,0.016201995,0.0010602917,0.0009057992,0.00074234634,0.000031040767,0.00004849144,0.0004989699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966333,0.00011555524,0.00057507935,0.0010643516,0.0006660916,0.00094562856],"domain_scores_gemma":[0.99752694,0.0002454726,0.00017135436,0.0009413425,0.00043097505,0.00068392704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014742276,0.000355387,0.00039111904,0.00023711375,0.0003507127,0.0004604759,0.0010331084,0.000190174,0.0000029082044],"category_scores_gemma":[0.00003834504,0.0003835613,0.00006573253,0.0026644364,0.000054671716,0.00015025577,0.00080049,0.0004498987,0.00002815319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009965362,0.00007412285,0.0012925,0.0000030024328,0.000013059146,0.0000050792382,0.0004379211,0.7284087,0.000021099613,0.016441718,0.0020201996,0.25127262],"study_design_scores_gemma":[0.00042956843,0.000041172272,0.0006998732,0.000089987574,0.000011309584,0.000010392431,0.000067431334,0.8910797,0.000016911732,0.00056312344,0.10657536,0.00041512048],"about_ca_topic_score_codex":0.00008629761,"about_ca_topic_score_gemma":0.000117314215,"teacher_disagreement_score":0.94813454,"about_ca_system_score_codex":0.00019325948,"about_ca_system_score_gemma":0.00007581755,"threshold_uncertainty_score":0.99986166},"labels":[],"label_agreement":null},{"id":"W1991277203","doi":"10.1007/s12083-009-0032-z","title":"Improving robustness of P2P applications in mobile environments","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Redundancy (engineering); Distributed computing; Robustness (evolution); Exploit; Computer network; Computer security; Operating system","score_opus":0.011373719621234525,"score_gpt":0.2512774903335184,"score_spread":0.23990377071228391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991277203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021518476,0.00037248703,0.9684196,0.006295743,0.00010637935,0.0022241613,0.000016547603,0.00038531658,0.00066129543],"genre_scores_gemma":[0.8647807,0.000036829413,0.13049394,0.00053139776,0.0003188334,0.0028861023,0.000028413458,0.000028193555,0.0008955439],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971034,0.00003622109,0.00057682453,0.0009872656,0.0006152957,0.00068097044],"domain_scores_gemma":[0.9977932,0.00015664054,0.00016973981,0.0014361753,0.00013505066,0.0003092235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006314308,0.0003189777,0.0003953513,0.00046804323,0.0002744339,0.00015670982,0.0016844983,0.00015833967,0.000002427211],"category_scores_gemma":[0.000041676576,0.00034230703,0.000064761225,0.0024273575,0.0000696103,0.00018605223,0.0006490919,0.0002989429,0.000038557846],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007001666,0.0002835011,0.0017045321,0.000015315418,0.0000144553,0.0000013663047,0.00054180756,0.1304972,0.0028722817,0.0093044005,0.0033630473,0.8513951],"study_design_scores_gemma":[0.0005879555,0.00035737047,0.021485718,0.00013144549,0.000039995488,0.000016558393,0.0003053326,0.059097014,0.0025320246,0.0062387497,0.90799934,0.0012085137],"about_ca_topic_score_codex":0.000034485947,"about_ca_topic_score_gemma":0.000029426315,"teacher_disagreement_score":0.90463626,"about_ca_system_score_codex":0.00011771785,"about_ca_system_score_gemma":0.00003982555,"threshold_uncertainty_score":0.9999029},"labels":[],"label_agreement":null},{"id":"W1991501433","doi":"10.1007/s12083-013-0237-z","title":"PPNA special issue on “the green, reliability and security of machine-to-machine communications”","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Machine to machine; Wireless sensor network; Wireless; Smart grid; Computer security; Reliability (semiconductor); Wireless network; Software deployment; Personal Communications Service; Telecommunications; Computer network; Engineering; Wi-Fi array; Internet of Things","score_opus":0.010088788947383662,"score_gpt":0.2351475465266761,"score_spread":0.22505875757929245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991501433","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.45205233,0.0054488163,0.13705447,0.28498352,0.0017750548,0.019035352,0.0008274261,0.002056877,0.09676618],"genre_scores_gemma":[0.99061555,0.00013404422,0.004305458,0.0009293533,0.00231441,0.0009107985,0.000078755664,0.00005904732,0.0006525645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.998406,0.00007410603,0.00040787808,0.00038300428,0.00034980063,0.00037922955],"domain_scores_gemma":[0.9976275,0.00036709913,0.000058697195,0.0013879488,0.00023210526,0.0003266706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063217,0.00026169463,0.00030113372,0.000097546195,0.00033572142,0.000096149684,0.00057476526,0.00010316871,0.0000794563],"category_scores_gemma":[0.000053880343,0.00023105845,0.000054369477,0.00063161674,0.00011330788,0.00005940938,0.00032437666,0.0004505116,0.0001850538],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031145682,0.00024272718,0.004462216,0.00013763882,0.00013800546,8.263432e-7,0.0032718682,0.42668074,0.00036118436,0.0105963545,0.26260343,0.29147387],"study_design_scores_gemma":[0.000120787525,0.00003529803,0.0032473402,0.000044049662,0.000026278747,0.0000040390387,0.000037150767,0.22258367,0.000039790415,0.0019398574,0.7716903,0.00023141976],"about_ca_topic_score_codex":0.00043934223,"about_ca_topic_score_gemma":0.00037680136,"teacher_disagreement_score":0.53856325,"about_ca_system_score_codex":0.00005269436,"about_ca_system_score_gemma":0.000010259673,"threshold_uncertainty_score":0.94222903},"labels":[],"label_agreement":null},{"id":"W2000206219","doi":"10.1007/s12083-012-0147-5","title":"Classifying peer-to-peer applications using imbalanced concept-adapting very fast decision tree on IP data stream","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Decision tree; Data stream; Concept drift; Data mining; Class (philosophy); Resampling; Data stream mining; Peer-to-peer; Streaming data; Machine learning; Tree (set theory); The Internet; Artificial intelligence; Computer network; World Wide Web","score_opus":0.05581329026549677,"score_gpt":0.31974182587593625,"score_spread":0.2639285356104395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000206219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012189072,0.00025550395,0.97906345,0.0048028077,0.0004715921,0.0010526237,0.00008355075,0.0003460641,0.0017353144],"genre_scores_gemma":[0.8937409,0.000006509514,0.100127496,0.0011422107,0.0027200135,0.00034496226,0.00026629548,0.00006039259,0.0015911992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947645,0.00010259496,0.00083600526,0.0015135093,0.0016377097,0.0011456624],"domain_scores_gemma":[0.99563444,0.0006093142,0.00030770712,0.0017657175,0.00087579526,0.00080705166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020716558,0.0005111194,0.0005549721,0.00036990945,0.0011646409,0.0008186661,0.0022583988,0.0001882909,0.000013732784],"category_scores_gemma":[0.00021478818,0.0005062327,0.00014401086,0.0018195127,0.000072563045,0.00052105205,0.0012534058,0.0005346646,0.00020580983],"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.000026012633,0.0003402003,0.0014881376,0.000018465593,0.00013738837,0.0000024065762,0.0031742097,0.11940477,0.0003800999,0.054106757,0.02825362,0.7926679],"study_design_scores_gemma":[0.0002870181,0.000051673498,0.0011469886,0.00016748243,0.00009133987,0.000017383756,0.00045804543,0.55472106,0.000058884718,0.000083130646,0.442282,0.0006350047],"about_ca_topic_score_codex":0.0000605059,"about_ca_topic_score_gemma":0.000087910514,"teacher_disagreement_score":0.88155186,"about_ca_system_score_codex":0.00018628067,"about_ca_system_score_gemma":0.000083505125,"threshold_uncertainty_score":0.99973893},"labels":[],"label_agreement":null},{"id":"W2003261281","doi":"10.1007/s12083-013-0223-5","title":"Peer startup process and initial offset placement in peer-to-peer (P2P) live streaming systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Offset (computer science); Computer science; Joins; Buffer (optical fiber); Peer-to-peer; Computer network; Scheme (mathematics); Real-time computing; Distributed computing; Operating system; Telecommunications; Mathematics","score_opus":0.0196219231650188,"score_gpt":0.28327910681683477,"score_spread":0.26365718365181595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003261281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27926213,0.0008133243,0.51968145,0.17931843,0.0017464547,0.011108594,0.00028987654,0.0024489707,0.0053307707],"genre_scores_gemma":[0.95593286,0.000019984505,0.024838995,0.0018470637,0.001111222,0.006108836,0.00014158654,0.00010099131,0.009898441],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99207705,0.0001425355,0.0011293038,0.00211599,0.00282903,0.0017061146],"domain_scores_gemma":[0.9936175,0.00049156643,0.00028354384,0.0016903459,0.0028576467,0.001059398],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023255232,0.0008347293,0.00086408254,0.00096538546,0.00074734224,0.0017188055,0.0021404317,0.00037839919,0.00002147156],"category_scores_gemma":[0.0005310639,0.0008548647,0.000090703565,0.002972648,0.00015376208,0.000621198,0.0017545761,0.00081897,0.0004921383],"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.00009964979,0.00070282695,0.015435556,0.00027457307,0.0002364946,0.000049122325,0.020195981,0.0741865,0.0005308599,0.014484713,0.50091016,0.37289357],"study_design_scores_gemma":[0.0014277978,0.00066863146,0.009663768,0.000719072,0.00008760709,0.00010312016,0.005131326,0.09884386,0.00029788385,0.004443439,0.87612444,0.0024890774],"about_ca_topic_score_codex":0.0008625682,"about_ca_topic_score_gemma":0.00041683504,"teacher_disagreement_score":0.67667073,"about_ca_system_score_codex":0.00030925285,"about_ca_system_score_gemma":0.00016461303,"threshold_uncertainty_score":0.9993902},"labels":[],"label_agreement":null},{"id":"W2005930142","doi":"10.1007/s12083-008-0025-3","title":"XCube: Processing XPath queries in a hypercube overlay network","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bit array; Information retrieval; XPath; Identifier; XML; Node (physics); Matching (statistics); Data mining; Database; XML database; World Wide Web; Computer network","score_opus":0.013718367285484636,"score_gpt":0.26826220524935623,"score_spread":0.2545438379638716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005930142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02372689,0.0016597419,0.8670215,0.09603711,0.00045679533,0.0021694559,0.000012386409,0.0023174325,0.006598655],"genre_scores_gemma":[0.83761686,0.00004489775,0.15361878,0.0053556967,0.0011691618,0.0008094061,0.000016580103,0.000041223346,0.0013273784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99587554,0.00006375321,0.00062476617,0.0013246171,0.00082025706,0.0012910854],"domain_scores_gemma":[0.99758565,0.00016893045,0.00013889841,0.0012784107,0.0003605776,0.00046752035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011038216,0.00047903616,0.00053196534,0.00043278813,0.0006204255,0.00072881824,0.0017428504,0.00022358603,0.0000028516868],"category_scores_gemma":[0.00012324771,0.00049806555,0.000076007236,0.004440742,0.0000806164,0.0003799765,0.00055842235,0.0005261104,0.00009282489],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019956919,0.00013220511,0.0041641016,0.00001575249,0.000013792294,0.000015332045,0.0015505775,0.03434463,0.00033857522,0.027055174,0.054515135,0.8778348],"study_design_scores_gemma":[0.00034617973,0.00023063207,0.03250479,0.0003058003,0.000020879614,0.000055483502,0.00014110465,0.020877108,0.00012913083,0.02500873,0.9193167,0.0010634277],"about_ca_topic_score_codex":0.000051995194,"about_ca_topic_score_gemma":0.00013017273,"teacher_disagreement_score":0.87677133,"about_ca_system_score_codex":0.00015562489,"about_ca_system_score_gemma":0.0001088307,"threshold_uncertainty_score":0.9997471},"labels":[],"label_agreement":null},{"id":"W2009354338","doi":"10.1007/s12083-012-0168-0","title":"On the collaboration of different peer-to-peer traffic management schemas","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; BitTorrent; Scalability; Distributed computing; Computer network; Cache; Heuristic; Peer-to-peer; The Internet; Implementation; Internet traffic; World Wide Web","score_opus":0.020068551019963063,"score_gpt":0.25848583289943694,"score_spread":0.23841728187947386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009354338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3385793,0.0002709787,0.5249135,0.12408638,0.001101081,0.0025744943,0.000038904807,0.00037705342,0.008058329],"genre_scores_gemma":[0.9857105,0.000011139593,0.003122832,0.0017887487,0.00062591914,0.0006911437,0.000026841928,0.00002135442,0.008001534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754435,0.00007321458,0.0003366865,0.0004901752,0.0010881309,0.00046744777],"domain_scores_gemma":[0.99792504,0.00023685685,0.00010729679,0.00087865215,0.00054441893,0.00030770406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280408,0.00024184967,0.00023058038,0.00018339125,0.00044784893,0.0002445943,0.0006677863,0.000063721745,0.0000071757136],"category_scores_gemma":[0.000056946214,0.00018949565,0.000075184114,0.0010403742,0.000033449207,0.000117996926,0.00031031627,0.00019478383,0.00011901311],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048279715,0.000719471,0.0010355226,0.000049219572,0.00016895446,0.0000017632467,0.0051165367,0.022004735,0.0010091332,0.47752377,0.20858446,0.28373817],"study_design_scores_gemma":[0.00043888655,0.00017246396,0.005931841,0.00015298615,0.00009164937,0.0000073280994,0.00069836015,0.025577001,0.000500939,0.0011973513,0.96461457,0.0006166221],"about_ca_topic_score_codex":0.0000149239895,"about_ca_topic_score_gemma":0.000015811558,"teacher_disagreement_score":0.75603014,"about_ca_system_score_codex":0.00007005197,"about_ca_system_score_gemma":0.000017970253,"threshold_uncertainty_score":0.77274084},"labels":[],"label_agreement":null},{"id":"W2023093146","doi":"10.1007/s12083-014-0258-2","title":"A taxonomy of decentralized online social networks","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decentralization; Autonomy; Computer science; Architecture; Taxonomy (biology); Peer-to-peer; Cloud computing; Set (abstract data type); Control (management); Internet privacy; World Wide Web; Data science; Political science; Artificial intelligence","score_opus":0.027402669239488205,"score_gpt":0.27056741082156727,"score_spread":0.24316474158207907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023093146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060575926,0.00016993977,0.9632395,0.027034357,0.00030930873,0.0012437965,0.000021858965,0.0007423898,0.00118124],"genre_scores_gemma":[0.7765584,0.000028099279,0.21777497,0.0023364087,0.0013179615,0.0011705582,0.000051119525,0.000042974883,0.00071948563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99687463,0.00008431554,0.0006015697,0.0009219458,0.0006421986,0.0008753382],"domain_scores_gemma":[0.9975031,0.00028680958,0.000207471,0.0010791646,0.0005061621,0.0004172823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088993454,0.000361007,0.00053804595,0.00030650187,0.00045346684,0.00023224369,0.0018134456,0.00020670338,0.0000048196985],"category_scores_gemma":[0.00012250549,0.0003774073,0.000114504706,0.002262956,0.00011338262,0.00012761712,0.0010264177,0.00034792314,0.00004321569],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021044714,0.00017922492,0.0017814608,0.000016675685,0.00005794043,0.0000011579041,0.00042680325,0.020807011,0.0001792241,0.055354897,0.08531863,0.8358559],"study_design_scores_gemma":[0.00034505466,0.00009398593,0.0040119374,0.000047624886,0.000028387325,0.000007271714,0.000041859414,0.05516001,0.00008836808,0.0030895458,0.93662757,0.00045837654],"about_ca_topic_score_codex":0.00005137845,"about_ca_topic_score_gemma":0.000076091106,"teacher_disagreement_score":0.85130894,"about_ca_system_score_codex":0.00006912693,"about_ca_system_score_gemma":0.000047186022,"threshold_uncertainty_score":0.9998678},"labels":[],"label_agreement":null},{"id":"W2024118014","doi":"10.1007/s12083-008-0022-6","title":"Exploiting unlabeled data to improve peer-to-peer traffic classification using incremental tri-training method","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Traffic classification; Heuristic; Network packet; Peer-to-peer; The Internet; Data mining; Machine learning; Internet traffic; Labeled data; Artificial intelligence; Data stream; Layer (electronics); Distributed computing; Computer network; World Wide Web","score_opus":0.10768934204858785,"score_gpt":0.3536290759107938,"score_spread":0.24593973386220594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024118014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045581974,0.00005765876,0.92813057,0.023605952,0.00034584105,0.0011624661,0.000044745506,0.00038929866,0.0006814671],"genre_scores_gemma":[0.7238517,0.0000019898303,0.27098554,0.0024800277,0.001338296,0.00015429269,0.0001866395,0.000038258055,0.0009632688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944119,0.00017691222,0.0009823211,0.0019064905,0.0015042033,0.0010181804],"domain_scores_gemma":[0.99637604,0.0003107269,0.00029347723,0.001316222,0.0009791912,0.000724355],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0043618456,0.00048741477,0.0005943449,0.00051765115,0.0009225342,0.0010790374,0.0021711001,0.00016040876,0.000009800411],"category_scores_gemma":[0.0003505143,0.00051369064,0.0001276127,0.002473427,0.000029947778,0.00044785376,0.0007456782,0.00047915397,0.00008294881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027040393,0.00018745064,0.000050870007,0.000014450156,0.000117084644,0.0000048409083,0.009673499,0.101778656,0.011233991,0.026480913,0.012650386,0.83778083],"study_design_scores_gemma":[0.00032469782,0.00012307517,0.00028960296,0.000101045836,0.000100317564,0.000019887295,0.0015026194,0.8604417,0.00019057519,0.00005870958,0.13621083,0.00063697505],"about_ca_topic_score_codex":0.000049100472,"about_ca_topic_score_gemma":0.00007025486,"teacher_disagreement_score":0.83714384,"about_ca_system_score_codex":0.00020393427,"about_ca_system_score_gemma":0.000117751064,"threshold_uncertainty_score":0.9999579},"labels":[],"label_agreement":null},{"id":"W2028009605","doi":"10.1007/s12083-014-0292-0","title":"MuDA: Multifunctional data aggregation in privacy-preserving smart grid communications","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Smart grid; Data aggregator; Differential privacy; Computer science; Overhead (engineering); Scheme (mathematics); Information privacy; Computer security; Computer network; Data mining; Engineering; Wireless sensor network","score_opus":0.06295727494621317,"score_gpt":0.3119676628443532,"score_spread":0.24901038789814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028009605","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.0015094037,0.00024902853,0.82023937,0.17442799,0.00036696732,0.0007788509,0.00008308525,0.0006994624,0.0016458543],"genre_scores_gemma":[0.30033693,0.00012098183,0.69574875,0.0011320355,0.0006104607,0.0008365583,0.0008811124,0.00003451736,0.00029867006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972136,0.00013857972,0.00048777452,0.0010741579,0.0005918845,0.0004939953],"domain_scores_gemma":[0.97881854,0.000772822,0.00015376635,0.019762024,0.0002920569,0.00020082385],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020169455,0.0002352605,0.00024210812,0.00033525773,0.00057785626,0.00040000136,0.03224463,0.00013561478,0.0000053902077],"category_scores_gemma":[0.007633956,0.00025876673,0.000029560533,0.0016609862,0.000111929694,0.000652472,0.10049195,0.00048000453,0.00010009667],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006519949,0.00017583546,0.013102736,0.000023846358,0.000028034292,7.658163e-7,0.0002605582,0.0007985106,0.00016086646,0.015196227,0.43762025,0.53262585],"study_design_scores_gemma":[0.00015652996,0.0000145129125,0.0070663067,0.000058695525,0.0000069184216,0.0000056337385,0.000017301963,0.38706845,0.000024725463,0.029713672,0.57565385,0.0002134254],"about_ca_topic_score_codex":0.00025125922,"about_ca_topic_score_gemma":0.00034947862,"teacher_disagreement_score":0.5324124,"about_ca_system_score_codex":0.00009334078,"about_ca_system_score_gemma":0.00005576076,"threshold_uncertainty_score":0.99998647},"labels":[],"label_agreement":null},{"id":"W2036147040","doi":"10.1007/s12083-009-0054-6","title":"Popularity-aware prefetch in P2P range caching","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instruction prefetch; Computer science; Popularity; Range query (database); Query optimization; Range (aeronautics); Query expansion; Database; Information retrieval; Web search query; Web query classification; Distributed computing; Computer network; Search engine; Cache","score_opus":0.019190802447744515,"score_gpt":0.26918965072567247,"score_spread":0.24999884827792795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036147040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07268629,0.00052586995,0.87795633,0.04349503,0.00031588905,0.0009315486,0.0000111851095,0.0004879494,0.0035898914],"genre_scores_gemma":[0.99247557,0.000013781082,0.003095267,0.002499093,0.00044029974,0.00014289476,0.000016395175,0.000010777991,0.0013059492],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983484,0.00005163458,0.0002592231,0.00056653324,0.00037538444,0.00039879128],"domain_scores_gemma":[0.99896383,0.000071169685,0.00004918243,0.0005760032,0.000121588935,0.00021819379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006066344,0.00017187106,0.00019998493,0.00018616409,0.0003200055,0.0002910016,0.0006054803,0.00007086066,0.0000013900124],"category_scores_gemma":[0.000023260225,0.00018024335,0.000051641062,0.00076263363,0.000011835978,0.0001544893,0.00017099826,0.00029423836,0.000036705744],"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.000021111622,0.00028615422,0.022574646,0.000018911018,0.000021710537,0.00001759826,0.002271689,0.015967688,0.0005959691,0.032887936,0.013863766,0.9114728],"study_design_scores_gemma":[0.0012534168,0.00022716542,0.11342258,0.0003371592,0.000043952936,0.00007250556,0.00019002399,0.16613774,0.00005589196,0.017714724,0.699056,0.001488803],"about_ca_topic_score_codex":0.00029829724,"about_ca_topic_score_gemma":0.00011865916,"teacher_disagreement_score":0.91978925,"about_ca_system_score_codex":0.000053167543,"about_ca_system_score_gemma":0.00002289755,"threshold_uncertainty_score":0.73501104},"labels":[],"label_agreement":null},{"id":"W2037186450","doi":"10.1007/s12083-009-0040-z","title":"Editorial: Special issue on mobile P2P networking and computing","year":2009,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Server; Distributed computing; Mobile computing; Multicast; Scalability; Overlay network; Shared resource; The Internet; World Wide Web; Operating system","score_opus":0.008716586641333486,"score_gpt":0.2768795556822618,"score_spread":0.2681629690409283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037186450","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003826631,0.00066240365,0.07835566,0.007484116,0.9037917,0.0028253656,0.00008903848,0.0019442394,0.004809154],"genre_scores_gemma":[0.0006878467,0.00024192821,0.026582599,0.00084098574,0.96763265,0.0008649703,0.00021951775,0.00015095859,0.0027785173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99094903,0.000152773,0.001127511,0.0030058527,0.0029241405,0.0018407066],"domain_scores_gemma":[0.99315435,0.0018846821,0.0005046942,0.0023554452,0.0011599947,0.00094084645],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0021853459,0.0012360325,0.0013318274,0.0008169376,0.0013848739,0.0019505338,0.0034063053,0.0015021503,0.000006078566],"category_scores_gemma":[0.0004426791,0.0013495098,0.00018406245,0.002788178,0.00016190705,0.00021708559,0.002507524,0.0023889635,0.00027862692],"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.000017661408,0.00005702522,0.000010700212,0.000018789067,0.000036216832,0.000004797016,0.00033690152,0.0044173035,0.0000049686373,0.0005360527,0.66686124,0.32769838],"study_design_scores_gemma":[0.00038339826,0.00046358496,0.0000391493,0.00048834493,0.00006789761,0.000007644806,0.000044321147,0.0026073453,0.0000106587995,0.0021048079,0.9923945,0.0013883577],"about_ca_topic_score_codex":0.000080601036,"about_ca_topic_score_gemma":0.00006185638,"teacher_disagreement_score":0.32631,"about_ca_system_score_codex":0.00035088148,"about_ca_system_score_gemma":0.00021808269,"threshold_uncertainty_score":0.9999152},"labels":[],"label_agreement":null},{"id":"W2037491203","doi":"10.1007/s12083-010-0076-0","title":"Measurement and enhancement of BitTorrent-based video file swarming","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"BitTorrent; Computer science; Swarm behaviour; BitTorrent tracker; Upload; File sharing; The Internet; Computer network; Peer-to-peer; World Wide Web; Artificial intelligence","score_opus":0.019606248683532314,"score_gpt":0.2570765666461239,"score_spread":0.23747031796259158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037491203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023160072,0.00028894193,0.9531492,0.020198122,0.000533953,0.0012708633,0.000042824897,0.0005153719,0.00084065594],"genre_scores_gemma":[0.83409625,0.000008624785,0.16311139,0.00081391085,0.0003438827,0.0012372865,0.000017511507,0.00002479977,0.00034634242],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970959,0.00002995341,0.000464295,0.00084639684,0.0009904845,0.0005729946],"domain_scores_gemma":[0.9975507,0.00017690442,0.00015485902,0.001119896,0.0006232684,0.00037435003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011454751,0.0002906331,0.0003324949,0.00031638346,0.00034132102,0.00021467153,0.0010205875,0.00012001711,0.000018729368],"category_scores_gemma":[0.00018998054,0.00029570994,0.00005402496,0.0012330363,0.00009227643,0.00010450633,0.00067799113,0.00032029432,0.00004377331],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014667966,0.0002150082,0.0015648812,0.000055597757,0.000050170795,0.0000019284075,0.0006128293,0.0017494577,0.03144225,0.007445164,0.09489335,0.8619547],"study_design_scores_gemma":[0.00032708904,0.00016977353,0.0032157945,0.00019415311,0.000030701667,0.0000068087547,0.000049679707,0.015349386,0.01708197,0.0014380919,0.9615715,0.00056502176],"about_ca_topic_score_codex":0.000060252758,"about_ca_topic_score_gemma":0.00011444881,"teacher_disagreement_score":0.8666782,"about_ca_system_score_codex":0.000058280988,"about_ca_system_score_gemma":0.00008387064,"threshold_uncertainty_score":0.9999495},"labels":[],"label_agreement":null},{"id":"W2039305010","doi":"10.1007/s12083-010-0077-z","title":"Sparse structures for searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Flooding (psychology); Scalability; Broadcasting (networking); Gossip; Network topology; Computer network; Graph; Theoretical computer science; Distributed computing; Algorithm","score_opus":0.025124280857080246,"score_gpt":0.2963310891151496,"score_spread":0.27120680825806937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039305010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21185164,0.0003313879,0.7661302,0.016313128,0.0011973135,0.0026589197,0.00008283238,0.0010620168,0.00037257816],"genre_scores_gemma":[0.7592356,0.000008325252,0.23644532,0.0010026828,0.0010511829,0.00056955375,0.000040731473,0.000079723344,0.0015668769],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946958,0.00007950805,0.0007537327,0.0018473408,0.0012680663,0.001355549],"domain_scores_gemma":[0.99570847,0.0008735829,0.00023831618,0.0012122652,0.0010378902,0.0009294578],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025031394,0.000650401,0.00068074337,0.00071968656,0.0010393418,0.0020308138,0.0015993603,0.00030232713,0.0000021226242],"category_scores_gemma":[0.000563149,0.0006543484,0.000095283445,0.0016052531,0.00018942333,0.00029685744,0.002225954,0.0009396794,0.000015731484],"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.000040414656,0.00008514347,0.009353082,0.00015684814,0.00016253747,0.00001203079,0.005775759,0.01439462,0.0027821166,0.07682056,0.069876276,0.8205406],"study_design_scores_gemma":[0.0007412537,0.00026222714,0.01232187,0.00028743554,0.00006951335,0.00021326324,0.0004182326,0.35721844,0.0003015802,0.010805571,0.6159829,0.0013777221],"about_ca_topic_score_codex":0.0003764547,"about_ca_topic_score_gemma":0.00016087029,"teacher_disagreement_score":0.8191629,"about_ca_system_score_codex":0.00007173375,"about_ca_system_score_gemma":0.000057923262,"threshold_uncertainty_score":0.99959075},"labels":[],"label_agreement":null},{"id":"W2041088506","doi":"10.1007/s12083-008-0010-x","title":"SUPNET: An end-to-end solution to scalable unstructured P2P networking","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scalability; Computer science; Distributed computing; Protocol (science); Network topology; Computer network; Network dynamics; Network management; End-to-end principle","score_opus":0.02725076734480817,"score_gpt":0.2660315590182152,"score_spread":0.23878079167340702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041088506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03922336,0.00031482268,0.9116745,0.04050651,0.0012848417,0.002476068,0.000044199318,0.002240047,0.0022356766],"genre_scores_gemma":[0.77293116,0.000033378095,0.21590608,0.004707297,0.0026100026,0.0012933731,0.00007881952,0.00009083521,0.0023490335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937344,0.00011637791,0.00079076464,0.0021248867,0.0013684701,0.0018650691],"domain_scores_gemma":[0.9950191,0.0002321471,0.00017488965,0.0024369885,0.0006599036,0.0014769704],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011484087,0.00069645996,0.00067214307,0.0007978637,0.0017208543,0.00066899473,0.0028838941,0.0003300545,0.000016476983],"category_scores_gemma":[0.00011427538,0.0007569917,0.00012347211,0.005396751,0.00014386115,0.00041980445,0.001812913,0.0006016047,0.00041563],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046727157,0.00015881826,0.003791637,0.0000167234,0.00007278057,0.000022463902,0.002893426,0.092533894,0.0025659103,0.009375434,0.18630536,0.7022168],"study_design_scores_gemma":[0.00031577735,0.0002974935,0.009364701,0.00010919053,0.0000342117,0.00012773024,0.00008135057,0.029562159,0.0006305151,0.003426858,0.9548772,0.0011728083],"about_ca_topic_score_codex":0.00029152524,"about_ca_topic_score_gemma":0.00042803414,"teacher_disagreement_score":0.76857185,"about_ca_system_score_codex":0.00028349372,"about_ca_system_score_gemma":0.00013978318,"threshold_uncertainty_score":0.9995788},"labels":[],"label_agreement":null},{"id":"W2044832800","doi":"10.1007/s12083-014-0252-8","title":"Peer-to-peer as an infrastructure service","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; Computer science; Cloud computing; The Internet; File sharing; BitTorrent tracker; Software deployment; Botnet; Peer-to-peer; Service (business); Internet privacy; Service provider; Computer security; World Wide Web; Process (computing); Business","score_opus":0.012793356846929418,"score_gpt":0.2694839227346214,"score_spread":0.256690565887692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044832800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03697714,0.00009007924,0.7017704,0.24659897,0.0010708602,0.0022228404,0.000063287494,0.002827439,0.008378972],"genre_scores_gemma":[0.717406,0.000010358464,0.23554349,0.027990576,0.003106476,0.001885477,0.00016941229,0.00016715862,0.013721079],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99224865,0.00015879249,0.00084882294,0.0024182089,0.0025750306,0.0017504889],"domain_scores_gemma":[0.9912697,0.00037272225,0.00023409618,0.0035999597,0.0028291254,0.0016944022],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022836763,0.00088536274,0.00078394735,0.00077285443,0.0011212102,0.0014075347,0.0047408417,0.00048405287,0.00002860076],"category_scores_gemma":[0.0006063713,0.00091347005,0.00013477966,0.0052312915,0.00010714473,0.00052337267,0.0024803306,0.0009194088,0.0014080283],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036201312,0.00016286757,0.0018723124,0.000037678896,0.00008016524,0.000007964767,0.0036835424,0.03894213,0.0009461437,0.05555104,0.349719,0.548961],"study_design_scores_gemma":[0.00034802605,0.00029145624,0.0065052994,0.00008149701,0.000043577442,0.00006248362,0.0002013582,0.020492874,0.00033582604,0.020256666,0.9502361,0.0011448299],"about_ca_topic_score_codex":0.00028406427,"about_ca_topic_score_gemma":0.00037357426,"teacher_disagreement_score":0.68042886,"about_ca_system_score_codex":0.00019890163,"about_ca_system_score_gemma":0.00014534904,"threshold_uncertainty_score":0.9996291},"labels":[],"label_agreement":null},{"id":"W2052721903","doi":"10.1007/s12083-012-0167-1","title":"Modelling and performance analysis of content sharing and distribution in community networks with infrastructure support","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Community network; Provisioning; The Internet; Content distribution; Download; Cache; Peer-to-peer; File sharing; Computer network; World Wide Web","score_opus":0.03170153117310551,"score_gpt":0.25251367484783216,"score_spread":0.22081214367472665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052721903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47655532,0.00014976459,0.5221252,0.00069274445,0.000026770336,0.00029837212,0.000011603329,0.000083518426,0.00005670094],"genre_scores_gemma":[0.9768416,0.00007785491,0.022495696,0.00016248545,0.000082097904,0.00019517838,0.00007822483,0.000013032318,0.00005378179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983049,0.00004274582,0.00036549097,0.0004279807,0.00032327024,0.00053558336],"domain_scores_gemma":[0.99852395,0.00013025418,0.00012627094,0.00072138174,0.00022394155,0.0002742249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937612,0.00023270295,0.00040334792,0.00033498634,0.0003647541,0.00015047504,0.0005740241,0.00011567393,7.625377e-7],"category_scores_gemma":[0.00002087124,0.00021622774,0.000029309005,0.002495399,0.00009916677,0.00026871555,0.0008134094,0.00043878058,7.903255e-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.000016263455,0.00003916064,0.38784394,0.000017152568,0.00007806376,2.8917825e-7,0.0012136456,0.5614666,0.000012368141,0.0024757166,0.00020896053,0.046627883],"study_design_scores_gemma":[0.00017159952,0.00009969724,0.22838959,0.000069300215,0.00011056583,0.000010418835,0.0001943683,0.76471454,0.000026200993,0.00022725808,0.0057038455,0.00028259837],"about_ca_topic_score_codex":0.00018464464,"about_ca_topic_score_gemma":0.0001063488,"teacher_disagreement_score":0.50028634,"about_ca_system_score_codex":0.000062744126,"about_ca_system_score_gemma":0.000014405734,"threshold_uncertainty_score":0.8817511},"labels":[],"label_agreement":null},{"id":"W2053845484","doi":"10.1007/s12083-015-0334-2","title":"Privacy preserving secure data exchange in mobile P2P cloud healthcare environment","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Saud University; University of Ontario Institute of Technology; University of Guelph","keywords":"Cloud computing; Computer science; Computer security; Data sharing; Data exchange; Cryptography; Protocol (science); Session (web analytics); Key (lock); Key exchange; Health care; Internet privacy; Encryption; Public-key cryptography; World Wide Web","score_opus":0.06793940245675492,"score_gpt":0.31355069160684707,"score_spread":0.24561128915009214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053845484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011158002,0.0057752463,0.9475849,0.031079512,0.00045475506,0.002376683,0.00038758336,0.00029374126,0.0008895676],"genre_scores_gemma":[0.8855636,0.0005204118,0.10655647,0.0020262355,0.0021311957,0.001981639,0.0009796366,0.000040758365,0.00020005483],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783474,0.00007603616,0.00027745115,0.0008636084,0.00051198644,0.00043616307],"domain_scores_gemma":[0.9971594,0.00008738434,0.00006991482,0.0021240024,0.00008354045,0.0004757507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010838606,0.0001779224,0.00019031324,0.00013673374,0.00021160534,0.00022351758,0.0018808612,0.00007780849,0.0000059477684],"category_scores_gemma":[0.000029146922,0.00018662366,0.000024416071,0.0008148134,0.000031270392,0.00031002413,0.0027235742,0.00024104537,0.00004584521],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034772744,0.0006514375,0.020947428,0.00016948873,0.000044130218,0.0000133984495,0.024335511,0.0045313505,0.000047025904,0.058435652,0.30684522,0.5839446],"study_design_scores_gemma":[0.00019685309,0.000049109498,0.0015103894,0.00003606059,0.0000055429105,0.0000051873685,0.00016991487,0.010911575,0.0000058479054,0.006291737,0.98059696,0.00022083698],"about_ca_topic_score_codex":0.0002694261,"about_ca_topic_score_gemma":0.00021296403,"teacher_disagreement_score":0.8744056,"about_ca_system_score_codex":0.00005052618,"about_ca_system_score_gemma":0.000044449127,"threshold_uncertainty_score":0.7610292},"labels":[],"label_agreement":null},{"id":"W2055355018","doi":"10.1007/s12083-008-0026-2","title":"A contribution-based service differentiation scheme for peer-to-peer systems","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upload; Reputation; Peer-to-peer; Computer science; Incentive; Service (business); Reputation system; Free rider problem; Internet privacy; Scheme (mathematics); Computer security; File sharing; World Wide Web; Business; Marketing; The Internet","score_opus":0.019710691259394574,"score_gpt":0.2762502087912448,"score_spread":0.2565395175318502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055355018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009479434,0.00018838374,0.7926208,0.1910063,0.00068324147,0.0039534303,0.00015620084,0.0015727604,0.00033945584],"genre_scores_gemma":[0.87797683,0.0000049869345,0.10294264,0.0093139205,0.0015193524,0.004641114,0.00045017857,0.000072305,0.0030786495],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938656,0.000091549904,0.00092422776,0.0017628706,0.0018670929,0.0014886741],"domain_scores_gemma":[0.99167395,0.0005471025,0.00029361865,0.0019762584,0.0046106023,0.00089845824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018539247,0.00069519953,0.000758528,0.00069264905,0.0010598165,0.0012678191,0.002344298,0.0003761662,0.000004047864],"category_scores_gemma":[0.0006338442,0.00073023775,0.0001708939,0.0038962376,0.000045973436,0.0002918707,0.0005194425,0.00045223566,0.00025356622],"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.0002166685,0.0008602861,0.0027654145,0.00017387806,0.0002493393,0.000008687581,0.0018628462,0.13352056,0.0073150108,0.1590912,0.48195285,0.21198326],"study_design_scores_gemma":[0.0009168894,0.0003219085,0.004968721,0.00020353645,0.00006973577,0.000012308141,0.00007990374,0.19843219,0.00078109355,0.0034783208,0.7896913,0.0010440544],"about_ca_topic_score_codex":0.00010019498,"about_ca_topic_score_gemma":0.00009522425,"teacher_disagreement_score":0.86849743,"about_ca_system_score_codex":0.00032935603,"about_ca_system_score_gemma":0.00014918555,"threshold_uncertainty_score":0.999769},"labels":[],"label_agreement":null},{"id":"W2060919708","doi":"10.1007/s12083-011-0105-7","title":"I-Swifter: Improving chunked network coding for peer-to-peer content distribution","year":2011,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Scheduling (production processes); Distributed computing; Download; Computer network; Peer-to-peer; Encoder; Content distribution; Mathematical optimization; Operating system; Mathematics","score_opus":0.09307694516990196,"score_gpt":0.2922369882356663,"score_spread":0.19916004306576435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060919708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002596204,0.0003326067,0.96930367,0.02251187,0.0006989892,0.0023116337,0.00006392186,0.00046201353,0.0017191147],"genre_scores_gemma":[0.8979087,0.00007536817,0.08868195,0.0030054848,0.0016693879,0.0027933323,0.00029532224,0.000059481772,0.0055109737],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99631345,0.00012346162,0.0007083067,0.0010793906,0.0007759241,0.0009994878],"domain_scores_gemma":[0.99512464,0.00037750628,0.00022460367,0.0014192311,0.0021706426,0.0006833948],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002279232,0.0004336775,0.00045553932,0.00015665506,0.001572615,0.0006116676,0.0015734369,0.00014710566,0.000015248404],"category_scores_gemma":[0.00030503547,0.00044946803,0.00015097602,0.0015086336,0.000069063746,0.00028689302,0.0010715378,0.0003700621,0.000087015105],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008958555,0.00023164267,0.0024277307,0.00004104538,0.00011065717,0.000002120277,0.0048131966,0.0025997825,0.0015406867,0.17841619,0.115733266,0.6939941],"study_design_scores_gemma":[0.00056078134,0.00018024686,0.0062684976,0.00013935463,0.000051831972,0.000011445045,0.00013397877,0.054819677,0.0004816932,0.0014285584,0.93515766,0.0007662561],"about_ca_topic_score_codex":0.000054303233,"about_ca_topic_score_gemma":0.00011161765,"teacher_disagreement_score":0.8953125,"about_ca_system_score_codex":0.00017202053,"about_ca_system_score_gemma":0.00007876856,"threshold_uncertainty_score":0.99979573},"labels":[],"label_agreement":null},{"id":"W2066292413","doi":"10.1007/s12083-012-0190-2","title":"The performance and locality tradeoff in bittorrent-like file sharing systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"University of Hong Kong; Yale University","keywords":"BitTorrent; Computer science; Locality; Distributed computing; Peer-to-peer; Computer network; Selection (genetic algorithm); File sharing; The Internet; Matching (statistics); Pareto principle; Download; Mathematical optimization","score_opus":0.015682504293287103,"score_gpt":0.2372985244764094,"score_spread":0.2216160201831223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066292413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34975904,0.0033096075,0.53761345,0.090664595,0.0022350196,0.008620274,0.00009601805,0.0027848312,0.00491715],"genre_scores_gemma":[0.9854188,0.00007987007,0.0077435197,0.0005624586,0.00036904644,0.0033585483,0.000016460544,0.000025826954,0.0024254636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973477,0.000042340558,0.00045385244,0.0008709686,0.000514301,0.000770817],"domain_scores_gemma":[0.99788046,0.00034661117,0.000095985655,0.0011483151,0.00021066675,0.000317989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009068808,0.00027879246,0.00027895006,0.00019678727,0.0006870385,0.0010065067,0.0015207201,0.00012033932,0.0000053203703],"category_scores_gemma":[0.00005902295,0.0002323153,0.000032978864,0.0015550202,0.00010220103,0.00026454296,0.0010744572,0.0003675305,0.00012936858],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007256233,0.00008336827,0.023173228,0.000060808175,0.000033962,0.000002171033,0.0012285078,0.019019768,0.000106416686,0.015757026,0.23346552,0.70706195],"study_design_scores_gemma":[0.00014440766,0.00005465378,0.034079373,0.00012850136,0.000006552975,0.000018605102,0.00017050622,0.24221596,0.000022068512,0.001154254,0.7216097,0.00039538744],"about_ca_topic_score_codex":0.0003032139,"about_ca_topic_score_gemma":0.00009617766,"teacher_disagreement_score":0.7066666,"about_ca_system_score_codex":0.00008838654,"about_ca_system_score_gemma":0.000029279277,"threshold_uncertainty_score":0.97057676},"labels":[],"label_agreement":null},{"id":"W2069737692","doi":"10.1007/s12083-009-0038-6","title":"Subscriber mobility management for a P2P publish/subscribe overlay in mobile tactical networks","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Overlay; Computer network; Handover; Reliability (semiconductor); Publication; Mobility management; Scheme (mathematics); Overlay network; Distributed computing; Mobile device; World Wide Web; The Internet","score_opus":0.016292047550373966,"score_gpt":0.2836304494832623,"score_spread":0.2673384019328884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069737692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005327679,0.00044493735,0.9438926,0.04055241,0.00047749485,0.0048713335,0.000022962677,0.0011121769,0.0032984077],"genre_scores_gemma":[0.8334859,0.00005957308,0.15070829,0.0050810906,0.0008026797,0.0077812187,0.00006159814,0.0000505139,0.0019691132],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99519575,0.000069673944,0.00075031427,0.0017332333,0.00081704615,0.001433997],"domain_scores_gemma":[0.9965591,0.000366509,0.00012954569,0.0019247591,0.00041712957,0.0006029597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017639741,0.00050468626,0.0005617106,0.0005347141,0.00043969933,0.00087237026,0.0020897095,0.00027430363,0.000005539124],"category_scores_gemma":[0.00012372923,0.00053087255,0.00014007514,0.0034557113,0.00007899365,0.00044129713,0.0009022773,0.0005209837,0.00004539983],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056731606,0.00053547736,0.0011649241,0.000025328414,0.00004739046,0.000011003495,0.00047590348,0.05030533,0.000047523186,0.07811222,0.157233,0.7119852],"study_design_scores_gemma":[0.00058822706,0.00030087173,0.012443957,0.00008258622,0.00003575964,0.000015292939,0.00011374614,0.057463128,0.000050616407,0.018716529,0.90938824,0.0008010446],"about_ca_topic_score_codex":0.000029050625,"about_ca_topic_score_gemma":0.000085164356,"teacher_disagreement_score":0.82815826,"about_ca_system_score_codex":0.00024897567,"about_ca_system_score_gemma":0.000044103395,"threshold_uncertainty_score":0.99971426},"labels":[],"label_agreement":null},{"id":"W2077709959","doi":"10.1007/s12083-009-0052-8","title":"CliqueStream: Creating an efficient and resilient transport overlay for peer-to-peer live streaming using a clustered DHT","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Royal Society of Canada","keywords":"Overlay; Computer science; Computer network; Overlay network; Robustness (evolution); Distributed computing; Locality; Exploit; Redundancy (engineering); Fault tolerance; Peer-to-peer; Computer security; Operating system","score_opus":0.026118050683652198,"score_gpt":0.30730839674303867,"score_spread":0.2811903460593865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077709959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2789933,0.00019745647,0.69100815,0.02431661,0.00029244125,0.003271735,0.00010560114,0.0011111967,0.00070352014],"genre_scores_gemma":[0.7190198,0.000009914671,0.27606434,0.0018216997,0.0008118188,0.000725747,0.00008463703,0.00007009774,0.0013920065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936472,0.00009388925,0.0009793416,0.0022229934,0.0015108678,0.0015456879],"domain_scores_gemma":[0.9950232,0.00042997938,0.00027689262,0.0017379589,0.0014201411,0.0011118634],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002014611,0.00076710735,0.0007841074,0.00066611473,0.0013129922,0.0007740696,0.0015802643,0.00032961354,0.0000029788337],"category_scores_gemma":[0.00031156235,0.00081079826,0.000154494,0.0020527826,0.00010882225,0.0003121628,0.00055602053,0.00049136,0.000021094103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023352499,0.00083075155,0.0039640814,0.00009474254,0.00014162985,0.000032534215,0.016565034,0.3323652,0.0039500417,0.015607536,0.016074106,0.6101408],"study_design_scores_gemma":[0.0019559849,0.0022838165,0.02705882,0.0009940171,0.00032184954,0.00017823969,0.0020088824,0.56868565,0.0017910625,0.0046866196,0.3865922,0.0034428483],"about_ca_topic_score_codex":0.00024251152,"about_ca_topic_score_gemma":0.00019472961,"teacher_disagreement_score":0.6066979,"about_ca_system_score_codex":0.00028318507,"about_ca_system_score_gemma":0.0001399438,"threshold_uncertainty_score":0.9999872},"labels":[],"label_agreement":null},{"id":"W2097925411","doi":"10.1007/s12083-012-0149-3","title":"Improving sustainability of BitTorrent darknets","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Upload; Computer science; Incentive; BitTorrent tracker; Enforcement; Computer network; Business; Internet privacy; Peer-to-peer; Environmental economics; World Wide Web; Microeconomics","score_opus":0.014938008074435105,"score_gpt":0.2639305153706544,"score_spread":0.24899250729621927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097925411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051649503,0.0004945586,0.94108766,0.0048762225,0.00037880286,0.00052883005,0.000006052373,0.00015941882,0.00081892463],"genre_scores_gemma":[0.9944235,0.000004217547,0.0038528775,0.00027282775,0.00052683137,0.00018295702,0.00000572627,0.000009252166,0.00072178064],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865615,0.000038007514,0.00023851363,0.00033653833,0.0003358112,0.00039496226],"domain_scores_gemma":[0.9985407,0.00011685052,0.000078871664,0.0005954448,0.0003868254,0.00028131373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080575905,0.00012707032,0.0001595205,0.00009994147,0.00021989965,0.00009673412,0.00042576634,0.000042354375,0.0000014244765],"category_scores_gemma":[0.00006909782,0.00012466662,0.000052710308,0.0004949027,0.00003067902,0.00015071551,0.00035942826,0.00012571215,0.000012618516],"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.000009960858,0.00024845198,0.027174361,0.00006460539,0.000026074542,5.3039787e-7,0.0018421975,0.0019305715,0.0012915456,0.038500864,0.007132236,0.9217786],"study_design_scores_gemma":[0.00046412647,0.00015185456,0.036191314,0.00008156837,0.00006670808,0.000025273492,0.0005259073,0.062316753,0.000562448,0.0038521574,0.8948756,0.0008863211],"about_ca_topic_score_codex":0.00018085775,"about_ca_topic_score_gemma":0.0000069874823,"teacher_disagreement_score":0.942774,"about_ca_system_score_codex":0.00006185986,"about_ca_system_score_gemma":0.000042487245,"threshold_uncertainty_score":0.5083757},"labels":[],"label_agreement":null},{"id":"W2117718929","doi":"10.1007/s12083-009-0048-4","title":"Adaptive topology formation for peer-to-peer video streaming","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Upload; Video quality; Bandwidth (computing); Overlay; Peer-to-peer; Distributed computing; Overlay network; Network topology; The Internet; Real-time computing","score_opus":0.025986668830844765,"score_gpt":0.2889531711439613,"score_spread":0.2629665023131165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117718929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004443948,0.00014278162,0.8308169,0.1574212,0.00051114906,0.0027936308,0.000074931595,0.0012644186,0.002531003],"genre_scores_gemma":[0.6802312,0.000013222645,0.30231023,0.0070649358,0.0013891548,0.0024443946,0.00012367498,0.00006061429,0.006362562],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945935,0.00007735137,0.0008594251,0.0015941939,0.0013496277,0.0015258797],"domain_scores_gemma":[0.99482656,0.00053368876,0.000253762,0.0016977628,0.0019240691,0.0007641683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016827724,0.00064168154,0.000672197,0.0007931032,0.0010444517,0.00065409864,0.0022541878,0.00035209212,0.000005833293],"category_scores_gemma":[0.00052296254,0.00068079896,0.00016904042,0.0027406006,0.00009047518,0.0005377867,0.0008363945,0.00049055857,0.00023604647],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058760266,0.00014289156,0.00016238168,0.000015978985,0.000050556337,0.000004403994,0.002358069,0.0145394,0.00070568983,0.067782536,0.2181941,0.69598526],"study_design_scores_gemma":[0.00053719553,0.00074582756,0.002120187,0.00010802154,0.00005676344,0.00004676148,0.0004369255,0.036253143,0.0010950755,0.023857202,0.9337176,0.0010252829],"about_ca_topic_score_codex":0.00006002915,"about_ca_topic_score_gemma":0.00012865519,"teacher_disagreement_score":0.71552354,"about_ca_system_score_codex":0.00028962377,"about_ca_system_score_gemma":0.00009444459,"threshold_uncertainty_score":0.9995643},"labels":[],"label_agreement":null},{"id":"W2125948488","doi":"10.1007/s12083-007-0007-x","title":"An inexpensive unstructured platform for wireless mobile peer-to-peer networks","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gossip; Peer-to-peer; Wireless; Computer network; Distributed computing; Robustness (evolution); Wireless network; Mobile device; Gossip protocol; Bandwidth (computing); Exploit; Mobile computing; Computer security; Operating system","score_opus":0.02363411094292499,"score_gpt":0.2832382619596718,"score_spread":0.2596041510167468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125948488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0697234,0.00023774368,0.8981573,0.022305897,0.0012176334,0.0053326576,0.00013620524,0.0021539987,0.0007351874],"genre_scores_gemma":[0.81245226,0.000037162557,0.16829748,0.0049274345,0.0025877103,0.006965839,0.0002991516,0.00016365666,0.0042692837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99233496,0.000070726375,0.0010619822,0.0024960986,0.0019421178,0.0020940914],"domain_scores_gemma":[0.99166834,0.00055303355,0.00030696244,0.0030012894,0.002947108,0.0015232709],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013608035,0.0009899685,0.0010314917,0.0007833244,0.0017657479,0.00078188657,0.0037984096,0.0005708502,0.000009428427],"category_scores_gemma":[0.00024997376,0.0010229168,0.00023120892,0.0038945652,0.00023397058,0.0005820557,0.0014098902,0.00081245747,0.00014315423],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013020137,0.00027741876,0.0016530886,0.00003250591,0.00015382153,0.000027660222,0.0046446617,0.22270145,0.0009914744,0.017813297,0.3300624,0.42151204],"study_design_scores_gemma":[0.00082589884,0.0006982066,0.0026812607,0.000096883436,0.00005970838,0.00016351642,0.00040779452,0.09824942,0.0008121911,0.004164017,0.89015913,0.0016820005],"about_ca_topic_score_codex":0.00012488381,"about_ca_topic_score_gemma":0.00017601914,"teacher_disagreement_score":0.7427289,"about_ca_system_score_codex":0.00027170408,"about_ca_system_score_gemma":0.00018257655,"threshold_uncertainty_score":0.99953383},"labels":[],"label_agreement":null},{"id":"W2136784393","doi":"10.1007/s12083-009-0047-5","title":"SPACE: A lightweight collaborative caching for clusters","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Computer science; Scheme (mathematics); Overhead (engineering); Distributed computing; Space (punctuation); Cluster (spacecraft); Peer-to-peer; Computer cluster; False sharing; CPU cache; Cache algorithms; Computer network; Parallel computing; Operating system","score_opus":0.013609960840248262,"score_gpt":0.2661503445185948,"score_spread":0.2525403836783466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136784393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032881603,0.00028658696,0.9292624,0.06311833,0.00024761277,0.0009739851,0.000017617176,0.0002556229,0.0025496986],"genre_scores_gemma":[0.9609837,0.00001635014,0.029264636,0.004350911,0.0009261627,0.0004857565,0.000022443806,0.000015508627,0.003934557],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985176,0.000032665812,0.00021076872,0.0005553463,0.00030818072,0.0003754423],"domain_scores_gemma":[0.99867326,0.00017245635,0.000069866226,0.0004594259,0.00036485953,0.0002601184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004552093,0.00018098927,0.00019647426,0.00013837527,0.0006114717,0.0003991182,0.00048051082,0.00005915984,6.660215e-7],"category_scores_gemma":[0.000035076144,0.00017694608,0.00005997345,0.0007854793,0.000017028615,0.00014343554,0.000111558766,0.00014072786,0.00002220248],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007163483,0.00023996642,0.00038435226,0.00002460596,0.00009210846,0.0000053461567,0.0060954937,0.030362608,0.0031658516,0.19159633,0.20087123,0.56709045],"study_design_scores_gemma":[0.00036919088,0.00016316703,0.0004429705,0.00005590984,0.000025496305,0.000009523253,0.00011027067,0.06446597,0.00013877604,0.0043244385,0.92950594,0.00038834807],"about_ca_topic_score_codex":0.000021142503,"about_ca_topic_score_gemma":0.000017288723,"teacher_disagreement_score":0.9576955,"about_ca_system_score_codex":0.00004773051,"about_ca_system_score_gemma":0.00004560171,"threshold_uncertainty_score":0.7215652},"labels":[],"label_agreement":null},{"id":"W2159896477","doi":"10.1007/s12083-009-0066-2","title":"From P2P to reliable semantic P2P systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scalability; Semantic Web; Semantics (computer science); Disconnection; Reliability (semiconductor); Fault tolerance; Social Semantic Web; Distributed computing; Information retrieval; Database; Power (physics)","score_opus":0.013452727753118765,"score_gpt":0.2577501957171053,"score_spread":0.24429746796398652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159896477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047977936,0.00028747212,0.87527543,0.06488232,0.0026442602,0.0024461807,0.00006340776,0.0023480565,0.004074908],"genre_scores_gemma":[0.82577085,0.000013766728,0.15908387,0.002497644,0.0028390754,0.0022219738,0.00004498522,0.00007644195,0.0074513997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99576116,0.00004058759,0.0005993442,0.0015522665,0.00095992244,0.0010867186],"domain_scores_gemma":[0.9954982,0.00031724919,0.00013802362,0.0026324312,0.00056372554,0.0008503787],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009858034,0.00046393243,0.0005236036,0.00043810427,0.0006557339,0.0010406215,0.0028015196,0.00027767982,0.000008534153],"category_scores_gemma":[0.00017194972,0.0004761394,0.000083084495,0.0027737026,0.00006861555,0.00021114582,0.001613557,0.00065880123,0.0011726425],"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.000021067215,0.00020491898,0.0035668034,0.00004040433,0.00010869421,0.000018146284,0.0022443905,0.03214977,0.0089285765,0.05241494,0.6603957,0.2399066],"study_design_scores_gemma":[0.00016553713,0.000079249075,0.0018475592,0.00011213842,0.00002817179,0.000020739097,0.00009836466,0.021245383,0.0004107584,0.0048340103,0.97049063,0.00066743256],"about_ca_topic_score_codex":0.00081193616,"about_ca_topic_score_gemma":0.000262953,"teacher_disagreement_score":0.77779293,"about_ca_system_score_codex":0.000081427665,"about_ca_system_score_gemma":0.00007388848,"threshold_uncertainty_score":0.9999964},"labels":[],"label_agreement":null},{"id":"W2180459646","doi":"10.1007/s12083-015-0422-3","title":"Opportunistic cooperation in wireless ad hoc networks with interference correlation","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless ad hoc network; Interference (communication); Computer science; Wireless; Computer network; Correlation; Post-hoc analysis; Telecommunications; Mobile ad hoc network; Channel (broadcasting); Mathematics; Statistics","score_opus":0.05670263611936628,"score_gpt":0.2910093912865058,"score_spread":0.23430675516713956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180459646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003872266,0.0005051051,0.9853615,0.007306572,0.00017405576,0.0007072003,0.0000023485995,0.00016571213,0.0019052188],"genre_scores_gemma":[0.98338425,0.00030771183,0.013397867,0.0009273466,0.00019890194,0.0005309444,0.0000771172,0.000019190977,0.0011566586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835634,0.000121307,0.00034284175,0.0005275444,0.0003227306,0.000329217],"domain_scores_gemma":[0.99800813,0.00015446375,0.00009699703,0.00069484866,0.00067206094,0.00037349862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082439085,0.00020542314,0.00021647643,0.00017565669,0.0002956868,0.0003686001,0.0006489085,0.000074073745,0.00000344246],"category_scores_gemma":[0.000045459703,0.0001960424,0.000018301322,0.0014733068,0.00005022071,0.0002457031,0.0003464596,0.00029653194,0.000033991262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048021477,0.000121455465,0.0034825597,0.000006228358,0.000016734271,0.000003929388,0.0026905225,0.097129464,0.000079864614,0.065811224,0.0070625274,0.8235475],"study_design_scores_gemma":[0.0004988619,0.00017536918,0.0022867334,0.00015665941,0.000011123996,0.000018036682,0.00011552212,0.7771422,0.00000972271,0.0003683611,0.21880592,0.00041144624],"about_ca_topic_score_codex":0.000008375187,"about_ca_topic_score_gemma":0.00031772853,"teacher_disagreement_score":0.979512,"about_ca_system_score_codex":0.00010564313,"about_ca_system_score_gemma":0.000111141235,"threshold_uncertainty_score":0.7994377},"labels":[],"label_agreement":null},{"id":"W2286153064","doi":"10.1007/s12083-016-0436-5","title":"A fault tolerant peer-to-peer spatial data structure","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Bank of Canada","funders":"","keywords":"Computer science; Hash function; Hash table; Redundancy (engineering); Distributed hash table; Backup; Node (physics); Range query (database); Theoretical computer science; Algorithm; Peer-to-peer; Distributed computing; Search engine","score_opus":0.02979607622787121,"score_gpt":0.28679192954184785,"score_spread":0.2569958533139766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286153064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009234961,0.00016116581,0.7714662,0.21266559,0.0010722403,0.0020235148,0.0007972195,0.0015719236,0.0010071993],"genre_scores_gemma":[0.80867773,0.000022850478,0.16598146,0.0061744037,0.003297812,0.0011245558,0.00032504363,0.00014446153,0.014251704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99144363,0.000112968606,0.0009568487,0.0029926049,0.0026801035,0.0018138697],"domain_scores_gemma":[0.99067366,0.00047281198,0.0002497541,0.0056652334,0.0016904781,0.0012480718],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017033038,0.0008721144,0.0008169574,0.0006755266,0.00090218516,0.0010169098,0.007050021,0.00042235208,0.000043952634],"category_scores_gemma":[0.0007584907,0.0007201007,0.00012632858,0.0030793734,0.00017047251,0.0005555617,0.0055010486,0.0006490055,0.0007217688],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033147775,0.00008926763,0.0011783972,0.000014660885,0.00007630965,0.000013516056,0.00071124424,0.0028315338,0.0019164744,0.0061812606,0.34969574,0.6372584],"study_design_scores_gemma":[0.00053795055,0.00016895862,0.0035130745,0.00016184947,0.00005335254,0.000060941773,0.00006575622,0.010155009,0.0006281278,0.004879835,0.97862697,0.0011482042],"about_ca_topic_score_codex":0.00031364444,"about_ca_topic_score_gemma":0.00064136455,"teacher_disagreement_score":0.79944277,"about_ca_system_score_codex":0.00023964875,"about_ca_system_score_gemma":0.0001950597,"threshold_uncertainty_score":0.999525},"labels":[],"label_agreement":null},{"id":"W2323143645","doi":"10.1007/s12083-016-0454-3","title":"Joint TAS and power allocation for D2D cooperative networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Young Scientists Fund; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Transmitter power output; Relay; Fading; Outage probability; Computer science; Antenna (radio); Power (physics); Joint (building); Topology (electrical circuits); Performance improvement; Electronic engineering; Mathematics; Telecommunications; Engineering; Transmitter; Channel (broadcasting); Physics","score_opus":0.03633668490090542,"score_gpt":0.288388145615534,"score_spread":0.2520514607146286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323143645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009918743,0.0006415288,0.94983685,0.04610317,0.00016925734,0.0011084228,0.000009052557,0.0001641759,0.0009756723],"genre_scores_gemma":[0.9662993,0.00047327668,0.025885383,0.0025394575,0.00047184102,0.0014731662,0.000020238647,0.000025627885,0.0028117015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983864,0.00007821359,0.00031994964,0.00061561295,0.00022567861,0.0003741625],"domain_scores_gemma":[0.9978105,0.00038255093,0.00008923391,0.00070153055,0.00071933214,0.0002968961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077554246,0.0002128602,0.00022227998,0.00011300036,0.0007104776,0.00031268754,0.0004883006,0.000075625314,0.000008103868],"category_scores_gemma":[0.0000772287,0.00016992069,0.000041274558,0.0005999903,0.0000715154,0.00020213117,0.00044526282,0.00011872609,0.000024705092],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147287155,0.000062445804,0.0002945732,0.000006023656,0.000040622985,2.791849e-7,0.0010274993,0.0016788706,0.0018071285,0.19550768,0.03539331,0.76416683],"study_design_scores_gemma":[0.00050190993,0.00012669375,0.0019888266,0.00010622123,0.000015576941,0.0000085771235,0.000043653275,0.061307836,0.00023405212,0.001682484,0.93356335,0.00042084232],"about_ca_topic_score_codex":0.0000033837805,"about_ca_topic_score_gemma":0.000026813757,"teacher_disagreement_score":0.9653074,"about_ca_system_score_codex":0.000052038118,"about_ca_system_score_gemma":0.000038206323,"threshold_uncertainty_score":0.69291645},"labels":[],"label_agreement":null},{"id":"W2408594160","doi":"10.1007/s12083-016-0465-0","title":"An overview of medium access control strategies for opportunistic spectrum access in cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Faculty of Engineering and Architectural Science, Ryerson University","keywords":"Cognitive radio; Computer science; Computer network; Access control; Media access control; Wireless; Exploit; Radio spectrum; Key (lock); Spectral efficiency; Physical layer; Spectrum management; Telecommunications; Computer security; Channel (broadcasting)","score_opus":0.07862623162074382,"score_gpt":0.3650725362020824,"score_spread":0.2864463045813386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408594160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027070215,0.000474219,0.98514736,0.009164005,0.00025382434,0.0015286054,0.0000659554,0.00011214384,0.0005468798],"genre_scores_gemma":[0.99557555,0.00028914743,0.0014778847,0.0008774606,0.001099451,0.0005097856,0.000030234245,0.00003137842,0.00010911596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754053,0.000097434764,0.0005233207,0.00081034657,0.0003735497,0.0006548358],"domain_scores_gemma":[0.99743676,0.0010512683,0.00021143012,0.0005043995,0.0004236742,0.0003724649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009095681,0.00028874807,0.0004950291,0.0002473333,0.0002508719,0.00064495887,0.001012485,0.00010314112,0.000008985048],"category_scores_gemma":[0.0000574962,0.00024300032,0.00008166741,0.0010102128,0.000107001004,0.00068090635,0.00022762353,0.00015508174,0.0000020630544],"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.00023340032,0.00040047438,0.011239059,0.00009762063,0.0001788968,0.000019642765,0.0008019052,0.016838681,0.0003311126,0.1899226,0.0044907634,0.7754458],"study_design_scores_gemma":[0.006195912,0.0009523946,0.105541416,0.0023745326,0.00030592183,0.000077241144,0.000364953,0.6961239,0.00031188584,0.1182544,0.06711728,0.0023801513],"about_ca_topic_score_codex":0.0000815632,"about_ca_topic_score_gemma":0.00039239734,"teacher_disagreement_score":0.99286854,"about_ca_system_score_codex":0.000059852006,"about_ca_system_score_gemma":0.00015821736,"threshold_uncertainty_score":0.99092656},"labels":[],"label_agreement":null},{"id":"W2493324792","doi":"10.1007/s12083-016-0498-4","title":"Optimizing broadcast duration for layered video streams in cellular networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Heilongjiang Province; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Optimization problem; Cellular network; Telecommunications link; Minification; Computer network; Base station; Real-time computing; Video quality; Signal-to-noise ratio (imaging); Layer (electronics); Mathematical optimization; Algorithm; Telecommunications; Mathematics; Engineering; Metric (unit)","score_opus":0.010317398202840401,"score_gpt":0.23297960006696555,"score_spread":0.22266220186412516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493324792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036346049,0.00047537268,0.99221545,0.0013173012,0.0002521855,0.0012927165,0.000025436855,0.0003613332,0.00042559797],"genre_scores_gemma":[0.94247514,0.00021858932,0.053318508,0.00011299118,0.0012849249,0.0018350707,0.00012839376,0.00010021617,0.00052615744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998345,0.000020785626,0.00044560072,0.00045297903,0.00020620601,0.00052938325],"domain_scores_gemma":[0.9989602,0.00024341184,0.00006733753,0.00034553217,0.00017785277,0.00020566398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003167072,0.00025861463,0.00025321715,0.00016456204,0.00019106023,0.00008777964,0.00017646984,0.00013882796,0.0000065916693],"category_scores_gemma":[0.000033406355,0.0002478044,0.000046763937,0.0006591428,0.000025452173,0.00016324125,0.000053739757,0.00012944541,0.000014670788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013527182,0.000013393446,0.00022158293,0.00001123026,0.000011502015,3.872988e-7,0.00012617983,0.80137926,0.0014906748,0.00053672213,0.0018084232,0.19438714],"study_design_scores_gemma":[0.00060633884,0.00003141808,0.00017366749,0.0001663913,0.000017669296,0.0000022356642,0.000050574123,0.82566994,0.0006586421,0.00049141963,0.17169996,0.0004317431],"about_ca_topic_score_codex":0.00000639162,"about_ca_topic_score_gemma":0.00004779998,"teacher_disagreement_score":0.93889695,"about_ca_system_score_codex":0.00013117545,"about_ca_system_score_gemma":0.000010729703,"threshold_uncertainty_score":0.99999744},"labels":[],"label_agreement":null},{"id":"W2528637035","doi":"10.1007/s12083-016-0515-7","title":"Distributed rate control, routing, and energy management in dynamic rechargeable sensor networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Computer science; Scalability; Mathematical optimization; Routing (electronic design automation); Distributed computing; Constraint (computer-aided design); Flow routing; Energy (signal processing); Maximization; Wireless sensor network; Computer network; Engineering; Mathematics","score_opus":0.0075998805293364885,"score_gpt":0.22896120929935737,"score_spread":0.22136132877002088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528637035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030068846,0.000268335,0.9841168,0.010884994,0.0002415733,0.00038751392,0.000017041997,0.00026217586,0.0008146826],"genre_scores_gemma":[0.97860086,0.00030595038,0.014882038,0.0010805611,0.00028084844,0.00050950114,0.00003213366,0.000036006237,0.0042721266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973597,0.00013131353,0.0004278466,0.0009693356,0.0003252631,0.0007865648],"domain_scores_gemma":[0.9982527,0.00037911264,0.00012856965,0.0007377761,0.0001648666,0.00033701365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008618286,0.00029868766,0.00031810818,0.00019751352,0.00031947126,0.0002530681,0.0005531165,0.00012392444,0.0000026532168],"category_scores_gemma":[0.000023457656,0.00025583417,0.000043019598,0.0011174406,0.00006069301,0.00012275952,0.00039259615,0.00015649867,0.000013430431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003509216,0.000114790615,0.002065204,0.000010182447,0.00007166389,0.000019484201,0.000114586,0.45092446,0.0003073786,0.097732976,0.0047058426,0.44389835],"study_design_scores_gemma":[0.0008469781,0.000038306167,0.0038031675,0.00013984623,0.000021904041,0.000011623055,0.000017496248,0.71736765,0.000022491568,0.0007534776,0.27652007,0.00045700563],"about_ca_topic_score_codex":0.000054017997,"about_ca_topic_score_gemma":0.00009372074,"teacher_disagreement_score":0.9755939,"about_ca_system_score_codex":0.00012024462,"about_ca_system_score_gemma":0.000012883782,"threshold_uncertainty_score":0.9999894},"labels":[],"label_agreement":null},{"id":"W2530306538","doi":"10.1007/s12083-016-0525-5","title":"A noncontact positioning measuring system based on distributed wireless networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Key Scientific Instrument and Equipment Development Projects of China; National Science Foundation","keywords":"Computer science; Computer vision; Wireless sensor network; Position (finance); Artificial intelligence; Sensor fusion; Wireless; Range (aeronautics); Measure (data warehouse); Coordinate system; Real-time computing; Engineering; Telecommunications; Computer network","score_opus":0.015039918671320426,"score_gpt":0.2335912865171937,"score_spread":0.21855136784587328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530306538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018894941,0.000060629405,0.9876365,0.007062809,0.0005598552,0.0005928758,0.0000752724,0.00080953987,0.0013130375],"genre_scores_gemma":[0.98387396,0.000007974615,0.013178333,0.000826388,0.0013008332,0.00046030967,0.000083532526,0.000037848888,0.00023082482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711794,0.000110318906,0.00043802496,0.00094756036,0.00070299784,0.0006831513],"domain_scores_gemma":[0.9972589,0.0006104485,0.00014546618,0.001093309,0.00038064024,0.0005112259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008598945,0.0003185105,0.0003172411,0.0001786853,0.0008579374,0.0004881092,0.00084517006,0.00014049417,0.000004393629],"category_scores_gemma":[0.000037582195,0.0002572539,0.00008706727,0.0009997736,0.000038792798,0.00016769851,0.00025956187,0.0002477273,0.000088307585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009592551,0.00021515868,0.004778264,0.0000506486,0.000071362134,0.000028345485,0.00025855243,0.26743376,0.00072130887,0.06324992,0.031733863,0.6313629],"study_design_scores_gemma":[0.00084193196,0.00014239551,0.0045149736,0.0012902761,0.000038647573,0.000037886788,0.00004162685,0.74809384,0.00020196919,0.0002251639,0.24372691,0.0008443917],"about_ca_topic_score_codex":0.000033053584,"about_ca_topic_score_gemma":0.000010796431,"teacher_disagreement_score":0.98198444,"about_ca_system_score_codex":0.00016557703,"about_ca_system_score_gemma":0.00003911242,"threshold_uncertainty_score":0.99998796},"labels":[],"label_agreement":null},{"id":"W2536851316","doi":"10.1007/s12083-016-0519-3","title":"Energy-efficient content distribution via mobile users cooperations in cellular networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cellular network; Content distribution; Computer network","score_opus":0.020146689667411097,"score_gpt":0.23368420626595274,"score_spread":0.21353751659854164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536851316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036147563,0.00029124625,0.9894554,0.0048955306,0.00039371985,0.0006890906,0.000035015582,0.0001782312,0.00044701912],"genre_scores_gemma":[0.99281925,0.00006247245,0.002756437,0.0007354879,0.000593924,0.0011856202,0.00012910595,0.000020663441,0.001697066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977013,0.00007121943,0.00047846706,0.0007293052,0.0004199985,0.0005997204],"domain_scores_gemma":[0.99819994,0.0002279043,0.000098180535,0.0006752553,0.0003570982,0.0004416214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059654814,0.00025006811,0.0002642952,0.00011152626,0.0004164965,0.00021878543,0.0005123754,0.00012678202,0.000009535525],"category_scores_gemma":[0.000007218321,0.00020562852,0.000061526014,0.0009877372,0.00007237052,0.000108911714,0.00026826473,0.00015332957,0.00003949145],"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.000018250565,0.00026691367,0.0012443329,0.0000047761664,0.000026175378,0.00001028214,0.00026538366,0.11258143,0.000577162,0.050954156,0.01647583,0.81757534],"study_design_scores_gemma":[0.00030846646,0.000058560337,0.00032781172,0.000059579314,0.000012877078,0.0000084044095,0.000024291836,0.7038727,0.000056408506,0.00042807165,0.29453132,0.00031152213],"about_ca_topic_score_codex":0.000074979806,"about_ca_topic_score_gemma":0.000046083136,"teacher_disagreement_score":0.98920447,"about_ca_system_score_codex":0.000117352276,"about_ca_system_score_gemma":0.00005510812,"threshold_uncertainty_score":0.83852875},"labels":[],"label_agreement":null},{"id":"W2755417146","doi":"10.1007/s12083-017-0594-0","title":"Adaptive Flow Rate Control for Network Utility Maximization Subject to QoS Constraints in Wireless Multi-hop Networks","year":2017,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Quality of service; Hop (telecommunications); Computer network; Utility maximization; Wireless network; Maximization; Flow control (data); Wireless; Control (management); Distributed computing; Mathematical optimization; Telecommunications; Artificial intelligence; Mathematics; Mathematical economics","score_opus":0.021392336005416155,"score_gpt":0.26667026939771776,"score_spread":0.2452779333923016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755417146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020103394,0.00014627815,0.9913711,0.0009544285,0.0007667983,0.0038498545,0.00011638309,0.00035284302,0.000432005],"genre_scores_gemma":[0.9212871,0.00007611089,0.07271859,0.0003730407,0.0019395618,0.0031125331,0.00018066181,0.00011866945,0.00019369394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974068,0.00007283715,0.0005928489,0.0007590927,0.00024830183,0.00092014024],"domain_scores_gemma":[0.9977809,0.00037895617,0.00016305437,0.0008039783,0.0004542893,0.00041877583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009731056,0.00043737428,0.00054637075,0.00014382933,0.00083567307,0.00028402708,0.00046703444,0.00022916023,0.000008041366],"category_scores_gemma":[0.00012633792,0.0005155578,0.000080826016,0.0005772968,0.00011230232,0.00020140794,0.00011808164,0.00032786204,0.000015750622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009234926,0.000031292595,0.0025918114,0.000016230062,0.000037750942,0.0000010254621,0.00013540674,0.86316586,0.000028642382,0.0004942963,0.0026356766,0.13076968],"study_design_scores_gemma":[0.0012269248,0.000040581748,0.009434184,0.00015041175,0.000041369905,0.000002134892,0.00004159056,0.9727335,0.00001960795,0.00030589168,0.0154710915,0.00053268875],"about_ca_topic_score_codex":0.000024530415,"about_ca_topic_score_gemma":0.00040917858,"teacher_disagreement_score":0.9192768,"about_ca_system_score_codex":0.00015585349,"about_ca_system_score_gemma":0.00003154898,"threshold_uncertainty_score":0.9997296},"labels":[],"label_agreement":null},{"id":"W2755725365","doi":"10.1007/s12083-017-0604-2","title":"An improved network security situation assessment approach in software defined networks","year":2017,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"OpenFlow; Computer science; Software-defined networking; Forwarding plane; Routing control plane; Computer network; Software; Software deployment; Flooding (psychology); Network security; Hidden Markov model; Computer security; Distributed computing; Artificial intelligence; Network packet; Software engineering","score_opus":0.016857002466765417,"score_gpt":0.28712783289431987,"score_spread":0.27027083042755445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755725365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0089362,0.00012499849,0.98421824,0.003140129,0.00059813936,0.001247537,0.000005000391,0.00032819642,0.0014015742],"genre_scores_gemma":[0.8824023,0.000046466834,0.11363106,0.00073344476,0.0020537667,0.0009094261,0.000070811824,0.000028168126,0.0001245574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971181,0.00013742219,0.00047544914,0.0010521302,0.00050053,0.00071636145],"domain_scores_gemma":[0.99713933,0.00013415766,0.00027037718,0.0017063589,0.0003267782,0.00042300447],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017877088,0.00031150266,0.0003428946,0.00015023157,0.001818201,0.0013224174,0.0013859308,0.00021874046,0.0000045806255],"category_scores_gemma":[0.000051927036,0.00033430615,0.00006907676,0.00074987166,0.00006507177,0.0006319794,0.0005941401,0.00054046744,0.000012154532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045446453,0.0004614894,0.015897145,0.000030232166,0.000039756513,0.000003176284,0.0014458211,0.28136238,0.00008395132,0.037970163,0.0075882785,0.65507215],"study_design_scores_gemma":[0.00038335164,0.0001254567,0.036996827,0.000047540823,0.000016048347,0.000008775156,0.000028639573,0.89502597,0.000007198231,0.012873025,0.05402694,0.00046021878],"about_ca_topic_score_codex":0.00020842892,"about_ca_topic_score_gemma":0.0003830285,"teacher_disagreement_score":0.8734661,"about_ca_system_score_codex":0.00010900888,"about_ca_system_score_gemma":0.00006264969,"threshold_uncertainty_score":0.9999109},"labels":[],"label_agreement":null},{"id":"W2767519807","doi":"10.1007/s12083-017-0618-9","title":"FGDA: Fine-grained data analysis in privacy-preserving smart grid communications","year":2017,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Smart grid; Ciphertext; Variance (accounting); Encryption; Distributed computing; Computer network; Data mining; Real-time computing; Engineering","score_opus":0.05056748979579573,"score_gpt":0.3152218450508855,"score_spread":0.2646543552550898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767519807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32224494,0.0068535884,0.44356683,0.1608551,0.002702724,0.006085509,0.0017208331,0.002302189,0.0536683],"genre_scores_gemma":[0.9895164,0.0002272399,0.008115301,0.00013052188,0.0006476295,0.00032723005,0.0004888597,0.000028730221,0.00051809504],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850285,0.000029163626,0.00033179848,0.00046797717,0.0002860875,0.00038211347],"domain_scores_gemma":[0.9945657,0.00019528437,0.000066027744,0.0048417365,0.000112320515,0.00021893079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071294187,0.00018760574,0.0002851747,0.00025466963,0.0008577455,0.0003317751,0.0031956753,0.00008759081,0.000011191467],"category_scores_gemma":[0.00021913929,0.00020105811,0.000052053485,0.00087936403,0.000096192176,0.00020547371,0.0018880664,0.00031705236,0.000040441908],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003185004,0.00043325275,0.380027,0.0002076936,0.0011046233,0.000011281565,0.0059212833,0.27010688,0.0013254844,0.00554548,0.20504303,0.13024212],"study_design_scores_gemma":[0.00015562287,0.0000064643814,0.09791438,0.00004842726,0.00011876405,0.0000019827753,0.00006273219,0.23975275,0.000021252903,0.0004068218,0.6612255,0.0002852862],"about_ca_topic_score_codex":0.00038530436,"about_ca_topic_score_gemma":0.00426602,"teacher_disagreement_score":0.66727144,"about_ca_system_score_codex":0.000035848916,"about_ca_system_score_gemma":0.000018501638,"threshold_uncertainty_score":0.81989115},"labels":[],"label_agreement":null},{"id":"W2782496420","doi":"10.1007/s12083-017-0628-7","title":"Ad-hoc messaging infrastructure for peer-to-peer communication","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Peer-to-peer; Computer science; Wireless ad hoc network; Computer network; World Wide Web; Telecommunications; Wireless","score_opus":0.020752066582423605,"score_gpt":0.292478541460965,"score_spread":0.2717264748785414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782496420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013578673,0.00031765137,0.9336029,0.05384951,0.0005236852,0.0014554105,0.000055143213,0.00040112977,0.00843667],"genre_scores_gemma":[0.75685245,0.00004368799,0.22143942,0.0061162133,0.001757989,0.001114334,0.00021281696,0.00006791388,0.012395173],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647653,0.000077019315,0.0005938439,0.0010217405,0.0009932789,0.0008376107],"domain_scores_gemma":[0.9949333,0.00039854113,0.0001992863,0.0017784003,0.0019771666,0.0007132962],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016039817,0.00040438876,0.00041979123,0.00023981169,0.0013667062,0.00072134554,0.0016873609,0.00020574393,0.000021802734],"category_scores_gemma":[0.00006186002,0.00041125214,0.00010548921,0.0012780114,0.00013808797,0.0002388483,0.0008173257,0.00038373325,0.00013541662],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033353896,0.000058210077,0.000351515,0.000017949433,0.00004724947,0.0000010956209,0.0025163745,0.0012396856,0.00007645938,0.02361428,0.36394963,0.6080942],"study_design_scores_gemma":[0.0003182106,0.00011403511,0.0007065213,0.000077769095,0.000040395204,0.000017453516,0.00013715483,0.11535869,0.00003276853,0.008339489,0.8743849,0.00047263887],"about_ca_topic_score_codex":0.000022811875,"about_ca_topic_score_gemma":0.00004274175,"teacher_disagreement_score":0.7554946,"about_ca_system_score_codex":0.000089189336,"about_ca_system_score_gemma":0.000117503354,"threshold_uncertainty_score":0.99993336},"labels":[],"label_agreement":null},{"id":"W2803003248","doi":"10.1007/s12083-018-0656-y","title":"Connectivity preserving obstacle avoidance localized motion planning algorithms for mobile wireless sensor networks","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Algorithm; Wireless sensor network; Motion planning; Probabilistic logic; Obstacle avoidance; Cellular network; Wireless network; Distributed algorithm; Wireless; Real-time computing; Distributed computing; Computer network; Mobile robot; Artificial intelligence; Telecommunications; Robot","score_opus":0.037207322528434277,"score_gpt":0.32187880180464234,"score_spread":0.28467147927620806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803003248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031357305,0.00012062182,0.99131715,0.002511491,0.00029264888,0.0017655756,0.000013302478,0.00033412754,0.00050936226],"genre_scores_gemma":[0.76613003,0.000016700296,0.22645983,0.00096514623,0.0016662118,0.0026609765,0.000050990653,0.000042005726,0.00200809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997997,0.000085105836,0.00029157955,0.00071378675,0.00036294264,0.00054961746],"domain_scores_gemma":[0.9978966,0.00037800503,0.00010383346,0.0005710503,0.0007413427,0.0003091574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009967561,0.00019425403,0.00022721814,0.000108742155,0.00089655485,0.00043077144,0.00055170426,0.00009824534,0.0000058051796],"category_scores_gemma":[0.00006338817,0.00020398336,0.000049979288,0.0008563302,0.000069388196,0.00022981309,0.00030893777,0.00017626022,0.000018606182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028816845,0.000120037344,0.0011757541,0.00003571231,0.000035082503,8.689221e-7,0.0020391878,0.62255174,0.00026696603,0.006604608,0.010257552,0.35688367],"study_design_scores_gemma":[0.00029519937,0.00009053596,0.00031172571,0.000047391044,0.000006662662,0.0000041926883,0.0000613973,0.8154565,0.0001359334,0.0007082305,0.18266308,0.00021916017],"about_ca_topic_score_codex":0.00003275105,"about_ca_topic_score_gemma":0.000014539528,"teacher_disagreement_score":0.7648573,"about_ca_system_score_codex":0.000049857463,"about_ca_system_score_gemma":0.000031790103,"threshold_uncertainty_score":0.83182},"labels":[],"label_agreement":null},{"id":"W2807377293","doi":"10.1007/s12083-018-0658-9","title":"Localized topology control and on-demand power-efficient routing for wireless ad hoc and sensor networks","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Topology control; Computer science; Computer network; Routing protocol; Topology (electrical circuits); Distributed computing; Wireless ad hoc network; Link-state routing protocol; Optimized Link State Routing Protocol; Geographic routing; Network topology; Dynamic Source Routing; Network packet; Wireless network; Wireless; Key distribution in wireless sensor networks; Mathematics; Telecommunications","score_opus":0.011553187671306584,"score_gpt":0.2658277026464752,"score_spread":0.2542745149751686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807377293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023805834,0.0007273496,0.9649292,0.0077949697,0.00038694212,0.0017290217,0.000013130549,0.0001846608,0.00042888403],"genre_scores_gemma":[0.976829,0.000054612494,0.017931486,0.0028304618,0.0011138876,0.00080790365,0.000008614117,0.00003471906,0.00038931533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753207,0.00008549837,0.0003863313,0.0009962502,0.00028009166,0.00071974105],"domain_scores_gemma":[0.9977015,0.0007654522,0.00013976614,0.0006291196,0.0003408753,0.00042326032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096876425,0.00030030266,0.00040561653,0.00010614896,0.0008155431,0.00032877905,0.00039576477,0.00016737136,0.0000026789428],"category_scores_gemma":[0.000043063188,0.0002900406,0.000048270158,0.00047819057,0.00022496504,0.000054130818,0.00029917547,0.0002201217,0.000010170764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030772857,0.00023063365,0.0020482703,0.00003962443,0.00016748346,0.0000063187467,0.0027843125,0.05894569,0.00028290384,0.13307032,0.018029261,0.7840874],"study_design_scores_gemma":[0.001073797,0.00035459932,0.0008961064,0.00006132335,0.000033811248,0.000028701064,0.0000678812,0.7675849,0.000018790926,0.0008374386,0.22867689,0.00036575948],"about_ca_topic_score_codex":0.000010110132,"about_ca_topic_score_gemma":0.000022863258,"teacher_disagreement_score":0.95302314,"about_ca_system_score_codex":0.000034664874,"about_ca_system_score_gemma":0.000026057676,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2896529804","doi":"10.1007/s12083-018-0687-4","title":"Toward citation recommender systems considering the article impact in the extended nearby citation network","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Citation; Computer science; Impact factor; Metadata; Bibliometrics; Similarity (geometry); Information retrieval; Recommender system; Citation impact; Data science; Empirical research; Baseline (sea); Data mining; World Wide Web; Artificial intelligence; Statistics; Mathematics","score_opus":0.0670989261935125,"score_gpt":0.3148766972970984,"score_spread":0.2477777711035859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896529804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032288246,0.00018388896,0.93660104,0.028244073,0.00036402835,0.00091579556,0.0000016860515,0.000108115564,0.0012931116],"genre_scores_gemma":[0.9799236,0.0000063933644,0.01643936,0.0017082009,0.0013248204,0.0004885081,0.000004952868,0.000011879806,0.00009229413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983472,0.00016613795,0.00031478706,0.0003900087,0.00038823296,0.00039363952],"domain_scores_gemma":[0.99849135,0.00046710356,0.000089819194,0.00060908747,0.0002427297,0.00009991504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018788755,0.00013927072,0.0001314749,0.0000783609,0.00051368977,0.0006029754,0.0005354164,0.00004952252,0.0000025051932],"category_scores_gemma":[0.000070503185,0.00009643698,0.00003549926,0.0011371026,0.00004377523,0.00015581529,0.00010917722,0.00018443214,0.00003496812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024076651,0.00010633039,0.0067183855,0.000026881446,0.000070633134,0.000002816095,0.03849174,0.33033985,0.00037402986,0.15324807,0.04432169,0.4262755],"study_design_scores_gemma":[0.00026585787,0.00007914325,0.020415189,0.00007370737,0.000018472298,0.000029249964,0.0012546639,0.83997685,0.000022354683,0.023030369,0.114541285,0.0002928723],"about_ca_topic_score_codex":0.00015894647,"about_ca_topic_score_gemma":0.00006772337,"teacher_disagreement_score":0.94763535,"about_ca_system_score_codex":0.00005555108,"about_ca_system_score_gemma":0.00003499362,"threshold_uncertainty_score":0.5814505},"labels":[],"label_agreement":null},{"id":"W2896582760","doi":"10.1007/s12083-018-0691-8","title":"Secure, flexible and high-efficient similarity search over encrypted data in multiple clouds","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Encryption; Computer science; Similarity (geometry); Data mining; Information retrieval; Computer network; Artificial intelligence","score_opus":0.045437547255528864,"score_gpt":0.3103035509543397,"score_spread":0.26486600369881086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896582760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16969141,0.00023530485,0.8242758,0.00379506,0.00022234915,0.00080298865,0.00028276752,0.00021134452,0.0004829876],"genre_scores_gemma":[0.95239747,0.000027756483,0.046047937,0.00064016465,0.00054898433,0.000101064805,0.00019352106,0.000012429745,0.000030670024],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771863,0.0000642697,0.0002662014,0.0009819668,0.00048807182,0.00048084802],"domain_scores_gemma":[0.9976867,0.00022339147,0.00004534192,0.0015250758,0.00020669724,0.00031281362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011619118,0.0001863624,0.00019889718,0.00020531405,0.0004901757,0.0003435703,0.0011334145,0.0000925319,0.000008499574],"category_scores_gemma":[0.000056572935,0.00018982946,0.000021710193,0.001672264,0.00014597471,0.00018754079,0.0017158327,0.00026573916,0.000025909236],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014425164,0.0013395327,0.09786145,0.00012058669,0.000100699355,0.000014378402,0.008381338,0.0035375622,0.000994149,0.39765912,0.06905018,0.42079675],"study_design_scores_gemma":[0.00076621317,0.00010593337,0.094834745,0.00006207945,0.000017458082,0.000009958084,0.00008706691,0.3473282,0.00024313977,0.008014152,0.5479876,0.0005435041],"about_ca_topic_score_codex":0.0005751206,"about_ca_topic_score_gemma":0.00044955034,"teacher_disagreement_score":0.7827061,"about_ca_system_score_codex":0.000022625849,"about_ca_system_score_gemma":0.00004173537,"threshold_uncertainty_score":0.77410203},"labels":[],"label_agreement":null},{"id":"W2915400206","doi":"10.1007/s12083-019-00723-5","title":"Performance Modeling of Linux Network System with Open vSwitch","year":2019,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Operating system; Computer science","score_opus":0.017960956147394465,"score_gpt":0.24236119128147107,"score_spread":0.22440023513407661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915400206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039944116,0.00022273065,0.95041454,0.0013748991,0.00027893204,0.0014033379,0.0000041403678,0.00024188055,0.0061154147],"genre_scores_gemma":[0.93192416,0.00001916941,0.06582399,0.0003547303,0.0006183954,0.00040959267,0.000011911438,0.000029710596,0.0008083617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997946,0.00003000065,0.0003767035,0.00066942355,0.00047786656,0.00049996184],"domain_scores_gemma":[0.9981218,0.00012967261,0.00013812666,0.0009745487,0.00040128478,0.00023459336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079234893,0.00022432173,0.00036963736,0.000080993515,0.00032181336,0.00031382992,0.0013517466,0.00008092139,0.0000028815327],"category_scores_gemma":[0.000005426201,0.00019414992,0.000038739654,0.0012650312,0.00002000655,0.00022024343,0.00071818574,0.00019097218,0.00006851594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026613194,0.000029162205,0.014752805,0.000055122226,0.00002991529,5.6654295e-7,0.00030624133,0.92164886,0.000012007538,0.015769003,0.0023071396,0.045062587],"study_design_scores_gemma":[0.0003192081,0.00013049888,0.0011614332,0.00038034766,0.000018421235,0.00001678927,0.00005089102,0.9466467,0.0000110277115,0.00022022858,0.050733384,0.00031107862],"about_ca_topic_score_codex":0.00008932659,"about_ca_topic_score_gemma":0.000016964948,"teacher_disagreement_score":0.89198005,"about_ca_system_score_codex":0.000038863796,"about_ca_system_score_gemma":0.00006781094,"threshold_uncertainty_score":0.7917204},"labels":[],"label_agreement":null},{"id":"W2957998068","doi":"10.1007/s12083-019-00787-3","title":"Secure and reliable certification management scheme for large-scale MANETs based on a distributed anonymous authority","year":2019,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Compromise; Certification; Computer security; Computer science; Adversary; Certificate authority; Scheme (mathematics); Service (business); Computer network; Distributed computing; Business; Public-key cryptography; Mathematics; Law; Encryption","score_opus":0.01237803639514889,"score_gpt":0.2541564328483454,"score_spread":0.2417783964531965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957998068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036312651,0.00007875291,0.9821203,0.009566724,0.00022081374,0.0026379118,0.000074690564,0.0002461786,0.0014234047],"genre_scores_gemma":[0.8472757,0.000015454441,0.14457375,0.0012309956,0.0004016103,0.0027932627,0.00038937188,0.000036041976,0.0032838378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790215,0.000028997121,0.00027235426,0.0009036712,0.0003949675,0.0004978644],"domain_scores_gemma":[0.9983308,0.00013876027,0.00009618548,0.00095817517,0.00021348013,0.00026263107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019091,0.0002171669,0.00021332498,0.00010143378,0.00039306967,0.00029241844,0.00047997513,0.00010716966,0.0000066821794],"category_scores_gemma":[0.000009448201,0.00022704914,0.000044544104,0.00071007985,0.00001691065,0.00009720035,0.00023238118,0.00017090747,0.000056457608],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021712903,0.0011193028,0.013946164,0.00053617253,0.00014054535,0.0000064411424,0.0012642015,0.13498372,0.0005127501,0.32865122,0.25124094,0.2673814],"study_design_scores_gemma":[0.00032691046,0.00006378992,0.0024373375,0.000043999575,0.000013999779,0.0000017814807,0.000021074758,0.49230775,0.000029225062,0.0012437378,0.50331324,0.00019717493],"about_ca_topic_score_codex":0.000007906017,"about_ca_topic_score_gemma":0.000010937446,"teacher_disagreement_score":0.84364444,"about_ca_system_score_codex":0.000060774022,"about_ca_system_score_gemma":0.000019065666,"threshold_uncertainty_score":0.9258795},"labels":[],"label_agreement":null},{"id":"W2971237353","doi":"10.1007/s12083-019-00810-7","title":"Achieve privacy-preserving simplicial depth query over collaborative cloud servers","year":2019,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Server; Cloud computing; Computer science; Dimension (graph theory); Scheme (mathematics); Computation; Ranking (information retrieval); Theoretical computer science; Distributed computing; Data mining; Algorithm; Information retrieval; Mathematics; Computer network; Operating system","score_opus":0.017803468787311042,"score_gpt":0.2844530543463833,"score_spread":0.26664958555907226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971237353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09467415,0.00033393313,0.7160508,0.17247415,0.0014198208,0.0032395497,0.00015319977,0.0021801763,0.0094741965],"genre_scores_gemma":[0.76000154,0.000060543436,0.23389804,0.0026070708,0.0011778342,0.0007735321,0.00010060854,0.00007124885,0.0013095761],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996712,0.00009201413,0.00042228823,0.0012291828,0.00077892997,0.00076556305],"domain_scores_gemma":[0.99163616,0.00042203063,0.0001826021,0.0070224376,0.00043277306,0.00030397915],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00083143864,0.00035619145,0.00037078105,0.00024525024,0.0004664871,0.00057829404,0.014594938,0.00020954508,0.00001687228],"category_scores_gemma":[0.0017770799,0.00037308785,0.00006702431,0.0024170096,0.00007451642,0.00051310903,0.044412117,0.00047084907,0.0002441507],"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.00003859331,0.00012908778,0.017144483,0.00005037501,0.000107384185,0.0000052679584,0.0009774307,0.0021463027,0.0011621837,0.02437902,0.8646325,0.089227386],"study_design_scores_gemma":[0.00044537362,0.00012427612,0.008830648,0.00010144863,0.000023224055,0.000009429827,0.0001696281,0.05248608,0.00042407945,0.0824294,0.8542006,0.00075582805],"about_ca_topic_score_codex":0.00013116591,"about_ca_topic_score_gemma":0.00009788801,"teacher_disagreement_score":0.66532737,"about_ca_system_score_codex":0.00014106011,"about_ca_system_score_gemma":0.00011818811,"threshold_uncertainty_score":0.9998721},"labels":[],"label_agreement":null},{"id":"W3000787661","doi":"10.1007/s12083-019-00850-z","title":"Performance analysis of Hyperledger Fabric platform: A hierarchical model approach","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Timeout; Computer science; Database transaction; Block (permutation group theory); Transaction processing; Throughput; Process (computing); Distributed computing; Reliability engineering; Computer network; Database; Operating system; Engineering; Mathematics","score_opus":0.030919440027697077,"score_gpt":0.2527427510911708,"score_spread":0.2218233110634737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000787661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07070762,0.000076049626,0.9163781,0.01012577,0.000013383342,0.00045490795,0.00001595103,0.00023110352,0.0019971372],"genre_scores_gemma":[0.886846,0.000017991588,0.11138067,0.0009424032,0.00009634377,0.00053663243,0.000028190378,0.000010350611,0.00014142509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983356,0.000014543583,0.00033527412,0.00064873206,0.00035406245,0.00031177475],"domain_scores_gemma":[0.99863327,0.000065800814,0.000087536755,0.0007077284,0.00022407227,0.00028161853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033562657,0.00016892134,0.00034171218,0.0002960043,0.00029175167,0.00006334338,0.00093618664,0.0001204352,0.000001901396],"category_scores_gemma":[0.00001925933,0.00016542964,0.00009048936,0.0040284684,0.00008419844,0.00007845849,0.00042821138,0.00027494188,0.000015062854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002077836,0.0003482906,0.0061171367,0.00006139077,0.00043040985,5.0360705e-7,0.0052492195,0.30533397,0.0006460142,0.2667198,0.0048260787,0.41024643],"study_design_scores_gemma":[0.0000919941,0.000033099433,0.0017601651,0.0000037848718,0.00010539329,0.0000021013639,0.000026777634,0.96688557,0.00006388547,0.0014032179,0.029441223,0.00018278013],"about_ca_topic_score_codex":0.000007252136,"about_ca_topic_score_gemma":0.0000020674659,"teacher_disagreement_score":0.8161384,"about_ca_system_score_codex":0.000017322247,"about_ca_system_score_gemma":0.00003684472,"threshold_uncertainty_score":0.6746025},"labels":[],"label_agreement":null},{"id":"W3022244822","doi":"10.1007/s12083-019-00869-2","title":"Adaptive privacy-preserving federated learning","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Computer science; Differential privacy; Encryption; Overhead (engineering); Obfuscation; The Internet; Noise (video); Relevance (law); Computation; Computer security; Artificial intelligence; Image (mathematics); Machine learning; Theoretical computer science; Data mining; Algorithm; World Wide Web","score_opus":0.044454744908335064,"score_gpt":0.280935515898559,"score_spread":0.2364807709902239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022244822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015415124,0.00016185864,0.77500623,0.21884508,0.00009289554,0.00055207295,0.000009624653,0.0015545434,0.002236169],"genre_scores_gemma":[0.6704811,0.000029593133,0.32565504,0.0024323158,0.0005262568,0.00040943854,0.000035423407,0.00003686257,0.0003939565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741405,0.00007714543,0.00032603566,0.0010406782,0.0005643908,0.0005776875],"domain_scores_gemma":[0.9960594,0.00027060686,0.000117543335,0.0028181863,0.00032861464,0.00040564185],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005217573,0.00026072212,0.00026487024,0.00012511328,0.0007601169,0.000649274,0.011616062,0.00012364886,0.000009034434],"category_scores_gemma":[0.0053618927,0.00027872913,0.000045147553,0.0018416174,0.00005334663,0.0003160527,0.04855085,0.0005805644,0.00017678518],"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.000020128959,0.00005739557,0.002101471,0.00003110614,0.00007119036,0.000010181956,0.0012568537,0.005209496,0.0012405285,0.006233289,0.6277144,0.35605398],"study_design_scores_gemma":[0.00015390303,0.00008997906,0.00055663683,0.000046996818,0.000010442699,0.000006399401,0.00011410522,0.42740834,0.00033557203,0.01504956,0.55586356,0.000364525],"about_ca_topic_score_codex":0.00004025582,"about_ca_topic_score_gemma":0.0000066175303,"teacher_disagreement_score":0.6689396,"about_ca_system_score_codex":0.000053642376,"about_ca_system_score_gemma":0.00004862616,"threshold_uncertainty_score":0.9999665},"labels":[],"label_agreement":null},{"id":"W3022303172","doi":"10.1007/s12083-019-00832-1","title":"Toward efficient and effective bullying detection in online social network","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Popularity; The Internet; Data mining; Harm; Categorization; Social media; Scheme (mathematics); Social network (sociolinguistics); Machine learning; Artificial intelligence; World Wide Web","score_opus":0.019685359894035227,"score_gpt":0.25688717547589324,"score_spread":0.23720181558185802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022303172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14334226,0.00011614101,0.84002167,0.0147579685,0.0002174636,0.0010007622,0.000005091596,0.0002728904,0.0002657362],"genre_scores_gemma":[0.98876554,0.000010811073,0.0081123365,0.0012234484,0.0014658672,0.0003511588,0.0000075770026,0.00001669263,0.000046593075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840504,0.000066400746,0.00023072974,0.0006115027,0.00029578645,0.00039055326],"domain_scores_gemma":[0.9992879,0.00010643315,0.00006249774,0.00016436544,0.000120058365,0.00025872153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235124,0.00017439497,0.0002035339,0.00009587777,0.00044640971,0.00021065748,0.00023265045,0.000086755164,0.0000010147673],"category_scores_gemma":[0.000043279004,0.0001875355,0.000036457695,0.0013079299,0.0000281922,0.00006255661,0.00019055324,0.00027440023,0.000022122535],"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.000035261546,0.00006302459,0.00075420167,0.000028837969,0.000019759565,0.0000046836153,0.003835201,0.028969549,0.002199446,0.0018802849,0.00081012474,0.9613996],"study_design_scores_gemma":[0.0014801952,0.0005815125,0.04389415,0.00015733177,0.00006283348,0.0000579365,0.0006225991,0.49111667,0.00228836,0.0028875868,0.45553163,0.001319201],"about_ca_topic_score_codex":0.000047764857,"about_ca_topic_score_gemma":0.00003880296,"teacher_disagreement_score":0.96008044,"about_ca_system_score_codex":0.000051443058,"about_ca_system_score_gemma":0.000017016158,"threshold_uncertainty_score":0.7647475},"labels":[],"label_agreement":null},{"id":"W3035674285","doi":"10.1007/s12083-020-00922-5","title":"Security and privacy of machine learning assisted P2P networks","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"University of Waterloo; Ministry of Industry and Information Technology of the People's Republic of China; University of Electronic Science and Technology of China; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Internet privacy; Computer security","score_opus":0.03134133320113444,"score_gpt":0.27585303875896744,"score_spread":0.244511705557833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035674285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066398787,0.00072246185,0.8784215,0.112435274,0.00007625949,0.00047704738,0.000019439094,0.0006893657,0.00051881117],"genre_scores_gemma":[0.88358074,0.00010561872,0.11509795,0.00075495726,0.00023502977,0.00011725879,0.00003876508,0.000018551973,0.000051151594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982432,0.000058326932,0.0003128372,0.0006873802,0.00034877253,0.00034948596],"domain_scores_gemma":[0.99713326,0.00024532588,0.00013778651,0.0020492459,0.00017156449,0.00026283116],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00050837814,0.00018905255,0.00026693958,0.00008951988,0.00028958273,0.00018616962,0.0051590004,0.00010994092,0.0000030733358],"category_scores_gemma":[0.00212799,0.00019511818,0.00003374349,0.0011892689,0.0000820438,0.00014682031,0.022417232,0.00044852553,0.000007824391],"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.000032967047,0.00015122555,0.030299189,0.00012968446,0.00012219511,0.000007873652,0.0020820634,0.007319831,0.00083702966,0.011933372,0.18010212,0.76698244],"study_design_scores_gemma":[0.00019128562,0.00007610628,0.002854637,0.00004244151,0.000017139202,0.000010246194,0.00003063387,0.65120625,0.000107950844,0.010296294,0.33490762,0.0002593698],"about_ca_topic_score_codex":0.000038185117,"about_ca_topic_score_gemma":0.000006809734,"teacher_disagreement_score":0.87694085,"about_ca_system_score_codex":0.0000193086,"about_ca_system_score_gemma":0.000019699632,"threshold_uncertainty_score":0.98548925},"labels":[],"label_agreement":null},{"id":"W3037670343","doi":"10.1007/s12083-020-00953-y","title":"An analytical model for churn process in Bitcoin network with ordinary and relay nodes","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Node (physics); Computer science; Computer network; Block (permutation group theory); Markov chain; Database transaction; Markov process; Distributed computing; Mathematics; Engineering","score_opus":0.026222623108315347,"score_gpt":0.29272832353568445,"score_spread":0.2665057004273691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037670343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057200838,0.000119774515,0.9026269,0.038747672,0.000010633478,0.0009162912,0.0000091899865,0.00023784833,0.00013087326],"genre_scores_gemma":[0.868669,0.000010910094,0.12814374,0.0015297411,0.00021160427,0.0013458824,0.000014613039,0.0000177287,0.000056801106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983989,0.000018232924,0.00024067656,0.0007630782,0.00019289518,0.00038621027],"domain_scores_gemma":[0.9988939,0.000095152376,0.000057412544,0.00046348554,0.00018444593,0.0003055649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003992679,0.000178615,0.00023614883,0.0000910367,0.00034204574,0.00013262671,0.00055540993,0.00011954125,5.054484e-7],"category_scores_gemma":[0.000018113937,0.00016591906,0.00002068266,0.0013045333,0.00008161104,0.00011151863,0.0001628959,0.00023877213,0.0000027503072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009391482,0.00030252652,0.01873363,0.000083377505,0.00004425089,0.0000037670222,0.004194177,0.49755237,0.00007070966,0.33222395,0.0058063027,0.14089103],"study_design_scores_gemma":[0.0002463809,0.00011789149,0.0011361687,0.000021286154,0.0000150334545,0.000008668926,0.00005735262,0.9653895,0.000009904762,0.013884337,0.018885072,0.00022839048],"about_ca_topic_score_codex":0.000007914641,"about_ca_topic_score_gemma":0.000030359606,"teacher_disagreement_score":0.8114681,"about_ca_system_score_codex":0.0000157945,"about_ca_system_score_gemma":0.000047025682,"threshold_uncertainty_score":0.6765983},"labels":[],"label_agreement":null},{"id":"W3044914719","doi":"10.1007/s12083-020-00968-5","title":"Performance analysis of heterogeneous cloud-edge services: A modeling approach","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Enhanced Data Rates for GSM Evolution; Workload; Service (business); Distributed computing; Edge computing; Constraint (computer-aided design); Artificial intelligence; Engineering","score_opus":0.03176326347753247,"score_gpt":0.2497865763493914,"score_spread":0.21802331287185892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044914719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12938984,0.0001338927,0.8671526,0.0015477773,0.0002974581,0.0002851905,0.0000017688607,0.00016305734,0.0010284535],"genre_scores_gemma":[0.95972455,0.000010644784,0.037167627,0.0010024372,0.0019002312,0.0000893893,0.000029716883,0.000014786766,0.00006062033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982852,0.00002515792,0.0003515403,0.00060097,0.00037556514,0.00036157656],"domain_scores_gemma":[0.9988157,0.000046047957,0.00009422351,0.00049565895,0.00025809227,0.00029026374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033321886,0.00017697646,0.00033383726,0.0001821099,0.00030147252,0.00015340594,0.00079756253,0.000057454185,5.356077e-7],"category_scores_gemma":[0.0000060084362,0.00018043643,0.000100193065,0.002648941,0.000016614264,0.00008892819,0.0004526858,0.00013683188,0.000015706708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005934103,0.000038157086,0.0018027488,0.00006736155,0.0001683491,4.510077e-7,0.0069737984,0.91997766,0.000090913076,0.000337581,0.00048191877,0.0700551],"study_design_scores_gemma":[0.000068887806,0.000027478713,0.0001789791,0.000017513163,0.00011152017,0.0000027703945,0.00004441369,0.96200365,0.000030749346,0.00006095144,0.03726038,0.00019271267],"about_ca_topic_score_codex":0.000031457872,"about_ca_topic_score_gemma":0.0000020001182,"teacher_disagreement_score":0.8303347,"about_ca_system_score_codex":0.000018058143,"about_ca_system_score_gemma":0.000025359248,"threshold_uncertainty_score":0.73579836},"labels":[],"label_agreement":null},{"id":"W3107178473","doi":"10.1007/s12083-020-01007-z","title":"A lightweight multi-party authentication in insecure reader-server channel in RFID-based IoT","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"RFID technology advancements","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Government of Canada","funders":"","keywords":"Authentication protocol; Computer science; Authentication (law); Internet of Things; Radio-frequency identification; Computer security; Authentication server; Focus (optics); Lightweight Extensible Authentication Protocol; Computer network; Mutual authentication; Protocol (science); Chip Authentication Program; Identification (biology); Challenge–response authentication","score_opus":0.02730207909898631,"score_gpt":0.25836616586740396,"score_spread":0.23106408676841766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107178473","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.61685246,0.001113543,0.3171657,0.058113318,0.00036279825,0.0037359956,0.00007314635,0.0017303696,0.00085265207],"genre_scores_gemma":[0.99144435,0.000014910963,0.0061830026,0.0007260354,0.00016585615,0.0012421561,0.000060032417,0.000044990044,0.00011867904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986524,0.000019609997,0.00033298272,0.0004235319,0.00020021145,0.0003712434],"domain_scores_gemma":[0.99935436,0.00004693454,0.000038104336,0.00032956793,0.00006571644,0.0001652997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018946499,0.00020222571,0.00021590314,0.00022233049,0.000075857286,0.00003173354,0.00025257783,0.00015120124,0.000008622913],"category_scores_gemma":[0.000040909643,0.00023098801,0.00002591396,0.0012386495,0.00002915525,0.000040465646,0.00006370518,0.00032669376,0.000081464445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069239955,0.000625421,0.0705331,0.00034832468,0.00009585837,0.000020250645,0.008877816,0.8467312,0.011334788,0.0041633025,0.01162994,0.045570757],"study_design_scores_gemma":[0.0016589103,0.000059477275,0.04382259,0.00020323027,0.00002986367,0.0000022195966,0.0001864191,0.64415944,0.002920598,0.0012423508,0.30500317,0.00071176275],"about_ca_topic_score_codex":0.000016908907,"about_ca_topic_score_gemma":0.00024040861,"teacher_disagreement_score":0.37459186,"about_ca_system_score_codex":0.00008069549,"about_ca_system_score_gemma":0.000013963498,"threshold_uncertainty_score":0.94194174},"labels":[],"label_agreement":null},{"id":"W3128426930","doi":"10.1007/s12083-021-01084-8","title":"Cost-effective migration-based dynamic platform defense technique: a CTMDP approach","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Markov decision process; Sophistication; Computer science; Cyberspace; Service (business); Process (computing); Computer security; Operations research; Markov process; Distributed computing; Mathematical optimization; Engineering; Economics; The Internet","score_opus":0.02082296498399807,"score_gpt":0.2756636008946176,"score_spread":0.25484063591061956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128426930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017564088,0.0002015284,0.9881704,0.0045044227,0.00020091406,0.0026120727,0.000013286475,0.00038317638,0.00215782],"genre_scores_gemma":[0.81425947,0.000037619986,0.16945387,0.0022694508,0.00055804645,0.012151107,0.00015503343,0.000036953777,0.0010784508],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979762,0.00007559266,0.0002945561,0.00078441977,0.00046413892,0.0004051184],"domain_scores_gemma":[0.99815696,0.00024118778,0.00009352111,0.00071740546,0.00051413185,0.0002767803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006244544,0.00023222627,0.00023153571,0.00017924023,0.0006414841,0.0003694659,0.00041078232,0.00014395894,0.0000070856445],"category_scores_gemma":[0.000052604177,0.00024334021,0.00008619962,0.0017994508,0.00004337328,0.00017146126,0.00022848694,0.0003238499,0.000047338875],"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.000037719332,0.0003667175,0.00026726694,0.000052108175,0.00005300661,0.000007812244,0.0014025744,0.030067105,0.0019462188,0.026673635,0.010441071,0.9286848],"study_design_scores_gemma":[0.000267062,0.00007875343,0.00048453148,0.000054860044,0.000023158182,0.000051677416,0.000056116427,0.3744725,0.0016844161,0.0040065954,0.61843693,0.00038338828],"about_ca_topic_score_codex":0.000037706075,"about_ca_topic_score_gemma":0.00015259997,"teacher_disagreement_score":0.9283014,"about_ca_system_score_codex":0.00011285839,"about_ca_system_score_gemma":0.000085391745,"threshold_uncertainty_score":0.9923126},"labels":[],"label_agreement":null},{"id":"W3136302944","doi":"10.1007/s12083-021-01091-9","title":"Obfuscation of images via differential privacy: From facial images to general images","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Face recognition and analysis","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Obfuscation; Computer science; Differential privacy; Context (archaeology); Anonymity; Artificial intelligence; Pixel; Face (sociological concept); Noise (video); Generative grammar; Generative model; Machine learning; Image (mathematics); Computer vision; Computer security; Data mining","score_opus":0.014308854766899274,"score_gpt":0.26452120018150027,"score_spread":0.250212345414601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136302944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037462976,0.00014961703,0.9450922,0.016056823,0.00018622787,0.0002887226,0.00013843503,0.000119716584,0.0005052735],"genre_scores_gemma":[0.8949327,0.000053642245,0.09988163,0.0007413085,0.0009198804,0.0002542024,0.00026418254,0.000019470624,0.0029330144],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981886,0.00006457614,0.00034208305,0.000652268,0.0004553115,0.0002971181],"domain_scores_gemma":[0.9983969,0.00009431395,0.00009801438,0.0005672158,0.0005680241,0.00027554145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001647007,0.0001917058,0.0002820218,0.00016235732,0.00026669182,0.00033947048,0.00047952172,0.00006045477,0.000053322972],"category_scores_gemma":[0.00004589487,0.00019889143,0.00010860194,0.00095955416,0.000036176174,0.00014001755,0.00040997408,0.00011821785,0.000098167635],"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.000008111461,0.0002250436,0.0033472069,0.000017992326,0.00011471389,0.000003150702,0.0009861534,0.0015154083,0.15638262,0.00090789027,0.02486427,0.81162745],"study_design_scores_gemma":[0.0012747276,0.0001266989,0.12547092,0.00019901528,0.000390577,0.000020773077,0.00028346258,0.04353201,0.2750262,0.013038734,0.53874165,0.001895217],"about_ca_topic_score_codex":0.00013947199,"about_ca_topic_score_gemma":0.000025327414,"teacher_disagreement_score":0.8574697,"about_ca_system_score_codex":0.000026785576,"about_ca_system_score_gemma":0.00004430806,"threshold_uncertainty_score":0.81105566},"labels":[],"label_agreement":null},{"id":"W3154438993","doi":"10.1007/s12083-021-01124-3","title":"Energy efficient data correlation aware opportunistic routing protocol for wireless sensor networks","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Wireless sensor network; Computer science; Computer network; Key distribution in wireless sensor networks; Greedy algorithm; Routing protocol; Mobile wireless sensor network; Redundancy (engineering); Data redundancy; Geographic routing; Distributed computing; Wireless Routing Protocol; Routing (electronic design automation); Real-time computing; Wireless network; Wireless; Algorithm","score_opus":0.0514808255914984,"score_gpt":0.3148267537958876,"score_spread":0.2633459282043892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154438993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007817948,0.000022076229,0.9763465,0.0037496523,0.00044177723,0.0183025,0.000048699112,0.00039191052,0.0006187149],"genre_scores_gemma":[0.5527657,0.000014209743,0.16923848,0.003345089,0.0056495667,0.25874057,0.002347467,0.00022613589,0.007672759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960841,0.00012517576,0.00065345643,0.00159665,0.00069575245,0.00084488065],"domain_scores_gemma":[0.9955327,0.0006825618,0.00026394054,0.0020773264,0.0009373052,0.00050618936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009297253,0.00037933385,0.00038571653,0.00013692309,0.0009546188,0.00061366276,0.0013010093,0.00019264498,0.000004745712],"category_scores_gemma":[0.00008410871,0.00040824903,0.00007992795,0.0014890004,0.000056560853,0.0001280716,0.0012302615,0.0002711331,0.000010635986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013805775,0.00012975685,0.00015360721,0.000021197222,0.000025413143,0.0000071108248,0.00010452154,0.82329124,0.000048064074,0.038807284,0.008808916,0.12858911],"study_design_scores_gemma":[0.00032820366,0.000027590566,0.00006546813,0.00011156787,0.000021529135,0.000023944222,0.00003565655,0.7067155,0.00003287398,0.00008897829,0.2922026,0.0003460884],"about_ca_topic_score_codex":0.000031153057,"about_ca_topic_score_gemma":0.000045499426,"teacher_disagreement_score":0.80710804,"about_ca_system_score_codex":0.00009051205,"about_ca_system_score_gemma":0.00015905347,"threshold_uncertainty_score":0.9998369},"labels":[],"label_agreement":null},{"id":"W3161645673","doi":"10.1007/s12083-021-01164-9","title":"Trust and scalable blockchain-based message exchanging scheme on VANET","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Vehicular ad hoc network; Scalability; Computer network; Wireless ad hoc network; Overhead (engineering); Blockchain; Computer security; Distributed computing; Database; Telecommunications; Wireless","score_opus":0.009932272159633892,"score_gpt":0.22733360209158096,"score_spread":0.21740132993194708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161645673","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.69111943,0.0078342995,0.2465028,0.018237043,0.0010933718,0.0029967518,0.00018121298,0.0026759082,0.029359188],"genre_scores_gemma":[0.9846034,0.000045313587,0.009599965,0.0011194384,0.0010940537,0.0004998573,0.00011427574,0.00010538812,0.0028182939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981763,0.000031373525,0.000258314,0.0005385133,0.0003779268,0.0006176119],"domain_scores_gemma":[0.9987564,0.00015778237,0.000031773427,0.00050741393,0.00014635055,0.00040028038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039844008,0.00029377194,0.0002881102,0.00013868115,0.00032513976,0.00017651368,0.00015728813,0.00012862716,0.000039034727],"category_scores_gemma":[0.000027870003,0.00033696555,0.000051038838,0.00078712066,0.00003513108,0.000020138188,0.00009225084,0.0003133969,0.00006438523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005799049,0.00003468438,0.00057912245,0.00005301024,0.00004410877,0.000012369723,0.00014181982,0.95613956,0.0010896334,0.0008575391,0.012579031,0.028463323],"study_design_scores_gemma":[0.0002566381,0.000018297562,0.00039550362,0.000105254265,0.000030680603,0.00001484061,0.000046326877,0.5362864,0.0006635821,0.00013665463,0.46172014,0.00032569905],"about_ca_topic_score_codex":0.000009891645,"about_ca_topic_score_gemma":0.000031365613,"teacher_disagreement_score":0.4491411,"about_ca_system_score_codex":0.00006501599,"about_ca_system_score_gemma":0.000025754574,"threshold_uncertainty_score":0.9999082},"labels":[],"label_agreement":null},{"id":"W3165561456","doi":"10.1007/s12083-021-01179-2","title":"Efficient and privacy-preserving range-max query in fog-based agricultural IoT","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Homomorphic encryption; Node (physics); Edge computing; Database; Agriculture; Encryption; Internet of Things; Distributed computing; Computer security; Engineering","score_opus":0.015374023816923606,"score_gpt":0.25350430905466764,"score_spread":0.23813028523774404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165561456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4279562,0.00095403753,0.5344624,0.03216092,0.0014462885,0.0006995823,0.0000015856089,0.00026702194,0.0020519746],"genre_scores_gemma":[0.9542221,0.0000047476233,0.04211788,0.0009537609,0.0019050597,0.00017184058,0.00001485385,0.000015777032,0.00059402466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824613,0.00006006936,0.00027485553,0.0006310175,0.00034116424,0.00044677293],"domain_scores_gemma":[0.99871653,0.00024308277,0.000059948743,0.0005138682,0.00024518144,0.00022141534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262951,0.00017906712,0.00020781478,0.00011664966,0.00037338777,0.00037502745,0.00049296673,0.0000654378,0.0000011112019],"category_scores_gemma":[0.00008102841,0.00016853088,0.000042271473,0.0011810468,0.000024488156,0.00003946819,0.00077691296,0.00020201824,0.000014882189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027984717,0.00064225483,0.05453686,0.00023164197,0.00007456931,0.00006858369,0.011496869,0.24775316,0.0053802356,0.006563787,0.08322715,0.5899969],"study_design_scores_gemma":[0.0006382316,0.000036098965,0.08328369,0.00025841972,0.000018451949,0.000038331134,0.00012320117,0.53673196,0.00046100793,0.00088868756,0.3768867,0.0006352205],"about_ca_topic_score_codex":0.000050867387,"about_ca_topic_score_gemma":0.000022577708,"teacher_disagreement_score":0.58936167,"about_ca_system_score_codex":0.000047981248,"about_ca_system_score_gemma":0.00005502097,"threshold_uncertainty_score":0.68724895},"labels":[],"label_agreement":null},{"id":"W3165673144","doi":"10.1007/s12083-021-01120-7","title":"MASK: Efficient and privacy-preserving m-tree based biometric identification over cloud","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Biometrics; Computer science; Identification (biology); Homomorphic encryption; Cloud computing; Computer security; Service provider; Tree (set theory); Encryption; Server; Information privacy; Data mining; Service (business); Computer network","score_opus":0.02137866558049927,"score_gpt":0.2765908388230916,"score_spread":0.2552121732425923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165673144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033615854,0.0008181185,0.94704694,0.016517235,0.0005259237,0.0005634777,0.000028021366,0.00021699531,0.00066745706],"genre_scores_gemma":[0.9661013,0.000036927653,0.029926939,0.0009357144,0.00040277684,0.00025507275,0.000098458855,0.000019744793,0.0022230488],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99743783,0.000087294946,0.00042196357,0.0009330969,0.00074191805,0.00037791714],"domain_scores_gemma":[0.9974319,0.0002729926,0.00013529837,0.0012045216,0.00059047586,0.0003648299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010857943,0.00019196399,0.00020170245,0.0008650827,0.0005344037,0.0009834643,0.0007937955,0.00009907779,0.00001736103],"category_scores_gemma":[0.00029258884,0.00020944381,0.000057254507,0.008068752,0.000048746828,0.000120743636,0.00073603756,0.00016602043,0.000073055366],"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.000013868437,0.00077935227,0.009557202,0.00016754106,0.0000852637,0.000009980664,0.0024083601,0.0026441019,0.014939681,0.055296954,0.0527315,0.8613662],"study_design_scores_gemma":[0.00035930707,0.000018465587,0.06890039,0.00003521334,0.00002963091,0.000010594387,0.000062599465,0.17897908,0.0014426858,0.0013545791,0.74839103,0.00041644336],"about_ca_topic_score_codex":0.00003718341,"about_ca_topic_score_gemma":0.000013000884,"teacher_disagreement_score":0.93248546,"about_ca_system_score_codex":0.00006559183,"about_ca_system_score_gemma":0.000065029584,"threshold_uncertainty_score":0.9483569},"labels":[],"label_agreement":null},{"id":"W4205605778","doi":"10.1007/s12083-021-01285-1","title":"Understanding MEC empowered vehicle task offloading performance in 6G networks","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Provisioning; Quality of service; Scalability; Latency (audio); Cloud computing; Server; Task (project management); Metric (unit); Quality of experience; Distributed computing; Service (business); Orchestration; Service quality; Computer network; Real-time computing; Engineering; Telecommunications","score_opus":0.04698504848601006,"score_gpt":0.25626864527522913,"score_spread":0.20928359678921907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205605778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032205462,0.00021593565,0.953653,0.006770625,0.0025167214,0.000615667,0.0000011982111,0.0002875236,0.0037338664],"genre_scores_gemma":[0.9919577,0.000010352236,0.0044701626,0.0009960864,0.0016466441,0.00031170106,0.000014268664,0.000024492616,0.0005685778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978087,0.000068976224,0.00034339709,0.0006370874,0.000489834,0.0006519815],"domain_scores_gemma":[0.99892426,0.00021707195,0.00009137663,0.0004860059,0.00007209428,0.00020920117],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011476971,0.00019512884,0.00021569231,0.000258919,0.0013352311,0.0002894041,0.00079055014,0.000049676863,0.000003161876],"category_scores_gemma":[0.00001675822,0.00022916755,0.00004508603,0.0019399343,0.00002598906,0.0001620649,0.0009409106,0.00043988976,0.000017241573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003793134,0.00020408345,0.040484153,0.000037487516,0.000051413906,0.000015449194,0.008744513,0.64096516,0.0003426404,0.020725103,0.07020548,0.2181866],"study_design_scores_gemma":[0.00022392128,0.00005361086,0.0032117967,0.000035629906,0.0000060396237,0.000014018716,0.00014228083,0.6257182,0.000011015786,0.0011549138,0.36911723,0.0003113828],"about_ca_topic_score_codex":0.00003139191,"about_ca_topic_score_gemma":0.000007472223,"teacher_disagreement_score":0.95975226,"about_ca_system_score_codex":0.00028922886,"about_ca_system_score_gemma":0.00004640916,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W4205836301","doi":"10.1007/s12083-021-01283-3","title":"Joint pricing and task allocation for blockchain empowered crowd spectrum sensing","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Task (project management); Scheme (mathematics); Nash equilibrium; Constraint (computer-aided design); Distributed computing; Computer security; Mathematical optimization","score_opus":0.016418155839810846,"score_gpt":0.24611919425849743,"score_spread":0.22970103841868658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205836301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07267235,0.00020707413,0.9030365,0.022063015,0.00029599087,0.0010844779,0.000009874715,0.00027340386,0.0003573421],"genre_scores_gemma":[0.953917,0.0000031514705,0.042984776,0.0011394074,0.0005462696,0.00032357924,0.000018107536,0.000031497235,0.0010361875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797827,0.00006385152,0.00032810593,0.00075462845,0.00040395724,0.00047119998],"domain_scores_gemma":[0.99874055,0.00018568186,0.000121714926,0.0005554383,0.00016014247,0.00023649282],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00118837,0.00020371444,0.00023054611,0.00020181091,0.0016446227,0.00037742112,0.00027421128,0.000043812608,0.0000017464452],"category_scores_gemma":[0.00004842042,0.00023436494,0.000052698557,0.00075004174,0.00003460193,0.000038775495,0.0004691606,0.00021547107,0.00000416874],"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.000041246818,0.00016831982,0.00060093525,0.00009769851,0.00010054409,0.0000087867475,0.013725366,0.16905421,0.029705834,0.035257503,0.021478072,0.7297615],"study_design_scores_gemma":[0.00044110604,0.00015680841,0.00088439323,0.000057066696,0.000034929362,0.00013753865,0.0006124387,0.51617754,0.00096369843,0.005968056,0.4739724,0.00059403817],"about_ca_topic_score_codex":0.0000782367,"about_ca_topic_score_gemma":0.00002081651,"teacher_disagreement_score":0.88124466,"about_ca_system_score_codex":0.000091618596,"about_ca_system_score_gemma":0.000047919824,"threshold_uncertainty_score":0.9996551},"labels":[],"label_agreement":null},{"id":"W4206155494","doi":"10.1007/s12083-021-01278-0","title":"Reducing the number of transaction messages in bitcoin","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Database transaction; Computer science; Computer network; Transaction processing; Latency (audio); Reduction (mathematics); Multicast; Bandwidth (computing); Distributed transaction; Distributed computing; Computer security; Telecommunications; Database; Mathematics","score_opus":0.012780618399454088,"score_gpt":0.26624345189488374,"score_spread":0.25346283349542964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206155494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09991336,0.0002106137,0.8115799,0.08520355,0.00013788909,0.0009842467,0.000014789664,0.00020954592,0.0017460927],"genre_scores_gemma":[0.98854756,0.000013502446,0.008848523,0.00032624154,0.0000652852,0.0017680236,0.0000050230096,0.000008202738,0.00041761692],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886286,0.000056958816,0.00023847062,0.00036096986,0.00027673173,0.00020399694],"domain_scores_gemma":[0.99910694,0.00010428715,0.000070817994,0.0005869965,0.000078975885,0.000051960127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008556797,0.0000923992,0.00012809336,0.00011577751,0.00051451544,0.000038398037,0.0006858156,0.00004183469,0.000011403614],"category_scores_gemma":[0.000009008363,0.000085562875,0.000031506203,0.0015826784,0.000047203277,0.000043736985,0.00023427489,0.00029517556,0.000006796941],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119104625,0.00038689244,0.0074857185,0.00001966049,0.000033161272,0.0000014621321,0.005883069,0.0284563,0.0012278105,0.35765204,0.011581567,0.5872604],"study_design_scores_gemma":[0.00031847128,0.000045453682,0.010024165,0.00002086013,0.000019534516,0.00006014139,0.0007809269,0.0474028,0.00075476454,0.038631104,0.9016011,0.00034072672],"about_ca_topic_score_codex":0.00012264671,"about_ca_topic_score_gemma":0.000023667957,"teacher_disagreement_score":0.8900195,"about_ca_system_score_codex":0.000036009023,"about_ca_system_score_gemma":0.00002476864,"threshold_uncertainty_score":0.3957289},"labels":[],"label_agreement":null},{"id":"W4244036065","doi":"10.1007/s12083-010-0071-5","title":"Editorial: Peer-to-peer networking and applications, volume 3, issue 2","year":2010,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Volume (thermodynamics); Peer-to-peer; Peer review; Computer science; World Wide Web; Political science; Physics","score_opus":0.00851742400309461,"score_gpt":0.26893828925758206,"score_spread":0.26042086525448743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244036065","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028206618,0.0010895731,0.33396652,0.049718186,0.6043362,0.0054651103,0.00046156038,0.0029393688,0.0019952462],"genre_scores_gemma":[0.0007284589,0.00028975972,0.07507596,0.0015284125,0.87743026,0.010603228,0.001071105,0.0004147044,0.03285814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98271203,0.00023213832,0.0020838173,0.0052773785,0.006520404,0.0031742586],"domain_scores_gemma":[0.9829831,0.0020055233,0.000892899,0.0056971945,0.005961148,0.002460122],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.00523116,0.002187275,0.0021599864,0.0015982756,0.0023620527,0.0037294978,0.0075082798,0.003361657,0.000023828425],"category_scores_gemma":[0.0016647731,0.0024458594,0.00035673298,0.005810584,0.00040763358,0.0005632686,0.005804501,0.0049113915,0.001403098],"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.00002950339,0.00011952414,0.00010452626,0.00007028217,0.00011622422,0.000005346157,0.00048230615,0.0012465251,0.00006968739,0.0012507604,0.82391185,0.17259349],"study_design_scores_gemma":[0.0005683972,0.00025506644,0.000097009615,0.0003290232,0.00021473337,0.000022545284,0.00008421009,0.0018284061,0.000029868788,0.0035167534,0.9904023,0.0026517275],"about_ca_topic_score_codex":0.00045059217,"about_ca_topic_score_gemma":0.0003915268,"teacher_disagreement_score":0.27309403,"about_ca_system_score_codex":0.0005296157,"about_ca_system_score_gemma":0.0006293162,"threshold_uncertainty_score":0.99937445},"labels":[],"label_agreement":null},{"id":"W4285900278","doi":"10.1007/s12083-022-01353-0","title":"DHL: Deep reinforcement learning-based approach for emergency supply distribution in humanitarian logistics","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Humanitarian Logistics; Distribution (mathematics); Operations research; Emergency management; Resource (disambiguation); Business; Supply chain; Supply and demand; Computer science; Process (computing); Risk analysis (engineering); Resource distribution; Operations management; Resource allocation; Economics; Engineering; Industrial organization; Marketing; Economic growth; Microeconomics; Mathematics","score_opus":0.03062303755965068,"score_gpt":0.2562055703969894,"score_spread":0.2255825328373387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285900278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014000227,0.000058605365,0.9858194,0.0066378983,0.0003355766,0.0020652516,0.000025530388,0.0001522917,0.00350543],"genre_scores_gemma":[0.9853682,0.000006378502,0.00079725333,0.0010461088,0.0007122629,0.0048190476,0.004528992,0.00002668835,0.002695056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981763,0.000019078063,0.0004504603,0.00049081154,0.00045501976,0.0004083632],"domain_scores_gemma":[0.9992742,0.000023305289,0.00009271492,0.0002971405,0.00026949393,0.00004312669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00098116,0.00019455297,0.00017646886,0.00022959455,0.001040624,0.00012310973,0.0003000357,0.000037152233,0.00019465978],"category_scores_gemma":[0.0000900753,0.00023041213,0.000064798056,0.001021357,0.000022448867,0.000101399644,0.000266625,0.00019884612,0.0000413198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000306734,0.00014775485,0.0039357087,0.00008789469,0.0000118998505,2.0227765e-7,0.00009449222,0.9389097,0.000005115786,0.029035734,0.02116219,0.0065786364],"study_design_scores_gemma":[0.0002224394,0.00002150344,0.0018230213,0.0000035352928,0.000027473092,1.05250415e-7,0.00035114636,0.4102199,5.797339e-7,0.00060642743,0.5865381,0.00018580302],"about_ca_topic_score_codex":0.0006175767,"about_ca_topic_score_gemma":0.000357714,"teacher_disagreement_score":0.9850221,"about_ca_system_score_codex":0.00012685102,"about_ca_system_score_gemma":0.000016106378,"threshold_uncertainty_score":0.9395934},"labels":[],"label_agreement":null},{"id":"W4289550335","doi":"10.1007/s12083-022-01363-y","title":"A high performance two-layer consensus architecture for blockchain-based IoT systems","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Blockchain; Computer science; Distributed computing; Byzantine fault tolerance; Layer (electronics); Markov chain; Overlay; Architecture; Computer network; Cluster (spacecraft); Protocol (science); Fault tolerance; Operating system; Computer security","score_opus":0.015873760051815945,"score_gpt":0.25033551238157464,"score_spread":0.2344617523297587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289550335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3139663,0.00029620802,0.63541627,0.04624197,0.0003352874,0.0027404744,0.00012863168,0.0006835768,0.00019126372],"genre_scores_gemma":[0.9433863,5.7311394e-7,0.043608047,0.0016348728,0.00038416573,0.010315964,0.000020280162,0.000027512546,0.000622241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978303,0.00005997525,0.00034641052,0.0007985272,0.00044240238,0.00052242324],"domain_scores_gemma":[0.998028,0.00031592493,0.00013330586,0.0010185814,0.00029523062,0.00020900392],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008795023,0.00023870125,0.00027527683,0.00026305532,0.001609706,0.00011497958,0.0010238778,0.00008343739,0.000003827094],"category_scores_gemma":[0.000021213347,0.00025375813,0.00006106665,0.0012643517,0.000074889394,0.0000028803172,0.00041591848,0.00039899364,0.000012529142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021476233,0.00013839827,0.00028157324,0.00003382662,0.000031027954,0.0000011752429,0.00037534427,0.78707737,0.00040262984,0.1177854,0.0073846397,0.086467154],"study_design_scores_gemma":[0.00043091484,0.00012336647,0.00014215944,0.000012485662,0.000018418054,0.00003392846,0.000053146516,0.528266,0.00018555406,0.003330414,0.46709922,0.00030439583],"about_ca_topic_score_codex":0.0000746077,"about_ca_topic_score_gemma":0.000013912302,"teacher_disagreement_score":0.62942004,"about_ca_system_score_codex":0.000077380246,"about_ca_system_score_gemma":0.00008338428,"threshold_uncertainty_score":0.9999915},"labels":[],"label_agreement":null},{"id":"W4289688104","doi":"10.1007/s12083-022-01360-1","title":"Revisiting FAW attack in an imperfect PoW blockchain system","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Imperfect; Blockchain; Computer security; Profitability index; Throughput; Obfuscation; Block (permutation group theory); Business; Mathematics; Telecommunications","score_opus":0.017922678297525814,"score_gpt":0.27303056008266713,"score_spread":0.2551078817851413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289688104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39328966,0.000770569,0.55973047,0.03863439,0.0002887417,0.0027605947,0.000054622855,0.0016623244,0.0028086517],"genre_scores_gemma":[0.98327917,0.0000039239867,0.012381733,0.0006906998,0.00034984853,0.0029892125,0.000022266762,0.000022795472,0.00026033085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976626,0.00013644068,0.0003953275,0.00088140165,0.0004254814,0.0004987503],"domain_scores_gemma":[0.99826324,0.00013290545,0.00011178065,0.0011139199,0.00015642271,0.00022174398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016256219,0.00020477346,0.00026669994,0.0003161336,0.0010947436,0.00017246246,0.0012273164,0.0000866312,0.0000060998127],"category_scores_gemma":[0.00001813663,0.00023543712,0.000047039186,0.0021458927,0.000038181424,0.000056628844,0.0009016286,0.0004840529,0.000026418618],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013199627,0.00029540603,0.011807652,0.00007164691,0.000032581414,0.000017126808,0.0034180062,0.040070955,0.00078825885,0.50044215,0.0054477267,0.43759528],"study_design_scores_gemma":[0.00039632287,0.00014931902,0.00358953,0.000060811642,0.000016982569,0.0001239502,0.0011394888,0.3723162,0.000085355015,0.002999059,0.6184098,0.00071314204],"about_ca_topic_score_codex":0.00006679797,"about_ca_topic_score_gemma":0.000030083655,"teacher_disagreement_score":0.61296207,"about_ca_system_score_codex":0.00015403736,"about_ca_system_score_gemma":0.000040897146,"threshold_uncertainty_score":0.9600847},"labels":[],"label_agreement":null},{"id":"W4322775678","doi":"10.1007/s12083-023-01464-2","title":"A GNN-based proactive caching strategy in NDN networks","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Computer science; Cache; Computer network; False sharing; Latency (audio); Cache algorithms; Smart Cache; Network topology; CPU cache","score_opus":0.02789617127673743,"score_gpt":0.27700096165956145,"score_spread":0.24910479038282402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322775678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03367849,0.0001421084,0.95223236,0.009314768,0.00024515082,0.0009438772,0.0000087974895,0.00068675866,0.0027477054],"genre_scores_gemma":[0.9953972,0.000009625741,0.0011007785,0.0008995527,0.0004503699,0.0007231061,0.000034203946,0.00002108549,0.0013640397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811745,0.000070093316,0.00026205127,0.0006523662,0.00037352997,0.000524521],"domain_scores_gemma":[0.99880457,0.00024789295,0.000058816786,0.0005177488,0.00014320303,0.00022775757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079952937,0.00019283353,0.00020187726,0.00029888834,0.00035213228,0.00034069622,0.0005485131,0.00007851668,0.0000012579764],"category_scores_gemma":[0.000028501827,0.00020108205,0.00005478743,0.0019421628,0.000023911187,0.00012280837,0.00021494292,0.0003353306,0.00006202835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010625822,0.00004855604,0.0020704023,0.0000073717683,0.00001751635,0.000009285892,0.00042877352,0.81384385,0.0001189113,0.006029522,0.0055410387,0.17187417],"study_design_scores_gemma":[0.00025113852,0.000046273075,0.0062242346,0.000059172708,0.000009510215,0.00000438832,0.00012353482,0.9553181,0.0000148451445,0.0009025742,0.036740396,0.00030583984],"about_ca_topic_score_codex":0.00028631318,"about_ca_topic_score_gemma":0.00012893553,"teacher_disagreement_score":0.96171874,"about_ca_system_score_codex":0.00007999084,"about_ca_system_score_gemma":0.000074527576,"threshold_uncertainty_score":0.8199888},"labels":[],"label_agreement":null},{"id":"W4323050769","doi":"10.1007/s12083-023-01454-4","title":"Time window-based online task assignment in mobile crowdsensing: Problems and algorithms","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Department of Natural Resources, Government of Newfoundland and Labrador","keywords":"Computer science; Upload; Online algorithm; Crowdsensing; Task (project management); Benchmark (surveying); Real-time computing; Distributed computing; Data mining; Algorithm; Computer security","score_opus":0.019998083756520423,"score_gpt":0.26323080407637983,"score_spread":0.2432327203198594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323050769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19087088,0.00047232208,0.7829615,0.02056731,0.00034939515,0.0027916038,0.00004816829,0.0012742002,0.0006646604],"genre_scores_gemma":[0.97412735,0.000024408704,0.021426408,0.00096511963,0.00050021964,0.00060152943,0.00009176109,0.000045214656,0.0022179938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767524,0.00006799809,0.0003699242,0.00083201076,0.00047654202,0.00057828816],"domain_scores_gemma":[0.9985561,0.00026524684,0.00008266339,0.00061824993,0.00015844163,0.00031934772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009915947,0.00024849438,0.00029258843,0.00031930808,0.0003801398,0.00036293585,0.0003299673,0.000094393574,0.0000019989257],"category_scores_gemma":[0.00003303628,0.00025631336,0.00004225504,0.0016720794,0.00007477012,0.000085995736,0.0002913708,0.00023408528,0.00008459713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008159314,0.00022559142,0.0013998911,0.000051526713,0.000026224943,0.000020472939,0.0027026425,0.34699866,0.007910285,0.00034198526,0.0093545085,0.63096005],"study_design_scores_gemma":[0.0004612096,0.00010478992,0.003277624,0.00019468398,0.0000146291095,0.000019646941,0.00012000245,0.60638136,0.00026152417,0.00059942954,0.3880972,0.00046789742],"about_ca_topic_score_codex":0.000047844696,"about_ca_topic_score_gemma":0.00002701702,"teacher_disagreement_score":0.7832565,"about_ca_system_score_codex":0.00005974318,"about_ca_system_score_gemma":0.000048793045,"threshold_uncertainty_score":0.9999889},"labels":[],"label_agreement":null},{"id":"W4366816638","doi":"10.1007/s12083-022-01389-2","title":"Joint task assignment and path planning for truck and drones in mobile crowdsensing","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Drone; Task (project management); Joint (building); Truck; Computer science; Path (computing); Motion planning; Crowdsensing; Engineering; Computer network; Artificial intelligence; Computer security; Automotive engineering; Robot; Systems engineering","score_opus":0.01854016857283014,"score_gpt":0.2580505791692078,"score_spread":0.23951041059637768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366816638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27036056,0.001068538,0.7231133,0.0018115352,0.00012442852,0.0023721762,0.000061059756,0.0005021115,0.000586268],"genre_scores_gemma":[0.9854492,0.00017172402,0.011707234,0.0000791172,0.00023984174,0.0019504764,0.000098905766,0.000040962976,0.00026252933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912035,0.0000075175253,0.00021549108,0.00028843377,0.000114218856,0.00025398962],"domain_scores_gemma":[0.99955034,0.00009644424,0.000025332958,0.00015403586,0.000051820287,0.000121994635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028513296,0.00013484534,0.0001567729,0.00015331082,0.00021306826,0.000110001296,0.00004510313,0.00005935798,9.744664e-7],"category_scores_gemma":[0.000010130067,0.00014791616,0.000014923284,0.00044578614,0.000020882035,0.000043898868,0.000049586884,0.0000811273,0.000004835765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069360417,0.00002232894,0.0032033985,0.000087459055,0.000022447224,8.5624396e-7,0.0021793074,0.8165468,0.0029652999,0.0011504446,0.008345257,0.16546948],"study_design_scores_gemma":[0.00041939056,0.000044819262,0.014956135,0.00011826354,0.00003016861,0.000007370721,0.0006150362,0.6236792,0.000185374,0.0015632155,0.35799205,0.00038893704],"about_ca_topic_score_codex":0.000010252574,"about_ca_topic_score_gemma":0.000008390547,"teacher_disagreement_score":0.71508867,"about_ca_system_score_codex":0.00003085222,"about_ca_system_score_gemma":0.0000057951934,"threshold_uncertainty_score":0.6031846},"labels":[],"label_agreement":null},{"id":"W4376142983","doi":"10.1007/s12083-023-01478-w","title":"IoT malware: An attribute-based taxonomy, detection mechanisms and challenges","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; York University; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Malware; Computer science; Computer security; Internet of Things; Digitization; Cryptovirology; Data science; World Wide Web; Telecommunications","score_opus":0.06332677579152321,"score_gpt":0.28177922089267365,"score_spread":0.21845244510115044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376142983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010263979,0.00015072743,0.98605233,0.009496613,0.00017992592,0.00090652786,0.000011897027,0.0020432011,0.0001323713],"genre_scores_gemma":[0.8027216,0.0001615415,0.191274,0.0007018944,0.00045293817,0.004171639,0.000023880159,0.00004274151,0.00044972927],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982495,0.000049198065,0.000218717,0.00077236095,0.00032656617,0.00038365944],"domain_scores_gemma":[0.99860686,0.00013608814,0.00007884771,0.0006399097,0.00023888968,0.00029940196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194151,0.00020533982,0.00018261104,0.0003078925,0.00051051716,0.00019975826,0.00040088643,0.00010481661,0.0000019340955],"category_scores_gemma":[0.000033561268,0.00022712225,0.000032377106,0.0011159355,0.00003302125,0.00015694181,0.00026282234,0.00016993609,0.00003897909],"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.0000060497355,0.00003092285,0.000027251353,0.000021540453,0.000008376556,0.0000020125724,0.0001614822,0.0022227517,0.0020270427,0.011210321,0.0006153003,0.98366696],"study_design_scores_gemma":[0.00021330093,0.00029634364,0.0017080446,0.000036084308,0.000014280303,0.00002158873,0.00010687229,0.06233051,0.013280904,0.015615902,0.9058593,0.0005169017],"about_ca_topic_score_codex":0.000021852687,"about_ca_topic_score_gemma":0.00007809227,"teacher_disagreement_score":0.98315006,"about_ca_system_score_codex":0.00005019441,"about_ca_system_score_gemma":0.000021180278,"threshold_uncertainty_score":0.9261777},"labels":[],"label_agreement":null},{"id":"W4383737140","doi":"10.1007/s12083-023-01501-0","title":"Intelligent spectrum sensing algorithm for cognitive internet of vehicles based on KPCA and improved CNN","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cognitive radio; Algorithm; Wireless; Artificial intelligence; Real-time computing; Telecommunications","score_opus":0.02110292418361377,"score_gpt":0.2743067457187801,"score_spread":0.25320382153516635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383737140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008330601,0.00007069892,0.98440075,0.005531996,0.00017972114,0.0009239477,0.000026594362,0.00017729866,0.00035839007],"genre_scores_gemma":[0.9489429,0.000026038244,0.04905251,0.00080453564,0.00058343797,0.000089405985,0.000045637804,0.000030135496,0.0004253772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983626,0.00003884623,0.000287279,0.000629727,0.0002602566,0.00042127693],"domain_scores_gemma":[0.99837124,0.0008019161,0.00009754591,0.00026201317,0.0002630501,0.00020422462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057315297,0.00020617295,0.00026423176,0.00025397347,0.000241862,0.00019674994,0.00018498964,0.00006218408,0.0000010177666],"category_scores_gemma":[0.000051736457,0.00020972555,0.00006582898,0.00088775676,0.00006479488,0.000052618598,0.00017814597,0.00014899837,0.000009672147],"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.000018404873,0.000030487457,0.00008660533,0.00001286947,0.000027905993,0.0000020881923,0.00047244458,0.00066846784,0.00021509356,0.0015309984,0.0009789226,0.9959557],"study_design_scores_gemma":[0.00030933088,0.00020699082,0.0009086829,0.00018579894,0.000027905113,0.0000066817897,0.00010904504,0.9723883,0.001916222,0.0023735182,0.02131613,0.00025138527],"about_ca_topic_score_codex":0.00004376759,"about_ca_topic_score_gemma":0.000025802674,"teacher_disagreement_score":0.99570435,"about_ca_system_score_codex":0.000032607706,"about_ca_system_score_gemma":0.000030403507,"threshold_uncertainty_score":0.855236},"labels":[],"label_agreement":null},{"id":"W4383738214","doi":"10.1007/s12083-023-01508-7","title":"Machine Learning based intrusion detection systems for connected autonomous vehicles: A survey","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); University of Windsor","funders":"","keywords":"Intrusion detection system; Computer science; Computer security; Intrusion; Confidentiality; Intrusion prevention system; Intelligent transportation system; Transport engineering; Engineering","score_opus":0.019065469841527783,"score_gpt":0.24393370292514013,"score_spread":0.22486823308361234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383738214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10733857,0.00079531,0.88404375,0.00076420023,0.00082449534,0.0027170696,0.00015671072,0.0031351713,0.00022474048],"genre_scores_gemma":[0.99480295,0.000048941936,0.00064906874,0.00007988096,0.0008066537,0.0019059173,0.00085720455,0.000114292794,0.00073508493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982734,0.00009074169,0.00034820297,0.0004423089,0.00028602313,0.0005593656],"domain_scores_gemma":[0.9985287,0.00056440296,0.000057523877,0.00031721074,0.0002659763,0.0002661694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013115396,0.0002542463,0.0002887024,0.00024742773,0.00047102373,0.00018480608,0.00017768859,0.00014940852,0.0000033931462],"category_scores_gemma":[0.00012638676,0.0002843945,0.000058645164,0.0013621966,0.0000194895,0.00004580841,0.00006305398,0.0002993165,0.00009130076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001667423,0.000010045808,0.0008069241,0.000055091336,0.00003135235,7.9767767e-7,0.00009612511,0.9618898,0.00080904295,0.000045476852,0.003247887,0.032990795],"study_design_scores_gemma":[0.00024249287,0.00003857823,0.002675992,0.000045292694,0.000021834447,0.0000036817364,0.000023311946,0.69344443,0.00007893095,0.000027506649,0.30316725,0.000230725],"about_ca_topic_score_codex":0.00020427174,"about_ca_topic_score_gemma":0.00028526812,"teacher_disagreement_score":0.8874644,"about_ca_system_score_codex":0.00011654453,"about_ca_system_score_gemma":0.000020780873,"threshold_uncertainty_score":0.99996084},"labels":[],"label_agreement":null},{"id":"W4386478621","doi":"10.1007/s12083-023-01554-1","title":"A blockchain and stacked machine learning approach for malicious nodes’ detection in internet of things","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research Center of the College of Computer and Information Sciences, King Saud University","keywords":"Computer science; Hash function; Computer security; Single point of failure; Blockchain; Computer network; Network forensics; Digital forensics","score_opus":0.01540513262395177,"score_gpt":0.25306616999802894,"score_spread":0.23766103737407718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386478621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09268592,0.000115860006,0.9023888,0.0034151615,0.00002856091,0.0008911059,0.000005330644,0.00032649955,0.00014272831],"genre_scores_gemma":[0.94900185,0.000018589139,0.04868562,0.00016562828,0.000054143777,0.0015072495,0.000024945763,0.000015903093,0.00052607397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986954,0.00003304258,0.00028036686,0.0005260655,0.00017322316,0.000291914],"domain_scores_gemma":[0.999177,0.00015459067,0.000092656555,0.0003440742,0.00013858851,0.000093090865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719138,0.00014062517,0.00020951313,0.00035429408,0.0002077823,0.00006395613,0.00038594982,0.00011865081,3.9786386e-7],"category_scores_gemma":[0.000048996273,0.00014852335,0.000030841195,0.0014024056,0.00005554457,0.0000389138,0.00032286847,0.00024695962,0.0000032007144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031768013,0.00018919824,0.0046629584,0.00012048686,0.00004619689,9.937356e-7,0.008112286,0.009389802,0.0030550465,0.081922606,0.0007167611,0.8917519],"study_design_scores_gemma":[0.000276762,0.000068170775,0.0009841295,0.000018562827,0.000009153478,0.000008861644,0.000110557405,0.9530636,0.0006325368,0.0069024656,0.03774664,0.00017853404],"about_ca_topic_score_codex":0.00017040588,"about_ca_topic_score_gemma":0.000036932364,"teacher_disagreement_score":0.94367385,"about_ca_system_score_codex":0.000023334378,"about_ca_system_score_gemma":0.000011106914,"threshold_uncertainty_score":0.6056607},"labels":[],"label_agreement":null},{"id":"W4390142817","doi":"10.1007/s12083-023-01597-4","title":"Unveiling DoH tunnel: Toward generating a balanced DoH encrypted traffic dataset and profiling malicious behavior using inherently interpretable machine learning","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Overfitting; Interpretability; Computer science; Profiling (computer programming); Random forest; Data mining; Machine learning; Encryption; Artificial intelligence; The Internet; Artificial neural network; Computer security; World Wide Web","score_opus":0.03281763495495147,"score_gpt":0.293704309409292,"score_spread":0.2608866744543405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390142817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4416198,0.00026120612,0.55613244,0.000596316,0.00017819206,0.0006288223,0.00006914157,0.00047394942,0.00004012651],"genre_scores_gemma":[0.9618881,0.000021619686,0.036072023,0.00028714954,0.0004780502,0.0002910931,0.0006708386,0.00004149855,0.0002496434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972079,0.00010540011,0.0005702259,0.00097295403,0.00046911216,0.00067440764],"domain_scores_gemma":[0.99882627,0.0001571354,0.00018009832,0.00034514425,0.00020236404,0.00028901614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010865674,0.00032996904,0.00040191688,0.00029879305,0.0007752416,0.0007462856,0.0005574221,0.00010354495,0.0000076255055],"category_scores_gemma":[0.00006756803,0.0003307978,0.00007271452,0.0014040645,0.000041124797,0.0002043187,0.0005769016,0.00046224866,0.000032401735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127224275,0.00008146296,0.0022027509,0.00006276661,0.00010111702,0.000021952445,0.0048939735,0.87830234,0.00596714,0.0031634213,0.0013126486,0.10387772],"study_design_scores_gemma":[0.00020729729,0.00004510222,0.00014411243,0.00010122159,0.00006979183,0.00003268166,0.00030692018,0.98397666,0.00009141224,0.000007727624,0.014639427,0.00037765026],"about_ca_topic_score_codex":0.00007944268,"about_ca_topic_score_gemma":0.000067890986,"teacher_disagreement_score":0.52026826,"about_ca_system_score_codex":0.000057055466,"about_ca_system_score_gemma":0.000040434265,"threshold_uncertainty_score":0.9999144},"labels":[],"label_agreement":null},{"id":"W4390449174","doi":"10.1007/s12083-023-01599-2","title":"Demcrp-et: decentralized multi-criteria ranked prosumers energy trading using distributed ledger technology","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Renewable energy; Computer science; Distributed generation; Smart contract; Smart grid; Environmental economics; Peer-to-peer; Ranking (information retrieval); Analytic hierarchy process; Cryptocurrency; Computer security; Business; Operations research; Blockchain; Distributed computing; Artificial intelligence; Economics; Mathematics; Engineering; Electrical engineering","score_opus":0.033036592921158424,"score_gpt":0.31367696798020306,"score_spread":0.28064037505904466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390449174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02324683,0.00024133184,0.94882345,0.025078911,0.0001649135,0.0007257957,0.000037278918,0.0016139784,0.0000674915],"genre_scores_gemma":[0.9153295,0.000059079674,0.082183465,0.0005526382,0.00011173897,0.0014267988,0.000099065524,0.000033860535,0.00020386782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977165,0.00005546605,0.00039685375,0.0008647239,0.00027288476,0.0006936004],"domain_scores_gemma":[0.99839145,0.00011340092,0.00010957323,0.0008811023,0.00026646085,0.00023799119],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062077557,0.00026789334,0.0003150513,0.0005158832,0.0007524413,0.00020347953,0.0009426975,0.00025147764,0.000003996683],"category_scores_gemma":[0.00005110743,0.0002873048,0.000066196124,0.00434597,0.00013171381,0.00010148853,0.0004892829,0.00026832937,0.000031174422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027207856,0.00047594658,0.0054336856,0.000047354933,0.00024530833,0.000015923037,0.0019837387,0.0037054867,0.023145305,0.5330632,0.021360336,0.41049656],"study_design_scores_gemma":[0.0006074597,0.000030960902,0.0008662316,0.00004288201,0.00003549855,0.000035134533,0.000108792745,0.4632274,0.0012635068,0.01607524,0.51720023,0.0005066515],"about_ca_topic_score_codex":0.00004891051,"about_ca_topic_score_gemma":0.00003540871,"teacher_disagreement_score":0.89208263,"about_ca_system_score_codex":0.000070045484,"about_ca_system_score_gemma":0.00005438678,"threshold_uncertainty_score":0.9999579},"labels":[],"label_agreement":null},{"id":"W4401816349","doi":"10.1007/s12083-024-01763-2","title":"SRFE: A stepwise recursive feature elimination approach for network intrusion detection systems","year":2024,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"C4.5 algorithm; Computer science; Random forest; Support vector machine; Artificial intelligence; Machine learning; Naive Bayes classifier; Feature (linguistics); Binary classification; Intrusion detection system; Data mining; Pattern recognition (psychology)","score_opus":0.014755704414825216,"score_gpt":0.25909512307331695,"score_spread":0.24433941865849174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401816349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006502511,0.0019822912,0.9850386,0.0063805724,0.0020699494,0.0023510063,0.000015784228,0.0006415546,0.0008700328],"genre_scores_gemma":[0.9003585,0.00020005764,0.08000987,0.00072776055,0.009734565,0.005300512,0.00016271722,0.00007470439,0.0034313193],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975561,0.00009222228,0.00034373804,0.00096893444,0.0005202335,0.0005187626],"domain_scores_gemma":[0.9983332,0.00026764677,0.00010077866,0.0005281267,0.00049775915,0.00027248403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011896604,0.00027693142,0.0002544796,0.0002695417,0.0008949763,0.0010085644,0.00045225423,0.00023339923,0.000001500897],"category_scores_gemma":[0.00004809785,0.00027317266,0.00009968935,0.0020443553,0.000030993302,0.00032332187,0.00023208268,0.0003733267,0.000030730233],"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.00004137868,0.00005341483,0.000008451758,0.00014124622,0.0000449462,0.0000011275622,0.0010755361,0.05296475,0.0003148865,0.05869244,0.06354291,0.8231189],"study_design_scores_gemma":[0.000103922444,0.00012156576,0.000059516784,0.000116856005,0.00003089922,0.000029260076,0.0000562119,0.44215354,0.00007355725,0.0046209837,0.5523934,0.00024028264],"about_ca_topic_score_codex":0.000026192925,"about_ca_topic_score_gemma":0.000018259898,"teacher_disagreement_score":0.9050287,"about_ca_system_score_codex":0.00014088344,"about_ca_system_score_gemma":0.00003993659,"threshold_uncertainty_score":0.99997205},"labels":[],"label_agreement":null},{"id":"W4405138672","doi":"10.1007/s12083-024-01833-5","title":"A secure and lightweight data sharing scheme in vehicular digital twin network","year":2024,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; National Natural Science Foundation of China","keywords":"Scheme (mathematics); Computer science; Data sharing; Computer network; Computer security; Mathematics","score_opus":0.018776839108130525,"score_gpt":0.25787209078008416,"score_spread":0.23909525167195364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405138672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40082783,0.09089944,0.4506477,0.021247977,0.0028943063,0.0069234427,0.00074620993,0.0062001417,0.019612962],"genre_scores_gemma":[0.98886395,0.0002645714,0.0057424116,0.00022953807,0.0030965991,0.00040625833,0.00054891116,0.0001410416,0.0007067332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757534,0.000014328335,0.00038656502,0.0009476891,0.00035753805,0.0007185235],"domain_scores_gemma":[0.99850225,0.00012643125,0.000021638036,0.00092954043,0.000056336536,0.00036380545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063161197,0.00033754704,0.00031203454,0.00017044268,0.00016972685,0.000840067,0.0005783675,0.00016298173,0.000009406379],"category_scores_gemma":[0.000021933314,0.00035751515,0.00004079009,0.0012402358,0.000038146154,0.00029897975,0.0005314947,0.0005419843,0.00008719535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074525824,0.00003020152,0.0052255993,0.0001804511,0.00015368182,0.000052295738,0.0005934296,0.843943,0.00016065198,0.0045794845,0.07019776,0.07487602],"study_design_scores_gemma":[0.00008099896,0.00000738981,0.00047360067,0.00022784546,0.000021953698,0.000025315398,0.000015735759,0.48059237,0.000005203038,0.0007846663,0.51749974,0.00026514073],"about_ca_topic_score_codex":0.000013122025,"about_ca_topic_score_gemma":0.00007616819,"teacher_disagreement_score":0.5880361,"about_ca_system_score_codex":0.000071014176,"about_ca_system_score_gemma":0.000021227976,"threshold_uncertainty_score":0.9998877},"labels":[],"label_agreement":null},{"id":"W4405971420","doi":"10.1007/s12083-024-01891-9","title":"A lightweight IoT device identification using enhanced behavioral-based features","year":2024,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Identification (biology); Internet of Things; Computer science; Embedded system; Human–computer interaction; Biology","score_opus":0.024786531558908288,"score_gpt":0.31163090351223177,"score_spread":0.28684437195332346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405971420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02711369,0.00054517365,0.9666458,0.004178884,0.00038900404,0.00038732553,0.0000059349786,0.00037130882,0.0003629007],"genre_scores_gemma":[0.97192734,0.0000034750017,0.025000501,0.0004571382,0.0007409084,0.00020146718,0.000032119373,0.000023967987,0.0016130871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997994,0.000042679338,0.00036051995,0.000770618,0.00048276852,0.00034939058],"domain_scores_gemma":[0.99894273,0.00010455388,0.00007628582,0.00038495724,0.00031496983,0.00017651929],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00054548326,0.00020850201,0.0001977391,0.0002556765,0.0003815181,0.001048355,0.0005630969,0.000087379114,0.000005825832],"category_scores_gemma":[0.000012918948,0.00019825673,0.000100867175,0.0013608595,0.000026290063,0.0001142924,0.00013132502,0.00022065364,0.000088920715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011913829,0.00028722786,0.00010614124,0.000118846845,0.000153466,0.000015896654,0.0067742933,0.12681581,0.020085525,0.22115968,0.015705021,0.6087662],"study_design_scores_gemma":[0.00007020034,0.000026240323,0.00025191464,0.00015780616,0.00009008514,0.000009290743,0.000050617477,0.7997922,0.002561177,0.00012116528,0.1965257,0.0003436096],"about_ca_topic_score_codex":0.0000342141,"about_ca_topic_score_gemma":0.000086540334,"teacher_disagreement_score":0.94481367,"about_ca_system_score_codex":0.000071497845,"about_ca_system_score_gemma":0.000058837122,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W4406534442","doi":"10.1007/s12083-024-01898-2","title":"Startup delay aware short video ordering: Problem, model, and a reinforcement learning based algorithm","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reinforcement learning; Computer science; Algorithm; Artificial intelligence","score_opus":0.016578277425207563,"score_gpt":0.27730200672175814,"score_spread":0.2607237292965506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406534442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003357982,0.0004082012,0.9889918,0.001260229,0.00009567105,0.0012758757,0.000009169661,0.00048637716,0.004114718],"genre_scores_gemma":[0.97081023,0.00005287893,0.021177113,0.00018522401,0.0002866049,0.002348067,0.000071824994,0.000064880194,0.00500316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818957,0.000030194264,0.00036105482,0.00045668078,0.0004447683,0.00051772303],"domain_scores_gemma":[0.99898493,0.00013359738,0.000022767348,0.00036179964,0.00024302413,0.0002538541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066697516,0.00024466473,0.00025538905,0.00028705059,0.00041344398,0.0002243796,0.00019918985,0.00010127312,0.000005720185],"category_scores_gemma":[0.000023144248,0.00027013512,0.000036209163,0.000754297,0.000033163604,0.000061037186,0.00015442556,0.00035883972,0.000014653519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045475563,0.000009901172,0.001057935,0.00010251809,0.000044546723,0.0000010039107,0.00020476281,0.87673825,0.000179742,0.00015765514,0.0065319603,0.114967175],"study_design_scores_gemma":[0.00012111288,0.000017989405,0.00013008765,0.0001221448,0.000015890912,0.0000020646835,0.000040257684,0.6340324,0.000055208737,0.00005671584,0.36523268,0.00017339626],"about_ca_topic_score_codex":0.00005483982,"about_ca_topic_score_gemma":0.000033876113,"teacher_disagreement_score":0.9678147,"about_ca_system_score_codex":0.00011648179,"about_ca_system_score_gemma":0.000055363933,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W4408315684","doi":"10.1007/s12083-025-01903-2","title":"Dependency-aware task collaborative offloading and resource allocation in UAV enabled edge computing","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Natural Science Foundation of Hunan Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Dependency (UML); Task (project management); Resource allocation; Edge computing; Distributed computing; Enhanced Data Rates for GSM Evolution; Mobile edge computing; Resource (disambiguation); Resource management (computing); Computer architecture; Computer network; Artificial intelligence; Engineering","score_opus":0.009747758509713336,"score_gpt":0.2657448681666465,"score_spread":0.2559971096569332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408315684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02737388,0.000495036,0.9530289,0.011736861,0.0008625604,0.0009317517,0.0000014407036,0.00024455786,0.005324985],"genre_scores_gemma":[0.97540486,0.000014246317,0.020467874,0.0011597007,0.0013681476,0.00015390306,0.000021621796,0.00001780891,0.001391824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806046,0.00008839503,0.00037988016,0.0007274914,0.000280765,0.00046300344],"domain_scores_gemma":[0.9986232,0.00036834928,0.000097115444,0.0004153926,0.0003317023,0.00016427161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009626878,0.00021122799,0.0002560093,0.00033940206,0.0006762724,0.00043765779,0.00049343036,0.00009434848,3.3121444e-7],"category_scores_gemma":[0.00006887416,0.00023398134,0.000024925523,0.0023788544,0.000037127917,0.00013847975,0.0005896908,0.00025587738,0.000011131548],"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.00002230408,0.0001344471,0.01568609,0.000109799614,0.0000619817,0.000007791954,0.0120963855,0.013499271,0.0010023834,0.029919198,0.045715187,0.88174516],"study_design_scores_gemma":[0.00053916755,0.000043461085,0.008673384,0.0004050396,0.000022898557,0.000010836165,0.0004259744,0.31613013,0.00027077258,0.004038401,0.6689245,0.0005154526],"about_ca_topic_score_codex":0.000058420268,"about_ca_topic_score_gemma":0.00003145008,"teacher_disagreement_score":0.948031,"about_ca_system_score_codex":0.00009071755,"about_ca_system_score_gemma":0.00010137724,"threshold_uncertainty_score":0.95414823},"labels":[],"label_agreement":null},{"id":"W4410540537","doi":"10.1007/s12083-025-02002-y","title":"Optimal hybrid energy-saving cluster head selection for wireless sensor networks: an empirical study","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Wireless sensor network; Cluster (spacecraft); Computer science; Head (geology); Selection (genetic algorithm); Energy (signal processing); Computer network; Wireless; Telecommunications; Artificial intelligence; Mathematics; Statistics; Geology","score_opus":0.019011028079583957,"score_gpt":0.31286077852667815,"score_spread":0.2938497504470942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410540537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09524107,0.00009578796,0.8971098,0.004813893,0.0005887384,0.0013052627,0.000005806917,0.0005392073,0.00030045226],"genre_scores_gemma":[0.9261068,0.000009959188,0.06526065,0.0024310187,0.0016530362,0.0017578922,0.00005478901,0.000054275435,0.0026715684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638754,0.00019201354,0.0005808664,0.0014286042,0.0005297135,0.0008812469],"domain_scores_gemma":[0.9973706,0.0005259366,0.0001331278,0.0009169454,0.000644823,0.00040856202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009759475,0.00041236164,0.00043906132,0.0003419124,0.0011120345,0.0006826364,0.0009201194,0.00014459077,0.0000014847637],"category_scores_gemma":[0.00003147096,0.00043656494,0.000105685845,0.0018917334,0.00005277813,0.00021236952,0.0004692775,0.00031672211,0.0000054992956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042551004,0.00039705887,0.004486527,0.00000846036,0.000055197765,0.000001298007,0.00033924513,0.88692707,0.000051658986,0.0030754586,0.009898597,0.09471688],"study_design_scores_gemma":[0.0005090314,0.0002187112,0.0014887835,0.000051529543,0.000047897065,0.000012806415,0.00010206806,0.84132177,0.00006262536,0.0001338773,0.1556319,0.00041902895],"about_ca_topic_score_codex":0.000095156465,"about_ca_topic_score_gemma":0.0002849984,"teacher_disagreement_score":0.83184916,"about_ca_system_score_codex":0.00013368906,"about_ca_system_score_gemma":0.00007218484,"threshold_uncertainty_score":0.9998086},"labels":[],"label_agreement":null},{"id":"W4411544687","doi":"10.1007/s12083-025-02040-6","title":"Secure and efficient fully dynamic group signature based on RSIS and RLWE","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Ministry of Electronics and Information technology","keywords":"Signature (topology); Group (periodic table); Group signature; Computer science; Physics; Computer security; Mathematics; Public-key cryptography; Quantum mechanics","score_opus":0.004619057860414322,"score_gpt":0.24349643036536295,"score_spread":0.23887737250494862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411544687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011898421,0.00085029466,0.9664378,0.01866999,0.00016744241,0.0006345282,0.0000690632,0.00017261169,0.0010998342],"genre_scores_gemma":[0.9771634,0.00003085226,0.020048723,0.0023247332,0.000096978074,0.00019428975,0.000055919754,0.000008514971,0.000076601376],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985729,0.000035386944,0.00016332453,0.0006792541,0.00026954073,0.00027958912],"domain_scores_gemma":[0.9989198,0.00019620504,0.000041162362,0.00053704693,0.000103221944,0.00020257897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036977616,0.00018367473,0.00016486141,0.00023254863,0.0004814676,0.0003213091,0.0003455227,0.0000974209,0.0000017075159],"category_scores_gemma":[0.00001821324,0.00017690814,0.000036518082,0.0011398896,0.00007267312,0.000052490886,0.000266565,0.00023668102,0.0000036591562],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056296096,0.00039314624,0.002670817,0.00013222273,0.00006182303,0.000004992266,0.0013608326,0.009424636,0.00046189484,0.4786229,0.02395224,0.48285818],"study_design_scores_gemma":[0.0005083041,0.00011843102,0.017768718,0.0001599751,0.0000467071,0.0000053716826,0.00006961873,0.40365452,0.000026590431,0.012066561,0.56514186,0.00043334265],"about_ca_topic_score_codex":0.000017187289,"about_ca_topic_score_gemma":0.000039794922,"teacher_disagreement_score":0.965265,"about_ca_system_score_codex":0.000018044668,"about_ca_system_score_gemma":0.000020753425,"threshold_uncertainty_score":0.72141045},"labels":[],"label_agreement":null},{"id":"W4412960542","doi":"10.1007/s12083-025-02070-0","title":"Integrating IoT and WSN: Enhancing quality of service through energy efficiency, scalability, and secure communication in smart systems","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Scalability; Internet of Things; Computer science; Quality of service; Efficient energy use; Computer network; Service (business); Distributed computing; Computer security; Embedded system; Database; Business; Engineering; Electrical engineering","score_opus":0.02020906581841103,"score_gpt":0.3029157116472507,"score_spread":0.28270664582883964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412960542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18081157,0.0015114653,0.80742186,0.0073231566,0.00045304064,0.0004450714,0.0000013255044,0.00009426733,0.0019382193],"genre_scores_gemma":[0.98139805,0.000025231513,0.017589701,0.00054911204,0.00020335197,0.00011348723,0.0000074165478,0.0000074661534,0.00010618823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829745,0.00017430625,0.0005384899,0.00049041637,0.00023188208,0.0002674739],"domain_scores_gemma":[0.99819976,0.00065007445,0.00013867154,0.00059566373,0.00033367326,0.00008214584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016949013,0.00015930923,0.00029708282,0.00012671105,0.0003836516,0.00022449727,0.000465216,0.00008436535,1.1549793e-7],"category_scores_gemma":[0.00008104075,0.0001608704,0.000021220621,0.001348507,0.000058851467,0.00009729706,0.00075008825,0.00019100102,6.56454e-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.0000342273,0.0004249189,0.07893204,0.0013664943,0.000082205064,8.7183514e-7,0.039434996,0.009798927,0.005074421,0.44775248,0.0031528703,0.41394556],"study_design_scores_gemma":[0.0009805328,0.00010538893,0.049898546,0.0024262473,0.000047033274,0.000018192299,0.0022812393,0.760062,0.0011174309,0.028904047,0.15312359,0.0010358042],"about_ca_topic_score_codex":0.0026089137,"about_ca_topic_score_gemma":0.0007186459,"teacher_disagreement_score":0.80058646,"about_ca_system_score_codex":0.000044622804,"about_ca_system_score_gemma":0.000050265447,"threshold_uncertainty_score":0.65601045},"labels":[],"label_agreement":null},{"id":"W4413225398","doi":"10.1007/s12083-025-02080-y","title":"The future of mobility: Assessing the impact and applications of blockchain technology in electric vehicle ecosystems","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University","funders":"","keywords":"Blockchain; Environmental science; Ecosystem; Computer science; Computer security; Ecology; Biology","score_opus":0.005760342724700255,"score_gpt":0.2771806896193442,"score_spread":0.27142034689464395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413225398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29171756,0.011602313,0.6107984,0.08115858,0.00009062541,0.003627747,0.000018614703,0.00026289,0.00072321977],"genre_scores_gemma":[0.99576306,0.00012664507,0.0017172965,0.000095433315,0.00008994944,0.002121177,0.0000021945561,0.000007488573,0.000076777775],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855596,0.0000630368,0.000445878,0.00044576847,0.00018555955,0.00030378744],"domain_scores_gemma":[0.99790144,0.00044468435,0.00017049539,0.0011181395,0.00030764833,0.000057595178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012206421,0.0001513743,0.00025151434,0.00036281996,0.00058111595,0.00009336626,0.0010104163,0.00016827701,3.2073865e-7],"category_scores_gemma":[0.00003399554,0.00010613103,0.000043366377,0.0044078752,0.00017250981,0.000031271218,0.0003816415,0.00034143846,0.0000011066533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030426706,0.00013536467,0.010866745,0.000027099642,0.00003500029,1.0856606e-7,0.00023459831,0.00071207667,0.0015570308,0.38486215,0.0006356064,0.60093117],"study_design_scores_gemma":[0.0005398513,0.00012341725,0.029148601,0.00012812477,0.000057851714,0.000025611065,0.00152375,0.22756553,0.002788178,0.34584492,0.39179724,0.0004569103],"about_ca_topic_score_codex":0.00008847713,"about_ca_topic_score_gemma":0.00013407729,"teacher_disagreement_score":0.7040455,"about_ca_system_score_codex":0.000044288376,"about_ca_system_score_gemma":0.000086287386,"threshold_uncertainty_score":0.44695327},"labels":[],"label_agreement":null},{"id":"W4416563407","doi":"10.1007/s12083-025-02163-w","title":"Adaptive sliding window and LightGBM-based DDoS attack detection framework for IoT networks","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Denial-of-service attack; Sliding window protocol; Feature selection; Intrusion detection system; Window (computing); Internet of Things; Feature (linguistics); Curse of dimensionality; Trinoo","score_opus":0.021774620534225093,"score_gpt":0.29022333844326204,"score_spread":0.26844871790903696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416563407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023813238,0.00051062676,0.98445433,0.010003033,0.00066637865,0.0013538796,0.0000047678714,0.00030277533,0.0003228954],"genre_scores_gemma":[0.89655066,0.00003657685,0.09762674,0.0027555646,0.0012598734,0.0012981549,0.000008468424,0.00002328183,0.00044069867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802685,0.00006345757,0.00033788214,0.00081261597,0.00027855905,0.00048063626],"domain_scores_gemma":[0.9980925,0.0006812987,0.00011499914,0.000519315,0.00035142034,0.00024047597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067052274,0.0002572187,0.0002666422,0.00025531233,0.0011500714,0.0004320624,0.000400249,0.00022772884,0.0000021312885],"category_scores_gemma":[0.00007478324,0.00027418273,0.0000775863,0.0015219843,0.000042815773,0.00011781592,0.00022098997,0.00036645142,0.000007988408],"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.00009967602,0.00008059025,0.00026746542,0.000037588878,0.000059645725,6.719847e-7,0.0004167147,0.06888856,0.00025273528,0.10851095,0.0060681105,0.8153173],"study_design_scores_gemma":[0.00029310226,0.00015248249,0.0006449595,0.00017806063,0.00003638514,0.0000037276557,0.00003443491,0.6377,0.00067108707,0.017760158,0.34221375,0.0003118116],"about_ca_topic_score_codex":0.000020548869,"about_ca_topic_score_gemma":0.000057514426,"teacher_disagreement_score":0.89416933,"about_ca_system_score_codex":0.0000723721,"about_ca_system_score_gemma":0.0000481982,"threshold_uncertainty_score":0.99997103},"labels":[],"label_agreement":null},{"id":"W566906973","doi":"10.1007/s12083-015-0370-y","title":"Adaptive RSSI-based localization scheme for wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless sensor network; Computer science; Node (physics); Received signal strength indication; Real-time computing; Channel state information; Wireless; Scheme (mathematics); Position (finance); Channel (broadcasting); Range (aeronautics); Computer network; Telecommunications; Engineering; Mathematics","score_opus":0.027853327027236887,"score_gpt":0.25590144720320956,"score_spread":0.22804812017597267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W566906973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011735999,0.00020163474,0.99431044,0.0011511927,0.0002625242,0.0010215719,0.000028682947,0.0010497806,0.0008006031],"genre_scores_gemma":[0.97200894,0.00001526727,0.02428371,0.00068028475,0.00081515487,0.0014219749,0.00020255352,0.00008078051,0.0004913401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987378,0.000014493573,0.0002692998,0.00032534447,0.00025989092,0.00039317977],"domain_scores_gemma":[0.9988049,0.00009779767,0.0000422932,0.00031204056,0.0005064887,0.00023647254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003003333,0.00022103317,0.00021713889,0.00014941981,0.00022881635,0.00009925782,0.000190519,0.00017718613,0.000002543279],"category_scores_gemma":[0.00004856964,0.00023445358,0.00004528117,0.0007408885,0.00004864167,0.000053775606,0.000044336462,0.00014294537,0.00002328354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001914953,0.000018517838,0.00051734364,0.000019274878,0.000021024376,3.3006737e-7,0.00014218347,0.9340217,0.000042776366,0.0034018026,0.030741967,0.031053912],"study_design_scores_gemma":[0.00029600156,0.00003817249,0.000039082945,0.000029447669,0.000018808953,0.0000012142092,0.00018145323,0.6971983,0.00046632957,0.00047785218,0.30101338,0.00023997904],"about_ca_topic_score_codex":0.000010508245,"about_ca_topic_score_gemma":0.000016256665,"teacher_disagreement_score":0.9708353,"about_ca_system_score_codex":0.000088818866,"about_ca_system_score_gemma":0.000027685406,"threshold_uncertainty_score":0.95607394},"labels":[],"label_agreement":null}]}