{"meta":{"query_hash":"a123376d5e9f","filters":{"venue":"Peer-to-Peer Networking and Applications"},"cohort_total":93,"direct_labels_cover":0,"predictions_cover":93,"exported":93,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a123376d5e9f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Peer-to-Peer+Networking+and+Applications"},"results":[{"id":"W1952462664","doi":"10.1007/s12083-015-0380-9","title":"Taking a free ride for routing topology inference in peer-to-peer networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Network topology; Network tomography; Routing (electronic design automation); Routing table; Distributed computing; Topology (electrical circuits); Computer network; Host (biology); Internet topology; Logical topology; The Internet; Peer-to-peer; Synchronization (alternating current); Routing protocol; Static routing; Engineering","score_opus":0.0513139108326722,"score_gpt":0.32470868129179836,"score_spread":0.2733947704591262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952462664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0202553,0.00085113326,0.97368276,0.0013360925,0.0002996666,0.00018420383,0.00007104793,0.0013985565,0.0019211769],"genre_scores_gemma":[0.6012873,0.0006670944,0.39074686,0.00051253935,0.00029445376,0.00024754004,0.00027033975,0.00037275054,0.005601068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414575,0.0023750341,0.0004430959,0.0011273964,0.0015707047,0.00033797548],"domain_scores_gemma":[0.9777076,0.013739032,0.001032085,0.004747095,0.0018611781,0.00091296015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009061599,0.00128948,0.0036589494,0.0022737766,0.004914781,0.0036360906,0.005158008,0.0045319498,0.0042490293],"category_scores_gemma":[0.050911963,0.001459617,0.0015424349,0.001665311,0.0035067997,0.01220401,0.00612929,0.004375003,0.0008607608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009857551,0.00028988847,0.0035974358,0.0005690855,0.0005410159,0.00077322946,0.0014515436,0.5282292,0.0048516383,0.14899386,0.011549942,0.29816747],"study_design_scores_gemma":[0.000046446687,0.00011758506,0.00020518916,0.00003614713,0.0000713267,0.0001496736,0.00015520104,0.9043712,0.0016910778,0.09064259,0.0024628807,0.000050650513],"about_ca_topic_score_codex":0.007801536,"about_ca_topic_score_gemma":0.011327908,"teacher_disagreement_score":0.009061599,"about_ca_system_score_codex":0.0015590294,"about_ca_system_score_gemma":0.0021432636,"threshold_uncertainty_score":0.04792291},"labels":[],"label_agreement":null},{"id":"W1974835369","doi":"10.1007/s12083-009-0031-0","title":"DAg-stream: Distributed video adaptation for overlay streaming to heterogeneous devices","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Adaptation (eye); Metadata; Content adaptation; Overlay network; Distributed computing; Server; Scalability; Computer network; Mobile device; Multimedia; Ubiquitous computing; The Internet; World Wide Web; Operating system","score_opus":0.02397491502197232,"score_gpt":0.2813579684451634,"score_spread":0.2573830534231911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974835369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018987618,0.00042304563,0.89805615,0.00022139301,0.00047864922,0.00035902084,0.0009276191,0.07754573,0.003000727],"genre_scores_gemma":[0.3910135,0.00066077325,0.58414567,0.00032085567,0.0002597494,0.00049436674,0.0044168937,0.004331841,0.014356354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995567,0.0000765399,0.000038438484,0.00009009217,0.00017879398,0.000059422713],"domain_scores_gemma":[0.99912065,0.00023348872,0.00004539354,0.00024442797,0.00021389137,0.00014212557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013086095,0.0010286415,0.0012231242,0.00096248573,0.0005760331,0.0011035332,0.002767759,0.00084326207,0.0049008876],"category_scores_gemma":[0.0031479911,0.00043085395,0.00046141777,0.00087035005,0.000502752,0.0012099423,0.0018478737,0.0011547743,0.001446792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003970334,0.00076902617,0.0032857705,0.0007280654,0.00036997313,0.00073177036,0.00041681458,0.12275996,0.08508792,0.014397585,0.10620481,0.661278],"study_design_scores_gemma":[0.0004950983,0.00019788028,0.0007044988,0.00002009254,0.00007788087,0.00028168506,0.000049040777,0.93277377,0.034048416,0.007630852,0.023661947,0.000058838046],"about_ca_topic_score_codex":0.003749932,"about_ca_topic_score_gemma":0.004457425,"teacher_disagreement_score":0.0049008876,"about_ca_system_score_codex":0.0007042767,"about_ca_system_score_gemma":0.0009097244,"threshold_uncertainty_score":0.016395152},"labels":[],"label_agreement":null},{"id":"W1977012208","doi":"10.1007/s12083-015-0331-5","title":"A reliable QoS-aware routing scheme for neighbor area network in smart grid","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Wireless mesh network; Distributed computing; Routing protocol; Hazy Sighted Link State Routing Protocol; Zone Routing Protocol; Static routing; Link-state routing protocol; Network packet; Wireless network; Wireless; Telecommunications","score_opus":0.02833913441444281,"score_gpt":0.2575506896087158,"score_spread":0.229211555194273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977012208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12579836,0.0023033628,0.8630737,0.00076780113,0.0006784826,0.00017442681,0.00015962645,0.0023539267,0.004690356],"genre_scores_gemma":[0.87469476,0.0006327861,0.12058095,0.0001174812,0.00014094975,0.00007052149,0.00018808243,0.000065748,0.0035087876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995505,0.00010682127,0.000043109427,0.00007633547,0.00018051389,0.000042668387],"domain_scores_gemma":[0.99937916,0.00010981098,0.000063531304,0.00016252414,0.00024049239,0.00004445769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069307553,0.0003719798,0.00073853764,0.0006076127,0.0009364711,0.0006607701,0.0013156239,0.00056079705,0.00082506606],"category_scores_gemma":[0.0012460783,0.00021284899,0.0002829072,0.00053521985,0.0004012679,0.0013790794,0.0009957778,0.0006406622,0.00027486842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001143604,0.00023315397,0.0022141535,0.00040745534,0.00013019187,0.0006638838,0.000620379,0.28888804,0.12390887,0.07480954,0.012920397,0.49406034],"study_design_scores_gemma":[0.000047417132,0.0002793805,0.0004853794,0.000013197849,0.000056522724,0.00032738983,0.00011025402,0.96892536,0.014282246,0.00805886,0.0073536234,0.000060419352],"about_ca_topic_score_codex":0.0022372792,"about_ca_topic_score_gemma":0.0024017538,"teacher_disagreement_score":0.0022372792,"about_ca_system_score_codex":0.000604629,"about_ca_system_score_gemma":0.0005248317,"threshold_uncertainty_score":0.0044484735},"labels":[],"label_agreement":null},{"id":"W1977680444","doi":"10.1007/s12083-012-0136-8","title":"A social network approach to trust management in VANETs","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Voting; Simple (philosophy); Wireless ad hoc network; Scheme (mathematics); Path (computing); Event (particle physics); Computer security; Computer network; Wireless; Algorithm; Telecommunications; Mathematics","score_opus":0.016690978498574028,"score_gpt":0.2533627878151253,"score_spread":0.23667180931655124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977680444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010223206,0.001003288,0.9782592,0.0015061048,0.00023321438,0.00012250018,0.00008909392,0.00013004868,0.008433329],"genre_scores_gemma":[0.7805597,0.0026622652,0.20160644,0.00032283546,0.0007766735,0.00034247283,0.0002263672,0.00009033199,0.01341287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970289,0.0013190502,0.00019394507,0.0004479579,0.00080770534,0.00020246144],"domain_scores_gemma":[0.99666214,0.0019579926,0.00035673223,0.00034080358,0.00045793026,0.00022443678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028230734,0.0007357635,0.0011503214,0.001846757,0.0019095106,0.0036666812,0.0026478437,0.0019454382,0.0023156053],"category_scores_gemma":[0.008195061,0.0005726577,0.0011787692,0.002467228,0.0026580694,0.007382429,0.0030004377,0.0020870464,0.00047988625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079882724,0.00008606523,0.001104255,0.00017325918,0.00014233643,0.00032417718,0.0007718421,0.26014134,0.0011781079,0.6903175,0.003146873,0.042534333],"study_design_scores_gemma":[0.000018392104,0.000060874605,0.00025979965,0.000043481683,0.000057805617,0.0001328901,0.00032059825,0.724251,0.00043082391,0.26490745,0.009477129,0.000039795203],"about_ca_topic_score_codex":0.005820594,"about_ca_topic_score_gemma":0.0050557246,"teacher_disagreement_score":0.005820594,"about_ca_system_score_codex":0.0019291331,"about_ca_system_score_gemma":0.0013774532,"threshold_uncertainty_score":0.01493001},"labels":[],"label_agreement":null},{"id":"W1978322408","doi":"10.1007/s12083-010-0083-1","title":"Optimizing BitTorrent-like peer-to-peer systems in the presence of network address translation devices","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Southeast University; British Columbia Knowledge Development Fund; University of Victoria","keywords":"BitTorrent; Computer science; Network address translation; Computer network; The Internet; NAT traversal; Peer-to-peer; Distributed computing; File sharing; Cover (algebra); World Wide Web; Internet Protocol","score_opus":0.03020005677212293,"score_gpt":0.2839757314842452,"score_spread":0.25377567471212226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978322408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911754,0.0011078069,0.393721,0.00085529574,0.0001918512,0.00035180085,0.00018260485,0.0035583342,0.008855933],"genre_scores_gemma":[0.94813156,0.00015098708,0.04965425,0.000055150533,0.000029806688,0.00006089989,0.000111404275,0.00012580828,0.0016801591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984201,0.000631149,0.00009471783,0.00023397544,0.0003888958,0.00023120853],"domain_scores_gemma":[0.9943316,0.003298204,0.00034000308,0.00048034787,0.0012345751,0.00031537467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021741302,0.0010605166,0.0019021445,0.00047403298,0.0012844469,0.001667099,0.002139401,0.00135493,0.0019201457],"category_scores_gemma":[0.008682259,0.0006126054,0.00026375006,0.0007800474,0.0007235831,0.0029448392,0.0013347905,0.0007620989,0.0005608762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006146436,0.00022301481,0.0010715195,0.00012400717,0.000051312774,0.00015712585,0.00010590864,0.93682164,0.015302206,0.005170988,0.0025958808,0.037761707],"study_design_scores_gemma":[0.000023468581,0.000064657535,0.000107929845,0.0000016989417,0.0000119955785,0.000031076946,0.00003407843,0.99523383,0.002743495,0.0015560116,0.0001844219,0.0000073074857],"about_ca_topic_score_codex":0.003454101,"about_ca_topic_score_gemma":0.0058725467,"teacher_disagreement_score":0.003454101,"about_ca_system_score_codex":0.0012612598,"about_ca_system_score_gemma":0.0015685658,"threshold_uncertainty_score":0.011498034},"labels":[],"label_agreement":null},{"id":"W1979833825","doi":"10.1007/s12083-011-0109-3","title":"Towards an effective integration of cellular users to the structured Peer-to-Peer network","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Chord (peer-to-peer); Computer network; Computer science; Upload; Cellular network; Base station; The Internet; Peer-to-peer; Distributed computing; Network topology; World Wide Web","score_opus":0.018456046687856296,"score_gpt":0.27691235525684055,"score_spread":0.25845630856898427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979833825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05027742,0.00054954685,0.9381127,0.00062819006,0.00015225151,0.0002895358,0.000025887286,0.0010065155,0.008958074],"genre_scores_gemma":[0.5578301,0.0008989476,0.42812502,0.0003726455,0.0002715257,0.00031973902,0.00013937539,0.00016114829,0.011881456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980659,0.00074221665,0.000073439485,0.00025410537,0.0007064577,0.00015788658],"domain_scores_gemma":[0.99737597,0.0006040434,0.000113021364,0.00069892796,0.00096033985,0.00024761964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017337434,0.0004567489,0.0007551361,0.000444938,0.0009110394,0.0024876653,0.0018077458,0.0014616102,0.0021762673],"category_scores_gemma":[0.0051421085,0.00036861934,0.00032449525,0.0005730625,0.00095796183,0.0032327273,0.0037919022,0.0012722561,0.0014188827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008920678,0.0010610186,0.0044816355,0.00051650614,0.00019265908,0.0010196108,0.002257179,0.103837416,0.11266485,0.23425475,0.011719066,0.52710325],"study_design_scores_gemma":[0.0001218658,0.00086727424,0.001018576,0.0001048596,0.00014603353,0.00062322884,0.0010434139,0.79009134,0.025102858,0.118208215,0.06260522,0.00006716105],"about_ca_topic_score_codex":0.0010398469,"about_ca_topic_score_gemma":0.0011491866,"teacher_disagreement_score":0.0024876653,"about_ca_system_score_codex":0.00045018038,"about_ca_system_score_gemma":0.0013079335,"threshold_uncertainty_score":0.009169042},"labels":[],"label_agreement":null},{"id":"W1990417591","doi":"10.1007/s12083-015-0345-z","title":"Energy-efficient routing over coordinated sleep scheduling in wireless ad hoc networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Distributed computing; Wireless Routing Protocol; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Routing protocol; Routing (electronic design automation)","score_opus":0.017357168115842543,"score_gpt":0.25704727503097685,"score_spread":0.23969010691513432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990417591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15560903,0.0040483163,0.8335369,0.0006176028,0.0003889103,0.00006808425,0.00009097309,0.0006597992,0.0049802978],"genre_scores_gemma":[0.9734623,0.0005836132,0.024286432,0.000046062534,0.00009435559,0.000025135407,0.000040878556,0.00004155542,0.0014195351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961036,0.00013456254,0.000022167795,0.00005523099,0.000105317,0.00007237544],"domain_scores_gemma":[0.9990056,0.0005678051,0.000112373265,0.000093060546,0.00016204342,0.000059055033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009690569,0.00041493037,0.0006836411,0.000609226,0.00061502267,0.0009101645,0.0008801713,0.00036961376,0.00068432395],"category_scores_gemma":[0.0021325417,0.00031309784,0.00021974587,0.0007645214,0.00048301107,0.0009260851,0.0006136874,0.00035826516,0.00011490576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046358342,0.00012567425,0.001263891,0.00014281111,0.00009327274,0.0001275819,0.0001535826,0.8245718,0.014132713,0.02979984,0.0033326577,0.1257926],"study_design_scores_gemma":[0.000020769176,0.00008171964,0.00035725377,0.0000061365936,0.000025811396,0.000042685213,0.000044240693,0.9878889,0.0015494779,0.009139527,0.0008345166,0.000009037783],"about_ca_topic_score_codex":0.0022227417,"about_ca_topic_score_gemma":0.0050793863,"teacher_disagreement_score":0.0022227417,"about_ca_system_score_codex":0.00063432223,"about_ca_system_score_gemma":0.0009414752,"threshold_uncertainty_score":0.0051249266},"labels":[],"label_agreement":null},{"id":"W1991277203","doi":"10.1007/s12083-009-0032-z","title":"Improving robustness of P2P applications in mobile environments","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Redundancy (engineering); Distributed computing; Robustness (evolution); Exploit; Computer network; Computer security; Operating system","score_opus":0.011373719621234525,"score_gpt":0.2512774903335184,"score_spread":0.23990377071228391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991277203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40104753,0.00346901,0.57771975,0.0011974117,0.00041490528,0.00017562893,0.0002728542,0.00810607,0.007596952],"genre_scores_gemma":[0.97814137,0.00038687928,0.019796794,0.00009042687,0.00012847422,0.000034244807,0.0001451369,0.0002506514,0.0010260215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776995,0.0005585951,0.00014831946,0.00033687256,0.000881118,0.0003051391],"domain_scores_gemma":[0.9871349,0.0076948768,0.0008008967,0.0021991706,0.0018414749,0.00032866822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018466603,0.001317075,0.00095811195,0.0010804604,0.00090828846,0.0016504326,0.0014988867,0.0019700853,0.0023644408],"category_scores_gemma":[0.019336576,0.00048629806,0.00045737388,0.00069436996,0.00077661965,0.0029735127,0.0016577952,0.0012641612,0.0008764751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024552802,0.00036297264,0.0050658467,0.00052115804,0.00022729904,0.0010129351,0.00036207377,0.5296194,0.2612076,0.0073513924,0.004539376,0.18727462],"study_design_scores_gemma":[0.000053917418,0.0004110283,0.0016747834,0.00002032891,0.0001065427,0.00030802205,0.00010913182,0.9197415,0.07052716,0.005304568,0.0017051994,0.0000378466],"about_ca_topic_score_codex":0.0017109914,"about_ca_topic_score_gemma":0.0007034433,"teacher_disagreement_score":0.0023644408,"about_ca_system_score_codex":0.0006919242,"about_ca_system_score_gemma":0.0005021306,"threshold_uncertainty_score":0.009766161},"labels":[],"label_agreement":null},{"id":"W1991501433","doi":"10.1007/s12083-013-0237-z","title":"PPNA special issue on “the green, reliability and security of machine-to-machine communications”","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Machine to machine; Wireless sensor network; Wireless; Smart grid; Computer security; Reliability (semiconductor); Wireless network; Software deployment; Personal Communications Service; Telecommunications; Computer network; Engineering; Wi-Fi array; Internet of Things","score_opus":0.010088788947383662,"score_gpt":0.2351475465266761,"score_spread":0.22505875757929245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991501433","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083125976,0.021647822,0.0052009984,0.02553995,0.8318238,0.00019814388,0.00045279783,0.000374733,0.11393051],"genre_scores_gemma":[0.0064990097,0.03027904,0.0023947267,0.009560399,0.58156836,0.00019998838,0.0012694073,0.00042117856,0.36780787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980552,0.00020809844,0.00013133982,0.00030076172,0.00107721,0.00022736531],"domain_scores_gemma":[0.9940289,0.00093668135,0.0003331569,0.00042844255,0.003222042,0.0010507059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022171892,0.0015565805,0.0018438104,0.0029320342,0.0021538772,0.005152816,0.0021739823,0.0040789517,0.07037226],"category_scores_gemma":[0.004295968,0.00050600804,0.0011882716,0.0018153025,0.0010138917,0.0037911332,0.0022614498,0.0033959555,0.033095498],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055834673,0.0000440995,0.00012090785,0.0002937513,0.000014682566,0.00008602102,0.000013497631,0.00017900967,0.00072755164,0.0030139945,0.95289737,0.042553302],"study_design_scores_gemma":[0.000006592823,0.000051857016,0.00037543825,0.00012381867,0.0000130398175,0.00011719764,0.000016540374,0.00033386183,0.0003356032,0.001932891,0.9966833,0.00000986227],"about_ca_topic_score_codex":0.0018745174,"about_ca_topic_score_gemma":0.0048210546,"teacher_disagreement_score":0.07037226,"about_ca_system_score_codex":0.0017786454,"about_ca_system_score_gemma":0.003060475,"threshold_uncertainty_score":0.23541862},"labels":[],"label_agreement":null},{"id":"W2000206219","doi":"10.1007/s12083-012-0147-5","title":"Classifying peer-to-peer applications using imbalanced concept-adapting very fast decision tree on IP data stream","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Decision tree; Data stream; Concept drift; Data mining; Class (philosophy); Resampling; Data stream mining; Peer-to-peer; Streaming data; Machine learning; Tree (set theory); The Internet; Artificial intelligence; Computer network; World Wide Web","score_opus":0.05581329026549677,"score_gpt":0.31974182587593625,"score_spread":0.2639285356104395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000206219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37853605,0.0009832591,0.6169099,0.00048592436,0.000279156,0.00025728907,0.0004582677,0.001331559,0.00075857656],"genre_scores_gemma":[0.8975888,0.00018601146,0.100430295,0.00009164239,0.00014229253,0.00011294761,0.0007832099,0.000047282636,0.0006175431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828595,0.000443087,0.0001701518,0.00035746183,0.00055200944,0.00019124988],"domain_scores_gemma":[0.9934495,0.004248221,0.00030014938,0.00030569124,0.0014343846,0.00026204422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00384321,0.00092245045,0.0020505064,0.0026372946,0.00082588656,0.0010717221,0.0018555844,0.001268988,0.0005015279],"category_scores_gemma":[0.0064891605,0.00028502973,0.0007447454,0.0018023794,0.00042557777,0.001970692,0.0010075124,0.001442989,0.00019608652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013101259,0.0010682747,0.016642828,0.00018265756,0.00024353726,0.00022349002,0.00016412417,0.5132336,0.008541839,0.0028862793,0.004549929,0.45095336],"study_design_scores_gemma":[0.0000056817594,0.000030512474,0.00034105676,0.0000013511574,0.00000800553,0.000010062695,0.000008586084,0.9984756,0.000485456,0.0005650769,0.000065912485,0.000002744081],"about_ca_topic_score_codex":0.0042433254,"about_ca_topic_score_gemma":0.0033689784,"teacher_disagreement_score":0.0042433254,"about_ca_system_score_codex":0.0010347457,"about_ca_system_score_gemma":0.0011365354,"threshold_uncertainty_score":0.020325065},"labels":[],"label_agreement":null},{"id":"W2003261281","doi":"10.1007/s12083-013-0223-5","title":"Peer startup process and initial offset placement in peer-to-peer (P2P) live streaming systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Offset (computer science); Computer science; Joins; Buffer (optical fiber); Peer-to-peer; Computer network; Scheme (mathematics); Real-time computing; Distributed computing; Operating system; Telecommunications; Mathematics","score_opus":0.0196219231650188,"score_gpt":0.28327910681683477,"score_spread":0.26365718365181595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003261281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1077601,0.0009281607,0.883386,0.0002977915,0.00019398502,0.0004457672,0.0001454117,0.002109801,0.0047329306],"genre_scores_gemma":[0.8808842,0.00040568918,0.111991085,0.00005820445,0.00010981195,0.00014671455,0.00019008212,0.0002266263,0.0059875553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977597,0.0003972793,0.00014882248,0.0004486346,0.0009490423,0.00029647112],"domain_scores_gemma":[0.9941796,0.0028158866,0.0004407332,0.00089845364,0.0011989366,0.00046646915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002409573,0.0007177424,0.0014629541,0.00084044837,0.0018213487,0.0022308498,0.0019577353,0.0012981471,0.0028145274],"category_scores_gemma":[0.012251685,0.00067534996,0.00029240779,0.00093538983,0.0010133894,0.003127898,0.0020347463,0.0016031106,0.00081507815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003908359,0.0011644622,0.010886252,0.00046985323,0.00010836594,0.0016459294,0.0020856285,0.29942757,0.083812,0.10043145,0.007737584,0.48832256],"study_design_scores_gemma":[0.00015484133,0.00048368794,0.0026937765,0.000036353656,0.00007759004,0.0005567698,0.00047696714,0.9208531,0.04399112,0.02531829,0.0052521285,0.00010532267],"about_ca_topic_score_codex":0.0043293186,"about_ca_topic_score_gemma":0.004785374,"teacher_disagreement_score":0.0043293186,"about_ca_system_score_codex":0.0009876776,"about_ca_system_score_gemma":0.0023857527,"threshold_uncertainty_score":0.012743235},"labels":[],"label_agreement":null},{"id":"W2005930142","doi":"10.1007/s12083-008-0025-3","title":"XCube: Processing XPath queries in a hypercube overlay network","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bit array; Information retrieval; XPath; Identifier; XML; Node (physics); Matching (statistics); Data mining; Database; XML database; World Wide Web; Computer network","score_opus":0.013718367285484636,"score_gpt":0.26826220524935623,"score_spread":0.2545438379638716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005930142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20287286,0.0010370163,0.65364623,0.00070282497,0.00034670447,0.00078577205,0.0031269493,0.118764065,0.018717637],"genre_scores_gemma":[0.47786406,0.00095197745,0.47531408,0.00028002475,0.00011082605,0.00047818423,0.009879581,0.004229165,0.030892039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993352,0.00009508705,0.000046807792,0.00009764629,0.00034917562,0.000076005825],"domain_scores_gemma":[0.9991037,0.00031596422,0.00004299353,0.00020111336,0.00024216094,0.0000940587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085466646,0.00075767486,0.00088362786,0.0010113906,0.00086386956,0.0014588604,0.0019322516,0.0007056729,0.009110641],"category_scores_gemma":[0.001985699,0.0004859123,0.0003352395,0.0012549021,0.0005756445,0.0022796255,0.0018449867,0.0007170957,0.0015696954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005460155,0.0006138353,0.008421117,0.0011872988,0.0003817869,0.0019107688,0.0016690341,0.064587146,0.12614386,0.020131882,0.11853711,0.6509561],"study_design_scores_gemma":[0.00047062844,0.00046664677,0.002783988,0.000054288652,0.00009411995,0.000673427,0.0008829087,0.83714104,0.105346456,0.009535582,0.042463474,0.00008742992],"about_ca_topic_score_codex":0.0094708195,"about_ca_topic_score_gemma":0.011930632,"teacher_disagreement_score":0.0094708195,"about_ca_system_score_codex":0.0006764328,"about_ca_system_score_gemma":0.0008596527,"threshold_uncertainty_score":0.03047812},"labels":[],"label_agreement":null},{"id":"W2009354338","doi":"10.1007/s12083-012-0168-0","title":"On the collaboration of different peer-to-peer traffic management schemas","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; BitTorrent; Scalability; Distributed computing; Computer network; Cache; Heuristic; Peer-to-peer; The Internet; Implementation; Internet traffic; World Wide Web","score_opus":0.020068551019963063,"score_gpt":0.25848583289943694,"score_spread":0.23841728187947386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009354338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045627367,0.00081625575,0.9429917,0.00072143425,0.00011904987,0.0003198362,0.0000725241,0.0007872053,0.00854458],"genre_scores_gemma":[0.5301725,0.0016723236,0.46186626,0.000289433,0.0001920706,0.00035361314,0.00040367697,0.00043105037,0.004618973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913858,0.0041779913,0.0005457069,0.00082210905,0.0025633092,0.00050522364],"domain_scores_gemma":[0.9686584,0.01926017,0.00081406435,0.00642889,0.00414534,0.0006931193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014215682,0.0007254242,0.0019550351,0.0016968014,0.002005175,0.005631248,0.0035635957,0.0025250895,0.0023313996],"category_scores_gemma":[0.039786905,0.0008490851,0.0008665621,0.002242914,0.0024574285,0.0095358165,0.0036947972,0.0020673226,0.0007085395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008725984,0.00041214874,0.0030971367,0.0003202154,0.00023167575,0.0004125414,0.0017745394,0.22553635,0.018565068,0.6192712,0.0042535746,0.12525293],"study_design_scores_gemma":[0.00007859822,0.00016547475,0.00042871878,0.00005975241,0.00010875057,0.00019970004,0.00028076262,0.82738304,0.008590655,0.15539733,0.0072497386,0.00005755707],"about_ca_topic_score_codex":0.0023044255,"about_ca_topic_score_gemma":0.0019815455,"teacher_disagreement_score":0.014215682,"about_ca_system_score_codex":0.001732289,"about_ca_system_score_gemma":0.002281521,"threshold_uncertainty_score":0.07518059},"labels":[],"label_agreement":null},{"id":"W2023093146","doi":"10.1007/s12083-014-0258-2","title":"A taxonomy of decentralized online social networks","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decentralization; Autonomy; Computer science; Architecture; Taxonomy (biology); Peer-to-peer; Cloud computing; Set (abstract data type); Control (management); Internet privacy; World Wide Web; Data science; Political science; Artificial intelligence","score_opus":0.027402669239488205,"score_gpt":0.27056741082156727,"score_spread":0.24316474158207907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023093146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04752061,0.013162806,0.78621656,0.005723,0.00044611655,0.0011876399,0.0015923965,0.0011337955,0.1430171],"genre_scores_gemma":[0.5272578,0.02357205,0.40334982,0.0008354905,0.00088897307,0.0023591095,0.0027718667,0.00017608491,0.038788907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963128,0.0010934467,0.00037625805,0.00060103735,0.0012965938,0.00031982435],"domain_scores_gemma":[0.99493563,0.002035836,0.0006749984,0.0009642239,0.00086518476,0.0005240904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020094125,0.0007082384,0.001105711,0.004804654,0.0036890374,0.007352495,0.0020914506,0.0028990915,0.004690888],"category_scores_gemma":[0.0068674264,0.0007342936,0.0009194967,0.007881727,0.003006592,0.010657769,0.003155683,0.00192983,0.0010526954],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008727475,0.000025622086,0.000647716,0.0001205809,0.000007929695,0.00011732598,0.000492568,0.0025951483,0.00020569959,0.97617763,0.002317547,0.01728351],"study_design_scores_gemma":[0.000020248512,0.00004357155,0.0008624181,0.0001590471,0.00001882156,0.0006062886,0.0006277128,0.038322337,0.00024313245,0.8412056,0.11786569,0.000025022133],"about_ca_topic_score_codex":0.0035231223,"about_ca_topic_score_gemma":0.0025553228,"teacher_disagreement_score":0.007352495,"about_ca_system_score_codex":0.0029355842,"about_ca_system_score_gemma":0.0025971124,"threshold_uncertainty_score":0.021299303},"labels":[],"label_agreement":null},{"id":"W2024118014","doi":"10.1007/s12083-008-0022-6","title":"Exploiting unlabeled data to improve peer-to-peer traffic classification using incremental tri-training method","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Traffic classification; Heuristic; Network packet; Peer-to-peer; The Internet; Data mining; Machine learning; Internet traffic; Labeled data; Artificial intelligence; Data stream; Layer (electronics); Distributed computing; Computer network; World Wide Web","score_opus":0.10768934204858785,"score_gpt":0.3536290759107938,"score_spread":0.24593973386220594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024118014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07082099,0.000384543,0.92230153,0.00022957272,0.00020584516,0.00015411562,0.00018967812,0.004089215,0.00162459],"genre_scores_gemma":[0.65665,0.00017077237,0.3376891,0.00024665115,0.0002493571,0.00024963642,0.0014351116,0.00024488787,0.003064493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984586,0.00043021434,0.000116654155,0.00041099582,0.0003940481,0.00018941684],"domain_scores_gemma":[0.9949269,0.0022605406,0.00025221304,0.00086050085,0.0014969286,0.00020285978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025130084,0.0011626651,0.0024681874,0.0019233192,0.0013477756,0.00092798646,0.0036395625,0.0021424233,0.0018121368],"category_scores_gemma":[0.006222354,0.00055527827,0.00094245706,0.001782046,0.00064328173,0.0028426382,0.0012133261,0.0019298879,0.0011011709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061999547,0.0012060348,0.0065085297,0.00018315073,0.0002604932,0.00018390895,0.00018496465,0.24367161,0.016297698,0.0034599558,0.009009233,0.71841437],"study_design_scores_gemma":[0.000006622178,0.000023939618,0.00013648966,0.000002213051,0.000014344134,0.000016918582,0.000008848718,0.9973036,0.0016473447,0.0006280302,0.00020765615,0.0000039448023],"about_ca_topic_score_codex":0.0061275824,"about_ca_topic_score_gemma":0.008283952,"teacher_disagreement_score":0.0061275824,"about_ca_system_score_codex":0.00055902876,"about_ca_system_score_gemma":0.0012609661,"threshold_uncertainty_score":0.013290226},"labels":[],"label_agreement":null},{"id":"W2028009605","doi":"10.1007/s12083-014-0292-0","title":"MuDA: Multifunctional data aggregation in privacy-preserving smart grid communications","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Smart grid; Data aggregator; Differential privacy; Computer science; Overhead (engineering); Scheme (mathematics); Information privacy; Computer security; Computer network; Data mining; Engineering; Wireless sensor network","score_opus":0.06295727494621317,"score_gpt":0.3119676628443532,"score_spread":0.24901038789814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028009605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034295958,0.0009546805,0.95004904,0.0007190585,0.00026342092,0.0001550558,0.00028346048,0.00559489,0.0076844473],"genre_scores_gemma":[0.8437254,0.00034639938,0.14929894,0.00031151678,0.00015353564,0.00012207389,0.00028241036,0.00014915213,0.005610552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906605,0.0002884974,0.00006426471,0.00018096647,0.00027416376,0.00012604757],"domain_scores_gemma":[0.998667,0.0003212586,0.00011247722,0.00065896986,0.00016691649,0.00007336629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348585,0.0005282218,0.0010711501,0.0006315727,0.0012071277,0.0018033354,0.0012820172,0.0007714689,0.0027930122],"category_scores_gemma":[0.0024685161,0.00031228547,0.00040336268,0.0011037808,0.00079391524,0.0021707325,0.0028408314,0.0011282116,0.0008166638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002068215,0.00030420307,0.003121616,0.00060715794,0.0002295526,0.0011163355,0.0008484837,0.1163036,0.07998638,0.23243973,0.035504997,0.5274698],"study_design_scores_gemma":[0.0000708487,0.0002756721,0.00078245875,0.0000457602,0.00007531016,0.00082734245,0.00018561624,0.8279942,0.047702875,0.08557952,0.036406863,0.00005353809],"about_ca_topic_score_codex":0.0004632026,"about_ca_topic_score_gemma":0.00062908075,"teacher_disagreement_score":0.0027930122,"about_ca_system_score_codex":0.00053714094,"about_ca_system_score_gemma":0.00068769744,"threshold_uncertainty_score":0.0093435645},"labels":[],"label_agreement":null},{"id":"W2036147040","doi":"10.1007/s12083-009-0054-6","title":"Popularity-aware prefetch in P2P range caching","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instruction prefetch; Computer science; Popularity; Range query (database); Query optimization; Range (aeronautics); Query expansion; Database; Information retrieval; Web search query; Web query classification; Distributed computing; Computer network; Search engine; Cache","score_opus":0.019190802447744515,"score_gpt":0.26918965072567247,"score_spread":0.24999884827792795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036147040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3435842,0.006645381,0.6353338,0.0013339052,0.0004125237,0.00019712232,0.0003657411,0.002600466,0.0095268395],"genre_scores_gemma":[0.9631826,0.0005363001,0.033250075,0.000061995284,0.00012834626,0.00004488224,0.00010942739,0.000070582275,0.0026156881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990676,0.00025683743,0.00005061743,0.000110765475,0.0003825243,0.00013169278],"domain_scores_gemma":[0.99637574,0.0021603473,0.00016733527,0.00050132,0.0006624177,0.00013277387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011983983,0.00040586694,0.0011822325,0.00090691523,0.0013732635,0.0011843899,0.0014655279,0.0009992989,0.0015005177],"category_scores_gemma":[0.0068066516,0.00061279227,0.00022184345,0.0020029948,0.00065075234,0.002400857,0.000932178,0.0007008688,0.00025702262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023996858,0.00048208243,0.01536617,0.00045485215,0.00014935229,0.0012135695,0.00061356666,0.56056815,0.033629168,0.08412652,0.019951358,0.2810454],"study_design_scores_gemma":[0.000034050412,0.00004962941,0.0005701645,0.000006524406,0.000026061933,0.00014484163,0.000058028025,0.9872794,0.0033542516,0.0076298523,0.00083175395,0.00001535437],"about_ca_topic_score_codex":0.0073621585,"about_ca_topic_score_gemma":0.015381126,"teacher_disagreement_score":0.0073621585,"about_ca_system_score_codex":0.0011666697,"about_ca_system_score_gemma":0.0011442058,"threshold_uncertainty_score":0.014638603},"labels":[],"label_agreement":null},{"id":"W2037186450","doi":"10.1007/s12083-009-0040-z","title":"Editorial: Special issue on mobile P2P networking and computing","year":2009,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Server; Distributed computing; Mobile computing; Multicast; Scalability; Overlay network; Shared resource; The Internet; World Wide Web; Operating system","score_opus":0.008716586641333486,"score_gpt":0.2768795556822618,"score_spread":0.2681629690409283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037186450","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044112985,0.0031968553,0.00014375996,0.011110339,0.9837736,0.000020493499,0.000037546648,0.000053820855,0.0016194211],"genre_scores_gemma":[0.0005780993,0.0033155067,0.00015966741,0.007251401,0.9733041,0.000025899346,0.000049845607,0.000048180475,0.015267339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962554,0.00042713215,0.00039457332,0.0005034834,0.0020669706,0.00035247914],"domain_scores_gemma":[0.9879986,0.0029159344,0.0010629781,0.00035012455,0.0052417764,0.002430608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004639705,0.0048912205,0.00533562,0.0042282175,0.0028395902,0.0077005825,0.0030555222,0.012873251,0.022635803],"category_scores_gemma":[0.01216786,0.0013272561,0.0029946421,0.001773925,0.0019266604,0.0032357739,0.0015561277,0.0131560685,0.01670913],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051878338,0.000018240733,0.000025291225,0.00016320829,0.000023367258,0.0001548838,0.0000044432645,0.00003413529,0.00010349247,0.00015801408,0.9933943,0.0058686887],"study_design_scores_gemma":[0.00009917164,0.00005340147,0.0003905404,0.00021100015,0.00008337093,0.00036193975,0.000023990451,0.0002888153,0.00023429496,0.0007380371,0.99749595,0.000019538802],"about_ca_topic_score_codex":0.000915841,"about_ca_topic_score_gemma":0.0032764252,"teacher_disagreement_score":0.022635803,"about_ca_system_score_codex":0.0021844723,"about_ca_system_score_gemma":0.0019263643,"threshold_uncertainty_score":0.075724244},"labels":[],"label_agreement":null},{"id":"W2037491203","doi":"10.1007/s12083-010-0076-0","title":"Measurement and enhancement of BitTorrent-based video file swarming","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"BitTorrent; Computer science; Swarm behaviour; BitTorrent tracker; Upload; File sharing; The Internet; Computer network; Peer-to-peer; World Wide Web; Artificial intelligence","score_opus":0.019606248683532314,"score_gpt":0.2570765666461239,"score_spread":0.23747031796259158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037491203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98386866,0.00015239252,0.01449037,0.00003927332,0.000028405972,0.000047589838,0.00013210817,0.00032005552,0.0009211373],"genre_scores_gemma":[0.99523854,0.00004290394,0.0044266977,0.0000069426865,0.000007418783,0.000013423307,0.00009601283,0.000010549366,0.00015743691],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897647,0.00018096475,0.000051521165,0.00017043763,0.00054219854,0.00007834252],"domain_scores_gemma":[0.99703777,0.00079978374,0.00022033753,0.0003639269,0.0013654056,0.00021273238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009193417,0.00030468212,0.00054724136,0.0010601332,0.00039651754,0.0004945233,0.00063565274,0.0005927605,0.0002984392],"category_scores_gemma":[0.0036283883,0.00018914124,0.00015723403,0.0007679189,0.00037008923,0.0009975049,0.00046785598,0.0004104352,0.00011936478],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015873577,0.000783579,0.06602578,0.00024933377,0.00012057153,0.00033584944,0.0005578692,0.046055105,0.7860922,0.0010510226,0.0007821146,0.096359156],"study_design_scores_gemma":[0.000044025397,0.0011475515,0.08510832,0.000013360515,0.00008290106,0.0006600979,0.00023565366,0.580329,0.3310547,0.0002813752,0.0009850872,0.00005787813],"about_ca_topic_score_codex":0.002055886,"about_ca_topic_score_gemma":0.0015315127,"teacher_disagreement_score":0.002055886,"about_ca_system_score_codex":0.00053935085,"about_ca_system_score_gemma":0.00025955017,"threshold_uncertainty_score":0.0048620105},"labels":[],"label_agreement":null},{"id":"W2039305010","doi":"10.1007/s12083-010-0077-z","title":"Sparse structures for searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Flooding (psychology); Scalability; Broadcasting (networking); Gossip; Network topology; Computer network; Graph; Theoretical computer science; Distributed computing; Algorithm","score_opus":0.025124280857080246,"score_gpt":0.2963310891151496,"score_spread":0.27120680825806937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039305010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03765664,0.0014389281,0.9533011,0.0020181073,0.00016813293,0.0001317157,0.00023126506,0.0004486137,0.004605586],"genre_scores_gemma":[0.5968472,0.003972569,0.38306415,0.00065711275,0.0010262963,0.0007526955,0.0011908566,0.00035675633,0.012132451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807787,0.0006639706,0.00011837373,0.00024908918,0.00071780017,0.00017282329],"domain_scores_gemma":[0.97924507,0.016689615,0.0011425354,0.0011908258,0.0012931784,0.0004387926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021477614,0.0008735121,0.0018374335,0.0030427696,0.001727199,0.002656836,0.002928629,0.0023576173,0.004024037],"category_scores_gemma":[0.030762212,0.00091654906,0.0009216457,0.0044186763,0.0026527203,0.006677374,0.0025046912,0.003377054,0.0005440517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017456985,0.00012494723,0.00069223874,0.0003082527,0.000051126957,0.00008415715,0.00033326438,0.27870977,0.0013237109,0.6561434,0.0071674353,0.054887135],"study_design_scores_gemma":[0.000033913955,0.000027702476,0.00012248881,0.000016764146,0.000015535012,0.0000378265,0.00004597713,0.5537715,0.00030368892,0.44426122,0.0013502223,0.000013113869],"about_ca_topic_score_codex":0.0037420096,"about_ca_topic_score_gemma":0.005025449,"teacher_disagreement_score":0.004024037,"about_ca_system_score_codex":0.002361227,"about_ca_system_score_gemma":0.0016175538,"threshold_uncertainty_score":0.017131925},"labels":[],"label_agreement":null},{"id":"W2041088506","doi":"10.1007/s12083-008-0010-x","title":"SUPNET: An end-to-end solution to scalable unstructured P2P networking","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scalability; Computer science; Distributed computing; Protocol (science); Network topology; Computer network; Network dynamics; Network management; End-to-end principle","score_opus":0.02725076734480817,"score_gpt":0.2660315590182152,"score_spread":0.23878079167340702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041088506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023048136,0.0006250323,0.927143,0.0011597628,0.0009768943,0.000550046,0.0010791802,0.028013848,0.01740415],"genre_scores_gemma":[0.34914413,0.0011423036,0.60175925,0.0013460434,0.0006432368,0.0005667911,0.0075437673,0.0015051578,0.036349233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935573,0.000106617896,0.000053508382,0.00009123731,0.00032509692,0.000067856214],"domain_scores_gemma":[0.9988927,0.00021333905,0.00005372852,0.0002951686,0.00039492198,0.00015015215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012307703,0.00093342457,0.00082352816,0.0008257688,0.0007784706,0.0017070635,0.0021774324,0.0009457191,0.0059533603],"category_scores_gemma":[0.0023195138,0.00042372942,0.00032721378,0.00083428225,0.0005011095,0.0022039623,0.0021682386,0.001222114,0.0023915751],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023746248,0.00086356944,0.0032011336,0.0009152751,0.00022979584,0.0010225199,0.00046772376,0.050487272,0.07803886,0.07956969,0.20078187,0.58204764],"study_design_scores_gemma":[0.00029174978,0.00053039845,0.00091194594,0.00007160578,0.000114091614,0.00061944907,0.00018125688,0.7835819,0.043105736,0.052302532,0.11820145,0.000087821376],"about_ca_topic_score_codex":0.0010758861,"about_ca_topic_score_gemma":0.0018235589,"teacher_disagreement_score":0.0059533603,"about_ca_system_score_codex":0.00045679553,"about_ca_system_score_gemma":0.0008774661,"threshold_uncertainty_score":0.019915998},"labels":[],"label_agreement":null},{"id":"W2044832800","doi":"10.1007/s12083-014-0252-8","title":"Peer-to-peer as an infrastructure service","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; Computer science; Cloud computing; The Internet; File sharing; BitTorrent tracker; Software deployment; Botnet; Peer-to-peer; Service (business); Internet privacy; Service provider; Computer security; World Wide Web; Process (computing); Business","score_opus":0.012793356846929418,"score_gpt":0.2694839227346214,"score_spread":0.256690565887692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044832800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025590027,0.0041052965,0.69933563,0.0045302124,0.0054180822,0.0030048315,0.0024396698,0.06407369,0.1915026],"genre_scores_gemma":[0.6322263,0.0052055744,0.20024167,0.0016983299,0.0029348554,0.000937504,0.0053979224,0.0024062165,0.14895162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979876,0.00033879577,0.00012329718,0.0003660858,0.0009378001,0.0002464196],"domain_scores_gemma":[0.9968104,0.00038308403,0.00022196083,0.0010624978,0.0010154652,0.000506582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014745264,0.0009422217,0.0013684618,0.0011324444,0.0015345949,0.004554775,0.0033398578,0.0022696878,0.019307693],"category_scores_gemma":[0.0051248325,0.00037353465,0.0005204503,0.0016505804,0.00080592046,0.004012503,0.0031400763,0.0013717258,0.017933965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009565419,0.00053465687,0.0016995486,0.0016113622,0.00033837164,0.0017146213,0.0007330726,0.011772378,0.061252587,0.14336337,0.29342866,0.48259482],"study_design_scores_gemma":[0.000268235,0.00049226335,0.0016524051,0.00019771974,0.0002294042,0.002098671,0.0006549187,0.13986903,0.03339468,0.081244275,0.739673,0.00022536653],"about_ca_topic_score_codex":0.0018256571,"about_ca_topic_score_gemma":0.0014669047,"teacher_disagreement_score":0.019307693,"about_ca_system_score_codex":0.0008225396,"about_ca_system_score_gemma":0.0023904808,"threshold_uncertainty_score":0.06459069},"labels":[],"label_agreement":null},{"id":"W2052721903","doi":"10.1007/s12083-012-0167-1","title":"Modelling and performance analysis of content sharing and distribution in community networks with infrastructure support","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Community network; Provisioning; The Internet; Content distribution; Download; Cache; Peer-to-peer; File sharing; Computer network; World Wide Web","score_opus":0.03170153117310551,"score_gpt":0.25251367484783216,"score_spread":0.22081214367472665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052721903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6675788,0.0011456914,0.31817397,0.0013717951,0.00011282943,0.00019475294,0.00027397845,0.00045334653,0.010694825],"genre_scores_gemma":[0.98971283,0.00026280995,0.0076450733,0.000021126909,0.000033811386,0.000051862055,0.00007399334,0.00004648574,0.0021520623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901545,0.00033824268,0.00003521841,0.00012861786,0.00025260108,0.00022983037],"domain_scores_gemma":[0.9932272,0.0052239704,0.00041609438,0.00018314763,0.00072509283,0.00022459372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019621993,0.00082282885,0.00114613,0.0012289006,0.00094635907,0.0019012106,0.0022632256,0.0021792764,0.0018538604],"category_scores_gemma":[0.010827904,0.0005618243,0.0007231595,0.0013920631,0.0014475611,0.0023246815,0.00092159864,0.00092122826,0.00022601396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031808264,0.000036144716,0.00047172926,0.00002122048,0.000007701734,0.000030414216,0.00003068417,0.992182,0.00082562765,0.0045523443,0.00016897601,0.0016414392],"study_design_scores_gemma":[0.0000016624346,0.000005259267,0.00005847561,6.976276e-7,0.0000017938247,0.000004732458,0.0000057632333,0.9991542,0.000106714695,0.00063011376,0.000028868346,0.0000017123244],"about_ca_topic_score_codex":0.028753737,"about_ca_topic_score_gemma":0.0076501225,"teacher_disagreement_score":0.028753737,"about_ca_system_score_codex":0.0031690684,"about_ca_system_score_gemma":0.0018444107,"threshold_uncertainty_score":0.057172716},"labels":[],"label_agreement":null},{"id":"W2053845484","doi":"10.1007/s12083-015-0334-2","title":"Privacy preserving secure data exchange in mobile P2P cloud healthcare environment","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Saud University; University of Ontario Institute of Technology; University of Guelph","keywords":"Cloud computing; Computer science; Computer security; Data sharing; Data exchange; Cryptography; Protocol (science); Session (web analytics); Key (lock); Key exchange; Health care; Internet privacy; Encryption; Public-key cryptography; World Wide Web","score_opus":0.06793940245675492,"score_gpt":0.31355069160684707,"score_spread":0.24561128915009214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053845484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17370814,0.0014594439,0.80973244,0.0035660597,0.00031721292,0.00023509502,0.0003953294,0.0007844453,0.009801781],"genre_scores_gemma":[0.9741771,0.0002542353,0.02346636,0.00014410094,0.00006806016,0.000033646207,0.00010195179,0.000018634935,0.0017359635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997905,0.0006981699,0.00016232574,0.00029266012,0.0006464558,0.00029539407],"domain_scores_gemma":[0.99822277,0.0006696488,0.00019843735,0.00056895317,0.00024632324,0.00009382773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016629408,0.00024197015,0.0006105219,0.0003085492,0.0011046113,0.001869728,0.0008492821,0.0011026585,0.0010335762],"category_scores_gemma":[0.0029717928,0.00018937692,0.00035613598,0.00065905537,0.0006608643,0.0025231675,0.0020750011,0.0009569588,0.0004124211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038947635,0.0006311087,0.011270478,0.00058662303,0.00026417465,0.0075634923,0.0015195091,0.21642779,0.06924578,0.2670262,0.025863769,0.39570636],"study_design_scores_gemma":[0.0001020945,0.00028623256,0.0016644947,0.000030857827,0.00006358494,0.0029513035,0.00058801996,0.86381817,0.03370827,0.08295052,0.013793758,0.000042754426],"about_ca_topic_score_codex":0.00074392225,"about_ca_topic_score_gemma":0.00045326026,"teacher_disagreement_score":0.001869728,"about_ca_system_score_codex":0.0005237425,"about_ca_system_score_gemma":0.0010169679,"threshold_uncertainty_score":0.008794546},"labels":[],"label_agreement":null},{"id":"W2055355018","doi":"10.1007/s12083-008-0026-2","title":"A contribution-based service differentiation scheme for peer-to-peer systems","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upload; Reputation; Peer-to-peer; Computer science; Incentive; Service (business); Reputation system; Free rider problem; Internet privacy; Scheme (mathematics); Computer security; File sharing; World Wide Web; Business; Marketing; The Internet","score_opus":0.019710691259394574,"score_gpt":0.2762502087912448,"score_spread":0.2565395175318502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055355018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04060902,0.0011935406,0.94777215,0.0009424937,0.00073929114,0.00050551764,0.00013866251,0.002354892,0.0057444284],"genre_scores_gemma":[0.676701,0.00059524755,0.31086546,0.00033254744,0.000467646,0.00026626917,0.0002734459,0.00017640235,0.010321916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967709,0.0007821293,0.00025554662,0.00042915877,0.0014248911,0.00033719675],"domain_scores_gemma":[0.99327177,0.001786872,0.0002908938,0.0015941724,0.0022300156,0.00082627556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045394464,0.0008767132,0.0019990013,0.0013522975,0.0029965008,0.0022953781,0.0041950806,0.001913558,0.0026243536],"category_scores_gemma":[0.009395869,0.00043578405,0.00057595345,0.0017672578,0.0012187916,0.0028636272,0.004088425,0.0024548103,0.0016175882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027263702,0.00085428794,0.001630137,0.000751977,0.00019209896,0.00093512295,0.0014163606,0.09865259,0.1116176,0.18694092,0.018084418,0.5761981],"study_design_scores_gemma":[0.0002995882,0.0005523835,0.0005220137,0.00005286072,0.00016428695,0.00088678027,0.00018817672,0.8869247,0.0286577,0.058564454,0.023007413,0.00017969584],"about_ca_topic_score_codex":0.0016962199,"about_ca_topic_score_gemma":0.0018168549,"teacher_disagreement_score":0.0045394464,"about_ca_system_score_codex":0.001479082,"about_ca_system_score_gemma":0.0021378684,"threshold_uncertainty_score":0.024007142},"labels":[],"label_agreement":null},{"id":"W2060919708","doi":"10.1007/s12083-011-0105-7","title":"I-Swifter: Improving chunked network coding for peer-to-peer content distribution","year":2011,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Scheduling (production processes); Distributed computing; Download; Computer network; Peer-to-peer; Encoder; Content distribution; Mathematical optimization; Operating system; Mathematics","score_opus":0.09307694516990196,"score_gpt":0.2922369882356663,"score_spread":0.19916004306576435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060919708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018009787,0.00037990577,0.97278756,0.00022473023,0.00025299072,0.0001491716,0.00014322398,0.0047180788,0.0033344892],"genre_scores_gemma":[0.30543843,0.00041919603,0.683795,0.00031860627,0.00014932732,0.00025888698,0.00045063754,0.0005482912,0.008621698],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987908,0.00022943535,0.00005268459,0.00014149208,0.00064517494,0.00014049625],"domain_scores_gemma":[0.99655557,0.0011249152,0.00017862678,0.0009930125,0.0009783923,0.00016946546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012290616,0.0008192354,0.0009296528,0.0010098115,0.00087533303,0.000993545,0.0019834691,0.0010507561,0.0047016307],"category_scores_gemma":[0.006741023,0.00031927542,0.00037674882,0.0010746573,0.0007845594,0.0023465948,0.0020393606,0.0017147354,0.0012396389],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008535663,0.00040657516,0.0010383538,0.0002282536,0.000099258155,0.00022554102,0.0002612208,0.23984443,0.068305425,0.042235017,0.023665307,0.6228371],"study_design_scores_gemma":[0.000049477665,0.00009880779,0.00014398676,0.000018499299,0.000017396425,0.000098192315,0.000034053952,0.9549804,0.02965524,0.009812156,0.0050627547,0.000029044588],"about_ca_topic_score_codex":0.0072240313,"about_ca_topic_score_gemma":0.0097538475,"teacher_disagreement_score":0.0072240313,"about_ca_system_score_codex":0.0012547546,"about_ca_system_score_gemma":0.0019758332,"threshold_uncertainty_score":0.015728593},"labels":[],"label_agreement":null},{"id":"W2066292413","doi":"10.1007/s12083-012-0190-2","title":"The performance and locality tradeoff in bittorrent-like file sharing systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"University of Hong Kong; Yale University","keywords":"BitTorrent; Computer science; Locality; Distributed computing; Peer-to-peer; Computer network; Selection (genetic algorithm); File sharing; The Internet; Matching (statistics); Pareto principle; Download; Mathematical optimization","score_opus":0.015682504293287103,"score_gpt":0.2372985244764094,"score_spread":0.2216160201831223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066292413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8413777,0.0043378067,0.14060576,0.0026655756,0.00013213746,0.00008388153,0.00019709014,0.0006775876,0.009922472],"genre_scores_gemma":[0.9946154,0.00025301467,0.004146272,0.00004947005,0.000082116385,0.000016821436,0.000030115847,0.000038628816,0.0007680472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960169,0.0014979634,0.00017027858,0.00044481433,0.0012153958,0.00065461936],"domain_scores_gemma":[0.97788805,0.015004494,0.0012706108,0.0022657125,0.0027193842,0.0008516801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047366475,0.0004463328,0.001766374,0.00090967194,0.0025294262,0.0029340617,0.0024061713,0.0021849484,0.0017265067],"category_scores_gemma":[0.025590865,0.00077925954,0.00025408444,0.0015878613,0.0021027215,0.00804531,0.002481174,0.0012418365,0.00048045223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003716065,0.0009538904,0.0140225,0.0005672708,0.00016224482,0.0008924767,0.001610365,0.5874225,0.0653138,0.20952955,0.00883167,0.106977776],"study_design_scores_gemma":[0.000063971136,0.0003192882,0.0021995448,0.00001932405,0.000047379814,0.00046505762,0.00045779187,0.9370127,0.009044312,0.049389597,0.0009161009,0.00006501027],"about_ca_topic_score_codex":0.002403245,"about_ca_topic_score_gemma":0.0032143996,"teacher_disagreement_score":0.0047366475,"about_ca_system_score_codex":0.0021931662,"about_ca_system_score_gemma":0.0014323941,"threshold_uncertainty_score":0.025050104},"labels":[],"label_agreement":null},{"id":"W2069737692","doi":"10.1007/s12083-009-0038-6","title":"Subscriber mobility management for a P2P publish/subscribe overlay in mobile tactical networks","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Overlay; Computer network; Handover; Reliability (semiconductor); Publication; Mobility management; Scheme (mathematics); Overlay network; Distributed computing; Mobile device; World Wide Web; The Internet","score_opus":0.016292047550373966,"score_gpt":0.2836304494832623,"score_spread":0.2673384019328884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069737692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23490447,0.0009938095,0.74845195,0.0013728869,0.00030646715,0.00034440932,0.000228292,0.0033314037,0.010066363],"genre_scores_gemma":[0.9341532,0.00027522005,0.06184803,0.000055140314,0.000111236186,0.00007996127,0.00015708794,0.00007383813,0.0032462408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992716,0.00017830543,0.000093462746,0.00010271328,0.0002583926,0.0000955268],"domain_scores_gemma":[0.99846786,0.00056669203,0.00012754092,0.00033705484,0.00034786292,0.00015286326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022855622,0.00034204306,0.00072284223,0.0007896244,0.0018737628,0.0019789115,0.0011228465,0.000806306,0.0011635143],"category_scores_gemma":[0.003726944,0.00028997334,0.00025669544,0.0007183484,0.00064149464,0.002223883,0.0013829627,0.00075858476,0.00042231174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020841477,0.00087863,0.010627085,0.00035976293,0.00022568162,0.0015421568,0.0021981394,0.2488987,0.09059221,0.14906624,0.016827598,0.47669968],"study_design_scores_gemma":[0.000083958905,0.00018575208,0.0009811949,0.000012259591,0.00009540903,0.00022859797,0.0003361171,0.9569938,0.014321827,0.018508418,0.008210863,0.000041862495],"about_ca_topic_score_codex":0.003365186,"about_ca_topic_score_gemma":0.003579964,"teacher_disagreement_score":0.003365186,"about_ca_system_score_codex":0.0007405674,"about_ca_system_score_gemma":0.0007716593,"threshold_uncertainty_score":0.0120872855},"labels":[],"label_agreement":null},{"id":"W2077709959","doi":"10.1007/s12083-009-0052-8","title":"CliqueStream: Creating an efficient and resilient transport overlay for peer-to-peer live streaming using a clustered DHT","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Royal Society of Canada","keywords":"Overlay; Computer science; Computer network; Overlay network; Robustness (evolution); Distributed computing; Locality; Exploit; Redundancy (engineering); Fault tolerance; Peer-to-peer; Computer security; Operating system","score_opus":0.026118050683652198,"score_gpt":0.30730839674303867,"score_spread":0.2811903460593865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077709959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07415275,0.00048449426,0.86246127,0.00051384885,0.0005809419,0.0009714077,0.001051619,0.05422843,0.0055552656],"genre_scores_gemma":[0.42393616,0.00046372155,0.5581771,0.00018787413,0.00019300579,0.00030251406,0.00337484,0.0020207197,0.011344024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.00007424554,0.000040394247,0.00009097481,0.00033412897,0.000060795635],"domain_scores_gemma":[0.9988341,0.00024635848,0.000056572004,0.00035228077,0.00028529126,0.00022543935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094831904,0.0004674236,0.00076430436,0.0009788861,0.0008512476,0.0011667385,0.0024601233,0.00081671897,0.0032190522],"category_scores_gemma":[0.003079709,0.0005247889,0.0004379022,0.000910439,0.00052366685,0.0018431514,0.002328221,0.0011221305,0.00079027895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017755918,0.0011984307,0.004358973,0.0008278032,0.00034185903,0.00093311357,0.0009993193,0.109326534,0.179645,0.03199718,0.08094086,0.5876553],"study_design_scores_gemma":[0.00035661494,0.00039440635,0.0011710899,0.000024371437,0.00010233923,0.00035715915,0.00020514443,0.89282995,0.057034466,0.0068482705,0.04056134,0.000114819726],"about_ca_topic_score_codex":0.005240524,"about_ca_topic_score_gemma":0.007987719,"teacher_disagreement_score":0.005240524,"about_ca_system_score_codex":0.0008562906,"about_ca_system_score_gemma":0.0013070643,"threshold_uncertainty_score":0.010768771},"labels":[],"label_agreement":null},{"id":"W2097925411","doi":"10.1007/s12083-012-0149-3","title":"Improving sustainability of BitTorrent darknets","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Upload; Computer science; Incentive; BitTorrent tracker; Enforcement; Computer network; Business; Internet privacy; Peer-to-peer; Environmental economics; World Wide Web; Microeconomics","score_opus":0.014938008074435105,"score_gpt":0.2639305153706544,"score_spread":0.24899250729621927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097925411","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7735782,0.0039534327,0.14495465,0.0070345537,0.00038820258,0.00016191042,0.0005829512,0.002328789,0.06701719],"genre_scores_gemma":[0.9899171,0.00067161093,0.0060409578,0.00020064552,0.000039711922,0.000021999505,0.00013153949,0.00010527455,0.0028711134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999175,0.00023457926,0.000022734976,0.000096214964,0.0002805001,0.00019086317],"domain_scores_gemma":[0.9960503,0.0008555501,0.00033249136,0.00044305003,0.0018421526,0.00047648538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00213591,0.0004933451,0.0005127139,0.0008941781,0.0009564443,0.0021466385,0.0011521906,0.0009846268,0.0046267966],"category_scores_gemma":[0.007866183,0.00021439104,0.00013819674,0.0007534964,0.0007110996,0.0035530713,0.0023690737,0.0007291954,0.0006521944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004921729,0.0005321937,0.03478307,0.0005009477,0.00010154383,0.0004099071,0.0007385319,0.2674391,0.046558306,0.14100665,0.018573904,0.4888636],"study_design_scores_gemma":[0.000106130494,0.0007147516,0.014870402,0.00028154938,0.00017359554,0.00044683565,0.003059148,0.6975766,0.042952586,0.16849963,0.07124953,0.000069268805],"about_ca_topic_score_codex":0.004756775,"about_ca_topic_score_gemma":0.0082241455,"teacher_disagreement_score":0.004756775,"about_ca_system_score_codex":0.0017197218,"about_ca_system_score_gemma":0.0026994797,"threshold_uncertainty_score":0.015478194},"labels":[],"label_agreement":null},{"id":"W2117718929","doi":"10.1007/s12083-009-0048-4","title":"Adaptive topology formation for peer-to-peer video streaming","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Upload; Video quality; Bandwidth (computing); Overlay; Peer-to-peer; Distributed computing; Overlay network; Network topology; The Internet; Real-time computing","score_opus":0.025986668830844765,"score_gpt":0.2889531711439613,"score_spread":0.2629665023131165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117718929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042555213,0.00053450937,0.95330703,0.00027971694,0.00014205478,0.00011797167,0.000057764322,0.00071710255,0.0022886698],"genre_scores_gemma":[0.8123492,0.00043085348,0.18339993,0.00005923456,0.00012023718,0.00013415205,0.00016498908,0.00009604583,0.0032452524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921453,0.00026659743,0.00004459745,0.00014454262,0.00026279988,0.000066956054],"domain_scores_gemma":[0.99797124,0.001064934,0.00017719234,0.00029905187,0.00032928068,0.00015833389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010880393,0.0003737295,0.0009710288,0.00071801094,0.0009884904,0.00070134713,0.0016517005,0.00081097323,0.0011581513],"category_scores_gemma":[0.005423413,0.0003496767,0.00029656722,0.00083886785,0.0006112427,0.0015397619,0.0013193312,0.0008967962,0.0002863404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044634467,0.00018982604,0.0009760124,0.00014828781,0.00007081,0.00032226538,0.00033286258,0.7444728,0.03003276,0.03316284,0.0041971467,0.18564805],"study_design_scores_gemma":[0.000023554785,0.00004842554,0.00013832473,0.0000028480952,0.000009755885,0.00007483332,0.000026653854,0.98840034,0.0021630863,0.008089197,0.0010132216,0.000009790873],"about_ca_topic_score_codex":0.001755637,"about_ca_topic_score_gemma":0.0019651253,"teacher_disagreement_score":0.001755637,"about_ca_system_score_codex":0.0006188034,"about_ca_system_score_gemma":0.0005479538,"threshold_uncertainty_score":0.005754173},"labels":[],"label_agreement":null},{"id":"W2125948488","doi":"10.1007/s12083-007-0007-x","title":"An inexpensive unstructured platform for wireless mobile peer-to-peer networks","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gossip; Peer-to-peer; Wireless; Computer network; Distributed computing; Robustness (evolution); Wireless network; Mobile device; Gossip protocol; Bandwidth (computing); Exploit; Mobile computing; Computer security; Operating system","score_opus":0.02363411094292499,"score_gpt":0.2832382619596718,"score_spread":0.2596041510167468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125948488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097975135,0.0014700352,0.80193305,0.00090410473,0.0028925887,0.002196303,0.0017892723,0.041288152,0.049551304],"genre_scores_gemma":[0.39815688,0.0010849668,0.49929932,0.0006353867,0.0007455457,0.0020103622,0.0038071396,0.0020299943,0.09223041],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902415,0.00009235602,0.00004493786,0.000109643806,0.0006199364,0.00010910589],"domain_scores_gemma":[0.9987871,0.00019580808,0.00008622324,0.00038878748,0.0002833689,0.00025876262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924558,0.00058685266,0.0008181761,0.0009842719,0.0010025206,0.0011386757,0.0027772842,0.0009014214,0.014327722],"category_scores_gemma":[0.0020979603,0.0004309626,0.00034422762,0.0007228454,0.00036759797,0.0020110444,0.0030345283,0.0010097403,0.0073188283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024344749,0.0010204613,0.0013602498,0.00126306,0.00011219321,0.0015117094,0.0004311968,0.014092079,0.44878128,0.044864632,0.088582404,0.39554623],"study_design_scores_gemma":[0.00085289165,0.0030792467,0.003139671,0.00016238433,0.00028759614,0.002032615,0.00029948767,0.23835726,0.23631819,0.03885035,0.4762382,0.0003821726],"about_ca_topic_score_codex":0.0006508711,"about_ca_topic_score_gemma":0.00083772,"teacher_disagreement_score":0.014327722,"about_ca_system_score_codex":0.00036530418,"about_ca_system_score_gemma":0.0006402322,"threshold_uncertainty_score":0.047931075},"labels":[],"label_agreement":null},{"id":"W2136784393","doi":"10.1007/s12083-009-0047-5","title":"SPACE: A lightweight collaborative caching for clusters","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Computer science; Scheme (mathematics); Overhead (engineering); Distributed computing; Space (punctuation); Cluster (spacecraft); Peer-to-peer; Computer cluster; False sharing; CPU cache; Cache algorithms; Computer network; Parallel computing; Operating system","score_opus":0.013609960840248262,"score_gpt":0.2661503445185948,"score_spread":0.2525403836783466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136784393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07174215,0.0020849945,0.83569294,0.0005919643,0.0006766695,0.0007432008,0.001079146,0.07824175,0.009147195],"genre_scores_gemma":[0.5133041,0.00075367885,0.45974952,0.00030431215,0.00032023972,0.00060556363,0.0019554368,0.0025676452,0.02043948],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783164,0.00041831884,0.00013618243,0.00025690408,0.0010723484,0.0002845318],"domain_scores_gemma":[0.9953799,0.00069955917,0.00021856783,0.002492777,0.0006655001,0.00054365565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021815442,0.0011926384,0.0019810873,0.0018250297,0.0024996914,0.0027997803,0.0046779043,0.0019353633,0.007250198],"category_scores_gemma":[0.0054105297,0.00082516903,0.00097221875,0.0024493297,0.0011368894,0.003751145,0.0048328373,0.0013952293,0.002064183],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073457253,0.00096106343,0.005663943,0.0013090258,0.00072204834,0.00065226003,0.0014602013,0.116709545,0.07559182,0.06476144,0.10989147,0.6149314],"study_design_scores_gemma":[0.0010609855,0.00089124247,0.0015845376,0.00008202884,0.00042344374,0.0004988668,0.00032979954,0.85514796,0.0431625,0.03280267,0.06377593,0.00024009851],"about_ca_topic_score_codex":0.010267027,"about_ca_topic_score_gemma":0.011594832,"teacher_disagreement_score":0.010267027,"about_ca_system_score_codex":0.0015526038,"about_ca_system_score_gemma":0.0028859933,"threshold_uncertainty_score":0.024254322},"labels":[],"label_agreement":null},{"id":"W2159896477","doi":"10.1007/s12083-009-0066-2","title":"From P2P to reliable semantic P2P systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scalability; Semantic Web; Semantics (computer science); Disconnection; Reliability (semiconductor); Fault tolerance; Social Semantic Web; Distributed computing; Information retrieval; Database; Power (physics)","score_opus":0.013452727753118765,"score_gpt":0.2577501957171053,"score_spread":0.24429746796398652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159896477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013171218,0.012281803,0.9152047,0.0126227485,0.0014974882,0.00015060532,0.0002917192,0.0025496099,0.042230014],"genre_scores_gemma":[0.6231955,0.022373289,0.32914463,0.0021028735,0.0028863337,0.00039424174,0.00091527775,0.00079661974,0.018191231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962321,0.0010662541,0.00020198617,0.0005116653,0.0017353281,0.0002526783],"domain_scores_gemma":[0.99588996,0.0016411612,0.00020757076,0.0013145589,0.00071073766,0.00023605475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031223064,0.00084616203,0.0010541616,0.0011107102,0.0013173769,0.005411613,0.0024449702,0.0027810081,0.0046018115],"category_scores_gemma":[0.009420454,0.00072879693,0.0005009207,0.0021160487,0.0035896248,0.012593603,0.0051884106,0.0032319836,0.0018804086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018941215,0.00006454573,0.00035037295,0.00065703917,0.00005417793,0.00040841507,0.0005289351,0.02123314,0.0035645536,0.8220879,0.022165032,0.12869643],"study_design_scores_gemma":[0.000034174438,0.000041448515,0.00014491339,0.000084870364,0.000034565706,0.00025951242,0.00021882416,0.05780495,0.0024568175,0.8465068,0.09237855,0.000034484674],"about_ca_topic_score_codex":0.0014334735,"about_ca_topic_score_gemma":0.0008235309,"teacher_disagreement_score":0.005411613,"about_ca_system_score_codex":0.0011701193,"about_ca_system_score_gemma":0.0015462635,"threshold_uncertainty_score":0.016512513},"labels":[],"label_agreement":null},{"id":"W2180459646","doi":"10.1007/s12083-015-0422-3","title":"Opportunistic cooperation in wireless ad hoc networks with interference correlation","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless ad hoc network; Interference (communication); Computer science; Wireless; Computer network; Correlation; Post-hoc analysis; Telecommunications; Mobile ad hoc network; Channel (broadcasting); Mathematics; Statistics","score_opus":0.05670263611936628,"score_gpt":0.2910093912865058,"score_spread":0.23430675516713956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180459646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08009685,0.0026245792,0.9064524,0.0004401335,0.00015552646,0.00009779405,0.000056822435,0.0002675838,0.009808348],"genre_scores_gemma":[0.96965224,0.0010496789,0.025391776,0.00009989734,0.0001387645,0.00011267786,0.000042762636,0.000033007364,0.0034792365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978921,0.0009855111,0.00007059302,0.00021176282,0.00058275927,0.00025734337],"domain_scores_gemma":[0.9892614,0.008874241,0.0006351994,0.00038442048,0.00064006227,0.00020462362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027371594,0.000694512,0.0012365681,0.0010452789,0.0010506515,0.0013820747,0.0015587371,0.0011108292,0.00066709635],"category_scores_gemma":[0.009132366,0.000915336,0.00046026925,0.0018806162,0.0017935784,0.0014777657,0.0016324042,0.0008674027,0.00018822248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016954982,0.00009389067,0.0013132894,0.00015338452,0.00009546495,0.00050073257,0.00023475254,0.90049565,0.003165148,0.06398786,0.0014922114,0.028298095],"study_design_scores_gemma":[0.000016893144,0.00004444472,0.00021350566,0.000008165033,0.000024402778,0.0001260961,0.00004046796,0.98079,0.00044691886,0.017720137,0.00055748114,0.000011517419],"about_ca_topic_score_codex":0.0022795778,"about_ca_topic_score_gemma":0.0027207537,"teacher_disagreement_score":0.0027371594,"about_ca_system_score_codex":0.0010584051,"about_ca_system_score_gemma":0.0013600452,"threshold_uncertainty_score":0.014475703},"labels":[],"label_agreement":null},{"id":"W2286153064","doi":"10.1007/s12083-016-0436-5","title":"A fault tolerant peer-to-peer spatial data structure","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Bank of Canada","funders":"","keywords":"Computer science; Hash function; Hash table; Redundancy (engineering); Distributed hash table; Backup; Node (physics); Range query (database); Theoretical computer science; Algorithm; Peer-to-peer; Distributed computing; Search engine","score_opus":0.02979607622787121,"score_gpt":0.28679192954184785,"score_spread":0.2569958533139766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286153064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019896662,0.00057021744,0.9641216,0.0007862073,0.0002899394,0.0004255516,0.0010228512,0.007781249,0.005105711],"genre_scores_gemma":[0.34875378,0.00068710657,0.6344247,0.00037242568,0.00018963897,0.00042598305,0.0027170528,0.00032205944,0.01210734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998896,0.00011650242,0.00010748358,0.00014599446,0.0006523796,0.00008147216],"domain_scores_gemma":[0.9977068,0.00031264068,0.0001984413,0.0008997266,0.0007075126,0.00017494471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084256893,0.00037943502,0.0010573892,0.0013203978,0.0015852058,0.0015873241,0.0030632303,0.0010880895,0.003408029],"category_scores_gemma":[0.0034842982,0.00036079276,0.00048221293,0.0021968035,0.0007983803,0.002393165,0.002659807,0.00097653596,0.0018593683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011218683,0.00044336886,0.0028950926,0.0007759475,0.00015530958,0.00062761665,0.00073215814,0.16363527,0.07557289,0.13446136,0.050089087,0.56949],"study_design_scores_gemma":[0.0002533046,0.0007771116,0.0010722171,0.000059009977,0.00013054407,0.00087740365,0.0003577368,0.7773067,0.062545605,0.05433424,0.102140464,0.00014578167],"about_ca_topic_score_codex":0.005387186,"about_ca_topic_score_gemma":0.004107309,"teacher_disagreement_score":0.005387186,"about_ca_system_score_codex":0.0010927613,"about_ca_system_score_gemma":0.002252127,"threshold_uncertainty_score":0.011400938},"labels":[],"label_agreement":null},{"id":"W2323143645","doi":"10.1007/s12083-016-0454-3","title":"Joint TAS and power allocation for D2D cooperative networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Young Scientists Fund; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Transmitter power output; Relay; Fading; Outage probability; Computer science; Antenna (radio); Power (physics); Joint (building); Topology (electrical circuits); Performance improvement; Electronic engineering; Mathematics; Telecommunications; Engineering; Transmitter; Channel (broadcasting); Physics","score_opus":0.03633668490090542,"score_gpt":0.288388145615534,"score_spread":0.2520514607146286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323143645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033820637,0.00064367935,0.9576306,0.00032821824,0.00011548518,0.00006282618,0.00012446727,0.00027666357,0.006997616],"genre_scores_gemma":[0.94448227,0.0004150964,0.049902886,0.00010909245,0.00007827545,0.00011210014,0.00007399156,0.000041095645,0.004785282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999212,0.0002633828,0.00003606791,0.00013038419,0.00019249733,0.00016559039],"domain_scores_gemma":[0.9985953,0.00081259216,0.00009620133,0.00014776968,0.00026616987,0.000081950646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011107107,0.00070036197,0.0009560689,0.0004668997,0.0009387044,0.0011586717,0.0012230352,0.0007453848,0.002127778],"category_scores_gemma":[0.0031120293,0.00039271096,0.00041898736,0.0012437215,0.0007791823,0.0010344706,0.0017751193,0.0006566435,0.0004604452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004859319,0.00008592711,0.0008795327,0.00016736926,0.00009425302,0.00023699432,0.0002966701,0.7975918,0.013765971,0.06792275,0.005244893,0.11322793],"study_design_scores_gemma":[0.000021227203,0.000051092687,0.000091398244,0.0000057021634,0.0000217256,0.000058889713,0.000052728723,0.9774065,0.0015200493,0.019374045,0.001385844,0.0000108673],"about_ca_topic_score_codex":0.0034774279,"about_ca_topic_score_gemma":0.0058245054,"teacher_disagreement_score":0.0034774279,"about_ca_system_score_codex":0.00087758957,"about_ca_system_score_gemma":0.0015477497,"threshold_uncertainty_score":0.007118106},"labels":[],"label_agreement":null},{"id":"W2408594160","doi":"10.1007/s12083-016-0465-0","title":"An overview of medium access control strategies for opportunistic spectrum access in cognitive radio networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Faculty of Engineering and Architectural Science, Ryerson University","keywords":"Cognitive radio; Computer science; Computer network; Access control; Media access control; Wireless; Exploit; Radio spectrum; Key (lock); Spectral efficiency; Physical layer; Spectrum management; Telecommunications; Computer security; Channel (broadcasting)","score_opus":0.07862623162074382,"score_gpt":0.3650725362020824,"score_spread":0.2864463045813386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408594160","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036719022,0.25964332,0.70613104,0.0006301944,0.0006855808,0.0002493834,0.00010650703,0.0005255362,0.028356532],"genre_scores_gemma":[0.18497775,0.34129238,0.4530091,0.00074243464,0.0024780661,0.0006833532,0.00044000594,0.00014369766,0.016233146],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914074,0.0001388637,0.00009799612,0.00014293041,0.00041013386,0.00006937616],"domain_scores_gemma":[0.99937785,0.0003242962,0.000045423287,0.00004960648,0.00018127482,0.00002146164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087344716,0.0011428277,0.0009852669,0.001469981,0.0006410809,0.0025470208,0.0020165327,0.0016256031,0.0020841267],"category_scores_gemma":[0.0015783679,0.00046387484,0.00057669444,0.0016845937,0.0004778088,0.0021103455,0.00081818766,0.0012941523,0.0010350844],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008134734,0.00021232251,0.00044592394,0.002118857,0.00009937101,0.00024329296,0.00010303833,0.036392894,0.009084121,0.09013882,0.006671388,0.8544086],"study_design_scores_gemma":[0.000048964146,0.0005387957,0.0012140009,0.0014681946,0.00031388065,0.0021300162,0.00016736245,0.56531537,0.012339454,0.11374508,0.30254185,0.00017704413],"about_ca_topic_score_codex":0.0016540658,"about_ca_topic_score_gemma":0.0015618652,"teacher_disagreement_score":0.0025470208,"about_ca_system_score_codex":0.00072283536,"about_ca_system_score_gemma":0.0007443108,"threshold_uncertainty_score":0.006972134},"labels":[],"label_agreement":null},{"id":"W2493324792","doi":"10.1007/s12083-016-0498-4","title":"Optimizing broadcast duration for layered video streams in cellular networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Heilongjiang Province; National Natural Science Foundation of China","keywords":"Computer science; Transmission (telecommunications); Optimization problem; Cellular network; Telecommunications link; Minification; Computer network; Base station; Real-time computing; Video quality; Signal-to-noise ratio (imaging); Layer (electronics); Mathematical optimization; Algorithm; Telecommunications; Mathematics; Engineering; Metric (unit)","score_opus":0.010317398202840401,"score_gpt":0.23297960006696555,"score_spread":0.22266220186412516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493324792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28523052,0.0013004629,0.70822036,0.00041958978,0.000084676736,0.00007329691,0.00014290732,0.0004826647,0.004045511],"genre_scores_gemma":[0.97075665,0.0002865808,0.027262822,0.000045130935,0.00006173576,0.000053816133,0.000059411082,0.00008060235,0.001393279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995443,0.00013073314,0.000020134034,0.00005385609,0.000115074145,0.00013584869],"domain_scores_gemma":[0.997171,0.0020701333,0.0001787649,0.00007936094,0.00026332604,0.00023746051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013462796,0.0006759926,0.0010123126,0.00052111124,0.00040731192,0.00094051356,0.0009830395,0.0008905844,0.001615262],"category_scores_gemma":[0.007486949,0.000427757,0.0002168606,0.0005766241,0.0005288422,0.00093963405,0.0009803664,0.0007652558,0.00019810052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004247479,0.00009205023,0.00069160014,0.000068844405,0.000025982834,0.00005006092,0.0000681035,0.9523744,0.008834807,0.0042618974,0.00075952965,0.03234799],"study_design_scores_gemma":[0.000015944655,0.00006608075,0.0001265049,0.0000042281213,0.000009783633,0.000010245924,0.000013945743,0.99723804,0.0010243981,0.0013898565,0.000096908865,0.0000040817554],"about_ca_topic_score_codex":0.0038071156,"about_ca_topic_score_gemma":0.003458774,"teacher_disagreement_score":0.0038071156,"about_ca_system_score_codex":0.0014173094,"about_ca_system_score_gemma":0.0013128596,"threshold_uncertainty_score":0.010283351},"labels":[],"label_agreement":null},{"id":"W2528637035","doi":"10.1007/s12083-016-0515-7","title":"Distributed rate control, routing, and energy management in dynamic rechargeable sensor networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Computer science; Scalability; Mathematical optimization; Routing (electronic design automation); Distributed computing; Constraint (computer-aided design); Flow routing; Energy (signal processing); Maximization; Wireless sensor network; Computer network; Engineering; Mathematics","score_opus":0.0075998805293364885,"score_gpt":0.22896120929935737,"score_spread":0.22136132877002088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528637035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048579022,0.008365387,0.9369858,0.001283475,0.0004435461,0.00004888553,0.000068116075,0.0005451381,0.0036806213],"genre_scores_gemma":[0.9518006,0.0032615333,0.039907124,0.000119786695,0.00046558678,0.000078861136,0.00006622104,0.00008855999,0.004211757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882203,0.0003246467,0.00008533751,0.00025774734,0.0004134706,0.000096613505],"domain_scores_gemma":[0.9981335,0.0011170245,0.00027340886,0.00018551605,0.0002341779,0.00005642611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021412289,0.0006824928,0.0011263764,0.00056494656,0.000527308,0.0016959816,0.0019212425,0.0008811531,0.00076896866],"category_scores_gemma":[0.0050306874,0.0004049813,0.00028952252,0.0009759853,0.0011503104,0.0028264942,0.00095208373,0.0010148769,0.0001421388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002862518,0.00010878931,0.00089436455,0.00017102576,0.00007446054,0.00015787744,0.00024016865,0.7893968,0.009210439,0.071460724,0.0026759235,0.12532318],"study_design_scores_gemma":[0.00001947254,0.00004542522,0.00020502682,0.000005244648,0.000015698475,0.000059368725,0.000028793427,0.9736616,0.0014254596,0.023137525,0.0013803018,0.00001595369],"about_ca_topic_score_codex":0.0022601644,"about_ca_topic_score_gemma":0.0020123732,"teacher_disagreement_score":0.0022601644,"about_ca_system_score_codex":0.0010425003,"about_ca_system_score_gemma":0.0006060232,"threshold_uncertainty_score":0.011323988},"labels":[],"label_agreement":null},{"id":"W2530306538","doi":"10.1007/s12083-016-0525-5","title":"A noncontact positioning measuring system based on distributed wireless networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Key Scientific Instrument and Equipment Development Projects of China; National Science Foundation","keywords":"Computer science; Computer vision; Wireless sensor network; Position (finance); Artificial intelligence; Sensor fusion; Wireless; Range (aeronautics); Measure (data warehouse); Coordinate system; Real-time computing; Engineering; Telecommunications; Computer network","score_opus":0.015039918671320426,"score_gpt":0.2335912865171937,"score_spread":0.21855136784587328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530306538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05355642,0.00047651932,0.93593526,0.00029169043,0.0004084799,0.00023337617,0.0001260848,0.0045194537,0.0044526844],"genre_scores_gemma":[0.6260044,0.00034654405,0.3606176,0.00036035088,0.00035402772,0.0005053162,0.00040491117,0.00013175262,0.011275114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845386,0.00021715173,0.0000744526,0.0004070555,0.00077889714,0.00006846524],"domain_scores_gemma":[0.9989262,0.00025715205,0.000103567014,0.00022277162,0.00038686566,0.000103385835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072232925,0.0008169065,0.0017493413,0.00089342816,0.0009215556,0.00091731653,0.00241281,0.0013438348,0.0024906928],"category_scores_gemma":[0.0012366781,0.00047803562,0.00036128736,0.0008974091,0.0003975819,0.0020311137,0.0017874135,0.00073391024,0.0013835963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007988928,0.00043846885,0.005832502,0.00040768596,0.00014861551,0.0005956006,0.00040010348,0.017912945,0.4042447,0.006715846,0.005730349,0.5567744],"study_design_scores_gemma":[0.0004697386,0.0025924873,0.012773362,0.000061128485,0.0003332029,0.002779385,0.00018107177,0.7935921,0.1454299,0.00566941,0.03582741,0.00029091074],"about_ca_topic_score_codex":0.0009233636,"about_ca_topic_score_gemma":0.0011404195,"teacher_disagreement_score":0.0024906928,"about_ca_system_score_codex":0.0004763678,"about_ca_system_score_gemma":0.00073157484,"threshold_uncertainty_score":0.008332193},"labels":[],"label_agreement":null},{"id":"W2536851316","doi":"10.1007/s12083-016-0519-3","title":"Energy-efficient content distribution via mobile users cooperations in cellular networks","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cellular network; Content distribution; Computer network","score_opus":0.020146689667411097,"score_gpt":0.23368420626595274,"score_spread":0.21353751659854164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536851316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43379906,0.0009516512,0.55825716,0.00029314333,0.000061489496,0.000049783182,0.000046442292,0.0002480701,0.006293145],"genre_scores_gemma":[0.9926715,0.00011166897,0.0062888605,0.000013636668,0.000013984851,0.000011134564,0.000009693705,0.000007479621,0.0008720953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996792,0.00011078574,0.000011015292,0.000041314426,0.00009625314,0.00006144652],"domain_scores_gemma":[0.9990176,0.000609336,0.00007705788,0.000069368936,0.00018155543,0.000045108845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046132147,0.00026496718,0.0004633525,0.000440198,0.00055239734,0.0006071511,0.00059126865,0.00049590075,0.00061376375],"category_scores_gemma":[0.0017924366,0.00020413229,0.00016980665,0.0007054244,0.00047951748,0.00054334797,0.0006199081,0.00023287216,0.00015103156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007194456,0.0001645544,0.0026752248,0.00012657559,0.00008399552,0.00046655347,0.00040376218,0.7662891,0.06726525,0.0496024,0.0015820448,0.110621125],"study_design_scores_gemma":[0.000012170796,0.000053031996,0.0003263742,0.000003067578,0.000017783172,0.00007154954,0.000053920223,0.98534364,0.0044266516,0.009078041,0.00060607085,0.000007741913],"about_ca_topic_score_codex":0.0010807419,"about_ca_topic_score_gemma":0.0013248206,"teacher_disagreement_score":0.0010807419,"about_ca_system_score_codex":0.00042946075,"about_ca_system_score_gemma":0.000339202,"threshold_uncertainty_score":0.0031160116},"labels":[],"label_agreement":null},{"id":"W2755417146","doi":"10.1007/s12083-017-0594-0","title":"Adaptive Flow Rate Control for Network Utility Maximization Subject to QoS Constraints in Wireless Multi-hop Networks","year":2017,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Quality of service; Hop (telecommunications); Computer network; Utility maximization; Wireless network; Maximization; Flow control (data); Wireless; Control (management); Distributed computing; Mathematical optimization; Telecommunications; Artificial intelligence; Mathematics; Mathematical economics","score_opus":0.021392336005416155,"score_gpt":0.26667026939771776,"score_spread":0.2452779333923016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755417146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027262993,0.00089081796,0.96681577,0.0005384949,0.00017432863,0.0000989843,0.0000572133,0.00020800233,0.0039534084],"genre_scores_gemma":[0.9378878,0.00084529514,0.05516061,0.00019075497,0.00026379977,0.00023799433,0.00007532848,0.00014740542,0.005191141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987264,0.00054789893,0.00004519942,0.0001912861,0.00028068773,0.00020842417],"domain_scores_gemma":[0.9966091,0.0025882013,0.00021404804,0.0000812706,0.00040881033,0.000098566146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039867642,0.0015175613,0.0017976295,0.0009280784,0.0005673641,0.0019378454,0.0024537502,0.0016882191,0.002252382],"category_scores_gemma":[0.00930039,0.0007632847,0.00046758444,0.0010733743,0.0015173611,0.0019159593,0.0016857032,0.0018547976,0.00023817354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086692926,0.000057876085,0.00011386141,0.000070907,0.00002484097,0.000034044788,0.00006399808,0.97101676,0.001261987,0.013857263,0.0008634296,0.012548249],"study_design_scores_gemma":[0.000008976372,0.000010223776,0.000021415399,0.0000026481116,0.0000026788157,0.000002892786,0.0000034767104,0.9978125,0.00008614544,0.0019808596,0.00006541473,0.000002805044],"about_ca_topic_score_codex":0.006912632,"about_ca_topic_score_gemma":0.00336054,"teacher_disagreement_score":0.006912632,"about_ca_system_score_codex":0.0019032856,"about_ca_system_score_gemma":0.0015034154,"threshold_uncertainty_score":0.021084249},"labels":[],"label_agreement":null},{"id":"W2755725365","doi":"10.1007/s12083-017-0604-2","title":"An improved network security situation assessment approach in software defined networks","year":2017,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"OpenFlow; Computer science; Software-defined networking; Forwarding plane; Routing control plane; Computer network; Software; Software deployment; Flooding (psychology); Network security; Hidden Markov model; Computer security; Distributed computing; Artificial intelligence; Network packet; Software engineering","score_opus":0.016857002466765417,"score_gpt":0.28712783289431987,"score_spread":0.27027083042755445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755725365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02944894,0.00018798995,0.96558404,0.00017629749,0.000049990314,0.00016591922,0.00006832919,0.0005810905,0.0037373418],"genre_scores_gemma":[0.5979979,0.00021058456,0.39977726,0.000054834814,0.00003630161,0.0001389244,0.00015496451,0.000037480248,0.0015917412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983236,0.0005628851,0.00012407983,0.00022149259,0.0006693838,0.000098385586],"domain_scores_gemma":[0.9984779,0.00053396495,0.00014567262,0.00012979381,0.00063491415,0.00007774105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017770522,0.00074456556,0.0006484934,0.0022798346,0.00069936714,0.001921988,0.0011808611,0.00063142664,0.0011898833],"category_scores_gemma":[0.004373653,0.00030415104,0.0005621165,0.0010011485,0.00046726014,0.00232659,0.0018042438,0.00087402534,0.00024398447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019717606,0.000428926,0.011049563,0.00029159413,0.00024964084,0.00049936573,0.00113049,0.37651172,0.014052469,0.055877913,0.0024779027,0.53723323],"study_design_scores_gemma":[0.000006907499,0.000060432223,0.0010369474,0.000018156365,0.000053705873,0.00009939579,0.00022409632,0.9844319,0.0016400453,0.010623861,0.0017829718,0.000021454576],"about_ca_topic_score_codex":0.0055451975,"about_ca_topic_score_gemma":0.0049091964,"teacher_disagreement_score":0.0055451975,"about_ca_system_score_codex":0.0009421558,"about_ca_system_score_gemma":0.0011573016,"threshold_uncertainty_score":0.011025846},"labels":[],"label_agreement":null},{"id":"W2767519807","doi":"10.1007/s12083-017-0618-9","title":"FGDA: Fine-grained data analysis in privacy-preserving smart grid communications","year":2017,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Smart grid; Ciphertext; Variance (accounting); Encryption; Distributed computing; Computer network; Data mining; Real-time computing; Engineering","score_opus":0.05056748979579573,"score_gpt":0.3152218450508855,"score_spread":0.2646543552550898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767519807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011867223,0.00023515204,0.97867924,0.00041700283,0.00010524496,0.00011455008,0.0003516221,0.0073919427,0.00083800196],"genre_scores_gemma":[0.5700145,0.00023704731,0.4256058,0.0003703967,0.00011792131,0.00016213657,0.00082695007,0.00050625775,0.002158924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963863,0.00095821335,0.00029267548,0.0007538384,0.0012376461,0.00037130268],"domain_scores_gemma":[0.99096525,0.0026954673,0.00049423566,0.004879411,0.00072861573,0.00023697862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003988001,0.0010960981,0.0015054604,0.0015549583,0.00151501,0.0026873949,0.0023185022,0.0013435361,0.0028654495],"category_scores_gemma":[0.012341516,0.0007081318,0.0009992208,0.001647747,0.0018197275,0.00453193,0.004137957,0.0022505813,0.0009109558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00146579,0.00039066357,0.0073305443,0.00034846438,0.00033537822,0.0006109063,0.00056857156,0.3828424,0.031748585,0.107474804,0.02308446,0.44379947],"study_design_scores_gemma":[0.000025752644,0.000051941115,0.00039797928,0.000013565191,0.000016163662,0.000098393546,0.000066647495,0.9247832,0.009326257,0.061468724,0.0037313155,0.000020053236],"about_ca_topic_score_codex":0.004220573,"about_ca_topic_score_gemma":0.004487307,"teacher_disagreement_score":0.004220573,"about_ca_system_score_codex":0.0012406659,"about_ca_system_score_gemma":0.002629411,"threshold_uncertainty_score":0.021090806},"labels":[],"label_agreement":null},{"id":"W2782496420","doi":"10.1007/s12083-017-0628-7","title":"Ad-hoc messaging infrastructure for peer-to-peer communication","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Peer-to-peer; Computer science; Wireless ad hoc network; Computer network; World Wide Web; Telecommunications; Wireless","score_opus":0.020752066582423605,"score_gpt":0.292478541460965,"score_spread":0.2717264748785414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782496420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021590501,0.0034213078,0.90885955,0.0013526573,0.0017355548,0.0011537079,0.0009369525,0.011712841,0.049236935],"genre_scores_gemma":[0.531941,0.0040365136,0.39942768,0.00049350644,0.0010632473,0.0010130389,0.0046385033,0.000673696,0.056712788],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897027,0.00015522557,0.00011506082,0.00018097034,0.00045352636,0.00012504132],"domain_scores_gemma":[0.9983668,0.0002444896,0.00016723512,0.00042438167,0.00061335746,0.00018377206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009446137,0.00059217017,0.00065242656,0.0012350102,0.0014376746,0.0022060734,0.002668114,0.0009151955,0.0060961],"category_scores_gemma":[0.0023885155,0.0003385778,0.00028144606,0.0013088108,0.00041025912,0.0024633573,0.0016177522,0.0012522348,0.00355504],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005286495,0.0005938554,0.0013947845,0.0016229452,0.00013756994,0.0010612089,0.0005908732,0.028708873,0.106061056,0.23013942,0.091764756,0.537396],"study_design_scores_gemma":[0.00016615342,0.0007923925,0.0024844122,0.0002800878,0.0002769007,0.0014554189,0.0005913974,0.31756186,0.088872254,0.08138076,0.5059417,0.0001967357],"about_ca_topic_score_codex":0.0011288287,"about_ca_topic_score_gemma":0.0014172373,"teacher_disagreement_score":0.0060961,"about_ca_system_score_codex":0.0008832369,"about_ca_system_score_gemma":0.0016457393,"threshold_uncertainty_score":0.02039349},"labels":[],"label_agreement":null},{"id":"W2803003248","doi":"10.1007/s12083-018-0656-y","title":"Connectivity preserving obstacle avoidance localized motion planning algorithms for mobile wireless sensor networks","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Algorithm; Wireless sensor network; Motion planning; Probabilistic logic; Obstacle avoidance; Cellular network; Wireless network; Distributed algorithm; Wireless; Real-time computing; Distributed computing; Computer network; Mobile robot; Artificial intelligence; Telecommunications; Robot","score_opus":0.037207322528434277,"score_gpt":0.32187880180464234,"score_spread":0.28467147927620806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803003248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036996145,0.0003378099,0.96063787,0.00014529424,0.000029796705,0.000043355943,0.000041656087,0.00026154338,0.0015064846],"genre_scores_gemma":[0.83223474,0.0003529649,0.16403034,0.000074281845,0.000037680336,0.0001901461,0.00014273127,0.00006927257,0.0028678556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998487,0.00003320875,0.0000069727585,0.000030127647,0.00005773549,0.000023239116],"domain_scores_gemma":[0.99958664,0.00023436346,0.000064399756,0.00003406797,0.000057917485,0.000022644048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030726197,0.00060253066,0.0005579612,0.0005569285,0.00047894486,0.00043488934,0.0011765418,0.00061221345,0.00078533846],"category_scores_gemma":[0.0016039,0.00042887757,0.0003233887,0.0007291617,0.00056325964,0.0008009578,0.0011361283,0.0006080522,0.00013996934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042044736,0.000021188936,0.0002760517,0.000028231296,0.000014427333,0.00002766013,0.00005548291,0.9560058,0.0015585511,0.004553314,0.00059157,0.03682567],"study_design_scores_gemma":[0.000007135733,0.000028793667,0.00009234091,0.0000027546957,0.000004229266,0.000010558409,0.000009963302,0.996369,0.00038328598,0.0028746696,0.00021446208,0.0000027063068],"about_ca_topic_score_codex":0.0049047796,"about_ca_topic_score_gemma":0.005143767,"teacher_disagreement_score":0.0049047796,"about_ca_system_score_codex":0.0004485,"about_ca_system_score_gemma":0.00069603365,"threshold_uncertainty_score":0.009752452},"labels":[],"label_agreement":null},{"id":"W2807377293","doi":"10.1007/s12083-018-0658-9","title":"Localized topology control and on-demand power-efficient routing for wireless ad hoc and sensor networks","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Topology control; Computer science; Computer network; Routing protocol; Topology (electrical circuits); Distributed computing; Wireless ad hoc network; Link-state routing protocol; Optimized Link State Routing Protocol; Geographic routing; Network topology; Dynamic Source Routing; Network packet; Wireless network; Wireless; Key distribution in wireless sensor networks; Mathematics; Telecommunications","score_opus":0.011553187671306584,"score_gpt":0.2658277026464752,"score_spread":0.2542745149751686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807377293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02340733,0.001330922,0.9703053,0.0004123264,0.00018631981,0.000041569725,0.00004147536,0.00031994478,0.003954766],"genre_scores_gemma":[0.9262555,0.0014336214,0.06454066,0.00012046615,0.0002819258,0.00009133502,0.00009867576,0.00009148218,0.0070864344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.0001284798,0.000018840685,0.000081579936,0.00014454799,0.000040399787],"domain_scores_gemma":[0.999257,0.0003689734,0.00009642937,0.00011610367,0.00013372744,0.00002759451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252075,0.000516387,0.0006266832,0.0004942123,0.00038260198,0.00092437107,0.0012601856,0.0005598283,0.0013599538],"category_scores_gemma":[0.0020952518,0.0002630863,0.00029021644,0.0006981795,0.0008408333,0.0013916648,0.00071295915,0.0006929513,0.00022971426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021592219,0.0001166715,0.00042487367,0.00024220126,0.000050405644,0.00014053166,0.00018858319,0.7107327,0.022217479,0.08155867,0.0043737674,0.17973824],"study_design_scores_gemma":[0.000014315554,0.00008539917,0.00019525427,0.0000063202924,0.000013409631,0.000047184352,0.00002974214,0.972913,0.0024123024,0.02265234,0.0016207839,0.000009967502],"about_ca_topic_score_codex":0.0011280817,"about_ca_topic_score_gemma":0.0018579988,"teacher_disagreement_score":0.0013599538,"about_ca_system_score_codex":0.00054663274,"about_ca_system_score_gemma":0.0003889735,"threshold_uncertainty_score":0.0045494437},"labels":[],"label_agreement":null},{"id":"W2896529804","doi":"10.1007/s12083-018-0687-4","title":"Toward citation recommender systems considering the article impact in the extended nearby citation network","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Citation; Computer science; Impact factor; Metadata; Bibliometrics; Similarity (geometry); Information retrieval; Recommender system; Citation impact; Data science; Empirical research; Baseline (sea); Data mining; World Wide Web; Artificial intelligence; Statistics; Mathematics","score_opus":0.0670989261935125,"score_gpt":0.3148766972970984,"score_spread":0.2477777711035859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896529804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21403031,0.00841737,0.766113,0.0026089654,0.00049803447,0.00014938576,0.00077160104,0.00048813314,0.006923194],"genre_scores_gemma":[0.90838975,0.0041546235,0.07750421,0.00027691707,0.0015148869,0.00013846638,0.0008348505,0.00009041261,0.007095969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831223,0.0006172648,0.00009911053,0.00049466005,0.00033281863,0.00014389656],"domain_scores_gemma":[0.9889737,0.007439677,0.0009161084,0.00054320914,0.0016863404,0.00044097845],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0032203423,0.0009450714,0.0022248568,0.0035149993,0.0012223427,0.0032874688,0.0029022265,0.0027860592,0.0017484516],"category_scores_gemma":[0.017990846,0.00079669914,0.001171957,0.0054910295,0.0007795328,0.004292889,0.0015343693,0.0017846606,0.0006760074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041214327,0.0005344776,0.030733135,0.0006438157,0.0009573132,0.0005654729,0.00065603515,0.70431894,0.0038711221,0.06400047,0.010249181,0.18305789],"study_design_scores_gemma":[0.00001032111,0.000028440183,0.0010979647,0.000017593571,0.000084503205,0.00004121414,0.00003427895,0.98540777,0.00018606216,0.012223073,0.00085133204,0.000017363776],"about_ca_topic_score_codex":0.011557649,"about_ca_topic_score_gemma":0.014788665,"teacher_disagreement_score":0.996485,"about_ca_system_score_codex":0.0011862963,"about_ca_system_score_gemma":0.0014474309,"threshold_uncertainty_score":0.02298075},"labels":[],"label_agreement":null},{"id":"W2896582760","doi":"10.1007/s12083-018-0691-8","title":"Secure, flexible and high-efficient similarity search over encrypted data in multiple clouds","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Encryption; Computer science; Similarity (geometry); Data mining; Information retrieval; Computer network; Artificial intelligence","score_opus":0.045437547255528864,"score_gpt":0.3103035509543397,"score_spread":0.26486600369881086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896582760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3373988,0.001254279,0.65586734,0.00076680654,0.00017907112,0.00024554977,0.00025257264,0.0008866299,0.0031489795],"genre_scores_gemma":[0.9417295,0.00019251241,0.05644133,0.000047755202,0.000045501805,0.00003650055,0.00013671968,0.000023427952,0.001346801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629563,0.0006098287,0.00036314226,0.00042285473,0.0017305565,0.00057792483],"domain_scores_gemma":[0.99558854,0.0013041275,0.0006064476,0.001536999,0.00072626583,0.00023767044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017652477,0.00043595358,0.0018812196,0.0010415824,0.0014577507,0.002319952,0.0019422049,0.0014233841,0.0010041767],"category_scores_gemma":[0.007033349,0.00053571747,0.00065804296,0.0022897949,0.0008890828,0.0051448923,0.0035471339,0.0010049333,0.00053948193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038101384,0.00071208656,0.007689322,0.0005288834,0.00039620075,0.0019119118,0.0007838613,0.47926384,0.08785422,0.08777164,0.008736611,0.32054123],"study_design_scores_gemma":[0.000074662195,0.00014202378,0.0006034568,0.000011284351,0.0000356321,0.00046382227,0.0002057824,0.96143216,0.015522625,0.020293092,0.0011900836,0.00002537193],"about_ca_topic_score_codex":0.0026711202,"about_ca_topic_score_gemma":0.0027035614,"teacher_disagreement_score":0.0026711202,"about_ca_system_score_codex":0.0012171129,"about_ca_system_score_gemma":0.002279786,"threshold_uncertainty_score":0.009335637},"labels":[],"label_agreement":null},{"id":"W2915400206","doi":"10.1007/s12083-019-00723-5","title":"Performance Modeling of Linux Network System with Open vSwitch","year":2019,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Operating system; Computer science","score_opus":0.017960956147394465,"score_gpt":0.24236119128147107,"score_spread":0.22440023513407661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915400206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9100051,0.0006806687,0.06285253,0.0005051424,0.00015655364,0.000090735055,0.00061130594,0.002427014,0.02267105],"genre_scores_gemma":[0.9974349,0.00006136871,0.0007598569,0.000016999758,0.000008381993,0.000011759082,0.000085206644,0.000038062604,0.0015835584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931633,0.00013586745,0.000021530592,0.00012368537,0.00018241619,0.00022021878],"domain_scores_gemma":[0.99921656,0.0003025374,0.00008080364,0.000058469388,0.0002777791,0.000063869265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000437035,0.00069698686,0.000519219,0.00072457537,0.00062901026,0.0008602828,0.0010968811,0.0006356933,0.0039007377],"category_scores_gemma":[0.0013876052,0.00018289895,0.0004494735,0.0005376742,0.00045192902,0.0010501947,0.00036116852,0.00044591667,0.0004806604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003444053,0.00008509626,0.0026138679,0.00007573477,0.000028548619,0.00014797677,0.00011248873,0.98008007,0.0046098214,0.0034591372,0.0015260004,0.0069169877],"study_design_scores_gemma":[0.0000067274705,0.000056032994,0.00043738267,0.000002384335,0.000007926406,0.00001477541,0.000017908416,0.99782616,0.0011415131,0.0003000316,0.00018356819,0.000005503415],"about_ca_topic_score_codex":0.016541576,"about_ca_topic_score_gemma":0.0049913432,"teacher_disagreement_score":0.016541576,"about_ca_system_score_codex":0.0013985297,"about_ca_system_score_gemma":0.00069996965,"threshold_uncertainty_score":0.03289056},"labels":[],"label_agreement":null},{"id":"W2957998068","doi":"10.1007/s12083-019-00787-3","title":"Secure and reliable certification management scheme for large-scale MANETs based on a distributed anonymous authority","year":2019,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Compromise; Certification; Computer security; Computer science; Adversary; Certificate authority; Scheme (mathematics); Service (business); Computer network; Distributed computing; Business; Public-key cryptography; Mathematics; Law; Encryption","score_opus":0.01237803639514889,"score_gpt":0.2541564328483454,"score_spread":0.2417783964531965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957998068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15078358,0.0008928375,0.8374445,0.0007497383,0.00054492994,0.00040671197,0.00014018589,0.0023724898,0.006665024],"genre_scores_gemma":[0.9489147,0.00020422663,0.047354788,0.00006837083,0.00010219861,0.00011572427,0.00011176809,0.000034720295,0.0030936082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984428,0.0003291932,0.00014625507,0.00030880753,0.0005774926,0.00019536704],"domain_scores_gemma":[0.9972819,0.00040011056,0.00034380044,0.0009947859,0.00073990395,0.00023942489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001507839,0.00035982925,0.0009203372,0.0009748775,0.0020934378,0.0012463933,0.0016298983,0.00097188255,0.0013422851],"category_scores_gemma":[0.002772265,0.00027922,0.00044279214,0.0007255542,0.0010761726,0.0024894017,0.0026127521,0.0011599101,0.00047843409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024325703,0.0007276401,0.0070426734,0.0005989244,0.00033816294,0.0020739187,0.0017372997,0.17651533,0.15766637,0.28635553,0.01813269,0.34637895],"study_design_scores_gemma":[0.00044524152,0.00075572036,0.001931475,0.00005195732,0.0002658727,0.0014094567,0.00030123588,0.89239174,0.03382899,0.047858752,0.020514203,0.00024534087],"about_ca_topic_score_codex":0.0011240387,"about_ca_topic_score_gemma":0.0011123297,"teacher_disagreement_score":0.0020934378,"about_ca_system_score_codex":0.0008656601,"about_ca_system_score_gemma":0.0022273678,"threshold_uncertainty_score":0.007974267},"labels":[],"label_agreement":null},{"id":"W2971237353","doi":"10.1007/s12083-019-00810-7","title":"Achieve privacy-preserving simplicial depth query over collaborative cloud servers","year":2019,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Server; Cloud computing; Computer science; Dimension (graph theory); Scheme (mathematics); Computation; Ranking (information retrieval); Theoretical computer science; Distributed computing; Data mining; Algorithm; Information retrieval; Mathematics; Computer network; Operating system","score_opus":0.017803468787311042,"score_gpt":0.2844530543463833,"score_spread":0.26664958555907226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971237353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09039861,0.00050582935,0.8992073,0.0011183915,0.00008355539,0.0002532358,0.0007071591,0.0020391778,0.0056866473],"genre_scores_gemma":[0.8471652,0.00028791183,0.14718834,0.00038026605,0.000070478156,0.00010865207,0.0007527075,0.00017629683,0.0038701154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958729,0.00059887965,0.00023091643,0.0006224597,0.0018168961,0.0008580167],"domain_scores_gemma":[0.99564457,0.0013305247,0.00031749211,0.0018264573,0.0005787238,0.00030225297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021955182,0.0009890156,0.0024924525,0.0010251396,0.0019615046,0.0034332552,0.0027843865,0.0021462261,0.0032051527],"category_scores_gemma":[0.0071389186,0.0005412506,0.0011824623,0.002304749,0.0018410586,0.007069122,0.010506264,0.002399432,0.0008537901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021047941,0.00051880564,0.0038853455,0.0007891864,0.00028220413,0.000566186,0.0014057597,0.3135637,0.049700636,0.4408829,0.017352799,0.16894771],"study_design_scores_gemma":[0.00009642373,0.00012009035,0.00032883004,0.000019415214,0.000045847573,0.00017279376,0.00029639978,0.79822385,0.012734247,0.18486391,0.003064923,0.00003324922],"about_ca_topic_score_codex":0.0028310432,"about_ca_topic_score_gemma":0.0040156124,"teacher_disagreement_score":0.0034332552,"about_ca_system_score_codex":0.0016660279,"about_ca_system_score_gemma":0.0025141586,"threshold_uncertainty_score":0.012087882},"labels":[],"label_agreement":null},{"id":"W3000787661","doi":"10.1007/s12083-019-00850-z","title":"Performance analysis of Hyperledger Fabric platform: A hierarchical model approach","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Timeout; Computer science; Database transaction; Block (permutation group theory); Transaction processing; Throughput; Process (computing); Distributed computing; Reliability engineering; Computer network; Database; Operating system; Engineering; Mathematics","score_opus":0.030919440027697077,"score_gpt":0.2527427510911708,"score_spread":0.2218233110634737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000787661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6744061,0.00074624986,0.2932064,0.0008091791,0.00006277965,0.00015747246,0.00057104696,0.0010186291,0.029022133],"genre_scores_gemma":[0.9924219,0.000104688355,0.005387754,0.000018737948,0.000008638634,0.000030333616,0.000102756945,0.000026214178,0.0018990685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990544,0.000268358,0.000026806323,0.000120137025,0.00025278638,0.00027745074],"domain_scores_gemma":[0.99884677,0.00057433924,0.0001389124,0.00013293787,0.00024980583,0.000057187754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413449,0.0005625777,0.0005930196,0.0008914881,0.00050201145,0.0013119496,0.0011786479,0.00067368406,0.0050350195],"category_scores_gemma":[0.0021553268,0.00024787936,0.0007165393,0.00084001647,0.00036849303,0.0017366309,0.0005228736,0.0006632159,0.0004279883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020459447,0.00010952302,0.002013724,0.00008311691,0.000048286205,0.00008753439,0.00007201646,0.9533948,0.0043025804,0.02497096,0.0011931596,0.013519769],"study_design_scores_gemma":[0.000002160418,0.000033158456,0.00025723953,0.0000019714757,0.000007270892,0.000007634311,0.0000132333325,0.99759126,0.00057803304,0.0014117265,0.00009358444,0.0000028378504],"about_ca_topic_score_codex":0.007238587,"about_ca_topic_score_gemma":0.004870594,"teacher_disagreement_score":0.007238587,"about_ca_system_score_codex":0.0017831307,"about_ca_system_score_gemma":0.0013889029,"threshold_uncertainty_score":0.016843796},"labels":[],"label_agreement":null},{"id":"W3022244822","doi":"10.1007/s12083-019-00869-2","title":"Adaptive privacy-preserving federated learning","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Homomorphic encryption; Computer science; Differential privacy; Encryption; Overhead (engineering); Obfuscation; The Internet; Noise (video); Relevance (law); Computation; Computer security; Artificial intelligence; Image (mathematics); Machine learning; Theoretical computer science; Data mining; Algorithm; World Wide Web","score_opus":0.044454744908335064,"score_gpt":0.280935515898559,"score_spread":0.2364807709902239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022244822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350787,0.0001453841,0.9629606,0.00029561555,0.000057619345,0.000059278027,0.00013738133,0.0011727166,0.0016634536],"genre_scores_gemma":[0.90972066,0.000097382595,0.086808085,0.0001449269,0.000058264377,0.000073340816,0.00018706349,0.000071660186,0.0028386584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530977,0.0013149838,0.00023757193,0.0011244435,0.0012833212,0.00073000544],"domain_scores_gemma":[0.98608714,0.00538661,0.0007339688,0.0059204246,0.0014330258,0.00043876708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004485188,0.00076953706,0.0019166332,0.0008358087,0.0015354004,0.0023790798,0.003791342,0.0018845837,0.0019942096],"category_scores_gemma":[0.015889233,0.00045051737,0.0008208339,0.0014561227,0.0018176751,0.0050376384,0.0044656824,0.0024061222,0.00065380154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017430799,0.0006609168,0.0030907216,0.00015025835,0.00018388123,0.00026882018,0.00037129942,0.60470366,0.008666044,0.10415002,0.0065483763,0.26946294],"study_design_scores_gemma":[0.000033696168,0.0000641473,0.00016888866,0.0000068282066,0.000013212219,0.00009872687,0.00003526075,0.9325105,0.0037294421,0.06256138,0.0007655124,0.000012414157],"about_ca_topic_score_codex":0.0013085391,"about_ca_topic_score_gemma":0.0011701677,"teacher_disagreement_score":0.004485188,"about_ca_system_score_codex":0.0015430718,"about_ca_system_score_gemma":0.0022342168,"threshold_uncertainty_score":0.023720264},"labels":[],"label_agreement":null},{"id":"W3022303172","doi":"10.1007/s12083-019-00832-1","title":"Toward efficient and effective bullying detection in online social network","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Popularity; The Internet; Data mining; Harm; Categorization; Social media; Scheme (mathematics); Social network (sociolinguistics); Machine learning; Artificial intelligence; World Wide Web","score_opus":0.019685359894035227,"score_gpt":0.25688717547589324,"score_spread":0.23720181558185802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022303172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22956893,0.0011365035,0.75795823,0.0013884216,0.00014432639,0.0006056189,0.0005446769,0.0041242787,0.0045289667],"genre_scores_gemma":[0.7542835,0.00036527583,0.24129975,0.00019341851,0.00012500118,0.00021207283,0.00052248925,0.00004116339,0.0029572619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814236,0.000686087,0.00007270397,0.00029197862,0.00063368224,0.0001731527],"domain_scores_gemma":[0.9968136,0.0014580317,0.0003127492,0.00035872502,0.0008754379,0.00018152983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016662389,0.0007178406,0.00088936667,0.0019878366,0.0006618876,0.0015126257,0.0012535648,0.001231905,0.00082460354],"category_scores_gemma":[0.0062385686,0.0003166717,0.00029405864,0.00074544514,0.00033691796,0.0017691077,0.0016243568,0.0010452579,0.0008060079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000319086,0.002415471,0.048462853,0.0002976,0.00017626912,0.00022099909,0.00044293518,0.041960485,0.056147967,0.005660953,0.01071236,0.83318305],"study_design_scores_gemma":[0.000016222973,0.00019494981,0.009168301,0.000016531429,0.000039504754,0.00018639781,0.00037594442,0.96888036,0.014498871,0.0048157102,0.0017863892,0.000020848955],"about_ca_topic_score_codex":0.003963354,"about_ca_topic_score_gemma":0.0056935493,"teacher_disagreement_score":0.003963354,"about_ca_system_score_codex":0.00038239814,"about_ca_system_score_gemma":0.0011769056,"threshold_uncertainty_score":0.00881201},"labels":[],"label_agreement":null},{"id":"W3035674285","doi":"10.1007/s12083-020-00922-5","title":"Security and privacy of machine learning assisted P2P networks","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"University of Waterloo; Ministry of Industry and Information Technology of the People's Republic of China; University of Electronic Science and Technology of China; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Internet privacy; Computer security","score_opus":0.03134133320113444,"score_gpt":0.27585303875896744,"score_spread":0.244511705557833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035674285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13312079,0.0018928928,0.838332,0.009629826,0.00024940688,0.00014781138,0.0005396408,0.0007212575,0.01536637],"genre_scores_gemma":[0.975962,0.00048503288,0.020118514,0.00024609963,0.0001431698,0.00006354648,0.000113280934,0.000040174047,0.0028280534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9916973,0.0035592173,0.00038631127,0.0010666493,0.0025094794,0.0007809718],"domain_scores_gemma":[0.9685697,0.020724567,0.002175362,0.0066109467,0.0014798549,0.00043953687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006025075,0.0005572942,0.0012408934,0.00086395105,0.0021046274,0.0058220983,0.00197449,0.0028268478,0.0015256978],"category_scores_gemma":[0.025955157,0.000659891,0.000605147,0.0012950875,0.004108464,0.00854154,0.0032041492,0.0030362844,0.00049091],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082838896,0.00014593099,0.0022882265,0.00020494957,0.00009090454,0.00043957413,0.00059364666,0.23897,0.005374423,0.6837301,0.004809609,0.06252429],"study_design_scores_gemma":[0.000028873945,0.000042716325,0.00024211088,0.000020953239,0.000015267537,0.00018594116,0.00008734873,0.59257364,0.0032440808,0.40120685,0.0023337242,0.000018561896],"about_ca_topic_score_codex":0.0011330983,"about_ca_topic_score_gemma":0.00052782265,"teacher_disagreement_score":0.006025075,"about_ca_system_score_codex":0.0021345841,"about_ca_system_score_gemma":0.0025496534,"threshold_uncertainty_score":0.031864047},"labels":[],"label_agreement":null},{"id":"W3037670343","doi":"10.1007/s12083-020-00953-y","title":"An analytical model for churn process in Bitcoin network with ordinary and relay nodes","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Relay; Node (physics); Computer science; Computer network; Block (permutation group theory); Markov chain; Database transaction; Markov process; Distributed computing; Mathematics; Engineering","score_opus":0.026222623108315347,"score_gpt":0.29272832353568445,"score_spread":0.2665057004273691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037670343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12654226,0.00255752,0.81532353,0.0029118615,0.00026109436,0.00022062408,0.00044679677,0.0004598981,0.051276457],"genre_scores_gemma":[0.9598611,0.0013324589,0.013990357,0.00016893561,0.00011957539,0.00013963324,0.0001391463,0.00008177182,0.024167145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993924,0.00019376587,0.000019338326,0.00010782278,0.00014288707,0.00014392167],"domain_scores_gemma":[0.9983119,0.0010043287,0.00018720486,0.00007194788,0.00032536185,0.000099340636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012068264,0.00066696445,0.0011715156,0.0012076809,0.0011915783,0.0019681193,0.0024934453,0.002516707,0.004768284],"category_scores_gemma":[0.0042962125,0.000638431,0.00073350297,0.001451135,0.001591654,0.0035011903,0.0010636066,0.0016384809,0.00069215934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007999254,0.00006169119,0.0011190462,0.0001351476,0.000023697472,0.00043281747,0.00042857107,0.6877506,0.0019579898,0.299636,0.0025521345,0.0058223237],"study_design_scores_gemma":[0.0000037565665,0.000007392905,0.0000670571,0.000007951856,0.000005879518,0.000040626906,0.000028038034,0.984539,0.000079135425,0.0148870265,0.00032832733,0.0000057287352],"about_ca_topic_score_codex":0.010371602,"about_ca_topic_score_gemma":0.005350181,"teacher_disagreement_score":0.010371602,"about_ca_system_score_codex":0.0025454657,"about_ca_system_score_gemma":0.0014437085,"threshold_uncertainty_score":0.020622432},"labels":[],"label_agreement":null},{"id":"W3044914719","doi":"10.1007/s12083-020-00968-5","title":"Performance analysis of heterogeneous cloud-edge services: A modeling approach","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Enhanced Data Rates for GSM Evolution; Workload; Service (business); Distributed computing; Edge computing; Constraint (computer-aided design); Artificial intelligence; Engineering","score_opus":0.03176326347753247,"score_gpt":0.2497865763493914,"score_spread":0.21802331287185892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044914719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19279572,0.0021582698,0.7635141,0.002231551,0.00022499339,0.0003011333,0.0005552249,0.0007314002,0.03748762],"genre_scores_gemma":[0.9772675,0.0008115468,0.016296996,0.00012681865,0.000121445766,0.00010160983,0.00013596095,0.00008915942,0.0050491127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998801,0.00035626316,0.000037474965,0.00016362572,0.0003330403,0.000308587],"domain_scores_gemma":[0.99865973,0.00074546086,0.0001700719,0.00008554362,0.00026044322,0.00007860683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015789324,0.0013669945,0.0013500089,0.000921827,0.00070487167,0.0022664529,0.0020440815,0.0014204849,0.0023345316],"category_scores_gemma":[0.0036682733,0.00058540376,0.0010950295,0.0011947453,0.0006626529,0.0023551323,0.00089991273,0.0010358671,0.00050195097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002876116,0.000048546797,0.00043311025,0.00003210703,0.000029853669,0.00005989037,0.000029316425,0.97765344,0.0013587391,0.015676262,0.00064065796,0.004009343],"study_design_scores_gemma":[0.000001217889,0.0000088290335,0.00006897078,0.0000017152448,0.0000059857534,0.000008128902,0.0000062912404,0.9984977,0.000102359554,0.0011786672,0.000118006166,0.000002096963],"about_ca_topic_score_codex":0.012768201,"about_ca_topic_score_gemma":0.005331477,"teacher_disagreement_score":0.012768201,"about_ca_system_score_codex":0.0029146662,"about_ca_system_score_gemma":0.0018702263,"threshold_uncertainty_score":0.025387764},"labels":[],"label_agreement":null},{"id":"W3107178473","doi":"10.1007/s12083-020-01007-z","title":"A lightweight multi-party authentication in insecure reader-server channel in RFID-based IoT","year":2020,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"RFID technology advancements","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Government of Canada","funders":"","keywords":"Authentication protocol; Computer science; Authentication (law); Internet of Things; Radio-frequency identification; Computer security; Authentication server; Focus (optics); Lightweight Extensible Authentication Protocol; Computer network; Mutual authentication; Protocol (science); Chip Authentication Program; Identification (biology); Challenge–response authentication","score_opus":0.02730207909898631,"score_gpt":0.25836616586740396,"score_spread":0.23106408676841766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107178473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04480972,0.0007486781,0.94694525,0.0002410481,0.00040497983,0.0001592102,0.000048858208,0.0023856198,0.0042566694],"genre_scores_gemma":[0.9230096,0.00028994476,0.071210496,0.00011952718,0.00016062145,0.00008350082,0.00008658774,0.000072697825,0.004967076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965078,0.00083490927,0.00029701405,0.0005405763,0.0012381041,0.00058164453],"domain_scores_gemma":[0.99756634,0.0004795785,0.00019061129,0.001090354,0.0005453259,0.00012779744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015296006,0.0005300238,0.0012960612,0.0005508053,0.001674004,0.0017684586,0.002156874,0.001570271,0.0025952947],"category_scores_gemma":[0.002622819,0.00044238335,0.0007302559,0.00059481035,0.0009554921,0.0040186364,0.0039004155,0.0016535525,0.0014859282],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004660225,0.00061016297,0.0057824827,0.00095798966,0.0003521727,0.0037283986,0.0012187496,0.08550004,0.271349,0.17475076,0.01485992,0.43623006],"study_design_scores_gemma":[0.00008371964,0.000636546,0.0013134266,0.00005669684,0.00018638233,0.002435384,0.0002598868,0.893794,0.06298996,0.025762348,0.01234062,0.00014104703],"about_ca_topic_score_codex":0.0006053007,"about_ca_topic_score_gemma":0.00047955452,"teacher_disagreement_score":0.0025952947,"about_ca_system_score_codex":0.00062202924,"about_ca_system_score_gemma":0.0010448308,"threshold_uncertainty_score":0.008682191},"labels":[],"label_agreement":null},{"id":"W3128426930","doi":"10.1007/s12083-021-01084-8","title":"Cost-effective migration-based dynamic platform defense technique: a CTMDP approach","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Markov decision process; Sophistication; Computer science; Cyberspace; Service (business); Process (computing); Computer security; Operations research; Markov process; Distributed computing; Mathematical optimization; Engineering; Economics; The Internet","score_opus":0.02082296498399807,"score_gpt":0.2756636008946176,"score_spread":0.25484063591061956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128426930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022659183,0.00063088775,0.968234,0.00051491795,0.00018977483,0.00017575908,0.000048520473,0.0008653806,0.0066816225],"genre_scores_gemma":[0.6439402,0.0005258499,0.34649345,0.00024813224,0.00012614313,0.00012607928,0.00012929608,0.00010199856,0.008308787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995152,0.00007361111,0.000022973347,0.00008061286,0.00022463645,0.00008302731],"domain_scores_gemma":[0.9993298,0.00016223133,0.00007564285,0.00015966073,0.00022137165,0.000051336494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037897917,0.0006195094,0.00068686885,0.0009782168,0.0009911007,0.0008590512,0.0018210356,0.0007493847,0.002154687],"category_scores_gemma":[0.0010975584,0.0002017105,0.00044066974,0.00087005895,0.00037836062,0.0012943915,0.0012735025,0.0010600807,0.00041410248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003313986,0.00048025572,0.001489502,0.00032446475,0.0001430378,0.0005489028,0.0001582454,0.14606221,0.11242518,0.047841024,0.011925838,0.67826986],"study_design_scores_gemma":[0.000028426868,0.00019124588,0.0005906832,0.000019490863,0.00006946412,0.0006098757,0.00012344962,0.96509206,0.014819316,0.011323124,0.0071064094,0.000026475436],"about_ca_topic_score_codex":0.0018095358,"about_ca_topic_score_gemma":0.0027497357,"teacher_disagreement_score":0.002154687,"about_ca_system_score_codex":0.0005460121,"about_ca_system_score_gemma":0.0012154783,"threshold_uncertainty_score":0.007208109},"labels":[],"label_agreement":null},{"id":"W3136302944","doi":"10.1007/s12083-021-01091-9","title":"Obfuscation of images via differential privacy: From facial images to general images","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Face recognition and analysis","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Obfuscation; Computer science; Differential privacy; Context (archaeology); Anonymity; Artificial intelligence; Pixel; Face (sociological concept); Noise (video); Generative grammar; Generative model; Machine learning; Image (mathematics); Computer vision; Computer security; Data mining","score_opus":0.014308854766899274,"score_gpt":0.26452120018150027,"score_spread":0.250212345414601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136302944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20771882,0.0012030856,0.7812776,0.0014370296,0.00020009458,0.00007462762,0.0002453198,0.0010625216,0.00678094],"genre_scores_gemma":[0.93347305,0.00060307514,0.061644565,0.00024074616,0.00011308753,0.00003581636,0.00016420045,0.00005633619,0.003669199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893576,0.0002249119,0.00003817,0.00018525464,0.00038907642,0.00022681429],"domain_scores_gemma":[0.99804235,0.0007208898,0.00014310752,0.0008907014,0.00015140702,0.0000514592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008697116,0.00049293664,0.00079897465,0.00038366832,0.0004348404,0.0007098094,0.0007578286,0.0009914672,0.0014834971],"category_scores_gemma":[0.004383697,0.00032070192,0.00054554874,0.0005349174,0.0012531839,0.0019661728,0.0027917682,0.0014567107,0.00045921485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017390465,0.0002958974,0.0033530656,0.00030408055,0.00018586102,0.0017491187,0.0008449591,0.133349,0.09712096,0.14680532,0.0102536995,0.603999],"study_design_scores_gemma":[0.000057550493,0.00021811094,0.0023318522,0.000049038026,0.0000690677,0.0014648025,0.00020013955,0.7784697,0.074626796,0.13720952,0.005260323,0.000043029973],"about_ca_topic_score_codex":0.0009805332,"about_ca_topic_score_gemma":0.00085153675,"teacher_disagreement_score":0.0014834971,"about_ca_system_score_codex":0.00043718435,"about_ca_system_score_gemma":0.00042840873,"threshold_uncertainty_score":0.004962802},"labels":[],"label_agreement":null},{"id":"W3154438993","doi":"10.1007/s12083-021-01124-3","title":"Energy efficient data correlation aware opportunistic routing protocol for wireless sensor networks","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Wireless sensor network; Computer science; Computer network; Key distribution in wireless sensor networks; Greedy algorithm; Routing protocol; Mobile wireless sensor network; Redundancy (engineering); Data redundancy; Geographic routing; Distributed computing; Wireless Routing Protocol; Routing (electronic design automation); Real-time computing; Wireless network; Wireless; Algorithm","score_opus":0.0514808255914984,"score_gpt":0.3148267537958876,"score_spread":0.2633459282043892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154438993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06802288,0.0040568593,0.91762275,0.000788397,0.00044757428,0.00024415925,0.00029238092,0.0013192423,0.0072056833],"genre_scores_gemma":[0.88986075,0.0014572163,0.101344995,0.00026963695,0.00011573265,0.00023614119,0.0003410311,0.00006966774,0.0063047395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.000092039685,0.000034242013,0.000050090817,0.00019788531,0.00005326549],"domain_scores_gemma":[0.9988493,0.000534995,0.0001452397,0.00012396474,0.0002989541,0.000047548263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007181851,0.00035186068,0.00047416176,0.00065481645,0.00071809546,0.0005917007,0.00088137644,0.00039963174,0.0005101271],"category_scores_gemma":[0.0017548943,0.00023663616,0.00019587835,0.0008127619,0.0003343602,0.00075361383,0.0008445792,0.00060798,0.00013179933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009654442,0.00050459726,0.004241807,0.00073257677,0.0002815952,0.0012433584,0.0004899328,0.34604338,0.111480735,0.08041829,0.024350956,0.42924738],"study_design_scores_gemma":[0.000054850556,0.00025440886,0.0013599868,0.000038693088,0.00010676049,0.00082518614,0.00010346338,0.9415977,0.025621211,0.015406284,0.01457957,0.00005192334],"about_ca_topic_score_codex":0.001426459,"about_ca_topic_score_gemma":0.003957621,"teacher_disagreement_score":0.001426459,"about_ca_system_score_codex":0.00049783284,"about_ca_system_score_gemma":0.0011270844,"threshold_uncertainty_score":0.0037981868},"labels":[],"label_agreement":null},{"id":"W3161645673","doi":"10.1007/s12083-021-01164-9","title":"Trust and scalable blockchain-based message exchanging scheme on VANET","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Vehicular ad hoc network; Scalability; Computer network; Wireless ad hoc network; Overhead (engineering); Blockchain; Computer security; Distributed computing; Database; Telecommunications; Wireless","score_opus":0.009932272159633892,"score_gpt":0.22733360209158096,"score_spread":0.21740132993194708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161645673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17571254,0.00071085256,0.8105409,0.0008741418,0.00033685972,0.0004111346,0.00037262586,0.0013736944,0.00966729],"genre_scores_gemma":[0.96148914,0.00018699038,0.033656828,0.000055982477,0.000036955327,0.00009039764,0.00023927819,0.000021016886,0.004223457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875283,0.00025915384,0.00009583134,0.00021351452,0.0004868569,0.00019183065],"domain_scores_gemma":[0.99846786,0.00042865673,0.00013512166,0.0003632776,0.0004564751,0.00014858069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010333986,0.0004312632,0.0011261775,0.0005966537,0.0013646348,0.0008615846,0.001668304,0.0008520197,0.0020694456],"category_scores_gemma":[0.002312601,0.0002852385,0.00033673778,0.0009959969,0.00063163374,0.0022297555,0.0021837458,0.0008271892,0.0003380666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021927184,0.00050816947,0.0034843439,0.00038071064,0.00017385453,0.0010680797,0.0007693474,0.58815897,0.046675272,0.10475932,0.012482571,0.2393467],"study_design_scores_gemma":[0.000085419066,0.0001919934,0.00028342655,0.000007762434,0.00002767249,0.00015271267,0.00007473062,0.98010445,0.0046082414,0.012056794,0.0023791292,0.000027661988],"about_ca_topic_score_codex":0.00491955,"about_ca_topic_score_gemma":0.004439361,"teacher_disagreement_score":0.00491955,"about_ca_system_score_codex":0.00093808834,"about_ca_system_score_gemma":0.0020427492,"threshold_uncertainty_score":0.009781837},"labels":[],"label_agreement":null},{"id":"W3165561456","doi":"10.1007/s12083-021-01179-2","title":"Efficient and privacy-preserving range-max query in fog-based agricultural IoT","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Homomorphic encryption; Node (physics); Edge computing; Database; Agriculture; Encryption; Internet of Things; Distributed computing; Computer security; Engineering","score_opus":0.015374023816923606,"score_gpt":0.25350430905466764,"score_spread":0.23813028523774404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165561456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14323848,0.0015004309,0.8483603,0.0004288275,0.0001762491,0.00017331287,0.0005169387,0.0010530736,0.0045522726],"genre_scores_gemma":[0.93638253,0.00034270115,0.061091077,0.00013104868,0.000053092714,0.00004513184,0.00036308213,0.00003412974,0.0015571956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990465,0.0001235102,0.000057546848,0.00023636162,0.00034064517,0.00019543836],"domain_scores_gemma":[0.9994375,0.00020216296,0.000055190907,0.00018340457,0.000089760026,0.000032058168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007576232,0.00049446087,0.0014275034,0.0003460896,0.0008643957,0.0012101411,0.0018045505,0.00090353715,0.0006770284],"category_scores_gemma":[0.0012601843,0.00029205868,0.00052653253,0.0009960172,0.000583509,0.0022832376,0.0016365921,0.000609888,0.00022100616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029044298,0.00057521096,0.007172132,0.000602048,0.0002719187,0.0016729402,0.0010014809,0.43171963,0.17274123,0.04635881,0.016414758,0.3185654],"study_design_scores_gemma":[0.000030782496,0.0001394317,0.00094548543,0.000008057118,0.000043010554,0.00039279732,0.00026564643,0.97232246,0.012567219,0.010638222,0.0026209336,0.000025927293],"about_ca_topic_score_codex":0.0025658451,"about_ca_topic_score_gemma":0.0030027453,"teacher_disagreement_score":0.0025658451,"about_ca_system_score_codex":0.0005350686,"about_ca_system_score_gemma":0.0009235229,"threshold_uncertainty_score":0.0051018596},"labels":[],"label_agreement":null},{"id":"W3165673144","doi":"10.1007/s12083-021-01120-7","title":"MASK: Efficient and privacy-preserving m-tree based biometric identification over cloud","year":2021,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Biometrics; Computer science; Identification (biology); Homomorphic encryption; Cloud computing; Computer security; Service provider; Tree (set theory); Encryption; Server; Information privacy; Data mining; Service (business); Computer network","score_opus":0.02137866558049927,"score_gpt":0.2765908388230916,"score_spread":0.2552121732425923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165673144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12978366,0.0013381381,0.8504297,0.0005599368,0.00028856602,0.00026730174,0.0011747092,0.009707418,0.006450579],"genre_scores_gemma":[0.78705215,0.00037385893,0.2046938,0.00020935437,0.00006804011,0.00009126315,0.0009080264,0.00012727008,0.0064762686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933547,0.00007855408,0.000032323467,0.00010347328,0.00029214454,0.0001581393],"domain_scores_gemma":[0.9994235,0.00010332166,0.00005945549,0.00025151053,0.00010823113,0.00005400366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036434058,0.00039416115,0.0010843808,0.0005715875,0.001061306,0.0009625729,0.0013654837,0.0008075832,0.00278786],"category_scores_gemma":[0.0013058952,0.00022893018,0.00037080544,0.0010856562,0.00036206763,0.0018990356,0.0023906948,0.0005570527,0.0012433591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038525667,0.00052368105,0.0036462224,0.00037327735,0.00013453129,0.0011716275,0.00029353722,0.044740204,0.18235709,0.03568478,0.042126838,0.68509555],"study_design_scores_gemma":[0.00011612029,0.00044063723,0.0022734317,0.000032927746,0.000049457652,0.0016404949,0.00018941869,0.888617,0.073839195,0.01611927,0.016609095,0.00007296503],"about_ca_topic_score_codex":0.0026077775,"about_ca_topic_score_gemma":0.0033960606,"teacher_disagreement_score":0.00278786,"about_ca_system_score_codex":0.00064831116,"about_ca_system_score_gemma":0.0012842512,"threshold_uncertainty_score":0.009326339},"labels":[],"label_agreement":null},{"id":"W4205605778","doi":"10.1007/s12083-021-01285-1","title":"Understanding MEC empowered vehicle task offloading performance in 6G networks","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Provisioning; Quality of service; Scalability; Latency (audio); Cloud computing; Server; Task (project management); Metric (unit); Quality of experience; Distributed computing; Service (business); Orchestration; Service quality; Computer network; Real-time computing; Engineering; Telecommunications","score_opus":0.04698504848601006,"score_gpt":0.25626864527522913,"score_spread":0.20928359678921907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205605778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8761586,0.0006143144,0.09000812,0.0007124772,0.00014527501,0.000040952516,0.00032586098,0.00045449278,0.031539895],"genre_scores_gemma":[0.9979095,0.00006912698,0.0009714115,0.000019609242,0.000009565107,0.0000033712472,0.000037222777,0.000009594488,0.00097058463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997631,0.00003080736,0.0000039901256,0.00004261495,0.000060647817,0.00009890515],"domain_scores_gemma":[0.99961424,0.00017969697,0.000028873732,0.000030830754,0.00011345695,0.000032929587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031121433,0.0003340817,0.00026552533,0.00024322706,0.000284525,0.00090915174,0.00037792817,0.00042634358,0.00243475],"category_scores_gemma":[0.0014491818,0.00010936124,0.00008510488,0.00026633282,0.00027408623,0.0010989399,0.00045301186,0.00040607748,0.0004675457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068803167,0.0002485456,0.01643022,0.00016400374,0.00005468702,0.00048526452,0.00049736927,0.7622128,0.076715216,0.034844134,0.003944887,0.10371472],"study_design_scores_gemma":[0.000004126457,0.000088557645,0.0055091255,0.000011513115,0.000012371127,0.00006735248,0.00024330083,0.9783668,0.0053675673,0.008606803,0.0017095413,0.0000129230075],"about_ca_topic_score_codex":0.0047190343,"about_ca_topic_score_gemma":0.0060006683,"teacher_disagreement_score":0.0047190343,"about_ca_system_score_codex":0.0005466463,"about_ca_system_score_gemma":0.00042372418,"threshold_uncertainty_score":0.009383142},"labels":[],"label_agreement":null},{"id":"W4205836301","doi":"10.1007/s12083-021-01283-3","title":"Joint pricing and task allocation for blockchain empowered crowd spectrum sensing","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Key Research and Development Program of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Task (project management); Scheme (mathematics); Nash equilibrium; Constraint (computer-aided design); Distributed computing; Computer security; Mathematical optimization","score_opus":0.016418155839810846,"score_gpt":0.24611919425849743,"score_spread":0.22970103841868658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205836301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18168467,0.0005308368,0.80346036,0.0011069974,0.00026319912,0.00032676006,0.00026659027,0.0007818945,0.011578729],"genre_scores_gemma":[0.98036194,0.000064395244,0.016742058,0.000047575995,0.000027055428,0.000057454796,0.000050543153,0.000025947042,0.0026230048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839467,0.00042147134,0.00006112645,0.0002814497,0.00042028126,0.00042092544],"domain_scores_gemma":[0.99619615,0.0023311689,0.00020545721,0.0004216657,0.00044189722,0.00040365796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023371375,0.0005872703,0.0015654505,0.0005516686,0.0012210715,0.0019083414,0.0017590859,0.0016590601,0.0070571927],"category_scores_gemma":[0.007768141,0.00044676953,0.00034992764,0.00084726093,0.0011052907,0.0024251242,0.0027791285,0.0012263661,0.0005742999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009930062,0.00042981814,0.0016262152,0.00015513731,0.000056490582,0.0003234419,0.00030061824,0.8493678,0.007936682,0.049352378,0.0037426017,0.08571577],"study_design_scores_gemma":[0.000017971508,0.000028698896,0.000081763195,0.0000036310214,0.0000036047581,0.000018157116,0.000024263609,0.98598737,0.00042203863,0.013047231,0.00035904633,0.0000061897604],"about_ca_topic_score_codex":0.0043880683,"about_ca_topic_score_gemma":0.0058867447,"teacher_disagreement_score":0.0070571927,"about_ca_system_score_codex":0.0010424019,"about_ca_system_score_gemma":0.0028333326,"threshold_uncertainty_score":0.023608625},"labels":[],"label_agreement":null},{"id":"W4206155494","doi":"10.1007/s12083-021-01278-0","title":"Reducing the number of transaction messages in bitcoin","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Database transaction; Computer science; Computer network; Transaction processing; Latency (audio); Reduction (mathematics); Multicast; Bandwidth (computing); Distributed transaction; Distributed computing; Computer security; Telecommunications; Database; Mathematics","score_opus":0.012780618399454088,"score_gpt":0.26624345189488374,"score_spread":0.25346283349542964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206155494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42789295,0.0015832111,0.53475493,0.0028897782,0.00054796244,0.0007304392,0.0002608329,0.007315327,0.02402445],"genre_scores_gemma":[0.9230251,0.00022523037,0.069464125,0.00021579246,0.000068206304,0.00016700469,0.00016999707,0.0003012131,0.006363374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936144,0.00230722,0.00030478652,0.0005977922,0.0022748688,0.0009009554],"domain_scores_gemma":[0.97560763,0.012138736,0.0016335826,0.0073118974,0.0025039883,0.0008041615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003594325,0.001145724,0.0016119473,0.0012470465,0.0023432863,0.002397473,0.0022729544,0.0018003903,0.007721259],"category_scores_gemma":[0.015222287,0.000625838,0.0004694969,0.0013204161,0.001556857,0.0064002876,0.0035224943,0.002359509,0.001576116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008215643,0.0022815715,0.008854962,0.0009201958,0.00016926111,0.0008861259,0.001325533,0.18611625,0.115455784,0.14839569,0.0146970665,0.51268196],"study_design_scores_gemma":[0.00035000622,0.00061205856,0.0016516782,0.000104868166,0.00010634765,0.0006086342,0.00051648356,0.8351577,0.072014585,0.078343734,0.010465581,0.00006833403],"about_ca_topic_score_codex":0.0013800148,"about_ca_topic_score_gemma":0.0022743337,"teacher_disagreement_score":0.007721259,"about_ca_system_score_codex":0.0013599292,"about_ca_system_score_gemma":0.0025254427,"threshold_uncertainty_score":0.02583015},"labels":[],"label_agreement":null},{"id":"W4244036065","doi":"10.1007/s12083-010-0071-5","title":"Editorial: Peer-to-peer networking and applications, volume 3, issue 2","year":2010,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Volume (thermodynamics); Peer-to-peer; Peer review; Computer science; World Wide Web; Political science; Physics","score_opus":0.00851742400309461,"score_gpt":0.26893828925758206,"score_spread":0.26042086525448743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244036065","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050937655,0.0045491443,0.00020838877,0.008327155,0.98460877,0.000031129337,0.000042449865,0.00012265425,0.0020593307],"genre_scores_gemma":[0.0006933064,0.006343867,0.00023052112,0.0089878095,0.95340335,0.000044805358,0.00008826877,0.000112795016,0.03009523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99518317,0.00057442713,0.00049944303,0.00064416096,0.0026989144,0.00039981227],"domain_scores_gemma":[0.9800669,0.0039051415,0.0013460063,0.000539002,0.010548473,0.0035944227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055642463,0.0065982896,0.008206142,0.0065730116,0.0035753457,0.010643856,0.0041240156,0.015105615,0.0356168],"category_scores_gemma":[0.0147957755,0.0019442822,0.0038186056,0.0024839102,0.002300015,0.0047240066,0.0017161065,0.01649509,0.03256266],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067074245,0.000029147717,0.00002353221,0.00023765942,0.000029634804,0.0001338522,0.0000035435435,0.000043477252,0.00013276385,0.00010714805,0.9916829,0.0075093275],"study_design_scores_gemma":[0.00018191857,0.000083109866,0.000538162,0.00033771552,0.0001308738,0.0006187963,0.000025268973,0.00061640766,0.00036037643,0.00067293737,0.99640024,0.000034153465],"about_ca_topic_score_codex":0.0011742108,"about_ca_topic_score_gemma":0.0036115455,"teacher_disagreement_score":0.0356168,"about_ca_system_score_codex":0.002751084,"about_ca_system_score_gemma":0.002385316,"threshold_uncertainty_score":0.11915004},"labels":[],"label_agreement":null},{"id":"W4285900278","doi":"10.1007/s12083-022-01353-0","title":"DHL: Deep reinforcement learning-based approach for emergency supply distribution in humanitarian logistics","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Humanitarian Logistics; Distribution (mathematics); Operations research; Emergency management; Resource (disambiguation); Business; Supply chain; Supply and demand; Computer science; Process (computing); Risk analysis (engineering); Resource distribution; Operations management; Resource allocation; Economics; Engineering; Industrial organization; Marketing; Economic growth; Microeconomics; Mathematics","score_opus":0.03062303755965068,"score_gpt":0.2562055703969894,"score_spread":0.2255825328373387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285900278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044214584,0.0011902399,0.94393724,0.0008788427,0.00028415894,0.000110968576,0.00042547975,0.0042864205,0.0046720724],"genre_scores_gemma":[0.8281101,0.00031720125,0.15897505,0.0006448008,0.00012749272,0.00017770992,0.0007857772,0.00025674514,0.010605171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997248,0.00008625112,0.000012359835,0.00006998571,0.00004897462,0.000057549958],"domain_scores_gemma":[0.99929774,0.00040153094,0.00004311045,0.000041628486,0.00015198877,0.00006389956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782052,0.0008501987,0.0009877604,0.00050814194,0.00037344513,0.0006647795,0.0018186512,0.0013461444,0.004873819],"category_scores_gemma":[0.0017824102,0.00045788017,0.0004741261,0.00045059895,0.00046056573,0.0009666156,0.0011430798,0.0020058202,0.00080945075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015240093,0.00022326199,0.0011384297,0.00008946987,0.00006489454,0.000081433725,0.000043952412,0.8282823,0.001184913,0.0029635218,0.0077783493,0.15799704],"study_design_scores_gemma":[0.000004865881,0.000010337375,0.000030458576,0.00000203721,0.000002008618,0.0000023493965,0.0000029819744,0.9990928,0.00012774082,0.00056339474,0.00015979269,0.000001178433],"about_ca_topic_score_codex":0.018519811,"about_ca_topic_score_gemma":0.017519781,"teacher_disagreement_score":0.018519811,"about_ca_system_score_codex":0.0010717502,"about_ca_system_score_gemma":0.0014642851,"threshold_uncertainty_score":0.036824048},"labels":[],"label_agreement":null},{"id":"W4289550335","doi":"10.1007/s12083-022-01363-y","title":"A high performance two-layer consensus architecture for blockchain-based IoT systems","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Blockchain; Computer science; Distributed computing; Byzantine fault tolerance; Layer (electronics); Markov chain; Overlay; Architecture; Computer network; Cluster (spacecraft); Protocol (science); Fault tolerance; Operating system; Computer security","score_opus":0.015873760051815945,"score_gpt":0.25033551238157464,"score_spread":0.2344617523297587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289550335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1110933,0.00043293714,0.8743608,0.0006898432,0.00021486606,0.00024978747,0.00014693885,0.002862502,0.009948997],"genre_scores_gemma":[0.93293965,0.00013612378,0.061691273,0.000073852134,0.000034786342,0.00012215402,0.00015804166,0.00006326312,0.0047809114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940646,0.000120619596,0.000044372497,0.0000918071,0.00024618907,0.000090609195],"domain_scores_gemma":[0.9992182,0.00018127664,0.0000460688,0.0001804723,0.00027102153,0.00010288033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085593696,0.00038860214,0.0006555254,0.00040190894,0.0009815926,0.0012515504,0.0014438776,0.00085470226,0.0037945297],"category_scores_gemma":[0.0013392849,0.00030369408,0.00026707584,0.0005070437,0.00049095915,0.0015673751,0.0016086234,0.0009787434,0.0006859191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011687303,0.0003521017,0.0015379484,0.00029285645,0.0001186124,0.00055645313,0.00039114835,0.6786997,0.07265967,0.08009294,0.008886192,0.15524366],"study_design_scores_gemma":[0.000039804094,0.00008234766,0.00008945347,0.000005635142,0.000010625673,0.000032904383,0.000019564002,0.98547584,0.0046257745,0.00792125,0.0016844779,0.000012195413],"about_ca_topic_score_codex":0.0029354137,"about_ca_topic_score_gemma":0.0033226488,"teacher_disagreement_score":0.0037945297,"about_ca_system_score_codex":0.0007402234,"about_ca_system_score_gemma":0.0013899633,"threshold_uncertainty_score":0.012693942},"labels":[],"label_agreement":null},{"id":"W4289688104","doi":"10.1007/s12083-022-01360-1","title":"Revisiting FAW attack in an imperfect PoW blockchain system","year":2022,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Imperfect; Blockchain; Computer security; Profitability index; Throughput; Obfuscation; Block (permutation group theory); Business; Mathematics; Telecommunications","score_opus":0.017922678297525814,"score_gpt":0.27303056008266713,"score_spread":0.2551078817851413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289688104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49795738,0.0006367315,0.4613023,0.0037913532,0.0003348863,0.00018335789,0.0001678466,0.0006897722,0.03493632],"genre_scores_gemma":[0.99316204,0.00009785824,0.0046734046,0.00006498597,0.000027539894,0.000015174015,0.00001835254,0.00001834577,0.0019222078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978734,0.0007114917,0.000087716,0.00027662085,0.0006340322,0.00041678193],"domain_scores_gemma":[0.9934617,0.0037569248,0.0005456036,0.0012560823,0.00066965347,0.00031011127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025532565,0.00040428893,0.0009817558,0.0007792023,0.0015303981,0.0022887317,0.0013743411,0.00267839,0.0038464812],"category_scores_gemma":[0.013696214,0.00034036135,0.00046471265,0.00065412186,0.002412733,0.004740626,0.0034809208,0.0021502974,0.00045004307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010208664,0.00013704592,0.0047064684,0.00023972445,0.00016483053,0.0027201746,0.00085766666,0.39622602,0.01663303,0.5386882,0.0045600557,0.03404596],"study_design_scores_gemma":[0.000032510463,0.00006995697,0.00028208474,0.000018646662,0.00001825499,0.0002299919,0.00009579244,0.8806101,0.002020247,0.115272634,0.0013287921,0.00002105188],"about_ca_topic_score_codex":0.0021560714,"about_ca_topic_score_gemma":0.0011645295,"teacher_disagreement_score":0.0038464812,"about_ca_system_score_codex":0.0009859214,"about_ca_system_score_gemma":0.0012689565,"threshold_uncertainty_score":0.013503075},"labels":[],"label_agreement":null},{"id":"W4322775678","doi":"10.1007/s12083-023-01464-2","title":"A GNN-based proactive caching strategy in NDN networks","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Computer science; Cache; Computer network; False sharing; Latency (audio); Cache algorithms; Smart Cache; Network topology; CPU cache","score_opus":0.02789617127673743,"score_gpt":0.27700096165956145,"score_spread":0.24910479038282402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322775678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120208986,0.004701858,0.8577539,0.0009849734,0.00076790055,0.00029659845,0.00026515304,0.0022789624,0.012741726],"genre_scores_gemma":[0.9100963,0.0008589603,0.08448007,0.00020626355,0.00009688412,0.000055105545,0.00016832525,0.000062726394,0.0039752293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999496,0.0001145201,0.00003315951,0.000109290435,0.00015274365,0.000094349205],"domain_scores_gemma":[0.9991849,0.00016776481,0.000048993985,0.0001417876,0.0003790807,0.00007745927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008004176,0.0004556172,0.0009586666,0.0007318708,0.0009859444,0.0013471107,0.0015181943,0.0008168408,0.0009386641],"category_scores_gemma":[0.0018586947,0.0002551976,0.00029241643,0.0008276938,0.00061525486,0.001133406,0.0010458536,0.0005075468,0.00030361649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001104096,0.00034279106,0.005350339,0.00051776593,0.00016910647,0.00069907564,0.00038691322,0.4416993,0.080700316,0.07617936,0.016393399,0.37645757],"study_design_scores_gemma":[0.00002293977,0.00007127915,0.00042452037,0.000021731184,0.000049937862,0.0002298875,0.00006153432,0.9810069,0.0075991633,0.006736059,0.0037443703,0.00003169186],"about_ca_topic_score_codex":0.008863552,"about_ca_topic_score_gemma":0.015983777,"teacher_disagreement_score":0.008863552,"about_ca_system_score_codex":0.0019166716,"about_ca_system_score_gemma":0.0013724191,"threshold_uncertainty_score":0.017623901},"labels":[],"label_agreement":null},{"id":"W4323050769","doi":"10.1007/s12083-023-01454-4","title":"Time window-based online task assignment in mobile crowdsensing: Problems and algorithms","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Department of Natural Resources, Government of Newfoundland and Labrador","keywords":"Computer science; Upload; Online algorithm; Crowdsensing; Task (project management); Benchmark (surveying); Real-time computing; Distributed computing; Data mining; Algorithm; Computer security","score_opus":0.019998083756520423,"score_gpt":0.26323080407637983,"score_spread":0.2432327203198594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323050769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015634827,0.0016755471,0.9786901,0.000915261,0.0002530113,0.00023257642,0.00022315266,0.00031133858,0.0020640993],"genre_scores_gemma":[0.68594164,0.0036798215,0.286674,0.0006520929,0.0017271123,0.0011010509,0.00074233447,0.00058785744,0.018894108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637693,0.0012086431,0.0001801279,0.0010608798,0.00055181835,0.00062153937],"domain_scores_gemma":[0.9690223,0.027130421,0.0012790548,0.00059085735,0.00095887366,0.001018486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007551103,0.0030686273,0.008204652,0.0022110096,0.0021435674,0.0038039684,0.009294706,0.005774128,0.006641736],"category_scores_gemma":[0.027413113,0.0027273279,0.001954409,0.0047686435,0.0030465052,0.0069530546,0.0045433957,0.004146409,0.0010852101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054007873,0.0003921183,0.00062600774,0.00044436086,0.00010266389,0.00011301883,0.0002058871,0.9176897,0.0009492961,0.023232143,0.0047801803,0.050924517],"study_design_scores_gemma":[0.000028522443,0.000038118284,0.00007935318,0.000013781298,0.000015997733,0.000017633256,0.00003080146,0.9889839,0.00018316838,0.01027749,0.00031775917,0.0000134704005],"about_ca_topic_score_codex":0.017929977,"about_ca_topic_score_gemma":0.007139919,"teacher_disagreement_score":0.017929977,"about_ca_system_score_codex":0.003481672,"about_ca_system_score_gemma":0.003634646,"threshold_uncertainty_score":0.039934516},"labels":[],"label_agreement":null},{"id":"W4366816638","doi":"10.1007/s12083-022-01389-2","title":"Joint task assignment and path planning for truck and drones in mobile crowdsensing","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Drone; Task (project management); Joint (building); Truck; Computer science; Path (computing); Motion planning; Crowdsensing; Engineering; Computer network; Artificial intelligence; Computer security; Automotive engineering; Robot; Systems engineering","score_opus":0.01854016857283014,"score_gpt":0.2580505791692078,"score_spread":0.23951041059637768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366816638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12794425,0.00040617536,0.8656085,0.00032524287,0.00012924566,0.00018309067,0.00012819999,0.000335388,0.004939862],"genre_scores_gemma":[0.9211701,0.00011570908,0.073948435,0.000041153286,0.000039014536,0.00011047568,0.00011235613,0.00006180527,0.0044009998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951553,0.000105849715,0.000017757411,0.0001314565,0.00010043215,0.00012893087],"domain_scores_gemma":[0.9991666,0.0005150835,0.000065830216,0.00005362974,0.000090857386,0.00010793483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075781165,0.00090888835,0.0015867256,0.0005278214,0.0011884045,0.0009994712,0.0014774568,0.0016529127,0.0022473019],"category_scores_gemma":[0.0025255987,0.00091055396,0.0007260366,0.0006640368,0.00080985506,0.001239022,0.0019041202,0.00096187793,0.00035153612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011531784,0.000041144947,0.0002909818,0.000038554874,0.000016273754,0.0000705972,0.000075109274,0.9798845,0.0010743543,0.001955693,0.00045195222,0.01598555],"study_design_scores_gemma":[0.0000058928435,0.000020504609,0.00007666636,0.0000018578942,0.0000023543796,0.000008077662,0.00003032365,0.9979717,0.00022447528,0.0014955283,0.00015907362,0.0000034523507],"about_ca_topic_score_codex":0.024513245,"about_ca_topic_score_gemma":0.018036505,"teacher_disagreement_score":0.024513245,"about_ca_system_score_codex":0.0008552159,"about_ca_system_score_gemma":0.0019411212,"threshold_uncertainty_score":0.048741102},"labels":[],"label_agreement":null},{"id":"W4376142983","doi":"10.1007/s12083-023-01478-w","title":"IoT malware: An attribute-based taxonomy, detection mechanisms and challenges","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; York University; Research and Productivity Council; University of New Brunswick","funders":"","keywords":"Malware; Computer science; Computer security; Internet of Things; Digitization; Cryptovirology; Data science; World Wide Web; Telecommunications","score_opus":0.06332677579152321,"score_gpt":0.28177922089267365,"score_spread":0.21845244510115044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376142983","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13493764,0.02769224,0.7847826,0.023354655,0.00095959124,0.00090692204,0.0012047982,0.003276929,0.02288465],"genre_scores_gemma":[0.65118504,0.022558983,0.31479517,0.0015900186,0.00091986445,0.00034902932,0.0022352762,0.00024062878,0.0061260145],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99501616,0.00066744036,0.00056039135,0.00057065196,0.0028275277,0.00035789688],"domain_scores_gemma":[0.98783255,0.0031298678,0.0012438338,0.0018248106,0.004875596,0.0010932692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046351138,0.0008702472,0.001359457,0.0055406666,0.0024220415,0.007695378,0.0024801642,0.0023359293,0.0009805504],"category_scores_gemma":[0.008936414,0.00048187084,0.0009695224,0.004474506,0.0024075713,0.013650626,0.002516634,0.0035980411,0.0009892602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028885927,0.00075234246,0.054159056,0.000947771,0.000099727986,0.0007489736,0.0016003371,0.019689,0.010669336,0.33443826,0.01946269,0.5571436],"study_design_scores_gemma":[0.000022906792,0.000560419,0.017536493,0.0008677638,0.00013973087,0.009281688,0.004023219,0.37355548,0.012428855,0.4503749,0.13094337,0.00026519762],"about_ca_topic_score_codex":0.0017208568,"about_ca_topic_score_gemma":0.0012018633,"teacher_disagreement_score":0.007695378,"about_ca_system_score_codex":0.0023729075,"about_ca_system_score_gemma":0.0026110588,"threshold_uncertainty_score":0.024513125},"labels":[],"label_agreement":null},{"id":"W4383737140","doi":"10.1007/s12083-023-01501-0","title":"Intelligent spectrum sensing algorithm for cognitive internet of vehicles based on KPCA and improved CNN","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cognitive radio; Algorithm; Wireless; Artificial intelligence; Real-time computing; Telecommunications","score_opus":0.02110292418361377,"score_gpt":0.2743067457187801,"score_spread":0.25320382153516635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383737140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03809491,0.00045640577,0.9572564,0.00020461838,0.00008330844,0.00004653048,0.000043249496,0.00054875924,0.00326592],"genre_scores_gemma":[0.8407125,0.0002701927,0.15416193,0.00012939137,0.00006116644,0.00011861327,0.00015101868,0.000053528027,0.0043416754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975103,0.00003130407,0.000014104253,0.00008362461,0.000073338066,0.000046695626],"domain_scores_gemma":[0.9996412,0.00012668816,0.00004123999,0.000025343672,0.00014316887,0.00002237783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040732377,0.0006376684,0.0010579686,0.0004723976,0.0005270766,0.0007907418,0.0012369008,0.0008567889,0.0014159328],"category_scores_gemma":[0.001042988,0.00034975322,0.00054898084,0.00047377462,0.00047399706,0.00089467067,0.0007603307,0.0008135782,0.00026478662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012570484,0.00005946428,0.0011745414,0.000083388026,0.00006620599,0.00009370706,0.00006133514,0.8271324,0.0054035317,0.0049343244,0.0017313386,0.15913408],"study_design_scores_gemma":[0.00000301084,0.000007308116,0.000090536145,0.000001086816,0.0000028044021,0.000009187636,0.000003272983,0.99910563,0.0002625558,0.00042631585,0.000086041655,0.0000022103004],"about_ca_topic_score_codex":0.0153515255,"about_ca_topic_score_gemma":0.00910447,"teacher_disagreement_score":0.0153515255,"about_ca_system_score_codex":0.00071094,"about_ca_system_score_gemma":0.0011461469,"threshold_uncertainty_score":0.030524373},"labels":[],"label_agreement":null},{"id":"W4383738214","doi":"10.1007/s12083-023-01508-7","title":"Machine Learning based intrusion detection systems for connected autonomous vehicles: A survey","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Telus (Canada); University of Windsor","funders":"","keywords":"Intrusion detection system; Computer science; Computer security; Intrusion; Confidentiality; Intrusion prevention system; Intelligent transportation system; Transport engineering; Engineering","score_opus":0.019065469841527783,"score_gpt":0.24393370292514013,"score_spread":0.22486823308361234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383738214","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038715716,0.19369234,0.7519442,0.0018424843,0.0008685706,0.00039167635,0.00022572643,0.0018078818,0.010511479],"genre_scores_gemma":[0.61052436,0.15076447,0.227786,0.0010846547,0.0019629567,0.00043361058,0.00092796225,0.0001887684,0.006327251],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829334,0.00031316656,0.0001710301,0.0004995525,0.00063875254,0.000084202075],"domain_scores_gemma":[0.9972072,0.0015815017,0.00023446717,0.00021905074,0.0006937413,0.00006406645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016866608,0.0011436517,0.002321121,0.0021084314,0.00048284468,0.001849858,0.0027968013,0.0015460625,0.00085498614],"category_scores_gemma":[0.0042130607,0.0005151024,0.0007814845,0.0025597322,0.0006202455,0.00264868,0.00092111365,0.0011804675,0.0006055122],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013919758,0.00044231667,0.005848408,0.001464033,0.00028611542,0.000096915406,0.00013380693,0.06862556,0.0032543254,0.0068663936,0.0048346394,0.90800834],"study_design_scores_gemma":[0.000039285165,0.0007667234,0.005519029,0.0004743848,0.0002716924,0.00084188423,0.00027891554,0.9093019,0.012593134,0.017051302,0.05276592,0.000095792595],"about_ca_topic_score_codex":0.0016143287,"about_ca_topic_score_gemma":0.001044089,"teacher_disagreement_score":0.0027968013,"about_ca_system_score_codex":0.0006259713,"about_ca_system_score_gemma":0.0008872286,"threshold_uncertainty_score":0.008920014},"labels":[],"label_agreement":null},{"id":"W4386478621","doi":"10.1007/s12083-023-01554-1","title":"A blockchain and stacked machine learning approach for malicious nodes’ detection in internet of things","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research Center of the College of Computer and Information Sciences, King Saud University","keywords":"Computer science; Hash function; Computer security; Single point of failure; Blockchain; Computer network; Network forensics; Digital forensics","score_opus":0.01540513262395177,"score_gpt":0.25306616999802894,"score_spread":0.23766103737407718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386478621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072460644,0.0006571176,0.9223928,0.0004334402,0.00012384847,0.00008344653,0.0001416685,0.0007582545,0.0029487838],"genre_scores_gemma":[0.92423546,0.00034204585,0.06983399,0.00012309941,0.0001290084,0.000081464284,0.00036049253,0.000046441746,0.0048478846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898714,0.00028363088,0.000050251576,0.00017968274,0.00031158066,0.00018768913],"domain_scores_gemma":[0.9976871,0.0012978092,0.00016359356,0.00023088614,0.00049680815,0.00012374284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015168597,0.00064949144,0.0013791043,0.0010454097,0.0007800678,0.00096961524,0.0015093985,0.001360825,0.0021146175],"category_scores_gemma":[0.00375419,0.0003888028,0.0005575845,0.0010800682,0.0007344598,0.0021841917,0.0015860586,0.0011885172,0.00045130157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033201763,0.00029823766,0.0046015135,0.00011510214,0.00013190725,0.0002176424,0.00011972142,0.75014144,0.00425481,0.022445949,0.0026289267,0.2147128],"study_design_scores_gemma":[0.0000021088838,0.000013892442,0.00011456918,0.0000015571186,0.0000042029656,0.0000073539777,0.0000054341835,0.99591476,0.0002865154,0.0035322332,0.000114840455,0.0000025334302],"about_ca_topic_score_codex":0.007329815,"about_ca_topic_score_gemma":0.00664969,"teacher_disagreement_score":0.007329815,"about_ca_system_score_codex":0.00063165964,"about_ca_system_score_gemma":0.0015218366,"threshold_uncertainty_score":0.014574289},"labels":[],"label_agreement":null},{"id":"W4390142817","doi":"10.1007/s12083-023-01597-4","title":"Unveiling DoH tunnel: Toward generating a balanced DoH encrypted traffic dataset and profiling malicious behavior using inherently interpretable machine learning","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Overfitting; Interpretability; Computer science; Profiling (computer programming); Random forest; Data mining; Machine learning; Encryption; Artificial intelligence; The Internet; Artificial neural network; Computer security; World Wide Web","score_opus":0.03281763495495147,"score_gpt":0.293704309409292,"score_spread":0.2608866744543405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390142817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6236992,0.0003544103,0.34351045,0.001051999,0.00025423634,0.00044271932,0.016316822,0.00916087,0.0052093747],"genre_scores_gemma":[0.886254,0.00012179125,0.08707,0.00021184208,0.000089845125,0.00018764658,0.023837328,0.00027094447,0.0019566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890995,0.0002490609,0.00006250558,0.0002481384,0.00036740917,0.00016300667],"domain_scores_gemma":[0.996618,0.00077013386,0.00042031464,0.0012604516,0.00078170944,0.00014936342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016157597,0.000702048,0.0005545198,0.0018241361,0.0005546922,0.0008248421,0.00081028265,0.0010059897,0.0006378833],"category_scores_gemma":[0.0060005034,0.00025564447,0.00040009717,0.0007830223,0.00059429783,0.0016717066,0.001427345,0.0012608718,0.00078114535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013594518,0.0027193432,0.17343734,0.000497526,0.00036508215,0.00084195135,0.00074983825,0.29180878,0.06873479,0.028619438,0.055054456,0.375812],"study_design_scores_gemma":[0.000031778654,0.0001941593,0.012858597,0.000026048356,0.000028540206,0.00024302753,0.00019923372,0.9497024,0.016685002,0.012305682,0.007696591,0.000028984285],"about_ca_topic_score_codex":0.0017707886,"about_ca_topic_score_gemma":0.0039297515,"teacher_disagreement_score":0.0018241361,"about_ca_system_score_codex":0.00051297667,"about_ca_system_score_gemma":0.0009494093,"threshold_uncertainty_score":0.008545101},"labels":[],"label_agreement":null},{"id":"W4390449174","doi":"10.1007/s12083-023-01599-2","title":"Demcrp-et: decentralized multi-criteria ranked prosumers energy trading using distributed ledger technology","year":2023,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Renewable energy; Computer science; Distributed generation; Smart contract; Smart grid; Environmental economics; Peer-to-peer; Ranking (information retrieval); Analytic hierarchy process; Cryptocurrency; Computer security; Business; Operations research; Blockchain; Distributed computing; Artificial intelligence; Economics; Mathematics; Engineering; Electrical engineering","score_opus":0.033036592921158424,"score_gpt":0.31367696798020306,"score_spread":0.28064037505904466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390449174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05837245,0.00024312391,0.92224634,0.00033384585,0.00016546756,0.00037492724,0.00030004678,0.0028180028,0.015145889],"genre_scores_gemma":[0.8631802,0.00008999686,0.12429007,0.0001059575,0.000044153614,0.00020874711,0.00026632406,0.000115018636,0.011699476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891627,0.00040475244,0.000045290388,0.000178636,0.00031954065,0.00013559098],"domain_scores_gemma":[0.9986376,0.0006681014,0.000078393365,0.00026131945,0.00023721789,0.00011727468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017848501,0.00064617436,0.0013585615,0.00059555634,0.0009023203,0.0017044725,0.0019484829,0.0012202023,0.01040715],"category_scores_gemma":[0.0026471335,0.00039517155,0.00050458283,0.000828207,0.0006990437,0.0017756833,0.002411238,0.0011208171,0.0012947003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013737094,0.00064903736,0.0013240324,0.00035803666,0.00020052354,0.00072754,0.00021223098,0.68813336,0.013720913,0.05583853,0.008849927,0.22861215],"study_design_scores_gemma":[0.00013880427,0.00014922088,0.00014912785,0.000011612311,0.000016513932,0.00008577644,0.000037082715,0.97813326,0.0034179112,0.015079094,0.0027632974,0.000018230126],"about_ca_topic_score_codex":0.0014858206,"about_ca_topic_score_gemma":0.0027831793,"teacher_disagreement_score":0.01040715,"about_ca_system_score_codex":0.00072253234,"about_ca_system_score_gemma":0.0015720032,"threshold_uncertainty_score":0.03481537},"labels":[],"label_agreement":null},{"id":"W4401816349","doi":"10.1007/s12083-024-01763-2","title":"SRFE: A stepwise recursive feature elimination approach for network intrusion detection systems","year":2024,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"C4.5 algorithm; Computer science; Random forest; Support vector machine; Artificial intelligence; Machine learning; Naive Bayes classifier; Feature (linguistics); Binary classification; Intrusion detection system; Data mining; Pattern recognition (psychology)","score_opus":0.014755704414825216,"score_gpt":0.25909512307331695,"score_spread":0.24433941865849174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401816349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019354929,0.00004164844,0.9964006,0.000025603249,0.000009127596,0.00003974626,0.000035084217,0.0013207659,0.000192033],"genre_scores_gemma":[0.096296415,0.00007857721,0.89975464,0.000100825775,0.000035182173,0.00015570191,0.00043603306,0.00033436978,0.0028081823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869484,0.0003557714,0.00007679299,0.00018969887,0.00055536954,0.00012754193],"domain_scores_gemma":[0.99776125,0.0012243754,0.00011127326,0.00029806455,0.0005563096,0.000048671667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013490424,0.0010068422,0.0013485304,0.0013450454,0.00058540073,0.0007142642,0.0022947283,0.0008239029,0.0036866476],"category_scores_gemma":[0.0041565816,0.0005566828,0.00123319,0.00077104225,0.0005571104,0.0011595533,0.001475681,0.0014591034,0.0013439475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028394477,0.0002251728,0.0014075232,0.00022505663,0.00020713823,0.00029280173,0.00013915186,0.23665857,0.018670464,0.018052466,0.0068248785,0.7170129],"study_design_scores_gemma":[0.000017343647,0.000054791228,0.0001609808,0.000004596464,0.00002041047,0.000062470455,0.000008250248,0.9895303,0.003453857,0.0052755643,0.0014028166,0.000008574436],"about_ca_topic_score_codex":0.005486092,"about_ca_topic_score_gemma":0.008531031,"teacher_disagreement_score":0.005486092,"about_ca_system_score_codex":0.00039457277,"about_ca_system_score_gemma":0.0012928335,"threshold_uncertainty_score":0.0123330355},"labels":[],"label_agreement":null},{"id":"W4405138672","doi":"10.1007/s12083-024-01833-5","title":"A secure and lightweight data sharing scheme in vehicular digital twin network","year":2024,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; National Natural Science Foundation of China","keywords":"Scheme (mathematics); Computer science; Data sharing; Computer network; Computer security; Mathematics","score_opus":0.018776839108130525,"score_gpt":0.25787209078008416,"score_spread":0.23909525167195364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405138672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115990594,0.0008571477,0.87588215,0.00044260075,0.00034881852,0.00031514012,0.00012827606,0.00062970765,0.005405563],"genre_scores_gemma":[0.9282934,0.00026560677,0.06573034,0.000099477984,0.00007476494,0.00012975057,0.00013706155,0.000035021378,0.005234538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800736,0.00039286728,0.00016360723,0.00033156713,0.00076592545,0.0003387351],"domain_scores_gemma":[0.9983596,0.00034591104,0.00016922056,0.0005625235,0.0004128329,0.00014988122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003299,0.0005006099,0.001058988,0.00079391256,0.0019615765,0.0014329158,0.0016164737,0.0009881218,0.0015646234],"category_scores_gemma":[0.002491309,0.00035373337,0.00054563145,0.0010441935,0.0010331558,0.0030644392,0.004113155,0.0010445312,0.00045742712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025087919,0.0004210856,0.0028751756,0.000540518,0.00021462014,0.0012174178,0.0012675717,0.14367548,0.14983591,0.37408638,0.008935804,0.31442118],"study_design_scores_gemma":[0.00013598143,0.00061957585,0.0006146974,0.000038506325,0.00012147092,0.0010400923,0.00031614478,0.87697995,0.03880777,0.06629256,0.0148837315,0.00014948047],"about_ca_topic_score_codex":0.0013704645,"about_ca_topic_score_gemma":0.001234919,"teacher_disagreement_score":0.0019615765,"about_ca_system_score_codex":0.0012163706,"about_ca_system_score_gemma":0.00202216,"threshold_uncertainty_score":0.008825421},"labels":[],"label_agreement":null},{"id":"W4405971420","doi":"10.1007/s12083-024-01891-9","title":"A lightweight IoT device identification using enhanced behavioral-based features","year":2024,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Identification (biology); Internet of Things; Computer science; Embedded system; Human–computer interaction; Biology","score_opus":0.024786531558908288,"score_gpt":0.31163090351223177,"score_spread":0.28684437195332346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405971420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10363121,0.0003045342,0.8748452,0.00021995111,0.00036709738,0.0002666739,0.00045687595,0.008328904,0.0115796225],"genre_scores_gemma":[0.8713133,0.00013719489,0.117173016,0.00022218165,0.00011971545,0.00014924938,0.0005750521,0.00014466573,0.010165483],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993074,0.00007706377,0.000035844063,0.00009199441,0.00041789346,0.00006973216],"domain_scores_gemma":[0.99948835,0.00008581095,0.00007262483,0.00015182563,0.0001628109,0.00003852841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026630034,0.00053195667,0.0006345375,0.0009613631,0.00030056766,0.00076649984,0.0008525756,0.0006429925,0.0024319955],"category_scores_gemma":[0.00081539975,0.00020943132,0.00036853572,0.0005309952,0.00019561854,0.0010904901,0.0010215358,0.00051447283,0.0019098788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070895377,0.00059909205,0.011971076,0.0003141466,0.00013084107,0.0006923723,0.00010827571,0.007085752,0.5067126,0.009347428,0.0061310236,0.45619836],"study_design_scores_gemma":[0.00006245804,0.0011253137,0.02584213,0.00007710112,0.00019242284,0.004022291,0.00013652528,0.6667312,0.27252924,0.0064519634,0.022676641,0.00015277337],"about_ca_topic_score_codex":0.00034008292,"about_ca_topic_score_gemma":0.00064274494,"teacher_disagreement_score":0.0024319955,"about_ca_system_score_codex":0.00019548579,"about_ca_system_score_gemma":0.00029557024,"threshold_uncertainty_score":0.008135796},"labels":[],"label_agreement":null},{"id":"W4406534442","doi":"10.1007/s12083-024-01898-2","title":"Startup delay aware short video ordering: Problem, model, and a reinforcement learning based algorithm","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reinforcement learning; Computer science; Algorithm; Artificial intelligence","score_opus":0.016578277425207563,"score_gpt":0.27730200672175814,"score_spread":0.2607237292965506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406534442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08955631,0.0005211532,0.9036129,0.0010923037,0.000091603586,0.00021639053,0.00017267879,0.0004175785,0.004319074],"genre_scores_gemma":[0.9242925,0.00025796643,0.06906677,0.00012272941,0.00007671046,0.00016358282,0.00014073965,0.000048040038,0.0058309203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.0001240438,0.00001691646,0.00011806107,0.00009576755,0.00011886817],"domain_scores_gemma":[0.9975925,0.0016681954,0.00023693505,0.000060296778,0.00023756336,0.00020450649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010409019,0.00080077,0.002092001,0.0006108196,0.00057012116,0.0010379114,0.0019901255,0.0021443479,0.0028646446],"category_scores_gemma":[0.003182951,0.0005453195,0.00043883547,0.00076468755,0.00090052816,0.0012722888,0.0009867761,0.0015683493,0.00023252184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001071512,0.000119720506,0.00039342485,0.000048981994,0.000013887736,0.000057323996,0.000023303184,0.98276776,0.0006333167,0.0045290226,0.0010520566,0.010253998],"study_design_scores_gemma":[0.000013049025,0.000018165618,0.000042219734,0.0000020777397,0.0000030189187,0.00000626338,0.000003899204,0.9988244,0.00008779307,0.000940186,0.00005638085,0.0000025841398],"about_ca_topic_score_codex":0.016006466,"about_ca_topic_score_gemma":0.009450032,"teacher_disagreement_score":0.016006466,"about_ca_system_score_codex":0.0015274443,"about_ca_system_score_gemma":0.002157345,"threshold_uncertainty_score":0.031826615},"labels":[],"label_agreement":null},{"id":"W4408315684","doi":"10.1007/s12083-025-01903-2","title":"Dependency-aware task collaborative offloading and resource allocation in UAV enabled edge computing","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Natural Science Foundation of Hunan Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Dependency (UML); Task (project management); Resource allocation; Edge computing; Distributed computing; Enhanced Data Rates for GSM Evolution; Mobile edge computing; Resource (disambiguation); Resource management (computing); Computer architecture; Computer network; Artificial intelligence; Engineering","score_opus":0.009747758509713336,"score_gpt":0.2657448681666465,"score_spread":0.2559971096569332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408315684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25896743,0.0011606363,0.72839534,0.00034996876,0.00028981932,0.00012250389,0.0001452413,0.0008955822,0.009673404],"genre_scores_gemma":[0.9684656,0.00012513097,0.029858304,0.000036372705,0.00002598161,0.000022264956,0.00006595706,0.000036957892,0.0013634783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961406,0.00006437413,0.000018499533,0.000097419856,0.00008460239,0.00012114538],"domain_scores_gemma":[0.99953496,0.00015380938,0.000042746287,0.00009947563,0.000098948985,0.00007014561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038441812,0.00042931814,0.0006799592,0.0003121319,0.00093790016,0.0007447657,0.0009286512,0.0003407932,0.0010650794],"category_scores_gemma":[0.0010983401,0.00018714943,0.00024623214,0.00055025826,0.00029846653,0.00095253246,0.0009809526,0.00042543924,0.00017735407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067127706,0.00042415698,0.004090115,0.00022090678,0.00010202119,0.00072587444,0.0005979867,0.66446775,0.061228383,0.019546635,0.009933802,0.23799111],"study_design_scores_gemma":[0.0000043128025,0.000038404407,0.00067820045,0.000004096048,0.000011133386,0.0000708027,0.00008377789,0.9917612,0.0029270626,0.0033336433,0.0010780484,0.000009206551],"about_ca_topic_score_codex":0.005064699,"about_ca_topic_score_gemma":0.008229814,"teacher_disagreement_score":0.005064699,"about_ca_system_score_codex":0.00039488194,"about_ca_system_score_gemma":0.0008773792,"threshold_uncertainty_score":0.010070443},"labels":[],"label_agreement":null},{"id":"W4410540537","doi":"10.1007/s12083-025-02002-y","title":"Optimal hybrid energy-saving cluster head selection for wireless sensor networks: an empirical study","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Wireless sensor network; Cluster (spacecraft); Computer science; Head (geology); Selection (genetic algorithm); Energy (signal processing); Computer network; Wireless; Telecommunications; Artificial intelligence; Mathematics; Statistics; Geology","score_opus":0.019011028079583957,"score_gpt":0.31286077852667815,"score_spread":0.2938497504470942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410540537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93188655,0.0016242702,0.06393162,0.00034110463,0.00003162979,0.00015782172,0.00016221433,0.00014569447,0.0017190335],"genre_scores_gemma":[0.9943526,0.00017215786,0.0050451313,0.000015558158,0.00001146594,0.0000274924,0.00007512819,0.000011228758,0.0002891941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962851,0.0021617066,0.00013024076,0.0004093628,0.00067869783,0.00033478803],"domain_scores_gemma":[0.93571967,0.058002282,0.001864833,0.0018157862,0.002182042,0.00041530916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007204889,0.0008634219,0.00097420905,0.001173834,0.00072458613,0.00091733574,0.0020639836,0.0010210522,0.0015700489],"category_scores_gemma":[0.030513871,0.00040864572,0.00041035592,0.001617248,0.0010673754,0.0024536569,0.0006890686,0.0007460468,0.00012923872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011872203,0.0010025592,0.020893777,0.00026794348,0.00024187892,0.00013449756,0.00015462293,0.9173409,0.0020061717,0.003699978,0.0015363921,0.051534116],"study_design_scores_gemma":[0.00006538107,0.000490649,0.0053524757,0.000014072105,0.000109981105,0.00012330922,0.00019305231,0.9901592,0.00095864356,0.0023243045,0.00018877765,0.000020166626],"about_ca_topic_score_codex":0.0052709677,"about_ca_topic_score_gemma":0.005233869,"teacher_disagreement_score":0.007204889,"about_ca_system_score_codex":0.0014690231,"about_ca_system_score_gemma":0.0014334039,"threshold_uncertainty_score":0.03810358},"labels":[],"label_agreement":null},{"id":"W4411544687","doi":"10.1007/s12083-025-02040-6","title":"Secure and efficient fully dynamic group signature based on RSIS and RLWE","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Ministry of Electronics and Information technology","keywords":"Signature (topology); Group (periodic table); Group signature; Computer science; Physics; Computer security; Mathematics; Public-key cryptography; Quantum mechanics","score_opus":0.004619057860414322,"score_gpt":0.24349643036536295,"score_spread":0.23887737250494862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411544687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055921108,0.0013432414,0.92680043,0.00046996202,0.0004017897,0.00035659215,0.00036043546,0.003916994,0.010429542],"genre_scores_gemma":[0.8607214,0.00045943455,0.12818019,0.00017930401,0.00016391653,0.00020530564,0.0006471498,0.00010619856,0.009337051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968065,0.00059325097,0.00025807912,0.00052067335,0.001307236,0.00051425386],"domain_scores_gemma":[0.9980527,0.00035736625,0.00022485884,0.0008250551,0.00043993242,0.00010001277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096382335,0.00077468087,0.0016588664,0.0010218769,0.0010157499,0.0017441798,0.0015734484,0.0007688902,0.0021579764],"category_scores_gemma":[0.0024183712,0.0003990021,0.0006680087,0.0011575343,0.00074517995,0.0037521075,0.0027785709,0.0011457212,0.0013101764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030220833,0.0004246268,0.0023669184,0.0007390507,0.00037320366,0.0007040865,0.0005087815,0.09197555,0.18151174,0.19030055,0.014520471,0.5135529],"study_design_scores_gemma":[0.0002761934,0.00080619566,0.0010293283,0.00006358491,0.00023326366,0.0014650982,0.00026144987,0.7781039,0.12562633,0.06040067,0.031524234,0.00020976488],"about_ca_topic_score_codex":0.0008669503,"about_ca_topic_score_gemma":0.0009576579,"teacher_disagreement_score":0.0021579764,"about_ca_system_score_codex":0.00068837183,"about_ca_system_score_gemma":0.0024961578,"threshold_uncertainty_score":0.0072191954},"labels":[],"label_agreement":null},{"id":"W4412960542","doi":"10.1007/s12083-025-02070-0","title":"Integrating IoT and WSN: Enhancing quality of service through energy efficiency, scalability, and secure communication in smart systems","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Scalability; Internet of Things; Computer science; Quality of service; Efficient energy use; Computer network; Service (business); Distributed computing; Computer security; Embedded system; Database; Business; Engineering; Electrical engineering","score_opus":0.02020906581841103,"score_gpt":0.3029157116472507,"score_spread":0.28270664582883964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412960542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16824222,0.007588408,0.78589,0.0035110519,0.0006387219,0.0000952032,0.000081041064,0.0013499119,0.032603435],"genre_scores_gemma":[0.9034165,0.0037283506,0.08732174,0.00027635891,0.00025061442,0.000027236318,0.00007774289,0.00009483246,0.0048065837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996711,0.00006669673,0.00001575777,0.00004805053,0.00016152042,0.00003701454],"domain_scores_gemma":[0.9997507,0.00007761718,0.00003440148,0.000033846143,0.00007761844,0.000025867765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052616105,0.00036950508,0.0003830529,0.00027562157,0.00030214584,0.0010868597,0.000447505,0.00047206425,0.0008509532],"category_scores_gemma":[0.00065948546,0.00021193446,0.00020431298,0.0005581197,0.00041003508,0.0025708608,0.0008380764,0.00066089013,0.00024567943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043553655,0.00047256847,0.0076184594,0.00064481364,0.00020833637,0.0006666061,0.0004058358,0.11678669,0.23786426,0.14396973,0.011372238,0.47955498],"study_design_scores_gemma":[0.000034925106,0.00049017725,0.0046081934,0.00011249207,0.00016266649,0.0008351526,0.00045647443,0.799832,0.066590205,0.08358549,0.04323307,0.00005909785],"about_ca_topic_score_codex":0.0006354383,"about_ca_topic_score_gemma":0.0010846091,"teacher_disagreement_score":0.0010868597,"about_ca_system_score_codex":0.0002940794,"about_ca_system_score_gemma":0.00045930632,"threshold_uncertainty_score":0.0028467178},"labels":[],"label_agreement":null},{"id":"W4413225398","doi":"10.1007/s12083-025-02080-y","title":"The future of mobility: Assessing the impact and applications of blockchain technology in electric vehicle ecosystems","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University","funders":"","keywords":"Blockchain; Environmental science; Ecosystem; Computer science; Computer security; Ecology; Biology","score_opus":0.005760342724700255,"score_gpt":0.2771806896193442,"score_spread":0.27142034689464395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413225398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9743732,0.0011879659,0.006823024,0.0018228536,0.000028749171,0.000049182374,0.00023447849,0.000028614433,0.015451736],"genre_scores_gemma":[0.99847895,0.0003396578,0.00061120617,0.00002294964,0.000006403865,0.0000070111964,0.00004512728,0.0000034821194,0.0004851168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990108,0.0005445424,0.00003166073,0.000075234,0.00018381802,0.00015385957],"domain_scores_gemma":[0.9934684,0.003783597,0.0007902605,0.00028332547,0.0012419164,0.00043246907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025529067,0.00032194686,0.00020511288,0.0009651782,0.00046981053,0.0022598826,0.000574589,0.0010745253,0.0024146342],"category_scores_gemma":[0.011644694,0.00010938523,0.0002588466,0.0014152075,0.0011477765,0.0066306675,0.0014445584,0.000627024,0.0002486226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012530811,0.0003931925,0.24683425,0.0005302756,0.00024128333,0.00074128195,0.0014054268,0.4777406,0.0049263355,0.13922052,0.0032294171,0.12348428],"study_design_scores_gemma":[0.000044957233,0.0011234245,0.0797667,0.00022634167,0.000112387024,0.00036445257,0.005488659,0.7675659,0.0045886105,0.1258233,0.014813759,0.00008150965],"about_ca_topic_score_codex":0.006870526,"about_ca_topic_score_gemma":0.0071328036,"teacher_disagreement_score":0.006870526,"about_ca_system_score_codex":0.0022173822,"about_ca_system_score_gemma":0.0010221004,"threshold_uncertainty_score":0.016088307},"labels":[],"label_agreement":null},{"id":"W4416563407","doi":"10.1007/s12083-025-02163-w","title":"Adaptive sliding window and LightGBM-based DDoS attack detection framework for IoT networks","year":2025,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Denial-of-service attack; Sliding window protocol; Feature selection; Intrusion detection system; Window (computing); Internet of Things; Feature (linguistics); Curse of dimensionality; Trinoo","score_opus":0.021774620534225093,"score_gpt":0.29022333844326204,"score_spread":0.26844871790903696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416563407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021391286,0.00048926834,0.9739535,0.00008729928,0.00006761307,0.0001049027,0.00006911292,0.0027174563,0.001119555],"genre_scores_gemma":[0.67400247,0.0005051726,0.32203665,0.000114282244,0.0000764004,0.000205783,0.00025024425,0.00014561157,0.0026633462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999383,0.00010513572,0.00004693734,0.00012443759,0.00025000074,0.00009055541],"domain_scores_gemma":[0.9995875,0.00009375229,0.00005210259,0.000087699074,0.00012694766,0.000052068317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008579587,0.00048427307,0.0008828443,0.0010777197,0.00047170013,0.0010742075,0.0015064556,0.0005841976,0.0014149406],"category_scores_gemma":[0.0011731879,0.0002588503,0.0005512967,0.00053573685,0.00037239355,0.0013606494,0.0013758419,0.0007795577,0.00032932562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018075797,0.0007231498,0.0058318567,0.00045975053,0.00030994086,0.00060052105,0.00054902275,0.20243098,0.14375548,0.061803866,0.009769913,0.571958],"study_design_scores_gemma":[0.00002255155,0.00008209601,0.0004932236,0.000012280819,0.000044330234,0.00009777308,0.000036688794,0.9786816,0.012151492,0.0053136763,0.0030424076,0.000021874748],"about_ca_topic_score_codex":0.002545054,"about_ca_topic_score_gemma":0.0022934657,"teacher_disagreement_score":0.002545054,"about_ca_system_score_codex":0.0006232793,"about_ca_system_score_gemma":0.00088989554,"threshold_uncertainty_score":0.005060494},"labels":[],"label_agreement":null},{"id":"W566906973","doi":"10.1007/s12083-015-0370-y","title":"Adaptive RSSI-based localization scheme for wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless sensor network; Computer science; Node (physics); Received signal strength indication; Real-time computing; Channel state information; Wireless; Scheme (mathematics); Position (finance); Channel (broadcasting); Range (aeronautics); Computer network; Telecommunications; Engineering; Mathematics","score_opus":0.027853327027236887,"score_gpt":0.25590144720320956,"score_spread":0.22804812017597267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W566906973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028760904,0.0008983699,0.9648243,0.00019297522,0.00032311596,0.00007826092,0.00008727689,0.0020326788,0.0028021035],"genre_scores_gemma":[0.801389,0.0006051139,0.19087844,0.00015363563,0.00016427992,0.00013389121,0.0003055947,0.000063301246,0.0063067754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932814,0.00015807585,0.000047387315,0.00014041617,0.0002653326,0.00006074169],"domain_scores_gemma":[0.999448,0.00006610332,0.000053054966,0.00012178327,0.00028042798,0.00003062304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052468583,0.00059113366,0.00070976745,0.00064342126,0.0004912646,0.00035498908,0.0016952399,0.00053069234,0.00089595956],"category_scores_gemma":[0.00095576415,0.00020312888,0.0003225278,0.0006917749,0.0003143846,0.0007398052,0.0008103298,0.000659548,0.0007074747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091919425,0.00027154232,0.0019740982,0.00029282874,0.00013407266,0.00032570164,0.00030256936,0.10034288,0.2550057,0.009915192,0.010015292,0.6205009],"study_design_scores_gemma":[0.00012028068,0.0007121747,0.0024730565,0.000022104496,0.00012319154,0.0008533464,0.000105094616,0.91701984,0.06441523,0.003376023,0.010672876,0.00010661786],"about_ca_topic_score_codex":0.0011812769,"about_ca_topic_score_gemma":0.0017445466,"teacher_disagreement_score":0.0016952399,"about_ca_system_score_codex":0.00043356165,"about_ca_system_score_gemma":0.00046337815,"threshold_uncertainty_score":0.0031457543},"labels":[],"label_agreement":null}]}