{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":93,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":93,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a123376d5e9f","filters":{"venue":"Peer-to-Peer Networking and Applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01669097849857403,"gpt":0.2533627878151253,"spread":0.2366718093165512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007797392,0.000331771,0.0003325104,0.000184245,0.0002799608,0.0001214261,0.0003363422,0.0001436487,0.000008410947],"category_scores_gemma":[0.000005759479,0.0003824466,0.00006433392,0.001409037,0.00002365289,0.00008392998,0.0002045749,0.0003315444,0.0001906297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001494645,"about_ca_system_score_gemma":0.000006833581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000159157,"about_ca_topic_score_gemma":0.00002808687,"domain_scores_codex":[0.9974778,0.00003963918,0.0003802104,0.000456932,0.000442056,0.001203326],"domain_scores_gemma":[0.9989089,0.00004899828,0.00003450631,0.0004191139,0.00005942173,0.0005290461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007483512,0.00006949998,0.001522512,0.0000319561,0.00005556918,0.000001131671,0.0008077075,0.8419507,0.000009527067,0.004905617,0.09370418,0.05693419],"study_design_scores_gemma":[0.0002424471,0.00001119491,0.010905,0.00003727798,0.00004874287,0.000008569719,0.0001088076,0.09639108,0.00000342068,0.000382759,0.8913777,0.0004829952],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07711587,0.003031285,0.7105488,0.006382134,0.001633832,0.008376415,0.00004487822,0.001987539,0.1908793],"genre_scores_gemma":[0.9683959,0.00003524004,0.02191887,0.0007816544,0.00472387,0.002350439,0.0001032366,0.0001102082,0.001580528],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8912801,"threshold_uncertainty_score":0.9998627,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06295727494621317,"gpt":0.3119676628443532,"spread":0.24901038789814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002016946,0.0002352605,0.0002421081,0.0003352577,0.0005778563,0.0004000014,0.03224463,0.0001356148,0.000005390208],"category_scores_gemma":[0.007633956,0.0002587667,0.00002956053,0.001660986,0.0001119297,0.000652472,0.1004919,0.0004800045,0.0001000967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009334078,"about_ca_system_score_gemma":0.00005576076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002512592,"about_ca_topic_score_gemma":0.0003494786,"domain_scores_codex":[0.9972136,0.0001385797,0.0004877745,0.001074158,0.0005918845,0.0004939953],"domain_scores_gemma":[0.9788185,0.000772822,0.0001537663,0.01976202,0.0002920569,0.0002008239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006519949,0.0001758355,0.01310274,0.00002384636,0.00002803429,7.658163e-7,0.0002605582,0.0007985106,0.0001608665,0.01519623,0.4376203,0.5326259],"study_design_scores_gemma":[0.00015653,0.00001451291,0.007066307,0.00005869552,0.000006918422,0.000005633739,0.00001730196,0.3870685,0.00002472546,0.02971367,0.5756539,0.0002134254],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001509404,0.0002490285,0.8202394,0.174428,0.0003669673,0.0007788509,0.00008308525,0.0006994624,0.001645854],"genre_scores_gemma":[0.3003369,0.0001209818,0.6957487,0.001132036,0.0006104607,0.0008365583,0.0008811124,0.00003451736,0.0002986701],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5324124,"threshold_uncertainty_score":0.9999865,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04445474490833506,"gpt":0.280935515898559,"spread":0.2364807709902239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005217573,0.0002607221,0.0002648702,0.0001251133,0.0007601169,0.000649274,0.01161606,0.0001236489,0.000009034434],"category_scores_gemma":[0.005361893,0.0002787291,0.00004514755,0.001841617,0.00005334663,0.0003160527,0.04855085,0.0005805644,0.0001767852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005364238,"about_ca_system_score_gemma":0.00004862616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004025582,"about_ca_topic_score_gemma":0.00000661753,"domain_scores_codex":[0.9974141,0.00007714543,0.0003260357,0.001040678,0.0005643908,0.0005776875],"domain_scores_gemma":[0.9960594,0.0002706069,0.0001175433,0.002818186,0.0003286146,0.0004056419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002012896,0.00005739557,0.002101471,0.00003110614,0.00007119036,0.00001018196,0.001256854,0.005209496,0.001240529,0.006233289,0.6277144,0.356054],"study_design_scores_gemma":[0.000153903,0.00008997906,0.0005566368,0.00004699682,0.0000104427,0.000006399401,0.0001141052,0.4274083,0.000335572,0.01504956,0.5558636,0.000364525],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001541512,0.0001618586,0.7750062,0.2188451,0.00009289554,0.0005520729,0.000009624653,0.001554543,0.002236169],"genre_scores_gemma":[0.6704811,0.00002959313,0.325655,0.002432316,0.0005262568,0.0004094385,0.00003542341,0.00003686257,0.0003939565],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6689396,"threshold_uncertainty_score":0.9999665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03091944002769708,"gpt":0.2527427510911708,"spread":0.2218233110634737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003356266,0.0001689213,0.0003417122,0.0002960043,0.0002917517,0.00006334338,0.0009361866,0.0001204352,0.000001901396],"category_scores_gemma":[0.00001925933,0.0001654296,0.00009048936,0.004028468,0.00008419844,0.00007845849,0.0004282114,0.0002749419,0.00001506285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001732225,"about_ca_system_score_gemma":0.00003684472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007252136,"about_ca_topic_score_gemma":0.000002067466,"domain_scores_codex":[0.9983356,0.00001454358,0.0003352741,0.0006487321,0.0003540624,0.0003117748],"domain_scores_gemma":[0.9986333,0.00006580081,0.00008753676,0.0007077284,0.0002240723,0.0002816185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002077836,0.0003482906,0.006117137,0.00006139077,0.0004304099,5.036071e-7,0.005249219,0.305334,0.0006460142,0.2667198,0.004826079,0.4102464],"study_design_scores_gemma":[0.0000919941,0.00003309943,0.001760165,0.000003784872,0.0001053933,0.000002101364,0.00002677763,0.9668856,0.00006388547,0.001403218,0.02944122,0.0001827801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07070762,0.00007604963,0.9163781,0.01012577,0.00001338334,0.0004549079,0.00001595103,0.0002311035,0.001997137],"genre_scores_gemma":[0.886846,0.00001799159,0.1113807,0.0009424032,0.00009634377,0.0005366324,0.00002819038,0.00001035061,0.0001414251],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8161384,"threshold_uncertainty_score":0.6746025,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01685700246676542,"gpt":0.2871278328943199,"spread":0.2702708304275545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001787709,0.0003115027,0.0003428946,0.0001502316,0.001818201,0.001322417,0.001385931,0.0002187405,0.000004580626],"category_scores_gemma":[0.00005192704,0.0003343062,0.00006907676,0.0007498717,0.00006507177,0.0006319794,0.0005941401,0.0005404674,0.00001215453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001090089,"about_ca_system_score_gemma":0.00006264969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002084289,"about_ca_topic_score_gemma":0.0003830285,"domain_scores_codex":[0.9971181,0.0001374222,0.0004754491,0.00105213,0.00050053,0.0007163615],"domain_scores_gemma":[0.9971393,0.0001341577,0.0002703772,0.001706359,0.0003267782,0.0004230045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004544645,0.0004614894,0.01589715,0.00003023217,0.00003975651,0.000003176284,0.001445821,0.2813624,0.00008395132,0.03797016,0.007588279,0.6550722],"study_design_scores_gemma":[0.0003833516,0.0001254567,0.03699683,0.00004754082,0.00001604835,0.000008775156,0.00002863957,0.895026,0.000007198231,0.01287302,0.05402694,0.0004602188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0089362,0.0001249985,0.9842182,0.003140129,0.0005981394,0.001247537,0.000005000391,0.0003281964,0.001401574],"genre_scores_gemma":[0.8824023,0.00004646683,0.1136311,0.0007334448,0.002053767,0.0009094261,0.00007081182,0.00002816813,0.0001245574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8734661,"threshold_uncertainty_score":0.9999109,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06332677579152321,"gpt":0.2817792208926737,"spread":0.2184524451011504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006194151,0.0002053398,0.000182611,0.0003078925,0.0005105172,0.0001997583,0.0004008864,0.0001048166,0.000001934096],"category_scores_gemma":[0.00003356127,0.0002271222,0.00003237711,0.001115936,0.00003302125,0.0001569418,0.0002628223,0.0001699361,0.00003897909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005019441,"about_ca_system_score_gemma":0.00002118028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002185269,"about_ca_topic_score_gemma":0.00007809227,"domain_scores_codex":[0.9982495,0.00004919806,0.000218717,0.0007723609,0.0003265662,0.0003836594],"domain_scores_gemma":[0.9986069,0.0001360881,0.00007884771,0.0006399097,0.0002388897,0.000299402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006049735,0.00003092285,0.00002725135,0.00002154045,0.000008376556,0.000002012572,0.0001614822,0.002222752,0.002027043,0.01121032,0.0006153003,0.983667],"study_design_scores_gemma":[0.0002133009,0.0002963436,0.001708045,0.00003608431,0.0000142803,0.00002158873,0.0001068723,0.06233051,0.0132809,0.0156159,0.9058593,0.0005169017],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001026398,0.0001507274,0.9860523,0.009496613,0.0001799259,0.0009065279,0.00001189703,0.002043201,0.0001323713],"genre_scores_gemma":[0.8027216,0.0001615415,0.191274,0.0007018944,0.0004529382,0.004171639,0.00002388016,0.00004274151,0.0004497293],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9831501,"threshold_uncertainty_score":0.9261777,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02833913441444281,"gpt":0.2575506896087158,"spread":0.229211555194273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746753,0.0002167703,0.0002570313,0.00009617907,0.0002338553,0.0001140413,0.0002485864,0.0001221816,0.00000357294],"category_scores_gemma":[0.0000606573,0.0002291771,0.00004765096,0.0008375514,0.00002841996,0.00008312358,0.00009180279,0.000247692,0.00003463494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008121191,"about_ca_system_score_gemma":0.00003502402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005388703,"about_ca_topic_score_gemma":0.0001585034,"domain_scores_codex":[0.9983605,0.00001125302,0.0003269859,0.0003954154,0.0002742016,0.0006316889],"domain_scores_gemma":[0.998929,0.0001479662,0.00003706674,0.0003361089,0.0001941019,0.0003557646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003194936,0.00005126926,0.01830541,0.00006386662,0.00002959814,0.000002241785,0.001152113,0.6881086,0.0001144617,0.001818933,0.2826142,0.007707422],"study_design_scores_gemma":[0.0003411751,0.00003161959,0.0014106,0.0001268234,0.00001377183,0.00000556054,0.0001944693,0.1932733,0.00004445176,0.0006764826,0.803562,0.0003197116],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1658028,0.004395247,0.7801918,0.01427758,0.007455647,0.007091238,0.0002035986,0.002251813,0.01833032],"genre_scores_gemma":[0.978604,0.0000514364,0.01241249,0.0005236604,0.005562027,0.001714893,0.0001235902,0.00007397683,0.0009339647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8128012,"threshold_uncertainty_score":0.9345569,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.07862623162074382,"gpt":0.3650725362020824,"spread":0.2864463045813386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009095681,0.0002887481,0.0004950291,0.0002473333,0.0002508719,0.0006449589,0.001012485,0.0001031411,0.000008985048],"category_scores_gemma":[0.0000574962,0.0002430003,0.00008166741,0.001010213,0.000107001,0.0006809063,0.0002276235,0.0001550817,0.000002063054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005985201,"about_ca_system_score_gemma":0.0001582174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000815632,"about_ca_topic_score_gemma":0.0003923973,"domain_scores_codex":[0.9975405,0.00009743476,0.0005233207,0.0008103466,0.0003735497,0.0006548358],"domain_scores_gemma":[0.9974368,0.001051268,0.0002114301,0.0005043995,0.0004236742,0.0003724649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002334003,0.0004004744,0.01123906,0.00009762063,0.0001788968,0.00001964276,0.0008019052,0.01683868,0.0003311126,0.1899226,0.004490763,0.7754458],"study_design_scores_gemma":[0.006195912,0.0009523946,0.1055414,0.002374533,0.0003059218,0.00007724114,0.000364953,0.6961239,0.0003118858,0.1182544,0.06711728,0.002380151],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002707022,0.000474219,0.9851474,0.009164005,0.0002538243,0.001528605,0.0000659554,0.0001121438,0.0005468798],"genre_scores_gemma":[0.9955755,0.0002891474,0.001477885,0.0008774606,0.001099451,0.0005097856,0.00003023425,0.00003137842,0.000109116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9928685,"threshold_uncertainty_score":0.9909266,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01430885476689927,"gpt":0.2645212001815003,"spread":0.250212345414601,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001647007,0.0001917058,0.0002820218,0.0001623573,0.0002666918,0.0003394705,0.0004795217,0.00006045477,0.00005332297],"category_scores_gemma":[0.00004589487,0.0001988914,0.0001086019,0.0009595542,0.00003617617,0.0001400176,0.0004099741,0.0001182179,0.00009816763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002678558,"about_ca_system_score_gemma":0.00004430806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000139472,"about_ca_topic_score_gemma":0.00002532741,"domain_scores_codex":[0.9981886,0.00006457614,0.000342083,0.000652268,0.0004553115,0.0002971181],"domain_scores_gemma":[0.9983969,0.00009431395,0.00009801438,0.0005672158,0.0005680241,0.0002755414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000008111461,0.0002250436,0.003347207,0.00001799233,0.0001147139,0.000003150702,0.0009861534,0.001515408,0.1563826,0.0009078903,0.02486427,0.8116274],"study_design_scores_gemma":[0.001274728,0.0001266989,0.1254709,0.0001990153,0.000390577,0.00002077308,0.0002834626,0.04353201,0.2750262,0.01303873,0.5387416,0.001895217],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03746298,0.000149617,0.9450922,0.01605682,0.0001862279,0.0002887226,0.000138435,0.0001197166,0.0005052735],"genre_scores_gemma":[0.8949327,0.00005364224,0.09988163,0.0007413085,0.0009198804,0.0002542024,0.0002641825,0.00001947062,0.002933014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8574697,"threshold_uncertainty_score":0.8110557,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01906546984152778,"gpt":0.2439337029251401,"spread":0.2248682330836123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00131154,0.0002542463,0.0002887024,0.0002474277,0.0004710237,0.0001848061,0.0001776886,0.0001494085,0.000003393146],"category_scores_gemma":[0.0001263868,0.0002843945,0.00005864516,0.001362197,0.0000194895,0.00004580841,0.00006305398,0.0002993165,0.00009130076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001165445,"about_ca_system_score_gemma":0.00002078087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002042717,"about_ca_topic_score_gemma":0.0002852681,"domain_scores_codex":[0.9982734,0.00009074169,0.000348203,0.0004423089,0.0002860231,0.0005593656],"domain_scores_gemma":[0.9985287,0.000564403,0.00005752388,0.0003172107,0.0002659763,0.0002661694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001667423,0.00001004581,0.0008069241,0.00005509134,0.00003135235,7.976777e-7,0.00009612511,0.9618898,0.0008090429,0.00004547685,0.003247887,0.03299079],"study_design_scores_gemma":[0.0002424929,0.00003857823,0.002675992,0.00004529269,0.00002183445,0.000003681736,0.00002331195,0.6934444,0.00007893095,0.00002750665,0.3031673,0.000230725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1073386,0.00079531,0.8840438,0.0007642002,0.0008244953,0.00271707,0.0001567107,0.003135171,0.0002247405],"genre_scores_gemma":[0.994803,0.00004894194,0.0006490687,0.00007988096,0.0008066537,0.001905917,0.0008572045,0.0001142928,0.0007350849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8874644,"threshold_uncertainty_score":0.9999608,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0274026692394882,"gpt":0.2705674108215673,"spread":0.2431647415820791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008899345,0.000361007,0.0005380459,0.0003065019,0.0004534668,0.0002322437,0.001813446,0.0002067034,0.000004819698],"category_scores_gemma":[0.0001225055,0.0003774073,0.0001145047,0.002262956,0.0001133826,0.0001276171,0.001026418,0.0003479231,0.00004321569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006912693,"about_ca_system_score_gemma":0.00004718602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005137845,"about_ca_topic_score_gemma":0.00007609111,"domain_scores_codex":[0.9968746,0.00008431554,0.0006015697,0.0009219458,0.0006421986,0.0008753382],"domain_scores_gemma":[0.9975031,0.0002868096,0.000207471,0.001079165,0.0005061621,0.0004172823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002104471,0.0001792249,0.001781461,0.00001667569,0.00005794043,0.000001157904,0.0004268032,0.02080701,0.0001792241,0.0553549,0.08531863,0.8358559],"study_design_scores_gemma":[0.0003450547,0.00009398593,0.004011937,0.00004762489,0.00002838733,0.000007271714,0.00004185941,0.05516001,0.00008836808,0.003089546,0.9366276,0.0004583765],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006057593,0.0001699398,0.9632395,0.02703436,0.0003093087,0.001243797,0.00002185896,0.0007423898,0.00118124],"genre_scores_gemma":[0.7765584,0.00002809928,0.217775,0.002336409,0.001317961,0.001170558,0.00005111952,0.00004297488,0.0007194856],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8513089,"threshold_uncertainty_score":0.9998678,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06793940245675492,"gpt":0.3135506916068471,"spread":0.2456112891500921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001083861,0.0001779224,0.0001903132,0.0001367337,0.0002116053,0.0002235176,0.001880861,0.00007780849,0.000005947768],"category_scores_gemma":[0.00002914692,0.0001866237,0.00002441607,0.0008148134,0.00003127039,0.0003100241,0.002723574,0.0002410454,0.00004584521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005052618,"about_ca_system_score_gemma":0.00004444913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002694261,"about_ca_topic_score_gemma":0.000212964,"domain_scores_codex":[0.9978347,0.00007603616,0.0002774512,0.0008636084,0.0005119864,0.0004361631],"domain_scores_gemma":[0.9971594,0.00008738434,0.00006991482,0.002124002,0.00008354045,0.0004757507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003477274,0.0006514375,0.02094743,0.0001694887,0.00004413022,0.00001339845,0.02433551,0.00453135,0.0000470259,0.05843565,0.3068452,0.5839446],"study_design_scores_gemma":[0.0001968531,0.0000491095,0.001510389,0.00003606059,0.00000554291,0.000005187369,0.0001699149,0.01091157,0.000005847905,0.006291737,0.980597,0.000220837],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.011158,0.005775246,0.9475849,0.03107951,0.0004547551,0.002376683,0.0003875834,0.0002937413,0.0008895676],"genre_scores_gemma":[0.8855636,0.0005204118,0.1065565,0.002026235,0.002131196,0.001981639,0.0009796366,0.00004075836,0.0002000548],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8744056,"threshold_uncertainty_score":0.7610292,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03062303755965068,"gpt":0.2562055703969894,"spread":0.2255825328373387,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00098116,0.000194553,0.0001764689,0.0002295945,0.001040624,0.0001231097,0.0003000357,0.00003715223,0.0001946598],"category_scores_gemma":[0.0000900753,0.0002304121,0.00006479806,0.001021357,0.00002244887,0.0001013996,0.000266625,0.0001988461,0.0000413198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000126851,"about_ca_system_score_gemma":0.00001610638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006175767,"about_ca_topic_score_gemma":0.000357714,"domain_scores_codex":[0.9981763,0.00001907806,0.0004504603,0.0004908115,0.0004550198,0.0004083632],"domain_scores_gemma":[0.9992742,0.00002330529,0.00009271492,0.0002971405,0.0002694939,0.00004312669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000306734,0.0001477549,0.003935709,0.00008789469,0.00001189985,2.022776e-7,0.00009449222,0.9389097,0.000005115786,0.02903573,0.02116219,0.006578636],"study_design_scores_gemma":[0.0002224394,0.00002150344,0.001823021,0.000003535293,0.00002747309,1.052504e-7,0.0003511464,0.4102199,5.797339e-7,0.0006064274,0.5865381,0.000185803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001400023,0.00005860536,0.9858194,0.006637898,0.0003355766,0.002065252,0.00002553039,0.0001522917,0.00350543],"genre_scores_gemma":[0.9853682,0.000006378502,0.0007972533,0.001046109,0.0007122629,0.004819048,0.004528992,0.00002668835,0.002695056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9850221,"threshold_uncertainty_score":0.9395934,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05056748979579573,"gpt":0.3152218450508855,"spread":0.2646543552550898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007129419,0.0001876057,0.0002851747,0.0002546696,0.0008577455,0.0003317751,0.003195675,0.00008759081,0.00001119147],"category_scores_gemma":[0.0002191393,0.0002010581,0.00005205348,0.000879364,0.00009619218,0.0002054737,0.001888066,0.0003170524,0.00004044191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003584892,"about_ca_system_score_gemma":0.00001850164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003853044,"about_ca_topic_score_gemma":0.00426602,"domain_scores_codex":[0.9985029,0.00002916363,0.0003317985,0.0004679772,0.0002860875,0.0003821135],"domain_scores_gemma":[0.9945657,0.0001952844,0.00006602774,0.004841737,0.0001123205,0.0002189308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003185004,0.0004332527,0.380027,0.0002076936,0.001104623,0.00001128157,0.005921283,0.2701069,0.001325484,0.00554548,0.205043,0.1302421],"study_design_scores_gemma":[0.0001556229,0.000006464381,0.09791438,0.00004842726,0.0001187641,0.000001982775,0.00006273219,0.2397528,0.0000212529,0.0004068218,0.6612255,0.0002852862],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3222449,0.006853588,0.4435668,0.1608551,0.002702724,0.006085509,0.001720833,0.002302189,0.0536683],"genre_scores_gemma":[0.9895164,0.0002272399,0.008115301,0.0001305219,0.0006476295,0.0003272301,0.0004888597,0.00002873022,0.000518095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6672714,"threshold_uncertainty_score":0.8198912,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05581329026549677,"gpt":0.3197418258759362,"spread":0.2639285356104395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002071656,0.0005111194,0.0005549721,0.0003699095,0.001164641,0.0008186661,0.002258399,0.0001882909,0.00001373278],"category_scores_gemma":[0.0002147882,0.0005062327,0.0001440109,0.001819513,0.00007256305,0.000521052,0.001253406,0.0005346646,0.0002058098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001862807,"about_ca_system_score_gemma":0.00008350513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000605059,"about_ca_topic_score_gemma":0.00008791051,"domain_scores_codex":[0.9947645,0.000102595,0.0008360053,0.001513509,0.00163771,0.001145662],"domain_scores_gemma":[0.9956344,0.0006093142,0.0003077071,0.001765718,0.0008757953,0.0008070517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002601263,0.0003402003,0.001488138,0.00001846559,0.0001373884,0.000002406576,0.00317421,0.1194048,0.0003800999,0.05410676,0.02825362,0.7926679],"study_design_scores_gemma":[0.0002870181,0.0000516735,0.001146989,0.0001674824,0.00009133987,0.00001738376,0.0004580454,0.5547211,0.00005888472,0.00008313065,0.442282,0.0006350047],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01218907,0.000255504,0.9790635,0.004802808,0.0004715921,0.001052624,0.00008355075,0.0003460641,0.001735314],"genre_scores_gemma":[0.8937409,0.000006509514,0.1001275,0.001142211,0.002720013,0.0003449623,0.0002662955,0.00006039259,0.001591199],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8815519,"threshold_uncertainty_score":0.9997389,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0184560466878563,"gpt":0.2769123552568405,"spread":0.2584563085689843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003410717,0.0007311305,0.0007399237,0.0005298362,0.0009023838,0.0006010822,0.003204515,0.0003440199,0.00001036434],"category_scores_gemma":[0.0005268155,0.0006158703,0.0001743663,0.004912639,0.0001325909,0.0004786778,0.001344968,0.0007242886,0.0001884569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002560838,"about_ca_system_score_gemma":0.00008603535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002627236,"about_ca_topic_score_gemma":0.0003499192,"domain_scores_codex":[0.9937828,0.0002673249,0.0008277021,0.001435354,0.002028654,0.001658163],"domain_scores_gemma":[0.9937186,0.0004246726,0.0002724116,0.002665899,0.001752593,0.001165806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008103152,0.0001987714,0.002819048,0.00002485945,0.0001491468,0.000002587117,0.01011399,0.08421324,0.005412454,0.03796621,0.1768984,0.6821203],"study_design_scores_gemma":[0.0003695721,0.0005376792,0.02849961,0.0001555428,0.0001205009,0.00002183085,0.0006143826,0.01102204,0.006425925,0.005922729,0.9450749,0.001235269],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05162343,0.0002902591,0.8869274,0.05338978,0.001529404,0.004173102,0.00007145855,0.0008759978,0.001119186],"genre_scores_gemma":[0.8542505,0.000006746414,0.1359114,0.003036092,0.002747025,0.002291348,0.00009572996,0.00008559467,0.001575507],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8026271,"threshold_uncertainty_score":0.9996293,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009932272159633892,"gpt":0.227333602091581,"spread":0.2174013299319471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003984401,0.0002937719,0.0002881102,0.0001386811,0.0003251398,0.0001765137,0.0001572881,0.0001286272,0.00003903473],"category_scores_gemma":[0.00002787,0.0003369655,0.00005103884,0.0007871207,0.00003513108,0.00002013819,0.00009225084,0.0003133969,0.00006438523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006501599,"about_ca_system_score_gemma":0.00002575457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009891645,"about_ca_topic_score_gemma":0.00003136561,"domain_scores_codex":[0.9981763,0.00003137353,0.000258314,0.0005385133,0.0003779268,0.0006176119],"domain_scores_gemma":[0.9987564,0.0001577824,0.00003177343,0.0005074139,0.0001463505,0.0004002804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005799049,0.00003468438,0.0005791225,0.00005301024,0.00004410877,0.00001236972,0.0001418198,0.9561396,0.001089633,0.0008575391,0.01257903,0.02846332],"study_design_scores_gemma":[0.0002566381,0.00001829756,0.0003955036,0.0001052543,0.0000306806,0.00001484061,0.00004632688,0.5362864,0.0006635821,0.0001366546,0.4617201,0.000325699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6911194,0.007834299,0.2465028,0.01823704,0.001093372,0.002996752,0.000181213,0.002675908,0.02935919],"genre_scores_gemma":[0.9846034,0.00004531359,0.009599965,0.001119438,0.001094054,0.0004998573,0.0001142757,0.0001053881,0.002818294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4491411,"threshold_uncertainty_score":0.9999082,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01540513262395177,"gpt":0.2530661699980289,"spread":0.2376610373740772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719138,0.0001406252,0.0002095131,0.0003542941,0.0002077823,0.00006395613,0.0003859498,0.0001186508,3.978639e-7],"category_scores_gemma":[0.00004899627,0.0001485234,0.00003084119,0.001402406,0.00005554457,0.0000389138,0.0003228685,0.0002469596,0.000003200714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002333438,"about_ca_system_score_gemma":0.00001110691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001704059,"about_ca_topic_score_gemma":0.00003693236,"domain_scores_codex":[0.9986954,0.00003304258,0.0002803669,0.0005260655,0.0001732232,0.000291914],"domain_scores_gemma":[0.999177,0.0001545907,0.00009265656,0.0003440742,0.0001385885,0.00009309086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003176801,0.0001891982,0.004662958,0.0001204869,0.00004619689,9.937356e-7,0.008112286,0.009389802,0.003055047,0.08192261,0.0007167611,0.8917519],"study_design_scores_gemma":[0.000276762,0.00006817078,0.0009841295,0.00001856283,0.000009153478,0.000008861644,0.0001105574,0.9530636,0.0006325368,0.006902466,0.03774664,0.000178534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09268592,0.00011586,0.9023888,0.003415162,0.00002856091,0.0008911059,0.000005330644,0.0003264995,0.0001427283],"genre_scores_gemma":[0.9490018,0.00001858914,0.04868562,0.0001656283,0.00005414378,0.00150725,0.00002494576,0.00001590309,0.000526074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9436738,"threshold_uncertainty_score":0.6056607,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02785332702723689,"gpt":0.2559014472032096,"spread":0.2280481201759727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003003333,0.0002210332,0.0002171389,0.0001494198,0.0002288164,0.00009925782,0.000190519,0.0001771861,0.000002543279],"category_scores_gemma":[0.00004856964,0.0002344536,0.00004528117,0.0007408885,0.00004864167,0.00005377561,0.00004433646,0.0001429454,0.00002328354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008881887,"about_ca_system_score_gemma":0.00002768541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050825,"about_ca_topic_score_gemma":0.00001625666,"domain_scores_codex":[0.9987378,0.00001449357,0.0002692998,0.0003253445,0.0002598909,0.0003931798],"domain_scores_gemma":[0.9988049,0.00009779767,0.0000422932,0.0003120406,0.0005064887,0.0002364725],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001914953,0.00001851784,0.0005173436,0.00001927488,0.00002102438,3.300674e-7,0.0001421835,0.9340217,0.00004277637,0.003401803,0.03074197,0.03105391],"study_design_scores_gemma":[0.0002960016,0.00003817249,0.00003908294,0.00002944767,0.00001880895,0.000001214209,0.0001814532,0.6971983,0.0004663296,0.0004778522,0.3010134,0.000239979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0011736,0.0002016347,0.9943104,0.001151193,0.0002625242,0.001021572,0.00002868295,0.001049781,0.0008006031],"genre_scores_gemma":[0.9720089,0.00001526727,0.02428371,0.0006802847,0.0008151549,0.001421975,0.0002025535,0.00008078051,0.0004913401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9708353,"threshold_uncertainty_score":0.9560739,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01537402381692361,"gpt":0.2535043090546676,"spread":0.238130285237744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262951,0.0001790671,0.0002078148,0.0001166497,0.0003733878,0.0003750274,0.0004929667,0.0000654378,0.000001111202],"category_scores_gemma":[0.00008102841,0.0001685309,0.00004227147,0.001181047,0.00002448816,0.00003946819,0.000776913,0.0002020182,0.00001488219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004798125,"about_ca_system_score_gemma":0.00005502097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005086739,"about_ca_topic_score_gemma":0.00002257771,"domain_scores_codex":[0.9982461,0.00006006936,0.0002748555,0.0006310175,0.0003411642,0.0004467729],"domain_scores_gemma":[0.9987165,0.0002430828,0.00005994874,0.0005138682,0.0002451814,0.0002214153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002798472,0.0006422548,0.05453686,0.000231642,0.00007456931,0.00006858369,0.01149687,0.2477532,0.005380236,0.006563787,0.08322715,0.5899969],"study_design_scores_gemma":[0.0006382316,0.00003609897,0.08328369,0.0002584197,0.00001845195,0.00003833113,0.0001232012,0.536732,0.0004610079,0.0008886876,0.3768867,0.0006352205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4279562,0.0009540375,0.5344624,0.03216092,0.001446289,0.0006995823,0.000001585609,0.0002670219,0.002051975],"genre_scores_gemma":[0.9542221,0.000004747623,0.04211788,0.0009537609,0.00190506,0.0001718406,0.00001485385,0.00001577703,0.0005940247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5893617,"threshold_uncertainty_score":0.6872489,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02020906581841103,"gpt":0.3029157116472507,"spread":0.2827066458288396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001694901,0.0001593092,0.0002970828,0.000126711,0.0003836516,0.0002244973,0.000465216,0.00008436535,1.154979e-7],"category_scores_gemma":[0.00008104075,0.0001608704,0.00002122062,0.001348507,0.00005885147,0.00009729706,0.0007500882,0.000191001,6.56454e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000446228,"about_ca_system_score_gemma":0.00005026545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002608914,"about_ca_topic_score_gemma":0.0007186459,"domain_scores_codex":[0.9982975,0.0001743062,0.0005384899,0.0004904164,0.0002318821,0.0002674739],"domain_scores_gemma":[0.9981998,0.0006500744,0.0001386715,0.0005956637,0.0003336733,0.00008214584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000342273,0.0004249189,0.07893204,0.001366494,0.00008220506,8.718351e-7,0.039435,0.009798927,0.005074421,0.4477525,0.00315287,0.4139456],"study_design_scores_gemma":[0.0009805328,0.0001053889,0.04989855,0.002426247,0.00004703327,0.0000181923,0.002281239,0.760062,0.001117431,0.02890405,0.1531236,0.001035804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1808116,0.001511465,0.8074219,0.007323157,0.0004530406,0.0004450714,0.000001325504,0.00009426733,0.001938219],"genre_scores_gemma":[0.981398,0.00002523151,0.0175897,0.000549112,0.000203352,0.0001134872,0.000007416548,0.000007466153,0.0001061882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8005865,"threshold_uncertainty_score":0.6560104,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01901102807958396,"gpt":0.3128607785266782,"spread":0.2938497504470942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009759475,0.0004123616,0.0004390613,0.0003419124,0.001112035,0.0006826364,0.0009201194,0.0001445908,0.000001484764],"category_scores_gemma":[0.00003147096,0.0004365649,0.0001056858,0.001891733,0.00005277813,0.0002123695,0.0004692775,0.0003167221,0.000005499296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336891,"about_ca_system_score_gemma":0.00007218484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009515647,"about_ca_topic_score_gemma":0.0002849984,"domain_scores_codex":[0.9963875,0.0001920135,0.0005808664,0.001428604,0.0005297135,0.0008812469],"domain_scores_gemma":[0.9973706,0.0005259366,0.0001331278,0.0009169454,0.000644823,0.000408562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000042551,0.0003970589,0.004486527,0.00000846036,0.00005519776,0.000001298007,0.0003392451,0.8869271,0.00005165899,0.003075459,0.009898597,0.09471688],"study_design_scores_gemma":[0.0005090314,0.0002187112,0.001488784,0.00005152954,0.00004789707,0.00001280641,0.0001020681,0.8413218,0.00006262536,0.0001338773,0.1556319,0.0004190289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09524107,0.00009578796,0.8971098,0.004813893,0.0005887384,0.001305263,0.000005806917,0.0005392073,0.0003004523],"genre_scores_gemma":[0.9261068,0.000009959188,0.06526065,0.002431019,0.001653036,0.001757892,0.00005478901,0.00005427544,0.002671568],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8318492,"threshold_uncertainty_score":0.9998086,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1076893420485878,"gpt":0.3536290759107938,"spread":0.2459397338622059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004361846,0.0004874148,0.0005943449,0.0005176511,0.0009225342,0.001079037,0.0021711,0.0001604088,0.000009800411],"category_scores_gemma":[0.0003505143,0.0005136906,0.0001276127,0.002473427,0.00002994778,0.0004478538,0.0007456782,0.000479154,0.00008294881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002039343,"about_ca_system_score_gemma":0.0001177511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004910047,"about_ca_topic_score_gemma":0.00007025486,"domain_scores_codex":[0.9944119,0.0001769122,0.0009823211,0.001906491,0.001504203,0.00101818],"domain_scores_gemma":[0.996376,0.0003107269,0.0002934772,0.001316222,0.0009791912,0.000724355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002704039,0.0001874506,0.00005087001,0.00001445016,0.0001170846,0.000004840908,0.009673499,0.1017787,0.01123399,0.02648091,0.01265039,0.8377808],"study_design_scores_gemma":[0.0003246978,0.0001230752,0.000289603,0.0001010458,0.0001003176,0.00001988729,0.001502619,0.8604417,0.0001905752,0.00005870958,0.1362108,0.000636975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04558197,0.00005765876,0.9281306,0.02360595,0.0003458411,0.001162466,0.00004474551,0.0003892987,0.0006814671],"genre_scores_gemma":[0.7238517,0.00000198983,0.2709855,0.002480028,0.001338296,0.0001542927,0.0001866395,0.00003825805,0.0009632688],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8371438,"threshold_uncertainty_score":0.9999579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01971069125939457,"gpt":0.2762502087912448,"spread":0.2565395175318502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001853925,0.0006951995,0.000758528,0.000692649,0.001059816,0.001267819,0.002344298,0.0003761662,0.000004047864],"category_scores_gemma":[0.0006338442,0.0007302377,0.0001708939,0.003896238,0.00004597344,0.0002918707,0.0005194425,0.0004522357,0.0002535662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000329356,"about_ca_system_score_gemma":0.0001491856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000100195,"about_ca_topic_score_gemma":0.00009522425,"domain_scores_codex":[0.9938656,0.0000915499,0.0009242278,0.001762871,0.001867093,0.001488674],"domain_scores_gemma":[0.9916739,0.0005471025,0.0002936187,0.001976258,0.004610602,0.0008984582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002166685,0.0008602861,0.002765415,0.0001738781,0.0002493393,0.000008687581,0.001862846,0.1335206,0.007315011,0.1590912,0.4819528,0.2119833],"study_design_scores_gemma":[0.0009168894,0.0003219085,0.004968721,0.0002035364,0.00006973577,0.00001230814,0.00007990374,0.1984322,0.0007810935,0.003478321,0.7896913,0.001044054],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009479434,0.0001883837,0.7926208,0.1910063,0.0006832415,0.00395343,0.0001562008,0.00157276,0.0003394558],"genre_scores_gemma":[0.8779768,0.000004986935,0.1029426,0.009313921,0.001519352,0.004641114,0.0004501786,0.000072305,0.00307865],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8684974,"threshold_uncertainty_score":0.999769,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01968535989403523,"gpt":0.2568871754758932,"spread":0.237201815581858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235124,0.000174395,0.0002035339,0.00009587777,0.0004464097,0.0002106575,0.0002326504,0.00008675516,0.000001014767],"category_scores_gemma":[0.000043279,0.0001875355,0.0000364577,0.00130793,0.0000281922,0.00006255661,0.0001905532,0.0002744002,0.00002212253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005144306,"about_ca_system_score_gemma":0.00001701616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004776486,"about_ca_topic_score_gemma":0.00003880296,"domain_scores_codex":[0.998405,0.00006640075,0.0002307297,0.0006115027,0.0002957864,0.0003905533],"domain_scores_gemma":[0.9992879,0.0001064332,0.00006249774,0.0001643654,0.0001200584,0.0002587215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003526155,0.00006302459,0.0007542017,0.00002883797,0.00001975957,0.000004683615,0.003835201,0.02896955,0.002199446,0.001880285,0.0008101247,0.9613996],"study_design_scores_gemma":[0.001480195,0.0005815125,0.04389415,0.0001573318,0.00006283348,0.0000579365,0.0006225991,0.4911167,0.00228836,0.002887587,0.4555316,0.001319201],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1433423,0.000116141,0.8400217,0.01475797,0.0002174636,0.001000762,0.000005091596,0.0002728904,0.0002657362],"genre_scores_gemma":[0.9887655,0.00001081107,0.008112337,0.001223448,0.001465867,0.0003511588,0.000007577003,0.00001669263,0.00004659308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9600804,"threshold_uncertainty_score":0.7647475,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03281763495495147,"gpt":0.293704309409292,"spread":0.2608866744543405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001086567,0.000329969,0.0004019169,0.000298793,0.0007752416,0.0007462856,0.0005574221,0.000103545,0.000007625506],"category_scores_gemma":[0.00006756803,0.0003307978,0.00007271452,0.001404064,0.0000411248,0.0002043187,0.0005769016,0.0004622487,0.00003240173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005705547,"about_ca_system_score_gemma":0.00004043426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007944268,"about_ca_topic_score_gemma":0.00006789099,"domain_scores_codex":[0.9972079,0.0001054001,0.0005702259,0.000972954,0.0004691122,0.0006744076],"domain_scores_gemma":[0.9988263,0.0001571354,0.0001800983,0.0003451442,0.000202364,0.0002890161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001272243,0.00008146296,0.002202751,0.00006276661,0.000101117,0.00002195244,0.004893973,0.8783023,0.00596714,0.003163421,0.001312649,0.1038777],"study_design_scores_gemma":[0.0002072973,0.00004510222,0.0001441124,0.0001012216,0.00006979183,0.00003268166,0.0003069202,0.9839767,0.00009141224,0.000007727624,0.01463943,0.0003776503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4416198,0.0002612061,0.5561324,0.000596316,0.0001781921,0.0006288223,0.00006914157,0.0004739494,0.00004012651],"genre_scores_gemma":[0.9618881,0.00002161969,0.03607202,0.0002871495,0.0004780502,0.0002910931,0.0006708386,0.00004149855,0.0002496434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5202683,"threshold_uncertainty_score":0.9999144,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09307694516990196,"gpt":0.2922369882356663,"spread":0.1991600430657643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002279232,0.0004336775,0.0004555393,0.0001566551,0.001572615,0.0006116676,0.001573437,0.0001471057,0.0000152484],"category_scores_gemma":[0.0003050355,0.000449468,0.000150976,0.001508634,0.00006906375,0.000286893,0.001071538,0.0003700621,0.00008701511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001720205,"about_ca_system_score_gemma":0.00007876856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005430323,"about_ca_topic_score_gemma":0.0001116176,"domain_scores_codex":[0.9963135,0.0001234616,0.0007083067,0.001079391,0.0007759241,0.0009994878],"domain_scores_gemma":[0.9951246,0.0003775063,0.0002246037,0.001419231,0.002170643,0.0006833948],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008958555,0.0002316427,0.002427731,0.00004104538,0.0001106572,0.000002120277,0.004813197,0.002599783,0.001540687,0.1784162,0.1157333,0.6939941],"study_design_scores_gemma":[0.0005607813,0.0001802469,0.006268498,0.0001393546,0.00005183197,0.00001144504,0.0001339788,0.05481968,0.0004816932,0.001428558,0.9351577,0.0007662561],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002596204,0.0003326067,0.9693037,0.02251187,0.0006989892,0.002311634,0.00006392186,0.0004620135,0.001719115],"genre_scores_gemma":[0.8979087,0.00007536817,0.08868195,0.003005485,0.001669388,0.002793332,0.0002953222,0.00005948177,0.005510974],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8953125,"threshold_uncertainty_score":0.9997957,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02598666883084477,"gpt":0.2889531711439613,"spread":0.2629665023131165,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001682772,0.0006416815,0.000672197,0.0007931032,0.001044452,0.0006540986,0.002254188,0.0003520921,0.000005833293],"category_scores_gemma":[0.0005229625,0.000680799,0.0001690404,0.002740601,0.00009047518,0.0005377867,0.0008363945,0.0004905586,0.0002360465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002896238,"about_ca_system_score_gemma":0.00009444459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006002915,"about_ca_topic_score_gemma":0.0001286552,"domain_scores_codex":[0.9945935,0.00007735137,0.0008594251,0.001594194,0.001349628,0.00152588],"domain_scores_gemma":[0.9948266,0.0005336888,0.000253762,0.001697763,0.001924069,0.0007641683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005876027,0.0001428916,0.0001623817,0.00001597899,0.00005055634,0.000004403994,0.002358069,0.0145394,0.0007056898,0.06778254,0.2181941,0.6959853],"study_design_scores_gemma":[0.0005371955,0.0007458276,0.002120187,0.0001080215,0.00005676344,0.00004676148,0.0004369255,0.03625314,0.001095076,0.0238572,0.9337176,0.001025283],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004443948,0.0001427816,0.8308169,0.1574212,0.0005111491,0.002793631,0.0000749316,0.001264419,0.002531003],"genre_scores_gemma":[0.6802312,0.00001322265,0.3023102,0.007064936,0.001389155,0.002444395,0.000123675,0.00006061429,0.006362562],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7155235,"threshold_uncertainty_score":0.9995643,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01735716811584254,"gpt":0.2570472750309769,"spread":0.2396901069151343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001474228,0.000355387,0.000391119,0.0002371138,0.0003507127,0.0004604759,0.001033108,0.000190174,0.000002908204],"category_scores_gemma":[0.00003834504,0.0003835613,0.00006573253,0.002664436,0.00005467172,0.0001502558,0.00080049,0.0004498987,0.00002815319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001932595,"about_ca_system_score_gemma":0.00007581755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008629761,"about_ca_topic_score_gemma":0.0001173142,"domain_scores_codex":[0.9966333,0.0001155552,0.0005750793,0.001064352,0.0006660916,0.0009456286],"domain_scores_gemma":[0.9975269,0.0002454726,0.0001713544,0.0009413425,0.0004309751,0.000683927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009965362,0.00007412285,0.0012925,0.000003002433,0.00001305915,0.000005079238,0.0004379211,0.7284087,0.00002109961,0.01644172,0.0020202,0.2512726],"study_design_scores_gemma":[0.0004295684,0.00004117227,0.0006998732,0.00008998757,0.00001130958,0.00001039243,0.00006743133,0.8910797,0.00001691173,0.0005631234,0.1065754,0.0004151205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03233878,0.001188132,0.9609523,0.002778284,0.0005586547,0.0006514575,0.000002871054,0.0003707731,0.001158731],"genre_scores_gemma":[0.9804733,0.00003772928,0.016202,0.001060292,0.0009057992,0.0007423463,0.00003104077,0.00004849144,0.0004989699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9481345,"threshold_uncertainty_score":0.9998617,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02137866558049927,"gpt":0.2765908388230916,"spread":0.2552121732425923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085794,0.000191964,0.0002017025,0.0008650827,0.0005344037,0.0009834643,0.0007937955,0.00009907779,0.00001736103],"category_scores_gemma":[0.0002925888,0.0002094438,0.00005725451,0.008068752,0.00004874683,0.0001207436,0.0007360376,0.0001660204,0.00007305537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006559183,"about_ca_system_score_gemma":0.00006502958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003718341,"about_ca_topic_score_gemma":0.00001300088,"domain_scores_codex":[0.9974378,0.00008729495,0.0004219636,0.0009330969,0.000741918,0.0003779171],"domain_scores_gemma":[0.9974319,0.0002729926,0.0001352984,0.001204522,0.0005904759,0.0003648299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001386844,0.0007793523,0.009557202,0.0001675411,0.0000852637,0.000009980664,0.00240836,0.002644102,0.01493968,0.05529695,0.0527315,0.8613662],"study_design_scores_gemma":[0.0003593071,0.00001846559,0.06890039,0.00003521334,0.00002963091,0.00001059439,0.00006259947,0.1789791,0.001442686,0.001354579,0.748391,0.0004164434],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03361585,0.0008181185,0.9470469,0.01651723,0.0005259237,0.0005634777,0.00002802137,0.0002169953,0.0006674571],"genre_scores_gemma":[0.9661013,0.00003692765,0.02992694,0.0009357144,0.0004027768,0.0002550728,0.00009845886,0.00001974479,0.002223049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9324855,"threshold_uncertainty_score":0.9483569,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01345272775311876,"gpt":0.2577501957171053,"spread":0.2442974679639865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009858034,0.0004639324,0.0005236036,0.0004381043,0.0006557339,0.001040622,0.00280152,0.0002776798,0.000008534153],"category_scores_gemma":[0.0001719497,0.0004761394,0.00008308449,0.002773703,0.00006861555,0.0002111458,0.001613557,0.0006588012,0.001172642],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008142766,"about_ca_system_score_gemma":0.00007388848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008119362,"about_ca_topic_score_gemma":0.000262953,"domain_scores_codex":[0.9957612,0.00004058759,0.0005993442,0.001552267,0.0009599224,0.001086719],"domain_scores_gemma":[0.9954982,0.0003172492,0.0001380236,0.002632431,0.0005637255,0.0008503787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002106722,0.000204919,0.003566803,0.00004040433,0.0001086942,0.00001814628,0.002244391,0.03214977,0.008928576,0.05241494,0.6603957,0.2399066],"study_design_scores_gemma":[0.0001655371,0.00007924908,0.001847559,0.0001121384,0.00002817179,0.0000207391,0.00009836466,0.02124538,0.0004107584,0.00483401,0.9704906,0.0006674326],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04797794,0.0002874721,0.8752754,0.06488232,0.00264426,0.002446181,0.00006340776,0.002348057,0.004074908],"genre_scores_gemma":[0.8257709,0.00001376673,0.1590839,0.002497644,0.002839075,0.002221974,0.00004498522,0.00007644195,0.0074514],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7777929,"threshold_uncertainty_score":0.9999964,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007599880529336489,"gpt":0.2289612092993574,"spread":0.2213613287700209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008618286,0.0002986877,0.0003181082,0.0001975135,0.0003194713,0.0002530681,0.0005531165,0.0001239244,0.000002653217],"category_scores_gemma":[0.00002345766,0.0002558342,0.0000430196,0.001117441,0.00006069301,0.0001227595,0.0003925962,0.0001564987,0.00001343043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001202446,"about_ca_system_score_gemma":0.00001288378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000054018,"about_ca_topic_score_gemma":0.00009372074,"domain_scores_codex":[0.9973597,0.0001313135,0.0004278466,0.0009693356,0.0003252631,0.0007865648],"domain_scores_gemma":[0.9982527,0.0003791126,0.0001285696,0.0007377761,0.0001648666,0.0003370137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003509216,0.0001147906,0.002065204,0.00001018245,0.00007166389,0.0000194842,0.000114586,0.4509245,0.0003073786,0.09773298,0.004705843,0.4438984],"study_design_scores_gemma":[0.0008469781,0.00003830617,0.003803167,0.0001398462,0.00002190404,0.00001162305,0.00001749625,0.7173676,0.00002249157,0.0007534776,0.2765201,0.0004570056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003006885,0.000268335,0.9841168,0.01088499,0.0002415733,0.0003875139,0.000017042,0.0002621759,0.0008146826],"genre_scores_gemma":[0.9786009,0.0003059504,0.01488204,0.001080561,0.0002808484,0.0005095011,0.00003213366,0.00003600624,0.004272127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9755939,"threshold_uncertainty_score":0.9999894,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01475570441482522,"gpt":0.2590951230733169,"spread":0.2443394186584917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00118966,0.0002769314,0.0002544796,0.0002695417,0.0008949763,0.001008564,0.0004522542,0.0002333992,0.000001500897],"category_scores_gemma":[0.00004809785,0.0002731727,0.00009968935,0.002044355,0.0000309933,0.0003233219,0.0002320827,0.0003733267,0.00003073023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001408834,"about_ca_system_score_gemma":0.00003993659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002619293,"about_ca_topic_score_gemma":0.0000182599,"domain_scores_codex":[0.9975561,0.00009222228,0.000343738,0.0009689344,0.0005202335,0.0005187626],"domain_scores_gemma":[0.9983332,0.0002676468,0.0001007787,0.0005281267,0.0004977591,0.000272484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004137868,0.00005341483,0.000008451758,0.0001412462,0.0000449462,0.000001127562,0.001075536,0.05296475,0.0003148865,0.05869244,0.06354291,0.8231189],"study_design_scores_gemma":[0.0001039224,0.0001215658,0.00005951678,0.000116856,0.00003089922,0.00002926008,0.0000562119,0.4421535,0.00007355725,0.004620984,0.5523934,0.0002402826],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006502511,0.001982291,0.9850386,0.006380572,0.002069949,0.002351006,0.00001578423,0.0006415546,0.0008700328],"genre_scores_gemma":[0.9003585,0.0002000576,0.08000987,0.0007277605,0.009734565,0.005300512,0.0001627172,0.00007470439,0.003431319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9050287,"threshold_uncertainty_score":0.999972,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Identification (biology); Internet of Things; Computer science; Embedded system; Human–computer interaction; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02478653155890829,"gpt":0.3116309035122318,"spread":0.2868443719533235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005454833,0.000208502,0.0001977391,0.0002556765,0.0003815181,0.001048355,0.0005630969,0.00008737911,0.000005825832],"category_scores_gemma":[0.00001291895,0.0001982567,0.0001008672,0.001360859,0.00002629006,0.0001142924,0.000131325,0.0002206536,0.00008892071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007149785,"about_ca_system_score_gemma":0.00005883712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000342141,"about_ca_topic_score_gemma":0.00008654033,"domain_scores_codex":[0.997994,0.00004267934,0.0003605199,0.000770618,0.0004827685,0.0003493906],"domain_scores_gemma":[0.9989427,0.0001045539,0.00007628582,0.0003849572,0.0003149698,0.0001765193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001191383,0.0002872279,0.0001061412,0.0001188468,0.000153466,0.00001589665,0.006774293,0.1268158,0.02008552,0.2211597,0.01570502,0.6087662],"study_design_scores_gemma":[0.00007020034,0.00002624032,0.0002519146,0.0001578062,0.00009008514,0.000009290743,0.00005061748,0.7997922,0.002561177,0.0001211653,0.1965257,0.0003436096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02711369,0.0005451737,0.9666458,0.004178884,0.000389004,0.0003873255,0.000005934979,0.0003713088,0.0003629007],"genre_scores_gemma":[0.9719273,0.000003475002,0.0250005,0.0004571382,0.0007409084,0.0002014672,0.00003211937,0.00002396799,0.001613087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9448137,"threshold_uncertainty_score":0.9999887,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02622262310831535,"gpt":0.2927283235356845,"spread":0.2665057004273691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003992679,0.000178615,0.0002361488,0.0000910367,0.0003420457,0.0001326267,0.0005554099,0.0001195412,5.054484e-7],"category_scores_gemma":[0.00001811394,0.0001659191,0.00002068266,0.001304533,0.00008161104,0.0001115186,0.0001628959,0.0002387721,0.000002750307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000157945,"about_ca_system_score_gemma":0.00004702568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007914641,"about_ca_topic_score_gemma":0.00003035961,"domain_scores_codex":[0.9983989,0.00001823292,0.0002406766,0.0007630782,0.0001928952,0.0003862103],"domain_scores_gemma":[0.9988939,0.00009515238,0.00005741254,0.0004634855,0.0001844459,0.0003055649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009391482,0.0003025265,0.01873363,0.0000833775,0.00004425089,0.000003767022,0.004194177,0.4975524,0.00007070966,0.332224,0.005806303,0.140891],"study_design_scores_gemma":[0.0002463809,0.0001178915,0.001136169,0.00002128615,0.00001503345,0.000008668926,0.00005735262,0.9653895,0.000009904762,0.01388434,0.01888507,0.0002283905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05720084,0.0001197745,0.9026269,0.03874767,0.00001063348,0.0009162912,0.000009189986,0.0002378483,0.0001308733],"genre_scores_gemma":[0.868669,0.00001091009,0.1281437,0.001529741,0.0002116043,0.001345882,0.00001461304,0.0000177287,0.00005680111],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8114681,"threshold_uncertainty_score":0.6765983,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01960624868353231,"gpt":0.2570765666461239,"spread":0.2374703179625916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001145475,0.0002906331,0.0003324949,0.0003163835,0.000341321,0.0002146715,0.001020588,0.0001200171,0.00001872937],"category_scores_gemma":[0.0001899805,0.0002957099,0.00005402496,0.001233036,0.00009227643,0.0001045063,0.0006779911,0.0003202943,0.00004377331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005828099,"about_ca_system_score_gemma":0.00008387064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006025276,"about_ca_topic_score_gemma":0.0001144488,"domain_scores_codex":[0.9970959,0.00002995341,0.000464295,0.0008463968,0.0009904845,0.0005729946],"domain_scores_gemma":[0.9975507,0.0001769044,0.000154859,0.001119896,0.0006232684,0.00037435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001466797,0.0002150082,0.001564881,0.00005559776,0.00005017079,0.000001928408,0.0006128293,0.001749458,0.03144225,0.007445164,0.09489335,0.8619547],"study_design_scores_gemma":[0.000327089,0.0001697735,0.003215794,0.0001941531,0.00003070167,0.000006808755,0.00004967971,0.01534939,0.01708197,0.001438092,0.9615715,0.0005650218],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02316007,0.0002889419,0.9531492,0.02019812,0.000533953,0.001270863,0.0000428249,0.0005153719,0.0008406559],"genre_scores_gemma":[0.8340963,0.000008624785,0.1631114,0.0008139109,0.0003438827,0.001237286,0.00001751151,0.00002479977,0.0003463424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8666782,"threshold_uncertainty_score":0.9999495,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01641815583981085,"gpt":0.2461191942584974,"spread":0.2297010384186866,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00118837,0.0002037144,0.0002305461,0.0002018109,0.001644623,0.0003774211,0.0002742113,0.00004381261,0.000001746445],"category_scores_gemma":[0.00004842042,0.0002343649,0.00005269856,0.0007500417,0.00003460193,0.0000387755,0.0004691606,0.0002154711,0.00000416874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000916186,"about_ca_system_score_gemma":0.00004791982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000782367,"about_ca_topic_score_gemma":0.00002081651,"domain_scores_codex":[0.9979783,0.00006385152,0.0003281059,0.0007546284,0.0004039572,0.0004712],"domain_scores_gemma":[0.9987406,0.0001856819,0.0001217149,0.0005554383,0.0001601425,0.0002364928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004124682,0.0001683198,0.0006009353,0.00009769851,0.0001005441,0.000008786747,0.01372537,0.1690542,0.02970583,0.0352575,0.02147807,0.7297615],"study_design_scores_gemma":[0.000441106,0.0001568084,0.0008843932,0.0000570667,0.00003492936,0.0001375386,0.0006124387,0.5161775,0.0009636984,0.005968056,0.4739724,0.0005940382],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07267235,0.0002070741,0.9030365,0.02206302,0.0002959909,0.001084478,0.000009874715,0.0002734039,0.0003573421],"genre_scores_gemma":[0.953917,0.000003151471,0.04298478,0.001139407,0.0005462696,0.0003235792,0.00001810754,0.00003149723,0.001036188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8812447,"threshold_uncertainty_score":0.9996551,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0514808255914984,"gpt":0.3148267537958876,"spread":0.2633459282043892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009297253,0.0003793339,0.0003857165,0.0001369231,0.0009546188,0.0006136628,0.001301009,0.000192645,0.000004745712],"category_scores_gemma":[0.00008410871,0.000408249,0.00007992795,0.001489,0.00005656085,0.0001280716,0.001230262,0.0002711331,0.00001063599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009051205,"about_ca_system_score_gemma":0.0001590535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003115306,"about_ca_topic_score_gemma":0.00004549943,"domain_scores_codex":[0.9960841,0.0001251758,0.0006534564,0.00159665,0.0006957524,0.0008448806],"domain_scores_gemma":[0.9955327,0.0006825618,0.0002639405,0.002077326,0.0009373052,0.0005061894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001380577,0.0001297569,0.0001536072,0.00002119722,0.00002541314,0.000007110825,0.0001045215,0.8232912,0.00004806407,0.03880728,0.008808916,0.1285891],"study_design_scores_gemma":[0.0003282037,0.00002759057,0.00006546813,0.0001115679,0.00002152913,0.00002394422,0.00003565655,0.7067155,0.00003287398,0.00008897829,0.2922026,0.0003460884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00007817948,0.00002207623,0.9763465,0.003749652,0.0004417772,0.0183025,0.00004869911,0.0003919105,0.0006187149],"genre_scores_gemma":[0.5527657,0.00001420974,0.1692385,0.003345089,0.005649567,0.2587406,0.002347467,0.0002261359,0.007672759],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.807108,"threshold_uncertainty_score":0.9998369,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01999808375652042,"gpt":0.2632308040763798,"spread":0.2432327203198594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009915947,0.0002484944,0.0002925884,0.0003193081,0.0003801398,0.0003629359,0.0003299673,0.00009439357,0.000001998926],"category_scores_gemma":[0.00003303628,0.0002563134,0.00004225504,0.001672079,0.00007477012,0.00008599574,0.0002913708,0.0002340853,0.00008459713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005974318,"about_ca_system_score_gemma":0.00004879304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000478447,"about_ca_topic_score_gemma":0.00002701702,"domain_scores_codex":[0.9976752,0.00006799809,0.0003699242,0.0008320108,0.000476542,0.0005782882],"domain_scores_gemma":[0.9985561,0.0002652468,0.00008266339,0.0006182499,0.0001584416,0.0003193477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008159314,0.0002255914,0.001399891,0.00005152671,0.00002622494,0.00002047294,0.002702642,0.3469987,0.007910285,0.0003419853,0.009354508,0.63096],"study_design_scores_gemma":[0.0004612096,0.0001047899,0.003277624,0.000194684,0.00001462911,0.00001964694,0.0001200024,0.6063814,0.0002615242,0.0005994295,0.3880972,0.0004678974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1908709,0.0004723221,0.7829615,0.02056731,0.0003493952,0.002791604,0.00004816829,0.0012742,0.0006646604],"genre_scores_gemma":[0.9741274,0.0000244087,0.02142641,0.0009651196,0.0005002196,0.0006015294,0.00009176109,0.00004521466,0.002217994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7832565,"threshold_uncertainty_score":0.9999889,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03020005677212293,"gpt":0.2839757314842452,"spread":0.2537756747121223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004028831,0.0005930783,0.000683961,0.0006075444,0.0006710781,0.0009077698,0.004056021,0.000346317,0.000004371955],"category_scores_gemma":[0.0002850882,0.000527574,0.0001326291,0.00499612,0.0001511388,0.0004102937,0.0008602231,0.001001037,0.00007052457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006974749,"about_ca_system_score_gemma":0.0001031651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000397786,"about_ca_topic_score_gemma":0.001057348,"domain_scores_codex":[0.9936894,0.0002102243,0.001066617,0.001467089,0.002233948,0.001332736],"domain_scores_gemma":[0.9945614,0.001106486,0.000325779,0.002286034,0.001231644,0.000488605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006392951,0.0003286031,0.008542703,0.0001324184,0.0001070838,0.00001277164,0.01153345,0.5384221,0.001950576,0.02952676,0.1276204,0.2817591],"study_design_scores_gemma":[0.0003706116,0.0001424954,0.006662777,0.0003242726,0.00005234722,0.00003506196,0.0005193091,0.07133214,0.0001392567,0.001090915,0.9184899,0.0008409387],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04157446,0.001545191,0.8625951,0.08048122,0.003310987,0.006095132,0.00008214585,0.001173766,0.003141966],"genre_scores_gemma":[0.8890957,0.00002240608,0.1045942,0.001224092,0.001529623,0.002448341,0.00005481987,0.00006372045,0.0009670716],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8475212,"threshold_uncertainty_score":0.9997176,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02789617127673743,"gpt":0.2770009616595615,"spread":0.249104790382824,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007995294,0.0001928335,0.0002018773,0.0002988883,0.0003521323,0.0003406962,0.0005485131,0.00007851668,0.000001257976],"category_scores_gemma":[0.00002850183,0.000201082,0.00005478743,0.001942163,0.00002391119,0.0001228084,0.0002149429,0.0003353306,0.00006202835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007999084,"about_ca_system_score_gemma":0.00007452758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002863132,"about_ca_topic_score_gemma":0.0001289355,"domain_scores_codex":[0.9981174,0.00007009332,0.0002620513,0.0006523662,0.00037353,0.000524521],"domain_scores_gemma":[0.9988046,0.000247893,0.00005881679,0.0005177488,0.000143203,0.0002277576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001062582,0.00004855604,0.002070402,0.000007371768,0.00001751635,0.000009285892,0.0004287735,0.8138438,0.0001189113,0.006029522,0.005541039,0.1718742],"study_design_scores_gemma":[0.0002511385,0.00004627307,0.006224235,0.00005917271,0.000009510215,0.00000438832,0.0001235348,0.9553181,0.00001484514,0.0009025742,0.0367404,0.0003058398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03367849,0.0001421084,0.9522324,0.009314768,0.0002451508,0.0009438772,0.000008797489,0.0006867587,0.002747705],"genre_scores_gemma":[0.9953972,0.000009625741,0.001100778,0.0008995527,0.0004503699,0.0007231061,0.00003420395,0.00002108549,0.00136404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9617187,"threshold_uncertainty_score":0.8199888,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01587376005181594,"gpt":0.2503355123815746,"spread":0.2344617523297587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008795023,0.0002387013,0.0002752768,0.0002630553,0.001609706,0.0001149796,0.001023878,0.00008343739,0.000003827094],"category_scores_gemma":[0.00002121335,0.0002537581,0.00006106665,0.001264352,0.00007488939,0.000002880317,0.0004159185,0.0003989936,0.00001252914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007738025,"about_ca_system_score_gemma":0.00008338428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000746077,"about_ca_topic_score_gemma":0.0000139123,"domain_scores_codex":[0.9978303,0.00005997525,0.0003464105,0.0007985272,0.0004424024,0.0005224232],"domain_scores_gemma":[0.998028,0.0003159249,0.0001333059,0.001018581,0.0002952306,0.0002090039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002147623,0.0001383983,0.0002815732,0.00003382662,0.00003102795,0.000001175243,0.0003753443,0.7870774,0.0004026298,0.1177854,0.00738464,0.08646715],"study_design_scores_gemma":[0.0004309148,0.0001233665,0.0001421594,0.00001248566,0.00001841805,0.00003392846,0.00005314652,0.528266,0.0001855541,0.003330414,0.4670992,0.0003043958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3139663,0.000296208,0.6354163,0.04624197,0.0003352874,0.002740474,0.0001286317,0.0006835768,0.0001912637],"genre_scores_gemma":[0.9433863,5.731139e-7,0.04360805,0.001634873,0.0003841657,0.01031596,0.00002028016,0.00002751255,0.000622241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.62942,"threshold_uncertainty_score":0.9999915,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0261180506836522,"gpt":0.3073083967430387,"spread":0.2811903460593865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002014611,0.0007671074,0.0007841074,0.0006661147,0.001312992,0.0007740696,0.001580264,0.0003296135,0.000002978834],"category_scores_gemma":[0.0003115624,0.0008107983,0.000154494,0.002052783,0.0001088222,0.0003121628,0.0005560205,0.00049136,0.0000210941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002831851,"about_ca_system_score_gemma":0.0001399438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002425115,"about_ca_topic_score_gemma":0.0001947296,"domain_scores_codex":[0.9936472,0.00009388925,0.0009793416,0.002222993,0.001510868,0.001545688],"domain_scores_gemma":[0.9950232,0.0004299794,0.0002768926,0.001737959,0.001420141,0.001111863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000233525,0.0008307516,0.003964081,0.00009474254,0.0001416298,0.00003253422,0.01656503,0.3323652,0.003950042,0.01560754,0.01607411,0.6101408],"study_design_scores_gemma":[0.001955985,0.002283816,0.02705882,0.0009940171,0.0003218495,0.0001782397,0.002008882,0.5686857,0.001791063,0.00468662,0.3865922,0.003442848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2789933,0.0001974565,0.6910082,0.02431661,0.0002924413,0.003271735,0.0001056011,0.001111197,0.0007035201],"genre_scores_gemma":[0.7190198,0.000009914671,0.2760643,0.0018217,0.0008118188,0.000725747,0.00008463703,0.00007009774,0.001392007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6066979,"threshold_uncertainty_score":0.9999872,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01854016857283014,"gpt":0.2580505791692078,"spread":0.2395104105963777,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000285133,0.0001348453,0.0001567729,0.0001533108,0.0002130683,0.0001100013,0.00004510313,0.00005935798,9.744664e-7],"category_scores_gemma":[0.00001013007,0.0001479162,0.00001492328,0.0004457861,0.00002088203,0.00004389887,0.00004958688,0.0000811273,0.000004835765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003085222,"about_ca_system_score_gemma":0.000005795193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001025257,"about_ca_topic_score_gemma":0.000008390547,"domain_scores_codex":[0.9991204,0.000007517525,0.0002154911,0.0002884338,0.0001142189,0.0002539896],"domain_scores_gemma":[0.9995503,0.00009644424,0.00002533296,0.0001540359,0.00005182029,0.0001219946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006936042,0.00002232894,0.003203399,0.00008745906,0.00002244722,8.56244e-7,0.002179307,0.8165468,0.0029653,0.001150445,0.008345257,0.1654695],"study_design_scores_gemma":[0.0004193906,0.00004481926,0.01495614,0.0001182635,0.00003016861,0.000007370721,0.0006150362,0.6236792,0.000185374,0.001563216,0.3579921,0.000388937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2703606,0.001068538,0.7231133,0.001811535,0.0001244285,0.002372176,0.00006105976,0.0005021115,0.000586268],"genre_scores_gemma":[0.9854492,0.000171724,0.01170723,0.0000791172,0.0002398417,0.001950476,0.00009890577,0.00004096298,0.0002625293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7150887,"threshold_uncertainty_score":0.6031846,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03303659292115842,"gpt":0.3136769679802031,"spread":0.2806403750590447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006207756,0.0002678933,0.0003150513,0.0005158832,0.0007524413,0.0002034795,0.0009426975,0.0002514776,0.000003996683],"category_scores_gemma":[0.00005110743,0.0002873048,0.00006619612,0.00434597,0.0001317138,0.0001014885,0.0004892829,0.0002683294,0.00003117442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007004548,"about_ca_system_score_gemma":0.00005438678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004891051,"about_ca_topic_score_gemma":0.00003540871,"domain_scores_codex":[0.9977165,0.00005546605,0.0003968537,0.0008647239,0.0002728848,0.0006936004],"domain_scores_gemma":[0.9983914,0.0001134009,0.0001095732,0.0008811023,0.0002664608,0.0002379912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002720786,0.0004759466,0.005433686,0.00004735493,0.0002453083,0.00001592304,0.001983739,0.003705487,0.0231453,0.5330632,0.02136034,0.4104966],"study_design_scores_gemma":[0.0006074597,0.0000309609,0.0008662316,0.00004288201,0.00003549855,0.00003513453,0.0001087927,0.4632274,0.001263507,0.01607524,0.5172002,0.0005066515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02324683,0.0002413318,0.9488235,0.02507891,0.0001649135,0.0007257957,0.00003727892,0.001613978,0.0000674915],"genre_scores_gemma":[0.9153295,0.00005907967,0.08218347,0.0005526382,0.000111739,0.001426799,0.00009906552,0.00003386054,0.0002038678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8920826,"threshold_uncertainty_score":0.9999579,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05670263611936628,"gpt":0.2910093912865058,"spread":0.2343067551671396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008243909,0.0002054231,0.0002164764,0.0001756567,0.0002956868,0.0003686001,0.0006489085,0.00007407375,0.00000344246],"category_scores_gemma":[0.0000454597,0.0001960424,0.00001830132,0.001473307,0.00005022071,0.0002457031,0.0003464596,0.0002965319,0.00003399126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001056431,"about_ca_system_score_gemma":0.0001111412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008375187,"about_ca_topic_score_gemma":0.0003177285,"domain_scores_codex":[0.9983563,0.000121307,0.0003428418,0.0005275444,0.0003227306,0.000329217],"domain_scores_gemma":[0.9980081,0.0001544637,0.00009699703,0.0006948487,0.0006720609,0.0003734986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004802148,0.0001214555,0.00348256,0.000006228358,0.00001673427,0.000003929388,0.002690522,0.09712946,0.00007986461,0.06581122,0.007062527,0.8235475],"study_design_scores_gemma":[0.0004988619,0.0001753692,0.002286733,0.0001566594,0.000011124,0.00001803668,0.0001155221,0.7771422,0.00000972271,0.0003683611,0.2188059,0.0004114462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003872266,0.0005051051,0.9853615,0.007306572,0.0001740558,0.0007072003,0.0000023486,0.0001657121,0.001905219],"genre_scores_gemma":[0.9833843,0.0003077118,0.01339787,0.0009273466,0.0001989019,0.0005309444,0.0000771172,0.00001919098,0.001156659],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.979512,"threshold_uncertainty_score":0.7994377,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02363411094292499,"gpt":0.2832382619596718,"spread":0.2596041510167468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001360803,0.0009899685,0.001031492,0.0007833244,0.001765748,0.0007818866,0.00379841,0.0005708502,0.000009428427],"category_scores_gemma":[0.0002499738,0.001022917,0.0002312089,0.003894565,0.0002339706,0.0005820557,0.00140989,0.0008124575,0.0001431542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002717041,"about_ca_system_score_gemma":0.0001825766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001248838,"about_ca_topic_score_gemma":0.0001760191,"domain_scores_codex":[0.992335,0.00007072638,0.001061982,0.002496099,0.001942118,0.002094091],"domain_scores_gemma":[0.9916683,0.0005530335,0.0003069624,0.003001289,0.002947108,0.001523271],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001302014,0.0002774188,0.001653089,0.00003250591,0.0001538215,0.00002766022,0.004644662,0.2227014,0.0009914744,0.0178133,0.3300624,0.421512],"study_design_scores_gemma":[0.0008258988,0.0006982066,0.002681261,0.00009688344,0.00005970838,0.0001635164,0.0004077945,0.09824942,0.0008121911,0.004164017,0.8901591,0.001682],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0697234,0.0002377437,0.8981573,0.0223059,0.001217633,0.005332658,0.0001362052,0.002153999,0.0007351874],"genre_scores_gemma":[0.8124523,0.00003716256,0.1682975,0.004927434,0.00258771,0.006965839,0.0002991516,0.0001636567,0.004269284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7427289,"threshold_uncertainty_score":0.9995338,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04698504848601006,"gpt":0.2562686452752291,"spread":0.2092835967892191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001147697,0.0001951288,0.0002156923,0.000258919,0.001335231,0.0002894041,0.0007905501,0.00004967686,0.000003161876],"category_scores_gemma":[0.00001675822,0.0002291675,0.00004508603,0.001939934,0.00002598906,0.0001620649,0.0009409106,0.0004398898,0.00001724157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002892289,"about_ca_system_score_gemma":0.00004640916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003139191,"about_ca_topic_score_gemma":0.000007472223,"domain_scores_codex":[0.9978087,0.00006897622,0.0003433971,0.0006370874,0.000489834,0.0006519815],"domain_scores_gemma":[0.9989243,0.000217072,0.00009137663,0.0004860059,0.00007209428,0.0002092012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003793134,0.0002040835,0.04048415,0.00003748752,0.00005141391,0.00001544919,0.008744513,0.6409652,0.0003426404,0.0207251,0.07020548,0.2181866],"study_design_scores_gemma":[0.0002239213,0.00005361086,0.003211797,0.00003562991,0.000006039624,0.00001401872,0.0001422808,0.6257182,0.00001101579,0.001154914,0.3691172,0.0003113828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03220546,0.0002159357,0.953653,0.006770625,0.002516721,0.000615667,0.000001198211,0.0002875236,0.003733866],"genre_scores_gemma":[0.9919577,0.00001035224,0.004470163,0.0009960864,0.001646644,0.0003117011,0.00001426866,0.00002449262,0.0005685778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9597523,"threshold_uncertainty_score":0.9999649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03176326347753247,"gpt":0.2497865763493914,"spread":0.2180233128718589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003332189,0.0001769765,0.0003338373,0.0001821099,0.0003014725,0.0001534059,0.0007975625,0.00005745418,5.356077e-7],"category_scores_gemma":[0.000006008436,0.0001804364,0.0001001931,0.002648941,0.00001661426,0.00008892819,0.0004526858,0.0001368319,0.00001570671],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001805814,"about_ca_system_score_gemma":0.00002535925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003145787,"about_ca_topic_score_gemma":0.000002000118,"domain_scores_codex":[0.9982852,0.00002515792,0.0003515403,0.00060097,0.0003755651,0.0003615766],"domain_scores_gemma":[0.9988157,0.00004604796,0.00009422351,0.000495659,0.0002580923,0.0002902637],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005934103,0.00003815709,0.001802749,0.00006736155,0.0001683491,4.510077e-7,0.006973798,0.9199777,0.00009091308,0.000337581,0.0004819188,0.0700551],"study_design_scores_gemma":[0.00006888781,0.00002747871,0.0001789791,0.00001751316,0.0001115202,0.000002770395,0.00004441369,0.9620036,0.00003074935,0.00006095144,0.03726038,0.0001927127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1293898,0.0001338927,0.8671526,0.001547777,0.0002974581,0.0002851905,0.000001768861,0.0001630573,0.001028453],"genre_scores_gemma":[0.9597245,0.00001064478,0.03716763,0.001002437,0.001900231,0.0000893893,0.00002971688,0.00001478677,0.00006062033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8303347,"threshold_uncertainty_score":0.7357984,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Operating system; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01796095614739446,"gpt":0.2423611912814711,"spread":0.2244002351340766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007923489,0.0002243217,0.0003696374,0.00008099352,0.0003218134,0.0003138299,0.001351747,0.00008092139,0.000002881533],"category_scores_gemma":[0.000005426201,0.0001941499,0.00003873965,0.001265031,0.00002000655,0.0002202434,0.0007181857,0.0001909722,0.00006851594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000388638,"about_ca_system_score_gemma":0.00006781094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008932659,"about_ca_topic_score_gemma":0.00001696495,"domain_scores_codex":[0.997946,0.00003000065,0.0003767035,0.0006694235,0.0004778666,0.0004999618],"domain_scores_gemma":[0.9981218,0.0001296726,0.0001381267,0.0009745487,0.0004012848,0.0002345934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002661319,0.00002916221,0.01475281,0.00005512223,0.00002991529,5.66543e-7,0.0003062413,0.9216489,0.00001200754,0.015769,0.00230714,0.04506259],"study_design_scores_gemma":[0.0003192081,0.0001304989,0.001161433,0.0003803477,0.00001842123,0.00001678927,0.00005089102,0.9466467,0.00001102771,0.0002202286,0.05073338,0.0003110786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03994412,0.0002227307,0.9504145,0.001374899,0.000278932,0.001403338,0.000004140368,0.0002418806,0.006115415],"genre_scores_gemma":[0.9319242,0.00001916941,0.06582399,0.0003547303,0.0006183954,0.0004095927,0.00001191144,0.0000297106,0.0008083617],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8919801,"threshold_uncertainty_score":0.7917204,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}