{"meta":{"query_hash":"026da87d6f5f","filters":{"topic":"Peer-to-Peer Network Technologies"},"cohort_total":880,"direct_labels_cover":1,"predictions_cover":880,"exported":880,"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/026da87d6f5f","api":"https://metacan.xera.ac/api/v1/cohort?topic=Peer-to-Peer+Network+Technologies"},"results":[{"id":"W101317446","doi":"","title":"A Data Locating Mechanism for Distributed XML Data over P2P Networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Streaming XML; Efficient XML Interchange; XML database; Scalability; XML Signature; Distributed computing; XPath; Overlay network; XML; Computer network; XML Encryption; Flooding (psychology); The Internet; Database; World Wide Web","score_opus":0.07424212281613346,"score_gpt":0.30918058877036647,"score_spread":0.234938465954233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101317446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032457712,0.00007302177,0.98934525,0.007028071,0.00039312488,0.0004849919,0.0006735516,0.0015228783,0.00015454713],"genre_scores_gemma":[0.23214464,0.0000129729515,0.76389575,0.0016545824,0.00018533887,0.000043482803,0.0019485782,0.000022656466,0.000091972586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974583,0.000016889575,0.00032634087,0.0012155866,0.00030882133,0.0006740753],"domain_scores_gemma":[0.99235946,0.00016559576,0.000103428174,0.0071443897,0.000106771295,0.00012037253],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006442028,0.00022570795,0.00023410337,0.00008134074,0.00019404978,0.00034891436,0.01216334,0.0001484493,0.00000502886],"category_scores_gemma":[0.0005617662,0.00020294506,0.000028206401,0.0006932121,0.00004238411,0.0012281245,0.012023636,0.00020340542,0.00002400433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009015115,0.00009780281,0.000042685206,0.000015283262,0.00006524304,0.000021595168,0.000043899217,0.0144477105,0.00016703394,0.7468861,0.16779119,0.07041245],"study_design_scores_gemma":[0.00049887784,0.00006973846,0.000084341045,0.000040355284,0.000013163303,0.0000136756,0.000027694006,0.92663234,0.00045673942,0.053214148,0.01862095,0.0003279815],"about_ca_topic_score_codex":0.00019823511,"about_ca_topic_score_gemma":0.0007044848,"teacher_disagreement_score":0.9121846,"about_ca_system_score_codex":0.00008512665,"about_ca_system_score_gemma":0.00010729261,"threshold_uncertainty_score":0.9959669},"labels":[],"label_agreement":null},{"id":"W10552456","doi":"10.1021/jf981130i","title":"ToPSS - The Toronto Publish/Subscribe System Family.","year":2005,"lang":"en","type":"article","venue":"GI Jahrestagung (1)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Internet privacy; Telecommunications","score_opus":0.013258425333950814,"score_gpt":0.2271022532576629,"score_spread":0.2138438279237121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10552456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17965452,0.015166183,0.4509271,0.110430114,0.00828614,0.0026635025,0.000036882248,0.016083177,0.21675237],"genre_scores_gemma":[0.9551197,0.000034136312,0.03959473,0.0019115113,0.0005067216,0.000117472664,0.0000025740953,0.000026413658,0.0026866826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997464,0.00009138509,0.00037767048,0.0006485653,0.0006329699,0.0007853888],"domain_scores_gemma":[0.9971043,0.000133829,0.00011014845,0.0023345537,0.00014459857,0.00017255668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006664833,0.00027719775,0.00026196282,0.00008622635,0.000310133,0.00079287146,0.004613749,0.0001558306,0.000012210584],"category_scores_gemma":[0.0001107142,0.00020147517,0.00010289804,0.0006105894,0.00008478105,0.0014672626,0.0013368841,0.00027508216,0.00041172132],"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.000010596796,0.00006326476,0.0007314679,0.000025549196,0.000050219835,0.000053917753,0.0015499773,0.0011251757,0.00070599624,0.35907525,0.32965302,0.30695558],"study_design_scores_gemma":[0.00041590122,0.00014399481,0.013214659,0.00009870004,0.000018891931,0.00009596954,0.0016076965,0.03226339,0.0010455621,0.00090384454,0.94946724,0.00072415685],"about_ca_topic_score_codex":0.00065588974,"about_ca_topic_score_gemma":0.0013828721,"teacher_disagreement_score":0.77546525,"about_ca_system_score_codex":0.0005400388,"about_ca_system_score_gemma":0.00008604309,"threshold_uncertainty_score":0.8573571},"labels":[],"label_agreement":null},{"id":"W118778405","doi":"","title":"NewsCast: an adaptive video stream production and delivery system","year":2013,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Exploit; Multimedia; Software deployment; Context (archaeology); Mobile device; The Internet; World Wide Web; Video game; Computer security; Operating system","score_opus":0.10788961582328434,"score_gpt":0.3582053227470474,"score_spread":0.2503157069237631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118778405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9404029,0.002147094,0.010533762,0.034358125,0.0014432834,0.009616788,0.00012325429,0.0004543285,0.00092045835],"genre_scores_gemma":[0.9803463,0.00020706443,0.018085878,0.00002174591,0.000047567035,0.00051003427,9.12428e-7,0.000012305557,0.0007681657],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974186,0.00036452163,0.00029767572,0.0007431196,0.00062455016,0.00055153534],"domain_scores_gemma":[0.9915243,0.00055597787,0.00017556417,0.00093101716,0.006697253,0.000115910865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067857397,0.00022410155,0.0003775132,0.00021473336,0.0005847786,0.00014675155,0.0012206305,0.00006752268,0.0000011508179],"category_scores_gemma":[0.0021721036,0.00015323416,0.000038391492,0.0016605962,0.0005736441,0.0007441856,0.0010703963,0.0002568469,0.000011037024],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000904165,0.0004383871,0.00065143313,0.00048206438,0.00054229336,0.0000065781555,0.021186966,0.0071788323,0.028229618,0.40823868,0.030070078,0.5020709],"study_design_scores_gemma":[0.0025732429,0.010361748,0.0050462577,0.0044380995,0.000055491277,0.000010789879,0.41390684,0.060177233,0.43867913,0.05448944,0.008640326,0.0016214033],"about_ca_topic_score_codex":0.000020141144,"about_ca_topic_score_gemma":0.0003248384,"teacher_disagreement_score":0.50044954,"about_ca_system_score_codex":0.00030938152,"about_ca_system_score_gemma":0.00024824185,"threshold_uncertainty_score":0.6248708},"labels":[],"label_agreement":null},{"id":"W126835279","doi":"","title":"Improving the Performance of Online Mapping Applications with Prefetching.","year":2009,"lang":"en","type":"article","venue":"International Conference on Internet Computing","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":"Western University","funders":"","keywords":"Computer science; Computer architecture","score_opus":0.029116044527690267,"score_gpt":0.2697138112745169,"score_spread":0.24059776674682662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126835279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35127646,0.000010649017,0.6407771,0.004254597,0.00015092916,0.00022426518,0.0000028796394,0.00023996497,0.0030631572],"genre_scores_gemma":[0.9353508,0.0000036059387,0.06362787,0.0007137952,0.00010162662,0.000009458476,0.000005649984,0.000006511027,0.00018068777],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852484,0.000027390579,0.0003541782,0.00041030446,0.000435882,0.00024741638],"domain_scores_gemma":[0.9986808,0.00011160029,0.00028095662,0.0005409853,0.00034175365,0.00004395598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025428165,0.00017490986,0.00016261263,0.00021687195,0.00008318724,0.00019058368,0.0028701678,0.0000455946,0.0000073708256],"category_scores_gemma":[0.0000446618,0.00012504964,0.000042046977,0.0003696728,0.000063591135,0.00021721779,0.000482294,0.0003234716,0.000017990184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029816252,0.00013942042,0.0017361769,0.000011980996,0.000049997707,0.000003837489,0.001081694,0.007736639,0.0031085042,0.25309294,0.0002309922,0.732778],"study_design_scores_gemma":[0.0001958095,0.00040312772,0.009139958,0.00032664364,0.0000033136716,0.000028072309,0.00012525036,0.98293245,0.0044087665,0.0010952597,0.00114055,0.00020081992],"about_ca_topic_score_codex":0.000036580128,"about_ca_topic_score_gemma":0.000011258785,"teacher_disagreement_score":0.97519577,"about_ca_system_score_codex":0.000073503514,"about_ca_system_score_gemma":0.00006567246,"threshold_uncertainty_score":0.5333534},"labels":[],"label_agreement":null},{"id":"W134029461","doi":"10.1007/978-3-319-11782-9_8","title":"Adaptive Retrieval in a P2P Cloud Datacenter","year":2014,"lang":"en","type":"book-chapter","venue":"","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Chord (peer-to-peer); Search engine indexing; Information retrieval; Distributed hash table; Cloud computing; Cluster analysis; Peer-to-peer; Image retrieval; Hash function; Data mining; Computer network; Artificial intelligence; Image (mathematics)","score_opus":0.027312436314685478,"score_gpt":0.23452336858148612,"score_spread":0.20721093226680065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134029461","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015964424,0.00017721609,0.41063753,0.0026295623,0.0009865112,0.00044186114,0.000019677918,0.0009936977,0.584098],"genre_scores_gemma":[0.0060687987,0.000083550316,0.09679206,0.0023843274,0.00045288447,0.00001284618,0.000026654969,0.00007573249,0.89410317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731183,0.000024764428,0.000447834,0.0011105872,0.00056817016,0.00053680176],"domain_scores_gemma":[0.9972621,0.00013623339,0.00016263916,0.0022147766,0.00010081931,0.00012338262],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043485555,0.00046876873,0.00056187785,0.0005322215,0.000042416843,0.00015155753,0.0036416778,0.00055777427,0.000102042955],"category_scores_gemma":[0.00007637903,0.00042777514,0.00011376596,0.00019593416,0.00010566905,0.00020114603,0.0031309763,0.00079644675,0.0014552795],"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.000023632892,0.000008699115,0.000008830562,0.0000061770065,0.000025519661,0.00008244075,0.000053689622,0.000018390267,0.000004329199,0.86340594,0.1125933,0.023769045],"study_design_scores_gemma":[0.00033108622,0.0002708558,0.00004270712,0.0002656162,0.000009340522,0.000023762497,0.0000057576485,0.004953197,0.00010411864,0.08162532,0.9115906,0.00077766605],"about_ca_topic_score_codex":0.000023003913,"about_ca_topic_score_gemma":0.00017458313,"teacher_disagreement_score":0.7989973,"about_ca_system_score_codex":0.00020874375,"about_ca_system_score_gemma":0.00008485482,"threshold_uncertainty_score":0.99981743},"labels":[],"label_agreement":null},{"id":"W138003856","doi":"","title":"Object-relational event middleware for web applications","year":2011,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Ajax; Web application; World Wide Web; Middleware (distributed applications); Java; Consistency (knowledge bases); Software engineering; Database; Operating system","score_opus":0.2138127652518304,"score_gpt":0.4051073493093613,"score_spread":0.19129458405753091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138003856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02378012,0.0043112556,0.8785209,0.052466232,0.0022984932,0.02854557,0.0018931113,0.00065102155,0.0075332867],"genre_scores_gemma":[0.8743929,0.00015338928,0.11879155,0.00006725168,0.000050815506,0.00394077,0.0000065606896,0.000018081237,0.0025786373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784625,0.00014171287,0.00033896926,0.0005587137,0.0005778065,0.0005365436],"domain_scores_gemma":[0.991509,0.0013289669,0.000184205,0.00085870514,0.0060408376,0.00007826495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007504313,0.00018796895,0.000307347,0.00020482401,0.0006496753,0.000037363156,0.0017897768,0.000071240014,0.0000041740905],"category_scores_gemma":[0.0021707215,0.00013625163,0.00009681332,0.0018757653,0.0004426589,0.00019410878,0.0008511583,0.00020842241,0.0000128640295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026012852,0.000245229,0.0002496055,0.00010619568,0.0001977921,4.587056e-7,0.005065456,0.0009821538,0.0024434503,0.9420795,0.0155099025,0.032860134],"study_design_scores_gemma":[0.0033690492,0.0025293175,0.0021086177,0.000917187,0.000041340027,0.0000011908352,0.026956033,0.010341071,0.20305488,0.4823112,0.26743993,0.00093017524],"about_ca_topic_score_codex":0.0000012404337,"about_ca_topic_score_gemma":0.00013641515,"teacher_disagreement_score":0.8506128,"about_ca_system_score_codex":0.00023797457,"about_ca_system_score_gemma":0.00056876056,"threshold_uncertainty_score":0.55561805},"labels":[],"label_agreement":null},{"id":"W139217162","doi":"","title":"Minimal broker overlay design for content-based publish/subscribe systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Overlay; Publication; Latency (audio); Computer network; Overlay network; The Internet; Distributed computing; Revenue; World Wide Web; Operating system; Telecommunications","score_opus":0.07970351538326724,"score_gpt":0.24178973585476835,"score_spread":0.16208622047150112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139217162","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060017062,0.00012896134,0.97775364,0.010250627,0.0009743435,0.0017322722,0.0000048876586,0.0017364969,0.0014170696],"genre_scores_gemma":[0.4753099,8.192162e-7,0.5163451,0.0018932361,0.000085393745,0.0010540676,0.000003822064,0.000022279115,0.005285405],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784327,0.00006113597,0.00036547318,0.00062204094,0.00039013333,0.00071796234],"domain_scores_gemma":[0.9977408,0.0004493474,0.000103747785,0.0010562096,0.00046610954,0.00018377471],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004926185,0.00024311982,0.00030021317,0.00023559801,0.00011303052,0.001277011,0.0021430338,0.00016923925,0.000031500545],"category_scores_gemma":[0.00034635767,0.00019601319,0.00010220772,0.0005355078,0.000059108293,0.0011815504,0.0003237805,0.00012025593,0.00035129237],"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.000015722824,0.00007907276,0.00041447338,0.000026596837,0.00003582995,0.0000055007563,0.000053090836,0.0013761873,0.005635227,0.056228,0.92202544,0.014104837],"study_design_scores_gemma":[0.0016791229,0.00088145165,0.0024208352,0.000075915406,0.000015729025,0.000018483288,0.0003070464,0.8880811,0.02635688,0.0018354761,0.077369,0.00095897214],"about_ca_topic_score_codex":0.00026898892,"about_ca_topic_score_gemma":0.000011761654,"teacher_disagreement_score":0.8867049,"about_ca_system_score_codex":0.00009188692,"about_ca_system_score_gemma":0.000103561106,"threshold_uncertainty_score":0.99975973},"labels":[],"label_agreement":null},{"id":"W14011896","doi":"10.1007/978-0-387-89828-5_10","title":"Toward Autonomic Networks: Knowledge Management and Self-Stabilization","year":2009,"lang":"en","type":"book-chapter","venue":"","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 Waterloo","funders":"","keywords":"Autonomic computing; Computer science; Knowledge management; Management science; Psychology; Engineering","score_opus":0.01812605995873145,"score_gpt":0.22290377427704358,"score_spread":0.20477771431831213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14011896","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003030207,0.0014154775,0.3871082,0.0007147116,0.0003259199,0.0004930134,9.0536065e-7,0.0021907492,0.607748],"genre_scores_gemma":[0.006332074,0.0026917185,0.2700444,0.0008400891,0.00025467653,0.00004472825,0.000018107121,0.00007093189,0.7197033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980556,0.000013169313,0.00037473315,0.0009530808,0.00019950683,0.00040391402],"domain_scores_gemma":[0.9985284,0.00004656064,0.0001272553,0.0010991805,0.00007639526,0.00012217203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021942033,0.00044491302,0.00038981996,0.0004047004,0.00008941334,0.0002615781,0.0014150952,0.00037813844,0.000023120445],"category_scores_gemma":[0.0000045003567,0.0004356224,0.00007864543,0.0001475567,0.000049693524,0.00022081225,0.0015448075,0.00026443248,0.00020736556],"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.0000010813761,0.000016790193,0.0000034511268,0.00001862912,0.000034866043,0.000014038042,0.000076944576,0.00052416214,1.4087003e-7,0.70254946,0.017426299,0.27933416],"study_design_scores_gemma":[0.00018874143,0.00014016265,0.00016133691,0.00013143818,0.000044380235,0.000015520014,0.000007147567,0.08072497,0.0000063697903,0.06745349,0.85041505,0.00071139657],"about_ca_topic_score_codex":0.0000014719201,"about_ca_topic_score_gemma":0.000017402162,"teacher_disagreement_score":0.83298874,"about_ca_system_score_codex":0.0002614279,"about_ca_system_score_gemma":0.000040662755,"threshold_uncertainty_score":0.99980956},"labels":[],"label_agreement":null},{"id":"W140480218","doi":"","title":"From Peers to the Cloud: Utilizing Distributed Resources for Content Delivery and User Collaboration","year":2013,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Cloud computing; Computer science; BitTorrent; Provisioning; File sharing; Distributed computing; Scalability; Software deployment; Shared resource; Leverage (statistics); Peer-to-peer; The Internet; World Wide Web; Computer network; Operating system","score_opus":0.01917872977023634,"score_gpt":0.2219399285110519,"score_spread":0.20276119874081555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140480218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95427495,0.00030807205,0.03692405,0.004341308,0.0012486469,0.0015312573,0.0005741432,0.00047511427,0.00032244407],"genre_scores_gemma":[0.9568798,0.00019111615,0.019628737,0.0008610822,0.00044634083,0.00007166199,0.002243487,0.00007987895,0.019597927],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980988,0.000081559694,0.0002324811,0.0008129883,0.00036250526,0.00041165072],"domain_scores_gemma":[0.9979198,0.0002892574,0.00021068375,0.00078918715,0.0006170596,0.00017400636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015207226,0.0003495697,0.00034780387,0.0004469327,0.00043532735,0.00044576896,0.0018767533,0.00035607387,0.0000073119522],"category_scores_gemma":[0.00016804948,0.0003258546,0.000095766394,0.0014101797,0.00005260573,0.00051319884,0.00042055905,0.0002746126,0.000035818946],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006655291,0.00009821706,0.017049579,0.00008839068,0.00046294078,0.000078958925,0.0022042026,0.001213409,0.00027944747,0.0121537,0.93500733,0.03069829],"study_design_scores_gemma":[0.00062479294,0.00017235496,0.003156278,0.00015700507,0.00011856314,5.964705e-9,0.11179366,0.0022216216,0.0021262288,0.00031758886,0.878729,0.0005829442],"about_ca_topic_score_codex":0.0009906468,"about_ca_topic_score_gemma":0.06869103,"teacher_disagreement_score":0.10958946,"about_ca_system_score_codex":0.00024171839,"about_ca_system_score_gemma":0.00010546526,"threshold_uncertainty_score":0.99991935},"labels":[],"label_agreement":null},{"id":"W1444277769","doi":"10.1017/cbo9780511973369.013","title":"Attack resistance in peer-to-peer video streaming","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Denial-of-service attack; Computer security; Computer science; Cheating; Internet privacy; Peer-to-peer; The Internet; Resistance (ecology); Wireless network; Wireless; Computer network; World Wide Web; Telecommunications","score_opus":0.036044411997180954,"score_gpt":0.22132030447281706,"score_spread":0.1852758924756361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1444277769","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034895196,0.00014499218,0.025935804,0.0007472378,0.00049756246,0.0007961447,0.00013526792,0.0009872173,0.97040683],"genre_scores_gemma":[0.003470711,0.00002288408,0.018265504,0.0002813587,0.000092008195,0.000005004075,0.000016560929,0.0000689695,0.977777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.995967,0.000058063222,0.00042053955,0.0016142023,0.0010555419,0.0008846577],"domain_scores_gemma":[0.9960113,0.00014282731,0.00028250742,0.0025110915,0.0006679115,0.0003843299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044111453,0.00072612433,0.0007614619,0.0010301684,0.00020413894,0.00017708063,0.004918211,0.0006988821,0.000003486533],"category_scores_gemma":[0.00011986151,0.00091456395,0.00021786362,0.00011581311,0.00021683735,0.0003434999,0.0037476544,0.0010288742,0.0001470986],"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.000060188893,0.000013513968,0.000010622543,0.000040710307,0.000053761418,0.00094624405,0.0003268931,0.000024586467,0.000020417045,0.76333266,0.22959992,0.00557048],"study_design_scores_gemma":[0.0003988891,0.00007831948,0.00020625173,0.0004987943,0.000038461436,0.0000095546775,0.000023925451,0.000084867366,0.00035021172,0.0002466435,0.9970803,0.0009837752],"about_ca_topic_score_codex":0.00024303452,"about_ca_topic_score_gemma":0.00023945604,"teacher_disagreement_score":0.7674804,"about_ca_system_score_codex":0.0007050189,"about_ca_system_score_gemma":0.00019282656,"threshold_uncertainty_score":0.9993305},"labels":[],"label_agreement":null},{"id":"W147229156","doi":"10.22215/timreview/701","title":"Peer-to-Peer Enclaves for Improving Network Defence","year":2013,"lang":"en","type":"article","venue":"Technology Innovation Management Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Information sharing; Computer science; Peer-to-peer; Computer security; Scale (ratio); Work (physics); Risk analysis (engineering); Business; Computer network; World Wide Web; Engineering","score_opus":0.021851828244747823,"score_gpt":0.28712783287443366,"score_spread":0.2652760046296858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147229156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000815437,0.0030625933,0.7678183,0.21882978,0.00040214468,0.0042774165,0.0000018146433,0.0026814737,0.0021110629],"genre_scores_gemma":[0.027010212,0.00088914274,0.9348611,0.023287967,0.00010553862,0.0058383844,0.000025258772,0.000042428514,0.007939972],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965427,0.00002873724,0.0009051973,0.0009738679,0.0006591298,0.00089036184],"domain_scores_gemma":[0.99577767,0.00006546485,0.00035706258,0.0019714518,0.0017676676,0.000060662278],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018531376,0.0003653859,0.0005030567,0.0012851263,0.00025307245,0.00020181494,0.0034663505,0.000216235,0.000034511595],"category_scores_gemma":[0.0011242802,0.00034780262,0.000072716546,0.011698923,0.000090175534,0.00056277745,0.0021719176,0.00030383051,0.00081600767],"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":[4.977577e-7,0.000011891239,0.000091065034,0.00029727624,0.000018560058,0.0000018445255,0.0000061111177,0.000040533796,0.000097194505,0.38650334,0.19568382,0.41724786],"study_design_scores_gemma":[0.0002100602,0.00019009651,0.00051938137,0.0009566039,0.000040254447,0.000009901622,0.000034126326,0.0014978724,0.00048214753,0.12460652,0.8708697,0.0005833518],"about_ca_topic_score_codex":0.000007355601,"about_ca_topic_score_gemma":0.0000037908028,"teacher_disagreement_score":0.67518586,"about_ca_system_score_codex":0.00013625713,"about_ca_system_score_gemma":0.000029516976,"threshold_uncertainty_score":0.999962},"labels":[],"label_agreement":null},{"id":"W1480741001","doi":"10.1007/978-0-387-89024-1_8","title":"Zoning Issues and Area of Interest Management in Massively Multiplayer Online Games","year":2009,"lang":"en","type":"book-chapter","venue":"","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":"Zoning; Computer science; Engineering; Civil engineering","score_opus":0.061167792235088704,"score_gpt":0.2775686473248668,"score_spread":0.2164008550897781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480741001","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008078623,0.0062178713,0.11040342,0.019340485,0.0006446903,0.0022013453,0.000050727314,0.0021813186,0.8508815],"genre_scores_gemma":[0.04406052,0.0011638533,0.49570206,0.00057529187,0.000050160314,0.000012281376,0.000012667843,0.00003613066,0.45838705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983927,0.000008736439,0.0004396634,0.0006506316,0.00022141897,0.00028686438],"domain_scores_gemma":[0.9989009,0.000061011815,0.00017161552,0.00074537017,0.000063397834,0.00005773784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013413985,0.00034885845,0.00048611325,0.0007189439,0.000021053045,0.00007500623,0.0012333791,0.0002341976,0.00002086291],"category_scores_gemma":[0.000021392494,0.0003126628,0.00005864742,0.00011088836,0.000084111074,0.00015188326,0.0015215275,0.00031816773,0.000015075764],"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.000008825174,0.000039886352,0.000095952586,0.000040331117,0.00006419669,0.00019923666,0.00013750052,0.00009054901,0.00003214097,0.34984756,0.0044821654,0.64496166],"study_design_scores_gemma":[0.0021229193,0.0012440044,0.015415555,0.006374451,0.000098155426,0.00007771433,0.00038736413,0.029998435,0.0016307955,0.30117616,0.63823545,0.0032390137],"about_ca_topic_score_codex":0.000031887022,"about_ca_topic_score_gemma":0.000409289,"teacher_disagreement_score":0.6417227,"about_ca_system_score_codex":0.000060005124,"about_ca_system_score_gemma":0.000011900796,"threshold_uncertainty_score":0.9999325},"labels":[],"label_agreement":null},{"id":"W1485888705","doi":"10.1109/mascots.2006.32","title":"Modelling and Improving Group Communication in Server Operating Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Communication in small groups; Unicast; Kernel (algebra); Computer network; Implementation; Operating system; Group (periodic table); Models of communication; Distributed computing; Multicast; Software engineering","score_opus":0.016214275689369957,"score_gpt":0.21414460840638705,"score_spread":0.1979303327170171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485888705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32656488,0.0004823746,0.6711068,0.0004261961,0.00003556229,0.00012943432,1.1365678e-7,0.0003064385,0.00094816566],"genre_scores_gemma":[0.7747163,0.0000064490514,0.22509658,0.000040997864,0.000010543668,0.000017609953,9.0387664e-7,0.000004020216,0.00010657341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992296,0.000038537495,0.00020291095,0.00023063437,0.00011003063,0.00018826836],"domain_scores_gemma":[0.99931747,0.00005713211,0.000036746253,0.00053903466,0.00003045392,0.00001916744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041675314,0.00007957415,0.00010121055,0.00010485637,0.000090813,0.00031163,0.0006457805,0.000054924665,2.6427514e-7],"category_scores_gemma":[0.000010129839,0.00007397306,0.0000087271255,0.00032228552,0.000015926105,0.00049424445,0.0006129699,0.000115355986,0.0000037661605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6442014e-7,0.000016452112,0.0031829802,0.000016688065,0.0000015126798,0.000002739632,0.00016182827,0.79733974,0.0007215547,0.19103311,0.00015218838,0.0073707537],"study_design_scores_gemma":[0.0000881542,0.000011992428,0.000527196,0.000038432223,5.311481e-7,0.000004662047,0.00006777556,0.997342,0.00016227616,0.0015603871,0.00009801732,0.000098593984],"about_ca_topic_score_codex":0.005115513,"about_ca_topic_score_gemma":0.0005005066,"teacher_disagreement_score":0.44815144,"about_ca_system_score_codex":0.00004512604,"about_ca_system_score_gemma":0.000007615495,"threshold_uncertainty_score":0.773316},"labels":[],"label_agreement":null},{"id":"W1486200320","doi":"10.1007/978-3-642-11686-5_6","title":"Peer-to-Peer Streaming Systems","year":2010,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Peer-to-Peer Network Technologies","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Upload; Live streaming; Computer network; The Internet; Overlay; Peer-to-peer; World Wide Web; Operating system","score_opus":0.08940146896898137,"score_gpt":0.3535571690511749,"score_spread":0.2641557000821935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486200320","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008267237,0.0030033553,0.8989377,0.012517741,0.0070196623,0.0012305895,0.000072445575,0.00091480586,0.07622102],"genre_scores_gemma":[0.09693909,0.00030035354,0.4921315,0.0014448443,0.0010460699,0.00036344532,0.00006431637,0.00016361321,0.40754676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944581,0.000037414367,0.0010874207,0.0014803465,0.002227939,0.0007087864],"domain_scores_gemma":[0.9939997,0.0014279536,0.00033461553,0.0011528555,0.0028917077,0.00019312603],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011477371,0.00074822275,0.0009253213,0.0010980316,0.00026866206,0.0002865446,0.003366652,0.0004774661,0.00001670277],"category_scores_gemma":[0.0013454504,0.00076002826,0.00015416228,0.00056155625,0.0004276715,0.00025114848,0.0030886717,0.0013457179,0.0009875741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006924753,0.000025639525,0.00002366128,0.00007116084,0.00015797476,0.00016007914,0.0018032956,0.2222731,0.000004302546,0.7077052,0.016018948,0.051749703],"study_design_scores_gemma":[0.00010433124,0.00030678278,0.000089183115,0.0015072201,0.000028189594,0.00011688558,0.0006243106,0.041481048,0.00012135296,0.577298,0.37658447,0.001738249],"about_ca_topic_score_codex":0.000040554518,"about_ca_topic_score_gemma":0.00016387636,"teacher_disagreement_score":0.4068062,"about_ca_system_score_codex":0.00051309564,"about_ca_system_score_gemma":0.00020230656,"threshold_uncertainty_score":0.99979025},"labels":[],"label_agreement":null},{"id":"W1489256982","doi":"10.1002/wcm.1115","title":"Extending <scp>P</scp>2<scp>PMesh</scp>: topology‐aware schemes for efficient peer‐to‐peer data sharing in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Distributed computing; Mesh networking; Order One Network Protocol; Wireless network; Peer-to-peer; File sharing; Network topology; Network architecture; Wireless; The Internet; Telecommunications","score_opus":0.04527434774316845,"score_gpt":0.3119593673890261,"score_spread":0.2666850196458576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489256982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4618439,0.0009513201,0.532518,0.0017457594,0.00033106617,0.0015618732,0.000022109029,0.0006904977,0.0003354131],"genre_scores_gemma":[0.88703877,0.00021982667,0.11101463,0.00037023833,0.00011069821,0.0006816946,0.00014941896,0.000060356033,0.00035435756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544007,0.00017353203,0.00095813745,0.0015644517,0.00050801627,0.0013557802],"domain_scores_gemma":[0.98828393,0.0034923952,0.00036377026,0.006849563,0.00068674504,0.00032361608],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0022492795,0.0005171007,0.00071481353,0.000598512,0.0011517886,0.00092078646,0.011516501,0.00032447517,0.0000013603118],"category_scores_gemma":[0.0010298021,0.0005486082,0.00009972407,0.0017233768,0.0002966716,0.0005594049,0.020923285,0.00087517744,0.00002400899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003370064,0.0007008634,0.01593161,0.00016739595,0.00017783763,0.000013563596,0.00866474,0.07072573,0.001116003,0.118050925,0.034979116,0.74946886],"study_design_scores_gemma":[0.00043720438,0.00009625113,0.0018995324,0.00032675528,0.000015571712,0.00002260083,0.002602226,0.96527606,0.00021978153,0.00045664285,0.028443187,0.00020419656],"about_ca_topic_score_codex":0.00022349898,"about_ca_topic_score_gemma":0.00012550791,"teacher_disagreement_score":0.8945503,"about_ca_system_score_codex":0.00017242588,"about_ca_system_score_gemma":0.00009325975,"threshold_uncertainty_score":0.99969655},"labels":[],"label_agreement":null},{"id":"W1491795672","doi":"","title":"U-P2P: a peer-to-peer framework for universal resource sharing and discovery","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; File sharing; World Wide Web; Peer-to-peer; Shared resource; Software deployment; XML; Data sharing; Architecture; Authentication (law); Resource (disambiguation); Computer security; The Internet; Computer network; Software engineering","score_opus":0.021165353629417,"score_gpt":0.2647381600185661,"score_spread":0.2435728063891491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491795672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033965528,0.00005221427,0.9358495,0.021412574,0.00024221321,0.00042569806,0.0000053805375,0.0007709758,0.007275949],"genre_scores_gemma":[0.31446907,0.000002307688,0.66256624,0.0018850315,0.000060601084,0.000043103504,0.0000018890822,0.000024288242,0.020947427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978187,0.000024968633,0.00020438909,0.0008391937,0.0004848933,0.0006278331],"domain_scores_gemma":[0.9982415,0.00029983863,0.000049021324,0.0010512553,0.00015887707,0.00019952128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062471285,0.00023248387,0.00023926373,0.00025379923,0.00019639263,0.0005969376,0.0014721566,0.00017965416,0.000007836215],"category_scores_gemma":[0.0012630598,0.00021629134,0.00006563918,0.00085291796,0.000059014194,0.00059506355,0.0010364079,0.00025011468,0.000034040215],"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.000013327747,0.000023885259,0.0014119087,0.00000827077,0.00001939016,0.000011467936,0.000551226,0.00047053926,0.00008475169,0.9540417,0.035256673,0.008106858],"study_design_scores_gemma":[0.0005636446,0.00037927006,0.001091892,0.000105836676,0.000017509792,0.000036288588,0.0008690476,0.011897448,0.0035436056,0.20572601,0.77491605,0.00085338467],"about_ca_topic_score_codex":0.000021060838,"about_ca_topic_score_gemma":0.000023931982,"teacher_disagreement_score":0.7483157,"about_ca_system_score_codex":0.00008900362,"about_ca_system_score_gemma":0.000044432352,"threshold_uncertainty_score":0.8820105},"labels":[],"label_agreement":null},{"id":"W1492903215","doi":"10.1109/ipdps.2015.91","title":"Monitoring Large-Scale Location-Based Information Systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Middleware (distributed applications); Distributed computing; Node (physics); Focus (optics); Process (computing); Real-time computing; Replication (statistics); Aggregate (composite); Observer (physics); Data mining; Database","score_opus":0.022600083318909014,"score_gpt":0.24755095677169203,"score_spread":0.22495087345278303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492903215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072404235,0.00006815342,0.9845582,0.0012681768,0.0010151648,0.00016986037,7.1306107e-7,0.0013413961,0.0043378705],"genre_scores_gemma":[0.90211654,5.949771e-7,0.097420596,0.00015343979,0.0000617282,0.000043913366,0.000001920954,0.000003053331,0.0001981947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990858,0.000016829377,0.00018983938,0.00013318626,0.00034032762,0.00023405683],"domain_scores_gemma":[0.9989724,0.000032348842,0.000054082535,0.0005163401,0.00032121982,0.00010360526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038444583,0.0000835532,0.0000868596,0.00016397973,0.00005593746,0.0002749898,0.0007895839,0.00006319164,5.2941164e-7],"category_scores_gemma":[0.00010203865,0.000074988275,0.000014203807,0.00074762694,0.000009940781,0.001027924,0.00019489806,0.00007084713,0.00045495556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014856151,0.00013899694,0.045589395,0.00010687517,0.00002791771,0.000007024361,0.0045878454,0.61894166,0.00013332962,0.10636153,0.1003419,0.123748645],"study_design_scores_gemma":[0.00034399296,0.00006867853,0.0020891235,0.00005300404,0.0000019420693,0.0000031638326,0.0007534292,0.94305724,0.003995564,0.0003462067,0.049069956,0.00021768932],"about_ca_topic_score_codex":0.00006586263,"about_ca_topic_score_gemma":0.000006358753,"teacher_disagreement_score":0.8948761,"about_ca_system_score_codex":0.00011354591,"about_ca_system_score_gemma":0.000100209756,"threshold_uncertainty_score":0.5847685},"labels":[],"label_agreement":null},{"id":"W1495063990","doi":"","title":"Small-Scale Peer-to-Peer Publish/Subscribe","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Hash table; Publication; Distributed hash table; Distributed computing; Peer-to-peer; Computer network; Load balancing (electrical power); Scale (ratio); Hash function; Computer security; Database; Grid","score_opus":0.028214826919516406,"score_gpt":0.24612621343574514,"score_spread":0.21791138651622874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495063990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02770741,0.00005079717,0.58070594,0.31170154,0.00077196286,0.00040073882,0.0000052589685,0.003761994,0.07489437],"genre_scores_gemma":[0.25376764,0.000002622657,0.64566165,0.011611605,0.00036376176,0.00008913522,0.0000058635587,0.000031751406,0.088465944],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962042,0.000041368927,0.00043010098,0.0010335633,0.0012053753,0.0010854177],"domain_scores_gemma":[0.99654716,0.000097694974,0.00006775626,0.0020955298,0.0007276103,0.00046423438],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009524454,0.00035094348,0.00033242506,0.0005113067,0.00017719164,0.0010316096,0.004796743,0.00022499521,0.00015517019],"category_scores_gemma":[0.00051372964,0.00031692346,0.00012086264,0.0020391797,0.00006508419,0.0011709955,0.00227482,0.0003874173,0.0035079534],"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.000004097511,0.000080169404,0.0006065052,0.0000026869127,0.000014210251,0.000012294461,0.00048054845,0.0007076851,0.00046616016,0.034378365,0.74463826,0.218609],"study_design_scores_gemma":[0.000267997,0.00013519895,0.003432282,0.000013478959,0.000005798029,0.00003292339,0.000092221606,0.01026047,0.009747904,0.0027547455,0.9726673,0.00058971223],"about_ca_topic_score_codex":0.00008772291,"about_ca_topic_score_gemma":0.00083268905,"teacher_disagreement_score":0.30008993,"about_ca_system_score_codex":0.0001763482,"about_ca_system_score_gemma":0.00009150329,"threshold_uncertainty_score":0.9999283},"labels":[],"label_agreement":null},{"id":"W1498349721","doi":"10.1007/978-3-642-05437-2_4","title":"Open Problems in Web 2.0 User Content Sharing","year":2009,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","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 British Columbia","funders":"","keywords":"Computer science; World Wide Web; Web service; Domain (mathematical analysis); Point (geometry); Web content; Service provider; Service (business); Internet privacy; The Internet; Business","score_opus":0.03174003990605684,"score_gpt":0.2751687377529619,"score_spread":0.24342869784690507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498349721","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007208331,0.025447901,0.03878744,0.031370893,0.00028792757,0.0042637796,0.000017662192,0.0023947465,0.89670885],"genre_scores_gemma":[0.27587235,0.2179827,0.41973698,0.009482537,0.000039736773,0.0028454023,0.00036583844,0.00012200265,0.07355245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981968,0.000018328801,0.0009405997,0.00034849677,0.00019719897,0.00029857847],"domain_scores_gemma":[0.99711907,0.000064772554,0.0005079972,0.0021158725,0.00015134599,0.00004096882],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005379521,0.0002842467,0.00044049925,0.0017870056,0.000103445745,0.00030846166,0.0064727953,0.00055153965,0.000007889521],"category_scores_gemma":[0.000104576044,0.00030058032,0.00002757657,0.00053798954,0.0001862525,0.0036548073,0.004893616,0.00090181443,0.00006780417],"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.0000028977004,0.000008356326,0.0001945724,0.00001195922,0.000002623877,6.11376e-7,0.00017676725,0.00021752737,0.0000017410031,0.5842441,0.000093592906,0.41504526],"study_design_scores_gemma":[0.0004130379,0.00006898039,0.00011004124,0.0004470116,0.0000016102717,0.000013403418,0.000090288115,0.002290339,0.000027684804,0.37003002,0.6262272,0.00028039239],"about_ca_topic_score_codex":0.000020239691,"about_ca_topic_score_gemma":0.0009544595,"teacher_disagreement_score":0.82315636,"about_ca_system_score_codex":0.00022205792,"about_ca_system_score_gemma":0.000063988104,"threshold_uncertainty_score":0.9999446},"labels":[],"label_agreement":null},{"id":"W1499173616","doi":"10.1007/978-3-540-71661-7_23","title":"Querying Communities of Interest in Peer Database Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Computer science; Exploit; Peer-to-peer; Information retrieval; Data mining; Database; World Wide Web","score_opus":0.08624009537401506,"score_gpt":0.29228843549128736,"score_spread":0.2060483401172723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499173616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011152386,0.0005381278,0.9934732,0.00096969417,0.0014784394,0.0004202462,0.000009478448,0.00029182452,0.001703806],"genre_scores_gemma":[0.5465286,0.00006850931,0.45168006,0.0013141908,0.00020571498,0.000010324909,0.000015274201,0.000041114134,0.00013624261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99594474,0.00006047891,0.0009325195,0.0011154971,0.00090869947,0.0010380668],"domain_scores_gemma":[0.99487907,0.0011855894,0.0003746366,0.0029516476,0.00044991547,0.00015912991],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002874439,0.0006289204,0.0008241294,0.0026897658,0.000155144,0.00034263646,0.00848417,0.00051214814,0.000010409482],"category_scores_gemma":[0.0002429466,0.00061858055,0.00011614278,0.0017618166,0.0012426255,0.0007085785,0.0067151813,0.002050286,0.000014272683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016488792,0.000058999653,0.00078026036,0.00006368514,0.000015077616,0.00024073744,0.0018427104,0.16944471,0.00006630412,0.05873506,0.00016071952,0.76857525],"study_design_scores_gemma":[0.00043263132,0.00032168874,0.00060982275,0.0031054895,0.000008813286,0.00010641247,0.000006027289,0.89527935,0.0012788892,0.09470067,0.0027534137,0.0013967964],"about_ca_topic_score_codex":0.0003462911,"about_ca_topic_score_gemma":0.008188999,"teacher_disagreement_score":0.7671785,"about_ca_system_score_codex":0.00040139866,"about_ca_system_score_gemma":0.00028690428,"threshold_uncertainty_score":0.9996266},"labels":[],"label_agreement":null},{"id":"W1501265710","doi":"10.5555/1045658.1045669","title":"iOverlay: a lightweight middleware infrastructure for overlay application implementations","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PlanetLab; Testbed; Computer science; Overlay; Overlay network; Implementation; Middleware (distributed applications); Distributed computing; Set (abstract data type); Computer network; Embedded system; Operating system; Software engineering; The Internet; Programming language","score_opus":0.009407844511349708,"score_gpt":0.2653327606953369,"score_spread":0.2559249161839872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501265710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009831841,0.00003051011,0.9750522,0.011999341,0.00017938092,0.0008103054,0.000025811809,0.0009988593,0.0010717595],"genre_scores_gemma":[0.4643254,0.0000028131574,0.5337399,0.0012204504,0.00007089104,0.00039670875,0.000023354052,0.0000112485295,0.00020920376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987009,0.000007031273,0.00023157848,0.00047066418,0.0002247821,0.00036501454],"domain_scores_gemma":[0.99889046,0.00005643833,0.000074782874,0.00076558837,0.00012324053,0.000089519475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009932726,0.00016136286,0.00014010946,0.00016075568,0.00017816572,0.0001401892,0.0011112065,0.000092298425,0.000013542789],"category_scores_gemma":[0.00003922793,0.0001422302,0.00006634204,0.0007218563,0.000023550956,0.00037482768,0.000312466,0.0000880139,0.000059094044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048583806,0.000038432645,0.00078551023,0.000012124267,0.000026819498,0.0000015645821,0.000469288,0.003266574,0.0023289649,0.8710377,0.041609947,0.08041821],"study_design_scores_gemma":[0.0015900437,0.0003233152,0.012979903,0.000025437268,0.000020216583,0.000028296807,0.0002657045,0.0077256192,0.03378442,0.49285966,0.44967657,0.00072079524],"about_ca_topic_score_codex":0.00005872237,"about_ca_topic_score_gemma":0.00018422554,"teacher_disagreement_score":0.45449355,"about_ca_system_score_codex":0.00017734004,"about_ca_system_score_gemma":0.00009747656,"threshold_uncertainty_score":0.5799979},"labels":[],"label_agreement":null},{"id":"W150141253","doi":"10.1002/cpe.1188","title":"Gossip‐based search selection in hybrid peer‐to‐peer networks","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gossip; Peer-to-peer; Distributed hash table; Flooding (psychology); Popularity; Bandwidth (computing); Distributed computing; Computer network","score_opus":0.027226153535240907,"score_gpt":0.3487067222338325,"score_spread":0.3214805686985916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W150141253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21283357,0.00032835334,0.77911675,0.0066525815,0.00027015505,0.00023574513,6.761825e-7,0.0001811395,0.0003810049],"genre_scores_gemma":[0.9530225,0.000043491433,0.04518657,0.0016018135,0.00005410396,0.000035373727,0.0000035278103,0.0000069052717,0.000045706325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997985,0.0000983667,0.00032818178,0.00061707397,0.0005108245,0.0004605226],"domain_scores_gemma":[0.998404,0.0006667016,0.00009328387,0.0001793335,0.0004630366,0.00019362303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014219403,0.00017798743,0.00017204956,0.00031340064,0.00024018408,0.00035799725,0.00038352303,0.00008015129,0.0000028861089],"category_scores_gemma":[0.0007960972,0.00018634766,0.000018275588,0.0013257208,0.00009356579,0.0012311783,0.00025442024,0.00034436642,0.00001291533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009233526,0.000116287476,0.0030876324,0.000014429061,0.000007585499,0.000067807065,0.010018822,0.02701268,0.0002884572,0.008078804,0.0016709968,0.9495442],"study_design_scores_gemma":[0.00075611443,0.00055658724,0.017490594,0.00008654938,0.000008055584,0.00016608444,0.0031973503,0.93679106,0.0020042507,0.000898305,0.037449546,0.0005955246],"about_ca_topic_score_codex":0.00007881269,"about_ca_topic_score_gemma":0.000024240655,"teacher_disagreement_score":0.9489486,"about_ca_system_score_codex":0.000057598012,"about_ca_system_score_gemma":0.00007656048,"threshold_uncertainty_score":0.7599037},"labels":[],"label_agreement":null},{"id":"W1504877823","doi":"10.22215/etd/2012-07026","title":"Exposing resources as web services : a performance oriented approach","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"World Wide Web; Computer science; Library science; Humanities; Art","score_opus":0.008884601222494069,"score_gpt":0.23081099328238833,"score_spread":0.22192639205989426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504877823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8439248,0.0008929096,0.005734478,0.00017183096,0.001085866,0.00044134475,0.0000019755043,0.0023716968,0.14537507],"genre_scores_gemma":[0.85035574,0.000057086367,0.12628438,0.00029086255,0.00022979791,0.00017372402,0.00017514566,0.000053457617,0.022379814],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99737644,0.000031554748,0.00038038255,0.00080636004,0.00069294614,0.00071232003],"domain_scores_gemma":[0.9981248,0.000041550615,0.00024399476,0.0012585905,0.00018002185,0.000151072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030467674,0.00044543712,0.00038414088,0.0005127061,0.0002616228,0.00033156277,0.0029000202,0.00044670515,0.000023519126],"category_scores_gemma":[0.000019576306,0.00038977785,0.00008762569,0.0012640768,0.00002666657,0.00079730805,0.0005225125,0.00046980957,0.00035523603],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003156644,0.0009550321,0.010342882,0.0038912587,0.00052196917,0.000041897267,0.08029642,0.0008298582,0.011746499,0.0699868,0.018335348,0.8027364],"study_design_scores_gemma":[0.0015752846,0.001191081,0.057827644,0.0028908518,0.00025683292,0.00021165678,0.022699049,0.32467434,0.043671586,0.0015430885,0.53637993,0.0070786583],"about_ca_topic_score_codex":0.000095931755,"about_ca_topic_score_gemma":0.00012786493,"teacher_disagreement_score":0.7956577,"about_ca_system_score_codex":0.00008076771,"about_ca_system_score_gemma":0.000085248634,"threshold_uncertainty_score":0.9998554},"labels":[],"label_agreement":null},{"id":"W1505430488","doi":"10.1109/icdcs.2015.56","title":"Dynamoth: A Scalable Pub/Sub Middleware for Latency-Constrained Applications in the Cloud","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Server; Scalability; Cloud computing; Latency (audio); Distributed computing; Load balancing (electrical power); Computer network; Middleware (distributed applications); Context (archaeology); Channel (broadcasting); Operating system; Telecommunications","score_opus":0.039649732389503124,"score_gpt":0.2645065279725833,"score_spread":0.22485679558308017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505430488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012947177,0.00009353779,0.9560829,0.01999358,0.00017078836,0.0013082933,0.000009635461,0.0007706802,0.008623432],"genre_scores_gemma":[0.7785312,0.0000030967642,0.21838026,0.0010879346,0.000077012344,0.0011021128,0.000009690062,0.000011198287,0.0007975275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987322,0.00003120694,0.00021576074,0.0003807199,0.00023387505,0.00040619864],"domain_scores_gemma":[0.9985698,0.00021027071,0.000045642093,0.00095707213,0.0001305546,0.000086659405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006628547,0.00013553721,0.00014676784,0.00013792136,0.00009596505,0.00017206022,0.0022425996,0.00009364622,0.000002056592],"category_scores_gemma":[0.00016010815,0.000092426395,0.00004744009,0.001162139,0.00007459724,0.00022518136,0.0003167262,0.00012760368,0.00006436213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009009537,0.00022017583,0.0022412734,0.00001866106,0.000018252258,0.000006764862,0.001806979,0.00097437593,0.00021875449,0.83167666,0.07614441,0.08666471],"study_design_scores_gemma":[0.0018458251,0.00045953027,0.0033898542,0.000054287182,0.000019868166,0.00005962365,0.0034903875,0.22686699,0.0031062493,0.54653734,0.2131682,0.001001862],"about_ca_topic_score_codex":0.000048513473,"about_ca_topic_score_gemma":0.00029503263,"teacher_disagreement_score":0.765584,"about_ca_system_score_codex":0.00006688568,"about_ca_system_score_gemma":0.00011272573,"threshold_uncertainty_score":0.41673452},"labels":[],"label_agreement":null},{"id":"W1505640023","doi":"10.1109/sai.2015.7237149","title":"Minecraft computer game performance analysis and network traffic emulation by a custom bot","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital","funders":"","keywords":"Emulation; Computer science; Server; Workload; Operating system; Computer network","score_opus":0.013159331048150204,"score_gpt":0.22390976647784563,"score_spread":0.21075043542969543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505640023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42646495,0.00013406755,0.5709625,0.0013897958,0.00012698893,0.00010623265,6.85417e-7,0.0005925856,0.00022219004],"genre_scores_gemma":[0.81611013,0.000010816914,0.18274753,0.00048095224,0.00009090951,0.000010640455,0.000006898666,0.0000068257345,0.0005353235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846303,0.000039151524,0.00024748498,0.00050394045,0.00033017414,0.00041618897],"domain_scores_gemma":[0.99895084,0.000062593186,0.000071976334,0.00062317227,0.00010477849,0.00018665448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037003212,0.00018601057,0.000290658,0.0002504681,0.000069126094,0.00022023104,0.00073392934,0.00010278291,0.0000046802625],"category_scores_gemma":[0.000014789635,0.00016234293,0.00005389272,0.002253985,0.000051477997,0.00045735293,0.0004670853,0.00012312482,0.00004996878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010666787,0.000043877957,0.021322489,0.0000055255077,0.00014761508,0.0000054543743,0.00046635515,0.5537703,0.000025757616,0.0006714868,0.1572999,0.26623058],"study_design_scores_gemma":[0.00021097493,0.00013730218,0.015155643,0.0000067557994,0.000037026442,0.000006432791,0.000008195418,0.9707794,0.00006095508,0.0001156156,0.01325407,0.00022760966],"about_ca_topic_score_codex":0.000021180038,"about_ca_topic_score_gemma":0.000058790552,"teacher_disagreement_score":0.41700912,"about_ca_system_score_codex":0.00005169572,"about_ca_system_score_gemma":0.000025436408,"threshold_uncertainty_score":0.66201526},"labels":[],"label_agreement":null},{"id":"W1507165467","doi":"10.1016/b978-155860869-6/50120-7","title":"A-Topss — A Publish/Subscribe System Supporting Approximate Matching","year":2002,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":37,"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 Toronto","funders":"","keywords":"Computer science; Matching (statistics); Publication; Mathematics; Business; Statistics; Advertising","score_opus":0.019701623222465527,"score_gpt":0.2279082520886557,"score_spread":0.20820662886619018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507165467","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003057256,0.000730735,0.014706522,0.0007349866,0.0014921343,0.0011793958,0.000026610383,0.0043994975,0.97669953],"genre_scores_gemma":[0.0048424457,0.000017190543,0.052243404,0.00059611193,0.00047526674,0.00018129504,0.000015393993,0.00019867654,0.9414302],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99423474,0.000057625606,0.0013362543,0.0017780237,0.0012048945,0.0013884832],"domain_scores_gemma":[0.9951526,0.000121280755,0.0009420115,0.0031388416,0.00027521432,0.00037007043],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011209309,0.0010426766,0.001260275,0.00078613235,0.00036035373,0.0013213406,0.00498448,0.00083063234,0.00004192616],"category_scores_gemma":[0.00006772817,0.0010279411,0.00043135067,0.00014196895,0.00013722038,0.0005173439,0.0030919365,0.0014165684,0.0008068848],"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.0000020054,0.0000060840507,0.0000023798004,0.00023097578,0.00007775249,0.0003272309,0.0005092064,0.000011207883,0.0000112693,0.17472136,0.0019494647,0.82215106],"study_design_scores_gemma":[0.00025579537,0.000086540706,0.000004553164,0.001811864,0.000073187766,0.00041327794,0.000057692137,0.003273885,0.000078490615,0.032751806,0.95962787,0.0015650474],"about_ca_topic_score_codex":0.0000022448012,"about_ca_topic_score_gemma":0.0000111393,"teacher_disagreement_score":0.9576784,"about_ca_system_score_codex":0.0004900539,"about_ca_system_score_gemma":0.00013385057,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W1509875427","doi":"10.1109/drcn.2015.7149019","title":"Network coding for coping with flash crowd in P2P multi-channel live video streaming","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Crowds; Software deployment; Video streaming; Live streaming; Overlay; Computer network; Coding (social sciences); Linear network coding; Overlay network; Multimedia; Bandwidth (computing); Peer-to-peer; Computer security; World Wide Web; The Internet; Operating system","score_opus":0.06007445941139663,"score_gpt":0.27461967127177944,"score_spread":0.2145452118603828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509875427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011210844,0.00013955876,0.9838602,0.0024217914,0.00033686176,0.00058061595,0.0000014273645,0.00088901166,0.0005597053],"genre_scores_gemma":[0.44457632,0.000004303993,0.5536915,0.0009786191,0.00011076955,0.0001241391,0.000002021367,0.000020183477,0.00049213157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981566,0.000030297053,0.00026959632,0.00057019514,0.00024947923,0.00072379666],"domain_scores_gemma":[0.99872756,0.00026775093,0.00009024041,0.0005692814,0.0001673366,0.00017785167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056069816,0.00022096212,0.00028447405,0.00017793673,0.00010836013,0.00020532924,0.0011143774,0.00011303161,0.0000013583214],"category_scores_gemma":[0.00027199046,0.00019006517,0.0000336222,0.0007936808,0.000048755042,0.00047629225,0.000685568,0.0001767857,0.000036986723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001667566,0.00026007256,0.0107751535,0.000096601965,0.000106406565,0.0001859316,0.009726033,0.682709,0.00021001448,0.04001703,0.20071685,0.05503018],"study_design_scores_gemma":[0.0025127097,0.0006344167,0.0010712584,0.00044714983,0.000010262587,0.000026923366,0.00092558557,0.977277,0.0015480232,0.008350207,0.0063584563,0.0008380054],"about_ca_topic_score_codex":0.0001185872,"about_ca_topic_score_gemma":0.0012684257,"teacher_disagreement_score":0.43336546,"about_ca_system_score_codex":0.00016286671,"about_ca_system_score_gemma":0.00011388593,"threshold_uncertainty_score":0.7750633},"labels":[],"label_agreement":null},{"id":"W1514719533","doi":"","title":"Databases, Information Systems, and Peer-to-Peer Computing : Second International Workshop, DBISP2P 2004, Toronto, Canada, August 29-30, 2004 : revised selected papers","year":2005,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interoperation; Computer science; World Wide Web; Scalability; Data science; Database; Interoperability","score_opus":0.011917734990116712,"score_gpt":0.2304003728756849,"score_spread":0.21848263788556818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514719533","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005852066,0.0034025717,0.06492569,0.0038374362,0.006580367,0.0034695952,0.0008591347,0.002635119,0.9137049],"genre_scores_gemma":[0.01754531,0.00002539034,0.033110306,0.0029660347,0.001608342,0.00013785802,0.0007790207,0.00014484086,0.9436829],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99452436,0.000073953954,0.0011801254,0.0011152314,0.002061997,0.0010443297],"domain_scores_gemma":[0.995702,0.00022126442,0.0006353665,0.0016280013,0.0013329482,0.00048037156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009132367,0.0008505651,0.0008200582,0.00046387938,0.00030742798,0.0009669031,0.0028558741,0.00045100896,0.00017779932],"category_scores_gemma":[0.00045755156,0.00093395176,0.000091522386,0.00022013491,0.0000866876,0.0008210228,0.0021674999,0.0010320581,0.00008831287],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017953396,0.000010735094,0.00006232716,0.00017350655,0.0002192261,0.000047693502,0.00046952334,0.0013341537,0.000029160308,0.0061727064,0.87183,0.11963303],"study_design_scores_gemma":[0.00042398402,0.00003560385,0.0006323732,0.00083535886,0.00003694033,0.00005101992,0.00007449867,0.0039467253,0.000044086937,0.000021446554,0.99288756,0.0010103903],"about_ca_topic_score_codex":0.031399295,"about_ca_topic_score_gemma":0.25167173,"teacher_disagreement_score":0.22027242,"about_ca_system_score_codex":0.0037103847,"about_ca_system_score_gemma":0.0024487951,"threshold_uncertainty_score":0.9993111},"labels":[],"label_agreement":null},{"id":"W1517726756","doi":"10.1007/978-3-642-33651-5_6","title":"A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Computer science; Scalability; Overlay network; Search engine indexing; Overlay; Data structure; Node (physics); Rendering (computer graphics); Theoretical computer science; Distributed computing; Set (abstract data type); Algorithm; Parallel computing; Database; Information retrieval; The Internet; Operating system; Programming language","score_opus":0.03427233514111038,"score_gpt":0.28185814085391514,"score_spread":0.24758580571280475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517726756","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004591252,0.0013650507,0.9928329,0.0020293088,0.0015864393,0.0016043126,0.000023944762,0.00042716545,0.00008498849],"genre_scores_gemma":[0.006159761,0.00007384248,0.9912939,0.0016291075,0.00047532388,0.00012605975,0.000014624934,0.000043277123,0.00018412151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958093,0.000045770408,0.0005382456,0.0016245315,0.000876023,0.0011061394],"domain_scores_gemma":[0.99749446,0.000495356,0.00029924366,0.0010525855,0.00039689775,0.00026144503],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015181301,0.0006035902,0.0005686728,0.0010743436,0.00031600863,0.0011197984,0.00326321,0.0003751953,0.000012567706],"category_scores_gemma":[0.00009322213,0.00056878023,0.00010131433,0.00078023534,0.00025494126,0.0015078686,0.0020379417,0.00046866506,0.000015178891],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036509837,0.00001157378,0.000006697912,0.00001405241,0.00001379808,0.000008420639,0.00042990904,0.002952336,0.00022937567,0.016426725,0.0004698892,0.9794336],"study_design_scores_gemma":[0.00071629544,0.00036956187,0.00008494573,0.00012550842,0.000020494954,0.00008042037,6.167328e-7,0.8951901,0.007932234,0.08400059,0.01044714,0.0010320751],"about_ca_topic_score_codex":0.000014744641,"about_ca_topic_score_gemma":0.000039525912,"teacher_disagreement_score":0.9784015,"about_ca_system_score_codex":0.00026455856,"about_ca_system_score_gemma":0.0003382889,"threshold_uncertainty_score":0.99991715},"labels":[],"label_agreement":null},{"id":"W1518101212","doi":"10.1007/3-540-45034-3_61","title":"Adaptive Resource Location in a Peer-to-Peer Network","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Flooding (psychology); Computer science; Computer network; Protocol (science); Peer-to-peer; Distributed computing; Resource (disambiguation)","score_opus":0.027549570979091283,"score_gpt":0.2638589108989674,"score_spread":0.23630933991987613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518101212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010124242,0.00040336465,0.9789583,0.009613346,0.0016124331,0.0010643956,0.00000412745,0.00064966764,0.0075931395],"genre_scores_gemma":[0.09350463,0.000008379206,0.8959467,0.006951123,0.001051516,0.00004804266,0.000008922697,0.00007969995,0.0024009896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99129623,0.000065798034,0.00094850035,0.0028465868,0.0030063812,0.0018364895],"domain_scores_gemma":[0.9945388,0.0008615815,0.0003314562,0.002776538,0.0010983429,0.00039328865],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0041853627,0.000890936,0.0008666382,0.00274606,0.00027614826,0.0006417461,0.007829761,0.0007933205,0.000008504446],"category_scores_gemma":[0.00074559654,0.0009004058,0.00012683748,0.0054626036,0.00061998126,0.0005669462,0.004363779,0.0018812957,0.00021929103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018848204,0.000021268592,0.00007083878,0.000009239779,0.000006910267,0.00014503293,0.0008336215,0.42252907,0.0000076276765,0.01627514,0.0016183777,0.558464],"study_design_scores_gemma":[0.0006097928,0.0011837543,0.0016789534,0.0020696719,0.00001398977,0.00014274249,0.0000029658277,0.6404054,0.00054962304,0.24162167,0.108959354,0.0027620585],"about_ca_topic_score_codex":0.000086094195,"about_ca_topic_score_gemma":0.0012083357,"teacher_disagreement_score":0.555702,"about_ca_system_score_codex":0.0012122408,"about_ca_system_score_gemma":0.00062987435,"threshold_uncertainty_score":0.99934465},"labels":[],"label_agreement":null},{"id":"W1518948785","doi":"","title":"dAMP: A JXTA-BASED PEER-TO-PEER MEDIA PLAYER","year":2003,"lang":"en","type":"article","venue":"Journal of the Association for Information Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; File sharing; Upload; World Wide Web; The Internet; Download; Shared resource; Task (project management); Transparency (behavior); Peer-to-peer; Multimedia; Computer security; Engineering","score_opus":0.01651489650297567,"score_gpt":0.2441637179840116,"score_spread":0.22764882148103593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518948785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016691765,0.00005368475,0.9222787,0.039822537,0.011713759,0.0014820484,0.000072570714,0.00027171528,0.0076132203],"genre_scores_gemma":[0.9771087,8.9494006e-7,0.018988047,0.0016759377,0.00018932129,0.000053405973,0.000005120921,0.000010473189,0.0019680692],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99625105,0.00014333712,0.0010675741,0.000098782,0.0021060256,0.00033325847],"domain_scores_gemma":[0.9936946,0.00053377164,0.0018891983,0.00046320498,0.00328968,0.00012953236],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005633563,0.00015372358,0.00031127766,0.00047901444,0.00020678998,0.00063508365,0.0014439701,0.00017742265,0.0000015838652],"category_scores_gemma":[0.008814179,0.00010984808,0.00021305875,0.0010444206,0.000008712328,0.001701631,0.00009796515,0.0002470361,0.00010937565],"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.000041737192,0.000057630234,0.0073005445,0.00005315455,0.00018427645,9.5142934e-7,0.006195563,0.11391866,0.00013886079,0.08540545,0.78260714,0.004096026],"study_design_scores_gemma":[0.00096639124,0.000110360685,0.0030920114,0.000084532,0.000022497712,0.000024113036,0.0004749763,0.009389771,0.0013847331,0.0007219155,0.98352814,0.00020055367],"about_ca_topic_score_codex":0.00000579998,"about_ca_topic_score_gemma":0.0000051542465,"teacher_disagreement_score":0.960417,"about_ca_system_score_codex":0.0008822834,"about_ca_system_score_gemma":0.00025463686,"threshold_uncertainty_score":0.999535},"labels":[],"label_agreement":null},{"id":"W1520245762","doi":"10.1023/a:1009610406858","title":"Prioritized Admission Strategies to Improve User-Perceived Performance in Interactive VOD Servers","year":2001,"lang":"en","type":"article","venue":"Multimedia Tools 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 British Columbia","funders":"","keywords":"Computer science; Throughput; Queueing theory; Server; Scheduling (production processes); Computer network; Real-time computing; Response time; Operating system; Wireless","score_opus":0.01655530067535623,"score_gpt":0.2729092511400736,"score_spread":0.2563539504647174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520245762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8273145,0.000052071657,0.16395345,0.004789089,0.00011322049,0.0016102975,0.000017155438,0.00050273584,0.0016474683],"genre_scores_gemma":[0.9034927,0.00010722926,0.09494748,0.00023068138,0.000054114338,0.0009115682,0.000009089659,0.000009452169,0.00023769817],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987927,0.00001846304,0.00022776141,0.0004923066,0.00015139098,0.00031737445],"domain_scores_gemma":[0.99904346,0.00013599166,0.000053097483,0.0005189598,0.000081755476,0.0001667504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011941759,0.00016197894,0.0001786388,0.00016679414,0.000120343946,0.0002548759,0.00069372536,0.00008443893,0.000006121457],"category_scores_gemma":[0.00006099736,0.00015189679,0.000025195517,0.0007297563,0.000039363422,0.00078701036,0.00036862577,0.00019658821,0.00007776424],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035331606,0.00011388484,0.004478813,0.000015321488,0.0000102745935,0.0000055491164,0.0017874043,0.00061962573,0.01924669,0.0019916843,0.00042970708,0.97126573],"study_design_scores_gemma":[0.0017892115,0.0003083881,0.7156973,0.00017560138,0.000012440314,0.000019622434,0.0018550069,0.12971479,0.0059705894,0.001660905,0.14191827,0.00087789446],"about_ca_topic_score_codex":0.0000497809,"about_ca_topic_score_gemma":0.0001071286,"teacher_disagreement_score":0.9703878,"about_ca_system_score_codex":0.000076243574,"about_ca_system_score_gemma":0.000064701,"threshold_uncertainty_score":0.61941713},"labels":[],"label_agreement":null},{"id":"W1521273090","doi":"10.1007/978-3-540-89524-4_23","title":"Small-World Peer-to-Peer for Resource Discovery","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Surrey Place Centre","funders":"","keywords":"Peer-to-peer; Computer science; Resource (disambiguation); Distributed computing; Node (physics); Set (abstract data type); Range (aeronautics); Computer network; World Wide Web; Engineering","score_opus":0.03219567945958474,"score_gpt":0.253681247292864,"score_spread":0.22148556783327927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521273090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010401253,0.0002905823,0.9639698,0.025420424,0.0024010194,0.0015241959,0.000038612703,0.00093556265,0.005315752],"genre_scores_gemma":[0.014921662,0.000016804373,0.94360024,0.010318604,0.0012071837,0.0001303902,0.000021341313,0.00012292406,0.029660832],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99117625,0.000037325783,0.00088922004,0.003378122,0.0025456124,0.0019734835],"domain_scores_gemma":[0.99331445,0.0012670924,0.00034291547,0.0036797493,0.00093868887,0.00045707912],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018908699,0.0010865012,0.0010644707,0.0029062098,0.0006336121,0.0014082389,0.011236773,0.0005505921,0.000005855663],"category_scores_gemma":[0.0009435498,0.0010271781,0.00033291936,0.0025272162,0.00085136254,0.0007972609,0.0061813695,0.001325498,0.00012496849],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003564607,0.00005464265,0.00005570417,0.000047223737,0.00003244317,0.0002043188,0.0012597111,0.078605555,0.00010341319,0.02695417,0.026790392,0.86585677],"study_design_scores_gemma":[0.0005582408,0.00073748233,0.00021506219,0.00075834815,0.000020210387,0.00019155118,6.852647e-7,0.102119416,0.003384045,0.08465325,0.8048522,0.0025095171],"about_ca_topic_score_codex":0.0000348382,"about_ca_topic_score_gemma":0.000568794,"teacher_disagreement_score":0.8633473,"about_ca_system_score_codex":0.00073617575,"about_ca_system_score_gemma":0.0007108115,"threshold_uncertainty_score":0.9996284},"labels":[],"label_agreement":null},{"id":"W1522181508","doi":"10.1109/pacrim.2003.1235709","title":"Adaptive topology protocol for network game support","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalability; Quality of service; Computer network; Adaptability; Distributed computing; Host (biology); Protocol (science); Network topology; Atomic broadcast; Adaptation (eye); Network simulation; Topology (electrical circuits); Broadcasting (networking); Operating system; Engineering","score_opus":0.04023778126742928,"score_gpt":0.3195743368330962,"score_spread":0.27933655556566694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522181508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046717225,0.0000013481805,0.9021469,0.008049915,0.00018836926,0.081283994,0.0000010913672,0.0011712561,0.0071104094],"genre_scores_gemma":[0.014178675,1.3526729e-7,0.6619533,0.002257165,0.00018296891,0.31993023,8.623506e-7,0.00001271085,0.0014839984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998405,0.000016592714,0.00023885875,0.0005010121,0.00016617369,0.0006723595],"domain_scores_gemma":[0.9989353,0.00007928443,0.00006763413,0.0007144334,0.000105866304,0.00009749354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025867907,0.0001714567,0.00021030132,0.00008616264,0.00008834933,0.00006728951,0.0014449533,0.00013794667,0.000033021504],"category_scores_gemma":[0.000054627253,0.00014521426,0.00007133149,0.0005095638,0.000081751255,0.00022364403,0.00060317793,0.00012562887,0.00016145274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042107662,0.000062979954,0.000101275815,0.0000070329575,0.000018041539,0.000019954992,0.00014059672,0.009572738,0.000027980479,0.8689516,0.08869546,0.032360207],"study_design_scores_gemma":[0.0019264586,0.0024488969,0.0005878675,0.000030586933,0.0000043827586,0.000056747438,0.000039207047,0.0061599095,0.0037805587,0.54234165,0.44210377,0.00051992165],"about_ca_topic_score_codex":0.000023451066,"about_ca_topic_score_gemma":0.00008697458,"teacher_disagreement_score":0.35340834,"about_ca_system_score_codex":0.0000949398,"about_ca_system_score_gemma":0.00015044175,"threshold_uncertainty_score":0.5921666},"labels":[],"label_agreement":null},{"id":"W1522776861","doi":"10.1007/978-3-642-12963-6_20","title":"Dynamic Service Placement in Shared Service Hosting Infrastructures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Key (lock); Distributed computing; Service (business); Cloud computing; Popularity; Service delivery framework; Virtual machine; Computer network; Computer security; Operating system","score_opus":0.011512831612591713,"score_gpt":0.241461733199528,"score_spread":0.2299489015869363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522776861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034979868,0.00020124555,0.9836108,0.0075249895,0.002289417,0.00087164406,0.000018647379,0.0007265714,0.0012586713],"genre_scores_gemma":[0.11547013,0.000014368541,0.87410754,0.009966266,0.00019894267,0.00004157471,0.00001868912,0.00006985682,0.00011261512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937646,0.000037730344,0.00085557543,0.0025199363,0.0014486739,0.001373507],"domain_scores_gemma":[0.99556917,0.00054745766,0.00040814833,0.0027281311,0.00049511006,0.00025199956],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010357966,0.00093258737,0.0008055582,0.0020319484,0.00029346783,0.00091949356,0.0097649535,0.0008446264,0.000039225582],"category_scores_gemma":[0.00023056744,0.0009145593,0.00008983754,0.003054412,0.00031098915,0.0008029028,0.006669666,0.0025639764,0.00009947439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000222289,0.000048256014,0.0003348907,0.00018590952,0.000023291732,0.00029220968,0.0039951685,0.36537963,0.0038790067,0.0040553054,0.000072308336,0.6217118],"study_design_scores_gemma":[0.0005324447,0.00016864696,0.004142229,0.0011883649,0.000008990891,0.000126068,0.0000012863253,0.8737382,0.0014527588,0.11455764,0.002448335,0.0016349823],"about_ca_topic_score_codex":0.00021906702,"about_ca_topic_score_gemma":0.009592963,"teacher_disagreement_score":0.6200768,"about_ca_system_score_codex":0.0007004861,"about_ca_system_score_gemma":0.0006810246,"threshold_uncertainty_score":0.99973714},"labels":[],"label_agreement":null},{"id":"W1525844770","doi":"10.1007/11590354_83","title":"Grid Resource Discovery Using Semantic Communities","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"University of British Columbia","funders":"","keywords":"Computer science; Semantic grid; Grid; Resource (disambiguation); Variety (cybernetics); Shared resource; Data science; Semantic heterogeneity; Space (punctuation); Semantic Web; World Wide Web; Distributed computing; Information retrieval; Artificial intelligence; Computer network","score_opus":0.02715414463087967,"score_gpt":0.250932070406518,"score_spread":0.22377792577563832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525844770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001107235,0.00074068963,0.99050415,0.002372575,0.0016425488,0.00043919217,0.000010652154,0.00071338075,0.0024695515],"genre_scores_gemma":[0.1923362,0.00006638484,0.80060613,0.0045114933,0.0013940466,0.000012436892,0.00001004802,0.00008874675,0.00097449473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532187,0.000064131,0.0006686892,0.0014115189,0.0013655191,0.0011682468],"domain_scores_gemma":[0.9952096,0.0006833456,0.00032233325,0.0034120495,0.00019013762,0.00018254887],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010278709,0.0007891818,0.00078494137,0.001698369,0.0005416374,0.0015412217,0.009357521,0.00046788604,0.000008685167],"category_scores_gemma":[0.000090391666,0.0007520169,0.00017269042,0.0012344304,0.0013093414,0.0013386331,0.006935626,0.001537545,0.00005498912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008108294,0.000040987296,0.00012759602,0.000049241826,0.000025870288,0.00016388984,0.0019359599,0.37159464,0.00014767879,0.020480609,0.0003410014,0.6050844],"study_design_scores_gemma":[0.0002905747,0.00026292555,0.00014856106,0.001647424,0.000022188258,0.00035771725,0.0000032807327,0.8863145,0.0014342183,0.082079984,0.02549931,0.0019393361],"about_ca_topic_score_codex":0.00011555198,"about_ca_topic_score_gemma":0.00045479392,"teacher_disagreement_score":0.60314506,"about_ca_system_score_codex":0.0006576945,"about_ca_system_score_gemma":0.00046205867,"threshold_uncertainty_score":0.99949527},"labels":[],"label_agreement":null},{"id":"W1527922251","doi":"10.1007/978-3-642-28798-5_51","title":"A Message Prioritization Scheme for Virtual Collaboration","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","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 Ottawa","funders":"","keywords":"Prioritization; Scheme (mathematics); Computer science; Computer network; Engineering; Process management; Mathematics","score_opus":0.00818117423451123,"score_gpt":0.22218289981851197,"score_spread":0.21400172558400074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527922251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041489104,0.0021927971,0.99402106,0.00091722124,0.00044769226,0.00072685356,0.000007513859,0.0008413226,0.00080407294],"genre_scores_gemma":[0.2156463,0.00023822098,0.77799666,0.000604757,0.0013373629,0.0003859469,0.00010176352,0.00025707547,0.0034319193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980904,0.0000082140505,0.00036997904,0.0005667155,0.00034798987,0.00061670324],"domain_scores_gemma":[0.9986479,0.0004907855,0.00010120398,0.00051206397,0.00014475101,0.00010327861],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021549793,0.0004164338,0.00043411247,0.0006354001,0.000051345818,0.00012704277,0.0007713038,0.0007521232,0.0000052973473],"category_scores_gemma":[0.00092621794,0.00044919146,0.00008665536,0.0006918226,0.000014505717,0.00019893731,0.00018533359,0.00070670503,0.000015776994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020483056,0.00002808964,0.0000120552195,0.00005827263,0.000051532956,0.000014298664,0.00018509894,0.106213555,0.005233839,0.56062967,0.0006917517,0.32686138],"study_design_scores_gemma":[0.00060927286,0.0005103236,0.000044093227,0.00030176033,0.000036636684,0.00002272266,3.464306e-7,0.8086789,0.010315199,0.03604003,0.14191723,0.0015234794],"about_ca_topic_score_codex":0.0000015061354,"about_ca_topic_score_gemma":0.000012911099,"teacher_disagreement_score":0.70246536,"about_ca_system_score_codex":0.0004844267,"about_ca_system_score_gemma":0.00010090315,"threshold_uncertainty_score":0.999796},"labels":[],"label_agreement":null},{"id":"W1530896099","doi":"","title":"Cooperation strategies for agent-based P2P systems","year":2003,"lang":"en","type":"article","venue":"Università Politecnica delle Marche (Università Politecnica delle Marche)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Peer-to-peer; Computer network","score_opus":0.02750053362816416,"score_gpt":0.24716649625801412,"score_spread":0.21966596262984997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530896099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013931633,0.0010178112,0.91804063,0.010597998,0.00082163,0.0028442848,0.00028092068,0.0022854044,0.050179698],"genre_scores_gemma":[0.8525991,0.00018190262,0.126745,0.0014667675,0.00017520756,0.000075261276,0.0001959995,0.0001534198,0.018407365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99241626,0.0008271246,0.0008347049,0.002156195,0.0010950728,0.0026706606],"domain_scores_gemma":[0.9929219,0.0011735226,0.00046469423,0.0033083912,0.001002861,0.0011286311],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001440612,0.0010507575,0.0010731587,0.002337872,0.0015055322,0.0007967202,0.0054411804,0.0007931278,0.00011841824],"category_scores_gemma":[0.00036780006,0.0012279153,0.00065101776,0.003649719,0.00067033916,0.0017786786,0.0018121853,0.00094002805,0.00029759158],"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.00023230075,0.0003265974,0.00009569498,0.00017284152,0.00024701632,0.00016660568,0.0012684782,0.0229514,0.001453159,0.928034,0.04099551,0.0040563997],"study_design_scores_gemma":[0.0041097985,0.0009405327,0.00009894058,0.00017390051,0.0001938699,0.00008667969,0.007845173,0.14613816,0.0012294574,0.008332881,0.8287926,0.002058018],"about_ca_topic_score_codex":0.0009338741,"about_ca_topic_score_gemma":0.00018323987,"teacher_disagreement_score":0.9197011,"about_ca_system_score_codex":0.001999794,"about_ca_system_score_gemma":0.002075854,"threshold_uncertainty_score":0.99993986},"labels":[],"label_agreement":null},{"id":"W1532607861","doi":"10.5555/984720.984751","title":"Multiagent Systems for resource allocation in Peer-to-Peer systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Hoarding (animal behavior); Resource allocation; Computer science; Peer-to-peer; Distributed computing; Resource (disambiguation); Computer network; Feeding behavior","score_opus":0.0277773558411719,"score_gpt":0.26986495542708444,"score_spread":0.24208759958591253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532607861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019382885,0.00027907925,0.9469742,0.0273454,0.0010392783,0.0022233815,0.0000069769817,0.0012647719,0.0014840363],"genre_scores_gemma":[0.90754104,0.0000033559184,0.08291817,0.0005886203,0.00014257364,0.00089071423,0.000011380396,0.000028476694,0.007875655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970697,0.000052661777,0.00053871796,0.0007791382,0.0008904035,0.0006693334],"domain_scores_gemma":[0.9978751,0.00014252581,0.000099424265,0.0012169033,0.00048259625,0.00018344965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001425837,0.00025518527,0.0003302777,0.00050341,0.00010680216,0.00042560796,0.0018805914,0.00018659471,8.453439e-7],"category_scores_gemma":[0.0005215855,0.00023433643,0.00006277053,0.0011917666,0.000025484918,0.0002975117,0.0004838346,0.00016264206,0.0001980406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018304318,0.0001302338,0.00024811734,0.00008469968,0.000023794868,0.000020197747,0.0015311526,0.7385493,0.0008202124,0.18033837,0.07077064,0.0074649677],"study_design_scores_gemma":[0.0018104959,0.0005019193,0.0015417829,0.0004130463,0.0000108612585,0.000050780727,0.0015774536,0.36919206,0.0031693967,0.0012633635,0.61948955,0.0009793211],"about_ca_topic_score_codex":0.0010645222,"about_ca_topic_score_gemma":0.00021434392,"teacher_disagreement_score":0.88815814,"about_ca_system_score_codex":0.00052928226,"about_ca_system_score_gemma":0.000087216256,"threshold_uncertainty_score":0.9555962},"labels":[],"label_agreement":null},{"id":"W1533657865","doi":"10.1109/mascot.2004.1348284","title":"Engineering mobile wireless publish/subscribe systems for high performance","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Publication; Scalability; Middleware (distributed applications); Asynchronous communication; Computer network; Mobile computing; Distributed computing; Wireless; Wireless network; Domain (mathematical analysis); Implementation; Telecommunications; Operating system; Software engineering","score_opus":0.009770848256263995,"score_gpt":0.2001489556270039,"score_spread":0.1903781073707399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533657865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28761247,0.00011416245,0.70780724,0.0008045409,0.0009968764,0.0005181306,0.000002433323,0.001835266,0.00030889196],"genre_scores_gemma":[0.91074836,0.000016829632,0.08792493,0.000108961285,0.00009768455,0.0005530599,0.000002697873,0.000016785641,0.00053067965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854684,0.00000448924,0.00023415865,0.0004336851,0.00025487406,0.0005259594],"domain_scores_gemma":[0.99889565,0.00005325419,0.000046171725,0.0007799311,0.00013112865,0.000093862516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025853925,0.00017832385,0.00020802882,0.00019651397,0.00009191926,0.00042844028,0.0016756131,0.000106839565,0.000001803112],"category_scores_gemma":[0.000037114864,0.00016106914,0.00003814311,0.0006968286,0.000018722698,0.0009522881,0.00039468036,0.00012662391,0.00006264831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004710589,0.000057389134,0.0001541298,0.000120139055,0.000028526047,0.0000075317344,0.00021117214,0.48852092,0.0013450682,0.46741042,0.0089217825,0.03321821],"study_design_scores_gemma":[0.0012561675,0.0006666958,0.001322939,0.00021844989,0.000010229303,0.00006693649,0.000121757424,0.9030041,0.045260265,0.0018412637,0.045140803,0.0010904107],"about_ca_topic_score_codex":0.000077353136,"about_ca_topic_score_gemma":0.000005339493,"teacher_disagreement_score":0.6231359,"about_ca_system_score_codex":0.00014745606,"about_ca_system_score_gemma":0.000052231062,"threshold_uncertainty_score":0.6568209},"labels":[],"label_agreement":null},{"id":"W1533981713","doi":"10.1109/ictel.2003.1191284","title":"Rendezvous point relocation in protocol independent multicast - sparse mode","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Protocol Independent Multicast; Rendezvous; Computer science; Computer network; Distance Vector Multicast Routing Protocol; Pragmatic General Multicast; Distributed computing; Source-specific multicast; Xcast; Relocation; IP multicast; Engineering; Operating system","score_opus":0.023090051830742007,"score_gpt":0.29611982263794495,"score_spread":0.2730297708072029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533981713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007640051,0.0000042912006,0.9313622,0.0031618297,0.00015520254,0.038931657,6.1400164e-7,0.0011370446,0.017607108],"genre_scores_gemma":[0.6704899,5.394191e-7,0.28905985,0.00034344266,0.0000112762455,0.0393704,5.267025e-7,0.000011580316,0.0007124615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830455,0.00007727897,0.0003264521,0.00052641425,0.0003555784,0.0004097368],"domain_scores_gemma":[0.9987571,0.000041741794,0.0000642357,0.0009772773,0.00007313349,0.00008651094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045809185,0.00016075757,0.00015586436,0.00027853568,0.0000479141,0.00010833322,0.00092042197,0.00012055926,0.000018770474],"category_scores_gemma":[0.00026252598,0.0001441811,0.000029175259,0.0008463882,0.00002958645,0.00037205426,0.00033477592,0.00022817703,0.00018106122],"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.00004931346,0.00095005304,0.00712828,0.000045324152,0.000021956506,0.0002053885,0.001960809,0.03357424,0.00299772,0.7568352,0.014471117,0.1817606],"study_design_scores_gemma":[0.0048679463,0.000803764,0.02328724,0.00021239159,0.00000738094,0.00023695642,0.00050556776,0.6758328,0.10304158,0.12788774,0.06135079,0.0019658508],"about_ca_topic_score_codex":0.00013829261,"about_ca_topic_score_gemma":0.00050232606,"teacher_disagreement_score":0.66284984,"about_ca_system_score_codex":0.00019411911,"about_ca_system_score_gemma":0.00008612378,"threshold_uncertainty_score":0.5879535},"labels":[],"label_agreement":null},{"id":"W1536894981","doi":"","title":"Applying Peer-to-Peer Technology to the Building of Distributed Educational Systems.","year":2005,"lang":"en","type":"article","venue":"The Journal of Interactive Learning Research","topic":"Peer-to-Peer Network Technologies","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":"Acadia University","funders":"","keywords":"Computer science; Educational technology; Technology integration; Computer-Assisted Instruction; Multimedia; Peer evaluation; Instructional design; Mathematics education; Peer feedback; Knowledge management; Higher education; Psychology; Political science","score_opus":0.03869780632334102,"score_gpt":0.4031879682380162,"score_spread":0.3644901619146752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536894981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34754714,0.0003063871,0.305921,0.3445514,0.00045138845,0.0007509965,0.0000049022938,0.00007535136,0.00039144227],"genre_scores_gemma":[0.97940046,0.000009873574,0.018562745,0.00015466496,0.00036967825,0.0000865788,7.251599e-7,0.000017167733,0.0013981392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956262,0.00074485777,0.0006068313,0.0002689611,0.00211203,0.0006410877],"domain_scores_gemma":[0.99073297,0.0032403735,0.00039106252,0.0007192249,0.0047631115,0.00015327276],"candidate_categories":["metaresearch","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009276796,0.00016797296,0.00032204532,0.0013993828,0.0004943253,0.00025820246,0.00475775,0.000099381716,0.000016531525],"category_scores_gemma":[0.013616337,0.00010248837,0.000081940496,0.0033102925,0.00016824865,0.0003920977,0.0018858,0.002696954,0.00014527736],"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.0005091316,0.00027829997,0.0043745576,0.000033556982,0.0003647183,0.000024969182,0.011340559,0.5599248,0.05971839,0.024487095,0.12772244,0.21122153],"study_design_scores_gemma":[0.0005837258,0.0022294188,0.009218631,0.0014339645,0.000033437875,0.0010897476,0.01809739,0.036850933,0.044151746,0.0037133687,0.8820922,0.00050548697],"about_ca_topic_score_codex":0.000063770516,"about_ca_topic_score_gemma":0.000014068764,"teacher_disagreement_score":0.7543697,"about_ca_system_score_codex":0.00057757396,"about_ca_system_score_gemma":0.00028405088,"threshold_uncertainty_score":0.99960387},"labels":[],"label_agreement":null},{"id":"W1540320936","doi":"10.1007/978-0-387-09751-0_48","title":"P2P Approach for Web Services Publishing and Discovery","year":2009,"lang":"en","type":"book-chapter","venue":"","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":"World Wide Web; Computer science; Publishing; Data science; Information retrieval; Political science","score_opus":0.020157166636987647,"score_gpt":0.21780713163936719,"score_spread":0.19764996500237952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540320936","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001998346,0.000769087,0.32069546,0.004899771,0.0001981124,0.0005946863,0.00002718335,0.0011994954,0.6715962],"genre_scores_gemma":[0.002513475,0.000098795565,0.49649182,0.002585688,0.0002849262,0.00004777354,0.00005952831,0.000043622018,0.49787438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979012,0.0000059621243,0.00029182492,0.0009924477,0.0003773436,0.0004312024],"domain_scores_gemma":[0.99842733,0.000105452695,0.0001554188,0.0010988448,0.00010755205,0.00010539053],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031965884,0.00040295912,0.00042907815,0.00035251377,0.000122021855,0.003456666,0.0027196447,0.0005181502,0.0000032264727],"category_scores_gemma":[0.000024987507,0.0003430071,0.000106871244,0.00010482315,0.000054366526,0.0029288302,0.0015351042,0.00037461758,0.000008564164],"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.000003819326,0.000009150086,0.000006516583,0.00007716791,0.000031376123,0.000004281838,0.00004986136,0.000026237969,0.000013508118,0.81294674,0.024293292,0.16253805],"study_design_scores_gemma":[0.0003082873,0.00018296632,0.000053101467,0.00017421201,0.000029528197,0.000032638698,0.00002948349,0.03379272,0.000044443208,0.26843718,0.69596297,0.0009525054],"about_ca_topic_score_codex":0.000014630565,"about_ca_topic_score_gemma":0.000048134134,"teacher_disagreement_score":0.67166966,"about_ca_system_score_codex":0.00005576849,"about_ca_system_score_gemma":0.000065601074,"threshold_uncertainty_score":0.9999022},"labels":[],"label_agreement":null},{"id":"W1543318480","doi":"10.1007/978-3-642-05290-3_107","title":"Collaborative Building, Sharing and Handling of Graphs of Documents Using P2P File-Sharing","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; File sharing; Schema (genetic algorithms); Graph; World Wide Web; Scheme (mathematics); Peer-to-peer; Information retrieval; Theoretical computer science; The Internet","score_opus":0.01692482159742105,"score_gpt":0.270441593447911,"score_spread":0.25351677185049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543318480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010444759,0.0008124706,0.9870062,0.00014994146,0.00045382115,0.00043165096,0.000019285702,0.00014973806,0.00053215795],"genre_scores_gemma":[0.25416198,0.000048142407,0.7454946,0.00015016344,0.00006134645,0.000004367432,0.0000022150768,0.000021914775,0.00005524176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961777,0.000015260888,0.0007212287,0.0015830469,0.00088523026,0.0006175733],"domain_scores_gemma":[0.9972039,0.000282767,0.0006247309,0.0013321534,0.0004300178,0.00012645952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007641445,0.0004971411,0.0007953119,0.0016122733,0.0001935264,0.0003487638,0.0040692757,0.0003069823,0.00000803721],"category_scores_gemma":[0.00020143588,0.0004920496,0.00008790508,0.0017727803,0.00067537464,0.00067056325,0.0039209025,0.0005610132,9.2780357e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020392723,0.00005160759,0.001948434,0.00017925665,0.00007113843,0.000085305255,0.0024055347,0.18791346,0.0051937494,0.06069921,0.000040999315,0.7413909],"study_design_scores_gemma":[0.00031431863,0.00032539575,0.0004820191,0.0029957457,0.00001909659,0.000042290627,0.0000011066794,0.6334322,0.016749134,0.34465554,0.00019653875,0.00078658963],"about_ca_topic_score_codex":0.000052077616,"about_ca_topic_score_gemma":0.000039874336,"teacher_disagreement_score":0.74060434,"about_ca_system_score_codex":0.00018958644,"about_ca_system_score_gemma":0.00024364248,"threshold_uncertainty_score":0.9997531},"labels":[],"label_agreement":null},{"id":"W1545580834","doi":"10.1007/3-540-45074-2_9","title":"Modeling and Evaluating Cooperation Strategies in P2P Agent Systems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Computer science; Distributed computing; Peer-to-peer; Order (exchange); Software; Information exchange; Operating system","score_opus":0.06021016388477613,"score_gpt":0.3107023097221115,"score_spread":0.25049214583733537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545580834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003973713,0.0013588193,0.99109775,0.0004000331,0.0012329852,0.000659281,0.0000014254034,0.00030585675,0.0009701617],"genre_scores_gemma":[0.6002016,0.000047690814,0.39910758,0.0003505353,0.00019396607,0.000017400058,0.0000022444767,0.00002302375,0.000055929613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592423,0.000044767003,0.00069350266,0.0015487088,0.001044098,0.0007446992],"domain_scores_gemma":[0.99806243,0.000294812,0.00015659063,0.0010578891,0.00030384603,0.00012442653],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025469374,0.00048417188,0.0005181245,0.0014547803,0.00021173208,0.0014087069,0.0023409207,0.0003869978,0.0000013416352],"category_scores_gemma":[0.00016155692,0.00045951293,0.00004142311,0.0009855457,0.00028668848,0.0008544412,0.0016622562,0.000835536,0.000011228275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022276379,0.0000056057165,0.000013768474,0.000022429349,0.0000026061496,0.00003952251,0.0005084569,0.7304443,0.00010741813,0.021989914,0.0000024717344,0.24686125],"study_design_scores_gemma":[0.00015040448,0.00016118253,0.000026403377,0.00062313856,0.0000030968804,0.000048244412,0.0000023219065,0.96481836,0.00009682682,0.033532,0.00006200585,0.0004760029],"about_ca_topic_score_codex":0.00013634388,"about_ca_topic_score_gemma":0.00055604917,"teacher_disagreement_score":0.59622794,"about_ca_system_score_codex":0.00045527043,"about_ca_system_score_gemma":0.00049763074,"threshold_uncertainty_score":0.99978566},"labels":[],"label_agreement":null},{"id":"W1549097495","doi":"10.1007/978-3-540-45209-6_179","title":"Peer-to-Peer Communication through the Design and Implementation of Xiangqi","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; Peer-to-peer; Multimedia; Work (physics); Peer review; Human–computer interaction; World Wide Web","score_opus":0.030342107961868623,"score_gpt":0.29489497611596355,"score_spread":0.2645528681540949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549097495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012548597,0.00040966147,0.9603676,0.036711417,0.00044787108,0.0010229957,0.0000052264095,0.00014676164,0.0007629736],"genre_scores_gemma":[0.06737026,0.000055508073,0.9277091,0.004358342,0.00005583125,0.0000388144,0.0000039794013,0.00002563384,0.00038253044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630857,0.00010763286,0.00054827397,0.0010240482,0.0014713387,0.0005401424],"domain_scores_gemma":[0.9957026,0.0007924539,0.00031137175,0.0023358995,0.0007616989,0.000095959644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022951516,0.00041575852,0.00042349886,0.0005096053,0.00032133947,0.00042291146,0.004889348,0.00023178426,0.000007878162],"category_scores_gemma":[0.00025801794,0.00032663715,0.00006423007,0.001112681,0.0006871896,0.0005109594,0.002325438,0.00058426836,0.000015544276],"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.000006109262,0.000018532513,0.000064346255,0.000020238449,0.00002157949,0.000008068852,0.0069441125,0.046163905,0.00018216409,0.078317724,0.0037596696,0.86449355],"study_design_scores_gemma":[0.0006602589,0.0008942652,0.0009457777,0.0005408845,0.00003883919,0.00013087057,0.000020738242,0.09060322,0.019266611,0.805692,0.079589814,0.0016167244],"about_ca_topic_score_codex":0.000101141064,"about_ca_topic_score_gemma":0.00016996068,"teacher_disagreement_score":0.86287683,"about_ca_system_score_codex":0.00020484184,"about_ca_system_score_gemma":0.00023665681,"threshold_uncertainty_score":0.9999186},"labels":[],"label_agreement":null},{"id":"W1554896365","doi":"10.1109/nca.2004.1347803","title":"A fair synchronization protocol with cheat proofing for decentralized online multiplayer games","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"PlanetLab; Cheating; Computer science; Protocol (science); Synchronization (alternating current); Lock (firearm); Computer network; Scheme (mathematics); Simple (philosophy); Key (lock); Computer security; Distributed computing; The Internet; Operating system","score_opus":0.016772998502636048,"score_gpt":0.28514743771106504,"score_spread":0.268374439208429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554896365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003449648,0.000006060542,0.9330061,0.005547949,0.000040865754,0.056399524,0.0000032135752,0.0014669177,0.00007971931],"genre_scores_gemma":[0.10476326,6.014436e-7,0.83062035,0.00037802663,0.000034853747,0.06402157,0.000007552329,0.000018825594,0.00015494986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985876,0.000011390762,0.00021857416,0.00048366073,0.0002472243,0.00045156392],"domain_scores_gemma":[0.9991017,0.00004436394,0.0000709389,0.00052616396,0.00017636309,0.000080490645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011406656,0.00019226874,0.00018098953,0.00012267451,0.0001032305,0.00015522864,0.0007787995,0.00008610131,0.0000043604186],"category_scores_gemma":[0.000104566716,0.00013904221,0.00003742145,0.00065938995,0.000038754097,0.00041764704,0.00020843875,0.0000873783,0.0000127893045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006469562,0.0018803948,0.006087271,0.00050854473,0.00019187418,0.0000473483,0.0020086248,0.17153054,0.009339272,0.17199497,0.010854261,0.62490994],"study_design_scores_gemma":[0.023560276,0.003484123,0.004497682,0.0009261801,0.000034864926,0.00010127382,0.0002072973,0.6086653,0.23941386,0.019459324,0.09739696,0.0022528567],"about_ca_topic_score_codex":0.000022216187,"about_ca_topic_score_gemma":0.00017480992,"teacher_disagreement_score":0.62265706,"about_ca_system_score_codex":0.00016102975,"about_ca_system_score_gemma":0.000144376,"threshold_uncertainty_score":0.56699765},"labels":[],"label_agreement":null},{"id":"W1559288689","doi":"10.1007/978-3-540-76888-3_4","title":"Collaborative Data Synchronization in an Instance-Mapped P2P Data Sharing System","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Ottawa","funders":"","keywords":"Synchronizing; Computer science; Synchronization (alternating current); Data sharing; Peer-to-peer; Data synchronization; Relational database; Distributed computing; Database; Computer network","score_opus":0.062242125821386204,"score_gpt":0.3105777057470729,"score_spread":0.24833557992568667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559288689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001368254,0.00069161144,0.99348485,0.0006004887,0.0016964283,0.00095015235,0.00010885894,0.00078508933,0.0015456796],"genre_scores_gemma":[0.21022971,0.000045867553,0.7881785,0.0006598013,0.00047433638,0.000013309335,0.00028228603,0.00006096669,0.000055239136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918436,0.000056679204,0.00093023956,0.0046292795,0.0014605072,0.0010797383],"domain_scores_gemma":[0.986972,0.0003654968,0.00044419232,0.011536189,0.00046302786,0.00021914163],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0032735527,0.0007038116,0.0007821086,0.0019861893,0.00028125104,0.001320548,0.032713924,0.0005595517,0.0000032440387],"category_scores_gemma":[0.00035654596,0.0007069255,0.000026658787,0.0040979893,0.00057141366,0.0036735972,0.02281945,0.0011402658,0.000035391397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015171988,0.000048588732,0.00061496167,0.00011035275,0.000016222433,0.0004501838,0.0010460829,0.09580056,0.000040187035,0.034750246,0.00015116856,0.8669563],"study_design_scores_gemma":[0.00025206016,0.00012357502,0.0001936424,0.0012305647,0.000006680805,0.000041362408,0.0000032534679,0.98697484,0.00011820635,0.008350634,0.0018983792,0.00080680975],"about_ca_topic_score_codex":0.000060210077,"about_ca_topic_score_gemma":0.0037327583,"teacher_disagreement_score":0.89117426,"about_ca_system_score_codex":0.0012024884,"about_ca_system_score_gemma":0.0010602991,"threshold_uncertainty_score":0.99971616},"labels":[],"label_agreement":null},{"id":"W1560658160","doi":"10.1007/978-3-540-75694-1_3","title":"Market-Based Hierarchical Resource Management Using Machine Learning","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Negotiation; Service provider; Service (business); Computer science; Virtualization; Revenue; Resource management (computing); Service delivery framework; Knowledge management; Resource (disambiguation); Resource allocation; Business; Process management; Cloud computing; Distributed computing; Marketing; Computer network","score_opus":0.024081711282399366,"score_gpt":0.2593539574834455,"score_spread":0.23527224620104611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560658160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081720646,0.0003821171,0.9815747,0.0014838126,0.00077106874,0.00054852193,0.0000028249879,0.0008700987,0.014285109],"genre_scores_gemma":[0.01634423,0.000013958038,0.97920454,0.0029370713,0.00028752693,0.000008154052,0.000005074411,0.00006386059,0.0011355849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938082,0.00007600547,0.0006741815,0.0022893485,0.0018036197,0.0013486531],"domain_scores_gemma":[0.9964659,0.000692322,0.00029021272,0.002109983,0.0001471763,0.00029436903],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0023506833,0.0007647021,0.0006497328,0.0026840789,0.00047268657,0.00063321384,0.0063630296,0.00048695804,0.00002632172],"category_scores_gemma":[0.00013843927,0.00074323924,0.00017179326,0.0018443482,0.00082251726,0.00028279758,0.004635533,0.0020820766,0.000038037822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001944857,0.000026139069,0.000112431386,0.000043600965,0.00001614454,0.0005656671,0.00010951878,0.21919079,0.0000358596,0.009781891,0.00007457411,0.77002394],"study_design_scores_gemma":[0.00027790837,0.00018913012,0.00010878272,0.0005675307,0.000011637521,0.000069851405,1.8244512e-7,0.9379856,0.0004440678,0.0259074,0.03356149,0.0008764002],"about_ca_topic_score_codex":0.00002411193,"about_ca_topic_score_gemma":0.00006423115,"teacher_disagreement_score":0.7691475,"about_ca_system_score_codex":0.0007053491,"about_ca_system_score_gemma":0.00024232332,"threshold_uncertainty_score":0.9995019},"labels":[],"label_agreement":null},{"id":"W1560885356","doi":"10.1049/cp:20081154","title":"CSON-D: context dissemination in autonomous systems using overlays","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Context (archaeology); Overlay network; Context model; Distributed computing; Protocol (science); Dissemination; Computer network; World Wide Web; The Internet; Artificial intelligence; Telecommunications","score_opus":0.03126517859747421,"score_gpt":0.2666397221965572,"score_spread":0.23537454359908297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560885356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5335857,0.00020745095,0.46051484,0.0006297863,0.00044358324,0.0002476041,0.0000010522884,0.00074842427,0.0036215272],"genre_scores_gemma":[0.9726799,0.0000063467032,0.025732964,0.0000991694,0.00002714241,0.000016878967,6.697095e-7,0.0000070244864,0.0014298758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.000028219456,0.0002381531,0.00033326467,0.00022204655,0.00030096833],"domain_scores_gemma":[0.9992487,0.000091559166,0.00005866835,0.00049432745,0.00005559436,0.000051156898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001956554,0.000119845594,0.00017476112,0.000254111,0.00008206908,0.00008469553,0.0007574655,0.00008655974,0.0000038488597],"category_scores_gemma":[0.00007330027,0.00011313705,0.000026390804,0.0007141669,0.000036032267,0.00041854684,0.00029702752,0.00010801182,0.000052263553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021390631,0.00048810852,0.064582795,0.00008710338,0.00005385672,0.0010393726,0.009167349,0.05637334,0.018619668,0.50728524,0.06849446,0.2737873],"study_design_scores_gemma":[0.00022632269,0.00007271236,0.01730775,0.000096290765,0.0000015903018,0.00021122073,0.00027493137,0.9707993,0.0032664586,0.00045905754,0.0069112848,0.00037307193],"about_ca_topic_score_codex":0.000420892,"about_ca_topic_score_gemma":0.000078347155,"teacher_disagreement_score":0.91442597,"about_ca_system_score_codex":0.00022612582,"about_ca_system_score_gemma":0.000051779938,"threshold_uncertainty_score":0.46135953},"labels":[],"label_agreement":null},{"id":"W15632058","doi":"10.1128/mcb.25.2.554-562.2005","title":"Subscribing to the Past in Content-based Publish/Subscribe","year":2008,"lang":"en","type":"article","venue":"Molecular and Cellular Biology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute of Allergy and Infectious Diseases","keywords":"Computer science; Testbed; Redundancy (engineering); Provisioning; Locality; Distributed computing; Publication; Overhead (engineering); Computer network; Distributed database; Database; Operating system","score_opus":0.031945082790574605,"score_gpt":0.21651545994743276,"score_spread":0.18457037715685815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15632058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54938823,0.00064050074,0.43531197,0.013961573,0.00017162864,0.00021074527,0.000002011674,0.00012653509,0.00018678638],"genre_scores_gemma":[0.98467076,0.0000073774995,0.010682642,0.0044773025,0.000028549977,0.00005449603,0.000009348453,0.000010147795,0.000059393507],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984685,0.00014283413,0.00021937772,0.000535913,0.00012917971,0.0005042042],"domain_scores_gemma":[0.99900544,0.00004780938,0.000039826067,0.0007345249,0.00006468276,0.00010772064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034469937,0.00017611968,0.00021527227,0.00023978882,0.00013028517,0.000077411176,0.0011941106,0.00013760303,0.000002577209],"category_scores_gemma":[0.000116769676,0.00013246984,0.000056497767,0.0007602702,0.00012869347,0.000077240016,0.0005525569,0.00021032101,0.00003236859],"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.000049757145,0.00017803677,0.05988431,0.00001576216,0.000055730885,0.0014004856,0.0011083124,0.0010410518,0.8064996,0.07141547,0.0073271864,0.051024303],"study_design_scores_gemma":[0.002847268,0.0015230217,0.02362362,0.00008596173,0.00002653431,0.00030682617,0.0004538326,0.015099896,0.7845978,0.004790821,0.1647091,0.0019352903],"about_ca_topic_score_codex":0.000117441814,"about_ca_topic_score_gemma":0.00006839496,"teacher_disagreement_score":0.4352825,"about_ca_system_score_codex":0.000029072316,"about_ca_system_score_gemma":0.000038352682,"threshold_uncertainty_score":0.5401963},"labels":[],"label_agreement":null},{"id":"W1565251572","doi":"10.1007/11925941_5","title":"Handling Free Riders in Peer-to-Peer Systems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Reputation; Upload; Computer science; Peer-to-peer; Incentive; Service (business); Download; Free rider problem; Internet privacy; Free riding; Computer security; Reputation system; World Wide Web; Business; Marketing; Microeconomics","score_opus":0.016673515596702937,"score_gpt":0.23895828816817266,"score_spread":0.22228477257146972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565251572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003618818,0.0005823403,0.97640246,0.01063081,0.00444183,0.0010741468,0.000017463228,0.0008320652,0.005657003],"genre_scores_gemma":[0.2566024,0.000013905302,0.73386717,0.0032233226,0.0011034578,0.00009681288,0.000013647161,0.00012558523,0.0049536605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909249,0.000055412234,0.0010755016,0.0029454827,0.0032930674,0.0017056292],"domain_scores_gemma":[0.99394596,0.0006993161,0.00032821938,0.0038678013,0.0008242549,0.00033445074],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026801196,0.0009819651,0.0010932034,0.003447897,0.00028090217,0.0015774117,0.011923339,0.00074745715,0.000005722166],"category_scores_gemma":[0.0009099912,0.0009619423,0.000166449,0.0027806214,0.0005668383,0.00070875644,0.005684517,0.0016500383,0.00014884578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007930465,0.000036457957,0.00024984244,0.00005045768,0.000012860681,0.0005088608,0.00074926554,0.7927998,0.000083286264,0.015209714,0.006802124,0.18348943],"study_design_scores_gemma":[0.0008379176,0.0004419622,0.0005820681,0.002190052,0.000014302061,0.00023050646,0.0000018674319,0.7908299,0.0010491991,0.15157251,0.04942321,0.0028264862],"about_ca_topic_score_codex":0.000522966,"about_ca_topic_score_gemma":0.00115649,"teacher_disagreement_score":0.25624055,"about_ca_system_score_codex":0.0010574026,"about_ca_system_score_gemma":0.00057691225,"threshold_uncertainty_score":0.999459},"labels":[],"label_agreement":null},{"id":"W1565696930","doi":"10.1007/978-3-540-30184-4_18","title":"A Reputation Management and Selection Advisor Schemes for Peer-to-Peer Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"University of Waterloo","funders":"","keywords":"Reputation; Computer science; Upload; Scheme (mathematics); Peer-to-peer; Selection (genetic algorithm); Download; Reputation system; Computer security; Distributed computing; World Wide Web; Artificial intelligence","score_opus":0.015760585277747294,"score_gpt":0.2546115449137687,"score_spread":0.2388509596360214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565696930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016194547,0.00030605483,0.9874403,0.00710233,0.0015111322,0.0020778521,0.0000083889545,0.0006747222,0.0007173154],"genre_scores_gemma":[0.0893577,0.00001914599,0.90611935,0.0011344028,0.000330914,0.00020556645,0.000008036867,0.000050288785,0.002774607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482936,0.000020021624,0.0005790629,0.0021507493,0.001584953,0.00083588006],"domain_scores_gemma":[0.99742955,0.0002478627,0.00025359917,0.0009636296,0.0008872536,0.00021812749],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013738587,0.000595773,0.00055446493,0.001733827,0.0003495072,0.0011427002,0.0025010866,0.0003720773,0.0000019290303],"category_scores_gemma":[0.00026162327,0.00058366713,0.00009187354,0.0013089494,0.00025181338,0.0005713026,0.0016638035,0.0004876201,0.000026323669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016981849,0.000025067193,0.000023899587,0.000171303,0.0000329217,0.000031237632,0.000616681,0.17081288,0.000091472,0.123595014,0.000754849,0.7038277],"study_design_scores_gemma":[0.0008742838,0.0010542104,0.00030721864,0.0015382535,0.000040329036,0.00016015953,0.000002638017,0.6504795,0.0016661315,0.25613225,0.08597891,0.0017661175],"about_ca_topic_score_codex":0.000026159609,"about_ca_topic_score_gemma":0.000041672756,"teacher_disagreement_score":0.7020616,"about_ca_system_score_codex":0.0007449421,"about_ca_system_score_gemma":0.00024262705,"threshold_uncertainty_score":0.9998942},"labels":[],"label_agreement":null},{"id":"W1565845290","doi":"10.1007/978-3-540-75853-2_1","title":"A Novel Peer-to-Peer Naming Infrastructure for Next Generation Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Toronto","funders":"","keywords":"Scalability; Computer science; Peer-to-peer; Robustness (evolution); Flexibility (engineering); Distributed computing; File sharing; Computer network; Data science; World Wide Web; The Internet; Database","score_opus":0.045662277938152696,"score_gpt":0.27834998033560016,"score_spread":0.23268770239744746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565845290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011931005,0.00024082912,0.9854601,0.0061816536,0.0051458995,0.0015208541,0.00001676053,0.0006903412,0.0006242437],"genre_scores_gemma":[0.034154277,0.000009012895,0.9551392,0.0072377943,0.0023656315,0.0000651399,0.00003271483,0.00008787309,0.0009083464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99227214,0.000019490339,0.00091023126,0.0028358528,0.0022841126,0.0016781829],"domain_scores_gemma":[0.9945683,0.00064320565,0.0003823469,0.0024113245,0.0015712734,0.00042358018],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002460433,0.0010047498,0.0008552011,0.002089167,0.000550553,0.0016876087,0.0068214647,0.0010400083,0.000008355172],"category_scores_gemma":[0.0007943951,0.00097647595,0.00022217572,0.0020475416,0.0004401972,0.0009023279,0.0032451903,0.0014476299,0.000028991557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007577514,0.000012365651,0.000012931754,0.000012526006,0.000012015322,0.000018874503,0.0003941829,0.4108513,0.00073571183,0.010832129,0.0013919284,0.57571846],"study_design_scores_gemma":[0.00032926374,0.00033072731,0.00012713339,0.00025551612,0.0000126778,0.00010102773,4.6286928e-7,0.93525344,0.0010008186,0.026542867,0.03485535,0.0011907287],"about_ca_topic_score_codex":0.000022434017,"about_ca_topic_score_gemma":0.00031152565,"teacher_disagreement_score":0.57452774,"about_ca_system_score_codex":0.0008476831,"about_ca_system_score_gemma":0.00052024436,"threshold_uncertainty_score":0.99934876},"labels":[],"label_agreement":null},{"id":"W1566413038","doi":"10.1109/wimob.2005.1512912","title":"Proactive neighbor replacement for RAON","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Overhead (engineering); Abstraction; Software deployment; Computer network; Adaptation (eye); The Internet; Overlay network; Distributed computing; Topology (electrical circuits); Programming language; Mathematics; Physics; Operating system","score_opus":0.010540640552313173,"score_gpt":0.23795238611324224,"score_spread":0.22741174556092905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566413038","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062184692,0.00002593712,0.9633791,0.0074010952,0.0001918199,0.00067110517,0.0000018419186,0.0010035866,0.021107038],"genre_scores_gemma":[0.4076937,8.3425743e-7,0.5824799,0.00058218406,0.000091273054,0.0003099814,0.0000029373207,0.000008736421,0.008830436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989893,0.0000089209825,0.00014508411,0.0003846275,0.00016750937,0.00030458573],"domain_scores_gemma":[0.9992029,0.000068461624,0.000040469655,0.00058173295,0.000074354706,0.000032047225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017313515,0.00010447608,0.00010519052,0.000088887515,0.00007095918,0.000093006,0.0007344301,0.00005097562,0.000007295998],"category_scores_gemma":[0.000037315804,0.0000864758,0.000039197545,0.0003166188,0.000018242137,0.0002023905,0.00030019242,0.000051433868,0.000055471988],"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.000029916964,0.000097034535,0.0004006876,0.0000058268092,0.000018630317,0.0000027876313,0.00006492729,0.0003843566,0.0010364603,0.5964892,0.3236592,0.077810995],"study_design_scores_gemma":[0.0015993752,0.0011122248,0.01017662,0.000023493629,0.000015159132,0.000015015543,0.00009044447,0.11910251,0.19182146,0.1738256,0.5013119,0.0009062079],"about_ca_topic_score_codex":0.000048567577,"about_ca_topic_score_gemma":0.000029169994,"teacher_disagreement_score":0.42266357,"about_ca_system_score_codex":0.000078088924,"about_ca_system_score_gemma":0.00002786029,"threshold_uncertainty_score":0.35263807},"labels":[],"label_agreement":null},{"id":"W1576323019","doi":"10.1007/11902140_88","title":"Trustworthy Distributed Algorithm Design to Defend Distance Cheating in Link-Weighted ALM","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Cheating; Computer science; Trustworthiness; Multicast; Tree (set theory); Algorithm; Theoretical computer science; Computer network; Distributed computing; Computer security; Mathematics","score_opus":0.01588297952493769,"score_gpt":0.23404073209127085,"score_spread":0.21815775256633316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576323019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068654044,0.000501207,0.99251217,0.0028771532,0.0012645723,0.0012073378,0.0000428829,0.00080372026,0.0007222972],"genre_scores_gemma":[0.03251015,0.000015460571,0.96529603,0.001260978,0.00048050168,0.00007119051,0.000028906776,0.0000649025,0.00027188583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926442,0.000084135674,0.0010784566,0.0029555783,0.0015188004,0.001718825],"domain_scores_gemma":[0.9956503,0.0008954955,0.00035702295,0.0024189164,0.00033831105,0.00033995468],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015115252,0.0010116679,0.001050216,0.0018233415,0.00031763958,0.00081999204,0.007050409,0.0006670763,0.0000074073782],"category_scores_gemma":[0.00026565616,0.0009961012,0.00015193458,0.0040534516,0.0005372631,0.00058905594,0.0030248917,0.0015370228,0.00007681822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007535763,0.000028589337,0.00010933311,0.000012039607,0.0000072620687,0.00027078303,0.00023289524,0.21598496,0.00004090548,0.0021396698,0.00040772097,0.7807583],"study_design_scores_gemma":[0.0003705109,0.00028774477,0.00056113006,0.0008024486,0.000007631049,0.000056079396,2.9688653e-7,0.9174868,0.0021139744,0.069889516,0.006994477,0.0014294079],"about_ca_topic_score_codex":0.000088578745,"about_ca_topic_score_gemma":0.00034771123,"teacher_disagreement_score":0.7793289,"about_ca_system_score_codex":0.0011707164,"about_ca_system_score_gemma":0.0005137399,"threshold_uncertainty_score":0.9992489},"labels":[],"label_agreement":null},{"id":"W1592422548","doi":"","title":"Sharing @ The Edge: Secure Information Sharing.","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Server; Software deployment; Enhanced Data Rates for GSM Evolution; Peer-to-peer; World Wide Web; Computer security; Edge computing; Computer network; Web service; Web server; The Internet; Telecommunications; Operating system","score_opus":0.02226336530522336,"score_gpt":0.21950642232352566,"score_spread":0.1972430570183023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592422548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022848206,0.00016966424,0.76473,0.04308216,0.0007194078,0.00043503995,0.0000013207966,0.0036884125,0.16432583],"genre_scores_gemma":[0.96056783,0.000013639327,0.032290064,0.0036189505,0.00007001616,0.000036819343,0.0000011801898,0.000005561103,0.0033959493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991205,0.000004815459,0.00016926572,0.00019903971,0.0002331615,0.00027321986],"domain_scores_gemma":[0.99885434,0.000028590817,0.0000444408,0.0009757123,0.00005447752,0.000042431253],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019796238,0.0000990334,0.00007368092,0.00010603831,0.0001522337,0.0004643909,0.0027514924,0.00006136263,0.00007036167],"category_scores_gemma":[0.000071193725,0.0000659681,0.000031080617,0.0006601392,0.000023872348,0.0012566799,0.0016057905,0.00017578452,0.0011222622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.7673766e-7,0.000017299832,0.001551348,0.00000850998,0.000013675405,0.0000035128705,0.0029186113,0.0013062356,0.000024124723,0.43302622,0.23822166,0.32290792],"study_design_scores_gemma":[0.00013505164,0.000041040243,0.0027401445,0.000016747803,0.0000026568812,0.000022665212,0.00010440438,0.7385637,0.0006618073,0.013594573,0.24387248,0.0002447391],"about_ca_topic_score_codex":0.000017572305,"about_ca_topic_score_gemma":0.0000146800885,"teacher_disagreement_score":0.93771964,"about_ca_system_score_codex":0.000037200643,"about_ca_system_score_gemma":0.000004249421,"threshold_uncertainty_score":0.9996555},"labels":[],"label_agreement":null},{"id":"W1594897592","doi":"10.1007/978-3-540-39404-4_26","title":"Administrative Policies to Regulate Quality of Service Management in Distributed Multimedia Applications","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Western University","funders":"","keywords":"Computer science; Flexibility (engineering); Quality of service; Variety (cybernetics); Quality (philosophy); Service (business); Distributed management; Distributed computing; Telecommunications; Business; Artificial intelligence","score_opus":0.03950604118548619,"score_gpt":0.31600142178864893,"score_spread":0.27649538060316275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594897592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039239653,0.0000648806,0.9875066,0.0078408085,0.0002941681,0.0014277989,0.000052358595,0.00021353604,0.0022074487],"genre_scores_gemma":[0.07355358,0.000023962953,0.9224156,0.0035762032,0.00006893651,0.00016709561,0.00001781051,0.000026303815,0.00015051843],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583006,0.000057314024,0.00087388733,0.0015401972,0.0009698642,0.00072867],"domain_scores_gemma":[0.9964364,0.00041861128,0.00035369914,0.002224821,0.0003671507,0.00019928027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009872551,0.00050863106,0.0006811382,0.0012356528,0.00011850208,0.00019136259,0.004912099,0.00028592284,0.000003585878],"category_scores_gemma":[0.000104796454,0.000507202,0.00008203733,0.003323188,0.00043265783,0.00025102904,0.0024219207,0.00051738444,0.000029736848],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019623092,0.00013672249,0.0001809165,0.000152325,0.000038247712,0.000042830135,0.0023629307,0.094485044,0.0003331743,0.10086171,0.00017424628,0.80121225],"study_design_scores_gemma":[0.0018757151,0.0008966381,0.027669007,0.002136537,0.00004704552,0.0000638281,0.000021243004,0.23377834,0.018098854,0.6717616,0.03859323,0.0050579836],"about_ca_topic_score_codex":0.00011191478,"about_ca_topic_score_gemma":0.0010500252,"teacher_disagreement_score":0.79615426,"about_ca_system_score_codex":0.00044488846,"about_ca_system_score_gemma":0.00021645088,"threshold_uncertainty_score":0.999738},"labels":[],"label_agreement":null},{"id":"W1598962800","doi":"","title":"Dynamic swarm management for improved BitTorrent performance","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; BitTorrent tracker; Computer science; Upload; Scalability; Bandwidth (computing); Computer network; File sharing; Swarm behaviour; Distributed computing; Protocol (science); Peer-to-peer; The Internet; Operating system; Artificial intelligence","score_opus":0.008298480277099582,"score_gpt":0.2409863466231991,"score_spread":0.2326878663460995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598962800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031265087,0.00005007184,0.9521708,0.009560466,0.00040679477,0.00064344483,0.0000010276996,0.0013510439,0.004551268],"genre_scores_gemma":[0.56106335,0.000022579548,0.4353778,0.0009850563,0.000013802311,0.00006455019,0.0000014754648,0.0000050231606,0.0024663804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988381,0.00000447821,0.00017411984,0.00041473395,0.0001391222,0.00042943694],"domain_scores_gemma":[0.999087,0.000017378576,0.000039408475,0.00074742106,0.000045651992,0.000063167274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016032429,0.00014712899,0.00012834235,0.00015492845,0.000094089555,0.00009864502,0.0013833905,0.00004797827,0.0000025546235],"category_scores_gemma":[0.000007827991,0.00012566632,0.000051662366,0.00038061812,0.00001464159,0.00016378843,0.0003243914,0.00007027169,0.0000688951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007511291,0.00005354229,0.000013148763,0.000012051481,0.000011338664,0.0000016703592,0.00003498797,0.0014590858,0.00032445192,0.03588045,0.0066618333,0.95553994],"study_design_scores_gemma":[0.00033992645,0.00036707675,0.004230632,0.000017988428,0.0000053528483,0.0000035026553,0.00001377989,0.9658797,0.0022518507,0.005364592,0.021257682,0.00026792678],"about_ca_topic_score_codex":0.0000014781657,"about_ca_topic_score_gemma":0.0000031391596,"teacher_disagreement_score":0.9644206,"about_ca_system_score_codex":0.00009312542,"about_ca_system_score_gemma":0.000011188388,"threshold_uncertainty_score":0.5124524},"labels":[],"label_agreement":null},{"id":"W1601677373","doi":"10.1007/11912873_1","title":"Internet-Scale Data Distribution: Some Research Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Computer science; The Internet; Variety (cybernetics); Scale (ratio); Data science; World Wide Web; Artificial intelligence","score_opus":0.07702466352739512,"score_gpt":0.30899549422970196,"score_spread":0.23197083070230684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601677373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006218312,0.00092785107,0.98712367,0.00604615,0.0017332262,0.00078458217,0.00007665357,0.0007167296,0.0025289408],"genre_scores_gemma":[0.15399115,0.0001258551,0.83384085,0.001850594,0.0026627423,0.000095086485,0.0004791194,0.00013528438,0.0068193018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99163437,0.000078219164,0.0007336493,0.0034658627,0.00250139,0.0015865226],"domain_scores_gemma":[0.99193347,0.0006427929,0.00021984526,0.00640024,0.00055430655,0.00024934937],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0034131997,0.00064369536,0.00064442836,0.0012361808,0.00037161852,0.0014378536,0.022184826,0.0005878707,0.000011046936],"category_scores_gemma":[0.0002607259,0.0005961979,0.0000893908,0.0021235177,0.0017965299,0.0014411713,0.021580772,0.002236411,0.0002607421],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064325454,0.0000848752,0.00012955599,0.00006788486,0.000017135551,0.00020500027,0.000304255,0.027701495,0.00008930816,0.055193495,0.028912775,0.8872878],"study_design_scores_gemma":[0.0002311241,0.00029765483,0.00022577199,0.0008466284,0.0000064824353,0.00010769024,1.7912868e-7,0.5360169,0.0011022547,0.34805024,0.11197679,0.0011383186],"about_ca_topic_score_codex":0.00015737615,"about_ca_topic_score_gemma":0.00039695075,"teacher_disagreement_score":0.88614947,"about_ca_system_score_codex":0.00080313627,"about_ca_system_score_gemma":0.00066537433,"threshold_uncertainty_score":0.9996489},"labels":[],"label_agreement":null},{"id":"W1602087275","doi":"10.1007/978-3-642-01399-7_22","title":"Why Are Peers Less Stable in Unpopular P2P Streaming Channels?","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"University of Toronto","funders":"","keywords":"Computer science; Streaming current; Computer network; Computer security; Nanotechnology; Materials science","score_opus":0.02177463811474751,"score_gpt":0.23862801566885924,"score_spread":0.21685337755411174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602087275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009945631,0.00080923294,0.98647237,0.0071729054,0.0020028064,0.0006478135,0.0000070442684,0.00068019296,0.0012130772],"genre_scores_gemma":[0.27950862,0.000118610646,0.7068015,0.011422896,0.0008054062,0.00004650942,0.000013951364,0.000118005206,0.0011645528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933837,0.00005045432,0.0007515719,0.002625532,0.0015962559,0.0015924679],"domain_scores_gemma":[0.9962166,0.00030712955,0.00039891983,0.0025371038,0.0002808557,0.00025940276],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011496504,0.0009026029,0.0009935301,0.002535715,0.00027380598,0.000994946,0.007897023,0.00064293394,0.000006565999],"category_scores_gemma":[0.00021620204,0.0009012805,0.00014699808,0.002419523,0.00052177906,0.0010008519,0.0029860495,0.0015750864,0.00003221401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054799593,0.000042857835,0.0002731485,0.000032140044,0.000008413162,0.0005048115,0.0006162754,0.21051636,0.000053753603,0.0061195134,0.00042286603,0.7814044],"study_design_scores_gemma":[0.0007824106,0.00057431584,0.0010084679,0.003285698,0.000016046031,0.00016465342,0.000007500502,0.62602955,0.002969022,0.33695045,0.024891065,0.0033208113],"about_ca_topic_score_codex":0.0001955746,"about_ca_topic_score_gemma":0.0013030045,"teacher_disagreement_score":0.77808356,"about_ca_system_score_codex":0.000881162,"about_ca_system_score_gemma":0.00035207925,"threshold_uncertainty_score":0.9993438},"labels":[],"label_agreement":null},{"id":"W1605624010","doi":"10.1007/11912873_42","title":"Monitoring Interactivity in a Web-Based Community","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Lethbridge","funders":"","keywords":"Interactivity; Computer science; Enabling; Virtual community; Correctness; World Wide Web; Online community; Knowledge management; Multimedia; The Internet","score_opus":0.02430883515320604,"score_gpt":0.26567681363458484,"score_spread":0.2413679784813788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605624010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008055709,0.00018050305,0.98480844,0.0014233479,0.0017844378,0.00045904604,0.000004739609,0.0006735247,0.0026102324],"genre_scores_gemma":[0.7084641,0.000005366094,0.29072654,0.00048097232,0.00018640282,0.000021998843,0.0000018923133,0.000029063374,0.0000836981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583095,0.000138604,0.00061606406,0.0013708301,0.0010523036,0.0009912346],"domain_scores_gemma":[0.99519944,0.0013695206,0.0002755632,0.0028050477,0.00020256397,0.00014786274],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018117866,0.0006735963,0.00071343355,0.002161482,0.0003164537,0.0006449164,0.0076665273,0.00047537684,0.0000032492821],"category_scores_gemma":[0.00027727656,0.00068383425,0.00013024335,0.0017411989,0.00061678427,0.0007171849,0.003857338,0.0031031459,0.000037310325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010257503,0.00011710865,0.0027091452,0.000037213555,0.00000591494,0.00019379584,0.00044302628,0.18336765,0.00048612413,0.00094909896,0.0001025703,0.8115781],"study_design_scores_gemma":[0.00079405995,0.00042697237,0.007330684,0.0026291397,0.0000072505336,0.00005005625,7.2041655e-7,0.87947154,0.012543626,0.09232782,0.0025692529,0.0018489059],"about_ca_topic_score_codex":0.00035654375,"about_ca_topic_score_gemma":0.0015222188,"teacher_disagreement_score":0.8097292,"about_ca_system_score_codex":0.0010789792,"about_ca_system_score_gemma":0.0005945323,"threshold_uncertainty_score":0.9995613},"labels":[],"label_agreement":null},{"id":"W160618764","doi":"10.1007/978-3-642-21484-4_15","title":"Using Diffusive Load Balancing to Improve Performance of Peer-to-Peer Systems for Hosting Services","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; Overlay; Peer-to-peer; Load balancing (electrical power); Distributed computing; Variance (accounting); Overlay network; Computer network; Node (physics); Resource (disambiguation); Service (business); Homogeneous; Shared resource; The Internet; World Wide Web; Operating system","score_opus":0.023627826973048383,"score_gpt":0.25378689960163825,"score_spread":0.23015907262858987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160618764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01738799,0.0002834877,0.97480917,0.00084699446,0.003852181,0.0018689636,0.000033199747,0.00036337582,0.0005546402],"genre_scores_gemma":[0.40088874,0.00000668245,0.59702915,0.0010352372,0.00048302574,0.000060453207,0.000002775786,0.00006168017,0.00043225335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99323964,0.00002483336,0.000962256,0.002229619,0.002195874,0.0013477951],"domain_scores_gemma":[0.9937225,0.00051286916,0.0006129421,0.002187818,0.00261616,0.00034771732],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020835786,0.00081941445,0.001064527,0.0014291327,0.00035804027,0.0005976058,0.0069087218,0.00047104686,0.000001965834],"category_scores_gemma":[0.000460965,0.00077027484,0.00015600918,0.0014593884,0.0002691413,0.0007039291,0.0044309753,0.0006672437,0.000027135715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007026137,0.000056147543,0.00070220866,0.0010425237,0.00006072349,0.000044219112,0.0088277925,0.45095026,0.01021473,0.0056350925,0.00014678808,0.5222492],"study_design_scores_gemma":[0.00032195527,0.000980224,0.00024322752,0.0030692893,0.000024925741,0.000058314417,0.0000040358464,0.9728179,0.012956087,0.0053245304,0.0028430074,0.001356489],"about_ca_topic_score_codex":0.00028791756,"about_ca_topic_score_gemma":0.000116916846,"teacher_disagreement_score":0.52186763,"about_ca_system_score_codex":0.00080057094,"about_ca_system_score_gemma":0.0006433908,"threshold_uncertainty_score":0.9994748},"labels":[],"label_agreement":null},{"id":"W1608613055","doi":"10.1007/978-3-540-30555-2_22","title":"Hybrid-Chord: A Peer-to-Peer System Based on Chord","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Chord (peer-to-peer); Pastry; Computer science; Peer-to-peer; Distributed computing; Computer network","score_opus":0.014379405175140882,"score_gpt":0.23863130532760865,"score_spread":0.22425190015246776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608613055","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020338334,0.000093810646,0.96552163,0.018178822,0.0042480333,0.0013858106,0.000031833828,0.0019926622,0.008343985],"genre_scores_gemma":[0.40349248,0.0000029391367,0.58618456,0.00800861,0.00073288486,0.000086535285,0.000010339099,0.0001127655,0.0013688873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884684,0.000062428844,0.0009878757,0.0039126268,0.0046938835,0.0018747979],"domain_scores_gemma":[0.99223924,0.0006844604,0.00038830139,0.0048793526,0.0011444013,0.00066426187],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0023021016,0.0013618182,0.0012202674,0.003311604,0.0004877414,0.0014411873,0.011848974,0.000632869,0.00001986023],"category_scores_gemma":[0.0006778758,0.0012717275,0.00030843762,0.002206687,0.0006215385,0.00052211795,0.003497647,0.0019255932,0.00069663266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025838022,0.000062996514,0.000024862717,0.00008581252,0.0000182715,0.00068815006,0.00032828184,0.5265053,0.00006601825,0.04543622,0.0016280495,0.42513022],"study_design_scores_gemma":[0.0010481979,0.0017186395,0.0002566795,0.0039989357,0.00002873707,0.00025260448,9.1090845e-7,0.85462195,0.004351216,0.08769882,0.042613994,0.003409349],"about_ca_topic_score_codex":0.00007237727,"about_ca_topic_score_gemma":0.00006857713,"teacher_disagreement_score":0.42172086,"about_ca_system_score_codex":0.0024435953,"about_ca_system_score_gemma":0.0013334446,"threshold_uncertainty_score":0.9999133},"labels":[],"label_agreement":null},{"id":"W1608706250","doi":"","title":"Building Distributed Educational Applications using Peer-To-Peer","year":2004,"lang":"en","type":"article","venue":"EdMedia: World Conference on Educational Media and Technology","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":"Acadia University","funders":"","keywords":"Computer science; Peer-to-peer; World Wide Web","score_opus":0.034715334848285186,"score_gpt":0.30419987625974704,"score_spread":0.26948454141146183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608706250","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01100226,0.00013382752,0.19773753,0.78844124,0.0012344025,0.00057001074,0.000056140936,0.0004962236,0.00032834584],"genre_scores_gemma":[0.7615423,0.000012414058,0.2356671,0.00087411323,0.000498684,0.0008565318,0.00008637189,0.000020690462,0.00044179484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694026,0.00002757142,0.00044706525,0.0010349858,0.0008392771,0.00071084034],"domain_scores_gemma":[0.99678373,0.0004987112,0.0001614727,0.00101148,0.0011443435,0.00040026766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003135862,0.00037067125,0.00035646002,0.0018605978,0.0003732899,0.00020100908,0.0019498632,0.00026030702,0.00007021821],"category_scores_gemma":[0.0014624463,0.0003884021,0.000046512767,0.004096819,0.00037953476,0.0002794202,0.0006294463,0.0006216759,0.00022762422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003649605,0.00019774224,0.0016975104,0.000007024621,0.000019835117,0.0000023093935,0.00020724942,0.00018077168,0.001130568,0.98482525,0.0042869523,0.007441131],"study_design_scores_gemma":[0.00027578522,0.00006397527,0.006082555,0.00009501245,0.000013500416,0.000050384355,0.000039734372,0.00036991193,0.0027502812,0.9827032,0.0071186326,0.00043704594],"about_ca_topic_score_codex":0.000033953664,"about_ca_topic_score_gemma":0.00014419999,"teacher_disagreement_score":0.78756714,"about_ca_system_score_codex":0.00033172552,"about_ca_system_score_gemma":0.0013795649,"threshold_uncertainty_score":0.99985677},"labels":[],"label_agreement":null},{"id":"W1608885791","doi":"10.5555/1496950.1496952","title":"Adaptive content-based routing in general overlay topologies","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network topology; Computer science; Computer network; PlanetLab; Overlay network; Overlay; Distributed computing; Software deployment; Publication; Routing (electronic design automation); Routing protocol; The Internet; World Wide Web","score_opus":0.08243092468436836,"score_gpt":0.2549299115763875,"score_spread":0.17249898689201915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608885791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4396168,0.000059404603,0.54736155,0.0066477875,0.00026926663,0.00020719708,0.0000011551762,0.001386776,0.0044500805],"genre_scores_gemma":[0.7423889,0.000003680347,0.2554798,0.0011381754,0.000022654618,0.000020437623,4.826952e-7,0.0000049963146,0.0009408697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859196,0.000043567627,0.00023211021,0.00042335605,0.00023240643,0.00047660383],"domain_scores_gemma":[0.999147,0.00013306191,0.000052662315,0.00055204215,0.00006194354,0.00005331108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018168912,0.00015700754,0.00020992824,0.00020551833,0.00009641077,0.00004362362,0.0011446314,0.0000951123,0.000008834529],"category_scores_gemma":[0.00017090296,0.00013453703,0.00005170273,0.00063922786,0.000111203946,0.0002672683,0.0005134456,0.00017510714,0.000054273092],"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.000076280194,0.00030507776,0.120740525,0.000007259716,0.00004855821,0.0011305371,0.0017357209,0.02116097,0.007491628,0.7227774,0.034717724,0.089808315],"study_design_scores_gemma":[0.0021986484,0.0007320181,0.19793504,0.00007747074,0.0000048199595,0.00009891911,0.0011173097,0.6923436,0.09573932,0.005143013,0.0031991648,0.0014106623],"about_ca_topic_score_codex":0.00045345552,"about_ca_topic_score_gemma":0.00027421917,"teacher_disagreement_score":0.7176344,"about_ca_system_score_codex":0.00011418485,"about_ca_system_score_gemma":0.000076051845,"threshold_uncertainty_score":0.54862607},"labels":[],"label_agreement":null},{"id":"W1624873464","doi":"10.1007/978-0-387-09751-0_16","title":"Distributed Search and Pattern Matching","year":2009,"lang":"en","type":"book-chapter","venue":"","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 Waterloo","funders":"","keywords":"Computer science; Distributed computing; XML; Population; World Wide Web","score_opus":0.021191567817919643,"score_gpt":0.24109716671759465,"score_spread":0.219905598899675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1624873464","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013660637,0.00023255988,0.80369824,0.0071672644,0.00012935292,0.00025215844,0.00002854949,0.0014368014,0.18691848],"genre_scores_gemma":[0.05002574,0.00031006406,0.11501132,0.0036814169,0.00028949563,0.000015187976,0.00009052604,0.00008862801,0.8304876],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828684,0.000009169198,0.00022861837,0.0006751671,0.00040798582,0.00039218832],"domain_scores_gemma":[0.9987447,0.00006349764,0.00004571157,0.0009492288,0.00006895973,0.00012785346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018056248,0.00031306825,0.00031881977,0.00021927165,0.00009128957,0.00030012798,0.0014699517,0.00030673176,0.00003136362],"category_scores_gemma":[0.000008565311,0.00028176283,0.00005736489,0.00007736848,0.000056446195,0.00015533429,0.0014903238,0.00051009294,0.0001991928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.280701e-7,0.000004700876,0.000014096901,0.000010463211,0.00001946158,0.00009382003,0.00005741949,0.00004259453,0.0000098111095,0.19983101,0.010750622,0.7891651],"study_design_scores_gemma":[0.00041356543,0.00041839742,0.0016797744,0.0005483804,0.000028357861,0.00021717533,0.000020885214,0.00960424,0.00031079628,0.49313012,0.4915354,0.0020929263],"about_ca_topic_score_codex":0.000041219795,"about_ca_topic_score_gemma":0.0000512955,"teacher_disagreement_score":0.7870721,"about_ca_system_score_codex":0.00006981621,"about_ca_system_score_gemma":0.000033889995,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W1637847238","doi":"10.1007/11499169_4","title":"Overlay Networks with Linear Capacity Constraints","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overlay; Overlay network; Computer science; Path (computing); Node (physics); Distributed computing; Context (archaeology); Graph; Computer network; Linear programming; Theoretical computer science; Measure (data warehouse); Algorithm; The Internet; Data mining; Programming language; World Wide Web","score_opus":0.016392810266469347,"score_gpt":0.22685798031004697,"score_spread":0.21046517004357762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1637847238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013281194,0.00028652902,0.9895607,0.0023577826,0.0012244469,0.00058315333,0.000007483024,0.000866731,0.0049803103],"genre_scores_gemma":[0.16554098,0.00002650925,0.830097,0.0031244252,0.0007965294,0.000015484826,0.000003285243,0.000050375664,0.0003453888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944264,0.00003264389,0.00057825615,0.0022817496,0.0013740805,0.0013068218],"domain_scores_gemma":[0.9960018,0.00047738617,0.00032159183,0.0025156285,0.0003549068,0.00032873577],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00088929274,0.0008552348,0.0007908456,0.0009827528,0.00029790736,0.0005587883,0.0062791896,0.0006417028,0.000028121623],"category_scores_gemma":[0.0001120287,0.000722473,0.00012568796,0.0013344409,0.0023511327,0.0006378612,0.0023464311,0.0017665633,0.00008680869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006315732,0.00002055129,0.00006490967,0.0000089066225,0.000016310427,0.00013071035,0.00019214163,0.3514388,0.000012181157,0.023897303,0.00014143178,0.62407047],"study_design_scores_gemma":[0.00045572434,0.00053399615,0.00027586057,0.00077391067,0.000015103814,0.00041372897,2.0088692e-7,0.9499899,0.0008105317,0.03329667,0.011702173,0.0017321578],"about_ca_topic_score_codex":0.000018985118,"about_ca_topic_score_gemma":0.00025305588,"teacher_disagreement_score":0.6223383,"about_ca_system_score_codex":0.0005055524,"about_ca_system_score_gemma":0.0005457044,"threshold_uncertainty_score":0.9995226},"labels":[],"label_agreement":null},{"id":"W1640838995","doi":"","title":"The Future Is Coming: Where the X Window System Should Go","year":2002,"lang":"en","type":"article","venue":"USENIX Annual Technical Conference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Laptop; Window (computing); Computer science; Replication (statistics); Mobile device; Server; Set (abstract data type); World Wide Web; Operating system","score_opus":0.036387290155763446,"score_gpt":0.25701726503520567,"score_spread":0.22062997487944222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640838995","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012160618,0.0069656703,0.33545703,0.5979841,0.0031186817,0.0029556435,0.00013631057,0.012026475,0.029195536],"genre_scores_gemma":[0.9869599,0.00023493847,0.008605418,0.0017318119,0.00029435442,0.00012830162,7.0896505e-7,0.000024815743,0.0020197972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99680376,0.00016118467,0.00050090114,0.00080043514,0.00087056047,0.00086315017],"domain_scores_gemma":[0.9959508,0.0005868887,0.00017172867,0.0027393363,0.00036325748,0.00018795044],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006872074,0.00039031426,0.0003733795,0.00008313561,0.0008246813,0.0007620246,0.0071541504,0.0003998767,0.000028024337],"category_scores_gemma":[0.00019109686,0.0002196255,0.0001597472,0.0011313078,0.00044347614,0.00037897236,0.0020213744,0.0011376303,0.00049883185],"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.0000122435895,0.00005012936,0.00019438947,0.000018719513,0.00002997201,0.000047636535,0.000757128,0.00001547335,0.0002913218,0.5407102,0.33983338,0.1180394],"study_design_scores_gemma":[0.0002818521,0.00026561462,0.0014483721,0.00015070045,0.00002156701,0.00019359407,0.0014178526,0.014115953,0.0011196682,0.0049576224,0.9753859,0.0006413279],"about_ca_topic_score_codex":0.000020358366,"about_ca_topic_score_gemma":0.00019045165,"teacher_disagreement_score":0.9747992,"about_ca_system_score_codex":0.000122092,"about_ca_system_score_gemma":0.000057184498,"threshold_uncertainty_score":0.99821764},"labels":[],"label_agreement":null},{"id":"W1662615465","doi":"10.1007/978-3-642-22630-4_2","title":"A Reference Model for Semantic Peer-to-Peer Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Ambiguity; Domain (mathematical analysis); Ontology; Abstraction; Peer-to-peer; Data science; Distributed computing","score_opus":0.045616282751240474,"score_gpt":0.2670011820732449,"score_spread":0.22138489932200445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1662615465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003380223,0.0002091522,0.985947,0.0066121668,0.0020203425,0.0015626567,0.000022754739,0.0009723293,0.0026197617],"genre_scores_gemma":[0.13595662,0.000021807436,0.85328263,0.004899466,0.0004533822,0.00014749113,0.000013107781,0.00009820309,0.005127309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918148,0.000028494718,0.0008866332,0.0032967285,0.0020807877,0.0018925486],"domain_scores_gemma":[0.9932678,0.00058264233,0.0003563267,0.0036738713,0.0016042754,0.00051513157],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021057227,0.0010905251,0.0010657833,0.0017397349,0.0004214121,0.0008574248,0.011293573,0.00090882403,0.0000100334255],"category_scores_gemma":[0.0005972013,0.0010287218,0.00023255893,0.0015125968,0.00060582696,0.00066019804,0.0052034054,0.0014586098,0.00012967139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018075954,0.000028820905,0.000011602968,0.000028412298,0.000016917458,0.000036060603,0.0008415669,0.50173926,0.000029619667,0.05409785,0.0020535844,0.4410982],"study_design_scores_gemma":[0.00017456531,0.0002792952,0.000025059673,0.00031538325,0.0000125420365,0.000032635842,1.3092746e-7,0.73684746,0.00017159621,0.25484687,0.0063293613,0.0009651281],"about_ca_topic_score_codex":0.00003540481,"about_ca_topic_score_gemma":0.0003088113,"teacher_disagreement_score":0.44013306,"about_ca_system_score_codex":0.00047894428,"about_ca_system_score_gemma":0.0006787714,"threshold_uncertainty_score":0.9992163},"labels":[],"label_agreement":null},{"id":"W1664839614","doi":"10.48550/arxiv.cs/0311047","title":"I know what you mean: semantic issues in Internet-scale publish/subscribe systems","year":2003,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Publication; World Wide Web; Semantics (computer science); The Internet; Syntax; Routing (electronic design automation); Computer network","score_opus":0.026816832909704193,"score_gpt":0.2494709763108569,"score_spread":0.22265414340115272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664839614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9473823,0.008040233,0.02974425,0.0073292567,0.0034713037,0.00051418494,8.7789056e-7,0.0012939258,0.0022236963],"genre_scores_gemma":[0.9893144,0.00030289646,0.004969698,0.00045164104,0.00009253961,0.000081024846,0.0000027252115,0.00003025597,0.0047548315],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99711955,0.00017787899,0.00051467284,0.00091396197,0.0004520501,0.0008219134],"domain_scores_gemma":[0.9978891,0.00009705601,0.00012762712,0.0015762494,0.00015036276,0.00015960235],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00084543304,0.00032892384,0.00045134188,0.00043601837,0.00007132396,0.0011376046,0.0024559915,0.00021993193,0.000017304896],"category_scores_gemma":[0.00027183333,0.0003121061,0.00008436412,0.0015841731,0.00009772923,0.0027066183,0.00074259687,0.0004080153,0.00077779737],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017479777,0.00044249586,0.8156181,0.00015587438,0.00010565248,0.0004139846,0.0072282865,0.00090680463,0.0014424844,0.047748625,0.08320764,0.042712595],"study_design_scores_gemma":[0.0020972057,0.00086789666,0.11226653,0.0025856693,0.000049022954,0.00034666102,0.0068075005,0.050809715,0.03644025,0.0057906047,0.778674,0.003264914],"about_ca_topic_score_codex":0.00032283962,"about_ca_topic_score_gemma":0.00038525864,"teacher_disagreement_score":0.70335156,"about_ca_system_score_codex":0.00016385713,"about_ca_system_score_gemma":0.00005525862,"threshold_uncertainty_score":0.9999331},"labels":[],"label_agreement":null},{"id":"W1665278273","doi":"10.1007/978-0-387-09751-0","title":"Handbook of Peer-to-Peer Networking","year":2010,"lang":"en","type":"book","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":156,"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":"Peer-to-peer; Computer science; Peer review; Scale (ratio); World Wide Web; Internet privacy; Political science; Physics","score_opus":0.016502219528404877,"score_gpt":0.2476464625499414,"score_spread":0.23114424302153652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1665278273","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014193985,0.00055410975,0.4424986,0.0078034084,0.0033906538,0.0007452201,0.000014421258,0.0017567868,0.5432226],"genre_scores_gemma":[0.00017394724,0.000025197567,0.255156,0.0013612789,0.0008123324,0.000047643192,0.000019521698,0.000068157795,0.7423359],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948221,0.000033972574,0.0007953061,0.0013104681,0.002047656,0.0009904891],"domain_scores_gemma":[0.99458706,0.0002935352,0.00036694345,0.0032631059,0.0011475629,0.00034177542],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00105835,0.0007069922,0.0009990312,0.00084448484,0.00013544245,0.0002963912,0.006621837,0.0012013816,0.0001056903],"category_scores_gemma":[0.00028105796,0.00065983686,0.00028646528,0.00072039454,0.00017537034,0.00023423634,0.003913219,0.0015075268,0.00090563303],"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.0000048119873,0.000018217475,0.000017107852,0.000022346148,0.00004961271,0.000028153865,0.00015698315,0.00014061693,0.00015021431,0.029395653,0.85161626,0.11840003],"study_design_scores_gemma":[0.00015075403,0.00017336589,0.000022217868,0.0004399545,0.00002257834,0.000021911394,0.0000039795846,0.0012029831,0.0015433748,0.023267688,0.97239035,0.0007608323],"about_ca_topic_score_codex":0.000031408843,"about_ca_topic_score_gemma":0.00021605575,"teacher_disagreement_score":0.1991133,"about_ca_system_score_codex":0.00020620199,"about_ca_system_score_gemma":0.0005685448,"threshold_uncertainty_score":0.99987227},"labels":[],"label_agreement":null},{"id":"W169878834","doi":"10.1007/978-3-642-22993-0_10","title":"Faster Coupon Collecting via Replication with Applications in Gossiping","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Replica; Sequence (biology); Replication (statistics); Coupon; Gossip; Constructive; Extension (predicate logic); Matching (statistics); Asymptotically optimal algorithm; Theoretical computer science; Algorithm; Mathematics; Process (computing); Statistics; Programming language","score_opus":0.024474695177994884,"score_gpt":0.2499125393805907,"score_spread":0.2254378442025958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W169878834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032474578,0.00016072938,0.99276555,0.00087335176,0.00028572453,0.0011299695,0.0000018757061,0.0004970888,0.003960993],"genre_scores_gemma":[0.27807683,0.000015099843,0.7202574,0.000860014,0.00017280481,0.00018084412,0.000005298436,0.000049990667,0.00038168643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955787,0.000025596759,0.000575975,0.0023016974,0.0007471334,0.0007708712],"domain_scores_gemma":[0.9958589,0.00035556083,0.00036374482,0.003009859,0.0002753016,0.00013661655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096463977,0.0005276311,0.0005137048,0.0015384841,0.00030141513,0.00040766888,0.0043885806,0.0003584061,0.000005075422],"category_scores_gemma":[0.00008500116,0.0004701735,0.000059285212,0.0024267607,0.00046123052,0.0005573257,0.0016563956,0.0009195983,0.000036666963],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001036094,0.00004497032,0.0008985997,0.000033637505,0.000010526696,0.00003377161,0.0015341977,0.021018311,0.00031672223,0.018537309,0.000028134886,0.9575335],"study_design_scores_gemma":[0.00075264444,0.0008090134,0.0036294085,0.0018651334,0.000022685275,0.00027132608,0.0000023955472,0.55422,0.00880503,0.41798288,0.008702774,0.0029366806],"about_ca_topic_score_codex":0.00006425418,"about_ca_topic_score_gemma":0.0005886698,"teacher_disagreement_score":0.95459676,"about_ca_system_score_codex":0.00058337447,"about_ca_system_score_gemma":0.00037732103,"threshold_uncertainty_score":0.999775},"labels":[],"label_agreement":null},{"id":"W1702322733","doi":"","title":"Efficient matching for state-persistent publish/subscribe systems","year":2003,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Stateless protocol; Scalability; Matching (statistics); Dissemination; State (computer science); Distributed computing; Computer network; Database; Algorithm","score_opus":0.12014801778206805,"score_gpt":0.3786206462665691,"score_spread":0.25847262848450103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1702322733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33910936,0.013208818,0.51640564,0.07599585,0.011521919,0.035166968,0.0014423447,0.00093417906,0.0062149507],"genre_scores_gemma":[0.9737383,0.0001078274,0.022424,0.00005303244,0.000024450512,0.0010468017,0.0000021653168,0.000023825954,0.0025795961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99627185,0.00044927496,0.00048402586,0.0007825971,0.0010073297,0.0010049038],"domain_scores_gemma":[0.9888306,0.0019597856,0.00025329867,0.0011066945,0.007717645,0.00013197344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002269445,0.00028444658,0.00054129295,0.00029223404,0.00084164465,0.00032536173,0.0021119227,0.00007314304,9.98697e-7],"category_scores_gemma":[0.0066725896,0.00019765945,0.00015261793,0.0023952913,0.00041708557,0.00019404285,0.0007413793,0.00030594048,0.000005601999],"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.0002888676,0.00028167292,0.000053709045,0.00036095225,0.00039755765,0.0000024487201,0.010428698,0.23983727,0.0034817269,0.71675193,0.020772967,0.007342171],"study_design_scores_gemma":[0.008058199,0.006193216,0.00012838791,0.0038825274,0.000084290936,0.0000065348468,0.26948658,0.11835051,0.21120687,0.123040184,0.25729102,0.0022716732],"about_ca_topic_score_codex":0.000003864776,"about_ca_topic_score_gemma":0.000064007065,"teacher_disagreement_score":0.63462895,"about_ca_system_score_codex":0.0005416025,"about_ca_system_score_gemma":0.000547625,"threshold_uncertainty_score":0.8060319},"labels":[],"label_agreement":null},{"id":"W1717774950","doi":"10.1007/978-3-540-79549-0_37","title":"Modeling Priority-Based Incentive Policies for Peer-Assisted Content Delivery Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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 Saskatchewan","funders":"","keywords":"Computer science; Incentive; Content delivery; Peer-to-peer; Distributed computing; Computer network; Microeconomics","score_opus":0.05625852938232893,"score_gpt":0.2625402236996901,"score_spread":0.20628169431736118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717774950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001277683,0.0011005853,0.9891058,0.002780756,0.0028876916,0.0016656617,0.00004091388,0.00086963165,0.00027128385],"genre_scores_gemma":[0.4105677,0.00005820117,0.58645386,0.0018301194,0.00048487185,0.00011770569,0.000018221042,0.000068104746,0.00040119927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936384,0.00004812797,0.0009105946,0.0021938535,0.0018961086,0.0013129122],"domain_scores_gemma":[0.9948032,0.0007205154,0.00036640817,0.0020613144,0.0017800789,0.00026846322],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010949277,0.00086675066,0.0010357249,0.0017213036,0.00060308113,0.00088065484,0.0060543413,0.00061917026,8.7619463e-7],"category_scores_gemma":[0.00035956572,0.0008182926,0.0002834095,0.0010916643,0.0007603389,0.00058474304,0.0021195707,0.00090481376,0.00001992123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002600029,0.000053770786,0.00003958802,0.00008703726,0.000033076085,0.00008295163,0.000744067,0.81482434,0.00023117289,0.006861081,0.00023365425,0.17678326],"study_design_scores_gemma":[0.0004736151,0.00032182864,0.000041024563,0.000723912,0.000014024144,0.0000553989,0.0000013166502,0.9890088,0.00092098047,0.004703155,0.002790097,0.0009458358],"about_ca_topic_score_codex":0.00026404278,"about_ca_topic_score_gemma":0.00016959509,"teacher_disagreement_score":0.40929005,"about_ca_system_score_codex":0.0011076917,"about_ca_system_score_gemma":0.0011501347,"threshold_uncertainty_score":0.9994268},"labels":[],"label_agreement":null},{"id":"W1720341833","doi":"10.5555/1516124.1516150","title":"A policy management framework for content-based publish/subscribe middleware","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Middleware (distributed applications); Scalability; Semantics (computer science); Context (archaeology); Publication; Security policy; Matching (statistics); Loose coupling; Distributed computing; Database; Computer security; Programming language","score_opus":0.05754332474507112,"score_gpt":0.30165430197693827,"score_spread":0.24411097723186714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1720341833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015309557,0.000042085856,0.9536709,0.034044728,0.00045898047,0.0007957838,0.0000050286103,0.001937288,0.007514252],"genre_scores_gemma":[0.15722047,0.0000021223148,0.82983005,0.010242864,0.00012989728,0.00013041616,0.000004620866,0.000017641147,0.002421927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769914,0.0000137738225,0.00033171647,0.00062394375,0.0004136659,0.0009177461],"domain_scores_gemma":[0.99791574,0.00027979663,0.00008228014,0.001323296,0.0001986039,0.00020026545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067145145,0.00022850149,0.00021692968,0.00066961214,0.00014056997,0.00042633578,0.0025517566,0.00017946567,0.000010332036],"category_scores_gemma":[0.00041147973,0.00020464972,0.0001237924,0.0017201998,0.000056201294,0.00038752652,0.0006911096,0.00017475038,0.00007141268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015313077,0.000057448084,0.00027903757,0.000019654859,0.000024225146,0.00001899075,0.000053504213,0.0000425916,0.000032019438,0.8485507,0.01573503,0.13517149],"study_design_scores_gemma":[0.0032111292,0.000988549,0.013800233,0.00038135468,0.000044990564,0.000020469264,0.0016994928,0.019173227,0.031626,0.6227509,0.3041313,0.0021723693],"about_ca_topic_score_codex":0.00006264475,"about_ca_topic_score_gemma":0.00008208825,"teacher_disagreement_score":0.28839627,"about_ca_system_score_codex":0.00017074689,"about_ca_system_score_gemma":0.00005724559,"threshold_uncertainty_score":0.8345373},"labels":[],"label_agreement":null},{"id":"W1723741712","doi":"","title":"Subject space: a state-persistent model for publish/subscribe systems","year":2002,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Publication; Subject (documents); Search engine indexing; Semantics (computer science); Flexibility (engineering); State (computer science); Kernel (algebra); Space (punctuation); Information retrieval; Theoretical computer science; World Wide Web; Programming language","score_opus":0.20241685916069316,"score_gpt":0.3777957177001403,"score_spread":0.17537885853944715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1723741712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07215235,0.021534227,0.58716977,0.2631153,0.006309272,0.03892251,0.0030983642,0.0013287459,0.006369513],"genre_scores_gemma":[0.9631303,0.00054892787,0.021017192,0.00007447689,0.00004046929,0.0015300141,0.0000031228587,0.000030682455,0.0136247985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962317,0.00027581144,0.00047113493,0.00086110487,0.0010702275,0.0010900502],"domain_scores_gemma":[0.9881561,0.0014889785,0.00025466087,0.001301643,0.008650857,0.00014777428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013107884,0.000322355,0.00061766745,0.000340791,0.0007399988,0.0003427876,0.0027431957,0.00009422761,0.0000015297439],"category_scores_gemma":[0.005312225,0.00022775248,0.00017889233,0.002601655,0.0005317581,0.0005107914,0.00091479917,0.0003426303,0.0000085331085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070188637,0.0005664423,0.00012521922,0.00066305546,0.0008735895,0.0000051267493,0.028172864,0.2902572,0.0037345905,0.40758026,0.24486293,0.022456836],"study_design_scores_gemma":[0.0017062278,0.0014333305,0.0000128295505,0.0005947969,0.00001969993,9.632329e-7,0.021134997,0.92219275,0.015180982,0.01418144,0.023065683,0.00047631684],"about_ca_topic_score_codex":0.0000039763395,"about_ca_topic_score_gemma":0.00017610945,"teacher_disagreement_score":0.890978,"about_ca_system_score_codex":0.0004469135,"about_ca_system_score_gemma":0.0003188877,"threshold_uncertainty_score":0.92874765},"labels":[],"label_agreement":null},{"id":"W1734166017","doi":"10.1002/cpe.3160","title":"Supporting multidimensional range queries in Hierarchically Distributed Tree","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Overlay; Distributed computing; Overlay network; Range query (database); Routing (electronic design automation); Tree (set theory); Load balancing (electrical power); Network topology; Range (aeronautics); Set (abstract data type); Process (computing); Computer network; Information retrieval; Mathematics; Grid","score_opus":0.016875113048608354,"score_gpt":0.3178772061085061,"score_spread":0.3010020930598978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1734166017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5651796,0.00049911684,0.4266657,0.0069023203,0.00015351437,0.00024944634,0.0000022234158,0.00016308647,0.00018499912],"genre_scores_gemma":[0.932727,0.00006828216,0.066309005,0.0007565997,0.0000143283805,0.00010059665,0.000006337358,0.0000037027364,0.000014158077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986278,0.00009222093,0.00032446184,0.00044282211,0.00021002021,0.0003027106],"domain_scores_gemma":[0.9987988,0.0006286608,0.00013614455,0.00016953402,0.00015049265,0.00011635953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025683705,0.00014349994,0.0001643145,0.00010897941,0.0001665251,0.0002229297,0.00024995356,0.00006235002,0.0000065853187],"category_scores_gemma":[0.00089629507,0.00013481593,0.000015148579,0.0004496589,0.00015556205,0.001980823,0.0003479856,0.00019959283,0.000015419531],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003657107,0.00013346106,0.010824117,0.000023696066,0.000010935785,0.000055452838,0.020366115,0.00029677185,0.0010245271,0.04058238,0.0013037728,0.9253422],"study_design_scores_gemma":[0.0024857104,0.00079475675,0.28309327,0.0002544251,0.000018276418,0.0004160691,0.015000122,0.64060634,0.0012508553,0.02600429,0.028572824,0.0015030588],"about_ca_topic_score_codex":0.00009795043,"about_ca_topic_score_gemma":0.000012125706,"teacher_disagreement_score":0.92383915,"about_ca_system_score_codex":0.000017302866,"about_ca_system_score_gemma":0.00004660729,"threshold_uncertainty_score":0.5497634},"labels":[],"label_agreement":null},{"id":"W1740288049","doi":"10.1007/978-3-642-01344-7_5","title":"Web 2.0 OLAP: From Data Cubes to Tag Clouds","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":22,"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 à Montréal","funders":"","keywords":"Computer science; Online analytical processing; Upload; Cloud computing; Tag cloud; Benchmark (surveying); Visualization; World Wide Web; Business intelligence; Data cube; Cluster analysis; Data science; Database; Data mining; Data warehouse; Operating system","score_opus":0.02465323784500241,"score_gpt":0.25491972507818067,"score_spread":0.23026648723317827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1740288049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001087088,0.0008037361,0.96492314,0.010011347,0.0007159259,0.0005637092,0.000116559044,0.0012194084,0.021537486],"genre_scores_gemma":[0.14997654,0.00033652145,0.82048595,0.023446342,0.0012175424,0.00007643241,0.0029247426,0.00013918136,0.0013967318],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99676836,0.000014232378,0.0010025962,0.0007914812,0.0008558163,0.00056753954],"domain_scores_gemma":[0.99621063,0.00016624577,0.0005395016,0.0023383566,0.00062739797,0.000117840405],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003791441,0.00066742214,0.0006663175,0.0012845017,0.00020790118,0.0013356195,0.005072484,0.0007964627,0.00002512963],"category_scores_gemma":[0.0009752451,0.00063908583,0.000046588233,0.001416212,0.00007310196,0.004588799,0.002329617,0.0008186495,0.00028086244],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014370903,0.0000082385495,0.000019119056,0.00009332468,0.0000111454765,0.000009720806,0.0006331682,0.014663132,0.000014185481,0.0017223968,0.0015453765,0.98126584],"study_design_scores_gemma":[0.00048352068,0.000052385916,0.0006220309,0.002784074,0.000036374888,0.000025910449,0.000008777522,0.14604215,0.00041268978,0.07171713,0.776127,0.0016880003],"about_ca_topic_score_codex":0.0000494373,"about_ca_topic_score_gemma":0.00020219864,"teacher_disagreement_score":0.97957784,"about_ca_system_score_codex":0.00025591854,"about_ca_system_score_gemma":0.00050677906,"threshold_uncertainty_score":0.9997011},"labels":[],"label_agreement":null},{"id":"W174280640","doi":"10.1007/978-3-319-03807-0_2","title":"Plexus: Routing and Indexing","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","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":"Search engine indexing; Computer science; Scalability; Information retrieval; The Internet; Bandwidth (computing); Computer network; Popularity; Software deployment; Search engine; World Wide Web; Matching (statistics); Distributed computing; Database; Operating system; Medicine","score_opus":0.01770957131298628,"score_gpt":0.22936065911592773,"score_spread":0.21165108780294145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174280640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023742954,0.00036604426,0.90413636,0.0013504687,0.0019333086,0.00073292985,0.000001903209,0.0011762134,0.08792849],"genre_scores_gemma":[0.14286791,0.000103001934,0.83968407,0.001849657,0.00054572267,0.000044093704,0.0000010013532,0.00008329142,0.014821267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949297,0.000018442026,0.0006629882,0.00215914,0.0010997348,0.0011299959],"domain_scores_gemma":[0.9969722,0.00019260343,0.00029475527,0.0020051156,0.00021728127,0.000318029],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0014081214,0.0006054489,0.0006184023,0.0013298856,0.00033787073,0.0014068123,0.005656422,0.00033779393,0.000018214423],"category_scores_gemma":[0.00010847103,0.00063051464,0.00007650944,0.0008328625,0.00085734745,0.001305277,0.009437575,0.00096880365,0.00021010217],"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":[9.22398e-7,0.000008573404,0.000232339,0.000020702546,0.0000078408,0.000073867326,0.00041755705,0.0005949285,0.000068636946,0.54951394,0.0003460234,0.4487147],"study_design_scores_gemma":[0.0007576643,0.00048863847,0.010396096,0.0026762357,0.000016129829,0.00030973475,0.000010862623,0.6518339,0.0010370999,0.24976614,0.07862139,0.0040861247],"about_ca_topic_score_codex":0.000068940375,"about_ca_topic_score_gemma":0.00003326782,"teacher_disagreement_score":0.651239,"about_ca_system_score_codex":0.0003741963,"about_ca_system_score_gemma":0.00031239243,"threshold_uncertainty_score":0.99972343},"labels":[],"label_agreement":null},{"id":"W177025918","doi":"","title":"Towards A Peer-to-Peer Simulator.","year":2004,"lang":"en","type":"article","venue":"International Conference on Internet Computing","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":"Carleton University","funders":"","keywords":"Computer science; Peer-to-peer; Simulation; Human–computer interaction; Distributed computing","score_opus":0.048676654131612734,"score_gpt":0.3243119729853918,"score_spread":0.2756353188537791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177025918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12219794,0.000006120148,0.7846317,0.05627301,0.0026883353,0.0002856146,0.000010117919,0.0010959961,0.032811116],"genre_scores_gemma":[0.9140982,9.4383563e-7,0.07887359,0.0039016875,0.0002986024,0.000014189931,0.000010549597,0.000025867412,0.0027763376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960062,0.000042745847,0.0005593608,0.0010198047,0.0017270651,0.000644832],"domain_scores_gemma":[0.99715763,0.00011059589,0.00017078323,0.0008075014,0.0014752676,0.0002782254],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062081835,0.0003962352,0.00033087283,0.0006295695,0.00009467096,0.00090397097,0.0048837294,0.0001509602,0.000092447175],"category_scores_gemma":[0.00086822675,0.00039666917,0.00013588414,0.0006204386,0.00006530842,0.0003529734,0.002273546,0.00051916006,0.00148596],"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.000035007233,0.00012962229,0.00033117284,0.000004785143,0.00008431406,0.00010012321,0.0021061082,0.05793252,0.0005023357,0.82864237,0.0085984655,0.10153319],"study_design_scores_gemma":[0.0018955084,0.0012435757,0.005190217,0.0010696115,0.000012768177,0.0001506754,0.00032750051,0.780571,0.020763759,0.089671336,0.0973374,0.0017666663],"about_ca_topic_score_codex":0.0002684111,"about_ca_topic_score_gemma":0.000049046925,"teacher_disagreement_score":0.7919003,"about_ca_system_score_codex":0.0005156391,"about_ca_system_score_gemma":0.0001912323,"threshold_uncertainty_score":0.99984854},"labels":[],"label_agreement":null},{"id":"W1793399427","doi":"10.1007/11587552_13","title":"Composite Subscriptions in Content-Based Publish/Subscribe Systems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":172,"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 Toronto","funders":"","keywords":"Computer science; Workflow; Distributed computing; Publication; Router; Event (particle physics); Gossip; Computer network; Database","score_opus":0.03552637814999902,"score_gpt":0.2382614876497916,"score_spread":0.2027351094997926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793399427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000577792,0.0012918385,0.98351115,0.0068024034,0.0036665613,0.0010420607,0.000018957535,0.00093190925,0.002157355],"genre_scores_gemma":[0.38726816,0.000039057733,0.6057067,0.0050075464,0.00069405814,0.00011596471,0.000025910193,0.00009133802,0.0010512507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933108,0.000077655706,0.0010788669,0.0024408363,0.001640344,0.0014514726],"domain_scores_gemma":[0.9953766,0.00051394757,0.0003904538,0.0028611845,0.00052728323,0.00033055505],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014220952,0.0008773152,0.001015822,0.003376618,0.00027648784,0.002072255,0.0085646175,0.0006762908,0.000009775179],"category_scores_gemma":[0.00019977687,0.0008581578,0.0001850013,0.0024526261,0.00083750294,0.0013658768,0.0022282067,0.0016480773,0.00012760799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020164625,0.00016789822,0.0011820345,0.00008580294,0.000027384982,0.00045503234,0.00059798866,0.45859087,0.0010982055,0.07797431,0.00079786946,0.45900247],"study_design_scores_gemma":[0.0009301399,0.00030850648,0.0014090172,0.0016065298,0.000013927854,0.00013535199,0.0000014212543,0.96091336,0.0013791518,0.016363442,0.014998343,0.0019408357],"about_ca_topic_score_codex":0.0001907271,"about_ca_topic_score_gemma":0.00091539946,"teacher_disagreement_score":0.5023225,"about_ca_system_score_codex":0.0011913896,"about_ca_system_score_gemma":0.000695621,"threshold_uncertainty_score":0.9993869},"labels":[],"label_agreement":null},{"id":"W1802659144","doi":"10.1007/978-3-540-72606-7_58","title":"Optimal Rate Allocation in Overlay Content Distribution","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":27,"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 Toronto","funders":"","keywords":"Computer science; Overlay; Mathematical optimization; Node (physics); Convergence (economics); Rate of convergence; Overlay network; Optimal allocation; Linear programming; Content distribution; Optimization problem; Distributed computing; Algorithm; Computer network; Mathematics; The Internet","score_opus":0.03453425704479631,"score_gpt":0.2613523442078247,"score_spread":0.2268180871630284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802659144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097479415,0.00020738332,0.99308187,0.0024285673,0.0014966531,0.0005902959,0.000009366084,0.0003910004,0.000820093],"genre_scores_gemma":[0.43047607,0.00004709057,0.566258,0.002236505,0.00034633846,0.000031502103,0.000041433228,0.000040806488,0.0005222598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956779,0.000038066668,0.0006786641,0.0016860722,0.0009625023,0.00095681206],"domain_scores_gemma":[0.99737793,0.00037700095,0.00025786433,0.0015013961,0.00032075058,0.00016504066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002013744,0.0005387789,0.00052405853,0.0010887085,0.00014823055,0.0004522,0.0039501926,0.0004912438,0.000005236605],"category_scores_gemma":[0.00027961613,0.00052296516,0.000096822405,0.0014798538,0.00051629974,0.0006396036,0.0019159018,0.0010081071,0.00007262413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015783533,0.000040337905,0.00016000406,0.000016227543,0.000007540581,0.00013432957,0.0002999709,0.177929,0.0003493573,0.05662611,0.00010974977,0.7643116],"study_design_scores_gemma":[0.0006524537,0.00056494685,0.005753375,0.0008547188,0.0000085005495,0.000090177884,6.71681e-7,0.90946317,0.006987206,0.06730265,0.006703004,0.0016191113],"about_ca_topic_score_codex":0.000055463894,"about_ca_topic_score_gemma":0.0003013832,"teacher_disagreement_score":0.76269245,"about_ca_system_score_codex":0.0010012538,"about_ca_system_score_gemma":0.00035706474,"threshold_uncertainty_score":0.9997222},"labels":[],"label_agreement":null},{"id":"W1810101816","doi":"10.5555/2432523.2432539","title":"What your CDN won't tell you: optimizing a news website for speed and stability","year":2012,"lang":"en","type":"article","venue":"USENIX Large Installation Systems Administration Conference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"CBC (Canada)","funders":"","keywords":"Broadcasting (networking); Content delivery network; Computer science; Content delivery; World Wide Web; Computer network; Server","score_opus":0.082462509150237,"score_gpt":0.30688573049269924,"score_spread":0.22442322134246223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810101816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30895513,0.0003576008,0.68427837,0.0019295032,0.0014430007,0.0014743247,0.000045884746,0.0005923992,0.00092379673],"genre_scores_gemma":[0.9635325,0.000050507682,0.03542098,0.00013957784,0.00021999587,0.000091693626,0.00004362626,0.000020432537,0.00048067785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972755,0.00013780208,0.0007458353,0.0006973633,0.00047052364,0.0006730204],"domain_scores_gemma":[0.9977339,0.00021886092,0.00039147335,0.00086802983,0.0004879797,0.0002997716],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011147666,0.00033001642,0.00039529864,0.00021210572,0.00029563528,0.0018326232,0.0005730248,0.0002488772,0.000016134842],"category_scores_gemma":[0.00027991485,0.00033425487,0.00007243024,0.00048109124,0.00005962285,0.004010255,0.00028591676,0.00017985664,0.000034461056],"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.00040875727,0.0010910234,0.15218818,0.0009866008,0.0002813989,0.000024433277,0.030328652,0.001783791,0.03467435,0.7253205,0.004459861,0.04845244],"study_design_scores_gemma":[0.0042285714,0.0014760863,0.027558675,0.00090241863,0.00010411901,0.00031242278,0.021063916,0.5922585,0.019138383,0.0025239263,0.3270448,0.0033881569],"about_ca_topic_score_codex":0.000024887862,"about_ca_topic_score_gemma":0.00015534878,"teacher_disagreement_score":0.72279656,"about_ca_system_score_codex":0.00013852779,"about_ca_system_score_gemma":0.00024017187,"threshold_uncertainty_score":0.99991095},"labels":[],"label_agreement":null},{"id":"W1814546009","doi":"","title":"Delay and capacity analysis of structured P2P overlay for IP telephony","year":2010,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Chord (peer-to-peer); Computer network; Overlay network; Overlay; Session (web analytics); Telephony; Queueing theory; Session Initiation Protocol; IP Multimedia Subsystem; Distributed computing; Voice over IP; Queuing delay; Server; The Internet; Operating system; Quality of service","score_opus":0.014152689299690267,"score_gpt":0.23009195149819767,"score_spread":0.2159392621985074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814546009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30957997,0.00025197052,0.68315005,0.0048330436,0.00025124292,0.0004929731,0.00016811841,0.000336468,0.0009361536],"genre_scores_gemma":[0.61254793,0.000064105225,0.386773,0.00006105405,0.000010019948,0.0000680424,0.000095807154,0.000016676977,0.00036339654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963322,0.0010538856,0.00060075667,0.0011226782,0.0004680325,0.00042241998],"domain_scores_gemma":[0.99158335,0.0015307122,0.00066054007,0.0038792642,0.0021608695,0.00018526304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003727261,0.00037006833,0.00072412123,0.0007556419,0.00023570668,0.00041633873,0.0035928513,0.0005492711,0.000013379569],"category_scores_gemma":[0.002050146,0.00037989268,0.00031855732,0.0014470327,0.00032615333,0.000170557,0.0037591842,0.000752455,0.0000022039653],"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.000030079755,0.0005082724,0.010196027,0.0003458882,0.0020047906,0.0000055328983,0.016424065,0.002489793,0.026149722,0.6342676,0.003151359,0.30442685],"study_design_scores_gemma":[0.0009260108,0.0000030508559,0.086345755,0.00081592676,0.00087939535,0.000015653095,0.000079040576,0.5883651,0.2152522,0.08338114,0.022347989,0.0015887418],"about_ca_topic_score_codex":0.0012141189,"about_ca_topic_score_gemma":0.0077667953,"teacher_disagreement_score":0.5858753,"about_ca_system_score_codex":0.00008060713,"about_ca_system_score_gemma":0.00017478538,"threshold_uncertainty_score":0.9998653},"labels":[],"label_agreement":null},{"id":"W1857811639","doi":"10.1002/cpe.3106","title":"A performance evaluation of mobility management and multihop supplying partner strategies for 3D streaming systems over thin mobile devices","year":2013,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"Canada Research Chairs","keywords":"Computer science; Computer network; Scalability; Network packet; Mobile device; Wireless network; Protocol (science); Packet loss; Bandwidth (computing); Wireless; Telecommunications; World Wide Web","score_opus":0.04198130908628272,"score_gpt":0.349121365128016,"score_spread":0.3071400560417333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857811639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833623,0.0018736513,0.16292092,0.00008155275,0.00014099617,0.0011120453,0.0000017844728,0.00006327208,0.00018276568],"genre_scores_gemma":[0.9663825,0.00018978598,0.03236207,0.00005162546,0.0000110815035,0.0009892539,0.0000028608965,0.0000034911957,0.000007349271],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987456,0.00008975218,0.00028748316,0.0004039795,0.0002950779,0.0001780855],"domain_scores_gemma":[0.99881524,0.0003862401,0.00020709791,0.00018527509,0.00035441507,0.000051720108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066279323,0.0001321799,0.0001561851,0.000080228696,0.00019937767,0.00036710015,0.00018000208,0.000046779627,0.0000020267153],"category_scores_gemma":[0.00009680315,0.00011948382,0.000011595965,0.00019939317,0.00010667167,0.0029238274,0.00019334836,0.00006698032,9.719579e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015923597,0.0000833785,0.0040617273,0.00033490444,0.00003007561,6.5242546e-7,0.01878307,0.013887503,0.00016027664,0.007357037,0.000092010625,0.95519346],"study_design_scores_gemma":[0.00037610112,0.00018075539,0.013193643,0.000097790726,0.000026934473,0.000008058222,0.018384922,0.9662297,0.00007447279,0.000603987,0.00067006395,0.00015360571],"about_ca_topic_score_codex":0.00008541642,"about_ca_topic_score_gemma":0.000003460567,"teacher_disagreement_score":0.95503986,"about_ca_system_score_codex":0.00001919066,"about_ca_system_score_gemma":0.00003721403,"threshold_uncertainty_score":0.48724088},"labels":[],"label_agreement":null},{"id":"W1880498013","doi":"10.15803/ijnc.4.1_88","title":"Supporting Decentralized SPARQL Queries in an Ad-Hoc Semantic Web Data Sharing System","year":2014,"lang":"en","type":"article","venue":"International Journal of Networking and Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"University of Ottawa; China Postdoctoral Science Foundation; National High-tech Research and Development Program; National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; SPARQL; Named graph; RDF; Scalability; Semantic Web; Information retrieval; World Wide Web; Query optimization; RDF query language; Database; Web search query; Web query classification; Search engine","score_opus":0.04229164176653147,"score_gpt":0.3304502073818049,"score_spread":0.2881585656152734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880498013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6156209,0.0007487988,0.38019267,0.0011146,0.0020017049,0.000060965867,7.8580774e-7,0.00015430312,0.000105288775],"genre_scores_gemma":[0.92728543,0.00006275956,0.071821295,0.00015707352,0.0006527785,5.083251e-7,0.000003070004,0.000011953432,0.0000051101283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766254,0.00012511213,0.000833896,0.00044233227,0.0005129601,0.0004231374],"domain_scores_gemma":[0.998187,0.00032815023,0.0006349506,0.0005142863,0.00021688173,0.000118709606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028330102,0.0001677332,0.00032834586,0.00034525804,0.00010802563,0.0006617514,0.0037306545,0.00007113597,7.9675954e-7],"category_scores_gemma":[0.00022125695,0.00016067644,0.000042539617,0.00030871484,0.000034151457,0.00069154095,0.0020788927,0.00037073786,0.0000020154016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006898692,0.000067436624,0.12463309,0.000042180916,0.0001266367,0.0004217397,0.0015882676,0.04022094,0.000490297,0.009987222,0.0005958111,0.8217574],"study_design_scores_gemma":[0.0004987946,0.00008571465,0.005014956,0.0011201304,0.00000813992,0.00054319005,0.0002269166,0.98696625,0.000031598967,0.0009800984,0.004340284,0.00018392222],"about_ca_topic_score_codex":0.00001038746,"about_ca_topic_score_gemma":0.000051844552,"teacher_disagreement_score":0.94674534,"about_ca_system_score_codex":0.00011543647,"about_ca_system_score_gemma":0.000047337988,"threshold_uncertainty_score":0.6932546},"labels":[],"label_agreement":null},{"id":"W1892106905","doi":"10.1002/smr.1550","title":"On the evolution of Linux kernels: a complex network perspective","year":2012,"lang":"en","type":"article","venue":"Journal of Software Evolution and Process","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Linux kernel; Computer science; Kernel (algebra); Configfs; Clustering coefficient; Perspective (graphical); System call; Theoretical computer science; Path (computing); Cluster analysis; Operating system; Parallel computing; Distributed computing; Mathematics; Artificial intelligence; Discrete mathematics","score_opus":0.023293738740088984,"score_gpt":0.27582552069797606,"score_spread":0.25253178195788706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892106905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10090796,0.0042691124,0.8903763,0.0034597665,0.00044867676,0.00016003546,0.0000026552395,0.00010775692,0.00026772762],"genre_scores_gemma":[0.9780079,0.00002552425,0.02142515,0.00021115673,0.00028842976,0.0000047809076,1.6014256e-7,0.000006877389,0.000030022004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986654,0.000086181,0.00034297246,0.00014545773,0.00044904658,0.00031097853],"domain_scores_gemma":[0.9981652,0.00031977458,0.00044814876,0.0002420183,0.0007126962,0.00011218024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009526213,0.00013400099,0.00023044841,0.00017316698,0.00017841315,0.00004441023,0.0007069318,0.00008856199,0.000008244163],"category_scores_gemma":[0.0008111977,0.00008978461,0.00007456584,0.0008172721,0.00011854712,0.0005221645,0.0001527829,0.00032047188,0.000007086707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029259827,0.00045071178,0.066620484,0.0000980298,0.0002001419,0.00000741959,0.008128968,0.013323696,0.000208333,0.8429775,0.047621634,0.020070434],"study_design_scores_gemma":[0.001117259,0.0016220546,0.3572424,0.0007681568,0.00008109405,0.0005087518,0.005110596,0.011365915,0.0004017714,0.6178765,0.0032995015,0.0006059747],"about_ca_topic_score_codex":0.000016726297,"about_ca_topic_score_gemma":0.0000053031295,"teacher_disagreement_score":0.87709993,"about_ca_system_score_codex":0.0003335592,"about_ca_system_score_gemma":0.00014321393,"threshold_uncertainty_score":0.366131},"labels":[],"label_agreement":null},{"id":"W1894778686","doi":"10.1002/cpe.1814","title":"Energy management control for supplying partner selection protocol in mobile peer‐to‐peer three‐dimensional streaming","year":2011,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Bottleneck; Computer network; Protocol (science); Peer-to-peer; Energy (signal processing); Efficient energy use; Distributed computing; Mobile device; Latency (audio); Energy management; Control (management); Selection (genetic algorithm); Telecommunications; Engineering; Operating system; Embedded system","score_opus":0.03509517992922094,"score_gpt":0.3335421077200209,"score_spread":0.29844692779079995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894778686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022740254,0.000055219585,0.96599805,0.0010299617,0.00017277135,0.009548196,0.0000022821835,0.00014902586,0.0003042463],"genre_scores_gemma":[0.8609613,0.0000029818311,0.08847645,0.0006616197,0.000024153787,0.049790323,0.0000029920866,0.0000071854406,0.000072951276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984872,0.000055640397,0.00029172454,0.00054967287,0.0003144747,0.00030131373],"domain_scores_gemma":[0.9990416,0.0002550021,0.00012544221,0.0001551268,0.0003241142,0.00009868738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043060665,0.00016587671,0.00016287567,0.00018657377,0.00021289935,0.00015498196,0.00025601676,0.000061611994,0.000004484678],"category_scores_gemma":[0.00014867367,0.0001616261,0.000019765857,0.00044625968,0.00005078852,0.001074083,0.00020365197,0.0001022589,0.0000031447858],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020844261,0.00020435292,0.002063497,0.000042589392,0.0000264683,0.000018958723,0.011363194,0.0026797198,0.00018031451,0.042612124,0.0011614821,0.9394389],"study_design_scores_gemma":[0.003943169,0.0020036234,0.0085587455,0.00021082288,0.000038385588,0.00011803785,0.003768146,0.76312816,0.002133368,0.015565084,0.19947408,0.0010583891],"about_ca_topic_score_codex":0.00006817078,"about_ca_topic_score_gemma":0.00003194633,"teacher_disagreement_score":0.9383805,"about_ca_system_score_codex":0.00003122957,"about_ca_system_score_gemma":0.00003258386,"threshold_uncertainty_score":0.65909207},"labels":[],"label_agreement":null},{"id":"W1918035973","doi":"10.1155/2015/187548","title":"AVL and Monitoring for Massive Traffic Control System over DDS","year":2015,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"King Fahd University of Petroleum and Minerals","keywords":"Middleware (distributed applications); Computer science; Real-time computing; Service (business); Protocol (science); Computer network; Embedded system; Operating system","score_opus":0.01620099132066756,"score_gpt":0.24226670845747517,"score_spread":0.22606571713680762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918035973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1185585,0.00030261368,0.8738093,0.00014754036,0.0027712034,0.002303933,0.000028874902,0.001339425,0.00073860865],"genre_scores_gemma":[0.9953575,9.248358e-7,0.0030810775,0.00003678208,0.00015300325,0.0013008515,0.000003851962,0.000006924378,0.000059063816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986633,0.00003341326,0.00048049827,0.00016794987,0.00036424788,0.00029058376],"domain_scores_gemma":[0.9987607,0.00010664876,0.00023084349,0.00043513867,0.00032138106,0.00014526315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065437297,0.00015327187,0.00025657413,0.00022776825,0.00010173376,0.000563784,0.0005243062,0.00012041203,1.1765051e-7],"category_scores_gemma":[0.00007337285,0.0001362444,0.000036844933,0.0002990023,0.000020804528,0.0017946362,0.00012613556,0.00007861506,0.000067224086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083668296,0.000033943154,0.001956577,0.001014735,0.00013932338,0.000008861671,0.011506227,0.71921,0.00009922677,0.06341462,0.031056363,0.17147641],"study_design_scores_gemma":[0.0016482989,0.00028996705,0.00024032322,0.00020455346,0.000009879546,0.000046479363,0.004907268,0.9020582,0.00031087518,0.000027930508,0.08994915,0.00030709695],"about_ca_topic_score_codex":0.000017812188,"about_ca_topic_score_gemma":5.606456e-7,"teacher_disagreement_score":0.87679905,"about_ca_system_score_codex":0.000241935,"about_ca_system_score_gemma":0.000055819793,"threshold_uncertainty_score":0.55558854},"labels":[],"label_agreement":null},{"id":"W1937292162","doi":"","title":"Dynamic Query Plan for Efficient Query Processing in Peer-to-Peer Environments","year":2008,"lang":"en","type":"article","venue":"Americanae (AECID Library)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Query optimization; Query language; Peer-to-peer; Query expansion; Sargable; Web query classification; Cornerstone; Query plan; Web search query; Transmission (telecommunications); Spatial query; RDF query language; Distributed computing; Plan (archaeology); Information retrieval; Search engine","score_opus":0.013154815725700991,"score_gpt":0.2281884220479433,"score_spread":0.2150336063222423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1937292162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6612215,0.00028974804,0.31335974,0.022210745,0.00035225906,0.0009210856,0.000029721037,0.0009689515,0.00064625137],"genre_scores_gemma":[0.78835654,0.000021428335,0.20468752,0.0030269742,0.00004779253,0.00028345702,0.000030570496,0.00006488871,0.0034808319],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9963744,0.000062712876,0.00052367325,0.0011093229,0.0008911928,0.0010386773],"domain_scores_gemma":[0.9982335,0.0001403162,0.00018844282,0.0010905068,0.000038387396,0.00030882444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023774784,0.00041433683,0.0005069796,0.00073876703,0.00022764217,0.00009647704,0.0023620657,0.00013580568,0.000015255819],"category_scores_gemma":[0.00018400705,0.00042053973,0.00011229883,0.0020266012,0.00023251332,0.00090858946,0.0010163707,0.00031129556,0.00013328367],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019643166,0.0010173093,0.17853083,0.00007722838,0.00008030367,0.0007710809,0.0050467853,0.05443515,0.0024400244,0.0028280844,0.1912911,0.56328565],"study_design_scores_gemma":[0.0014234912,0.0010655795,0.6555595,0.00021303713,0.000018831039,0.00009679033,0.00047219527,0.20754503,0.0043135923,0.0011938978,0.12589791,0.0022001858],"about_ca_topic_score_codex":0.0007256236,"about_ca_topic_score_gemma":0.00002756717,"teacher_disagreement_score":0.56108546,"about_ca_system_score_codex":0.00020420799,"about_ca_system_score_gemma":0.00022433791,"threshold_uncertainty_score":0.99982464},"labels":[],"label_agreement":null},{"id":"W1938937003","doi":"","title":"Preface for the Special Issue on Mobile and Networking Technologies for Modelling Social Applications and Services","year":2010,"lang":"en","type":"article","venue":"NPARC","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Data science","score_opus":0.01570499618372019,"score_gpt":0.2600002035527239,"score_spread":0.24429520736900373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938937003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017308138,0.00024621218,0.9639631,0.013891205,0.00041989848,0.0023173157,0.000015866446,0.0009484639,0.0008898379],"genre_scores_gemma":[0.63298047,0.000106473366,0.3604407,0.00025318225,0.0030656834,0.0030046632,0.0000024649628,0.0000195172,0.00012683176],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915713,0.0000046448536,0.0001134043,0.00035604398,0.00010062034,0.00026815772],"domain_scores_gemma":[0.9991728,0.00032647472,0.00005824891,0.0003677755,0.000054209642,0.00002048914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020955455,0.00011735534,0.00012059595,0.00005814736,0.0005534892,0.00019914974,0.00083411054,0.00013614741,0.0000012396798],"category_scores_gemma":[0.00000915098,0.0000902428,0.00002610641,0.00019873193,0.000114267554,0.00011259755,0.0003848486,0.0001795192,0.0000020022928],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009918372,0.000013027411,0.000026986676,0.00002247668,0.000011714268,9.123346e-8,0.00043871164,0.0009379332,0.0009277093,0.05850126,0.003153914,0.93595624],"study_design_scores_gemma":[0.00013172397,0.000070257556,0.000019419276,0.0000080850095,0.000009329802,0.0000015948311,0.00020776235,0.35909772,0.0012306611,0.116854124,0.52224785,0.000121470446],"about_ca_topic_score_codex":0.0000020350035,"about_ca_topic_score_gemma":0.00003591652,"teacher_disagreement_score":0.93583477,"about_ca_system_score_codex":0.000009668304,"about_ca_system_score_gemma":0.000010980516,"threshold_uncertainty_score":0.42570475},"labels":[],"label_agreement":null},{"id":"W1948983780","doi":"10.1007/978-3-540-89335-6_18","title":"Our Brothers’ Keepers: Secure Routing with High Performance","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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 Winnipeg","funders":"","keywords":"Computer science; Computer network; Chord (peer-to-peer); Overlay network; Network packet; Distributed hash table; Routing table; Spoofing attack; Distributed computing; Overlay; Peer-to-peer; Routing (electronic design automation); Identifier; Pastry; Static routing; Routing protocol; Computer security; The Internet; World Wide Web","score_opus":0.016173593452050033,"score_gpt":0.2219925259903154,"score_spread":0.2058189325382654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1948983780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029287979,0.00024609754,0.98857754,0.0037638796,0.0011447904,0.00058350374,0.000004015357,0.0009422218,0.0018091276],"genre_scores_gemma":[0.5373463,0.000067171226,0.45981523,0.0017496906,0.00039819427,0.000017744065,0.000002229787,0.000057256697,0.00054617546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944025,0.000025984107,0.0005169703,0.0022225739,0.0015642601,0.0012676899],"domain_scores_gemma":[0.996577,0.00017019831,0.00033229665,0.002375475,0.00031858092,0.00022644197],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005894111,0.00084796915,0.00073342124,0.001101101,0.0004864979,0.0005602973,0.006775195,0.0005030209,0.000004777887],"category_scores_gemma":[0.00006936483,0.00070753804,0.00009774571,0.0015407718,0.0005701788,0.0008783813,0.0023631686,0.0014666067,0.00010009733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019494626,0.000034528814,0.0004852013,0.000045130677,0.000034598295,0.00040447697,0.002686879,0.17486681,0.00008455143,0.005564488,0.0005348821,0.81523895],"study_design_scores_gemma":[0.0016795791,0.0029334773,0.0025555287,0.0043825624,0.000038097933,0.002114561,0.000005840878,0.92505527,0.009851143,0.029442435,0.015898142,0.0060433773],"about_ca_topic_score_codex":0.00004081215,"about_ca_topic_score_gemma":0.00008819924,"teacher_disagreement_score":0.8091956,"about_ca_system_score_codex":0.0005058921,"about_ca_system_score_gemma":0.00061771617,"threshold_uncertainty_score":0.9995376},"labels":[],"label_agreement":null},{"id":"W1952462664","doi":"10.1007/s12083-015-0380-9","title":"Taking a free ride for routing topology inference in peer-to-peer networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Network topology; Network tomography; Routing (electronic design automation); Routing table; Distributed computing; Topology (electrical circuits); Computer network; Host (biology); Internet topology; Logical topology; The Internet; Peer-to-peer; Synchronization (alternating current); Routing protocol; Static routing; Engineering","score_opus":0.0513139108326722,"score_gpt":0.32470868129179836,"score_spread":0.2733947704591262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1952462664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009195506,0.00024496796,0.8828282,0.100203246,0.0010886525,0.002769317,0.00004601537,0.0012142673,0.002409873],"genre_scores_gemma":[0.77628404,0.000009702933,0.21095149,0.0044411696,0.0016799662,0.003481149,0.00006210513,0.00009295451,0.0029974012],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928567,0.0001400121,0.0011432042,0.0021262341,0.0015560068,0.0021778704],"domain_scores_gemma":[0.9923802,0.0013403454,0.00037600423,0.0026265734,0.0021048982,0.0011719969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041061584,0.00076299644,0.0009192349,0.0009327678,0.0006900935,0.00087306934,0.004208638,0.000489178,0.000005639602],"category_scores_gemma":[0.004050732,0.0008306547,0.00015078949,0.004389441,0.00014909497,0.00037900024,0.0033150907,0.0009038694,0.000121840916],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095414245,0.00022762442,0.015255025,0.000031541964,0.0000879202,0.000022790928,0.004865668,0.3204254,0.00015900464,0.091951855,0.16765802,0.39921975],"study_design_scores_gemma":[0.0011672314,0.00040462226,0.005671462,0.00024703244,0.000048936152,0.000040085233,0.0005281413,0.1895832,0.00013845386,0.025528856,0.77511597,0.0015259964],"about_ca_topic_score_codex":0.0005373615,"about_ca_topic_score_gemma":0.0014202094,"teacher_disagreement_score":0.76708853,"about_ca_system_score_codex":0.00034629175,"about_ca_system_score_gemma":0.00023205305,"threshold_uncertainty_score":0.99941444},"labels":[],"label_agreement":null},{"id":"W195598145","doi":"10.1007/978-3-540-88875-8_120","title":"Towards Semantically Enhanced Peer-to-Peer File-Sharing","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; File sharing; Peer-to-peer; Information retrieval; World Wide Web; Data sharing; Simple (philosophy); Database; The Internet","score_opus":0.021109929986230683,"score_gpt":0.25696606882393197,"score_spread":0.2358561388377013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195598145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001969008,0.00013553802,0.96939373,0.0135135865,0.0025572141,0.00084549893,0.0000418408,0.001335442,0.011980259],"genre_scores_gemma":[0.055606093,0.00003376142,0.9310307,0.006127527,0.0007681756,0.00007061175,0.000022441009,0.000100968355,0.006239741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9894634,0.000029681501,0.0009672896,0.0037612189,0.0038788025,0.0018996343],"domain_scores_gemma":[0.99314946,0.00055806036,0.00030172948,0.0039666677,0.0014149,0.00060918386],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013691217,0.0011406353,0.0011377938,0.0021287657,0.00048447563,0.0011073896,0.013336426,0.0007768264,0.00012446844],"category_scores_gemma":[0.0014775897,0.0010975656,0.00026341158,0.0024287498,0.0008311726,0.00074952136,0.009543957,0.0017970758,0.0006979061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012559756,0.000046514877,0.000016401862,0.000035082565,0.00002828699,0.00044206285,0.0018412205,0.043450635,0.00047758024,0.008406131,0.010539259,0.93470424],"study_design_scores_gemma":[0.0010218068,0.0016855443,0.0013141995,0.0030722348,0.000038980226,0.00079397927,0.0000014828316,0.52545327,0.030822441,0.23300825,0.19568218,0.007105643],"about_ca_topic_score_codex":0.000043035496,"about_ca_topic_score_gemma":0.00011957486,"teacher_disagreement_score":0.9275986,"about_ca_system_score_codex":0.0007107769,"about_ca_system_score_gemma":0.0008390393,"threshold_uncertainty_score":0.99992955},"labels":[],"label_agreement":null},{"id":"W1963596282","doi":"10.1109/wi.2004.144","title":"Trust-Based Community Formation in Peer-to-Peer File Sharing Networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Reputation; Computer science; Peer-to-peer; Mechanism (biology); File sharing; Quality (philosophy); Information sharing; Internet privacy; Distributed computing; World Wide Web; Computer network; The Internet","score_opus":0.027833792255399704,"score_gpt":0.2606607346456559,"score_spread":0.23282694239025623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963596282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07968931,0.000010650892,0.8960436,0.016244203,0.00020765251,0.0004010299,0.000009920146,0.0013589993,0.0060346527],"genre_scores_gemma":[0.8176547,6.313151e-7,0.17884773,0.002605372,0.000031560015,0.00010341501,0.000047101625,0.000013797208,0.000695663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979352,0.000065696346,0.0003928099,0.00035772854,0.0005908323,0.00065774267],"domain_scores_gemma":[0.9978638,0.0001689847,0.000073395415,0.001496663,0.00024176703,0.0001553743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011138965,0.00022859842,0.00024033377,0.0004565875,0.0002493913,0.00031654534,0.0028876201,0.00017590665,0.000086023305],"category_scores_gemma":[0.0004823314,0.00022487305,0.00006091226,0.00186369,0.000036422287,0.00079500343,0.001306831,0.0006990799,0.00021313845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001618166,0.00019115719,0.0010494373,0.000015476257,0.0000075041107,0.00002653105,0.0014940687,0.87236154,0.00010422899,0.018930579,0.0676121,0.03819123],"study_design_scores_gemma":[0.0012637947,0.0003312661,0.017168578,0.00020069719,0.000003851967,0.000019967287,0.00038218652,0.940829,0.005144781,0.014663407,0.019221194,0.0007712827],"about_ca_topic_score_codex":0.0007537024,"about_ca_topic_score_gemma":0.0016804823,"teacher_disagreement_score":0.7379654,"about_ca_system_score_codex":0.00038515526,"about_ca_system_score_gemma":0.00004824692,"threshold_uncertainty_score":0.91700566},"labels":[],"label_agreement":null},{"id":"W1964957542","doi":"10.1016/j.jnca.2010.10.013","title":"An overlay network for autonomous information discovery in the post-composition registries of ambient networks","year":2010,"lang":"en","type":"article","venue":"Journal of Network and Computer 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":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Overlay network; Computer network; Composition (language); Context (archaeology); Core network; Database; Key (lock); Scalability; World Wide Web; Computer security; The Internet","score_opus":0.0055909860975048385,"score_gpt":0.2320570477649222,"score_spread":0.22646606166741737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964957542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042190272,0.00014387014,0.9537844,0.00266231,0.0004207505,0.00071719673,0.000005397464,0.00004431833,0.000031482792],"genre_scores_gemma":[0.79052824,0.0000475183,0.20733605,0.00096030714,0.00097620673,0.00012503227,0.000018217368,0.0000061416304,0.0000023047858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854696,0.000058838385,0.00069053844,0.00017353121,0.00022785817,0.0003022498],"domain_scores_gemma":[0.9981249,0.00031573372,0.0005877301,0.00060053886,0.0002957458,0.00007536587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009522585,0.00015193851,0.00026783082,0.00013864509,0.00020622672,0.0003730424,0.0012901098,0.00011496306,3.1860716e-7],"category_scores_gemma":[0.00000824231,0.0001159519,0.000091296,0.000717236,0.00008767722,0.0012546338,0.00016328522,0.0003822084,5.456571e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081714,0.00019038562,0.0024494643,0.000020698924,0.000042557138,0.0000022503093,0.0008331393,0.49339718,0.0001396924,0.25132918,0.018989285,0.23252447],"study_design_scores_gemma":[0.0009353132,0.0013550903,0.10320516,0.00012357843,0.00005205121,0.00030441355,0.000099145545,0.7604265,0.00006856243,0.033106364,0.099897295,0.00042652644],"about_ca_topic_score_codex":0.000009010818,"about_ca_topic_score_gemma":0.000034250646,"teacher_disagreement_score":0.7483379,"about_ca_system_score_codex":0.000025978492,"about_ca_system_score_gemma":0.00007108416,"threshold_uncertainty_score":0.4728381},"labels":[],"label_agreement":null},{"id":"W1966003099","doi":"10.1109/tst.2012.6151904","title":"Uncover the peer distribution in BitTorrent","year":2012,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Download; Computer science; BitTorrent tracker; The Internet; Peer-to-peer; Computer network; File Transfer Protocol; Bandwidth (computing); World Wide Web","score_opus":0.015019453267607938,"score_gpt":0.27498640626174203,"score_spread":0.2599669529941341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966003099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6563529,0.0004591946,0.26815695,0.06905585,0.0020356418,0.00045901205,0.000004258752,0.0019474644,0.0015287219],"genre_scores_gemma":[0.99006754,0.000006707717,0.009270306,0.00037479776,0.000051676216,0.000055058266,0.0000012622337,0.0000069087205,0.00016571877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99693274,0.00003203703,0.0002852725,0.0005933724,0.0008409896,0.0013155696],"domain_scores_gemma":[0.99798155,0.00007119902,0.00010127785,0.0015412564,0.00019326914,0.0001114338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022595362,0.00019818633,0.00019195983,0.0009951377,0.0003935729,0.0001859041,0.004815984,0.00018988643,0.0000060168773],"category_scores_gemma":[0.0011023253,0.00014291698,0.000037154547,0.011195688,0.0015470242,0.0010642369,0.0022551839,0.0004952187,0.0002508036],"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.000004850047,0.00019517276,0.058471713,0.0000036667245,0.000004794577,0.000011728266,0.0011286892,0.00043662149,0.01027877,0.7367284,0.007904961,0.1848306],"study_design_scores_gemma":[0.0007198408,0.00042476508,0.116753206,0.00011809208,0.000015392301,0.00035457418,0.0012640004,0.018727684,0.13488324,0.092429176,0.63285816,0.001451865],"about_ca_topic_score_codex":0.00004214976,"about_ca_topic_score_gemma":0.0000320664,"teacher_disagreement_score":0.64429927,"about_ca_system_score_codex":0.0005929201,"about_ca_system_score_gemma":0.00019129296,"threshold_uncertainty_score":0.8949377},"labels":[],"label_agreement":null},{"id":"W1966532861","doi":"10.1145/544862.544893","title":"Just-in-time information sharing architectures in multiagent systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Testbed; Multi-agent system; Distributed computing; Agent architecture; Service (business); Architecture; Intelligent agent; Cluster analysis; Computer network; Artificial intelligence","score_opus":0.022403056590439473,"score_gpt":0.22607743617806977,"score_spread":0.2036743795876303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966532861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7491708,0.000243501,0.22137497,0.0034505972,0.00048810098,0.0009382338,0.0000016040203,0.0018924752,0.02243972],"genre_scores_gemma":[0.98061574,0.0000042083675,0.01848527,0.00029456362,0.000015084257,0.0000424224,7.1518906e-7,0.0000035604164,0.0005384662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988861,0.00001748497,0.00030090645,0.00021105804,0.00026098225,0.00032343646],"domain_scores_gemma":[0.99934506,0.00004434652,0.00004423172,0.0005024656,0.000019984886,0.000043919325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025541848,0.000110264744,0.00013678458,0.00053916394,0.000027013139,0.0002303299,0.0013062792,0.00006999913,0.000015958234],"category_scores_gemma":[0.000072328425,0.000097273514,0.000020312484,0.00073594565,0.0000127939775,0.00040560486,0.0006161103,0.00015957381,0.0005427853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007815769,0.00015567565,0.026222264,0.00009255917,0.000015947515,0.00007837713,0.010673433,0.610985,0.0003971016,0.02338885,0.013756024,0.31422696],"study_design_scores_gemma":[0.00021370123,0.00002486996,0.010080854,0.000051541112,4.8956935e-7,0.000010356817,0.000051354935,0.985947,0.00029311338,0.00025696665,0.0029135435,0.00015618479],"about_ca_topic_score_codex":0.00021307597,"about_ca_topic_score_gemma":0.00008254864,"teacher_disagreement_score":0.374962,"about_ca_system_score_codex":0.00010083682,"about_ca_system_score_gemma":0.0000046120836,"threshold_uncertainty_score":0.6976588},"labels":[],"label_agreement":null},{"id":"W1966651940","doi":"10.1109/noms.2006.1687551","title":"Distributed Pattern Matching for P2P Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed hash table; Distributed computing; Search engine indexing; Matching (statistics); Service discovery; Overhead (engineering); Theoretical computer science; Replication (statistics); Peer-to-peer; Information retrieval; Web service","score_opus":0.011759803842582829,"score_gpt":0.22849003718231634,"score_spread":0.2167302333397335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966651940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0142802205,0.00005624988,0.97920096,0.0032338034,0.00044101366,0.00031856133,0.000023137436,0.0015769518,0.0008690931],"genre_scores_gemma":[0.944596,4.8558474e-7,0.05416068,0.00018256548,0.00010492996,0.00009299029,0.000018180348,0.000008727936,0.00083545846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892837,0.000012566696,0.00020125882,0.0003216736,0.00017415949,0.0003619448],"domain_scores_gemma":[0.9991933,0.000094299336,0.000048859645,0.000562194,0.00006238126,0.000038930753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017729032,0.00011807149,0.00014481675,0.000075212694,0.00009087398,0.00027852558,0.0010871382,0.000066250446,0.0000016320708],"category_scores_gemma":[0.000017427688,0.00010030522,0.00004397406,0.0003088403,0.000013543782,0.00019015906,0.00034303198,0.000063469975,0.000055171735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046917785,0.000106203595,0.0040963464,0.00007950335,0.00003272489,0.000033094806,0.000104711915,0.024197713,0.0016073547,0.44762933,0.42898086,0.09312746],"study_design_scores_gemma":[0.001070073,0.00027296788,0.01345894,0.00015061727,0.000016239286,0.0000742927,0.00018529924,0.67850244,0.00708015,0.08559623,0.21225718,0.0013355673],"about_ca_topic_score_codex":0.000496111,"about_ca_topic_score_gemma":0.00008349055,"teacher_disagreement_score":0.93031573,"about_ca_system_score_codex":0.00005517165,"about_ca_system_score_gemma":0.000013291871,"threshold_uncertainty_score":0.4090328},"labels":[],"label_agreement":null},{"id":"W1967144336","doi":"10.1109/aina.2014.100","title":"Statistical Assessment of Sybil-Placement Strategies within DHT-Structured Peer-to-Peer Botnets","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Botnet; Computer science; Sybil attack; Peer-to-peer; Computer security; Computer network; Network packet; Proof-of-work system; Distributed computing; The Internet; World Wide Web; Cryptocurrency; Wireless sensor network","score_opus":0.014673828625095905,"score_gpt":0.30563808646062446,"score_spread":0.29096425783552854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967144336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03286935,0.00000732967,0.9449899,0.008128045,0.000680462,0.0004928749,0.000023055267,0.0007370763,0.012071861],"genre_scores_gemma":[0.542247,4.938569e-7,0.45620522,0.00043044976,0.00003503669,0.000035368685,0.000008168868,0.0000126160685,0.0010256633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581856,0.00013464008,0.0006809021,0.0008527262,0.0018238147,0.0006893649],"domain_scores_gemma":[0.9971762,0.00028672995,0.00017734853,0.0014927526,0.0005762476,0.00029073618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013627196,0.0003720123,0.00051271735,0.00030851513,0.000111579895,0.00040009661,0.002161315,0.00016566513,0.000111307505],"category_scores_gemma":[0.00043319995,0.00030693464,0.00006320999,0.0007208718,0.00013665512,0.00036619115,0.0011260181,0.00032726716,0.000073065064],"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.00001352807,0.00008216871,0.0010030904,0.000029424598,0.00005180289,0.000011238961,0.0004368743,0.02511556,0.0031926248,0.9118334,0.044874355,0.013355925],"study_design_scores_gemma":[0.0024583777,0.004527621,0.12725802,0.00018665458,0.00008957031,0.000072211864,0.001998505,0.5859251,0.03947241,0.16388172,0.07140388,0.0027258955],"about_ca_topic_score_codex":0.000116665986,"about_ca_topic_score_gemma":0.00017902754,"teacher_disagreement_score":0.7479517,"about_ca_system_score_codex":0.00014642882,"about_ca_system_score_gemma":0.0002502926,"threshold_uncertainty_score":0.99993825},"labels":[],"label_agreement":null},{"id":"W1967216298","doi":"10.1007/s00530-006-0015-3","title":"Analysis of a CDN–P2P hybrid architecture for cost-effective streaming media distribution","year":2006,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":210,"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; Reservation; Architecture; Computer network; Server; Failover; Peer-to-peer; Dimensioning; Distributed computing","score_opus":0.010766594889061705,"score_gpt":0.24383605010794487,"score_spread":0.23306945521888317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967216298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062237542,0.0003010782,0.93286836,0.00023411594,0.0007145817,0.0024011163,0.0007269009,0.00046732783,0.000048947983],"genre_scores_gemma":[0.96454346,0.0000017000768,0.03347064,0.000010940782,0.00019044372,0.0012500802,0.00048157392,0.000014287128,0.0000368512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978727,0.00010675362,0.00049432396,0.0005898853,0.00044600852,0.0004902959],"domain_scores_gemma":[0.9973092,0.0012320222,0.0002909583,0.0008075076,0.00026479983,0.0000954848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194869,0.0002509056,0.0006398197,0.0005347626,0.00009107855,0.000096437485,0.00096651685,0.0001258154,9.489766e-7],"category_scores_gemma":[0.00048568472,0.00022294145,0.00023202397,0.0018265054,0.000084199484,0.00013649718,0.00022603774,0.00014875947,0.000007953195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062717074,0.00026947854,0.016767407,0.00018121193,0.0011595645,0.00003740999,0.0013370952,0.11524143,0.0053597856,0.0022620715,0.009570915,0.8477509],"study_design_scores_gemma":[0.00051625073,0.0000952477,0.023499757,0.00007537546,0.0002294139,0.0000073171773,0.00007082465,0.9620939,0.0065828636,0.0002494923,0.006284328,0.00029525312],"about_ca_topic_score_codex":0.0007479842,"about_ca_topic_score_gemma":0.00040360817,"teacher_disagreement_score":0.90230596,"about_ca_system_score_codex":0.00020498065,"about_ca_system_score_gemma":0.000036656686,"threshold_uncertainty_score":0.9091289},"labels":[],"label_agreement":null},{"id":"W1967276580","doi":"10.1016/j.future.2006.03.022","title":"Using RDF to describe networks","year":2006,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Semantic Web; Compiler; RDF; Ontology; World Wide Web; Reachability; Network topology; Distributed computing; Data science; Software engineering; Computer network; Theoretical computer science; Operating system","score_opus":0.03336355179950061,"score_gpt":0.2422680004179141,"score_spread":0.2089044486184135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967276580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068712127,0.0007207254,0.92879504,0.001982424,0.059934206,0.000547319,0.0000027645037,0.0010089019,0.00013738612],"genre_scores_gemma":[0.13897121,0.0000030351925,0.7159693,0.001608359,0.14293121,0.00008317913,0.000029196484,0.00003772009,0.0003667752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976242,0.00013490643,0.0004990831,0.0007572168,0.0004371894,0.0005473563],"domain_scores_gemma":[0.99838287,0.000026831103,0.000129117,0.0010607764,0.00025101125,0.0001493883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003591937,0.0003016947,0.00031745163,0.00030870485,0.0002905603,0.0010349301,0.0012798503,0.00021386005,0.0000015544025],"category_scores_gemma":[0.000005013631,0.0002890561,0.00007427972,0.0012057236,0.000014294655,0.00039491247,0.00056405464,0.0001765385,0.000076165714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.726277e-7,0.000013269864,0.00009519221,0.0000041910434,0.000008222046,0.000011560931,0.00007315054,0.5545475,0.000533038,0.016264737,0.41992888,0.008519262],"study_design_scores_gemma":[0.00010898193,0.00006147228,0.00026431656,0.000028331486,0.00000384012,0.0000601022,0.000008007212,0.7910926,0.00026334118,0.000013935496,0.20779328,0.00030183964],"about_ca_topic_score_codex":0.00015188707,"about_ca_topic_score_gemma":0.00010814465,"teacher_disagreement_score":0.23654504,"about_ca_system_score_codex":0.0001866382,"about_ca_system_score_gemma":0.000050811854,"threshold_uncertainty_score":0.99995613},"labels":[],"label_agreement":null},{"id":"W1967543224","doi":"10.1007/s00530-008-0124-2","title":"A biologically inspired multimedia content repurposing system in heterogeneous environments","year":2008,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"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; Repurposing; Multimedia; Quality of experience; Heterogeneous network; Computer network; Distributed computing; Session (web analytics); Communication source; Service (business); Quality of service; Wireless; Wireless network; World Wide Web","score_opus":0.05404944982392756,"score_gpt":0.2276896296741912,"score_spread":0.17364017985026364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967543224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85373855,0.002689254,0.13287771,0.00037307528,0.003950276,0.0033093456,0.000027655044,0.0026324978,0.00040165574],"genre_scores_gemma":[0.9201061,0.00005075103,0.078868076,0.00011695278,0.00013640535,0.00049198064,0.0000103711245,0.00003109924,0.00018826613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959411,0.0002835171,0.0010148379,0.0011270371,0.0006822393,0.0009512895],"domain_scores_gemma":[0.9976445,0.00027443044,0.00030256546,0.0014163256,0.000056863715,0.0003053132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059911166,0.0004517324,0.0007533263,0.0004467924,0.00018330694,0.00011125899,0.0019601502,0.00037183816,0.0000018564614],"category_scores_gemma":[0.00028550831,0.00039035032,0.00012654964,0.00068962574,0.0001857139,0.00027099895,0.0007969111,0.00032478684,0.00044946192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033302023,0.0021209184,0.31446305,0.00054375926,0.00058889855,0.019361515,0.018263645,0.0414159,0.18788877,0.0008083293,0.004462156,0.40975004],"study_design_scores_gemma":[0.0017473593,0.000303917,0.025261607,0.00042966945,0.000008454949,0.00090294593,0.0002855612,0.956984,0.0050946185,0.0000062114136,0.008143346,0.0008323357],"about_ca_topic_score_codex":0.0006027892,"about_ca_topic_score_gemma":0.000034154236,"teacher_disagreement_score":0.91556805,"about_ca_system_score_codex":0.00064755016,"about_ca_system_score_gemma":0.000053481297,"threshold_uncertainty_score":0.99985486},"labels":[],"label_agreement":null},{"id":"W1967754466","doi":"10.1109/srdsw.2011.19","title":"Attack Resistant Network Embeddings for Darknets","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Embedding; Overhead (engineering); Simple (philosophy); Routing (electronic design automation); Computer network; Computer security; Distributed computing; Theoretical computer science; Artificial intelligence","score_opus":0.07040311147432149,"score_gpt":0.27714131852463236,"score_spread":0.20673820705031087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967754466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006754336,0.00010478507,0.9484617,0.0020977403,0.00061870867,0.00046098753,0.0000022805534,0.0018804859,0.039618958],"genre_scores_gemma":[0.20726864,0.00000435602,0.7883826,0.0011538458,0.00010442033,0.00008171366,0.0000011445749,0.000015125672,0.002988192],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983732,0.000016298038,0.00024179526,0.0005203455,0.00019942151,0.000648951],"domain_scores_gemma":[0.99861634,0.000102407226,0.00006762108,0.0009948697,0.0001044714,0.00011429638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040366306,0.00017061002,0.00019436171,0.000088803805,0.00014344252,0.00010192452,0.0019649945,0.000103454826,0.000029493884],"category_scores_gemma":[0.00008809613,0.0001471467,0.000074523145,0.00060366484,0.000047160614,0.00027562687,0.0007460707,0.000099459416,0.00013352168],"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.000035682035,0.000032657714,0.00034833295,0.000008398217,0.000023383158,0.0000130408735,0.00037172923,0.00022929526,0.0001534003,0.2784937,0.69344723,0.026843134],"study_design_scores_gemma":[0.0008765556,0.0012726686,0.012646684,0.00010891868,0.00002454184,0.000027219226,0.00011235336,0.052061155,0.008778749,0.1672754,0.75542027,0.0013955071],"about_ca_topic_score_codex":0.000020760133,"about_ca_topic_score_gemma":0.00006738902,"teacher_disagreement_score":0.2005143,"about_ca_system_score_codex":0.000041153464,"about_ca_system_score_gemma":0.000033317036,"threshold_uncertainty_score":0.6000468},"labels":[],"label_agreement":null},{"id":"W1969786316","doi":"10.1109/iscc.2014.6912469","title":"Delay tolerant EPC-BGP for discovery services in EPCGlobal networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Border Gateway Protocol; Computer science; Routing (electronic design automation); Routing protocol; Blocking (statistics); Node (physics); Overhead (engineering); Network mapping; Distributed computing; The Internet; Dynamic Source Routing; World Wide Web; Operating system; Engineering","score_opus":0.006807394743919256,"score_gpt":0.22664982887109986,"score_spread":0.2198424341271806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969786316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06474736,0.000103962935,0.92772657,0.0036562148,0.00054189924,0.00033390374,0.0000022540246,0.0005978802,0.0022899616],"genre_scores_gemma":[0.8777862,0.0000070071496,0.11922416,0.0023556736,0.00012637515,0.00008025239,0.000003923524,0.000011002326,0.00040537465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982569,0.000036167312,0.00029646466,0.00056619773,0.00021313236,0.00063108734],"domain_scores_gemma":[0.99876016,0.00019816094,0.00006260729,0.0008416515,0.00005584284,0.000081576676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046177773,0.00020257696,0.0002644525,0.00013207657,0.000076401695,0.0003377237,0.0020023605,0.00014388522,0.0000027237627],"category_scores_gemma":[0.000033099015,0.00016826035,0.000071774724,0.00066447386,0.00003209769,0.00074499974,0.0007904624,0.00013732578,0.000029295186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051357667,0.0001492438,0.012161434,0.000050816663,0.00003385034,0.0000207347,0.00030974348,0.17192383,0.000098078,0.48178086,0.018071808,0.31534824],"study_design_scores_gemma":[0.00040477738,0.0001476052,0.0067038983,0.000050895767,0.00000338094,0.000009177554,0.00002935379,0.9549297,0.0002103971,0.015333654,0.021867992,0.00030917278],"about_ca_topic_score_codex":0.00014650545,"about_ca_topic_score_gemma":0.0012912387,"teacher_disagreement_score":0.8130389,"about_ca_system_score_codex":0.000062732805,"about_ca_system_score_gemma":0.000022491797,"threshold_uncertainty_score":0.6861458},"labels":[],"label_agreement":null},{"id":"W1970542866","doi":"10.1145/1230040.1230044","title":"Plug-replaceable consistency maintenance for multiplayer games","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Consistency (knowledge bases); Computer science; Concurrency control; Concurrency; Code (set theory); Consistency model; Data consistency; Programming language; Sequential consistency; Distributed computing; Set (abstract data type); Database transaction; Artificial intelligence","score_opus":0.011925260464329996,"score_gpt":0.23069104082671527,"score_spread":0.21876578036238528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970542866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075500715,0.00015217686,0.9580213,0.008209734,0.00038994703,0.0005045097,0.0000062835734,0.0016917232,0.023474284],"genre_scores_gemma":[0.40677902,0.0000029795472,0.5671565,0.00091275835,0.000055869426,0.00012922584,0.0000020385082,0.000011707379,0.024949891],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838084,0.000012802079,0.00026409692,0.00055497343,0.00019792347,0.00058933644],"domain_scores_gemma":[0.9986044,0.00021557546,0.000066308334,0.00089317904,0.00016042711,0.0000600656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024687508,0.00017799383,0.00021072611,0.0001258994,0.00012859161,0.00015148235,0.001206009,0.00009568541,0.000013154728],"category_scores_gemma":[0.00016230594,0.00014838709,0.000084154104,0.00042646762,0.000068847345,0.00029065693,0.00038029734,0.000087913046,0.00013037583],"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.0000127453795,0.00006450307,0.0015255222,0.000012229092,0.000013102886,0.000012139452,0.000040215953,0.0013481327,0.0012145604,0.3890104,0.58469135,0.022055095],"study_design_scores_gemma":[0.0014080188,0.00024927573,0.0041857907,0.000057165664,0.000010124142,0.000052934938,0.00007405739,0.19470432,0.030557975,0.085542135,0.6823233,0.0008349195],"about_ca_topic_score_codex":0.0001660678,"about_ca_topic_score_gemma":0.00023922199,"teacher_disagreement_score":0.39922896,"about_ca_system_score_codex":0.000075698365,"about_ca_system_score_gemma":0.00005250669,"threshold_uncertainty_score":0.605105},"labels":[],"label_agreement":null},{"id":"W1970733476","doi":"10.1155/2014/138596","title":"Dead Reckoning Using Play Patterns in a Simple 2D Multiplayer Online Game","year":2014,"lang":"en","type":"article","venue":"International Journal of Computer Games Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dead reckoning; Computer science; Set (abstract data type); Position (finance); Scheme (mathematics); Action (physics); Simulation; Human–computer interaction; Artificial intelligence; Mathematics; Telecommunications; Global Positioning System","score_opus":0.01867434867022315,"score_gpt":0.29750268919221085,"score_spread":0.2788283405219877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970733476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47615868,0.000048838963,0.5187163,0.003993746,0.0008508442,0.00005813332,0.0000034181244,0.00015983544,0.000010249696],"genre_scores_gemma":[0.69743073,0.000015970196,0.3015612,0.00065700064,0.0003096601,0.0000027091949,0.00000199276,0.000014914143,0.0000058021656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753785,0.00008053494,0.0009028568,0.00041458,0.0005990292,0.0004651225],"domain_scores_gemma":[0.9980092,0.00024190832,0.0005661804,0.00053812587,0.0005554086,0.000089149384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051274284,0.0002588414,0.00047451275,0.0024306814,0.000032416956,0.00016227538,0.0042620176,0.00026332386,0.0000061538876],"category_scores_gemma":[0.00027872474,0.0002459602,0.0001267021,0.0007608045,0.00008653698,0.0004944897,0.0015442213,0.0007570338,0.000011589397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057172252,0.00031047795,0.06435554,0.000007771725,0.0001842691,0.0006297006,0.0005117991,0.044640385,0.0028346283,0.0108322045,0.00073992746,0.8748961],"study_design_scores_gemma":[0.0024261312,0.0009856231,0.031494487,0.0006839314,0.000015355141,0.0030188847,0.00008643534,0.89267546,0.005769975,0.028538039,0.033643167,0.00066249777],"about_ca_topic_score_codex":0.000027703702,"about_ca_topic_score_gemma":0.00008282074,"teacher_disagreement_score":0.8742336,"about_ca_system_score_codex":0.00027497098,"about_ca_system_score_gemma":0.00008393328,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W1971179860","doi":"10.1524/itit.2009.0549","title":"The PADRES Event Processing Network: Uniform Querying of Past and Future EventsDas PADRES Ereignisverarbeitungsnetzwerk: Einheitliche Anfragen auf Ereignisse der Vergangenheit und Zukunft","year":2009,"lang":"en","type":"article","venue":"it - Information Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Redundancy (engineering); Provisioning; Locality; Overhead (engineering); Data redundancy; Distributed computing; Computer network; Database; Operating system","score_opus":0.007431233191752277,"score_gpt":0.2535812669373273,"score_spread":0.246150033745575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971179860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13389619,0.02572536,0.6910711,0.12588751,0.0015491738,0.0036547005,0.000034699082,0.006496108,0.011685184],"genre_scores_gemma":[0.9646392,0.00060067704,0.03296753,0.0014567223,0.0001736521,0.0000700175,0.0000149188245,0.000016800754,0.00006048285],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99732316,0.00004903967,0.0009125204,0.0003682408,0.0004976696,0.00084936246],"domain_scores_gemma":[0.9977875,0.00010588922,0.00060513616,0.0010567879,0.0003392797,0.00010545216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069863576,0.00038045002,0.0003875919,0.00054815,0.000702387,0.00035229232,0.0020183516,0.00052040187,0.000006483602],"category_scores_gemma":[0.00014397808,0.00029224053,0.00007719742,0.0019478915,0.0002551745,0.0017865603,0.0008249378,0.0005374024,0.000030385152],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024508614,0.000030097586,0.00042377276,0.000036535905,0.000083755695,0.0000060590837,0.0010712504,0.0010644603,0.00014765008,0.1127782,0.007177724,0.87715596],"study_design_scores_gemma":[0.0020628485,0.0015008382,0.018776769,0.00059138983,0.00019963866,0.00032996963,0.0055785635,0.04863624,0.02399713,0.24855632,0.64776194,0.0020083266],"about_ca_topic_score_codex":0.000014186293,"about_ca_topic_score_gemma":0.000038333106,"teacher_disagreement_score":0.87514764,"about_ca_system_score_codex":0.00011668544,"about_ca_system_score_gemma":0.00013860562,"threshold_uncertainty_score":0.999953},"labels":[],"label_agreement":null},{"id":"W1971759113","doi":"10.1109/glocomw.2011.6162560","title":"An architecture for autonomie management of overlay networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Overlay network; Quality of service; Overlay; Overhead (engineering); Exploit; Architecture; Service (business); Node (physics); Network management; Service provider; The Internet; Distributed computing; Computer security; World Wide Web; Operating system; Engineering","score_opus":0.024038344880428355,"score_gpt":0.24537431748977878,"score_spread":0.22133597260935042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971759113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033712348,0.000032835036,0.98263526,0.0005433491,0.00021280332,0.00036786427,0.000001272605,0.00063815113,0.012197249],"genre_scores_gemma":[0.39121267,0.0000033700162,0.60812825,0.00026261012,0.000018528755,0.000044394317,8.953122e-7,0.0000064718133,0.00032279687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904466,0.000011568652,0.00017843509,0.00034911826,0.00010689251,0.00030935713],"domain_scores_gemma":[0.9988376,0.00002801961,0.000057260822,0.000973546,0.00003674023,0.00006681386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001875693,0.000120046956,0.0001456775,0.000104251616,0.00003974161,0.00002996853,0.0016922142,0.00006978347,0.000013485582],"category_scores_gemma":[0.0000037555626,0.00010090746,0.00005509144,0.00028872877,0.00003559727,0.00014452767,0.00042741245,0.00007025889,0.0000063357525],"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.000016514425,0.00008052356,0.00017628136,0.00002002975,0.000047997586,0.000005700789,0.00025097193,0.009467751,0.00005029443,0.5489081,0.0072496855,0.43372613],"study_design_scores_gemma":[0.0012481306,0.001974323,0.03843722,0.000110504334,0.00006353474,0.000014830981,0.00020275879,0.68509847,0.014522849,0.19397485,0.06319392,0.0011585925],"about_ca_topic_score_codex":0.000017007329,"about_ca_topic_score_gemma":0.000021119698,"teacher_disagreement_score":0.67563075,"about_ca_system_score_codex":0.000022203749,"about_ca_system_score_gemma":0.000010336628,"threshold_uncertainty_score":0.41148868},"labels":[],"label_agreement":null},{"id":"W1971960138","doi":"10.1145/1185373.1185413","title":"Improving Gnutella network performance using synthetic coordinates","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Latency (audio); Network topology; Computer network; Protocol (science); Distributed computing; Overlay; Overlay network; World Wide Web; The Internet","score_opus":0.010335570291491673,"score_gpt":0.2053819299642574,"score_spread":0.1950463596727657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971960138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30372065,0.00023426753,0.6869559,0.00074133126,0.000442995,0.00017030386,3.4072332e-7,0.0014348979,0.006299285],"genre_scores_gemma":[0.7241788,0.000003224814,0.27474347,0.00015907866,0.00014108935,0.0000074622044,4.3302845e-7,0.0000118096,0.00075463066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982989,0.000022684479,0.0002560453,0.00048364914,0.0002434985,0.0006952635],"domain_scores_gemma":[0.9989107,0.00008594509,0.00007891209,0.000793616,0.000072333176,0.00005845229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031522173,0.00019896452,0.00019414599,0.00013060235,0.00024525877,0.00024354122,0.0013577346,0.00009526512,0.000009312303],"category_scores_gemma":[0.000028043218,0.00017867913,0.000048916256,0.0009773235,0.000062183724,0.00040602038,0.00085411547,0.0001545757,0.0000893096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009832757,0.00008858318,0.018452624,0.000054760163,0.000024272269,0.00005128012,0.00006294589,0.38664904,0.0084053045,0.08309363,0.025831984,0.47727573],"study_design_scores_gemma":[0.00010390776,0.00006532774,0.0017535272,0.00004780246,0.000006008045,0.00004739535,0.000007696243,0.9776936,0.01203349,0.0032086382,0.004669083,0.00036352116],"about_ca_topic_score_codex":0.00021802059,"about_ca_topic_score_gemma":0.000027754955,"teacher_disagreement_score":0.59104455,"about_ca_system_score_codex":0.000087061504,"about_ca_system_score_gemma":0.00003939065,"threshold_uncertainty_score":0.72863233},"labels":[],"label_agreement":null},{"id":"W1974138127","doi":"10.1109/tpds.2011.253","title":"Exploring Peer-to-Peer Locality in Multiple Torrent Environment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PlanetLab; Computer science; BitTorrent; Locality; BitTorrent tracker; Distributed computing; Upload; Peer-to-peer; Computer network; The Internet; File sharing; Overhead (engineering); World Wide Web; Artificial intelligence","score_opus":0.13945848239800604,"score_gpt":0.24331995977250498,"score_spread":0.10386147737449894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974138127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07258897,0.000059599544,0.92431,0.00094733847,0.0009186505,0.00057513354,0.00013473643,0.00037627603,0.000089250636],"genre_scores_gemma":[0.9924809,0.000033063185,0.0064664013,0.00005521396,0.000023549594,0.000684625,0.000009259599,0.000013674322,0.00023334625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976079,0.00009458577,0.00047152478,0.0006961117,0.00059194566,0.00053793314],"domain_scores_gemma":[0.99868006,0.00008545302,0.00006472904,0.0008016813,0.00007494788,0.00029314338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047363827,0.00028875028,0.00034396583,0.00024780867,0.00017817752,0.0001131214,0.0006729151,0.00012140516,0.000007565874],"category_scores_gemma":[0.000021249509,0.00027400427,0.00007287202,0.00053005037,0.000055754845,0.00038458937,0.000024410509,0.00029003507,0.00015821653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015609412,0.0008467995,0.0020567612,0.00005764404,0.00007594897,0.00008254097,0.0031012422,0.9591328,0.00035050086,0.001183276,0.0021743588,0.030782064],"study_design_scores_gemma":[0.0073942607,0.0026955912,0.09292893,0.0008979624,0.000116028066,0.00020352265,0.006994137,0.7527776,0.011060965,0.0011709938,0.118883125,0.00487693],"about_ca_topic_score_codex":0.0008512177,"about_ca_topic_score_gemma":0.00014895474,"teacher_disagreement_score":0.9198919,"about_ca_system_score_codex":0.00023376798,"about_ca_system_score_gemma":0.000022778033,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W1974343637","doi":"10.1145/1730836.1730852","title":"Live peer-to-peer streaming with scalable video coding and networking coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Upload; Linear network coding; Coding (social sciences); Scalable Video Coding; Computer network; Multiple description coding; Live streaming; Peer-to-peer; Personalization; Multimedia; Network packet; Operating system","score_opus":0.013549684271467865,"score_gpt":0.2376650649136373,"score_spread":0.22411538064216943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974343637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29345942,0.00006564404,0.6678229,0.018124854,0.0011877199,0.0006054333,0.000002880104,0.0023192987,0.016411852],"genre_scores_gemma":[0.7210036,0.0000068890054,0.27568865,0.00072898157,0.00020842256,0.000030140855,0.0000014447063,0.000025493779,0.0023063945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969594,0.00002926667,0.0003023698,0.00094751135,0.0008180754,0.000943398],"domain_scores_gemma":[0.9978267,0.0003467123,0.000102234364,0.0009913341,0.00039861913,0.00033438083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009798064,0.00034869555,0.00035283293,0.00032754155,0.0004288566,0.0008973797,0.0014352268,0.00017809583,0.000022878026],"category_scores_gemma":[0.00025803913,0.0002931271,0.000039028764,0.0011645457,0.00011370017,0.00070225185,0.0015026951,0.0006153243,0.00009329881],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050322244,0.00010116671,0.065750144,0.00005063913,0.00013013105,0.00021912421,0.004209331,0.0019696036,0.015417739,0.07668572,0.0443007,0.7911154],"study_design_scores_gemma":[0.0028070936,0.0016880843,0.041128848,0.0013424539,0.00011664919,0.00087001536,0.0029298817,0.6122669,0.03937854,0.009356278,0.28297,0.0051452084],"about_ca_topic_score_codex":0.00017944326,"about_ca_topic_score_gemma":0.00078059675,"teacher_disagreement_score":0.78597015,"about_ca_system_score_codex":0.00006227235,"about_ca_system_score_gemma":0.000060468115,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W1974835369","doi":"10.1007/s12083-009-0031-0","title":"DAg-stream: Distributed video adaptation for overlay streaming to heterogeneous devices","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Adaptation (eye); Metadata; Content adaptation; Overlay network; Distributed computing; Server; Scalability; Computer network; Mobile device; Multimedia; Ubiquitous computing; The Internet; World Wide Web; Operating system","score_opus":0.02397491502197232,"score_gpt":0.2813579684451634,"score_spread":0.2573830534231911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974835369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013628509,0.0002076941,0.94135493,0.040994585,0.00023706512,0.0020280976,0.00014300243,0.001130113,0.0002759882],"genre_scores_gemma":[0.8097902,0.0000093620865,0.184689,0.0029199221,0.00061266625,0.0013057496,0.00016462397,0.000032554442,0.00047593185],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965739,0.00003687591,0.00053712644,0.0012563934,0.0006580771,0.0009376136],"domain_scores_gemma":[0.997152,0.0003362609,0.00015429615,0.0012046047,0.0005769512,0.0005759442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551033,0.00042834264,0.00040990184,0.00035578234,0.00065930065,0.0006482094,0.0014824409,0.00016837718,0.0000017837731],"category_scores_gemma":[0.0001755112,0.00045477733,0.000101860496,0.0021225514,0.00003220619,0.0002279288,0.00045666128,0.00020242805,0.00006983519],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026305452,0.000103937076,0.0003396002,0.00001236706,0.000038495178,0.000003675496,0.0007537805,0.12628482,0.00062513945,0.0070744976,0.033044957,0.8316924],"study_design_scores_gemma":[0.0003406774,0.00046344072,0.004715193,0.00012773745,0.00004932948,0.0000259363,0.00014141698,0.077153765,0.0008854859,0.005875937,0.9093707,0.00085037143],"about_ca_topic_score_codex":0.000055645407,"about_ca_topic_score_gemma":0.00018909863,"teacher_disagreement_score":0.8763257,"about_ca_system_score_codex":0.00015596994,"about_ca_system_score_gemma":0.00005644408,"threshold_uncertainty_score":0.9997904},"labels":[],"label_agreement":null},{"id":"W1975217603","doi":"10.1109/jsac.2003.818801","title":"Multicast With Network Coding in Application-Layer Overlay Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Multicast; Computer network; Linear network coding; Overlay network; Distributed computing; Overlay multicast; Network topology; Source-specific multicast; Multicast address; The Internet; Network packet","score_opus":0.025380861361016666,"score_gpt":0.2846143062362388,"score_spread":0.25923344487522215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975217603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05805279,0.00043530363,0.92462575,0.014349241,0.00023978889,0.00064944936,0.0000018842619,0.00046031666,0.001185445],"genre_scores_gemma":[0.8650905,0.0003485903,0.13363567,0.0006626012,0.00010197066,0.00012085506,0.0000034953698,0.000023451665,0.000012900137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977344,0.00021967824,0.00062297424,0.00037741498,0.0003733923,0.00067209976],"domain_scores_gemma":[0.99634814,0.0005925939,0.00027792001,0.0022983819,0.0003146888,0.00016829654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006993211,0.00025407333,0.00032388823,0.0005160312,0.00042587085,0.0002581,0.0040488555,0.00016430004,0.0000019205704],"category_scores_gemma":[0.00016380005,0.0002329099,0.000044853692,0.004789928,0.00011373287,0.00041478878,0.0003956196,0.0017171979,0.000027729191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003397891,0.0003824554,0.0152480835,0.0000018375533,0.00002679725,0.000030882435,0.0003624748,0.942367,0.0001458659,0.027788619,0.0009325513,0.012679423],"study_design_scores_gemma":[0.004168442,0.0006826247,0.1784038,0.00163407,0.000027791833,0.0008268833,0.00014113706,0.78336966,0.00056087907,0.018875524,0.009935083,0.001374124],"about_ca_topic_score_codex":0.00007896033,"about_ca_topic_score_gemma":0.002713672,"teacher_disagreement_score":0.80703765,"about_ca_system_score_codex":0.00064064434,"about_ca_system_score_gemma":0.00024517433,"threshold_uncertainty_score":0.949779},"labels":[],"label_agreement":null},{"id":"W1976348146","doi":"10.5555/2501560.2501563","title":"The brewing storm in cloud gaming: a measurement study on cloud to end-user latency","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cloud computing; Computer science; Server; Latency (audio); End user; Cloud testing; Cloud computing security; Multimedia; Computer network; World Wide Web; Operating system; Telecommunications","score_opus":0.05562347046515821,"score_gpt":0.27765441539522207,"score_spread":0.22203094493006387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976348146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9013977,0.000298125,0.07541253,0.011344186,0.0031730288,0.0015010196,5.2829375e-7,0.0010973044,0.005775576],"genre_scores_gemma":[0.9930826,0.0000025095103,0.0053076628,0.0008363318,0.00020783105,0.00011409299,8.263404e-8,0.000014297842,0.00043459292],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99723333,0.00012225805,0.00033146775,0.0004511263,0.0009977999,0.0008640126],"domain_scores_gemma":[0.9982267,0.00014850227,0.000054519845,0.001313203,0.000097242555,0.00015983926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029003029,0.00022233115,0.00020111751,0.00020204284,0.00020196135,0.00018404693,0.0021357087,0.00006580512,0.000006146957],"category_scores_gemma":[0.0002750268,0.00014963585,0.000044290344,0.0010013593,0.000022850738,0.00027287603,0.0011638884,0.00028252692,0.0002943066],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101743535,0.0031273733,0.28279188,0.000014455364,0.00019789783,0.000110806,0.043888047,0.0016765904,0.002038395,0.15536639,0.11453765,0.3961488],"study_design_scores_gemma":[0.0018693393,0.002619117,0.7120475,0.00020495085,0.000028573928,0.000023803872,0.00917834,0.0018532533,0.0106460815,0.0029529454,0.25677237,0.0018036994],"about_ca_topic_score_codex":0.00017098154,"about_ca_topic_score_gemma":0.001001317,"teacher_disagreement_score":0.42925566,"about_ca_system_score_codex":0.00038626516,"about_ca_system_score_gemma":0.000043866326,"threshold_uncertainty_score":0.6101973},"labels":[],"label_agreement":null},{"id":"W1977065718","doi":"10.5555/2157848.2157864","title":"What + when = how: the timelines approach to consistency in networked games","year":2011,"lang":"en","type":"article","venue":"Open MIND","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Timeline; Computer science; Consistency (knowledge bases); Artificial intelligence","score_opus":0.10606161563262902,"score_gpt":0.2777906739912608,"score_spread":0.17172905835863178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977065718","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2867024,0.0037529483,0.2554571,0.1107022,0.004144375,0.008552698,0.000010814862,0.00027426967,0.3304032],"genre_scores_gemma":[0.37971863,0.000028243092,0.61182743,0.0010140674,0.00007746251,0.00017117201,0.0000022558231,0.000014973282,0.0071457955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842584,0.00008930828,0.00022839158,0.00060123025,0.00021489587,0.00044033196],"domain_scores_gemma":[0.9983494,0.000087004846,0.00007099651,0.0013302686,0.00007114158,0.000091132744],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076149474,0.00018225478,0.00024704955,0.00012395959,0.000095353695,0.0010835399,0.005076553,0.00009153582,0.00005401435],"category_scores_gemma":[0.00010527063,0.00012677546,0.000038726244,0.000750572,0.00008994081,0.0010400648,0.0026848111,0.0001806029,0.000385904],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018848365,0.00011082706,0.0006616147,0.0000021676854,0.000020503725,0.00001981412,0.011079768,0.0002806461,0.000041246836,0.0020248664,0.038039573,0.94770014],"study_design_scores_gemma":[0.0014141379,0.00057540793,0.012472095,0.00048985734,0.0000416453,0.00011514147,0.010978008,0.06727158,0.006028181,0.024629511,0.8740152,0.0019692464],"about_ca_topic_score_codex":0.00008257734,"about_ca_topic_score_gemma":0.000258196,"teacher_disagreement_score":0.94573087,"about_ca_system_score_codex":0.000031392163,"about_ca_system_score_gemma":0.00006679556,"threshold_uncertainty_score":0.99995345},"labels":[],"label_agreement":null},{"id":"W1978094234","doi":"10.1145/776985.776996","title":"Peer-to-peer","year":2003,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Peer-to-peer; World Wide Web; Programming language; Computer network","score_opus":0.026189099824546435,"score_gpt":0.26945035843242077,"score_spread":0.24326125860787434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978094234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13278194,0.00016288339,0.70031416,0.121598735,0.0046726507,0.00088002754,0.000007860154,0.0034477357,0.03613403],"genre_scores_gemma":[0.38781473,0.0000074150566,0.57972413,0.003118111,0.00013558047,0.00010251214,0.0000023070115,0.00003742067,0.029057778],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968665,0.000085285035,0.00034246425,0.0009041331,0.0009536826,0.0008479285],"domain_scores_gemma":[0.9958012,0.00026460024,0.00007987284,0.0030792425,0.00047279737,0.0003022706],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090738264,0.00030814265,0.00032243255,0.00035859144,0.000167433,0.0002594622,0.004381703,0.00019338103,0.00006741784],"category_scores_gemma":[0.004996471,0.00029351155,0.00010718742,0.001681712,0.000046854075,0.0003842218,0.0014088321,0.00034899858,0.0019237046],"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.000007750159,0.00006964633,0.0026072795,0.0000053610042,0.000028442155,0.000056900713,0.00046556015,0.00020845965,0.0010829989,0.034399193,0.5371019,0.4239665],"study_design_scores_gemma":[0.00023156339,0.00026444934,0.0012884401,0.000020542071,0.000006116872,0.000033514552,0.00004769209,0.00062604947,0.007113952,0.038513914,0.9513344,0.0005193346],"about_ca_topic_score_codex":0.000048379585,"about_ca_topic_score_gemma":0.00006995885,"teacher_disagreement_score":0.42344716,"about_ca_system_score_codex":0.000118162505,"about_ca_system_score_gemma":0.00009306836,"threshold_uncertainty_score":0.9999517},"labels":[],"label_agreement":null},{"id":"W1978322408","doi":"10.1007/s12083-010-0083-1","title":"Optimizing BitTorrent-like peer-to-peer systems in the presence of network address translation devices","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Southeast University; British Columbia Knowledge Development Fund; University of Victoria","keywords":"BitTorrent; Computer science; Network address translation; Computer network; The Internet; NAT traversal; Peer-to-peer; Distributed computing; File sharing; Cover (algebra); World Wide Web; Internet Protocol","score_opus":0.03020005677212293,"score_gpt":0.2839757314842452,"score_spread":0.25377567471212226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978322408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041574463,0.0015451909,0.86259514,0.08048122,0.003310987,0.006095132,0.000082145845,0.0011737664,0.003141966],"genre_scores_gemma":[0.8890957,0.000022406084,0.10459419,0.0012240924,0.0015296233,0.002448341,0.00005481987,0.00006372045,0.00096707157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99368936,0.00021022433,0.0010666172,0.001467089,0.002233948,0.0013327365],"domain_scores_gemma":[0.99456143,0.0011064861,0.00032577902,0.0022860344,0.0012316443,0.000488605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0040288307,0.00059307826,0.00068396097,0.0006075444,0.0006710781,0.0009077698,0.0040560206,0.00034631704,0.0000043719547],"category_scores_gemma":[0.0002850882,0.000527574,0.00013262907,0.00499612,0.00015113883,0.0004102937,0.00086022314,0.0010010367,0.00007052457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006392951,0.00032860308,0.008542703,0.00013241841,0.00010708381,0.000012771639,0.011533448,0.5384221,0.0019505757,0.02952676,0.12762043,0.28175914],"study_design_scores_gemma":[0.00037061164,0.00014249538,0.0066627767,0.0003242726,0.00005234722,0.00003506196,0.00051930913,0.07133214,0.00013925669,0.0010909152,0.9184899,0.00084093865],"about_ca_topic_score_codex":0.00039778597,"about_ca_topic_score_gemma":0.0010573476,"teacher_disagreement_score":0.84752125,"about_ca_system_score_codex":0.00006974749,"about_ca_system_score_gemma":0.000103165126,"threshold_uncertainty_score":0.9997176},"labels":[],"label_agreement":null},{"id":"W1978575270","doi":"10.1145/1375457.1375476","title":"On the design of hybrid peer-to-peer systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Peer-to-peer; Computer science; Distributed computing; Bounded function; Server; Computer network; Database","score_opus":0.05069987920651728,"score_gpt":0.24158298883752866,"score_spread":0.19088310963101138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978575270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03537082,0.000040217386,0.93235725,0.023564368,0.0005051097,0.0006126456,0.0000031292682,0.00076390535,0.006782577],"genre_scores_gemma":[0.9254169,0.000003818023,0.061377313,0.0012920045,0.00004283996,0.00007178063,4.9505655e-7,0.000013385045,0.01178145],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976453,0.000105437524,0.0002975951,0.0004361197,0.0010943738,0.00042117777],"domain_scores_gemma":[0.9972789,0.00058836496,0.000078072,0.0015495527,0.00040338348,0.000101707505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009862023,0.00019333883,0.0002517102,0.00020706096,0.00015571293,0.0000851232,0.0028186694,0.00004998087,0.000014634515],"category_scores_gemma":[0.0006938651,0.000121698424,0.00005956999,0.0008404046,0.00008732689,0.00013873493,0.0005803787,0.00017931045,0.0005593672],"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.000010155157,0.000053949592,0.00007944007,0.000004635152,0.000022766008,0.00005902431,0.0003046377,0.039108038,0.00062206655,0.17002937,0.78725845,0.002447467],"study_design_scores_gemma":[0.0010379395,0.0030852663,0.002795951,0.00030236164,0.000026431244,0.0009736049,0.00048586895,0.5630413,0.1807237,0.02660427,0.21880853,0.0021147851],"about_ca_topic_score_codex":0.00006733883,"about_ca_topic_score_gemma":0.0000018591003,"teacher_disagreement_score":0.8900461,"about_ca_system_score_codex":0.000057836496,"about_ca_system_score_gemma":0.00006813675,"threshold_uncertainty_score":0.718972},"labels":[],"label_agreement":null},{"id":"W1979635763","doi":"10.1016/j.comcom.2007.08.012","title":"Global stability of Peer-to-Peer file sharing systems","year":2007,"lang":"en","type":"article","venue":"Computer Communications","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":"Concordia University","funders":"","keywords":"BitTorrent; Computer science; File sharing; Stability (learning theory); Peer-to-peer; BitTorrent tracker; Distributed computing; File system; Simple (philosophy); Computer network; World Wide Web; The Internet; Operating system","score_opus":0.057790733831157536,"score_gpt":0.31231022042678497,"score_spread":0.25451948659562745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979635763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01358484,0.00022500496,0.9696263,0.008838929,0.00057356444,0.00055673503,0.0001457269,0.0009562717,0.005492603],"genre_scores_gemma":[0.56185836,0.000002950694,0.43764612,0.00022980085,0.00004884685,0.00004500607,0.000035665988,0.000009029437,0.00012422737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974029,0.00009659367,0.0006890093,0.0005669655,0.0007047318,0.0005398224],"domain_scores_gemma":[0.9903646,0.00056142855,0.00018025802,0.007534148,0.0011239484,0.00023560709],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001725712,0.00022554777,0.00035224325,0.00023431658,0.00026367008,0.00024085813,0.010597523,0.00013088858,0.00001646054],"category_scores_gemma":[0.00033737265,0.00024013293,0.000103074606,0.0020973103,0.000160594,0.0003131844,0.009449704,0.00026569312,0.0001208254],"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.000019737765,0.0008579461,0.03543973,0.000089256915,0.00016012297,0.000013249414,0.003696323,0.009445835,0.00029308637,0.44096965,0.32675564,0.18225944],"study_design_scores_gemma":[0.0005248731,0.00037230272,0.15476765,0.00032110355,0.000025472576,0.00006308272,0.00033562398,0.4056737,0.00062175875,0.0072475364,0.42896184,0.0010850261],"about_ca_topic_score_codex":0.00027303354,"about_ca_topic_score_gemma":0.00029199178,"teacher_disagreement_score":0.5482735,"about_ca_system_score_codex":0.00028311872,"about_ca_system_score_gemma":0.000080394675,"threshold_uncertainty_score":0.9985617},"labels":[],"label_agreement":null},{"id":"W1979749873","doi":"10.1109/iscc.2007.4381497","title":"An Ontological Framework for Large-Scale Grid Resource Discovery","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Semantic grid; Grid; Resource (disambiguation); Interoperability; Grid computing; World Wide Web; Service discovery; Ontology; Data science; Architecture; Shared resource; Semantic heterogeneity; Semantic Web; Knowledge management; Web service; Ontology-based data integration; Geography","score_opus":0.026541998506403187,"score_gpt":0.2936285927330182,"score_spread":0.267086594226615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979749873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029013224,0.00064645935,0.9102359,0.052849192,0.0011426902,0.0019615209,0.00008567316,0.001539998,0.002525368],"genre_scores_gemma":[0.56234145,0.0015481326,0.429135,0.0060860086,0.00030597497,0.00038113297,0.00006917062,0.00007455033,0.000058593174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948114,0.00022274033,0.001230272,0.0017269603,0.00066952646,0.0013390762],"domain_scores_gemma":[0.9888424,0.0027920085,0.0006092875,0.006533439,0.0005163083,0.00070653885],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020072202,0.000911309,0.00092910527,0.00082545483,0.0028354458,0.0019399988,0.011389666,0.0005670336,7.236317e-7],"category_scores_gemma":[0.00006291513,0.00090283324,0.00027398125,0.0013732779,0.0007517392,0.0012567377,0.0035121706,0.0014714439,0.0000143897805],"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.00038341634,0.0034245357,0.0019794411,0.00012338332,0.00028801852,0.000006559703,0.008830753,0.0017956961,0.004181054,0.91009164,0.02014023,0.0487553],"study_design_scores_gemma":[0.0038134574,0.0072111078,0.0038810223,0.0019526455,0.0002374012,0.00026640206,0.0023663247,0.7638355,0.003736223,0.027473202,0.18109025,0.0041364697],"about_ca_topic_score_codex":0.000037188125,"about_ca_topic_score_gemma":0.00006531392,"teacher_disagreement_score":0.8826184,"about_ca_system_score_codex":0.00025656648,"about_ca_system_score_gemma":0.00008921013,"threshold_uncertainty_score":0.9993422},"labels":[],"label_agreement":null},{"id":"W1979833825","doi":"10.1007/s12083-011-0109-3","title":"Towards an effective integration of cellular users to the structured Peer-to-Peer network","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Chord (peer-to-peer); Computer network; Computer science; Upload; Cellular network; Base station; The Internet; Peer-to-peer; Distributed computing; Network topology; World Wide Web","score_opus":0.018456046687856296,"score_gpt":0.27691235525684055,"score_spread":0.25845630856898427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979833825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05162343,0.00029025908,0.88692737,0.05338978,0.001529404,0.0041731023,0.000071458555,0.00087599776,0.001119186],"genre_scores_gemma":[0.8542505,0.0000067464143,0.13591145,0.003036092,0.002747025,0.002291348,0.000095729956,0.00008559467,0.0015755068],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937828,0.00026732485,0.00082770205,0.0014353537,0.0020286539,0.0016581626],"domain_scores_gemma":[0.9937186,0.0004246726,0.0002724116,0.0026658995,0.0017525926,0.001165806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034107172,0.00073113054,0.0007399237,0.0005298362,0.00090238376,0.0006010822,0.0032045152,0.00034401994,0.000010364337],"category_scores_gemma":[0.00052681554,0.00061587035,0.00017436626,0.0049126386,0.00013259085,0.00047867783,0.001344968,0.0007242886,0.00018845688],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008103152,0.00019877145,0.0028190478,0.000024859446,0.00014914684,0.0000025871166,0.010113992,0.08421324,0.0054124543,0.037966214,0.17689838,0.68212026],"study_design_scores_gemma":[0.00036957214,0.00053767924,0.02849961,0.00015554283,0.000120500896,0.000021830847,0.00061438256,0.011022042,0.0064259246,0.005922729,0.9450749,0.0012352685],"about_ca_topic_score_codex":0.00026272362,"about_ca_topic_score_gemma":0.00034991917,"teacher_disagreement_score":0.8026271,"about_ca_system_score_codex":0.00025608385,"about_ca_system_score_gemma":0.000086035354,"threshold_uncertainty_score":0.99962926},"labels":[],"label_agreement":null},{"id":"W1980643693","doi":"10.1016/j.bjp.2013.12.019","title":"Popularity decays in peer-to-peer VoD systems: Impact, model, and design implications","year":2014,"lang":"en","type":"article","venue":"Computer Networks","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":"Simon Fraser University","funders":"","keywords":"Computer science; Upload; Popularity; Scalability; Peer-to-peer; Overlay; Replication (statistics); Population; Distributed computing; Scheduling (production processes); Computer network; World Wide Web; Database; Operating system","score_opus":0.03206279066061902,"score_gpt":0.2779245698085747,"score_spread":0.2458617791479557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980643693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015000562,0.00025828287,0.97565705,0.0064856973,0.00059613265,0.0008812136,0.0000045183015,0.00090237206,0.00021420125],"genre_scores_gemma":[0.6872565,0.000008461454,0.3113463,0.00087607984,0.00024788224,0.00012737272,0.000008364192,0.000028646173,0.0001004007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965296,0.00023943496,0.0005728957,0.0011166297,0.0005220801,0.0010193933],"domain_scores_gemma":[0.99680215,0.00034002552,0.00013182042,0.0018613066,0.00041420764,0.0004504643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017248229,0.00044394538,0.00056849845,0.00048032028,0.00021682151,0.0007406907,0.0024157534,0.00032195274,7.59717e-7],"category_scores_gemma":[0.00012730817,0.0004248049,0.00008840336,0.001472829,0.000066905835,0.0004638806,0.0018683813,0.0005353574,0.00003517978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000711651,0.000044058877,0.0032715716,0.000006799566,0.000016823089,0.0000053606755,0.00018269931,0.8725551,0.000011850502,0.019036124,0.04868871,0.05617383],"study_design_scores_gemma":[0.00029837992,0.00019572368,0.021224745,0.000076120894,0.0000080664195,0.00005092089,0.000003498236,0.9671375,0.0000062640124,0.0075737513,0.0029483957,0.00047661914],"about_ca_topic_score_codex":0.00009631556,"about_ca_topic_score_gemma":0.00006538369,"teacher_disagreement_score":0.67225593,"about_ca_system_score_codex":0.0002201243,"about_ca_system_score_gemma":0.00007041287,"threshold_uncertainty_score":0.99982035},"labels":[],"label_agreement":null},{"id":"W1984186194","doi":"10.1109/icdcs.2012.62","title":"Publiy+: A Peer-Assisted Publish/Subscribe Service for Timely Dissemination of Bulk Content","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"BitTorrent; Computer science; Dissemination; Publication; Scalability; Peer-to-peer; File sharing; Computer network; World Wide Web; Service (business); Database; The Internet; Business; Telecommunications","score_opus":0.06912598920451939,"score_gpt":0.29250472215701234,"score_spread":0.22337873295249294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984186194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07249308,0.000197979,0.8213101,0.09126569,0.0012800441,0.0011547533,0.00003209866,0.0016684069,0.01059785],"genre_scores_gemma":[0.839554,0.0000012795767,0.15299058,0.0008287367,0.00007080165,0.00016181033,0.000026452652,0.000014292763,0.0063520567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800926,0.000028693694,0.00039452533,0.00036895525,0.00059418124,0.00060436944],"domain_scores_gemma":[0.997,0.00032075742,0.00018144521,0.00089342997,0.0014236071,0.00018080689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009914277,0.00019123888,0.0002697346,0.0003088692,0.00009113561,0.0002896018,0.0018129507,0.00014846916,0.000022718117],"category_scores_gemma":[0.0011219806,0.0001640323,0.00008945147,0.0013796246,0.00003506733,0.002122505,0.00066010084,0.00011351118,0.00004517785],"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.000036744437,0.0006461459,0.0029336095,0.00010668931,0.00009547505,0.0000013074912,0.0017076433,0.00002615717,0.020445487,0.23421411,0.57956153,0.16022511],"study_design_scores_gemma":[0.002911283,0.0013576142,0.2620665,0.00045215813,0.00015159053,0.00012584857,0.0023658348,0.10656312,0.28648543,0.011213431,0.32342607,0.0028811195],"about_ca_topic_score_codex":0.00006902989,"about_ca_topic_score_gemma":0.00006371671,"teacher_disagreement_score":0.76706094,"about_ca_system_score_codex":0.00008827968,"about_ca_system_score_gemma":0.00004788059,"threshold_uncertainty_score":0.6689043},"labels":[],"label_agreement":null},{"id":"W1986900790","doi":"10.1109/ngi.2008.30","title":"Large Scale Distributed Storage and Search for a Video on Demand Streaming System","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Multicast; Computer network; Video on demand; Bandwidth (computing); Quality of service; Service provider; Video streaming; On demand; Service (business); Multimedia; Database","score_opus":0.019979059448995733,"score_gpt":0.24803710906216989,"score_spread":0.22805804961317416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986900790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37569937,0.000046551937,0.6224558,0.0005235148,0.000060401188,0.00027201953,0.000029915274,0.00062731066,0.00028514335],"genre_scores_gemma":[0.9591634,0.0000030092433,0.04032063,0.00011960132,0.000030678468,0.000049371163,0.0000054730017,0.000008378689,0.00029940307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998684,0.000029279932,0.00015232572,0.00044292622,0.00024326428,0.0004482184],"domain_scores_gemma":[0.99907523,0.000183821,0.000029574792,0.00052775565,0.00007493527,0.000108704546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003302026,0.00013363297,0.00018705132,0.00012450354,0.00029454153,0.000089765635,0.0005962879,0.00006817018,0.0000013904194],"category_scores_gemma":[0.000040583775,0.00011240448,0.0000342597,0.00040242876,0.00004231712,0.00017576021,0.00045239224,0.00010396768,0.00001725997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035667047,0.001287908,0.0677105,0.0011983592,0.00035889502,0.0013614378,0.01147428,0.010257683,0.0056967977,0.6079559,0.19080174,0.10153988],"study_design_scores_gemma":[0.0023972045,0.0010927066,0.024067884,0.00029552236,0.000015375754,0.00032921482,0.0016034814,0.92463577,0.025771264,0.0004590993,0.018412506,0.00091994414],"about_ca_topic_score_codex":0.000015176441,"about_ca_topic_score_gemma":0.000028092101,"teacher_disagreement_score":0.9143781,"about_ca_system_score_codex":0.00009024076,"about_ca_system_score_gemma":0.000029730109,"threshold_uncertainty_score":0.45837218},"labels":[],"label_agreement":null},{"id":"W1987297096","doi":"10.1109/bsc.2010.5472998","title":"Video on-demand streaming on the Internet &amp;#x2014; A survey","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Server; Computer science; The Internet; Video on demand; Bandwidth (computing); Video streaming; On demand; Multimedia; Computer network; World Wide Web","score_opus":0.034788337879127135,"score_gpt":0.26457364848397097,"score_spread":0.22978531060484383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987297096","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7874059,0.000007789238,0.18489982,0.010291062,0.0008700773,0.00023487667,0.0000039434053,0.00094197853,0.01534454],"genre_scores_gemma":[0.970149,0.0000018679985,0.022248786,0.0021050626,0.00006013339,0.000022089846,0.0000018957064,0.000010895885,0.005400282],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857324,0.000092055896,0.00017443416,0.00047211954,0.00032296442,0.00036518075],"domain_scores_gemma":[0.99715936,0.0011021751,0.00005178803,0.00154668,0.0000642127,0.000075781834],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011018709,0.00018135391,0.00014836757,0.00012963302,0.000091129565,0.00028650355,0.0025448776,0.00010836941,0.0001018807],"category_scores_gemma":[0.00080243865,0.00010886156,0.000044696455,0.00043937223,0.000077796656,0.00013090945,0.00079044385,0.00049331266,0.0011315055],"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.00003514662,0.00020845447,0.018198919,0.000004948045,0.000063352214,0.000011856094,0.0008712126,0.0002299367,0.004237963,0.3717516,0.44828007,0.15610656],"study_design_scores_gemma":[0.0007877207,0.0011453058,0.36720958,0.00017911923,0.000011717931,0.000052546027,0.00009419336,0.026516998,0.046481486,0.03143785,0.5243085,0.0017749632],"about_ca_topic_score_codex":0.0003586195,"about_ca_topic_score_gemma":0.0044993623,"teacher_disagreement_score":0.34901068,"about_ca_system_score_codex":0.000022938848,"about_ca_system_score_gemma":0.000024406574,"threshold_uncertainty_score":0.99964625},"labels":[],"label_agreement":null},{"id":"W1987465931","doi":"10.1504/ijcat.2007.014062","title":"INCA: qualitative reference framework for incentive mechanisms in P2P networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Computer Applications in Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Incentive; Implementation; Decentralization; Computer science; Context (archaeology); Variety (cybernetics); Quality (philosophy); Rationality; Process management; Knowledge management; Risk analysis (engineering); Business; Microeconomics; Software engineering; Political science; Economics","score_opus":0.022849722334005607,"score_gpt":0.36996770306811005,"score_spread":0.34711798073410444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987465931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011582796,0.00013592183,0.98045796,0.006483551,0.0006050288,0.0004888028,0.000004919051,0.00015769442,0.000083316256],"genre_scores_gemma":[0.4845248,0.000022795293,0.5150471,0.00023068166,0.00008339113,0.00007779975,0.0000023923824,0.0000074902823,0.0000035930123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776554,0.00005068123,0.000987299,0.00040095477,0.00039031229,0.00040518332],"domain_scores_gemma":[0.9970137,0.0010407176,0.00055249076,0.00048112968,0.00085012475,0.00006184855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014512248,0.00019357674,0.0003524738,0.0024222408,0.0000475709,0.00007449038,0.004186806,0.00037237888,0.0000016832728],"category_scores_gemma":[0.0002186992,0.0001934482,0.00007455943,0.0019491574,0.00012791221,0.0003101852,0.00085659977,0.0008068769,0.0000057509615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031296837,0.0001464912,0.0005550224,0.0000020449595,0.000036452908,0.000023244265,0.00067478005,0.0024617314,0.000076589786,0.85252684,0.0001439572,0.14332156],"study_design_scores_gemma":[0.000566216,0.00024113155,0.0021434089,0.00014137742,0.000003654333,0.000056157613,0.00062292546,0.01496546,0.0017846208,0.9746934,0.0045630136,0.00021861763],"about_ca_topic_score_codex":0.000008590186,"about_ca_topic_score_gemma":0.00006690589,"teacher_disagreement_score":0.472942,"about_ca_system_score_codex":0.0004432106,"about_ca_system_score_gemma":0.000085097265,"threshold_uncertainty_score":0.7888589},"labels":[],"label_agreement":null},{"id":"W1988425497","doi":"10.1109/cw.2012.23","title":"Interactive Distributed Rendering of 3D Scenes on Multiple Xbox 360 Systems and Personal Computers","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of New Brunswick","funders":"","keywords":"Computer science; Rendering (computer graphics); Software rendering; Multimedia; Game development tool; Porting; Parallel rendering; Visualization; Video game; Game programming; Studio; Computer graphics; Graphics; Computer graphics (images); Video game development; Human–computer interaction; 3D computer graphics; Game Developer; Game design; Game art design; Software; Game design document; Operating system; Artificial intelligence","score_opus":0.02486176464167074,"score_gpt":0.2482902298813725,"score_spread":0.22342846523970178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988425497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3795008,0.00018637699,0.6180526,0.00052787294,0.0007624858,0.00018984111,0.000015206513,0.00044368056,0.00032112154],"genre_scores_gemma":[0.9657372,0.000004136672,0.03407883,0.00006443951,0.00005281652,0.000011584067,0.0000037123075,0.000006489621,0.000040748688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989226,0.000039205366,0.00018800909,0.0002807472,0.00022877194,0.00034066138],"domain_scores_gemma":[0.9990365,0.00038313412,0.0000879599,0.00032530064,0.0000644021,0.0001026959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018518185,0.00015075818,0.00021679194,0.00013518763,0.000063686035,0.000081106366,0.0004958542,0.000063248764,0.0000015285269],"category_scores_gemma":[0.000111643174,0.00012724446,0.000029773777,0.00028927013,0.00006005,0.00041122764,0.00058328744,0.00012692019,0.000009728753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034591905,0.0014994516,0.36790648,0.0005489075,0.0008557041,0.00006997973,0.023271456,0.019038906,0.018812662,0.09215858,0.04392564,0.4315663],"study_design_scores_gemma":[0.00076001626,0.0003787198,0.08160284,0.00031539603,0.000012482248,0.00007892455,0.0013441358,0.89844435,0.011940251,0.000077824516,0.0044518197,0.0005932083],"about_ca_topic_score_codex":0.00009492875,"about_ca_topic_score_gemma":0.000008685037,"teacher_disagreement_score":0.8794055,"about_ca_system_score_codex":0.00007310489,"about_ca_system_score_gemma":0.000011186749,"threshold_uncertainty_score":0.5188879},"labels":[],"label_agreement":null},{"id":"W1989439626","doi":"10.1109/3dtv.2008.4547832","title":"Feasibility of Multi-View Video Streaming Over P2P Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agriculture and Agri-Food Canada","keywords":"Computer science; Upload; Computer network; Peer-to-peer; Video streaming; Tree (set theory); The Internet; Live streaming; Multimedia; World Wide Web","score_opus":0.05370365748214748,"score_gpt":0.28971793676904917,"score_spread":0.2360142792869017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989439626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15579864,0.00053355406,0.8406213,0.0004777048,0.00021058001,0.00029436086,0.000001937998,0.0008601821,0.0012017454],"genre_scores_gemma":[0.8027116,0.000067547306,0.19647048,0.00028711025,0.00002710801,0.000010352967,0.000001033178,0.000007754,0.0004170222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983598,0.000048182053,0.00035529953,0.0005258041,0.00029750835,0.00041343507],"domain_scores_gemma":[0.99816716,0.0001416116,0.00009954352,0.0013857546,0.00010786184,0.00009808567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003158544,0.0001799417,0.00030252503,0.00010659058,0.00009860398,0.00003044417,0.0015094391,0.00012368531,0.000022969125],"category_scores_gemma":[0.00015519717,0.00015405382,0.00009418019,0.000688003,0.0001271372,0.00033009954,0.000959723,0.0001852247,0.00002173183],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028970066,0.00090230006,0.3830361,0.000078383,0.000109444416,0.00015840832,0.001155067,0.029904943,0.0011152425,0.025230018,0.059500147,0.498781],"study_design_scores_gemma":[0.0008635451,0.00018658268,0.39837247,0.00009902645,0.000009862435,0.000053834425,0.000033779455,0.5902267,0.0027332806,0.0013073597,0.0054833726,0.0006301859],"about_ca_topic_score_codex":0.00021322953,"about_ca_topic_score_gemma":0.00021968815,"teacher_disagreement_score":0.64691293,"about_ca_system_score_codex":0.000068425026,"about_ca_system_score_gemma":0.000047714446,"threshold_uncertainty_score":0.6282132},"labels":[],"label_agreement":null},{"id":"W1990286216","doi":"10.3166/ria.23.697-718","title":"Agents mobiles et réseaux pair-à-pair Vers une gestion sécurisée de l'information répartie","year":2009,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chemistry; Computer science; Pharmacology; Medicine","score_opus":0.047973511795234416,"score_gpt":0.29414002914913745,"score_spread":0.24616651735390305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990286216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040317986,0.0012770831,0.80639464,0.14558664,0.0019178067,0.0008081573,0.000022565122,0.00094603916,0.0027290804],"genre_scores_gemma":[0.956137,0.00077637035,0.034728207,0.003857564,0.00020498602,0.00008007468,0.000035765977,0.000027051181,0.0041530016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604446,0.00024831886,0.001058053,0.000759713,0.0005867178,0.0013027249],"domain_scores_gemma":[0.9971579,0.00028990256,0.0003589367,0.0014569549,0.00036389276,0.00037243983],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015437495,0.0005023624,0.00043834015,0.00043355415,0.0003907736,0.0006303289,0.0017735232,0.0004939269,0.0001393808],"category_scores_gemma":[0.000750388,0.00058198953,0.00023014395,0.0025257594,0.00026755367,0.0024207977,0.00039308026,0.00077357504,0.0043316074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026442744,0.00022945182,0.0002720684,0.00006228533,0.000020746978,0.000046399833,0.0057247807,0.36154094,0.00052931736,0.057230655,0.05452245,0.51979446],"study_design_scores_gemma":[0.00007177032,0.0006494383,0.0015761496,0.00050091976,0.000030441419,0.00007932663,0.0008227943,0.7145482,0.037186276,0.02017452,0.2237747,0.00058548676],"about_ca_topic_score_codex":0.0005537053,"about_ca_topic_score_gemma":0.000095452095,"teacher_disagreement_score":0.915819,"about_ca_system_score_codex":0.0005728207,"about_ca_system_score_gemma":0.00028657247,"threshold_uncertainty_score":0.9996632},"labels":[],"label_agreement":null},{"id":"W1990551083","doi":"10.1145/2631775.2631811","title":"Understanding and controlling the filter bubble through interactive visualization","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visualization; Computer science; Filter (signal processing); Personalization; Human–computer interaction; Data visualization; Control (management); Internet privacy; World Wide Web; Artificial intelligence; Computer vision","score_opus":0.07053162557730587,"score_gpt":0.2868105354125677,"score_spread":0.21627890983526182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990551083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027104763,0.00002239423,0.98100847,0.0067962077,0.00016941562,0.00013158379,1.9300448e-7,0.0003458975,0.008815353],"genre_scores_gemma":[0.9701045,0.000007005682,0.02785082,0.0017916302,0.000036087025,0.000009671371,3.9546674e-7,0.000004989498,0.00019488235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993078,0.000048612466,0.000107821856,0.00022669266,0.00013273383,0.00017631402],"domain_scores_gemma":[0.9992446,0.00035537695,0.00004405719,0.00029881962,0.000035641526,0.00002151871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026865434,0.000083978535,0.000096723124,0.00004537534,0.00015930466,0.00026104462,0.00043956423,0.00003801189,0.000005358902],"category_scores_gemma":[0.00012860785,0.00005368593,0.000016958686,0.00025625483,0.00004603221,0.00046749203,0.00032853129,0.00008109133,0.000015059943],"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.000004691096,0.000006637837,0.00023560847,0.0000019704562,0.000013274444,5.5661377e-7,0.00128824,0.00066860596,0.0002656131,0.9892713,0.004255368,0.003988151],"study_design_scores_gemma":[0.00036655433,0.0001165953,0.00026804509,0.000033487682,0.0000063845896,0.000008941105,0.0007294122,0.74518025,0.003664803,0.23709436,0.012341967,0.00018922154],"about_ca_topic_score_codex":0.000019965717,"about_ca_topic_score_gemma":0.00002712492,"teacher_disagreement_score":0.96739405,"about_ca_system_score_codex":0.000053284122,"about_ca_system_score_gemma":0.000006478373,"threshold_uncertainty_score":0.25172594},"labels":[],"label_agreement":null},{"id":"W1990928257","doi":"10.1016/j.procs.2012.06.043","title":"Collaborate Social Network Services via Connectors","year":2012,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; World Wide Web; Phone; Social network (sociolinguistics); The Internet; Service (business); Internet privacy; Social media","score_opus":0.010219543202651893,"score_gpt":0.23975164890377085,"score_spread":0.22953210570111895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990928257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11541572,0.00025662492,0.8747861,0.00293126,0.0040550036,0.00039436034,0.000001938642,0.0016840079,0.0004750176],"genre_scores_gemma":[0.73099667,0.0000035281546,0.26566142,0.002007647,0.0012583082,0.00004064925,8.6068775e-7,0.000012564074,0.000018352384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960803,0.000044648103,0.00033586938,0.00088098226,0.0009369339,0.0017212639],"domain_scores_gemma":[0.99802965,0.000105782034,0.00017913395,0.0007756112,0.00048142596,0.0004283871],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014421046,0.0003164256,0.00030860264,0.00030953521,0.0008713755,0.0007447249,0.005182652,0.00011465901,0.000004017654],"category_scores_gemma":[0.000038531995,0.0002959383,0.000053926113,0.0068509793,0.00038430537,0.002645828,0.0030142884,0.00023503811,0.0002880013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032785756,0.000499618,0.09568819,0.0002110927,0.0000815949,0.00004003846,0.022300353,0.010408772,0.0056125987,0.22536021,0.051164813,0.5885999],"study_design_scores_gemma":[0.000960603,0.0005824786,0.13400257,0.00016664118,0.000031104446,0.00019576146,0.00012071221,0.7495554,0.015055028,0.027816335,0.06840094,0.0031124137],"about_ca_topic_score_codex":0.00001212807,"about_ca_topic_score_gemma":0.000012903587,"teacher_disagreement_score":0.73914665,"about_ca_system_score_codex":0.00014932358,"about_ca_system_score_gemma":0.00025689002,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W1991277203","doi":"10.1007/s12083-009-0032-z","title":"Improving robustness of P2P applications in mobile environments","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Redundancy (engineering); Distributed computing; Robustness (evolution); Exploit; Computer network; Computer security; Operating system","score_opus":0.011373719621234525,"score_gpt":0.2512774903335184,"score_spread":0.23990377071228391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991277203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021518476,0.00037248703,0.9684196,0.006295743,0.00010637935,0.0022241613,0.000016547603,0.00038531658,0.00066129543],"genre_scores_gemma":[0.8647807,0.000036829413,0.13049394,0.00053139776,0.0003188334,0.0028861023,0.000028413458,0.000028193555,0.0008955439],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971034,0.00003622109,0.00057682453,0.0009872656,0.0006152957,0.00068097044],"domain_scores_gemma":[0.9977932,0.00015664054,0.00016973981,0.0014361753,0.00013505066,0.0003092235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006314308,0.0003189777,0.0003953513,0.00046804323,0.0002744339,0.00015670982,0.0016844983,0.00015833967,0.000002427211],"category_scores_gemma":[0.000041676576,0.00034230703,0.000064761225,0.0024273575,0.0000696103,0.00018605223,0.0006490919,0.0002989429,0.000038557846],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007001666,0.0002835011,0.0017045321,0.000015315418,0.0000144553,0.0000013663047,0.00054180756,0.1304972,0.0028722817,0.0093044005,0.0033630473,0.8513951],"study_design_scores_gemma":[0.0005879555,0.00035737047,0.021485718,0.00013144549,0.000039995488,0.000016558393,0.0003053326,0.059097014,0.0025320246,0.0062387497,0.90799934,0.0012085137],"about_ca_topic_score_codex":0.000034485947,"about_ca_topic_score_gemma":0.000029426315,"teacher_disagreement_score":0.90463626,"about_ca_system_score_codex":0.00011771785,"about_ca_system_score_gemma":0.00003982555,"threshold_uncertainty_score":0.9999029},"labels":[],"label_agreement":null},{"id":"W1993059646","doi":"10.1145/1822327.1822329","title":"Lightweight reliable overlay multicasting in large-scale P2P networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Multicast; Computer network; Computer science; Node (physics); Distributed computing; Source-specific multicast; Overlay multicast; Overlay network; Service layer; Service (business); Multicast address; Pragmatic General Multicast; Survivability; Quality of service; Engineering; The Internet","score_opus":0.00731046457209326,"score_gpt":0.23158105955672248,"score_spread":0.22427059498462923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993059646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13267298,0.00007876683,0.8319701,0.005873326,0.0017868781,0.00035546592,0.0000012062236,0.0021084056,0.025152907],"genre_scores_gemma":[0.62464815,0.000005272167,0.3730652,0.0006263231,0.00011817434,0.000026354497,0.0000010349822,0.000013981559,0.0014954967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978223,0.000021249103,0.000338091,0.0006499057,0.00028285902,0.0008856056],"domain_scores_gemma":[0.9983353,0.00016881428,0.000064745705,0.00120855,0.00007592353,0.00014663814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006447654,0.00021098048,0.0002464854,0.00023269778,0.0001275086,0.0002043335,0.0018213772,0.00025305944,0.000058176756],"category_scores_gemma":[0.00018364377,0.00018405892,0.000053550484,0.0012756229,0.000042870586,0.00047738326,0.001286898,0.0007499972,0.00019612876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040226478,0.0011357832,0.18451542,0.000041514817,0.00005494771,0.00048490483,0.002772751,0.047721434,0.015883287,0.34583187,0.22275694,0.17876093],"study_design_scores_gemma":[0.00037345407,0.00004843479,0.010893362,0.000032276545,0.0000021552369,0.000016744661,0.000032968688,0.9234297,0.0031709857,0.0018846407,0.05974463,0.00037063035],"about_ca_topic_score_codex":0.00006586506,"about_ca_topic_score_gemma":0.0012511619,"teacher_disagreement_score":0.8757083,"about_ca_system_score_codex":0.000040303275,"about_ca_system_score_gemma":0.000034615467,"threshold_uncertainty_score":0.75057054},"labels":[],"label_agreement":null},{"id":"W1995239073","doi":"10.1016/j.future.2006.03.003","title":"Video transcoding in a Grid network with User Controlled LightPaths","year":2006,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Peer-to-Peer Network Technologies","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Transcoding; Provisioning; Grid; File transfer; Computer network; Bandwidth (computing); Transfer (computing); Operating system","score_opus":0.007374984458069199,"score_gpt":0.19047460121261375,"score_spread":0.18309961675454456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995239073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011934668,0.0013404578,0.94561034,0.002994235,0.03596186,0.0011312503,0.0000026289956,0.0007447855,0.000279791],"genre_scores_gemma":[0.35881042,0.000018568298,0.40865695,0.0012990877,0.22971839,0.00075221097,0.00005362137,0.000065665234,0.00062507426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972898,0.00021643449,0.00066494575,0.0007573039,0.00048531822,0.00058621104],"domain_scores_gemma":[0.9987123,0.00007464863,0.00018065532,0.0007850907,0.00016347716,0.00008383697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005755334,0.00034890432,0.00061522884,0.00029854005,0.00018643367,0.000734258,0.0009748152,0.00019987328,0.0000016852488],"category_scores_gemma":[0.0000037457467,0.00027219634,0.00008797149,0.0012018002,0.000020391513,0.00046598635,0.00013509515,0.00023857167,0.000027172477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003733237,0.00004856981,0.0013137334,0.000017118322,0.000033312805,0.00007287556,0.00027027656,0.50921124,0.00035859208,0.044297718,0.4422013,0.0021379504],"study_design_scores_gemma":[0.0036729889,0.00028676077,0.0015477166,0.00018051968,0.000013315415,0.000101625694,0.000019757219,0.6610022,0.00031600104,0.00003788631,0.3321843,0.00063691096],"about_ca_topic_score_codex":0.0000905786,"about_ca_topic_score_gemma":0.0007936729,"teacher_disagreement_score":0.5369534,"about_ca_system_score_codex":0.00013103388,"about_ca_system_score_gemma":0.00007529309,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W1996119906","doi":"10.1016/j.mcm.2006.02.003","title":"A peer-to-peer expressway over Chord","year":2006,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Peer-to-Peer Network Technologies","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Joins; Computer science; Computer network; Overlay; Chord (peer-to-peer); Routing (electronic design automation); Routing table; Distributed computing; Peer-to-peer; Static routing; Overlay network; Routing algorithm; Routing protocol; The Internet","score_opus":0.020143810032734098,"score_gpt":0.2310606362294415,"score_spread":0.2109168261967074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996119906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06117838,0.00005389776,0.92862964,0.0072171018,0.00015349017,0.0002622576,0.0000023030445,0.0007383355,0.0017646127],"genre_scores_gemma":[0.2879056,0.0000011487919,0.70891225,0.0007113272,0.00023064081,0.000041631596,0.0000016814943,0.000020238882,0.002175487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743205,0.000028126522,0.00040976037,0.0007037723,0.0008300768,0.0005962002],"domain_scores_gemma":[0.99862105,0.0001405123,0.000053219814,0.0007709535,0.00020201821,0.00021227542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004400899,0.00029881895,0.00037561782,0.0001951435,0.00015138122,0.000537867,0.0011227909,0.00012706079,0.0000115665325],"category_scores_gemma":[0.000023370267,0.00025329046,0.00008224995,0.0004511405,0.000049294285,0.00028772617,0.0011891187,0.00022972982,0.0001945511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008316692,0.00019382984,0.000052424224,0.000058120524,0.000022883938,0.000041598105,0.0010093808,0.179962,0.00015204221,0.7509019,0.032933176,0.034664344],"study_design_scores_gemma":[0.00014143808,0.00006301641,0.000043586035,0.000067000794,0.0000051716365,0.000019949599,0.0000054511343,0.7878471,0.00028216274,0.19634059,0.014897091,0.00028744512],"about_ca_topic_score_codex":0.000018330014,"about_ca_topic_score_gemma":0.0000017744882,"teacher_disagreement_score":0.6078851,"about_ca_system_score_codex":0.000030587507,"about_ca_system_score_gemma":0.000014496759,"threshold_uncertainty_score":0.99999195},"labels":[],"label_agreement":null},{"id":"W1996372035","doi":"10.1145/2557642.2557655","title":"SPEX","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Cloud computing; Overlay; Latency (audio); Distributed computing; Virtual machine; Bandwidth (computing); Host (biology); Low latency (capital markets); Computer network; Operating system; Telecommunications","score_opus":0.006711510812957174,"score_gpt":0.2082205450195724,"score_spread":0.20150903420661523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996372035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006567848,0.0000068040354,0.89665914,0.00947626,0.00019237095,0.00003858741,5.05189e-8,0.0013130009,0.08574597],"genre_scores_gemma":[0.6522631,6.787004e-7,0.34332457,0.0016374234,0.000041077237,0.0000036547874,8.817009e-8,0.0000025982122,0.0027268098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994133,0.000010405111,0.00006590346,0.00019884013,0.00012418392,0.00018736889],"domain_scores_gemma":[0.999241,0.000038613398,0.000011797939,0.00064084464,0.000021715765,0.000046024055],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015144699,0.000055276225,0.00006261403,0.00006928343,0.000029844761,0.00007145477,0.001172482,0.000031978445,0.000016800277],"category_scores_gemma":[0.000067013345,0.000044806613,0.000017325736,0.00033928215,0.000015101317,0.00012132764,0.0004870545,0.000051141677,0.0011029836],"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":[2.5575355e-7,0.0000071506006,0.00035092374,7.244812e-7,0.0000018027049,0.0000015846792,0.000033290824,0.00006677655,0.0002993433,0.61103904,0.08410705,0.30409205],"study_design_scores_gemma":[0.00015272765,0.00013974082,0.008603462,0.0000074275135,0.0000012539541,0.000012620178,0.000008611118,0.08732896,0.016540468,0.10300288,0.7838939,0.00030794315],"about_ca_topic_score_codex":0.000008593135,"about_ca_topic_score_gemma":0.000011419535,"teacher_disagreement_score":0.69978684,"about_ca_system_score_codex":0.000010571398,"about_ca_system_score_gemma":0.000006100863,"threshold_uncertainty_score":0.9996748},"labels":[],"label_agreement":null},{"id":"W1996657335","doi":"10.1109/icme.2007.4284668","title":"Distributed Rate Allocation in P2P Streaming","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Upload; Bandwidth (computing); Bandwidth allocation; Peer-to-peer; Throughput; Scheme (mathematics); Computer network; Distributed computing; Live streaming; Decomposition; Distributed algorithm; Telecommunications; Wireless; Mathematics; World Wide Web","score_opus":0.013897596238294676,"score_gpt":0.2547822769428692,"score_spread":0.24088468070457453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996657335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16731067,0.000014827744,0.8276594,0.0026010755,0.00010009656,0.00009346543,6.5808405e-7,0.00057952077,0.0016402883],"genre_scores_gemma":[0.92760473,0.0000017087046,0.071928576,0.00024240465,0.000014916411,0.000005351598,0.0000050990207,0.0000032003973,0.00019403541],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99910927,0.000015227334,0.00017875526,0.00025682163,0.00012549716,0.00031441913],"domain_scores_gemma":[0.9993506,0.000095599455,0.0000310624,0.00043309384,0.00004288761,0.000046763835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060569285,0.00008118407,0.000082839935,0.00017438471,0.000032410222,0.00006417984,0.0007355523,0.000059435046,0.0000034187722],"category_scores_gemma":[0.0001199771,0.0000756188,0.000014444658,0.0010943533,0.000016983626,0.00024155903,0.00029324964,0.000094545205,0.00005888728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009552157,0.00010208208,0.01628452,0.000006199645,0.000009612969,0.00008940808,0.00034734915,0.0029764667,0.0074317143,0.17689419,0.006426047,0.78942287],"study_design_scores_gemma":[0.0008053375,0.00022906304,0.6838687,0.00007494918,0.000003861635,0.000017399061,0.00037978197,0.16381943,0.10519629,0.023812985,0.020964684,0.00082752906],"about_ca_topic_score_codex":0.000088631474,"about_ca_topic_score_gemma":0.00062154344,"teacher_disagreement_score":0.7885953,"about_ca_system_score_codex":0.00009417705,"about_ca_system_score_gemma":0.000019193229,"threshold_uncertainty_score":0.3083645},"labels":[],"label_agreement":null},{"id":"W1996955594","doi":"10.1145/1878537.1878782","title":"Adding multimedia streaming to BitTorrent","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"BitTorrent; Computer science; Upload; The Internet; Computer network; Multimedia; Real Time Streaming Protocol; Video on demand; Peer-to-peer; Server; Selection (genetic algorithm); Download; World Wide Web","score_opus":0.011603661787194245,"score_gpt":0.2524817204423614,"score_spread":0.24087805865516715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996955594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27294034,0.000012845352,0.7069684,0.0063429936,0.0025111765,0.00029305406,0.0000020942143,0.002696236,0.008232859],"genre_scores_gemma":[0.5325132,4.2277722e-7,0.46647918,0.00036409195,0.00008301693,0.000018990311,4.6322344e-7,0.0000055372298,0.0005350784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878716,0.000007878011,0.00014691004,0.00040994523,0.00024686937,0.0004012558],"domain_scores_gemma":[0.9988055,0.000106258136,0.000026044589,0.00082144595,0.000056329627,0.00018442208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001762029,0.00012932853,0.00011735124,0.00022035366,0.00007726186,0.00015462544,0.0015648138,0.000076968696,0.000036553243],"category_scores_gemma":[0.00025174898,0.000111666144,0.000032101383,0.00064075866,0.000020947136,0.00021583884,0.0010830585,0.0002311265,0.00062473235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010518927,0.000029189592,0.0014360258,0.0000018096172,0.0000060014163,0.000012167375,0.00039567758,0.0001537695,0.02813199,0.01668428,0.027206631,0.9259414],"study_design_scores_gemma":[0.0005634437,0.00034474226,0.03131226,0.00008550718,0.000009259101,0.000042757747,0.00027387327,0.3124777,0.17101315,0.002606142,0.4797349,0.0015362521],"about_ca_topic_score_codex":0.000050002058,"about_ca_topic_score_gemma":0.0002657734,"teacher_disagreement_score":0.92440516,"about_ca_system_score_codex":0.000028085631,"about_ca_system_score_gemma":0.00002509192,"threshold_uncertainty_score":0.8029879},"labels":[],"label_agreement":null},{"id":"W1998567165","doi":"10.1145/354401.354444","title":"System lag tests for augmented and virtual environments","year":2000,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Citation; Computer science; Library science; World Wide Web","score_opus":0.01157013028055013,"score_gpt":0.22442222917612245,"score_spread":0.21285209889557233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998567165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31940055,0.00009859412,0.67066854,0.002252108,0.00019179967,0.0007333324,0.000008186508,0.0015006448,0.005146224],"genre_scores_gemma":[0.9133981,0.000008991061,0.071437486,0.00034947303,0.000025853453,0.000076319964,0.0000015882673,0.000008423759,0.014693759],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991168,0.000011585124,0.00012937302,0.000336254,0.0001498422,0.00025615442],"domain_scores_gemma":[0.9994147,0.00006170333,0.000020044252,0.000427625,0.000006114173,0.000069817885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115994415,0.00010697588,0.00011387863,0.00005578969,0.000078803845,0.00007666832,0.0005673474,0.00005770039,0.000013523904],"category_scores_gemma":[0.000012061114,0.00009228761,0.00002018662,0.00014716954,0.000031648055,0.00017034497,0.00021329634,0.00004270692,0.00014270717],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020946763,0.00008703943,0.0009970593,0.000020658561,0.000041582403,0.000017841849,0.00021471211,0.0006126512,0.003641969,0.13946174,0.028178157,0.82670563],"study_design_scores_gemma":[0.0028321738,0.001823827,0.025548311,0.0001617015,0.000029646224,0.000133288,0.000329647,0.1814684,0.020696362,0.0023652138,0.7633034,0.0013080396],"about_ca_topic_score_codex":0.000007383514,"about_ca_topic_score_gemma":0.00000543406,"teacher_disagreement_score":0.8253976,"about_ca_system_score_codex":0.0000505583,"about_ca_system_score_gemma":0.000006714409,"threshold_uncertainty_score":0.37633798},"labels":[],"label_agreement":null},{"id":"W1999114633","doi":"10.5555/1639809.1639941","title":"Peer-to-peer simulation for improving the system of serving multimedia on the web","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scalability; The Internet; Multimedia; Peer-to-peer; Web server; World Wide Web; Server; Client–server model; Computer network; Database","score_opus":0.024696287472182544,"score_gpt":0.26624393748222097,"score_spread":0.24154765001003842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999114633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066715434,0.000017901682,0.83724034,0.09074205,0.00047013923,0.0016812985,0.000006305556,0.0009880103,0.002138503],"genre_scores_gemma":[0.910484,1.6591777e-7,0.086732045,0.0014966732,0.000093960065,0.000056869252,0.000001014429,0.000009487763,0.0011257593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814165,0.000050644958,0.00032317592,0.0003797809,0.00072937505,0.00037537338],"domain_scores_gemma":[0.99689823,0.0011257457,0.00013183428,0.0012237087,0.0005639935,0.00005646567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015503862,0.00017420996,0.00018386547,0.00013585191,0.00023265688,0.0001680407,0.0021823803,0.00009030107,0.000002493755],"category_scores_gemma":[0.0012785759,0.00009460861,0.0000862048,0.00068901514,0.000025472615,0.00018223171,0.00036574883,0.0001517321,0.000035807363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064864995,0.00008397471,0.00014921433,0.00006157115,0.00003774447,0.0000033241845,0.0031627559,0.29495177,0.014805474,0.15362659,0.030463936,0.5025888],"study_design_scores_gemma":[0.00021775914,0.00019659934,0.00086991314,0.00004253044,0.0000067534424,0.0000013925265,0.00036368959,0.98801243,0.0062794047,0.00061336503,0.003259195,0.00013698946],"about_ca_topic_score_codex":0.000027384427,"about_ca_topic_score_gemma":0.000024235036,"teacher_disagreement_score":0.8437686,"about_ca_system_score_codex":0.00008865049,"about_ca_system_score_gemma":0.00004153524,"threshold_uncertainty_score":0.4055442},"labels":[],"label_agreement":null},{"id":"W1999144075","doi":"10.1007/s00607-012-0196-x","title":"Load balancing in peer-to-peer systems using a diffusive approach","year":2012,"lang":"en","type":"article","venue":"Computing","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":"University of Ottawa","funders":"","keywords":"Workload; Convergence (economics); Computer science; Upper and lower bounds; Overlay; Overlay network; Load balancing (electrical power); Distributed computing; Node (physics); Peer-to-peer; Mathematical optimization; Mathematics; Engineering","score_opus":0.03449987351668637,"score_gpt":0.28006286485362714,"score_spread":0.24556299133694076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999144075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39260298,0.00031404902,0.60289294,0.0005244977,0.0011452809,0.00037409348,9.710938e-7,0.00058526633,0.0015598938],"genre_scores_gemma":[0.78120613,3.507158e-7,0.21795972,0.0002592472,0.00038052187,0.000012695734,0.0000013978083,0.00002412342,0.00015583185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962717,0.00012219539,0.00051089603,0.0006962006,0.0010616435,0.0013373167],"domain_scores_gemma":[0.9980228,0.00020194141,0.0001623396,0.0009591268,0.00037513548,0.0002786907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022061698,0.00032427761,0.00046293877,0.00045160588,0.00021146136,0.00036524504,0.0017955184,0.00016640904,7.6040214e-7],"category_scores_gemma":[0.000702061,0.00032861263,0.00006936763,0.00195897,0.000036395082,0.0004612294,0.0022544223,0.00044029334,0.000084175976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020043775,0.0005723103,0.17439346,0.0002784277,0.000096747266,0.00011746209,0.0366669,0.63225,0.008172822,0.031913765,0.0129945455,0.10252352],"study_design_scores_gemma":[0.00031466305,0.00003562329,0.012100347,0.0002535184,0.0000065605814,0.000117061165,0.0007887226,0.9817113,0.00031285023,0.00010258249,0.0036937331,0.0005630055],"about_ca_topic_score_codex":0.00024530973,"about_ca_topic_score_gemma":0.0000058988826,"teacher_disagreement_score":0.38860312,"about_ca_system_score_codex":0.0006506713,"about_ca_system_score_gemma":0.00009995449,"threshold_uncertainty_score":0.9999166},"labels":[],"label_agreement":null},{"id":"W1999336276","doi":"10.1109/hpcsim.2012.6266937","title":"DEVS simulation of peer-to-peer file-sharing","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; File sharing; Peer-to-peer; Distributed computing; Formalism (music); Discrete event simulation; Protocol (science); Computer network; Operating system; The Internet; Modeling and simulation; Simulation","score_opus":0.03848917714585209,"score_gpt":0.29763103191063034,"score_spread":0.25914185476477825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999336276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054555748,0.000026465863,0.928952,0.0044485605,0.00043506865,0.00024458146,0.000011023839,0.00092981686,0.01039674],"genre_scores_gemma":[0.78811204,2.3691727e-7,0.20479485,0.0004265048,0.00007788025,0.000017723038,0.0000059071617,0.000009751213,0.0065550623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981726,0.000014980151,0.0002800056,0.0003265726,0.000693522,0.00051230896],"domain_scores_gemma":[0.9982421,0.00020008262,0.000073552175,0.0009443808,0.00037366114,0.00016624822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005650465,0.00015190915,0.00018714173,0.00026456712,0.00006277629,0.00007985133,0.0014569067,0.000103530096,0.00022838506],"category_scores_gemma":[0.00077493,0.00013880023,0.00005288398,0.00093458686,0.000022852906,0.00066332263,0.0012406092,0.00012216832,0.00050691556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018803536,0.00023318597,0.0289282,0.00003640976,0.00006164412,0.0000056925123,0.0035252394,0.26499146,0.0024664244,0.09298089,0.28413337,0.32261866],"study_design_scores_gemma":[0.00033195983,0.000192844,0.054110017,0.00007008367,0.000012562828,0.0000089281075,0.00014020754,0.6085218,0.023281526,0.0043904386,0.30815983,0.0007797888],"about_ca_topic_score_codex":0.000039640134,"about_ca_topic_score_gemma":0.000014362406,"teacher_disagreement_score":0.73355633,"about_ca_system_score_codex":0.00006020329,"about_ca_system_score_gemma":0.000020032941,"threshold_uncertainty_score":0.6515543},"labels":[],"label_agreement":null},{"id":"W2000058798","doi":"10.1016/j.jnca.2015.04.006","title":"Monitoring IPTV quality of experience in overlay networks using utility functions","year":2015,"lang":"en","type":"article","venue":"Journal of Network and Computer 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":"University of Ottawa","funders":"","keywords":"Computer science; IPTV; Overlay; Computer network; Overlay network; Quality (philosophy); Quality of experience; Telecommunications; Quality of service; World Wide Web; Operating system; The Internet","score_opus":0.10981705828931189,"score_gpt":0.34753913563448824,"score_spread":0.23772207734517636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000058798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19979009,0.0008990255,0.7984378,0.0002073592,0.00041607377,0.00014798957,5.9593935e-7,0.000042931333,0.00005815719],"genre_scores_gemma":[0.80566263,0.00004596439,0.19369398,0.000048287915,0.00052179134,0.00001636853,2.429262e-7,0.000005237931,0.0000054885145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825686,0.00010341965,0.0007717366,0.0002620338,0.00031542193,0.0002905355],"domain_scores_gemma":[0.9983202,0.0001884897,0.00044453668,0.00052925624,0.00032846924,0.00018900906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009821568,0.00014033956,0.0003555156,0.00015896441,0.00010240261,0.00008396906,0.000845503,0.00009148564,6.055012e-7],"category_scores_gemma":[0.000022296275,0.00013339992,0.00007172264,0.0012358819,0.000087327615,0.0003888057,0.00048224363,0.00029916575,7.876412e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045942565,0.00025267954,0.22369696,0.000016002363,0.000051343242,0.000007748226,0.0014071547,0.50649935,0.00010757373,0.007676336,0.0025830974,0.2576558],"study_design_scores_gemma":[0.00071663,0.00022291033,0.25238442,0.00019498542,0.00001785372,0.00010911273,0.0003075269,0.728564,0.00008209949,0.009115019,0.007928382,0.00035703112],"about_ca_topic_score_codex":0.000032504617,"about_ca_topic_score_gemma":0.000008979126,"teacher_disagreement_score":0.6058725,"about_ca_system_score_codex":0.000080841884,"about_ca_system_score_gemma":0.00009017171,"threshold_uncertainty_score":0.5439891},"labels":[],"label_agreement":null},{"id":"W2000475884","doi":"10.1109/iccnc.2012.6167539","title":"P2P streaming; Impact of bandwidth throttling on QoS","year":2012,"lang":"en","type":"article","venue":"2012 International Conference on Computing, Networking and Communications (ICNC)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Bandwidth throttling; Computer science; Computer network; Bandwidth (computing); Quality of service; The Internet; Internet traffic; Provisioning; Mobile QoS; Bandwidth allocation; Internet access; Service (business); Service provider; World Wide Web; Engineering; Business","score_opus":0.08974412545196596,"score_gpt":0.35945148966066137,"score_spread":0.2697073642086954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000475884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4376703,0.003202216,0.4004801,0.011497778,0.005353218,0.0011220296,0.00004709874,0.0017101376,0.13891713],"genre_scores_gemma":[0.9722661,0.00033584985,0.026588583,0.00021175337,0.00039223922,0.000017630478,0.000022776596,0.000017597828,0.00014751851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980913,0.00015920126,0.00045770782,0.0003678904,0.00042022084,0.0005037184],"domain_scores_gemma":[0.99685013,0.00054606394,0.0003697743,0.0017897543,0.0002818278,0.0001624463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069141935,0.00028383714,0.0003021913,0.0003493921,0.0003364267,0.0002238332,0.0034006438,0.0001218762,0.000025263696],"category_scores_gemma":[0.00008584211,0.0002602257,0.00011921426,0.00045859697,0.00017563275,0.00035427313,0.001746038,0.0005030648,0.000043993303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033274788,0.00051183027,0.023916481,0.000008019682,0.00021502232,0.0000012288077,0.0015420663,0.0043761125,0.00024578208,0.6083728,0.0061971107,0.35458028],"study_design_scores_gemma":[0.00089024793,0.0008440772,0.08356332,0.0012624493,0.0000347182,0.000050168004,0.00024392533,0.8724535,0.00032554692,0.010216694,0.029086836,0.0010285148],"about_ca_topic_score_codex":0.00009791236,"about_ca_topic_score_gemma":0.000019817599,"teacher_disagreement_score":0.8680774,"about_ca_system_score_codex":0.00014410219,"about_ca_system_score_gemma":0.00007664025,"threshold_uncertainty_score":0.999985},"labels":[],"label_agreement":null},{"id":"W2000527224","doi":"10.1016/j.future.2004.04.016","title":"The JXTA performance model and evaluation","year":2004,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":22,"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 Saskatchewan","funders":"","keywords":"Computer science; Benchmarking; Implementation; Scheme (mathematics); Distributed computing; Protocol (science); Overlay network; Identification (biology); Computer network; Overlay; Routing (electronic design automation); Routing protocol; Peer-to-peer; World Wide Web; Operating system; Software engineering; The Internet","score_opus":0.02642816277239894,"score_gpt":0.24077110618320166,"score_spread":0.21434294341080273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000527224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058713846,0.0017831085,0.91383684,0.0063834796,0.018350346,0.0005189427,9.948815e-7,0.00032342115,0.000089037814],"genre_scores_gemma":[0.8164092,0.00011323507,0.15953076,0.0006242471,0.022911482,0.00022968682,0.000011502942,0.000016019252,0.0001539098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850845,0.000073350115,0.0002611817,0.00040666794,0.0005051835,0.0002451387],"domain_scores_gemma":[0.99885046,0.000021080503,0.00009242477,0.0007151057,0.00025699515,0.000063940075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079572067,0.00015589855,0.00012640303,0.000085637206,0.0005019203,0.0007328601,0.00073594827,0.00009554267,1.5457748e-7],"category_scores_gemma":[0.000008110706,0.00011122042,0.000024057414,0.00032957824,0.000025724195,0.0004200124,0.00028883002,0.000119858574,0.00002145863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011604403,0.0000068537483,0.00002539713,0.000006380395,0.000009690673,5.9369205e-7,0.0004154303,0.81320524,0.00015132425,0.057017453,0.04537756,0.0837829],"study_design_scores_gemma":[0.00022868399,0.00006650374,0.00037312135,0.000017043241,0.000003951327,0.00003050864,0.000013560691,0.9738185,0.0002479533,0.00013892903,0.024917765,0.00014350355],"about_ca_topic_score_codex":0.0000070577235,"about_ca_topic_score_gemma":0.000032815537,"teacher_disagreement_score":0.7576953,"about_ca_system_score_codex":0.000118788244,"about_ca_system_score_gemma":0.000102993945,"threshold_uncertainty_score":0.70669866},"labels":[],"label_agreement":null},{"id":"W2000718212","doi":"10.1145/1880018.1880020","title":"Load Balancing Content-Based Publish/Subscribe Systems","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Load balancing (electrical power); PlanetLab; Testbed; Scalability; Distributed computing; Network Load Balancing Services; Quality of service; Computer network; Server; Publication; Load management; Round-robin DNS; The Internet; Operating system; Grid","score_opus":0.031198900906894096,"score_gpt":0.2317838798675431,"score_spread":0.200584978960649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000718212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01182477,0.00012509267,0.9528849,0.0035363222,0.02753064,0.00091555755,0.000023297116,0.0028943964,0.00026502882],"genre_scores_gemma":[0.88953096,0.0000025647746,0.10835101,0.00060691434,0.0006323807,0.00031955732,0.000004944074,0.000045868073,0.0005058351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607795,0.00016240998,0.0007508741,0.0011072474,0.0010375461,0.0008639925],"domain_scores_gemma":[0.99464595,0.00045513888,0.00021556181,0.003744241,0.0005870189,0.00035206796],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000909588,0.0004828359,0.0005995278,0.00060516223,0.00040655033,0.0018481613,0.004632371,0.0003644363,0.00000664897],"category_scores_gemma":[0.000075915574,0.0004534758,0.00020667748,0.0013323573,0.00008524586,0.0009431489,0.00011222413,0.0009659828,0.00034805873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012271463,0.0016885833,0.0017913257,0.00075062364,0.00084623793,0.00050466054,0.0018698656,0.4228424,0.020534294,0.051590264,0.106704615,0.3907544],"study_design_scores_gemma":[0.0016980588,0.00062391744,0.0008507536,0.0005125689,0.00004012654,0.00036601356,0.00017971895,0.8807575,0.0036577561,0.00010929473,0.10984617,0.001358108],"about_ca_topic_score_codex":0.0007177065,"about_ca_topic_score_gemma":0.00019502072,"teacher_disagreement_score":0.87770617,"about_ca_system_score_codex":0.0002609655,"about_ca_system_score_gemma":0.00024968004,"threshold_uncertainty_score":0.9997917},"labels":[],"label_agreement":null},{"id":"W2001890237","doi":"10.1109/percomw.2007.9","title":"A New Peer-to-Peer Network","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Routing table; Heuristics; Computer science; Routing (electronic design automation); Routing algorithm; Graph; Peer-to-peer; Table (database); Theoretical computer science; Computer network; Routing protocol; Data mining","score_opus":0.015955250846435585,"score_gpt":0.2683862945177712,"score_spread":0.2524310436713356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001890237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002459342,0.000062979474,0.8890661,0.055798355,0.0011384041,0.00029486613,5.591382e-7,0.002516672,0.048662752],"genre_scores_gemma":[0.088913426,0.0000014639496,0.8272641,0.00738021,0.00065100245,0.000010331958,0.0000014835011,0.00002239,0.07575563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99651885,0.00001943338,0.00036984214,0.0007412218,0.0011154879,0.0012351905],"domain_scores_gemma":[0.9973398,0.00017993909,0.000056695862,0.0015256882,0.0003298722,0.0005680101],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015611424,0.00027514555,0.00026932318,0.00028761948,0.00014367669,0.00029683826,0.0030877702,0.00017884817,0.0000873759],"category_scores_gemma":[0.00035583397,0.00024806758,0.00008861563,0.0026594854,0.000027220576,0.00032507398,0.0016028556,0.00028811328,0.002074585],"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.0000063109746,0.000011833554,0.0006382615,9.620757e-7,0.00001019785,0.00003697388,0.00016833327,0.0012285148,0.00007614953,0.07702114,0.7017066,0.21909475],"study_design_scores_gemma":[0.00022748727,0.0001880648,0.00846958,0.000020830681,0.0000046659075,0.000032709504,0.000038399605,0.0021078554,0.0020868154,0.019397775,0.9669243,0.00050153065],"about_ca_topic_score_codex":0.00016099509,"about_ca_topic_score_gemma":0.00044208585,"teacher_disagreement_score":0.26521772,"about_ca_system_score_codex":0.000109146575,"about_ca_system_score_gemma":0.00010229046,"threshold_uncertainty_score":0.99999714},"labels":[],"label_agreement":null},{"id":"W2003257225","doi":"10.5555/2157848.2157862","title":"Cheat detection and prevention in P2P MOGs","year":2011,"lang":"en","type":"article","venue":"Network and System Support for Games","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Cheating; Computer science; Collusion; Computer security; Server; Peer-to-peer; Computer network; Operating system; Business","score_opus":0.023866332275197574,"score_gpt":0.23400449956772004,"score_spread":0.21013816729252247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003257225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45015988,0.0010386934,0.5417753,0.0002534299,0.0011295812,0.0014530184,0.0000030684548,0.00088123203,0.0033058196],"genre_scores_gemma":[0.9757708,0.000038428654,0.023481237,0.000034686927,0.00009166584,0.00016273822,0.0000016408585,0.0000098574465,0.00040896094],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99883795,0.000036211663,0.00027560102,0.00039174483,0.00011017022,0.00034831284],"domain_scores_gemma":[0.9994688,0.000039810217,0.00007931102,0.0003024211,0.000036346064,0.00007333351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056807994,0.00013916903,0.00023534575,0.00013941692,0.00008894132,0.00006756561,0.0002534556,0.0001270755,0.0000018740493],"category_scores_gemma":[0.000013175992,0.00012773158,0.000037680402,0.0003419575,0.000030042387,0.00023888917,0.00017952427,0.000079157864,0.000004353856],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010364587,0.00005475512,0.045413785,0.0003954223,0.000055801283,0.00003407159,0.002560532,0.00016088605,0.00021199725,0.02983808,0.005893249,0.9152778],"study_design_scores_gemma":[0.0056165666,0.0064336993,0.51816875,0.0021512967,0.00015692395,0.0011093118,0.0026492325,0.26555458,0.0065686908,0.084412046,0.10419236,0.0029865257],"about_ca_topic_score_codex":0.00003308232,"about_ca_topic_score_gemma":0.00017988458,"teacher_disagreement_score":0.9122912,"about_ca_system_score_codex":0.00003773677,"about_ca_system_score_gemma":0.000016986884,"threshold_uncertainty_score":0.52087426},"labels":[],"label_agreement":null},{"id":"W2003261281","doi":"10.1007/s12083-013-0223-5","title":"Peer startup process and initial offset placement in peer-to-peer (P2P) live streaming systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Offset (computer science); Computer science; Joins; Buffer (optical fiber); Peer-to-peer; Computer network; Scheme (mathematics); Real-time computing; Distributed computing; Operating system; Telecommunications; Mathematics","score_opus":0.0196219231650188,"score_gpt":0.28327910681683477,"score_spread":0.26365718365181595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003261281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27926213,0.0008133243,0.51968145,0.17931843,0.0017464547,0.011108594,0.00028987654,0.0024489707,0.0053307707],"genre_scores_gemma":[0.95593286,0.000019984505,0.024838995,0.0018470637,0.001111222,0.006108836,0.00014158654,0.00010099131,0.009898441],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99207705,0.0001425355,0.0011293038,0.00211599,0.00282903,0.0017061146],"domain_scores_gemma":[0.9936175,0.00049156643,0.00028354384,0.0016903459,0.0028576467,0.001059398],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023255232,0.0008347293,0.00086408254,0.00096538546,0.00074734224,0.0017188055,0.0021404317,0.00037839919,0.00002147156],"category_scores_gemma":[0.0005310639,0.0008548647,0.000090703565,0.002972648,0.00015376208,0.000621198,0.0017545761,0.00081897,0.0004921383],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009964979,0.00070282695,0.015435556,0.00027457307,0.0002364946,0.000049122325,0.020195981,0.0741865,0.0005308599,0.014484713,0.50091016,0.37289357],"study_design_scores_gemma":[0.0014277978,0.00066863146,0.009663768,0.000719072,0.00008760709,0.00010312016,0.005131326,0.09884386,0.00029788385,0.004443439,0.87612444,0.0024890774],"about_ca_topic_score_codex":0.0008625682,"about_ca_topic_score_gemma":0.00041683504,"teacher_disagreement_score":0.67667073,"about_ca_system_score_codex":0.00030925285,"about_ca_system_score_gemma":0.00016461303,"threshold_uncertainty_score":0.9993902},"labels":[],"label_agreement":null},{"id":"W2003759373","doi":"10.1007/s00530-012-0271-3","title":"Timelines: simplifying the programming of lag compensation for the next generation of networked games","year":2012,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timeline; Computer science; Lag; Compensation (psychology); Operating system","score_opus":0.14809790380875895,"score_gpt":0.3052987099803776,"score_spread":0.15720080617161866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003759373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029536972,0.0030393559,0.96222657,0.0008876373,0.0018044782,0.002216875,0.000004100099,0.00021688592,0.0000671542],"genre_scores_gemma":[0.912334,0.0000073448673,0.08657116,0.000030498984,0.00062136527,0.00027793992,0.0000069117054,0.000011585356,0.00013915119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866825,0.00008376221,0.00045553522,0.00017688029,0.00030060206,0.00031495374],"domain_scores_gemma":[0.99778754,0.0009379495,0.0003426107,0.00065970136,0.00023213094,0.000040049472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012627054,0.0001300235,0.00022728178,0.00006802649,0.00013569654,0.00009248069,0.0008869317,0.000082791346,7.921372e-7],"category_scores_gemma":[0.0002473406,0.00007565278,0.00007014969,0.00036772867,0.00007979294,0.00027279163,0.00017766858,0.00008351436,0.0000068605677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015513524,0.00007952347,0.003391743,0.00013957258,0.00011819885,2.945172e-7,0.007963794,0.03868025,0.013446776,0.004325728,0.0075636655,0.9242749],"study_design_scores_gemma":[0.00016893249,0.000041050393,0.0005721651,0.000054737164,0.000017677126,0.0000043863315,0.00044122912,0.9866204,0.0021241463,0.000029849592,0.0098338,0.000091614536],"about_ca_topic_score_codex":0.00007073796,"about_ca_topic_score_gemma":0.0000147384735,"teacher_disagreement_score":0.9479402,"about_ca_system_score_codex":0.00003593207,"about_ca_system_score_gemma":0.000028981869,"threshold_uncertainty_score":0.3085031},"labels":[],"label_agreement":null},{"id":"W2004473109","doi":"10.5555/2664633.2664644","title":"Lamoth: A Message Dissemination Middleware for MMOGs in the Cloud","year":2013,"lang":"en","type":"article","venue":"Network and System Support for Games","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cloud computing; Server; Middleware (distributed applications); Distributed computing; Computer network; Operating system","score_opus":0.012993348394215915,"score_gpt":0.24669610421670063,"score_spread":0.2337027558224847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004473109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11109232,0.0019141864,0.85209996,0.0167088,0.0026488574,0.009547956,0.00005600944,0.0013196131,0.004612299],"genre_scores_gemma":[0.97761315,0.000015106164,0.018181955,0.00028925098,0.00034221902,0.0019469935,0.000023083303,0.00001717544,0.0015710802],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983961,0.000056709443,0.00036594286,0.0004256027,0.00021778054,0.0005378483],"domain_scores_gemma":[0.998578,0.00056730263,0.00012257419,0.0005628858,0.00010664709,0.0000625652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024768,0.00019124051,0.00029832285,0.00009315421,0.0001774508,0.00030326014,0.00095262396,0.00013364597,0.0000031232166],"category_scores_gemma":[0.000064005304,0.0001330799,0.000085283624,0.00042076517,0.00003781587,0.00027355348,0.00016481437,0.00009263472,0.0000115388375],"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.00002476085,0.0000575511,0.007525208,0.0004347459,0.00003510979,0.000012013114,0.003984833,0.00036253,0.000033995144,0.15834974,0.66642505,0.16275448],"study_design_scores_gemma":[0.002317648,0.0017454242,0.03191977,0.0015655721,0.00008686059,0.00023107925,0.008645724,0.28419995,0.00040030936,0.051605146,0.615559,0.0017234987],"about_ca_topic_score_codex":0.000014305009,"about_ca_topic_score_gemma":0.00004745775,"teacher_disagreement_score":0.8665208,"about_ca_system_score_codex":0.000042176453,"about_ca_system_score_gemma":0.000024208824,"threshold_uncertainty_score":0.5426841},"labels":[],"label_agreement":null},{"id":"W2004580781","doi":"10.14778/1920841.1921038","title":"Peer coordination through distributed triggers","year":2010,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Ottawa","funders":"","keywords":"Computer science; Consistency (knowledge bases); Distributed computing; Distributed database; Peer-to-peer; Set (abstract data type); Distributed management; Semantics (computer science); Eventual consistency; Database; Data consistency; Programming language; Consistency model","score_opus":0.011311263184876547,"score_gpt":0.23842975324750668,"score_spread":0.22711849006263013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004580781","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6692074,0.00012786822,0.05649957,0.23238716,0.0039571477,0.0024193472,0.0000494913,0.0020738791,0.033278175],"genre_scores_gemma":[0.96089756,0.0000049589353,0.0378172,0.00021251386,0.000056046618,0.000075235235,0.0000014017213,0.000009222846,0.00092584634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835134,0.000003594605,0.00025845037,0.0003443053,0.0007136211,0.00032870905],"domain_scores_gemma":[0.99879795,0.000039193106,0.00020505428,0.00034731562,0.00055714085,0.000053336556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045793047,0.00016086201,0.00017645904,0.00006367295,0.00012827676,0.0001368705,0.0023089931,0.00009275512,0.0000046630153],"category_scores_gemma":[0.00057135185,0.00011295556,0.00009011338,0.0007468763,0.00009835423,0.00046493884,0.0009773175,0.0002908258,0.00001352179],"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.000016675058,0.0001776133,0.0018005676,0.00003421216,0.000053894797,7.9765607e-7,0.0013006884,0.000056773675,0.16423799,0.58127576,0.22838788,0.02265712],"study_design_scores_gemma":[0.00059125456,0.00013193472,0.002982527,0.00004011631,0.000021491604,0.000020087347,0.00016660898,0.00225349,0.7214693,0.04834258,0.22366486,0.0003157622],"about_ca_topic_score_codex":0.000048637605,"about_ca_topic_score_gemma":0.0000051037914,"teacher_disagreement_score":0.5572313,"about_ca_system_score_codex":0.00007512622,"about_ca_system_score_gemma":0.000023526394,"threshold_uncertainty_score":0.46061942},"labels":[],"label_agreement":null},{"id":"W2005223942","doi":"10.1109/mmit.2010.118","title":"Optimal Cooperative Multi-Source Multimedia Transmission Scheduling in Peer-to-Peer Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Communication source; Computer network; Scheduling (production processes); Peer-to-peer; Distributed computing; Scheme (mathematics); Key (lock); Transmission (telecommunications); Selection algorithm; Network congestion; Selection (genetic algorithm); Node (physics); File sharing; Multimedia; The Internet; Telecommunications; Mathematical optimization; Network packet; Computer security; World Wide Web","score_opus":0.016286309121614027,"score_gpt":0.2716703626283741,"score_spread":0.25538405350676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005223942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1377676,0.000036919475,0.8450765,0.014302936,0.00065766805,0.0006022118,0.0000016362468,0.0011709441,0.00038357417],"genre_scores_gemma":[0.42783523,0.0000024456958,0.5688458,0.0007387032,0.00009177715,0.00005621251,0.0000046298014,0.00002472079,0.0024004779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644727,0.000079792095,0.0005222579,0.0010960291,0.0008266961,0.001027979],"domain_scores_gemma":[0.9975482,0.00027290988,0.00007031048,0.0010830399,0.0005536557,0.00047185182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011981098,0.00043565617,0.000432096,0.00049401796,0.00020171858,0.0003559125,0.00255396,0.00044453726,0.000063769694],"category_scores_gemma":[0.0007041103,0.0003800996,0.00009370209,0.0018834635,0.00011130148,0.0005722253,0.00087619765,0.0013872755,0.00023938876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030544055,0.00019673347,0.0011634538,0.0000043949153,0.000020880121,0.00004918148,0.0025568632,0.7693615,0.010481554,0.0012792349,0.0048098336,0.21004584],"study_design_scores_gemma":[0.0007894911,0.00012465965,0.0025157447,0.00004510564,0.000003992048,0.000015764736,0.00015924597,0.96610266,0.009652877,0.00003146405,0.020016681,0.0005423421],"about_ca_topic_score_codex":0.0001342972,"about_ca_topic_score_gemma":0.00041977593,"teacher_disagreement_score":0.29006764,"about_ca_system_score_codex":0.00007437867,"about_ca_system_score_gemma":0.000099998484,"threshold_uncertainty_score":0.9998651},"labels":[],"label_agreement":null},{"id":"W2005330588","doi":"10.1109/srds.2011.21","title":"Partition-Tolerant Distributed Publish/Subscribe Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fault tolerance; Distributed computing; Partition (number theory); Publication; Reliability (semiconductor); Matching (statistics); Computer network; Network partition","score_opus":0.0482634240921697,"score_gpt":0.21483816890585983,"score_spread":0.1665747448136901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005330588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010546388,0.000100454774,0.9633644,0.0026346701,0.0011316318,0.00028368915,0.000015491834,0.002951026,0.018972242],"genre_scores_gemma":[0.9635849,0.0000035602063,0.035189413,0.0003492601,0.000053054056,0.00009779631,0.000012598568,0.000009380992,0.00070002954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835604,0.000040380717,0.00029646317,0.000467963,0.00032686105,0.0005122685],"domain_scores_gemma":[0.99842083,0.00003785563,0.000068609865,0.0011289184,0.00017764494,0.00016612536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029572882,0.00016901667,0.00020141357,0.00014790722,0.00010875488,0.00041022114,0.0019241079,0.00011007976,0.000047832888],"category_scores_gemma":[0.00008883753,0.00014066504,0.000052872765,0.0009654224,0.00005218057,0.0008934504,0.0005967434,0.00014505726,0.0004931004],"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.0000056830654,0.00012795487,0.0027780228,0.000012922377,0.000035369638,0.00007091632,0.0004480412,0.0002385172,0.0001243598,0.7012761,0.288084,0.0067981267],"study_design_scores_gemma":[0.0018051314,0.0010048962,0.074169144,0.0002822207,0.00005252209,0.0003602685,0.0012035496,0.33813268,0.020759108,0.07767011,0.48113117,0.0034292177],"about_ca_topic_score_codex":0.00019875373,"about_ca_topic_score_gemma":0.000049845676,"teacher_disagreement_score":0.9530385,"about_ca_system_score_codex":0.000058567988,"about_ca_system_score_gemma":0.00004017934,"threshold_uncertainty_score":0.6337972},"labels":[],"label_agreement":null},{"id":"W2005916424","doi":"10.4304/jcm.7.8.587-595","title":"Designing P2P Networks Tolerant to Attacks and Faults Based on Bimodal Degree Distribution","year":2012,"lang":"en","type":"article","venue":"Journal of Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Degree (music); Computer science; Degree distribution; Distribution (mathematics); Distributed computing; Computer network; Mathematics; Complex network; World Wide Web; Physics","score_opus":0.057625452487454425,"score_gpt":0.3063750261670883,"score_spread":0.24874957367963385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005916424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020393694,0.00058085215,0.95929074,0.019043813,0.00017791378,0.00013270718,0.0000037813434,0.00007677322,0.00029973336],"genre_scores_gemma":[0.76303875,0.000040120063,0.2363296,0.0005071993,0.0000597028,0.000008355592,0.000003056104,0.0000054970114,0.000007735352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988244,0.0001570662,0.00035928062,0.00010332706,0.0002594316,0.00029645767],"domain_scores_gemma":[0.9975145,0.00049887836,0.00021961787,0.0013324855,0.00021452582,0.00021998596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094653934,0.00011744252,0.00018663667,0.00018129086,0.00027416434,0.000098535515,0.0020985256,0.00007780889,0.0000012796954],"category_scores_gemma":[0.00025543416,0.00010281612,0.000056527377,0.0006022158,0.00005696949,0.00040990827,0.00064170314,0.00042386074,0.000009092933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016744054,0.0011676701,0.039648026,0.0000159708,0.00013787328,0.000015724834,0.0023386343,0.21380654,0.0018898654,0.047139242,0.05122905,0.64244395],"study_design_scores_gemma":[0.0010482878,0.0009800104,0.19706675,0.0005513291,0.000058951093,0.0001710476,0.00018502711,0.72707576,0.0014883461,0.0013511808,0.06941159,0.00061170966],"about_ca_topic_score_codex":0.000005953858,"about_ca_topic_score_gemma":0.000010905332,"teacher_disagreement_score":0.742645,"about_ca_system_score_codex":0.00011631049,"about_ca_system_score_gemma":0.000050502542,"threshold_uncertainty_score":0.41927195},"labels":[],"label_agreement":null},{"id":"W2005930142","doi":"10.1007/s12083-008-0025-3","title":"XCube: Processing XPath queries in a hypercube overlay network","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Bit array; Information retrieval; XPath; Identifier; XML; Node (physics); Matching (statistics); Data mining; Database; XML database; World Wide Web; Computer network","score_opus":0.013718367285484636,"score_gpt":0.26826220524935623,"score_spread":0.2545438379638716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005930142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02372689,0.0016597419,0.8670215,0.09603711,0.00045679533,0.0021694559,0.000012386409,0.0023174325,0.006598655],"genre_scores_gemma":[0.83761686,0.00004489775,0.15361878,0.0053556967,0.0011691618,0.0008094061,0.000016580103,0.000041223346,0.0013273784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99587554,0.00006375321,0.00062476617,0.0013246171,0.00082025706,0.0012910854],"domain_scores_gemma":[0.99758565,0.00016893045,0.00013889841,0.0012784107,0.0003605776,0.00046752035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011038216,0.00047903616,0.00053196534,0.00043278813,0.0006204255,0.00072881824,0.0017428504,0.00022358603,0.0000028516868],"category_scores_gemma":[0.00012324771,0.00049806555,0.000076007236,0.004440742,0.0000806164,0.0003799765,0.00055842235,0.0005261104,0.00009282489],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019956919,0.00013220511,0.0041641016,0.00001575249,0.000013792294,0.000015332045,0.0015505775,0.03434463,0.00033857522,0.027055174,0.054515135,0.8778348],"study_design_scores_gemma":[0.00034617973,0.00023063207,0.03250479,0.0003058003,0.000020879614,0.000055483502,0.00014110465,0.020877108,0.00012913083,0.02500873,0.9193167,0.0010634277],"about_ca_topic_score_codex":0.000051995194,"about_ca_topic_score_gemma":0.00013017273,"teacher_disagreement_score":0.87677133,"about_ca_system_score_codex":0.00015562489,"about_ca_system_score_gemma":0.0001088307,"threshold_uncertainty_score":0.9997471},"labels":[],"label_agreement":null},{"id":"W2006128896","doi":"10.1145/1877891.1877905","title":"An analytical approach to model adaptive video streaming and delivery","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Peer-to-peer; Bandwidth (computing); Quality of service; Key (lock); Computer network; Distributed computing; Resource (disambiguation); Resource allocation; Multimedia; Computer security","score_opus":0.031147046522107185,"score_gpt":0.2575221977011914,"score_spread":0.22637515117908422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006128896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30033132,0.000004526486,0.69230217,0.00062579743,0.000037604652,0.00011310832,0.0000012541085,0.00045915975,0.0061250753],"genre_scores_gemma":[0.54020274,5.1020726e-7,0.45931333,0.00032320464,0.000017563863,0.000009379691,3.6554644e-7,0.0000043884165,0.00012850252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986866,0.000013833529,0.0001342236,0.00059493125,0.00022621283,0.00034417576],"domain_scores_gemma":[0.9988031,0.000050085422,0.000018957591,0.00079979515,0.0000804575,0.00024765398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021457052,0.00014519689,0.00015563874,0.00018706551,0.00008407147,0.00018409638,0.00109741,0.00011050953,0.0000017067186],"category_scores_gemma":[0.00005069405,0.00012442168,0.000023443716,0.00044855854,0.00006248205,0.00047476348,0.00075473846,0.0002450644,0.00001877471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016893835,0.00019208484,0.0008556419,0.0000040455043,0.000026396034,0.000010998068,0.00087447936,0.03575102,0.005761773,0.68451846,0.0049070152,0.2670812],"study_design_scores_gemma":[0.000069525086,0.00010256516,0.0012090176,0.0000027222425,0.000003858273,0.000009606216,0.00009085893,0.993151,0.00074941927,0.0042974153,0.0001291675,0.00018481161],"about_ca_topic_score_codex":0.00005750242,"about_ca_topic_score_gemma":0.00008996437,"teacher_disagreement_score":0.9574,"about_ca_system_score_codex":0.000020189344,"about_ca_system_score_gemma":0.000039095787,"threshold_uncertainty_score":0.5073769},"labels":[],"label_agreement":null},{"id":"W2007087980","doi":"10.1109/jproc.2007.909921","title":"Opportunities and Challenges of Peer-to-Peer Internet Video Broadcast","year":2007,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":373,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Software deployment; Popularity; Peer-to-peer; The Internet; Download; Multicast; Multimedia; World Wide Web; Computer network","score_opus":0.06150306279221872,"score_gpt":0.2596840374688465,"score_spread":0.19818097467662776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007087980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90214515,0.0009844186,0.0040440788,0.07766321,0.000673072,0.0004283296,0.00000614178,0.00036468104,0.013690909],"genre_scores_gemma":[0.9780069,0.00015280102,0.018996734,0.00031515313,0.000068572284,0.000011144531,9.4177175e-8,0.000015354904,0.0024332388],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981598,0.0000042252586,0.00035793005,0.0003638482,0.00074214174,0.00037205106],"domain_scores_gemma":[0.9984341,0.00009002512,0.00021904333,0.0003125451,0.00082714285,0.00011708967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001334113,0.00018868894,0.00028583442,0.00028830595,0.000046915975,0.00007181127,0.002197882,0.00010539274,0.0000018522345],"category_scores_gemma":[0.0004417766,0.00014528583,0.00006313886,0.0004267427,0.00018819759,0.00033987913,0.0011988585,0.00017192982,0.000004749384],"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.00010689794,0.00017082496,0.003295384,0.0005046114,0.00013570118,0.000008024029,0.018429155,0.000023715194,0.039408486,0.2827954,0.1237069,0.5314149],"study_design_scores_gemma":[0.0005904453,0.0009116176,0.018233862,0.0008082822,0.000043560904,0.00013451495,0.0059255227,0.0010610024,0.7373534,0.020019576,0.21411148,0.00080674264],"about_ca_topic_score_codex":0.00003326135,"about_ca_topic_score_gemma":0.000013468558,"teacher_disagreement_score":0.69794494,"about_ca_system_score_codex":0.000034126824,"about_ca_system_score_gemma":0.000022502638,"threshold_uncertainty_score":0.5924584},"labels":[],"label_agreement":null},{"id":"W2007377721","doi":"10.1007/s11235-014-9872-9","title":"Delay and capacity analysis of structured P2P overlay for lookup service","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","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; Overlay; Overlay network; Computer network; Chord (peer-to-peer); Session (web analytics); Queueing theory; Telephony; Service (business); Set (abstract data type); Voice over IP; Distributed computing; Operating system; The Internet","score_opus":0.026995648221897484,"score_gpt":0.2590519572022861,"score_spread":0.2320563089803886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007377721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35588938,0.0003141276,0.641111,0.0013762572,0.00012881192,0.00045913903,0.000019148758,0.00031338245,0.00038874862],"genre_scores_gemma":[0.9255304,0.000013022966,0.07415351,0.00016354634,0.000015853027,0.00007196752,0.000014275407,0.000007362456,0.000030082118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987614,0.00017443484,0.00039770125,0.0002810789,0.00019192144,0.0001934749],"domain_scores_gemma":[0.99661577,0.00041928096,0.00029209538,0.0022766818,0.00033710428,0.000059058428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411009,0.00012729508,0.0003950008,0.00035088178,0.000114381204,0.000097545795,0.0019258534,0.00011163494,0.0000010858987],"category_scores_gemma":[0.00013622058,0.000119900884,0.000061950486,0.0015593821,0.00004170823,0.00018889659,0.00047011755,0.00010043437,0.0000033649756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067702844,0.00024268196,0.03906867,0.0007474073,0.0035775711,5.631909e-7,0.011145948,0.09947235,0.029453939,0.653127,0.008309132,0.154787],"study_design_scores_gemma":[0.00035030578,0.00009520334,0.03661897,0.00004227863,0.00016881837,0.0000068101645,0.0001229143,0.93420357,0.0014908123,0.0016093252,0.024998995,0.00029202236],"about_ca_topic_score_codex":0.00055835955,"about_ca_topic_score_gemma":0.00078673556,"teacher_disagreement_score":0.8347312,"about_ca_system_score_codex":0.00004572745,"about_ca_system_score_gemma":0.000016755004,"threshold_uncertainty_score":0.48894164},"labels":[],"label_agreement":null},{"id":"W2008256915","doi":"10.1145/2457276.2457290","title":"Near real-time medical data dissemination in m-Health","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Boom; Wireless; Computer science; Health care; Dissemination; Latency (audio); Mobile device; Healthcare delivery; Computer network; Mobile telephony; Wireless sensor network; Mobile computing; Health professionals; Internet privacy; Telecommunications; Mobile radio; Business; World Wide Web; Engineering","score_opus":0.028692774716361138,"score_gpt":0.33829939362303035,"score_spread":0.30960661890666924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008256915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08646335,0.00040461455,0.7269175,0.15822835,0.00084892666,0.00062501454,0.0000106608295,0.0031120337,0.023389518],"genre_scores_gemma":[0.666086,0.00008509932,0.33137795,0.00096464506,0.00010583239,0.000012653518,0.00003587025,0.000009997897,0.0013218941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847525,0.000057676407,0.0002351518,0.00030597634,0.00047395556,0.0004519639],"domain_scores_gemma":[0.99824274,0.00016473175,0.000045416065,0.0013246567,0.000017512193,0.00020494958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018221355,0.00008258329,0.0001318602,0.00010418381,0.00004981638,0.00006255068,0.0025994692,0.00008852691,0.00008148922],"category_scores_gemma":[0.00041284584,0.000070318536,0.000008980207,0.0006680889,0.000039212464,0.0007528457,0.0019048436,0.00014124304,0.00040559773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018629315,0.00013995731,0.007374161,0.0000114150525,0.000004068295,0.000007875092,0.0006473237,0.0000117015925,0.00008803727,0.039067898,0.30186704,0.65077865],"study_design_scores_gemma":[0.00027706687,0.0001223874,0.082913205,0.00016895279,0.000001770021,0.000042642365,0.00007195614,0.8132359,0.0003545496,0.0019113007,0.100451194,0.00044912065],"about_ca_topic_score_codex":0.00023549775,"about_ca_topic_score_gemma":0.00009365581,"teacher_disagreement_score":0.81322414,"about_ca_system_score_codex":0.0000705495,"about_ca_system_score_gemma":0.00010288937,"threshold_uncertainty_score":0.5213274},"labels":[],"label_agreement":null},{"id":"W2008734256","doi":"10.1109/wowmom.2010.5534905","title":"P2P overlay topology control in MANETs","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Network topology; Overlay; Topology control; Distributed computing; Mobile ad hoc network; Logical topology; Overlay network; Topology (electrical circuits); The Internet; File sharing; Wireless; Peer-to-peer; Wireless network; Telecommunications; Network packet; World Wide Web; Key distribution in wireless sensor networks; Engineering","score_opus":0.004639330134915749,"score_gpt":0.22905808633640143,"score_spread":0.2244187562014857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008734256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38822567,0.00004829448,0.4873601,0.06494663,0.0023835942,0.00045596494,0.0000018565996,0.0019547853,0.05462309],"genre_scores_gemma":[0.9367422,0.0000013252546,0.059276108,0.0029524928,0.00004043917,0.000020211806,2.5539777e-7,0.000004310952,0.0009626744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899065,0.00002019291,0.00015439665,0.00032935562,0.00012931302,0.00037605915],"domain_scores_gemma":[0.99902755,0.000113757946,0.000026811935,0.0007441245,0.000027651167,0.00006009244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021421752,0.00010223447,0.00015410833,0.000176214,0.000028795112,0.000053645872,0.001383526,0.00014291567,0.00007792628],"category_scores_gemma":[0.000097375996,0.00008832453,0.000024580275,0.00035426352,0.000060904382,0.00016254172,0.00036653626,0.00029814307,0.00029213884],"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.000008951,0.00006942461,0.015130229,0.0000024023198,0.000009442582,0.00012041135,0.00014887746,0.00014742672,0.014276256,0.81201565,0.040620904,0.117450014],"study_design_scores_gemma":[0.0034801492,0.0005460863,0.20990935,0.000017694645,0.000006859796,0.00025433878,0.00006999097,0.14953133,0.015514947,0.15299484,0.466391,0.0012834182],"about_ca_topic_score_codex":0.00013082755,"about_ca_topic_score_gemma":0.0015936409,"teacher_disagreement_score":0.65902084,"about_ca_system_score_codex":0.00001745585,"about_ca_system_score_gemma":0.000025488851,"threshold_uncertainty_score":0.3754951},"labels":[],"label_agreement":null},{"id":"W2009297362","doi":"10.1109/ccece.2012.6334883","title":"Real-time distributed computing: ChoPS","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"York University; McGill University","keywords":"Chord (peer-to-peer); Computer science; Dissemination; Unicast; Publication; The Internet; Hash function; Hash table; Computer network; World Wide Web; Telecommunications; Network packet; Computer security","score_opus":0.014549472611410702,"score_gpt":0.24984015774426463,"score_spread":0.23529068513285392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009297362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08504958,0.000036842503,0.8818568,0.005110107,0.0004774929,0.00018527922,0.0000047438766,0.0043890825,0.022890095],"genre_scores_gemma":[0.7621973,0.0000035160608,0.23624776,0.00028220218,0.00012605502,0.000004995953,0.000007949249,0.000008764087,0.0011214177],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856615,0.000030321915,0.00018757625,0.00029261663,0.00025087237,0.0006724552],"domain_scores_gemma":[0.99871457,0.0001037621,0.000050206323,0.0008797068,0.000058774345,0.00019300178],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003420904,0.0001503384,0.00017136153,0.00009657644,0.00010023008,0.00010941499,0.0014718819,0.000088729714,0.000039182818],"category_scores_gemma":[0.000085395324,0.00012955956,0.000045266024,0.00081561465,0.000038797043,0.00037577224,0.001140076,0.000120203826,0.0014881566],"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.000005843756,0.00025714454,0.0136878565,0.000009318072,0.00004877974,0.000016973023,0.0006255542,0.00050621247,0.0073938323,0.25046074,0.5932718,0.13371591],"study_design_scores_gemma":[0.0011585258,0.00038510872,0.26750132,0.00008111037,0.000027977921,0.00018126963,0.00013076178,0.27418104,0.040892154,0.010286517,0.40267268,0.0025015345],"about_ca_topic_score_codex":0.000034525794,"about_ca_topic_score_gemma":0.0000015735717,"teacher_disagreement_score":0.67714775,"about_ca_system_score_codex":0.00007061421,"about_ca_system_score_gemma":0.000019211222,"threshold_uncertainty_score":0.9992893},"labels":[],"label_agreement":null},{"id":"W2009396504","doi":"10.1145/2488222.2488278","title":"Grand challenge","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stream processing; Implementation; Workload; Complex event processing; Event (particle physics); Throughput; Real-time computing; Embedded system; Operating system; Software engineering; Process (computing)","score_opus":0.01501890503334131,"score_gpt":0.21976133697679806,"score_spread":0.20474243194345676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009396504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0264973,0.00019002543,0.7505654,0.07299964,0.00037563304,0.00034005672,2.09352e-7,0.002947887,0.14608382],"genre_scores_gemma":[0.8408533,0.0000146585635,0.15478474,0.00095870456,0.000031174135,0.000051102445,1.4450622e-7,0.000004345563,0.0033018785],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999306,0.000007881737,0.00008252018,0.00022787167,0.00013642343,0.00023926015],"domain_scores_gemma":[0.9992569,0.000028543678,0.000014108599,0.00059381756,0.000043300366,0.000063291634],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006759259,0.00007347519,0.0000773615,0.00007419323,0.000040455914,0.000117703115,0.0011126205,0.000045721372,0.00007854194],"category_scores_gemma":[0.000022884833,0.000056968882,0.00002139524,0.00026812794,0.000020152864,0.00032076353,0.000486686,0.00006663298,0.0024311065],"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":[3.3650412e-7,0.000031410662,0.00015472267,0.00000258882,0.0000070843225,0.0000057605857,0.0002091187,0.000020704892,0.0002703344,0.24354026,0.22997373,0.52578396],"study_design_scores_gemma":[0.0007918505,0.0005761499,0.02034886,0.00003366839,0.000004506456,0.000036332585,0.00012947395,0.05205875,0.011938152,0.3939221,0.51895356,0.0012066124],"about_ca_topic_score_codex":0.000045736317,"about_ca_topic_score_gemma":0.000022153985,"teacher_disagreement_score":0.81435597,"about_ca_system_score_codex":0.000011592138,"about_ca_system_score_gemma":0.000007897619,"threshold_uncertainty_score":0.9983456},"labels":[],"label_agreement":null},{"id":"W2010103336","doi":"10.1145/1326320.1326330","title":"The production of peer-to-peer video-streaming networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Peer-to-peer; Video streaming; Production (economics); Computer network; Multimedia","score_opus":0.013171446689660896,"score_gpt":0.25591513151066664,"score_spread":0.24274368482100575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010103336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03792185,0.00011639911,0.9095945,0.043188673,0.0018898908,0.00042550315,3.8166897e-7,0.0009017196,0.0059611076],"genre_scores_gemma":[0.86604047,0.000008459054,0.11961037,0.00043514202,0.00026374334,0.000019323954,9.0249995e-7,0.000014043646,0.013607573],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752706,0.00003057372,0.0004091241,0.0005280692,0.0008504583,0.00065472955],"domain_scores_gemma":[0.9974045,0.00032517055,0.00011269845,0.0013831483,0.000654686,0.00011979968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027275244,0.00018260287,0.00018308699,0.00020295905,0.00024617874,0.00015083156,0.0019030398,0.00011516068,0.000003486031],"category_scores_gemma":[0.0013312189,0.00012765669,0.000064538755,0.0016988277,0.000093805764,0.00027569523,0.00082401745,0.00024487128,0.000050132112],"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.000023292803,0.000049157647,0.0015958751,0.000004772706,0.000029991003,0.000009103136,0.0004928642,0.011161421,0.0017523634,0.049325414,0.16882327,0.76673245],"study_design_scores_gemma":[0.0004015407,0.0007375434,0.053395297,0.000186342,0.000030430736,0.000111985966,0.0011917102,0.05783885,0.122341156,0.010347055,0.75208586,0.0013322374],"about_ca_topic_score_codex":0.00006053468,"about_ca_topic_score_gemma":0.00029772724,"teacher_disagreement_score":0.8281186,"about_ca_system_score_codex":0.00007904713,"about_ca_system_score_gemma":0.00003304354,"threshold_uncertainty_score":0.52056885},"labels":[],"label_agreement":null},{"id":"W2010701513","doi":"10.1109/cns.2014.6997484","title":"Location verification on the Internet: Towards enforcing location-aware access policies over Internet clients","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"The Internet; Computer science; Internet privacy; Internet transit; Computer security; Internet access; Computer network; World Wide Web","score_opus":0.03342929219187073,"score_gpt":0.29444410798609433,"score_spread":0.2610148157942236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010701513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1015204,0.000013641918,0.8827185,0.008073718,0.0004690135,0.0003013979,5.1326265e-7,0.0006511916,0.0062516425],"genre_scores_gemma":[0.9924343,0.0000041934827,0.0019453816,0.003641575,0.00009071426,0.000084166095,0.000006861533,0.000013371802,0.0017794413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984196,0.00007665074,0.0003016599,0.00046890485,0.0004184438,0.00031476695],"domain_scores_gemma":[0.99818987,0.00015615171,0.00014475714,0.0011976326,0.00025045278,0.00006113712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049708923,0.00019493322,0.00014061047,0.00022813713,0.00009223247,0.00062591524,0.0031121813,0.0000996965,0.000030818373],"category_scores_gemma":[0.000350462,0.00013791722,0.000038045164,0.0010356407,0.0000716932,0.00067128224,0.0008781306,0.00018254001,0.00031943346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015121082,0.00007778331,0.005427588,0.00002936809,0.000031205785,4.3407803e-7,0.0022946652,0.0061956584,0.00011639469,0.74105847,0.054701436,0.1900519],"study_design_scores_gemma":[0.00028415272,0.00024884645,0.13903232,0.00025609374,0.000009313867,0.0000043782684,0.00018686285,0.7890112,0.033310838,0.006881656,0.030260306,0.00051407923],"about_ca_topic_score_codex":0.0009194414,"about_ca_topic_score_gemma":0.00015359084,"teacher_disagreement_score":0.8909139,"about_ca_system_score_codex":0.00017618435,"about_ca_system_score_gemma":0.000047913225,"threshold_uncertainty_score":0.60357153},"labels":[],"label_agreement":null},{"id":"W2010769520","doi":"10.1109/comst.2007.4317616","title":"A survey of application-layer multicast protocols","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":280,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; IP multicast; Computer network; Application layer; Protocol Independent Multicast; Software deployment; The Internet; Popularity; Layer (electronics); Xcast; Distributed computing; Source-specific multicast; World Wide Web; Software engineering","score_opus":0.13088292434858398,"score_gpt":0.39296848927671096,"score_spread":0.26208556492812696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010769520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009337525,0.00011448875,0.97821975,0.00087143737,0.00063967047,0.008767212,0.00007061157,0.00070205866,0.0012772272],"genre_scores_gemma":[0.8614184,0.000014625143,0.13415548,0.00006714389,0.00009425094,0.004090248,0.000033342825,0.000024897476,0.00010160874],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9952856,0.0019082795,0.0011647887,0.0005395446,0.0005627898,0.00053903396],"domain_scores_gemma":[0.9854764,0.0042730835,0.0004917939,0.008263923,0.0013332621,0.00016155776],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.019580314,0.0002576251,0.00051574124,0.00036977592,0.0002664378,0.00012704721,0.00846946,0.00021836338,0.0000042769025],"category_scores_gemma":[0.0025939029,0.00026436834,0.0000841969,0.0026758083,0.00034779732,0.0003580223,0.0015494043,0.00031114218,0.00016802958],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009351978,0.0031484081,0.110943004,0.000096329495,0.00033502717,0.0000068694403,0.0026914927,0.00096460734,0.14305194,0.10238375,0.022038942,0.61424613],"study_design_scores_gemma":[0.0012976011,0.0002870762,0.80939656,0.00014647825,0.000022076834,0.000010013846,0.000055609784,0.008034958,0.07723733,0.0033582235,0.09898825,0.0011658357],"about_ca_topic_score_codex":0.0020336458,"about_ca_topic_score_gemma":0.0042076916,"teacher_disagreement_score":0.8520809,"about_ca_system_score_codex":0.00013612896,"about_ca_system_score_gemma":0.00021829583,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W2010814394","doi":"10.1016/j.jnca.2012.10.005","title":"A SIP servlets-based framework for service provisioning in stand-alone MANETs","year":2012,"lang":"en","type":"article","venue":"Journal of Network and Computer 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":"Concordia University","funders":"","keywords":"Computer science; Computer network; Provisioning; Mobile ad hoc network; Overlay network; Distributed computing; Wireless ad hoc network; Service (business); Wireless; The Internet; Operating system","score_opus":0.021277740252270836,"score_gpt":0.28458267783679275,"score_spread":0.2633049375845219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010814394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009260133,0.0016958273,0.98161227,0.0065281,0.00023578723,0.0005450832,0.0000018564225,0.000090901514,0.000030022526],"genre_scores_gemma":[0.31113988,0.000025962448,0.68628097,0.0016651666,0.00076993863,0.00010086682,0.0000012778453,0.000011139417,0.0000048068837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851215,0.00004276161,0.00049008266,0.00023372234,0.00023722109,0.00048403573],"domain_scores_gemma":[0.998347,0.00048469813,0.00029926063,0.0004464816,0.0002252368,0.00019736437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723209,0.00016782976,0.00030612337,0.00019287653,0.00016362562,0.00015091772,0.0009432482,0.00012462371,9.274101e-7],"category_scores_gemma":[0.000014245917,0.00015152011,0.000064585714,0.0011025356,0.000023408766,0.00034803487,0.00028951233,0.00032971354,0.0000046622654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104907536,0.00058346154,0.014507457,0.00016512815,0.00009437734,0.000011757697,0.0012608008,0.13354918,0.000053293188,0.31499472,0.017732974,0.51694196],"study_design_scores_gemma":[0.0018404708,0.00070325343,0.048204377,0.0009155563,0.000055933662,0.00020773476,0.000065815104,0.5610215,0.00013274682,0.16214272,0.22390842,0.0008014493],"about_ca_topic_score_codex":0.000002739475,"about_ca_topic_score_gemma":0.0000056821204,"teacher_disagreement_score":0.5161405,"about_ca_system_score_codex":0.00006091792,"about_ca_system_score_gemma":0.0000783181,"threshold_uncertainty_score":0.6178811},"labels":[],"label_agreement":null},{"id":"W2011064078","doi":"10.1109/tnsm.2014.2360772","title":"Pushing Server Bandwidth Consumption to the Limit: Modeling and Analysis of Peer-Assisted VoD","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Bandwidth (computing); Server; Software deployment; Computer network; Peer-to-peer; Scheduling (production processes); The Internet; Schedule; Distributed computing; Bandwidth allocation; Operating system; Mathematical optimization","score_opus":0.02515554765593984,"score_gpt":0.23964420823562269,"score_spread":0.21448866057968285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011064078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10489082,0.000043616245,0.8830253,0.0110482,0.00022691209,0.00031056086,0.000003124217,0.00018030105,0.00027116042],"genre_scores_gemma":[0.971391,0.00021393236,0.025544444,0.0026527422,0.000025343725,0.00005828176,0.0000024901997,0.000010390028,0.000101376434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984198,0.000088809065,0.00029599367,0.00048813864,0.00038659762,0.00032062348],"domain_scores_gemma":[0.99884367,0.00010989318,0.000059919625,0.0007674154,0.0001178629,0.00010126281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007571745,0.00019290383,0.0002825624,0.00038318158,0.00033326002,0.00019530882,0.00062937476,0.000069582,0.0000033151375],"category_scores_gemma":[0.0000027218612,0.00015805688,0.00007386063,0.0020378057,0.000020257738,0.00017063695,0.00005469545,0.00016258539,0.0000088500965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001707682,0.000031060365,0.00008295457,0.000034100955,0.0003448423,9.622871e-7,0.00037851394,0.83232385,0.000007148066,0.0012846156,0.00014641802,0.16534844],"study_design_scores_gemma":[0.00021587405,0.000077738594,0.006981137,0.00006465461,0.00047683835,0.0000015659089,0.000093945055,0.98927164,0.000029246648,0.00026282482,0.0023395063,0.00018503283],"about_ca_topic_score_codex":0.00010719239,"about_ca_topic_score_gemma":0.0029147232,"teacher_disagreement_score":0.8665002,"about_ca_system_score_codex":0.000031650543,"about_ca_system_score_gemma":0.0000048735396,"threshold_uncertainty_score":0.64453727},"labels":[],"label_agreement":null},{"id":"W2011705691","doi":"10.1109/vtcspring.2013.6692488","title":"ConProVA: A Smart Context Provisioning Middleware for VANET Applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Middleware (distributed applications); Vehicular ad hoc network; Provisioning; Context (archaeology); Computer security; Intelligent transportation system; Context awareness; Wireless ad hoc network; Computer network; Distributed computing; Telecommunications; Transport engineering; Phone; Engineering; Wireless","score_opus":0.01608678577254328,"score_gpt":0.23791023603570507,"score_spread":0.2218234502631618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011705691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019257896,0.00009296279,0.981944,0.008390933,0.00010914048,0.0023545,0.000003963604,0.0013946433,0.0037840249],"genre_scores_gemma":[0.51613283,0.0000018116386,0.4739438,0.0018599302,0.000044812256,0.0037655148,0.000006717986,0.00001250927,0.004232076],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876845,0.0000107067,0.00021803634,0.00046782868,0.00015675001,0.00037825733],"domain_scores_gemma":[0.99857306,0.00018732768,0.000058645353,0.0008390512,0.0002419289,0.00009998719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013891137,0.00013991626,0.00016105443,0.00010740954,0.00017047187,0.00026230756,0.0013421888,0.00008249506,0.000028436607],"category_scores_gemma":[0.000085649444,0.000117442534,0.00004943272,0.00041667945,0.000045981164,0.0003759109,0.00046021168,0.00009257181,0.0006003231],"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.0000015127946,0.00004078968,0.00034652394,0.000015983458,0.0000144522455,6.3559315e-7,0.00012731236,0.000041184125,0.0006019446,0.18112822,0.09287484,0.7248066],"study_design_scores_gemma":[0.000546171,0.00028994243,0.0010558014,0.000039007376,0.000007726633,0.000017005226,0.00037258104,0.081050955,0.0061862106,0.05358965,0.85628086,0.0005640631],"about_ca_topic_score_codex":0.000091548456,"about_ca_topic_score_gemma":0.00006644682,"teacher_disagreement_score":0.76340604,"about_ca_system_score_codex":0.000036575362,"about_ca_system_score_gemma":0.000047565187,"threshold_uncertainty_score":0.7716139},"labels":[],"label_agreement":null},{"id":"W2012785069","doi":"10.1109/cdc.2011.6161171","title":"A game-theoretic approach to rule sharing mechanism in networked intrusion detection systems: Robustness, incentives and security","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intrusion detection system; Computer science; Robustness (evolution); Incentive; Scalability; Nash equilibrium; Game theory; Network security; Computer security; Data mining; Mathematical optimization; Database","score_opus":0.018942738853312838,"score_gpt":0.20980557190310184,"score_spread":0.19086283304978902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012785069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38632774,0.00007031527,0.61054003,0.00004498739,0.00021196264,0.00042338486,2.8966406e-7,0.00051582797,0.0018654421],"genre_scores_gemma":[0.93875855,0.000018370869,0.060942788,0.000058473463,0.000032815635,0.00012762153,6.4377184e-7,0.000013133957,0.000047575715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981792,0.0000843108,0.0002907433,0.0007584633,0.00022346177,0.00046379608],"domain_scores_gemma":[0.9990743,0.000032904827,0.00007091557,0.0006398642,0.000060305985,0.000121745536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309624,0.00021034486,0.00026088746,0.00036676874,0.00009238784,0.00018661487,0.001041962,0.00015927172,0.0000025653028],"category_scores_gemma":[0.000052527346,0.00019024756,0.000025740885,0.0010843051,0.000053458243,0.00042815012,0.0018330067,0.00022877142,0.000010658896],"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.0000811654,0.00027823745,0.0025936216,0.00017245309,0.000029924528,0.000026957676,0.009356122,0.010856498,0.0010411304,0.92714727,0.00009335751,0.048323255],"study_design_scores_gemma":[0.00024245794,0.000111249145,0.0016917534,0.00013089472,0.0000048691736,0.00002890155,0.000519756,0.92573434,0.003289321,0.06787137,0.000043441494,0.00033164534],"about_ca_topic_score_codex":0.00028052492,"about_ca_topic_score_gemma":0.00011281298,"teacher_disagreement_score":0.91487783,"about_ca_system_score_codex":0.00011344861,"about_ca_system_score_gemma":0.0000140244465,"threshold_uncertainty_score":0.775807},"labels":[],"label_agreement":null},{"id":"W2013059169","doi":"10.1145/1544012.1544031","title":"Maintaining replicas in unstructured P2P systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Replication (statistics); Distributed computing; Probabilistic logic; Crash; Load balancing (electrical power); Peer-to-peer; Node (physics); Directory; Computer network; Service (business); Theoretical computer science; Operating system","score_opus":0.023547908587159407,"score_gpt":0.23838697311527193,"score_spread":0.21483906452811252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013059169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35270452,0.00021997522,0.6104821,0.0050193537,0.00080235023,0.00046167383,8.9253433e-7,0.002912941,0.027396211],"genre_scores_gemma":[0.9095937,0.000007433548,0.08923691,0.00032694783,0.00004206151,0.00002530498,4.6073583e-7,0.000007066722,0.0007601412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986081,0.000033533895,0.0002490938,0.0004679254,0.00024120446,0.00040013154],"domain_scores_gemma":[0.9987451,0.00006283995,0.0000460575,0.001037469,0.000038437316,0.000070089125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024554066,0.00012790454,0.00019235478,0.0002420425,0.00007725303,0.0000696855,0.001324437,0.000097684046,0.000004800367],"category_scores_gemma":[0.000100106314,0.00011135257,0.000028039065,0.0009658263,0.00004803197,0.0002014368,0.00055721914,0.0001788078,0.000072837865],"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.000012936324,0.000049752725,0.025851326,0.000015500209,0.000026355938,0.0012801673,0.0017373317,0.019194635,0.0015672441,0.8479184,0.04933869,0.053007655],"study_design_scores_gemma":[0.0027172752,0.000770942,0.10840212,0.0003423463,0.000008664625,0.005597476,0.0014712393,0.68562084,0.017060822,0.0421336,0.13274164,0.0031330185],"about_ca_topic_score_codex":0.0001697185,"about_ca_topic_score_gemma":0.00004291243,"teacher_disagreement_score":0.8057848,"about_ca_system_score_codex":0.00009659666,"about_ca_system_score_gemma":0.000044581564,"threshold_uncertainty_score":0.4540826},"labels":[],"label_agreement":null},{"id":"W2013877714","doi":"10.1109/lcn.2008.4664144","title":"Distributed search revisited: Resolving the conflict of flexibility and efficiency","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Peer-to-peer; XML; Overlay network; Bandwidth (computing); Distributed data store; Population; Shared resource; World Wide Web; Computer network; The Internet","score_opus":0.06149806376840947,"score_gpt":0.29225631130618623,"score_spread":0.23075824753777677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013877714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5579086,0.00049983273,0.43582392,0.0033512812,0.000036852678,0.00027227815,0.0000067900182,0.00040471795,0.001695716],"genre_scores_gemma":[0.9820318,0.000055071574,0.017574593,0.00015743698,0.000010619118,0.0000047432554,0.0000011632369,0.0000031733277,0.00016138432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998713,0.000072782816,0.00022768768,0.00036589408,0.00033134376,0.00028927848],"domain_scores_gemma":[0.9983814,0.00030547217,0.000042307798,0.0010683766,0.00014289496,0.000059543512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007680423,0.00009980404,0.00016798513,0.00007335907,0.00020544122,0.000045829667,0.0012790344,0.000054858247,0.000006161783],"category_scores_gemma":[0.00034685276,0.000063576015,0.000033249085,0.00101858,0.00032912337,0.00012845002,0.0010605054,0.00016769097,0.000009117379],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111093745,0.00062891364,0.20031855,0.00023361832,0.00013483141,0.0001784164,0.011795078,0.005299889,0.01628674,0.46975073,0.09473471,0.20052744],"study_design_scores_gemma":[0.0009877235,0.0008437257,0.53079396,0.00015712014,0.000016482525,0.00031502167,0.0004750306,0.37233502,0.054557152,0.0042289374,0.034355633,0.00093415455],"about_ca_topic_score_codex":0.00007776088,"about_ca_topic_score_gemma":0.0000053197987,"teacher_disagreement_score":0.46552178,"about_ca_system_score_codex":0.000025623454,"about_ca_system_score_gemma":0.000042741638,"threshold_uncertainty_score":0.25925547},"labels":[],"label_agreement":null},{"id":"W2014161917","doi":"10.1109/3pgcic.2012.45","title":"Multi-server MMO Middleware: Unlocked","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria","keywords":"Server; Computer science; Overhead (engineering); Middleware (distributed applications); Consistency (knowledge bases); Distributed computing; Synchronization (alternating current); Computer network; Client; Client–server model; Operating system","score_opus":0.04389923985517201,"score_gpt":0.26757770141250353,"score_spread":0.2236784615573315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014161917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10591531,0.00048298403,0.8769276,0.0064688334,0.0012827924,0.00029496892,0.0000016061753,0.0031797735,0.005446094],"genre_scores_gemma":[0.5855971,0.0000040448017,0.40873674,0.0010562285,0.0000648365,0.000019168703,8.750237e-7,0.000008072223,0.0045129247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858475,0.000027103522,0.00017088247,0.00031095545,0.000262991,0.00064332224],"domain_scores_gemma":[0.9985955,0.00005571316,0.000036164278,0.0010722673,0.00005821051,0.00018219072],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028677593,0.00015779199,0.00014666794,0.000126142,0.0000795291,0.0000898237,0.0016820846,0.000106541454,0.000064874795],"category_scores_gemma":[0.00009236424,0.00013124749,0.000054630404,0.0006852944,0.000038693885,0.0006538312,0.0010654144,0.00013757855,0.002192107],"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.000010858236,0.00081834546,0.084531054,0.00003117257,0.00010147183,0.000037057835,0.0020496654,0.00032473306,0.005973856,0.23895021,0.3727888,0.29438278],"study_design_scores_gemma":[0.0012859498,0.00020002057,0.1508609,0.000049312875,0.000017205752,0.00007047843,0.0001878358,0.058202446,0.04485627,0.0035782063,0.739029,0.001662381],"about_ca_topic_score_codex":0.000054775468,"about_ca_topic_score_gemma":0.000038171238,"teacher_disagreement_score":0.47968182,"about_ca_system_score_codex":0.000054540254,"about_ca_system_score_gemma":0.000021392658,"threshold_uncertainty_score":0.9985848},"labels":[],"label_agreement":null},{"id":"W2014463879","doi":"10.1142/s0218843011002183","title":"OPTIMIZING ACQUAINTANCE SELECTION IN A PDMS","year":2011,"lang":"en","type":"article","venue":"International Journal of Cooperative Information Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Selection (genetic algorithm); Scheme (mathematics); Information retrieval; Peer-to-peer; Empirical research; Data mining; World Wide Web; Artificial intelligence","score_opus":0.024490233656441963,"score_gpt":0.2616141719143323,"score_spread":0.23712393825789033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014463879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03850148,0.00006768316,0.95386744,0.00059133524,0.0016836937,0.00018426962,0.0000023921473,0.00007257793,0.0050291247],"genre_scores_gemma":[0.96125495,0.000016853823,0.038283415,0.00028436526,0.00009479339,0.000015753747,9.3758376e-7,0.0000034462932,0.000045460944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823695,0.00007102997,0.0008645354,0.000087279244,0.0005847016,0.00015548484],"domain_scores_gemma":[0.99748224,0.00005304404,0.000540302,0.00010513322,0.0017615847,0.000057679008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007304631,0.00011412808,0.00019059736,0.00084082177,0.000037978978,0.00031891308,0.0012507923,0.00006461963,0.000008799093],"category_scores_gemma":[0.00021921548,0.000098493096,0.000045864417,0.0005876392,0.00002203815,0.0045826756,0.00013523099,0.00021929076,0.00006723889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047475693,0.0002785394,0.0093544,0.00003630318,0.0004744548,0.0001717248,0.09654111,0.35457852,0.0034149988,0.44332233,0.009630027,0.08172283],"study_design_scores_gemma":[0.0065636723,0.0023398667,0.028153693,0.002373754,0.000021138558,0.0043756976,0.010623466,0.7458906,0.045888893,0.0025581764,0.1494829,0.0017281165],"about_ca_topic_score_codex":0.000034085984,"about_ca_topic_score_gemma":0.000015584325,"teacher_disagreement_score":0.9227535,"about_ca_system_score_codex":0.00031557886,"about_ca_system_score_gemma":0.00013015447,"threshold_uncertainty_score":0.4016432},"labels":[],"label_agreement":null},{"id":"W2014772392","doi":"10.1007/s11042-010-0703-z","title":"Improving online gaming experience using location awareness and interaction details","year":2011,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Computer science; Quality of experience; Latency (audio); Human–computer interaction; Set (abstract data type); Orientation (vector space); Constraint (computer-aided design); Computer network; Quality of service; Telecommunications","score_opus":0.09000140225195971,"score_gpt":0.3105439723065407,"score_spread":0.22054257005458097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014772392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31938738,0.00010517677,0.6799185,0.00009067058,0.00004924384,0.00024688718,0.0000039676047,0.0001709412,0.000027199241],"genre_scores_gemma":[0.68788594,0.000020174903,0.31181088,0.000051765113,0.000040959065,0.00017113102,0.000005272079,0.000005403492,0.0000084395315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916524,0.000011552406,0.00017902335,0.00037642737,0.000089753936,0.00017801544],"domain_scores_gemma":[0.9993054,0.00007055712,0.00008703314,0.00036697258,0.000090797745,0.000079234764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000826246,0.00010897499,0.000102348116,0.000097048316,0.00021661897,0.00013355928,0.00032143848,0.000057618607,0.0000017873722],"category_scores_gemma":[0.000066057015,0.00010788395,0.000011393474,0.00037683762,0.00007181874,0.00065657357,0.00029981913,0.00009298615,0.0000045535644],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017475936,0.000042371328,0.0031941938,0.000011391957,0.0000034466993,6.4351235e-7,0.00174733,0.00006168576,0.013800382,0.0010960103,0.0000054648795,0.9800353],"study_design_scores_gemma":[0.00022795441,0.00004191631,0.061400615,0.000058353624,0.000014757062,0.000034912016,0.00135947,0.9133628,0.020335877,0.00082052127,0.0019700634,0.00037278642],"about_ca_topic_score_codex":0.00020840928,"about_ca_topic_score_gemma":0.000046386438,"teacher_disagreement_score":0.97966254,"about_ca_system_score_codex":0.000031774027,"about_ca_system_score_gemma":0.000025659201,"threshold_uncertainty_score":0.43993798},"labels":[],"label_agreement":null},{"id":"W2014910499","doi":"10.1145/1730836.1730857","title":"Quality-aware segment transmission scheduling in peer-to-peer streaming systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Job shop scheduling; Approximation algorithm; Network packet; Schedule; Integer programming; Solver; Benchmark (surveying); Real-time computing; Mathematical optimization; Distributed computing; Algorithm; Computer network; Mathematics","score_opus":0.024093531185935643,"score_gpt":0.2989834528046106,"score_spread":0.2748899216186749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014910499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2636405,0.00003103551,0.71571,0.016751168,0.0008527611,0.00047766892,0.0000030361339,0.00106334,0.0014705043],"genre_scores_gemma":[0.7600257,0.0000016167664,0.23716258,0.00033148206,0.00007769417,0.00006635627,0.0000036688637,0.000018311413,0.0023126337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964052,0.00008832429,0.00062024524,0.00087073847,0.0012591814,0.00075630733],"domain_scores_gemma":[0.9978192,0.0001846927,0.00008689736,0.0012617921,0.0003404907,0.00030691532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020185807,0.00030775814,0.00038993056,0.00051103404,0.00014223444,0.00041361133,0.0020959764,0.0002645383,0.000018320152],"category_scores_gemma":[0.0002835455,0.00026997918,0.00007569843,0.0012789412,0.000032749253,0.00043884804,0.0006210948,0.0006663148,0.00015281799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035807425,0.00043440796,0.013233472,0.00018775044,0.000050960396,0.00014958272,0.004933891,0.06404369,0.10086166,0.12060714,0.009642573,0.6858191],"study_design_scores_gemma":[0.0020212387,0.0004879396,0.021107461,0.00079653726,0.000015094653,0.000087665074,0.0038465576,0.7622914,0.060439922,0.0045564175,0.1415133,0.002836512],"about_ca_topic_score_codex":0.0005609688,"about_ca_topic_score_gemma":0.00038438605,"teacher_disagreement_score":0.6982477,"about_ca_system_score_codex":0.00012720273,"about_ca_system_score_gemma":0.00009425897,"threshold_uncertainty_score":0.99997526},"labels":[],"label_agreement":null},{"id":"W2015251277","doi":"10.1093/comjnl/bxs110","title":"Modeling and Evaluation of a Metadata-Based Adaptive P2P Video-Streaming System","year":2012,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Metadata; Adaptation (eye); Bitstream; Codec; Distributed computing; Real-time computing; Multimedia; World Wide Web; Algorithm","score_opus":0.07016241582279016,"score_gpt":0.2829747661228328,"score_spread":0.21281235030004264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015251277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.194687,0.00092167885,0.80308,0.0006082329,0.00042094028,0.00014917381,0.0000010608252,0.00009169666,0.000040203748],"genre_scores_gemma":[0.7742931,0.000002815095,0.22539453,0.0000869102,0.0002081381,0.0000059836243,3.164232e-7,0.0000059410195,0.000002222643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811697,0.000347962,0.00033030595,0.00017551248,0.0007072716,0.00032197562],"domain_scores_gemma":[0.99869007,0.00015520432,0.00018347353,0.0005113021,0.00035425974,0.000105689694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088638,0.00014015725,0.00021668062,0.00018786849,0.00020759525,0.00022642719,0.001048335,0.000047223493,8.6345034e-7],"category_scores_gemma":[0.000038383932,0.00009420254,0.000058194146,0.00030750793,0.000039199927,0.0008782344,0.00050134805,0.00025521993,0.0000042913034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014813075,0.000040394592,0.00019914834,0.000015013666,0.00010595478,0.0000039648576,0.0011897654,0.70470726,0.00020376498,0.012986332,0.0004242742,0.28010935],"study_design_scores_gemma":[0.00030046617,0.00006994759,0.00039471185,0.00012288781,0.000061052786,0.00019643243,0.000100863224,0.9971132,0.00042624827,0.001069818,0.000039813232,0.00010455733],"about_ca_topic_score_codex":0.000012175062,"about_ca_topic_score_gemma":0.0000017802246,"teacher_disagreement_score":0.5796061,"about_ca_system_score_codex":0.0001235495,"about_ca_system_score_gemma":0.0000880507,"threshold_uncertainty_score":0.3841468},"labels":[],"label_agreement":null},{"id":"W2015778245","doi":"10.1109/scc.2014.82","title":"Design and Performance Evaluation of Cloud-Based XML Publish/Subscribe Services","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Cloud computing; XML Signature; Computer network; Efficient XML Interchange; XML framework; Streaming XML; XML; SOAP; World Wide Web; Database; Operating system","score_opus":0.031335075730931715,"score_gpt":0.24791799324329225,"score_spread":0.21658291751236053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015778245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3722969,0.000047693633,0.6242449,0.001455243,0.00014044851,0.0002137686,1.7064929e-7,0.0002951393,0.0013057073],"genre_scores_gemma":[0.7981862,0.0000025830689,0.20132415,0.00040455224,0.000019756557,0.000024881732,9.919765e-7,0.0000041749845,0.0000327203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862206,0.00011923663,0.00018309189,0.00030655903,0.0005569566,0.0002121036],"domain_scores_gemma":[0.9987551,0.00011863576,0.00008493006,0.00063608686,0.00035291607,0.000052361916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023080786,0.00010851767,0.00013615597,0.00016216718,0.00006093078,0.00015055486,0.00096850534,0.0000703449,0.000009283813],"category_scores_gemma":[0.00008021424,0.000091395945,0.00001591258,0.00052507943,0.000041539883,0.0006453502,0.00025592494,0.000069037975,0.00001602809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023731413,0.00006829825,0.0072951466,0.00008239813,0.000019080944,3.6594048e-7,0.00044802943,0.052685667,0.001784497,0.016758084,0.004861772,0.91597295],"study_design_scores_gemma":[0.00028887804,0.0001870791,0.0098435,0.00002554214,0.000008346571,0.000001201068,0.000012224119,0.96680284,0.019768445,0.0022950391,0.00065115397,0.00011574994],"about_ca_topic_score_codex":0.000021298467,"about_ca_topic_score_gemma":0.000014374826,"teacher_disagreement_score":0.9158572,"about_ca_system_score_codex":0.000026876596,"about_ca_system_score_gemma":0.00005879884,"threshold_uncertainty_score":0.37270185},"labels":[],"label_agreement":null},{"id":"W2015784834","doi":"10.1155/2012/807520","title":"Improving Streaming Capacity in Multi-Channel P2P VoD Systems via Intra-Channel and Cross-Channel Resource Allocation","year":2012,"lang":"en","type":"article","venue":"International Journal of Digital Multimedia Broadcasting","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Channel (broadcasting); Computer science; Upload; Channel allocation schemes; Computer network; Resource allocation; Channel capacity; Telecommunications; Wireless","score_opus":0.04420566906766734,"score_gpt":0.2756682540826786,"score_spread":0.23146258501501124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015784834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42693403,0.00048458987,0.5697238,0.00041559833,0.0020048954,0.00020443092,0.000016866905,0.00012261895,0.00009319636],"genre_scores_gemma":[0.97821194,0.000008147611,0.020987192,0.000060758033,0.00065246597,0.000012577093,0.0000062711392,0.000028806322,0.00003184181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699116,0.00005689479,0.0010440263,0.0003894717,0.00087416486,0.00064425956],"domain_scores_gemma":[0.99735034,0.000533527,0.0008350816,0.00026253203,0.00070746697,0.0003110649],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010363946,0.00031964973,0.0003757704,0.0008069761,0.000100810204,0.0009801534,0.0013835321,0.00017682835,5.213812e-7],"category_scores_gemma":[0.002416143,0.00031263917,0.00009733686,0.00039466505,0.00012288001,0.0039443765,0.0007876567,0.0005679304,0.000010466373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023918897,0.0013034119,0.05170253,0.00016814424,0.00047101537,0.00043797947,0.022207977,0.1601165,0.012551786,0.00051310007,0.00023176409,0.7500566],"study_design_scores_gemma":[0.0014660222,0.00013674561,0.014280224,0.0005563773,0.000010662408,0.0011009334,0.0009522325,0.9787483,0.0018624626,0.0003131849,0.0001205534,0.0004523026],"about_ca_topic_score_codex":0.00016095352,"about_ca_topic_score_gemma":0.000019598227,"teacher_disagreement_score":0.8186318,"about_ca_system_score_codex":0.00038321104,"about_ca_system_score_gemma":0.000059235812,"threshold_uncertainty_score":0.9999326},"labels":[],"label_agreement":null},{"id":"W2015910933","doi":"10.1007/s10462-009-9141-6","title":"On the importance of relational concept knowledge in referral networks","year":2008,"lang":"en","type":"article","venue":"Artificial Intelligence Review","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"McGill University","keywords":"Computer science; Oracle; Referral; Domain (mathematical analysis); Relation (database); Domain knowledge; Knowledge management; Service (business); Business; Data mining; Software engineering","score_opus":0.14861547033252231,"score_gpt":0.33990965808597645,"score_spread":0.19129418775345414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015910933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025387593,0.12732287,0.8107626,0.026650596,0.0008652357,0.0018054866,0.0000041559942,0.00039113182,0.00681034],"genre_scores_gemma":[0.97983843,0.012396474,0.0053718532,0.0021426878,0.00006435785,0.00008334066,0.000002393605,0.000010424121,0.00009001404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813694,0.00014610321,0.00074262754,0.00038212276,0.0002719765,0.00032024732],"domain_scores_gemma":[0.99816483,0.0006133549,0.00018834871,0.00084968284,0.00013154309,0.000052222036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568537,0.00016300184,0.00033798144,0.00009139161,0.00010378589,0.000013940879,0.0013286283,0.0000791207,0.00006190792],"category_scores_gemma":[0.00063925725,0.000116994626,0.000098359335,0.0017369288,0.00022203858,0.00016093062,0.0002693216,0.0003370689,0.00020633204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032549378,0.000060929306,0.00036401505,0.000024587684,0.000005147593,0.000010858929,0.00019268975,0.002870513,0.0000055771934,0.87950945,0.0062442934,0.11070866],"study_design_scores_gemma":[0.00012362811,0.0011646501,0.010780826,0.015166612,0.000048521917,0.00018821206,0.00024934314,0.3339682,0.009264608,0.5450763,0.08172246,0.0022466225],"about_ca_topic_score_codex":0.000010330637,"about_ca_topic_score_gemma":0.00008046496,"teacher_disagreement_score":0.95445085,"about_ca_system_score_codex":0.00006451772,"about_ca_system_score_gemma":0.000088107605,"threshold_uncertainty_score":0.47709024},"labels":[],"label_agreement":null},{"id":"W2015918750","doi":"10.1109/srds.2011.13","title":"Transaction Models for Massively Multiplayer Online Games","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Computer science; Atomicity; Consistency (knowledge bases); Leverage (statistics); Distributed computing; Fault tolerance; Database transaction; Database; Artificial intelligence","score_opus":0.08691870318472701,"score_gpt":0.2623981683896493,"score_spread":0.1754794652049223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015918750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008342329,0.00002296635,0.98643535,0.0017330254,0.00022706174,0.00030343136,0.00000807277,0.0010932382,0.0018344977],"genre_scores_gemma":[0.46255538,0.000004460553,0.5362576,0.0002967276,0.00001717885,0.000043578268,0.0000011646603,0.000006439965,0.0008174472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990477,0.000009297716,0.00016027827,0.00035486047,0.00013635846,0.0002915042],"domain_scores_gemma":[0.99930584,0.00004793113,0.00003754554,0.00045214736,0.000093825234,0.000062707986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009747116,0.000124315,0.0001287369,0.00012991574,0.00005588979,0.000036728296,0.00086974184,0.000091939044,0.0000127510075],"category_scores_gemma":[0.000019104407,0.00010436547,0.00006450282,0.00024131175,0.000023456907,0.0005387462,0.000087659326,0.00008200379,0.000023654724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000701217,0.00038224144,0.0001150517,0.000019878205,0.00006286557,0.000010286903,0.0023431308,0.009043567,0.0033131475,0.15908903,0.013567365,0.81198335],"study_design_scores_gemma":[0.0004041752,0.00020307086,0.00083684264,0.0000113364185,0.000006757286,0.0000068562276,0.00009584104,0.9149739,0.026054835,0.052956466,0.0041827103,0.00026717028],"about_ca_topic_score_codex":0.000047095113,"about_ca_topic_score_gemma":0.00008231856,"teacher_disagreement_score":0.9059304,"about_ca_system_score_codex":0.000027766471,"about_ca_system_score_gemma":0.000021083328,"threshold_uncertainty_score":0.42559004},"labels":[],"label_agreement":null},{"id":"W2016343032","doi":"10.1109/tetc.2014.2330520","title":"A Dynamic Networking Substrate for Distributed MMOGs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Computer network; Distributed computing; Routing (electronic design automation); Overlay network; Scheme (mathematics); The Internet","score_opus":0.019073264098508822,"score_gpt":0.2762251771966136,"score_spread":0.25715191309810476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016343032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04320056,0.000023081375,0.95050055,0.0028306176,0.0022449065,0.00029276317,0.0000042355823,0.000789892,0.00011337912],"genre_scores_gemma":[0.8561715,0.0000057691823,0.14339277,0.00022587868,0.0001034532,0.00002874807,0.0000023373684,0.000017765675,0.000051794104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808675,0.0000635286,0.00041894233,0.0005798203,0.00021616099,0.0006347836],"domain_scores_gemma":[0.99874854,0.00038036637,0.00009987188,0.00062832935,0.000068470516,0.000074400836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061016483,0.00022698757,0.00026449116,0.00031282337,0.0003395552,0.00014314821,0.0010126191,0.00012413,0.0000010503726],"category_scores_gemma":[0.000025610083,0.0002563065,0.00010661166,0.0010329046,0.00003598856,0.00014801772,0.000018364466,0.00041101387,0.0000066483026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061433734,0.000047067748,0.00010258987,0.000016877422,0.0000141362025,0.0000031660204,0.0002599042,0.6062146,0.00007783308,0.0025887254,0.00009106079,0.39057788],"study_design_scores_gemma":[0.00036785167,0.00009144741,0.0004504743,0.00013080938,0.0000063688453,0.000005692608,0.000024679508,0.98911566,0.0008341268,0.0046661673,0.004023356,0.00028336438],"about_ca_topic_score_codex":0.000023552197,"about_ca_topic_score_gemma":0.00015703595,"teacher_disagreement_score":0.81297094,"about_ca_system_score_codex":0.00016294335,"about_ca_system_score_gemma":0.000028294831,"threshold_uncertainty_score":0.9999889},"labels":[],"label_agreement":null},{"id":"W2016580264","doi":"10.1145/1266894.1266908","title":"Historic data access in publish/subscribe","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Middleware (distributed applications); Workflow; Publication; Matching (statistics); Business process; Process (computing); Routing (electronic design automation); Database; Distributed computing; World Wide Web; Computer network; Work in process; Operating system","score_opus":0.11381550111160736,"score_gpt":0.3545551371999762,"score_spread":0.24073963608836885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016580264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009170906,0.0002177334,0.92758524,0.011208478,0.0012121856,0.00018751668,0.0000020463303,0.0014644649,0.048951447],"genre_scores_gemma":[0.7704486,0.000013106201,0.22415942,0.0022721027,0.00012168886,0.000010035532,0.000012456963,0.000013230407,0.002949328],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982081,0.000014884831,0.00026172676,0.0006482843,0.00034379287,0.0005232113],"domain_scores_gemma":[0.99698055,0.000101037105,0.000046286255,0.0027151322,0.000058190595,0.00009878659],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0011601117,0.00012222085,0.00014409519,0.0005174536,0.000042449592,0.00043089205,0.0111114625,0.000094747666,0.00001965841],"category_scores_gemma":[0.0003134395,0.000111862915,0.000015208389,0.002465729,0.000030184467,0.0031093492,0.0062203673,0.00020902518,0.000097001095],"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.000003722261,0.00007081516,0.0108226845,0.000004460378,0.0000048923284,0.00010401384,0.00011939591,0.000040743864,0.00007926455,0.05449544,0.6025717,0.33168283],"study_design_scores_gemma":[0.000403214,0.00006267866,0.07902312,0.000021703021,0.0000029111927,0.000026067815,0.00005527053,0.01814196,0.0014620062,0.012983244,0.88719743,0.00062039035],"about_ca_topic_score_codex":0.0003622173,"about_ca_topic_score_gemma":0.0020642017,"teacher_disagreement_score":0.76127774,"about_ca_system_score_codex":0.00020112938,"about_ca_system_score_gemma":0.000060017377,"threshold_uncertainty_score":0.9942389},"labels":[],"label_agreement":null},{"id":"W2017732869","doi":"10.1108/17415650680000052","title":"A scalable multimedia streaming scheme with CBR‐transmission of VBR‐encoded videos over the internet","year":2006,"lang":"en","type":"article","venue":"Interactive Technology and Smart Education","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Real Time Streaming Protocol; Computer network; Scalability; Server; Variable bitrate; The Internet; Constant bitrate; Bandwidth (computing); Jitter; Quality of service; Multimedia; Operating system; Telecommunications","score_opus":0.0051279802051635405,"score_gpt":0.24182430512873976,"score_spread":0.23669632492357623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017732869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8497475,0.0002333798,0.14255702,0.0056574508,0.00020669957,0.00032064045,0.0000014020401,0.0003186856,0.00095720857],"genre_scores_gemma":[0.9231395,0.000007873521,0.0762149,0.000104242135,0.00002475191,0.00009746807,0.000004150884,0.000008567729,0.00039853042],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989669,0.000033838573,0.00023219148,0.0003910866,0.0001455286,0.00023046449],"domain_scores_gemma":[0.9989618,0.00016588697,0.00016218341,0.0005018948,0.00017747794,0.000030777977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014319558,0.00016661368,0.00018282977,0.0005218675,0.00008992141,0.00004975883,0.00069204456,0.00016830149,0.000011175932],"category_scores_gemma":[0.000084398795,0.000115326526,0.000026538197,0.0009081026,0.00026079253,0.00039459195,0.00024179523,0.00033281845,0.000010539359],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001705739,0.00091226696,0.14095262,0.00004980815,0.00013523096,0.0000111455665,0.0022929136,0.00006235202,0.053272694,0.08446717,0.012392243,0.705281],"study_design_scores_gemma":[0.0014381298,0.0012779839,0.20877294,0.0013334984,0.00007438431,0.00025993914,0.0026017907,0.073050626,0.5929473,0.07328957,0.043921933,0.001031898],"about_ca_topic_score_codex":0.0003684551,"about_ca_topic_score_gemma":0.00013219952,"teacher_disagreement_score":0.7042491,"about_ca_system_score_codex":0.00007048006,"about_ca_system_score_gemma":0.00010616567,"threshold_uncertainty_score":0.47028792},"labels":[],"label_agreement":null},{"id":"W2018758714","doi":"10.1145/945721.945733","title":"The hyperion project","year":2003,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"","keywords":"Computer science; Schema (genetic algorithms); Database; Distributed database; Database schema; Key (lock); Information retrieval; Database design; Computer security","score_opus":0.026853933392331445,"score_gpt":0.2671210670957384,"score_spread":0.24026713370340697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018758714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39571923,0.0016038027,0.4801357,0.047223058,0.008819721,0.0023258042,0.000002814886,0.0054138335,0.058756035],"genre_scores_gemma":[0.66545916,0.00024174046,0.32956716,0.0006666312,0.00011524201,0.00018193088,5.6068683e-7,0.000024587096,0.0037429698],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987538,0.00008082329,0.00016324656,0.00037258622,0.00021856678,0.00041098596],"domain_scores_gemma":[0.9977266,0.00030588455,0.000054167613,0.0018254016,0.00004478331,0.00004311676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043126557,0.00013230636,0.000113806724,0.000083521445,0.00027410136,0.00019248996,0.0026987765,0.00007701667,0.000003146087],"category_scores_gemma":[0.0010808568,0.000088933426,0.000052549032,0.0007650167,0.00005252393,0.00019503657,0.00064692425,0.00018121928,0.00015229556],"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.0000037563727,0.000018646253,0.0011682634,0.0000018064029,0.00001043231,0.000005361605,0.00012572538,0.000012788973,0.0004096623,0.04042483,0.043620404,0.91419834],"study_design_scores_gemma":[0.000109905246,0.00016486234,0.0007573931,0.000009431468,0.0000024650612,0.000018088242,0.000037428228,0.0010184556,0.0029267939,0.048637755,0.9461141,0.00020327885],"about_ca_topic_score_codex":0.0000327131,"about_ca_topic_score_gemma":0.00011353283,"teacher_disagreement_score":0.913995,"about_ca_system_score_codex":0.000048077058,"about_ca_system_score_gemma":0.0000743813,"threshold_uncertainty_score":0.5015043},"labels":[],"label_agreement":null},{"id":"W2018800372","doi":"10.1016/j.comcom.2012.05.012","title":"Understanding the impact of neighboring strategy in peer-to-peer multimedia streaming applications","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Peer-to-Peer Network Technologies","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":"Queen's University","funders":"","keywords":"Computer science; Overlay; Network packet; Computer network; Overlay network; Peer-to-peer; Scheme (mathematics); Tree (set theory); Distributed computing; Swarm behaviour; Multimedia; The Internet; World Wide Web; Artificial intelligence","score_opus":0.1404437713445838,"score_gpt":0.35099369633971966,"score_spread":0.21054992499513586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018800372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008261313,0.00026388458,0.98170453,0.0065787896,0.0001040465,0.00069331896,0.000012199081,0.0002991104,0.002082834],"genre_scores_gemma":[0.78532374,0.000015443144,0.21427292,0.00007578709,0.00006831561,0.00017484797,0.000011954196,0.000014123838,0.000042871896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981515,0.0001530471,0.00045295924,0.00028509126,0.0003968027,0.00056059536],"domain_scores_gemma":[0.99464405,0.0008400143,0.00015175359,0.003929683,0.00025745702,0.00017705359],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009126549,0.00021455812,0.00025145075,0.00043180716,0.00031406456,0.00016906942,0.005600264,0.00009108473,0.000003579438],"category_scores_gemma":[0.00009711043,0.00017579983,0.00010846125,0.002078078,0.0001488018,0.00052057166,0.0030541597,0.00043305085,0.000046656354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008807928,0.0011079517,0.07673909,0.000022698603,0.0002047595,0.0000017794301,0.01849782,0.14943002,0.0011994566,0.4071626,0.014779546,0.33084548],"study_design_scores_gemma":[0.00046184924,0.00016666201,0.21965982,0.00012641092,0.000019779403,0.00001963075,0.0010223037,0.76090574,0.00022747001,0.0107658105,0.005996757,0.0006277461],"about_ca_topic_score_codex":0.0002234494,"about_ca_topic_score_gemma":0.00011165995,"teacher_disagreement_score":0.7770624,"about_ca_system_score_codex":0.00043090363,"about_ca_system_score_gemma":0.000096885175,"threshold_uncertainty_score":0.99977994},"labels":[],"label_agreement":null},{"id":"W2019050822","doi":"10.5539/cis.v7n4p9","title":"Performance Evaluation and Comparison of Distributed Messaging Using Message Oriented Middleware","year":2014,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Asynchronous communication; Middleware (distributed applications); Message oriented middleware; Message broker; Message passing; Process (computing); Remote procedure call; Message queue; Distributed computing; Computer network; Software; Operating system; Software architecture","score_opus":0.028953623182281712,"score_gpt":0.2950733936118065,"score_spread":0.2661197704295248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019050822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44897673,0.000017709064,0.5503297,0.00011264655,0.0001193344,0.000115286806,0.0000012457757,0.000073212344,0.00025415697],"genre_scores_gemma":[0.91864145,0.0000049689156,0.081207655,0.00012370879,0.000010622199,0.0000044420376,0.000004886186,0.0000015521264,7.4472274e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984476,0.00003423538,0.00037866845,0.00023180495,0.0006633423,0.00024435733],"domain_scores_gemma":[0.99875146,0.00005718531,0.00020620484,0.00037458946,0.0005163942,0.000094135365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015362842,0.000115180876,0.00017963542,0.00039382506,0.00031902938,0.00027832863,0.00064261106,0.000038613234,8.2514345e-7],"category_scores_gemma":[0.0001353482,0.000103770406,0.000012996921,0.0014187875,0.00026299368,0.0059641046,0.000777615,0.00008461507,0.0000026857062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067830556,0.000022603886,0.03057398,0.00006952348,0.0000061410815,8.763894e-8,0.0041748784,0.034074917,0.00084515027,0.027007448,0.00020705177,0.90301144],"study_design_scores_gemma":[0.00021644225,0.00007875112,0.06637817,0.000053157677,0.0000040397367,0.000006584123,0.00006846966,0.9293423,0.0024318611,0.00011317498,0.0011890986,0.00011792841],"about_ca_topic_score_codex":0.000005787064,"about_ca_topic_score_gemma":4.984725e-7,"teacher_disagreement_score":0.9028935,"about_ca_system_score_codex":0.000053034844,"about_ca_system_score_gemma":0.00007250277,"threshold_uncertainty_score":0.43238318},"labels":[],"label_agreement":null},{"id":"W2019146360","doi":"10.1145/1570433.1570440","title":"Flexible and efficient platform modeling for distributed interactive systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Distributed computing; Personalization; Fault tolerance; Architecture; Operating system; World Wide Web","score_opus":0.027749674296340406,"score_gpt":0.2716997238891213,"score_spread":0.24395004959278088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019146360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047025505,0.00011503812,0.9492809,0.0014844993,0.00020989042,0.00041455898,0.000008517371,0.0008851994,0.00057586556],"genre_scores_gemma":[0.94129944,0.0000024853696,0.058369648,0.00015225144,0.000024935098,0.000032560307,0.0000044890626,0.0000038642615,0.0001103503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990039,0.000004960572,0.00018149932,0.00035003698,0.00014435327,0.00031527595],"domain_scores_gemma":[0.9993404,0.00008215556,0.000038909828,0.00036106733,0.00010407289,0.00007337863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001798472,0.00012404895,0.0001619049,0.00011803554,0.00010289315,0.00023824199,0.00054717064,0.000061801984,3.7958304e-7],"category_scores_gemma":[0.00006444537,0.00010181687,0.000029857161,0.00031902504,0.000012445536,0.00023398011,0.00021991518,0.00008430495,0.000006834568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034632172,0.00007134479,0.000013659364,0.000014596468,0.00002017435,0.0000042679744,0.00036361575,0.6883447,0.0004903783,0.24534775,0.0041481396,0.061146747],"study_design_scores_gemma":[0.00019750504,0.00016368291,0.00003334245,0.000033541586,0.0000026880114,0.000010967587,0.00013301104,0.9924033,0.0014131047,0.004614296,0.00085313513,0.00014142218],"about_ca_topic_score_codex":0.000018923236,"about_ca_topic_score_gemma":0.0000022124887,"teacher_disagreement_score":0.89427394,"about_ca_system_score_codex":0.00007960376,"about_ca_system_score_gemma":0.00001791831,"threshold_uncertainty_score":0.41519713},"labels":[],"label_agreement":null},{"id":"W2019604498","doi":"10.1117/12.774902","title":"&lt;title&gt;On meeting P2P streaming bandwidth demand with limited supplies&lt;/title&gt;","year":2008,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bandwidth (computing); Computer network; Bandwidth allocation; Server; Dynamic bandwidth allocation; Upload; Peer-to-peer; Overlay; Overlay network; Distributed computing; The Internet; Operating system","score_opus":0.010858933076929703,"score_gpt":0.20839747452851926,"score_spread":0.19753854145158956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019604498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634583,0.00008908344,0.00076277956,0.0021504925,0.00019209346,0.00027540245,0.000010697374,0.00029394802,0.03276723],"genre_scores_gemma":[0.6329818,0.00011749193,0.3649601,0.00019001774,0.00036036805,0.000084355925,0.000004827433,0.00006169513,0.0012393456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99840456,1.5854239e-8,0.0003118634,0.00035370432,0.000589981,0.00033988061],"domain_scores_gemma":[0.99896735,0.00010286874,0.00016344395,0.00009046421,0.00059087406,0.00008501914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026780623,0.00023075797,0.0002553923,0.00012667803,0.000092777285,0.000087219756,0.0011661774,0.0001362845,0.000013959606],"category_scores_gemma":[0.0002701807,0.00018235021,0.00019057126,0.00043323822,0.00013936887,0.0002689349,0.0002503678,0.00022901711,0.000018544391],"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.00003911391,0.000090822505,0.00031680072,0.00013840188,0.00026141648,0.0000010792977,0.00024232618,0.00037692822,0.096044764,0.84417605,0.055647112,0.0026651619],"study_design_scores_gemma":[0.003800989,0.0026712047,0.005062878,0.0025452683,0.00031360492,0.00031272767,0.0008008061,0.3098288,0.37634152,0.009960571,0.28538293,0.0029786944],"about_ca_topic_score_codex":0.0000015526972,"about_ca_topic_score_gemma":1.2463406e-7,"teacher_disagreement_score":0.8342155,"about_ca_system_score_codex":0.00010517156,"about_ca_system_score_gemma":0.000029844276,"threshold_uncertainty_score":0.7436026},"labels":[],"label_agreement":null},{"id":"W2021050109","doi":"10.1145/643550.643559","title":"Mobile code middleware for mobile multimedia information access","year":2002,"lang":"en","type":"article","venue":"ACM SIGMOBILE Mobile Computing and Communications Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Middleware (distributed applications); Java; Server; Code (set theory); Mobile computing; Mobile device; Multimedia; Computer network; Operating system; Programming language","score_opus":0.06434473682553733,"score_gpt":0.3444456758607777,"score_spread":0.28010093903524036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021050109","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006961702,0.59902227,0.3649296,0.0057372767,0.00069248036,0.017039632,0.00013637122,0.0038973258,0.0015833748],"genre_scores_gemma":[0.27978012,0.25509185,0.440009,0.0046436265,0.00010978867,0.01974646,0.00026178436,0.00006961939,0.0002877425],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99714357,0.00023161474,0.0010497555,0.00061680976,0.00033956292,0.00061868475],"domain_scores_gemma":[0.9905746,0.0014862095,0.00046304113,0.006623339,0.0006351924,0.00021760391],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010497106,0.0004157756,0.00069544674,0.00027516964,0.0008057514,0.00052579003,0.0093916645,0.0001679629,0.000023702325],"category_scores_gemma":[0.0010152988,0.00040550684,0.00018005977,0.0017792853,0.00021401206,0.0013039759,0.006951837,0.00042041682,0.00018749258],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001498927,0.00016564643,0.00012109015,0.00064231723,0.00003294238,5.645177e-7,0.00082433724,0.0010259919,0.000015816642,0.0007339928,0.031944487,0.9644913],"study_design_scores_gemma":[0.00037026044,0.00038262617,0.000052036692,0.0014972707,0.000046477177,0.00003163467,0.00009950549,0.17911114,0.000104880804,0.00044180852,0.81734234,0.00052003784],"about_ca_topic_score_codex":0.000020006173,"about_ca_topic_score_gemma":0.000011111445,"teacher_disagreement_score":0.96397126,"about_ca_system_score_codex":0.00009827428,"about_ca_system_score_gemma":0.000053944965,"threshold_uncertainty_score":0.99983966},"labels":[],"label_agreement":null},{"id":"W2023093146","doi":"10.1007/s12083-014-0258-2","title":"A taxonomy of decentralized online social networks","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decentralization; Autonomy; Computer science; Architecture; Taxonomy (biology); Peer-to-peer; Cloud computing; Set (abstract data type); Control (management); Internet privacy; World Wide Web; Data science; Political science; Artificial intelligence","score_opus":0.027402669239488205,"score_gpt":0.27056741082156727,"score_spread":0.24316474158207907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023093146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060575926,0.00016993977,0.9632395,0.027034357,0.00030930873,0.0012437965,0.000021858965,0.0007423898,0.00118124],"genre_scores_gemma":[0.7765584,0.000028099279,0.21777497,0.0023364087,0.0013179615,0.0011705582,0.000051119525,0.000042974883,0.00071948563],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99687463,0.00008431554,0.0006015697,0.0009219458,0.0006421986,0.0008753382],"domain_scores_gemma":[0.9975031,0.00028680958,0.000207471,0.0010791646,0.0005061621,0.0004172823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088993454,0.000361007,0.00053804595,0.00030650187,0.00045346684,0.00023224369,0.0018134456,0.00020670338,0.0000048196985],"category_scores_gemma":[0.00012250549,0.0003774073,0.000114504706,0.002262956,0.00011338262,0.00012761712,0.0010264177,0.00034792314,0.00004321569],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021044714,0.00017922492,0.0017814608,0.000016675685,0.00005794043,0.0000011579041,0.00042680325,0.020807011,0.0001792241,0.055354897,0.08531863,0.8358559],"study_design_scores_gemma":[0.00034505466,0.00009398593,0.0040119374,0.000047624886,0.000028387325,0.000007271714,0.000041859414,0.05516001,0.00008836808,0.0030895458,0.93662757,0.00045837654],"about_ca_topic_score_codex":0.00005137845,"about_ca_topic_score_gemma":0.000076091106,"teacher_disagreement_score":0.85130894,"about_ca_system_score_codex":0.00006912693,"about_ca_system_score_gemma":0.000047186022,"threshold_uncertainty_score":0.9998678},"labels":[],"label_agreement":null},{"id":"W2023426379","doi":"10.1145/2522968.2522977","title":"Peer-to-peer architectures for massively multiplayer online games","year":2013,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Peer-to-peer; Architecture; Massively parallel; Rendering (computer graphics); Distributed computing; Cheating; Multimedia; Human–computer interaction; Artificial intelligence; Parallel computing","score_opus":0.09724405236065099,"score_gpt":0.36705376151263364,"score_spread":0.26980970915198266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023426379","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023669771,0.45312786,0.532547,0.0054524112,0.0022680175,0.0035930409,0.00029830696,0.0023971382,0.00007949965],"genre_scores_gemma":[0.00038291814,0.06212105,0.9288746,0.0008487147,0.0012811789,0.0004685127,0.0003611484,0.00028658134,0.0053753145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9914074,0.0012198716,0.0015226784,0.002440152,0.0015414874,0.0018684459],"domain_scores_gemma":[0.9861564,0.0064073647,0.0008247715,0.004543051,0.0015845146,0.00048391588],"candidate_categories":["metaresearch","metaepi_narrow","open_science"],"consensus_categories":["metaepi_narrow","open_science"],"category_scores_codex":[0.0054272963,0.0014438645,0.003047596,0.0012620123,0.0003892796,0.0008143154,0.012587594,0.00080117426,0.00000918016],"category_scores_gemma":[0.014712401,0.0012027873,0.0008831827,0.0022126783,0.00012468343,0.00010896223,0.008079204,0.0013365584,0.0005183653],"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.0000013949556,0.000073180076,0.000034420333,0.0010462553,0.00017433833,0.000016971953,0.00018184823,0.0010907453,0.0000011035446,0.00016011167,0.06256274,0.9346569],"study_design_scores_gemma":[0.00026466264,0.00022398744,0.0005653793,0.0034639009,0.00009408767,0.00006286749,0.000012469449,0.0064418353,0.000009948914,0.00097014144,0.9863771,0.0015135907],"about_ca_topic_score_codex":0.00016297976,"about_ca_topic_score_gemma":0.00010150693,"teacher_disagreement_score":0.9331433,"about_ca_system_score_codex":0.00027260027,"about_ca_system_score_gemma":0.00039657517,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W2024219570","doi":"10.14738/tnc.31.992","title":"Mechanism for reliable low latency communications in Computing Clusters","year":2015,"lang":"en","type":"article","venue":"Transactions on Networks and Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction; University of Cincinnati; Cisco Systems","keywords":"Computer science; Transmission Control Protocol; Computer network; Distributed computing; Overhead (engineering); Data transmission; Latency (audio); Reliability (semiconductor); Datagram; Information exchange; Network packet; Power (physics); Operating system","score_opus":0.05160509446031851,"score_gpt":0.29091347583363847,"score_spread":0.23930838137331994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024219570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073118036,0.000504767,0.97413194,0.022283003,0.00017304461,0.0006457171,0.000006015607,0.0004545081,0.0010698372],"genre_scores_gemma":[0.7156656,0.0007066711,0.28249273,0.00075086905,0.000010503856,0.00023290566,0.000010874079,0.00001563834,0.00011423504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861604,0.0001149971,0.0003975427,0.00034112102,0.00014338028,0.00038691622],"domain_scores_gemma":[0.99531853,0.00049125054,0.000094154224,0.0037309825,0.00020245822,0.00016264938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059119606,0.00018485394,0.00023337727,0.00027980437,0.00063074974,0.00016050626,0.0033391064,0.00014691456,8.5020963e-7],"category_scores_gemma":[0.000031458218,0.0001995888,0.00006303955,0.0010612593,0.00014697731,0.00029532664,0.000302409,0.0005037602,0.000009686529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003222048,0.0006924714,0.00012528205,0.000016014406,0.00005982495,0.0000011775096,0.0020903198,0.3134182,0.000019363753,0.51541674,0.0024755301,0.16565284],"study_design_scores_gemma":[0.00055014115,0.00013426907,0.00010582013,0.00009780424,0.000012898116,0.0000072149655,0.0003186435,0.9750474,0.00002178362,0.019428786,0.004044369,0.00023086813],"about_ca_topic_score_codex":0.00015788055,"about_ca_topic_score_gemma":0.00091060594,"teacher_disagreement_score":0.7149344,"about_ca_system_score_codex":0.000118164426,"about_ca_system_score_gemma":0.000069703136,"threshold_uncertainty_score":0.8138995},"labels":[],"label_agreement":null},{"id":"W2024557906","doi":"10.1142/s0218843008001762","title":"AN OPEN SERVICE ARCHITECTURE FOR THE HYPERION PEER DATABASE SYSTEM","year":2008,"lang":"en","type":"article","venue":"International Journal of Cooperative Information Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Ottawa","funders":"","keywords":"Computer science; Architecture; Web service; Leverage (statistics); Peer-to-peer; Service-oriented architecture; Service (business); Applications architecture; Flexibility (engineering); Database; Computer network; World Wide Web; Distributed computing; Software architecture; Operating system","score_opus":0.03611825825384008,"score_gpt":0.3052211164045486,"score_spread":0.2691028581507085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024557906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012312322,0.00007510446,0.97298574,0.010387121,0.0026463314,0.00079782354,0.000090720336,0.00008696206,0.00061787816],"genre_scores_gemma":[0.97566056,0.000012207008,0.022095906,0.0015725382,0.00041472865,0.000098296245,0.00003635792,0.000007913436,0.000101517486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977271,0.0001033419,0.0008024713,0.00012362975,0.0010781946,0.00016528125],"domain_scores_gemma":[0.99231815,0.00024058657,0.0006285691,0.00044588826,0.006272698,0.00009411231],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013106083,0.0001537422,0.00023741285,0.00031048735,0.00028236446,0.0012428267,0.005164386,0.00006176896,0.0000023507378],"category_scores_gemma":[0.00028089868,0.000097424614,0.000050249062,0.00040057948,0.00003484834,0.005473748,0.00046425618,0.00021842888,0.000042203214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061043166,0.0001408786,0.00032704754,0.000094033385,0.00067909114,0.00007636762,0.026193956,0.6455021,0.0022693037,0.20517339,0.08484941,0.034084015],"study_design_scores_gemma":[0.001854299,0.00059506873,0.00075881125,0.00039037224,0.000016789883,0.0044065355,0.004570849,0.3638105,0.0017837553,0.000054752836,0.621412,0.00034624527],"about_ca_topic_score_codex":0.00008329875,"about_ca_topic_score_gemma":0.000019611723,"teacher_disagreement_score":0.9633482,"about_ca_system_score_codex":0.00019919997,"about_ca_system_score_gemma":0.00028261592,"threshold_uncertainty_score":0.999794},"labels":[],"label_agreement":null},{"id":"W2024787338","doi":"10.1007/s11042-007-0165-0","title":"PECOLE: P2P multimedia collaborative environment","year":2007,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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 Ottawa","funders":"","keywords":"Computer science; Multimedia; Human–computer interaction; World Wide Web","score_opus":0.014114490481528833,"score_gpt":0.24968462898514798,"score_spread":0.23557013850361916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024787338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005704265,0.00040435704,0.9855235,0.0036793142,0.00010720412,0.0014526026,0.00007503264,0.00055664283,0.0024970556],"genre_scores_gemma":[0.18301634,0.00018247869,0.8143251,0.00053249876,0.00022399012,0.0011701917,0.000038812752,0.000019634906,0.0004909535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984629,0.000016544527,0.000281299,0.00055920455,0.00026047227,0.0004195539],"domain_scores_gemma":[0.99847573,0.00038772097,0.00008930291,0.00073847297,0.00006753984,0.00024124021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003191498,0.00019119991,0.00018343776,0.00013028635,0.00022828695,0.00014966843,0.0007608065,0.00011842845,0.000021659696],"category_scores_gemma":[0.000071305156,0.00018345432,0.000030530206,0.00065731356,0.00015267736,0.000254584,0.00046208664,0.00017137543,0.00037283864],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034942352,0.00010401173,0.0006824803,0.000003835489,0.000015009477,0.000004889458,0.00071247946,0.00008577451,0.0027595493,0.0059381505,0.0029608544,0.98672944],"study_design_scores_gemma":[0.0008153694,0.0001256037,0.057555363,0.000016397154,0.000018890465,0.000011294984,0.00054220203,0.03127425,0.013795044,0.002576071,0.89256835,0.0007011367],"about_ca_topic_score_codex":0.00000943866,"about_ca_topic_score_gemma":0.000025105059,"teacher_disagreement_score":0.9860283,"about_ca_system_score_codex":0.00007283642,"about_ca_system_score_gemma":0.00003634681,"threshold_uncertainty_score":0.748105},"labels":[],"label_agreement":null},{"id":"W2025036412","doi":"10.1109/icdcs.2012.17","title":"Total Order in Content-Based Publish/Subscribe Systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Overhead (engineering); Computer network; Synchronization (alternating current); Overlay; Publication; Overlay network; Distributed computing; Service (business); Order (exchange); World Wide Web; Database; Operating system; The Internet","score_opus":0.04928146308124125,"score_gpt":0.24169666126140846,"score_spread":0.19241519818016722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025036412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20629242,0.0005695095,0.76629514,0.009770999,0.0027040353,0.0005715765,0.0000025922166,0.0020860725,0.011707675],"genre_scores_gemma":[0.94779325,6.7389186e-7,0.049689487,0.0007448502,0.00007103848,0.000075214724,0.0000019977867,0.000009537912,0.0016139278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983278,0.000050081813,0.0002660995,0.00031630392,0.0003381076,0.00070164155],"domain_scores_gemma":[0.99877703,0.00008633405,0.00004989412,0.0008013563,0.00013391078,0.00015148945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005280983,0.00015737503,0.0002063564,0.00029905373,0.000040228355,0.0003406966,0.0012007953,0.00011896111,0.000018187819],"category_scores_gemma":[0.00022089834,0.00013094659,0.000034610162,0.0013010218,0.000035234425,0.0011835076,0.00044612805,0.00017454181,0.00023130792],"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.000022084116,0.0006888582,0.1598605,0.000056747453,0.000046842946,0.00005867349,0.0007197212,0.004414773,0.0029539384,0.6027479,0.17503795,0.053391997],"study_design_scores_gemma":[0.005643264,0.0007476815,0.2205956,0.0003734287,0.000024247578,0.00024094882,0.0030356678,0.57861,0.021095967,0.0010946471,0.16459888,0.003939694],"about_ca_topic_score_codex":0.00039776275,"about_ca_topic_score_gemma":0.00007458006,"teacher_disagreement_score":0.74150085,"about_ca_system_score_codex":0.00010188805,"about_ca_system_score_gemma":0.000054551303,"threshold_uncertainty_score":0.5339847},"labels":[],"label_agreement":null},{"id":"W2025162486","doi":"10.1109/mownet.2013.6613797","title":"Using an overlay network to manage the renewable energy in residential areas","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Overlay; Computer science; Overlay network; Scalability; Distributed computing; Computer network; Grid; Peer-to-peer; Smart grid; The Internet; Database; Engineering","score_opus":0.025980161693241,"score_gpt":0.2514518726249369,"score_spread":0.2254717109316959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025162486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07306758,0.00007849029,0.9022772,0.008331982,0.0005496245,0.00032136,2.9563952e-7,0.0007215034,0.014652014],"genre_scores_gemma":[0.8158534,0.0000057255306,0.1746002,0.004290884,0.00024257871,0.000058765538,7.890099e-7,0.00001672753,0.004930887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828285,0.000085362786,0.00023006879,0.00048615405,0.00029825236,0.0006173054],"domain_scores_gemma":[0.9984034,0.000069610556,0.000045087047,0.0013155101,0.000052213436,0.00011422096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003494502,0.00015705681,0.00015967918,0.00017520892,0.00014682104,0.0004880225,0.002257449,0.00008509529,0.000048961643],"category_scores_gemma":[0.000040524577,0.00011608077,0.000033355296,0.0014842248,0.000030995376,0.00068017305,0.0014449791,0.00010409395,0.000070195565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005715455,0.000042028456,0.0011797814,0.000002032543,0.000012795223,0.0000370817,0.00027113195,0.7038953,0.0006909884,0.037372455,0.22641526,0.030075438],"study_design_scores_gemma":[0.000290608,0.00018368648,0.023263665,0.00008052839,0.0000074158525,0.000029512916,0.00017805856,0.7645843,0.0031352155,0.120801374,0.08668909,0.0007565272],"about_ca_topic_score_codex":0.021956323,"about_ca_topic_score_gemma":0.01990584,"teacher_disagreement_score":0.7427859,"about_ca_system_score_codex":0.000082382816,"about_ca_system_score_gemma":0.000026658663,"threshold_uncertainty_score":0.9979783},"labels":[],"label_agreement":null},{"id":"W2025526026","doi":"10.1007/s11042-006-0013-7","title":"Tree-assisted gossiping for overlay video distribution","year":2006,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":42,"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; Gossip; Gossip protocol; Scalability; Computer network; Overlay network; Asynchronous communication; Tree (set theory); Distributed computing; Overlay; Search engine indexing; Bandwidth (computing); Network topology; The Internet; Information retrieval; World Wide Web","score_opus":0.019815803971547356,"score_gpt":0.2551005328562726,"score_spread":0.23528472888472524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025526026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003086249,0.00013863541,0.9905896,0.0041086427,0.000057404726,0.00081183494,0.00017729007,0.0005249994,0.00050531497],"genre_scores_gemma":[0.59797955,0.000015887139,0.39764363,0.00019092465,0.0002902175,0.0030340382,0.0004164412,0.000013793168,0.00041552345],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903476,0.000008481594,0.00020104984,0.00038078974,0.000114892355,0.00026002296],"domain_scores_gemma":[0.99911153,0.00024111973,0.000068099755,0.000437076,0.00007686122,0.00006531674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011573036,0.00011759585,0.00012915392,0.000047231737,0.00024698355,0.00021762586,0.00043577823,0.000080277074,0.0000014054658],"category_scores_gemma":[0.000058083722,0.00011299082,0.000043247215,0.00042499008,0.00005526896,0.00022097188,0.0001543774,0.000069007954,0.000021318285],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002254323,0.000057523706,0.00033958242,0.0000075590297,0.0000055124715,3.38213e-7,0.00002017782,0.00006345163,0.003649318,0.053374093,0.019827427,0.9226528],"study_design_scores_gemma":[0.0007369303,0.000059459624,0.12966155,0.000026308724,0.000019885674,0.000008704243,0.000026750975,0.14410312,0.0057518543,0.01560264,0.70356315,0.00043962704],"about_ca_topic_score_codex":0.000034075118,"about_ca_topic_score_gemma":0.000049021095,"teacher_disagreement_score":0.92221314,"about_ca_system_score_codex":0.000041347997,"about_ca_system_score_gemma":0.000021537875,"threshold_uncertainty_score":0.46076322},"labels":[],"label_agreement":null},{"id":"W2027945131","doi":"10.1016/j.comnet.2012.06.013","title":"A survey of peer-to-peer live video streaming schemes – An algorithmic perspective","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Peer-to-Peer Network Technologies","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":"Queen's University","funders":"","keywords":"Computer science; Network packet; Scalability; Peer-to-peer; Computer network; The Internet; BitTorrent; Multicast; Popularity; Live streaming; PlanetLab; Distributed computing; World Wide Web","score_opus":0.02979444732761806,"score_gpt":0.2894481785821249,"score_spread":0.25965373125450686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027945131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06031357,0.0007207571,0.933742,0.0015598085,0.0019172817,0.00056791183,0.00001709622,0.0009118734,0.00024973962],"genre_scores_gemma":[0.71073604,0.000007837335,0.28754672,0.00060911354,0.00082971214,0.000040466024,0.000020981486,0.000041492178,0.00016764928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956869,0.00033208687,0.0005760612,0.0010465634,0.0009984636,0.0013599073],"domain_scores_gemma":[0.99475455,0.0005184224,0.00023961447,0.0018984559,0.0018731506,0.00071579916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020774002,0.0005194887,0.0006818525,0.00046164013,0.00019489015,0.00028738347,0.0032469511,0.0003145212,0.00001538982],"category_scores_gemma":[0.000422204,0.0005204804,0.00013830785,0.0020104093,0.00013837597,0.0011020919,0.0025346922,0.0005950909,0.00010736142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006923872,0.0008820304,0.04565979,0.000025516812,0.0003796974,0.0000480453,0.013023228,0.061584707,0.00008048168,0.02035496,0.0941021,0.7637902],"study_design_scores_gemma":[0.00047391414,0.0006841004,0.18899073,0.00013469678,0.000023961536,0.00003811033,0.0002546376,0.80090714,0.00030073684,0.00064956176,0.0065322905,0.0010101134],"about_ca_topic_score_codex":0.0005828383,"about_ca_topic_score_gemma":0.00017333268,"teacher_disagreement_score":0.7627801,"about_ca_system_score_codex":0.00026189233,"about_ca_system_score_gemma":0.00011216781,"threshold_uncertainty_score":0.9997247},"labels":[],"label_agreement":null},{"id":"W2028204138","doi":"10.1109/icc.2013.6654992","title":"Secured distributed discovery services in the EPCglobal network","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Interoperability; Service discovery; Computer network; Service (business); Authentication (law); Traceability; Architecture; Computer security; Web service; Database; World Wide Web; Software engineering","score_opus":0.006509895899267915,"score_gpt":0.2109554878840458,"score_spread":0.20444559198477788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028204138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3859021,0.00029069142,0.554333,0.050191574,0.0006891196,0.0009867518,0.000015380116,0.0013753098,0.0062160613],"genre_scores_gemma":[0.97760296,0.000007107564,0.018762339,0.003269254,0.00009463103,0.00009476532,0.000012568424,0.000005008948,0.00015135236],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99846643,0.000071150294,0.00021665271,0.00037011033,0.00031211303,0.0005635509],"domain_scores_gemma":[0.9987478,0.00012822414,0.000049200597,0.0009837719,0.00004207585,0.000048891285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028825438,0.00016327672,0.00015595568,0.000048004436,0.000091397116,0.00074916513,0.0032912998,0.00008792291,0.000013284717],"category_scores_gemma":[0.000020512283,0.000100704085,0.00004408231,0.0015461885,0.00003988624,0.0010165995,0.0009399171,0.00017942798,0.0002566366],"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.000008431708,0.00016880721,0.041037966,0.000023401413,0.00004002359,0.000060270948,0.0011141474,0.0139323175,0.0000773442,0.44346836,0.46061188,0.039457053],"study_design_scores_gemma":[0.0005820125,0.00019175094,0.5617108,0.00011701088,0.00000829912,0.00004532177,0.0009944934,0.16194674,0.00020191367,0.21115234,0.062196795,0.00085253234],"about_ca_topic_score_codex":0.00045833888,"about_ca_topic_score_gemma":0.00075323466,"teacher_disagreement_score":0.59170085,"about_ca_system_score_codex":0.000045247187,"about_ca_system_score_gemma":0.000021005422,"threshold_uncertainty_score":0.7224217},"labels":[],"label_agreement":null},{"id":"W2028675071","doi":"10.1016/j.jnca.2008.02.013","title":"Towards automating overlay network management","year":2008,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"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","keywords":"Computer science; Network management; Overlay network; Overlay; Flexibility (engineering); Service provider; Quality of service; Computer network; Context (archaeology); Network management station; Network management application; Network element; Service (business); Element management system; Distributed computing; Network architecture; World Wide Web; The Internet","score_opus":0.013464228061888402,"score_gpt":0.23554994385651096,"score_spread":0.22208571579462255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028675071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033275993,0.000876116,0.99114144,0.0021655413,0.00036927496,0.000275575,4.5905853e-7,0.00024845288,0.0015955577],"genre_scores_gemma":[0.1439999,0.00041313848,0.8527055,0.001104743,0.0016301553,0.000045631525,7.590669e-7,0.000012498317,0.0000877062],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983373,0.000044043867,0.00054725196,0.00028902752,0.00035709795,0.0004252443],"domain_scores_gemma":[0.99870056,0.000096442316,0.00033357495,0.00054110395,0.00014971461,0.00017859421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004367145,0.00018162926,0.00030616994,0.00013332268,0.00040912064,0.00013248531,0.0012781055,0.00007204643,0.0000022392956],"category_scores_gemma":[0.0000029511805,0.0001630307,0.00009932554,0.0010614902,0.00006144777,0.0002667702,0.000814183,0.0002625209,0.000014781233],"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.000005776699,0.000068545756,0.0012269246,0.000014517121,0.00012256578,0.00007691803,0.00022896187,0.08673331,0.0000030556905,0.12001578,0.19012299,0.60138065],"study_design_scores_gemma":[0.0007350241,0.00040424743,0.078007765,0.00021918386,0.000054484673,0.0019488954,0.000021796315,0.2962728,0.0000139363265,0.06307144,0.55864054,0.00060987234],"about_ca_topic_score_codex":0.0000015817772,"about_ca_topic_score_gemma":0.0000010400332,"teacher_disagreement_score":0.6007708,"about_ca_system_score_codex":0.000050361705,"about_ca_system_score_gemma":0.00004450039,"threshold_uncertainty_score":0.66481984},"labels":[],"label_agreement":null},{"id":"W2028715175","doi":"10.1145/1878537.1878778","title":"Mobile mash-up model based on hybrid P2P using Ajax technology","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ajax; Computer science; Mobile Web; The Internet; Mashup; Mobile computing; Mobile internet; World Wide Web; Mobile technology; Mobile device; Multimedia; Web service; Computer network; Web 2.0","score_opus":0.0158090422400293,"score_gpt":0.2599518565656255,"score_spread":0.24414281432559623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028715175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23550703,0.0000102125505,0.7561314,0.0021615133,0.0005368776,0.0002580451,0.00000289128,0.0025563468,0.0028356677],"genre_scores_gemma":[0.58768034,8.042326e-7,0.4109671,0.00073410716,0.000022298665,0.000042148848,6.8855036e-7,0.000013429341,0.00053905556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810565,0.000013727274,0.00023600293,0.00071141997,0.00033069964,0.0006025124],"domain_scores_gemma":[0.9976487,0.000057127207,0.000068123394,0.0020161269,0.00010845705,0.00010145677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025150753,0.0002427895,0.0002351689,0.00066624844,0.00014815418,0.00012000463,0.0025120182,0.00022586885,0.000025599304],"category_scores_gemma":[0.00011115448,0.00021831498,0.00006447653,0.001010091,0.00013928245,0.00023271583,0.0008892786,0.0005790897,0.00017955394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020039632,0.00027371914,0.0007957327,0.000014612793,0.000022035192,0.00009749075,0.00009172315,0.3062533,0.10685882,0.14912036,0.02320785,0.4132443],"study_design_scores_gemma":[0.00018032012,0.00013495122,0.000010705,0.000010207949,0.0000028789384,0.000021760405,0.000009061455,0.8895722,0.08953798,0.016412057,0.0038520729,0.00025577802],"about_ca_topic_score_codex":0.000014737694,"about_ca_topic_score_gemma":0.000020791349,"teacher_disagreement_score":0.58331895,"about_ca_system_score_codex":0.000063002466,"about_ca_system_score_gemma":0.00012358143,"threshold_uncertainty_score":0.8902626},"labels":[],"label_agreement":null},{"id":"W2028895514","doi":"10.1109/icws.2010.88","title":"Analyzing the Relationships between some Parameters of Web Services Reputation","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reputation; Popularity; Computer science; Web service; World Wide Web; Service (business); Business","score_opus":0.027868293796795156,"score_gpt":0.2582044745555772,"score_spread":0.23033618075878207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028895514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9164613,0.000022058963,0.07500612,0.00716203,0.00015844632,0.00012588156,0.0000013087854,0.0004073294,0.00065552245],"genre_scores_gemma":[0.83774424,0.0000022098982,0.1620713,0.0000738181,0.000020616095,0.0000075246617,0.0000016647774,0.0000037162554,0.00007494475],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991357,0.00005293104,0.00023347705,0.0002292654,0.00018170652,0.00016695102],"domain_scores_gemma":[0.9985355,0.00044939373,0.00012161966,0.0007820994,0.00007339416,0.000037974045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000720738,0.000081186765,0.0001116154,0.00016022979,0.00013437295,0.00010228216,0.0012571004,0.00008788385,0.0000033107672],"category_scores_gemma":[0.00014162537,0.000055866207,0.000039770355,0.0007747136,0.000057502868,0.00052198174,0.00031470912,0.00031592388,0.000041829055],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006461931,0.000051273742,0.49411392,0.000048378795,0.0001489745,0.0000041453445,0.0031263563,0.0045931176,0.018166145,0.30517575,0.0030807883,0.17148468],"study_design_scores_gemma":[0.00028189013,0.000120132085,0.5537424,0.000050602543,0.000049458427,0.000007349997,0.0006037218,0.16947268,0.028534556,0.24436033,0.0022909157,0.00048598426],"about_ca_topic_score_codex":0.000048785405,"about_ca_topic_score_gemma":0.00014584411,"teacher_disagreement_score":0.17099869,"about_ca_system_score_codex":0.000010052862,"about_ca_system_score_gemma":0.000023814671,"threshold_uncertainty_score":0.23360263},"labels":[],"label_agreement":null},{"id":"W2029140734","doi":"10.1145/957013.957119","title":"Design of a multi-sender 3D videoconferencing application over an end system multicast protocol","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; Communication source; Videoconferencing; Protocol (science); Xcast; IP multicast; Protocol Independent Multicast; Source-specific multicast; Multimedia; Medicine","score_opus":0.05386702644412992,"score_gpt":0.3068545901571064,"score_spread":0.2529875637129765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029140734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005429078,0.0000020209297,0.9598849,0.0000427976,0.00003700682,0.03750993,7.0408976e-7,0.0008570781,0.001122677],"genre_scores_gemma":[0.4556862,4.8685216e-8,0.5133638,0.00003654655,0.0000069239863,0.030847711,2.7746478e-7,0.000008698173,0.000049785594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826705,0.0001511689,0.0003735298,0.00055423955,0.0003130185,0.00034101045],"domain_scores_gemma":[0.99832267,0.00010364692,0.00014754366,0.0011598578,0.00016756164,0.000098736324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005987256,0.00018949117,0.00023109907,0.00017835794,0.000072262505,0.00009117237,0.00093852583,0.00012517722,0.000011121467],"category_scores_gemma":[0.00008675991,0.00016189857,0.00003130069,0.0005333914,0.0000451449,0.00038564755,0.0001930169,0.000116744,0.000040052946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051770552,0.0009783987,0.0029514092,0.00042320372,0.00009105917,0.000026009679,0.0022810835,0.03910395,0.15931714,0.5240337,0.0007478063,0.26999447],"study_design_scores_gemma":[0.00066966494,0.00013977474,0.0007639895,0.000044382494,0.0000045622146,0.000017330249,0.00015822703,0.94127953,0.05529581,0.00029813626,0.0010725581,0.00025603938],"about_ca_topic_score_codex":0.00007271975,"about_ca_topic_score_gemma":0.000027351127,"teacher_disagreement_score":0.90217555,"about_ca_system_score_codex":0.000110082365,"about_ca_system_score_gemma":0.00009879712,"threshold_uncertainty_score":0.6602032},"labels":[],"label_agreement":null},{"id":"W2031177183","doi":"10.1007/s11265-009-0340-9","title":"On the Efficiency of Peer-to-Peer File Sharing","year":2009,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","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":"Concordia University","funders":"","keywords":"File sharing; Computer science; Upload; Peer-to-peer; Download; Bandwidth (computing); Computer network; Distributed computing; World Wide Web; The Internet","score_opus":0.022929231416888265,"score_gpt":0.2619962443118122,"score_spread":0.2390670128949239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031177183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18352412,0.0011042126,0.7806455,0.028334022,0.00090016215,0.0005499193,0.0000130292465,0.00028236158,0.0046466673],"genre_scores_gemma":[0.9916608,9.3212896e-7,0.0068047275,0.00046487042,0.00022045769,0.000005418624,3.3150548e-7,0.000011310603,0.0008311918],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965646,0.000060363967,0.0008390885,0.0002986981,0.0018287929,0.00040840686],"domain_scores_gemma":[0.9969495,0.00028980483,0.00078614743,0.0004761435,0.0013536742,0.00014474087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024589938,0.00020928291,0.000428654,0.00044953375,0.00020208972,0.0004927155,0.003033029,0.000099663535,0.00001597154],"category_scores_gemma":[0.0007212401,0.00013255113,0.00011908078,0.0013352274,0.000047240355,0.00042807445,0.0001972937,0.00046610404,0.00002740223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002029995,0.00082646887,0.00040542815,0.0003330831,0.00013110091,0.00032045378,0.008729056,0.17682928,0.043361254,0.039144028,0.4825128,0.24720404],"study_design_scores_gemma":[0.0028095837,0.016074961,0.0062667844,0.024473539,0.00016317778,0.0030788858,0.00429439,0.7438039,0.07514002,0.052036263,0.06866425,0.0031941943],"about_ca_topic_score_codex":0.000006831068,"about_ca_topic_score_gemma":4.149008e-7,"teacher_disagreement_score":0.80813664,"about_ca_system_score_codex":0.00011391673,"about_ca_system_score_gemma":0.00017002295,"threshold_uncertainty_score":0.5636173},"labels":[],"label_agreement":null},{"id":"W2032555056","doi":"10.1504/ijamc.2008.020180","title":"Scalability measurement of a proxy-based multimedia content repurposing system","year":2008,"lang":"en","type":"article","venue":"International Journal of Advanced Media and Communication","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Repurposing; Scalability; Proxy (statistics); Multimedia; Computer network; World Wide Web; Database; Machine learning","score_opus":0.04745059848511044,"score_gpt":0.26720643427504664,"score_spread":0.2197558357899362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032555056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5985998,0.0025080561,0.39134127,0.0062642293,0.00074145565,0.00031009896,0.0000037610714,0.00009586751,0.00013543617],"genre_scores_gemma":[0.77333665,0.00017685734,0.22639829,0.000049369715,0.000022084148,0.00001015286,0.0000011925235,0.0000035029284,0.0000019260615],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998248,0.000097589575,0.00057544926,0.00012773692,0.00084893947,0.00010227403],"domain_scores_gemma":[0.99665976,0.00023801085,0.00056659017,0.00050368416,0.001955216,0.000076732824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007982445,0.00009102997,0.00020897525,0.00020785398,0.00005697996,0.000023542772,0.0014097479,0.00004281648,5.258265e-7],"category_scores_gemma":[0.0008009148,0.00007886025,0.0000618537,0.0001663741,0.00012216702,0.0003384342,0.00024287414,0.00017405237,7.619027e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065070705,0.0008103194,0.02479896,0.00009436929,0.00029235968,0.00007802847,0.0059175165,0.0066778967,0.10701933,0.008306804,0.0003498316,0.8450039],"study_design_scores_gemma":[0.012337274,0.0016939855,0.28189984,0.0070830975,0.000108872206,0.0017236453,0.0031157502,0.20461069,0.47002375,0.009421573,0.006828759,0.0011527324],"about_ca_topic_score_codex":0.000012279587,"about_ca_topic_score_gemma":0.000009460452,"teacher_disagreement_score":0.84385115,"about_ca_system_score_codex":0.00025567372,"about_ca_system_score_gemma":0.00013409529,"threshold_uncertainty_score":0.32158276},"labels":[],"label_agreement":null},{"id":"W2033132959","doi":"10.1109/infcom.2013.6566975","title":"Minimum-delay overlay multicast","year":2013,"lang":"lv","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Overlay multicast; Computer network; Overlay network; Latency (audio); Source-specific multicast; Tree (set theory); Protocol Independent Multicast; Xcast; Distributed computing; Pragmatic General Multicast; Network delay; Node (physics); Overlay; Algorithm; Mathematics; Network packet; Telecommunications","score_opus":0.018525276776509742,"score_gpt":0.24555479467928545,"score_spread":0.2270295179027757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033132959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.271964,0.0009687465,0.5126201,0.10317184,0.005562765,0.0028291678,0.000019039835,0.005516016,0.097348295],"genre_scores_gemma":[0.79029757,0.00002811647,0.1801598,0.002930909,0.00021543364,0.00009368482,0.0000016697912,0.000034850385,0.02623796],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960403,0.00008183456,0.00060694676,0.00119879,0.0007167312,0.0013554211],"domain_scores_gemma":[0.9964077,0.00032701425,0.00013652914,0.0023472768,0.00033199234,0.0004494706],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032256075,0.0005126263,0.00047547568,0.00032790436,0.00020879279,0.00097353786,0.0035707965,0.00038660245,0.0013229337],"category_scores_gemma":[0.0002906336,0.0004505533,0.00016785006,0.0013581908,0.00024011961,0.0009837471,0.002663846,0.00048157971,0.032012187],"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.0000065482322,0.00026921814,0.0010931288,0.000025217869,0.00008747768,0.00009933328,0.0009217981,0.00034775873,0.002961399,0.035152674,0.6728383,0.2861972],"study_design_scores_gemma":[0.0013371428,0.0010372336,0.022931373,0.00021922198,0.00004902155,0.00014096154,0.00066021306,0.6809332,0.007829928,0.008789265,0.2736259,0.0024465497],"about_ca_topic_score_codex":0.0005860283,"about_ca_topic_score_gemma":0.00006904011,"teacher_disagreement_score":0.6805854,"about_ca_system_score_codex":0.00013839733,"about_ca_system_score_gemma":0.0001053692,"threshold_uncertainty_score":0.9997946},"labels":[],"label_agreement":null},{"id":"W2034176698","doi":"10.1016/j.comcom.2008.11.020","title":"Semantic partitioning of peer-to-peer search space","year":2008,"lang":"en","type":"article","venue":"Computer Communications","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":"University of Calgary","funders":"","keywords":"Computer science; Distributed hash table; Scalability; Overlay network; Partition (number theory); Peer-to-peer; Ontology; Hash table; Tree (set theory); Computer network; Node (physics); Distributed computing; Hash function; Database; World Wide Web; The Internet","score_opus":0.0768528716881432,"score_gpt":0.3084912734126142,"score_spread":0.23163840172447098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034176698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030856328,0.00017272892,0.88673204,0.07852653,0.00021424588,0.000351049,0.000006604912,0.0007228575,0.0024176259],"genre_scores_gemma":[0.53510594,0.000025918927,0.46380448,0.00041628192,0.00003473838,0.000037075653,0.0000091548445,0.000011309273,0.0005550798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778426,0.00017509241,0.0004197178,0.0004260898,0.0007358718,0.0004589567],"domain_scores_gemma":[0.99310017,0.00039261498,0.00009655674,0.0052156793,0.001004454,0.00019054204],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00061896053,0.0001936013,0.00030059772,0.0004315112,0.0005374915,0.000114697126,0.006637746,0.00009073463,0.000006683925],"category_scores_gemma":[0.00017037349,0.00020983959,0.00009678379,0.0018556674,0.00026445644,0.00032266206,0.005700149,0.00038579077,0.00035518876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012933549,0.00094971835,0.01575597,0.000057270317,0.00019363692,0.00004898767,0.02042123,0.041827627,0.0020488047,0.48230284,0.3418768,0.09450418],"study_design_scores_gemma":[0.0007897221,0.0005898488,0.0842247,0.00035248086,0.000028533264,0.00027376867,0.00020586468,0.61715806,0.0071185897,0.008674037,0.27934667,0.0012376908],"about_ca_topic_score_codex":0.00009906387,"about_ca_topic_score_gemma":0.000050662708,"teacher_disagreement_score":0.57533044,"about_ca_system_score_codex":0.00007754483,"about_ca_system_score_gemma":0.0001235119,"threshold_uncertainty_score":0.9987368},"labels":[],"label_agreement":null},{"id":"W2034620320","doi":"10.1145/1384271.1384311","title":"Spamulator","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.024740210681765212,"score_gpt":0.22228467634652396,"score_spread":0.19754446566475875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034620320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13745968,0.00004131968,0.8269367,0.006840743,0.00025935774,0.00008587991,2.009484e-7,0.0023881805,0.025987893],"genre_scores_gemma":[0.7265799,0.0000035290966,0.26929995,0.00094545056,0.000025073961,0.0000048617867,9.177671e-8,0.0000029223263,0.003138208],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933195,0.0000058148653,0.00007857442,0.00021593475,0.0001588916,0.0002088482],"domain_scores_gemma":[0.9992682,0.000023280958,0.000012379365,0.0006081083,0.000028863597,0.000059193335],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005317493,0.00006492711,0.0000720054,0.000077571625,0.00006949617,0.000024803388,0.0010322947,0.00003812629,0.000017880273],"category_scores_gemma":[0.000032489315,0.000054391585,0.000023259907,0.00043810112,0.000028111746,0.000166613,0.00045165364,0.000059148697,0.0008347114],"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.0000021383628,0.000061089195,0.009147574,0.000002331827,0.000014166009,0.00022239781,0.0004361497,0.0005910779,0.001209035,0.41909266,0.47482976,0.09439164],"study_design_scores_gemma":[0.00058466167,0.00033039192,0.094044946,0.000016472757,0.0000030462209,0.0005365501,0.00003212399,0.0704865,0.053996645,0.030436456,0.7484514,0.0010807732],"about_ca_topic_score_codex":0.000013188781,"about_ca_topic_score_gemma":0.0000050009257,"teacher_disagreement_score":0.5891202,"about_ca_system_score_codex":0.000017790477,"about_ca_system_score_gemma":0.000021330527,"threshold_uncertainty_score":0.99994326},"labels":[],"label_agreement":null},{"id":"W2035780607","doi":"10.1109/tnet.2011.2166087","title":"Insights on Media Streaming Progress Using BitTorrent-Like Protocols for On-Demand Streaming","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Computer science; Upload; Download; Bandwidth (computing); Peer-to-peer; Real Time Streaming Protocol; Computer network; Probabilistic logic; On demand; Distributed computing; The Internet; Multimedia; World Wide Web","score_opus":0.10056895592961519,"score_gpt":0.30897624665017687,"score_spread":0.2084072907205617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035780607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0408164,0.00008687455,0.94419205,0.00019064426,0.003427821,0.009449875,0.000013812615,0.0015149136,0.0003076299],"genre_scores_gemma":[0.84907895,0.0000110445,0.14373578,0.00023431933,0.0005557853,0.006250035,0.000003618868,0.00008360413,0.000046844336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963905,0.000111401096,0.0006068678,0.0012012181,0.0006661411,0.0010238681],"domain_scores_gemma":[0.99693465,0.0006244288,0.00027758695,0.0017746893,0.0001448208,0.00024384198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033221938,0.0005855371,0.0004990336,0.00073982764,0.0008308924,0.00029631075,0.0020866813,0.00031103758,0.0000068123],"category_scores_gemma":[0.00003291709,0.00055302633,0.00022180083,0.0013119655,0.00013336724,0.0004741756,0.000056934503,0.0006371591,0.00002253608],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026844838,0.0007948545,0.00026992275,0.00007205718,0.00016539604,0.000061058876,0.0030938447,0.045516394,0.00045836033,0.0016495135,0.00032020302,0.94732994],"study_design_scores_gemma":[0.0076155467,0.008422899,0.0025392468,0.013341684,0.00038312303,0.00011502349,0.0009647845,0.77280074,0.11662978,0.025005538,0.04587204,0.0063096066],"about_ca_topic_score_codex":0.000021252925,"about_ca_topic_score_gemma":0.00010246014,"teacher_disagreement_score":0.9410203,"about_ca_system_score_codex":0.0002914785,"about_ca_system_score_gemma":0.000103128674,"threshold_uncertainty_score":0.99969214},"labels":[],"label_agreement":null},{"id":"W2035937973","doi":"10.1016/j.jpdc.2011.04.003","title":"HD Tree: A novel data structure to support multi-dimensional range query for P2P networks","year":2011,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Peer-to-Peer Network Technologies","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 Ottawa","funders":"","keywords":"Computer science; Distributed computing; Static routing; Range query (database); Routing (electronic design automation); Dynamic Source Routing; Multipath routing; Tree (set theory); Destination-Sequenced Distance Vector routing; Computer network; Routing protocol; Web search query; Mathematics; Sargable; Information retrieval","score_opus":0.09141247208430599,"score_gpt":0.29746708846716274,"score_spread":0.20605461638285677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035937973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04280391,0.00027628455,0.9548511,0.0009720759,0.000563374,0.0002467744,0.00017318495,0.00010176357,0.000011512257],"genre_scores_gemma":[0.52119833,0.0000038662765,0.47817335,0.0003779367,0.00018476135,0.0000013451173,0.000041980988,0.000009025127,0.000009390133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979222,0.0000339077,0.000684349,0.00047692284,0.00033411616,0.00054849556],"domain_scores_gemma":[0.9980436,0.00020263603,0.00043527284,0.00067441835,0.0003242925,0.00031975913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007464035,0.00025622643,0.00047471223,0.00018067884,0.0002033511,0.00014733955,0.0021182182,0.00015258612,0.0000040715827],"category_scores_gemma":[0.00026787497,0.00021163985,0.00009296674,0.0004744799,0.000048781614,0.0004127347,0.0017006692,0.000362569,0.0000016779536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012040492,0.0011185473,0.027203,0.00013405342,0.0008219357,0.0006425334,0.0022346156,0.3759366,0.0018882721,0.010107114,0.22254175,0.35616755],"study_design_scores_gemma":[0.0026653036,0.0007514565,0.046811894,0.00015894974,0.00005522134,0.00071047875,0.0000939672,0.94268423,0.000068401045,0.0010942187,0.0044095567,0.0004963422],"about_ca_topic_score_codex":0.000016668531,"about_ca_topic_score_gemma":0.0000372806,"teacher_disagreement_score":0.5667476,"about_ca_system_score_codex":0.00004761132,"about_ca_system_score_gemma":0.00010640198,"threshold_uncertainty_score":0.86304224},"labels":[],"label_agreement":null},{"id":"W2036202391","doi":"10.1109/icassp.2010.5496015","title":"Joint pollution detection and attacker identification in peer-to-peer live streaming","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer security; Upload; Distrust; Identification (biology); Overhead (engineering); Pollution; Computer network; Live streaming; Internet privacy; World Wide Web; Operating system","score_opus":0.015836930820444323,"score_gpt":0.2545273134632851,"score_spread":0.2386903826428408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036202391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6745949,0.000007741422,0.31213066,0.011688012,0.0005191307,0.0002632006,0.0000013459695,0.00045618677,0.00033885485],"genre_scores_gemma":[0.95008177,0.0000019696122,0.04812756,0.0002560616,0.00005713897,0.000047051974,0.000001785092,0.000009175054,0.001417505],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99834645,0.000029835604,0.00029007974,0.0005608029,0.000450355,0.00032249957],"domain_scores_gemma":[0.99888474,0.00003503721,0.000071166425,0.00064360216,0.00026180892,0.0001036415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008236477,0.00014936963,0.00013916813,0.00049480033,0.00011220147,0.00028622782,0.00048340636,0.00015478687,0.000009858722],"category_scores_gemma":[0.00055120874,0.00014574343,0.000026753876,0.00083570956,0.000041468953,0.0005796568,0.00043680842,0.00030982986,0.00020283808],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009197838,0.00007216736,0.004318901,0.0000096988315,0.00001023508,0.000009065071,0.0019154962,0.00042431717,0.4410513,0.011358809,0.0032449164,0.5375759],"study_design_scores_gemma":[0.00038368683,0.00016998724,0.7574761,0.00003564362,0.0000076089955,0.00004160996,0.0004949524,0.066154286,0.15978268,0.006905557,0.007974047,0.0005738548],"about_ca_topic_score_codex":0.00031668815,"about_ca_topic_score_gemma":0.0034690371,"teacher_disagreement_score":0.7531572,"about_ca_system_score_codex":0.00008898175,"about_ca_system_score_gemma":0.000022792123,"threshold_uncertainty_score":0.5943244},"labels":[],"label_agreement":null},{"id":"W2036261506","doi":"10.1006/jnca.2000.0114","title":"The design and implementation of a MOO","year":2000,"lang":"en","type":"article","venue":"Journal of Network and Computer 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":"Acadia University","funders":"Mashhad University of Medical Sciences","keywords":"Computer science; Server; Event (particle physics); Universe; Distributed computing; World Wide Web; Astrophysics; Physics","score_opus":0.010675612820217529,"score_gpt":0.2609123807247081,"score_spread":0.2502367679044906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036261506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012243655,0.0009236733,0.9837449,0.002755723,0.000040770086,0.00022543222,3.6254315e-7,0.000024506384,0.000040931132],"genre_scores_gemma":[0.3617797,0.001360738,0.6361392,0.0003326331,0.00030814903,0.000040540926,2.9627125e-7,0.0000057373154,0.000032973916],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992653,0.000042933752,0.0003048903,0.000110631496,0.00013296814,0.00014325231],"domain_scores_gemma":[0.9992457,0.00021419977,0.00016315587,0.00022905011,0.00008948924,0.00005842005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004196836,0.00006928845,0.00012085619,0.000043773514,0.00018013486,0.00010209344,0.00050599326,0.000026193604,0.000001986441],"category_scores_gemma":[0.0000011769711,0.000048765265,0.000027203321,0.00033881207,0.00005242445,0.000128346,0.000120239696,0.00009138972,0.0000014555424],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005052394,0.000010434877,0.0002646824,0.0000018320972,0.000021397203,6.7858286e-7,0.0001475996,0.0059159514,0.000013515113,0.0178899,0.009418762,0.9663102],"study_design_scores_gemma":[0.0012754475,0.0012747268,0.06960241,0.00009244314,0.00007352324,0.000579658,0.00014494556,0.28140032,0.00035660618,0.17316937,0.4715991,0.0004314308],"about_ca_topic_score_codex":0.0000025213271,"about_ca_topic_score_gemma":0.000002809069,"teacher_disagreement_score":0.9658788,"about_ca_system_score_codex":0.00000973328,"about_ca_system_score_gemma":0.000028296898,"threshold_uncertainty_score":0.19885898},"labels":[],"label_agreement":null},{"id":"W2036310024","doi":"10.1109/lcn.2012.6423681","title":"Dynamic file bundling for large-scale content distribution","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"National ICT Australia","keywords":"Computer science; Scale (ratio); Content distribution; Database; Computer network","score_opus":0.02660004672230649,"score_gpt":0.2603388783462177,"score_spread":0.23373883162391124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036310024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01275089,0.00011459315,0.982877,0.002123494,0.0004414862,0.0002783045,0.00021262691,0.00084373594,0.00035786748],"genre_scores_gemma":[0.7650692,0.0000030034603,0.23274787,0.0003055854,0.000043822896,0.00013549751,0.00014274124,0.000006873635,0.0015454239],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989108,0.0000103748835,0.00014808317,0.00022764028,0.00014017378,0.00056291826],"domain_scores_gemma":[0.99922645,0.00011341771,0.000040591978,0.00044872434,0.00007696771,0.0000938384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028703912,0.000102866295,0.00011828669,0.000041645668,0.00012169954,0.00007029289,0.00063686876,0.000072360555,0.00004531178],"category_scores_gemma":[0.00012667224,0.000088941895,0.000058495105,0.0002540095,0.00001414208,0.00037240182,0.00038225387,0.00007244983,0.00011761938],"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.000017678305,0.00059556856,0.0059020817,0.000050210696,0.000059742357,0.000001917359,0.0009551997,0.000573561,0.0029257315,0.3099339,0.5431084,0.135876],"study_design_scores_gemma":[0.00051618245,0.00017078458,0.018601116,0.000037451722,0.0000101306105,0.00001250396,0.00027668168,0.56396437,0.0039964183,0.0033763612,0.4085557,0.00048231607],"about_ca_topic_score_codex":0.000009958178,"about_ca_topic_score_gemma":0.00004909974,"teacher_disagreement_score":0.7523183,"about_ca_system_score_codex":0.00010297449,"about_ca_system_score_gemma":0.0000120172435,"threshold_uncertainty_score":0.36269453},"labels":[],"label_agreement":null},{"id":"W2037090227","doi":"10.1145/2658537.2658539","title":"Reducing the negative effects of inconsistencies in networked games","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Networks of Centres of Excellence of Canada","keywords":"Consistency (knowledge bases); Computer science; Usability; Key (lock); Component (thermodynamics); Human–computer interaction; Computer security; Artificial intelligence","score_opus":0.0073720829468008385,"score_gpt":0.2152945278344558,"score_spread":0.20792244488765496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037090227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64487463,0.00024247986,0.33045277,0.0098592555,0.00057983055,0.0005584055,1.7590776e-7,0.0006222011,0.012810266],"genre_scores_gemma":[0.9381511,0.0000064672,0.061104238,0.00044389316,0.000028922783,0.000029391415,7.363853e-8,0.0000044100907,0.00023150703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892783,0.00013448992,0.00021014742,0.00026604108,0.00018639023,0.0002751099],"domain_scores_gemma":[0.99767023,0.0014230462,0.00007898365,0.00074238057,0.000055437213,0.00002990208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005377351,0.00011259601,0.00020223536,0.0001304761,0.000052346073,0.000048950813,0.0012866507,0.000055446115,0.0000013558629],"category_scores_gemma":[0.0008843671,0.000071320894,0.000038452818,0.0009665066,0.00013861257,0.0001560509,0.0006765852,0.00014543622,0.000010580258],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014543969,0.00008905136,0.0062648114,0.00007317274,0.000049771574,0.000012543928,0.0070765805,0.01916356,0.004000999,0.26293087,0.018565381,0.6817587],"study_design_scores_gemma":[0.0012156608,0.0008341926,0.1437914,0.00079158443,0.000019798086,0.000020732225,0.0009222854,0.51224804,0.18766819,0.14532064,0.0062909694,0.000876503],"about_ca_topic_score_codex":0.00019206997,"about_ca_topic_score_gemma":0.00017805633,"teacher_disagreement_score":0.6808822,"about_ca_system_score_codex":0.000029161616,"about_ca_system_score_gemma":0.000027312455,"threshold_uncertainty_score":0.29083815},"labels":[],"label_agreement":null},{"id":"W2037186450","doi":"10.1007/s12083-009-0040-z","title":"Editorial: Special issue on mobile P2P networking and computing","year":2009,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Server; Distributed computing; Mobile computing; Multicast; Scalability; Overlay network; Shared resource; The Internet; World Wide Web; Operating system","score_opus":0.008716586641333486,"score_gpt":0.2768795556822618,"score_spread":0.2681629690409283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037186450","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003826631,0.00066240365,0.07835566,0.007484116,0.9037917,0.0028253656,0.00008903848,0.0019442394,0.004809154],"genre_scores_gemma":[0.0006878467,0.00024192821,0.026582599,0.00084098574,0.96763265,0.0008649703,0.00021951775,0.00015095859,0.0027785173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99094903,0.000152773,0.001127511,0.0030058527,0.0029241405,0.0018407066],"domain_scores_gemma":[0.99315435,0.0018846821,0.0005046942,0.0023554452,0.0011599947,0.00094084645],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0021853459,0.0012360325,0.0013318274,0.0008169376,0.0013848739,0.0019505338,0.0034063053,0.0015021503,0.000006078566],"category_scores_gemma":[0.0004426791,0.0013495098,0.00018406245,0.002788178,0.00016190705,0.00021708559,0.002507524,0.0023889635,0.00027862692],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017661408,0.00005702522,0.000010700212,0.000018789067,0.000036216832,0.000004797016,0.00033690152,0.0044173035,0.0000049686373,0.0005360527,0.66686124,0.32769838],"study_design_scores_gemma":[0.00038339826,0.00046358496,0.0000391493,0.00048834493,0.00006789761,0.000007644806,0.000044321147,0.0026073453,0.0000106587995,0.0021048079,0.9923945,0.0013883577],"about_ca_topic_score_codex":0.000080601036,"about_ca_topic_score_gemma":0.00006185638,"teacher_disagreement_score":0.32631,"about_ca_system_score_codex":0.00035088148,"about_ca_system_score_gemma":0.00021808269,"threshold_uncertainty_score":0.9999152},"labels":[],"label_agreement":null},{"id":"W2037491203","doi":"10.1007/s12083-010-0076-0","title":"Measurement and enhancement of BitTorrent-based video file swarming","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"BitTorrent; Computer science; Swarm behaviour; BitTorrent tracker; Upload; File sharing; The Internet; Computer network; Peer-to-peer; World Wide Web; Artificial intelligence","score_opus":0.019606248683532314,"score_gpt":0.2570765666461239,"score_spread":0.23747031796259158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037491203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023160072,0.00028894193,0.9531492,0.020198122,0.000533953,0.0012708633,0.000042824897,0.0005153719,0.00084065594],"genre_scores_gemma":[0.83409625,0.000008624785,0.16311139,0.00081391085,0.0003438827,0.0012372865,0.000017511507,0.00002479977,0.00034634242],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970959,0.00002995341,0.000464295,0.00084639684,0.0009904845,0.0005729946],"domain_scores_gemma":[0.9975507,0.00017690442,0.00015485902,0.001119896,0.0006232684,0.00037435003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011454751,0.0002906331,0.0003324949,0.00031638346,0.00034132102,0.00021467153,0.0010205875,0.00012001711,0.000018729368],"category_scores_gemma":[0.00018998054,0.00029570994,0.00005402496,0.0012330363,0.00009227643,0.00010450633,0.00067799113,0.00032029432,0.00004377331],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014667966,0.0002150082,0.0015648812,0.000055597757,0.000050170795,0.0000019284075,0.0006128293,0.0017494577,0.03144225,0.007445164,0.09489335,0.8619547],"study_design_scores_gemma":[0.00032708904,0.00016977353,0.0032157945,0.00019415311,0.000030701667,0.0000068087547,0.000049679707,0.015349386,0.01708197,0.0014380919,0.9615715,0.00056502176],"about_ca_topic_score_codex":0.000060252758,"about_ca_topic_score_gemma":0.00011444881,"teacher_disagreement_score":0.8666782,"about_ca_system_score_codex":0.000058280988,"about_ca_system_score_gemma":0.00008387064,"threshold_uncertainty_score":0.9999495},"labels":[],"label_agreement":null},{"id":"W2039123032","doi":"10.1109/cgc.2013.23","title":"An Energy Perspective of Multimedia Streaming Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Router; Computer network; Efficient energy use; Idle; Underlay; Protocol (science); Power (physics); Real Time Streaming Protocol; Peer-to-peer; Multimedia; The Internet; Telecommunications; World Wide Web; Electrical engineering; Engineering; Operating system","score_opus":0.009651252999213723,"score_gpt":0.2353231937400657,"score_spread":0.22567194074085198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039123032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06611323,0.00019932428,0.9183892,0.0011829443,0.00038207005,0.0002194135,0.0000015337589,0.0011588096,0.012353442],"genre_scores_gemma":[0.8824967,0.0000030541091,0.11690001,0.00005502991,0.000035799498,0.00003357625,4.5151597e-7,0.000005550712,0.00046983318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903554,0.00003087273,0.00015992075,0.00032076894,0.00021170337,0.00024117834],"domain_scores_gemma":[0.99876887,0.000072277515,0.000058138427,0.00076252705,0.0002526398,0.000085554835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086798704,0.00010456369,0.00015724139,0.00016114427,0.000032788008,0.000099391626,0.0011843713,0.00006704408,0.000012684732],"category_scores_gemma":[0.000048001777,0.00008591052,0.000026335918,0.000403963,0.00004543673,0.00048989034,0.00026966722,0.00005640231,0.00004769518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015399338,0.00013281967,0.0010408621,0.000007922606,0.000040669293,0.000007850699,0.0018950186,0.0026770236,0.016033689,0.8127296,0.008287944,0.15714505],"study_design_scores_gemma":[0.00017755663,0.0002865325,0.0043414882,0.000029612724,0.000003408238,0.000009737193,0.003727588,0.9631525,0.01963828,0.0075482093,0.00078637036,0.00029868732],"about_ca_topic_score_codex":0.0063209543,"about_ca_topic_score_gemma":0.00009546791,"teacher_disagreement_score":0.9604755,"about_ca_system_score_codex":0.0000640111,"about_ca_system_score_gemma":0.000025383953,"threshold_uncertainty_score":0.95554346},"labels":[],"label_agreement":null},{"id":"W2039305010","doi":"10.1007/s12083-010-0077-z","title":"Sparse structures for searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Flooding (psychology); Scalability; Broadcasting (networking); Gossip; Network topology; Computer network; Graph; Theoretical computer science; Distributed computing; Algorithm","score_opus":0.025124280857080246,"score_gpt":0.2963310891151496,"score_spread":0.27120680825806937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039305010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21185164,0.0003313879,0.7661302,0.016313128,0.0011973135,0.0026589197,0.00008283238,0.0010620168,0.00037257816],"genre_scores_gemma":[0.7592356,0.000008325252,0.23644532,0.0010026828,0.0010511829,0.00056955375,0.000040731473,0.000079723344,0.0015668769],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946958,0.00007950805,0.0007537327,0.0018473408,0.0012680663,0.001355549],"domain_scores_gemma":[0.99570847,0.0008735829,0.00023831618,0.0012122652,0.0010378902,0.0009294578],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025031394,0.000650401,0.00068074337,0.00071968656,0.0010393418,0.0020308138,0.0015993603,0.00030232713,0.0000021226242],"category_scores_gemma":[0.000563149,0.0006543484,0.000095283445,0.0016052531,0.00018942333,0.00029685744,0.002225954,0.0009396794,0.000015731484],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040414656,0.00008514347,0.009353082,0.00015684814,0.00016253747,0.00001203079,0.005775759,0.01439462,0.0027821166,0.07682056,0.069876276,0.8205406],"study_design_scores_gemma":[0.0007412537,0.00026222714,0.01232187,0.00028743554,0.00006951335,0.00021326324,0.0004182326,0.35721844,0.0003015802,0.010805571,0.6159829,0.0013777221],"about_ca_topic_score_codex":0.0003764547,"about_ca_topic_score_gemma":0.00016087029,"teacher_disagreement_score":0.8191629,"about_ca_system_score_codex":0.00007173375,"about_ca_system_score_gemma":0.000057923262,"threshold_uncertainty_score":0.99959075},"labels":[],"label_agreement":null},{"id":"W2040603345","doi":"10.1109/iwqos.2010.5542735","title":"SPoIM: A close look at pollution attacks in P2P live streaming","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Emulation; Computer science; Live streaming; Pollution; Reputation; Computer security; Bandwidth (computing); Computer network","score_opus":0.009659842799871587,"score_gpt":0.24586472417352864,"score_spread":0.23620488137365706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040603345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9629945,0.000034758916,0.024470085,0.0048191003,0.00046055904,0.00021525251,0.0000018165549,0.0009021498,0.0061017596],"genre_scores_gemma":[0.9211759,0.0000050547605,0.07617605,0.0004760984,0.000054531913,0.000017884457,0.0000012339791,0.0000078842,0.002085369],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986115,0.000021552847,0.00020414086,0.000482798,0.0002374787,0.0004425319],"domain_scores_gemma":[0.9988745,0.000062531726,0.000051627478,0.00088280014,0.000044472366,0.00008405361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027079094,0.00015245707,0.00015309853,0.0002531332,0.00007882791,0.00009069278,0.0011839775,0.0001647489,0.000056333123],"category_scores_gemma":[0.000118880416,0.00013904322,0.00003962426,0.0006335661,0.000063404776,0.0003518495,0.0012036009,0.00032650479,0.00058681413],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003059754,0.0002775046,0.072148755,0.000017430046,0.000024602365,0.0002695819,0.002642059,0.00054908305,0.048355665,0.13490191,0.037679214,0.7031036],"study_design_scores_gemma":[0.0027952285,0.0008836682,0.54520524,0.00023226827,0.000021676962,0.0003442739,0.00084162323,0.16844407,0.1145789,0.05732187,0.10638375,0.0029474252],"about_ca_topic_score_codex":0.00022704893,"about_ca_topic_score_gemma":0.004497126,"teacher_disagreement_score":0.70015615,"about_ca_system_score_codex":0.0001191288,"about_ca_system_score_gemma":0.000043724114,"threshold_uncertainty_score":0.7542504},"labels":[],"label_agreement":null},{"id":"W2040896821","doi":"10.1049/iet-ifs.2013.0256","title":"PESCA: a peer‐to‐peer social network architecture with privacy‐enabled social communication and data availability","year":2014,"lang":"en","type":"article","venue":"IET Information Security","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Peer-to-peer; Internet privacy; Social network (sociolinguistics); Architecture; Computer network; Computer security; World Wide Web; Social media; Geography","score_opus":0.017336722272956556,"score_gpt":0.2641272520833707,"score_spread":0.24679052981041413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040896821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17159341,0.00002890643,0.69469774,0.12476309,0.00024571051,0.001307506,0.00012537061,0.0015599261,0.0056783324],"genre_scores_gemma":[0.9284384,0.0000027281728,0.06880102,0.0022119768,0.00018454828,0.000051606876,0.00025926295,0.000009061394,0.000041372365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976016,0.00019591089,0.00046026165,0.00038638758,0.00088136754,0.00047445102],"domain_scores_gemma":[0.9969931,0.00015932349,0.00025982768,0.0018559205,0.0006085074,0.00012332555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628014,0.00023960178,0.0003034576,0.00013916106,0.0007226393,0.00064530154,0.003080864,0.00020448843,0.000007355866],"category_scores_gemma":[0.0006478708,0.00021501676,0.000033415,0.00093855883,0.0001592723,0.0023055435,0.003401892,0.0005251039,0.000076019795],"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.00018482644,0.00010486515,0.0026168674,0.00012310312,0.000080044534,8.8265165e-7,0.07185273,0.0019018232,0.000009744973,0.0847718,0.63929856,0.19905476],"study_design_scores_gemma":[0.0009109284,0.0001742627,0.03535484,0.000038268547,0.000022126336,0.000018132117,0.0003427206,0.052473225,0.00004365727,0.03831629,0.87168163,0.0006239286],"about_ca_topic_score_codex":0.000065742584,"about_ca_topic_score_gemma":0.00020674348,"teacher_disagreement_score":0.756845,"about_ca_system_score_codex":0.00008594743,"about_ca_system_score_gemma":0.000086974855,"threshold_uncertainty_score":0.87681293},"labels":[],"label_agreement":null},{"id":"W2040923827","doi":"10.1109/crv.2013.53","title":"ros4mat: A Matlab Programming Interface for Remote Operations of ROS-Based Robotic Devices in an Educational Context","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Robotics; Interface (matter); Computer science; Artificial intelligence; Context (archaeology); MATLAB; Robot; Software; Educational robotics; Application programming interface; Human–computer interaction; Embedded system; Software engineering; Programming language; Operating system","score_opus":0.028248431785029015,"score_gpt":0.3106357389730987,"score_spread":0.2823873071880697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040923827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17210567,0.00006242705,0.812056,0.014467429,0.00011407152,0.0009241158,0.0000011801736,0.00021212714,0.000057003017],"genre_scores_gemma":[0.5529352,2.040163e-7,0.44652516,0.00024948956,0.000009398675,0.000112479414,0.0000036504116,0.000005161045,0.00015929659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988947,0.00002922663,0.00032052278,0.00033376238,0.00014771365,0.0002740761],"domain_scores_gemma":[0.9989453,0.0001461493,0.00005647405,0.00050753215,0.00027986543,0.00006466703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019435889,0.0001229741,0.00018490727,0.00020766695,0.0000626572,0.00027228438,0.001024462,0.00006393643,0.000021639735],"category_scores_gemma":[0.00013133536,0.0001093936,0.00003362295,0.00051532354,0.000050354276,0.000690362,0.00016129365,0.00007927541,0.00003304405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016247997,0.00069997046,0.006746575,0.00013579184,0.000029030254,9.2704744e-7,0.002016985,0.19353022,0.0074864714,0.09385383,0.004001777,0.6914822],"study_design_scores_gemma":[0.00030769923,0.00024664923,0.006408685,0.00009537653,0.000003201068,0.0000023028517,0.00032200728,0.9827568,0.00670368,0.0023098115,0.00064511376,0.00019867916],"about_ca_topic_score_codex":0.0006808257,"about_ca_topic_score_gemma":0.0037754565,"teacher_disagreement_score":0.7892266,"about_ca_system_score_codex":0.00006164729,"about_ca_system_score_gemma":0.00015260403,"threshold_uncertainty_score":0.4460942},"labels":[],"label_agreement":null},{"id":"W2041088506","doi":"10.1007/s12083-008-0010-x","title":"SUPNET: An end-to-end solution to scalable unstructured P2P networking","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Scalability; Computer science; Distributed computing; Protocol (science); Network topology; Computer network; Network dynamics; Network management; End-to-end principle","score_opus":0.02725076734480817,"score_gpt":0.2660315590182152,"score_spread":0.23878079167340702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041088506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03922336,0.00031482268,0.9116745,0.04050651,0.0012848417,0.002476068,0.000044199318,0.002240047,0.0022356766],"genre_scores_gemma":[0.77293116,0.000033378095,0.21590608,0.004707297,0.0026100026,0.0012933731,0.00007881952,0.00009083521,0.0023490335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937344,0.00011637791,0.00079076464,0.0021248867,0.0013684701,0.0018650691],"domain_scores_gemma":[0.9950191,0.0002321471,0.00017488965,0.0024369885,0.0006599036,0.0014769704],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011484087,0.00069645996,0.00067214307,0.0007978637,0.0017208543,0.00066899473,0.0028838941,0.0003300545,0.000016476983],"category_scores_gemma":[0.00011427538,0.0007569917,0.00012347211,0.005396751,0.00014386115,0.00041980445,0.001812913,0.0006016047,0.00041563],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046727157,0.00015881826,0.003791637,0.0000167234,0.00007278057,0.000022463902,0.002893426,0.092533894,0.0025659103,0.009375434,0.18630536,0.7022168],"study_design_scores_gemma":[0.00031577735,0.0002974935,0.009364701,0.00010919053,0.0000342117,0.00012773024,0.00008135057,0.029562159,0.0006305151,0.003426858,0.9548772,0.0011728083],"about_ca_topic_score_codex":0.00029152524,"about_ca_topic_score_gemma":0.00042803414,"teacher_disagreement_score":0.76857185,"about_ca_system_score_codex":0.00028349372,"about_ca_system_score_gemma":0.00013978318,"threshold_uncertainty_score":0.9995788},"labels":[],"label_agreement":null},{"id":"W2041313766","doi":"10.1145/1316624.1316669","title":"Beyond the lan","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Saskatchewan","funders":"","keywords":"Collaborative software; Computer science; The Internet; Computer-supported cooperative work; Network packet; Bandwidth (computing); Multimedia; World Wide Web; Computer network; Work (physics); Engineering","score_opus":0.010742113467502739,"score_gpt":0.24487292797635082,"score_spread":0.2341308145088481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041313766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015491159,0.000046253284,0.81803864,0.024297206,0.00029769674,0.000085864165,1.5295903e-7,0.0009796359,0.14076342],"genre_scores_gemma":[0.84293973,0.0000012788493,0.14764547,0.0053957244,0.00006971604,0.0000037750453,1.7452913e-7,0.0000036825816,0.003940429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993297,0.000006645981,0.000082998864,0.00016134829,0.00016474753,0.00025458905],"domain_scores_gemma":[0.99916196,0.00009792816,0.0000148496665,0.00066249433,0.00002492042,0.00003786571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004510248,0.000056963698,0.00004817859,0.00005481857,0.00007316053,0.00007422769,0.001555387,0.00003489714,0.000010708962],"category_scores_gemma":[0.000034486224,0.00003312508,0.000019675359,0.00049095415,0.000032471202,0.000094471165,0.00050958915,0.00008935939,0.00031011025],"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":[8.038105e-7,0.000008771194,0.00076196284,4.2909429e-7,0.00000400475,0.000013300598,0.00017547111,0.000021428972,0.00026124605,0.6195946,0.08048261,0.29867542],"study_design_scores_gemma":[0.000184398,0.000130501,0.04208177,0.000005399562,0.000003172727,0.000051828625,0.00020496306,0.005200862,0.026325412,0.17053132,0.7549051,0.00037527975],"about_ca_topic_score_codex":0.000017910856,"about_ca_topic_score_gemma":0.00012143418,"teacher_disagreement_score":0.8274486,"about_ca_system_score_codex":0.000015532269,"about_ca_system_score_gemma":0.000009351882,"threshold_uncertainty_score":0.39859432},"labels":[],"label_agreement":null},{"id":"W2041465611","doi":"10.1145/1651274.1651287","title":"Self-organizing peer-to-peer networks for collaborative document tracking","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metadata; Computer science; Dissemination; Peer-to-peer; World Wide Web; Tracking (education); Set (abstract data type); Social network (sociolinguistics); Information exchange; Digital library; Social network analysis; Information retrieval; Social media","score_opus":0.01656152644785293,"score_gpt":0.27082350951801404,"score_spread":0.2542619830701611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041465611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030206637,0.00010704007,0.91028327,0.07778022,0.0006187066,0.0012598711,0.0000033576414,0.0028245572,0.004102342],"genre_scores_gemma":[0.4170389,0.0000066688963,0.57597977,0.0044691777,0.00019942879,0.00007806081,0.00000412607,0.000020202597,0.0022036657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996853,0.000045078163,0.00043400383,0.000897809,0.00080048275,0.0009696027],"domain_scores_gemma":[0.9970761,0.00022529854,0.00011333211,0.0009830456,0.0013372691,0.00026495146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000982844,0.00036245503,0.0003834741,0.0002897647,0.00032470073,0.0008166918,0.0021065918,0.00019582362,0.000011136121],"category_scores_gemma":[0.00040239858,0.00033486745,0.00008651704,0.002607734,0.000022188296,0.00073627225,0.0004907426,0.00025302713,0.000086518994],"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.00004075997,0.00020166909,0.00022795027,0.0000132815185,0.000107050975,0.000039136463,0.0047633243,0.023255771,0.00080987473,0.26434904,0.39107713,0.315115],"study_design_scores_gemma":[0.0017754402,0.0025695276,0.003453233,0.00012737495,0.000058490303,0.000042154345,0.0012780934,0.14085504,0.032566544,0.03689455,0.778054,0.0023255174],"about_ca_topic_score_codex":0.000007590544,"about_ca_topic_score_gemma":0.00003794092,"teacher_disagreement_score":0.4140182,"about_ca_system_score_codex":0.00027802057,"about_ca_system_score_gemma":0.00011203936,"threshold_uncertainty_score":0.99991035},"labels":[],"label_agreement":null},{"id":"W2043056166","doi":"10.1016/j.image.2005.05.006","title":"Overlay multi-hop FEC scheme for video streaming","year":2005,"lang":"en","type":"article","venue":"Signal Processing Image Communication","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Hop (telecommunications); Overlay; Computer network; Video streaming; Scheme (mathematics); Live streaming; Mathematics; Operating system","score_opus":0.03222543792031829,"score_gpt":0.30811320319528557,"score_spread":0.2758877652749673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043056166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036405104,0.00155051,0.98283774,0.009848142,0.000027621478,0.00038949493,0.000003156519,0.0010673038,0.0006354966],"genre_scores_gemma":[0.44142118,0.000009784019,0.5578259,0.00046804917,0.000034699264,0.000090930145,0.000008217953,0.000015265266,0.00012596145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998522,0.000059377697,0.00034185383,0.00042424235,0.00025193856,0.0004006042],"domain_scores_gemma":[0.9977874,0.00021366103,0.00022389504,0.0013177857,0.00037984306,0.00007740506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000601982,0.00020267277,0.00019237443,0.00017830494,0.0005181697,0.0005375689,0.0027692216,0.00009146501,0.0000044761896],"category_scores_gemma":[0.00023641292,0.00020988093,0.00006372011,0.00059261866,0.000114562994,0.0016944763,0.00091095583,0.00027716556,0.000050319926],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011821302,0.00015277916,0.000085710715,0.000048073598,0.000011760448,8.8708987e-7,0.0010482388,0.0005590032,0.050267104,0.0011898007,0.0031021526,0.9435227],"study_design_scores_gemma":[0.00062934554,0.00007642683,0.0004499752,0.00024519564,0.000010668036,0.00000999259,0.00011806774,0.9205761,0.032920584,0.0019127927,0.042627852,0.00042302685],"about_ca_topic_score_codex":0.000012295916,"about_ca_topic_score_gemma":0.000027938939,"teacher_disagreement_score":0.9430996,"about_ca_system_score_codex":0.00015665509,"about_ca_system_score_gemma":0.0001041223,"threshold_uncertainty_score":0.85586965},"labels":[],"label_agreement":null},{"id":"W2043697603","doi":"10.1109/icdcs.2013.62","title":"Watchmen: Scalable Cheat-Resistant Support for Distributed Multi-player Online Games","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Cheating; Scalability; Computer science; Collusion; Latency (audio); Quake (natural phenomenon); Distributed computing; Low latency (capital markets); Computer security; Multimedia; Computer network; Telecommunications; Psychology","score_opus":0.03801365323992976,"score_gpt":0.29313882956352516,"score_spread":0.2551251763235954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043697603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007534561,0.00018577713,0.96796334,0.015713744,0.0013427587,0.002296126,0.0010546814,0.0033805687,0.0005284482],"genre_scores_gemma":[0.07117179,0.000057610185,0.9093456,0.0010005488,0.00020740432,0.0011485434,0.001161934,0.000066116765,0.015840428],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954386,0.000044972872,0.00084575615,0.0018230851,0.000580484,0.0012671171],"domain_scores_gemma":[0.99547505,0.00020151047,0.00028701345,0.0031513686,0.00056057697,0.00032447436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050073996,0.00075329695,0.00093450473,0.00029907978,0.00016125815,0.000664714,0.005081519,0.0007815169,0.00011701043],"category_scores_gemma":[0.00026989906,0.0006334041,0.00031691027,0.00052456395,0.000121026205,0.00031562135,0.007124163,0.00077270815,0.00027724958],"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.000060490558,0.0010818425,0.0005973331,0.0004462191,0.00037654137,0.000056544763,0.00026388242,0.0060654893,0.0022684399,0.01587501,0.91942745,0.05348077],"study_design_scores_gemma":[0.002011166,0.0006258057,0.0058279946,0.00038562235,0.00009880504,0.000022496983,0.0001495956,0.50526434,0.019147363,0.021387478,0.44209042,0.0029888821],"about_ca_topic_score_codex":0.00035053652,"about_ca_topic_score_gemma":0.0002040241,"teacher_disagreement_score":0.49919888,"about_ca_system_score_codex":0.00033810822,"about_ca_system_score_gemma":0.0003423519,"threshold_uncertainty_score":0.99961174},"labels":[],"label_agreement":null},{"id":"W2044671986","doi":"10.1117/12.642585","title":"Correlation-aware multimedia content distribution in overlay networks","year":2006,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overlay; Overlay network; Computer science; Computer network; Distributed computing; Content distribution; Construct (python library); Topology (electrical circuits); Operating system; The Internet; Mathematics","score_opus":0.011115041720890086,"score_gpt":0.21405188297164568,"score_spread":0.2029368412507556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044671986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97219104,0.00010469792,0.021151552,0.0046450873,0.00044925563,0.000656303,0.00003905375,0.0002731879,0.0004898275],"genre_scores_gemma":[0.8543022,0.000032518255,0.14482306,0.00010101141,0.00031858365,0.00020251746,0.000031106913,0.000034264023,0.00015474437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974304,1.958364e-8,0.0007917505,0.0005132215,0.000726413,0.00053823873],"domain_scores_gemma":[0.9979095,0.00021094897,0.00035814595,0.000105285566,0.0013179344,0.000098180986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063324586,0.00032034965,0.00039957682,0.00013747335,0.00007684415,0.00017528696,0.0018175016,0.00027081347,0.0000026043385],"category_scores_gemma":[0.0005263457,0.0002839164,0.00038402097,0.0008394478,0.00016346676,0.0007820411,0.00044188616,0.00041480552,0.00000243467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052803687,0.00019560674,0.005456603,0.00010775426,0.00012882249,4.0664528e-7,0.00011772835,0.015818186,0.04416432,0.9150974,0.01708248,0.0017778733],"study_design_scores_gemma":[0.00104794,0.00020789939,0.021690622,0.00030405,0.00003634683,0.000012032242,0.00028499725,0.95636356,0.014143157,0.0027547441,0.0027186195,0.00043600396],"about_ca_topic_score_codex":0.000050724022,"about_ca_topic_score_gemma":0.0000016924433,"teacher_disagreement_score":0.9405454,"about_ca_system_score_codex":0.00035677105,"about_ca_system_score_gemma":0.000030308065,"threshold_uncertainty_score":0.9999613},"labels":[],"label_agreement":null},{"id":"W2044832800","doi":"10.1007/s12083-014-0252-8","title":"Peer-to-peer as an infrastructure service","year":2014,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; Computer science; Cloud computing; The Internet; File sharing; BitTorrent tracker; Software deployment; Botnet; Peer-to-peer; Service (business); Internet privacy; Service provider; Computer security; World Wide Web; Process (computing); Business","score_opus":0.012793356846929418,"score_gpt":0.2694839227346214,"score_spread":0.256690565887692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044832800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03697714,0.00009007924,0.7017704,0.24659897,0.0010708602,0.0022228404,0.000063287494,0.002827439,0.008378972],"genre_scores_gemma":[0.717406,0.000010358464,0.23554349,0.027990576,0.003106476,0.001885477,0.00016941229,0.00016715862,0.013721079],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99224865,0.00015879249,0.00084882294,0.0024182089,0.0025750306,0.0017504889],"domain_scores_gemma":[0.9912697,0.00037272225,0.00023409618,0.0035999597,0.0028291254,0.0016944022],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022836763,0.00088536274,0.00078394735,0.00077285443,0.0011212102,0.0014075347,0.0047408417,0.00048405287,0.00002860076],"category_scores_gemma":[0.0006063713,0.00091347005,0.00013477966,0.0052312915,0.00010714473,0.00052337267,0.0024803306,0.0009194088,0.0014080283],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036201312,0.00016286757,0.0018723124,0.000037678896,0.00008016524,0.000007964767,0.0036835424,0.03894213,0.0009461437,0.05555104,0.349719,0.548961],"study_design_scores_gemma":[0.00034802605,0.00029145624,0.0065052994,0.00008149701,0.000043577442,0.00006248362,0.0002013582,0.020492874,0.00033582604,0.020256666,0.9502361,0.0011448299],"about_ca_topic_score_codex":0.00028406427,"about_ca_topic_score_gemma":0.00037357426,"teacher_disagreement_score":0.68042886,"about_ca_system_score_codex":0.00019890163,"about_ca_system_score_gemma":0.00014534904,"threshold_uncertainty_score":0.9996291},"labels":[],"label_agreement":null},{"id":"W2045329305","doi":"10.1145/1080829.1080840","title":"Effects of routing computations in content-based routing networks with mobile data sources","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Computer network; Publication; Distributed computing; Policy-based routing; Static routing; Link-state routing protocol; Routing protocol; Routing (electronic design automation); Triangular routing; Dynamic Source Routing; Routing domain; Database","score_opus":0.026367732775935144,"score_gpt":0.25263324535025555,"score_spread":0.2262655125743204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045329305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25144285,0.00012225051,0.7468729,0.00060637883,0.000043558022,0.0003538528,0.0000012120452,0.0004379616,0.000119045515],"genre_scores_gemma":[0.69110876,0.0000011972818,0.3085359,0.00026592598,0.000026947631,0.000023706098,0.000006237268,0.000007982719,0.00002331486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984229,0.00006194726,0.0003405362,0.00050080154,0.0002535332,0.00042025794],"domain_scores_gemma":[0.9980923,0.00069441035,0.00014937393,0.0009295345,0.00007554881,0.000058841622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044438447,0.00016383168,0.00026339485,0.00018490503,0.000084160136,0.00010505933,0.0019777722,0.00007077272,0.0000015258411],"category_scores_gemma":[0.00012159168,0.00013504729,0.000023604822,0.001003337,0.00007164517,0.0004159919,0.0009236446,0.0001955351,0.000006186817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006555326,0.00009221251,0.014506613,0.000013259009,0.000014158011,0.000009823386,0.0002288348,0.91394883,0.00018218835,0.0017014956,0.00018225708,0.06911378],"study_design_scores_gemma":[0.0005947329,0.00012406496,0.007119205,0.00016267119,0.000006659076,0.0000031244563,0.00015104574,0.9875749,0.003946602,0.000014656373,0.00012377945,0.0001785827],"about_ca_topic_score_codex":0.00016130214,"about_ca_topic_score_gemma":0.0005004848,"teacher_disagreement_score":0.43966594,"about_ca_system_score_codex":0.00004864605,"about_ca_system_score_gemma":0.00005330956,"threshold_uncertainty_score":0.55070686},"labels":[],"label_agreement":null},{"id":"W2046732388","doi":"10.1145/1133572.1133576","title":"Separating durability and availability in self-managed storage","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Durability; Redundancy (engineering); Computer science; Reliability engineering; Database; Engineering; Operating system","score_opus":0.009904434273112729,"score_gpt":0.23635748040178886,"score_spread":0.22645304612867614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046732388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8926524,0.000041935604,0.09865816,0.0040990156,0.00007569873,0.0002904728,4.5813496e-7,0.0012682042,0.002913673],"genre_scores_gemma":[0.79650706,0.0000025218924,0.20318584,0.00022089199,0.000007634464,0.000017253564,1.8490094e-7,0.0000034765676,0.00005511699],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985642,0.00005914481,0.0002536725,0.00060300773,0.00018864419,0.0003313605],"domain_scores_gemma":[0.9988695,0.00010919252,0.000038291353,0.00086888805,0.000038396738,0.00007574832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087679474,0.00013746072,0.00018308201,0.00011634912,0.00008153955,0.00011898293,0.00073578575,0.00008116984,0.000005231932],"category_scores_gemma":[0.000250642,0.00012523461,0.000023698181,0.00077087455,0.00006233718,0.00043554677,0.0007669429,0.00021093737,0.00004113477],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043056672,0.0015720538,0.41723117,0.00029918508,0.00007479471,0.00035634282,0.015475602,0.034354284,0.00494561,0.37040102,0.0038025987,0.15144427],"study_design_scores_gemma":[0.0016360631,0.0003475687,0.79353184,0.00005898657,0.000006634291,0.000037952406,0.00033628254,0.058377508,0.0059724757,0.1358711,0.002788553,0.001035048],"about_ca_topic_score_codex":0.00016391298,"about_ca_topic_score_gemma":0.0007201646,"teacher_disagreement_score":0.37630066,"about_ca_system_score_codex":0.0002079436,"about_ca_system_score_gemma":0.000047171598,"threshold_uncertainty_score":0.51069194},"labels":[],"label_agreement":null},{"id":"W2047138894","doi":"10.5555/1944796.1944805","title":"Scaling online games with adaptive interest management in the cloud","year":2010,"lang":"en","type":"article","venue":"Network and System Support for Games","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cloud computing; Scalability; Server; Testbed; Distributed computing; Computer network; Operating system","score_opus":0.02223542185314502,"score_gpt":0.2497810858205466,"score_spread":0.22754566396740156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047138894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6026886,0.000645507,0.37473756,0.0068521723,0.0030655446,0.0037987179,0.00003287081,0.0012381969,0.006940823],"genre_scores_gemma":[0.9196598,0.000018170003,0.07903949,0.00033708557,0.00036737294,0.00019789698,0.000008258478,0.000015849413,0.00035609206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983227,0.000050667873,0.000338942,0.0005099091,0.00023701166,0.00054073555],"domain_scores_gemma":[0.9987987,0.00021184883,0.000120188895,0.00073543447,0.000059866965,0.00007394153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008749749,0.00022969696,0.0003102733,0.00012320765,0.0001371982,0.00021146762,0.001199102,0.00010232581,0.0000016266857],"category_scores_gemma":[0.000013125746,0.00014434489,0.000054009226,0.0005056834,0.000087828805,0.00015327561,0.0003657067,0.00027904045,0.0000057915354],"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.00017104374,0.00014770014,0.008845415,0.00022765258,0.00018388995,0.00028583474,0.002671722,0.0020609645,0.000012228308,0.5688764,0.042559586,0.37395757],"study_design_scores_gemma":[0.0039012977,0.0030182882,0.037563134,0.0020424838,0.00019406306,0.0010748757,0.020617032,0.22685283,0.00016088225,0.015997885,0.6863208,0.002256426],"about_ca_topic_score_codex":0.00001274034,"about_ca_topic_score_gemma":0.000550759,"teacher_disagreement_score":0.6437612,"about_ca_system_score_codex":0.000026252967,"about_ca_system_score_gemma":0.000023399036,"threshold_uncertainty_score":0.5886214},"labels":[],"label_agreement":null},{"id":"W2048270571","doi":"10.1109/icc.2012.6364344","title":"Bottom-up trie structure for P2P live streaming","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Trie; Computer science; Computer network; Node (physics); The Internet; Distributed computing; Data structure; World Wide Web; Operating system","score_opus":0.01987556100694007,"score_gpt":0.26279812998677754,"score_spread":0.24292256897983747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048270571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11467156,0.00028931184,0.8769906,0.0027583933,0.0014953036,0.00049227127,0.000014557341,0.0015416751,0.0017463404],"genre_scores_gemma":[0.6821889,0.0000021962705,0.31573436,0.00042479762,0.00016124637,0.000023051918,0.0000024026383,0.000008735629,0.0014542618],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987109,0.000014721785,0.00016009506,0.0003078266,0.00019872353,0.0006077759],"domain_scores_gemma":[0.99889517,0.00016534323,0.000053120417,0.0006857413,0.0000727951,0.00012782193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001736681,0.00016061701,0.00016621972,0.000113847935,0.00011145657,0.00011157344,0.001208908,0.00013327223,0.00003143791],"category_scores_gemma":[0.00015119615,0.00013059576,0.00005709976,0.00036705408,0.000030347297,0.00054323976,0.00050089066,0.00014859885,0.00006389897],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014609777,0.000058994054,0.0037301935,0.000024728055,0.000058744034,0.0000034710001,0.0021478664,0.000093903815,0.0036583508,0.31348875,0.11995957,0.55676085],"study_design_scores_gemma":[0.003529559,0.0013752688,0.033476043,0.00014829625,0.0000997305,0.00015134586,0.002445019,0.075313576,0.30858457,0.15260528,0.41854805,0.003723262],"about_ca_topic_score_codex":0.000019889929,"about_ca_topic_score_gemma":0.000025792435,"teacher_disagreement_score":0.5675174,"about_ca_system_score_codex":0.000054513715,"about_ca_system_score_gemma":0.000032271884,"threshold_uncertainty_score":0.5325541},"labels":[],"label_agreement":null},{"id":"W2048339977","doi":"10.1145/1827418.1827423","title":"Predictive publish/subscribe matching","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Event (particle physics); Publication; Matching (statistics); Domain (mathematical analysis); Workload; Set (abstract data type); Data mining; Distributed computing; Programming language","score_opus":0.007879133394090567,"score_gpt":0.22447622950293605,"score_spread":0.21659709610884548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048339977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07851902,0.0000091610555,0.8460489,0.014037988,0.0013965652,0.00016374695,0.0000016402713,0.0030930152,0.05672996],"genre_scores_gemma":[0.7052079,7.915535e-7,0.29241288,0.0009354689,0.00009055215,0.00002388406,8.0014325e-7,0.0000073678684,0.0013203793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987224,0.000013428927,0.00014901505,0.0004255788,0.00030308327,0.00038651875],"domain_scores_gemma":[0.9986695,0.000072373834,0.000037597416,0.0009990613,0.00010127194,0.00012018931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030800776,0.000127532,0.00011894465,0.0001747262,0.000102741935,0.00047977798,0.002358607,0.00011752556,0.000040661394],"category_scores_gemma":[0.00016412405,0.00010767068,0.000038521273,0.0006535073,0.00004830766,0.0011385805,0.0011772718,0.00043689646,0.00025077641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000360397,0.000056014836,0.0015002534,0.0000034743491,0.000021231031,0.000024191666,0.00086090015,0.00015823514,0.008248568,0.71641356,0.1488159,0.12389405],"study_design_scores_gemma":[0.0007345447,0.00041863494,0.04379182,0.0000386579,0.000013697237,0.0001750684,0.00047586422,0.08244842,0.041338388,0.55843145,0.27064824,0.0014852368],"about_ca_topic_score_codex":0.000056626075,"about_ca_topic_score_gemma":0.00014357473,"teacher_disagreement_score":0.6266889,"about_ca_system_score_codex":0.000020970554,"about_ca_system_score_gemma":0.000042981053,"threshold_uncertainty_score":0.462651},"labels":[],"label_agreement":null},{"id":"W2049390675","doi":"10.1109/icc.2012.6364767","title":"Self-organizing overlay networks for Autonomic Manager selection","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Autonomic computing; Distributed computing; Overlay; Overhead (engineering); Overlay network; Network management; Process (computing); Scheme (mathematics); Computer network; Load balancing (electrical power); Matching (statistics); Cloud computing; The Internet; Operating system","score_opus":0.011841959078306244,"score_gpt":0.2313362118322537,"score_spread":0.21949425275394746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049390675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077065867,0.00011457111,0.98304296,0.0016006496,0.0009010937,0.0003525829,2.700807e-7,0.003229364,0.0030519252],"genre_scores_gemma":[0.57603246,0.000005391053,0.42216608,0.0005953962,0.00024987597,0.00004148634,8.245438e-7,0.000014499713,0.0008939938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987315,0.000017283395,0.0001719623,0.00031934676,0.000110078414,0.00064981723],"domain_scores_gemma":[0.9992708,0.00009380429,0.000055605717,0.00042737753,0.000050903793,0.00010148243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037198127,0.00015014081,0.00014170939,0.00014129326,0.00015389844,0.00014961229,0.0007785617,0.0001215846,0.000011396195],"category_scores_gemma":[0.000031214575,0.0001422017,0.00005224973,0.0006271331,0.000010905647,0.00071740744,0.0004174493,0.00012408217,0.000113683884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011365845,0.00019934821,0.01366745,0.000029434706,0.00015404548,0.0000017216885,0.00072570826,0.014713935,0.0011931384,0.50798017,0.26766813,0.19365555],"study_design_scores_gemma":[0.00025238094,0.000096210606,0.010794756,0.000008997452,0.000016958018,0.00002187347,0.000028770226,0.7505732,0.0045665447,0.0016972409,0.23147886,0.00046421832],"about_ca_topic_score_codex":0.000009060382,"about_ca_topic_score_gemma":0.000010333209,"teacher_disagreement_score":0.7358593,"about_ca_system_score_codex":0.00018134945,"about_ca_system_score_gemma":0.000021572185,"threshold_uncertainty_score":0.57988167},"labels":[],"label_agreement":null},{"id":"W2050313643","doi":"10.1145/1544012.1544087","title":"ISP-friendly peer matching without ISP collaboration","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Matching (statistics); Leverage (statistics); Peer-to-peer; Network topology; Inference; Distributed computing; Blossom algorithm; The Internet; Computer network; Machine learning; Artificial intelligence","score_opus":0.015725017870941674,"score_gpt":0.2605394862293393,"score_spread":0.24481446835839765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050313643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17858534,0.00003922261,0.78290665,0.019280389,0.00045611613,0.00021652086,0.0000017869877,0.0019543848,0.016559614],"genre_scores_gemma":[0.66448075,0.0000061586047,0.3264662,0.0008765595,0.000056327117,0.000020312531,0.0000018681445,0.000009841986,0.008081957],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832386,0.000030344521,0.0002197877,0.00045352973,0.00059817405,0.000374307],"domain_scores_gemma":[0.99867296,0.000045663415,0.00006285741,0.0008211068,0.00030592797,0.00009148893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002674981,0.00016507671,0.00017396607,0.00017500848,0.00024713975,0.00019154746,0.0012156,0.000101234495,0.000020975118],"category_scores_gemma":[0.000116396,0.00014654978,0.00003380426,0.0012104032,0.000056287136,0.0007917589,0.0005171669,0.00015959161,0.0004482617],"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.000017684626,0.00012511463,0.0083939275,0.000011717866,0.000040739287,0.0001543737,0.0064694956,0.0036617152,0.0050026597,0.28590804,0.65866196,0.031552564],"study_design_scores_gemma":[0.0021728715,0.0010944743,0.039986383,0.00010909427,0.00002621581,0.0007650223,0.0023125843,0.11742268,0.06493273,0.054098483,0.7139704,0.0031090206],"about_ca_topic_score_codex":0.00006256931,"about_ca_topic_score_gemma":0.00012484344,"teacher_disagreement_score":0.48589543,"about_ca_system_score_codex":0.00007649512,"about_ca_system_score_gemma":0.000106025465,"threshold_uncertainty_score":0.5976127},"labels":[],"label_agreement":null},{"id":"W2052721903","doi":"10.1007/s12083-012-0167-1","title":"Modelling and performance analysis of content sharing and distribution in community networks with infrastructure support","year":2012,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Community network; Provisioning; The Internet; Content distribution; Download; Cache; Peer-to-peer; File sharing; Computer network; World Wide Web","score_opus":0.03170153117310551,"score_gpt":0.25251367484783216,"score_spread":0.22081214367472665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052721903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47655532,0.00014976459,0.5221252,0.00069274445,0.000026770336,0.00029837212,0.000011603329,0.000083518426,0.00005670094],"genre_scores_gemma":[0.9768416,0.00007785491,0.022495696,0.00016248545,0.000082097904,0.00019517838,0.00007822483,0.000013032318,0.00005378179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983049,0.00004274582,0.00036549097,0.0004279807,0.00032327024,0.00053558336],"domain_scores_gemma":[0.99852395,0.00013025418,0.00012627094,0.00072138174,0.00022394155,0.0002742249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937612,0.00023270295,0.00040334792,0.00033498634,0.0003647541,0.00015047504,0.0005740241,0.00011567393,7.625377e-7],"category_scores_gemma":[0.00002087124,0.00021622774,0.000029309005,0.002495399,0.00009916677,0.00026871555,0.0008134094,0.00043878058,7.903255e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016263455,0.00003916064,0.38784394,0.000017152568,0.00007806376,2.8917825e-7,0.0012136456,0.5614666,0.000012368141,0.0024757166,0.00020896053,0.046627883],"study_design_scores_gemma":[0.00017159952,0.00009969724,0.22838959,0.000069300215,0.00011056583,0.000010418835,0.0001943683,0.76471454,0.000026200993,0.00022725808,0.0057038455,0.00028259837],"about_ca_topic_score_codex":0.00018464464,"about_ca_topic_score_gemma":0.0001063488,"teacher_disagreement_score":0.50028634,"about_ca_system_score_codex":0.000062744126,"about_ca_system_score_gemma":0.000014405734,"threshold_uncertainty_score":0.8817511},"labels":[],"label_agreement":null},{"id":"W2052835965","doi":"10.1145/1386109.1386112","title":"Exploring large-scale peer-to-peer live streaming topologies","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Network topology; Live streaming; File sharing; Peer-to-peer; The Internet; World Wide Web; Multimedia; Computer network","score_opus":0.0911859018930426,"score_gpt":0.3033847151358196,"score_spread":0.212198813242777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052835965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030745948,0.00011836033,0.93584585,0.030342044,0.0001459226,0.000872791,0.000048280624,0.0015131651,0.00036762934],"genre_scores_gemma":[0.5048606,0.00032298508,0.49350718,0.00031639767,0.000041092775,0.00070128933,0.00001692776,0.000019584493,0.00021396762],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756926,0.00010146567,0.00049594295,0.0007575902,0.00048336393,0.0005923756],"domain_scores_gemma":[0.99284536,0.0013538552,0.00012246333,0.004877953,0.0005142637,0.00028612727],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004709021,0.00032375348,0.00032164625,0.00052549975,0.0024735958,0.00016392831,0.0043423534,0.00012283552,0.000007077383],"category_scores_gemma":[0.00020878125,0.0003494614,0.00010417285,0.0015999882,0.00027847703,0.00043752804,0.0007991101,0.0006509633,0.00024410519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000776682,0.00082980166,0.0008555217,0.000014351919,0.00008531213,0.0000033397362,0.016443072,0.008021869,0.0007824952,0.005058153,0.0010591089,0.9668392],"study_design_scores_gemma":[0.0020597612,0.00073218846,0.03603246,0.0003358448,0.00013887847,0.00023674165,0.014529281,0.49402514,0.0067373337,0.0052204174,0.43696597,0.0029859715],"about_ca_topic_score_codex":0.0001333531,"about_ca_topic_score_gemma":0.00015778602,"teacher_disagreement_score":0.96385324,"about_ca_system_score_codex":0.000113307826,"about_ca_system_score_gemma":0.00007163323,"threshold_uncertainty_score":0.99989575},"labels":[],"label_agreement":null},{"id":"W2054584542","doi":"10.1109/jsac.2013.sup.0513020","title":"Effective Utilization of User Resources in PA-VoD Systems with Channel Heterogeneity","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Bandwidth (computing); Computer network; Upload; Cache; Bandwidth allocation; Quality of service; Channel allocation schemes; Provisioning; Quality of experience; Channel (broadcasting); Distributed computing; Operating system; Wireless","score_opus":0.03457848737000129,"score_gpt":0.28394113728462583,"score_spread":0.24936264991462453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054584542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95032555,0.00046384422,0.045596223,0.0020441024,0.00012559695,0.00083606533,0.00000288153,0.00015686436,0.0004488439],"genre_scores_gemma":[0.99215883,0.00017952638,0.007334319,0.00007471726,0.000020508984,0.00019985504,0.0000023290027,0.000013965598,0.000015927306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980225,0.00063069613,0.00048085465,0.000230117,0.0003316259,0.00030421495],"domain_scores_gemma":[0.9969488,0.0005481631,0.0003215683,0.0015106979,0.0005863636,0.00008442499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005188298,0.00016877441,0.00029409936,0.00075238844,0.0001577192,0.00016871064,0.002563735,0.00011547272,0.0000010227303],"category_scores_gemma":[0.00022562237,0.00014015473,0.000032328753,0.0027356038,0.00009557406,0.00045217096,0.000273361,0.00067471864,0.000011787545],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039548002,0.0058049136,0.33166143,0.00017050329,0.0006687663,0.00008395629,0.018420896,0.48139787,0.016226456,0.022721441,0.00861669,0.11383158],"study_design_scores_gemma":[0.0016244089,0.0012101987,0.7657679,0.0017205155,0.000018608858,0.00026868904,0.00048267952,0.21711157,0.007150515,0.0022278326,0.0017952234,0.000621902],"about_ca_topic_score_codex":0.00023702,"about_ca_topic_score_gemma":0.0010704066,"teacher_disagreement_score":0.4341064,"about_ca_system_score_codex":0.00024564678,"about_ca_system_score_gemma":0.000076672855,"threshold_uncertainty_score":0.5715344},"labels":[],"label_agreement":null},{"id":"W2054703316","doi":"10.1109/mownet.2013.6613805","title":"A cloud-hosted hybrid framework for consuming Web Services on mobile devices","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Dissemination; Synchronizing; Wireless network; Computer network; Event (particle physics); Cloud computing; Mobile computing; World Wide Web; Wireless; Telecommunications; Transmission (telecommunications); Operating system","score_opus":0.013428554965453667,"score_gpt":0.26144534411333886,"score_spread":0.2480167891478852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054703316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71631795,0.0002412149,0.27085721,0.0053724945,0.00090319547,0.0016360378,0.00000925225,0.0030572866,0.0016053508],"genre_scores_gemma":[0.70119774,0.0000063742305,0.29440853,0.0034398218,0.00009202351,0.0005621534,0.0000019257375,0.000015942498,0.00027552704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982364,0.000025133138,0.00027078475,0.00061680324,0.00027447048,0.00057641097],"domain_scores_gemma":[0.99787897,0.00067253754,0.000104566774,0.0010399405,0.0001767273,0.00012725878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018902788,0.00023937844,0.0002554268,0.00017795715,0.00017187418,0.0004556153,0.0021218802,0.00012926747,0.000058827187],"category_scores_gemma":[0.00007268929,0.00019850188,0.00007395978,0.00052197406,0.000045661116,0.00045468143,0.0006518836,0.0001986537,0.0008754565],"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.000054922297,0.00037199666,0.0073014344,0.00032866822,0.00018716861,0.000030850595,0.0014128744,0.001151556,0.003105958,0.4318732,0.103796504,0.45038486],"study_design_scores_gemma":[0.0012291403,0.0021887429,0.0031456097,0.00088634086,0.000035270397,0.000045798493,0.001316709,0.45192084,0.061278824,0.19144402,0.2843811,0.0021276171],"about_ca_topic_score_codex":0.000065844084,"about_ca_topic_score_gemma":0.00006736264,"teacher_disagreement_score":0.45076928,"about_ca_system_score_codex":0.000042715634,"about_ca_system_score_gemma":0.00003726047,"threshold_uncertainty_score":0.9999025},"labels":[],"label_agreement":null},{"id":"W2055252452","doi":"10.4108/icst.collaboratecom.2010.36","title":"An overlay multicast scheme for Distributed Interactive Applications","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Iran Telecommunication Research Center; Electronics and Telecommunications Research Institute; National IT Industry Promotion Agency; Information Technology Research Centre; Ministry of Knowledge Economy; Chonnam National University; University of Arizona","keywords":"Bottleneck; Multicast; Computer science; The Internet; Overlay multicast; Computer network; Scheme (mathematics); Overlay network; Internet transit; Service (business); Overlay; Distributed computing; Multicast address; Xcast; World Wide Web; Multimedia; Internet access; Operating system; Business; Embedded system","score_opus":0.010435252363355753,"score_gpt":0.30180411360393633,"score_spread":0.2913688612405806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055252452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01306479,0.0000019470817,0.98078716,0.0036411507,0.00017396013,0.00057254615,0.000040615785,0.0011078891,0.00060992286],"genre_scores_gemma":[0.518981,1.7256158e-7,0.48035476,0.00017222506,0.00004393003,0.00034577743,0.000016833279,0.000004976022,0.0000803257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990689,0.0000070739998,0.00013672432,0.00040736358,0.00011228205,0.00026764954],"domain_scores_gemma":[0.99849945,0.00015868775,0.000044251447,0.001013293,0.00017391871,0.00011038429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011761329,0.00011100266,0.00010543794,0.00007990928,0.00011044112,0.00016172294,0.0014309408,0.00008425353,0.0000127225385],"category_scores_gemma":[0.00012368562,0.000098513985,0.000038441973,0.00039435885,0.000049009188,0.000452766,0.00029963074,0.00019192681,0.000081779486],"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.000015651658,0.0003928143,0.0007893657,0.000006868597,0.00003360841,0.000001932962,0.00023082092,0.00010053512,0.12729977,0.63005126,0.020743549,0.22033381],"study_design_scores_gemma":[0.00058357144,0.00024092979,0.0061177877,0.000007525681,0.000007726727,0.000015643831,0.00013865768,0.5324014,0.06957758,0.018492019,0.37185645,0.0005607208],"about_ca_topic_score_codex":0.000012683922,"about_ca_topic_score_gemma":0.00008590302,"teacher_disagreement_score":0.6115592,"about_ca_system_score_codex":0.000026878966,"about_ca_system_score_gemma":0.000026920343,"threshold_uncertainty_score":0.40172836},"labels":[],"label_agreement":null},{"id":"W2055355018","doi":"10.1007/s12083-008-0026-2","title":"A contribution-based service differentiation scheme for peer-to-peer systems","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upload; Reputation; Peer-to-peer; Computer science; Incentive; Service (business); Reputation system; Free rider problem; Internet privacy; Scheme (mathematics); Computer security; File sharing; World Wide Web; Business; Marketing; The Internet","score_opus":0.019710691259394574,"score_gpt":0.2762502087912448,"score_spread":0.2565395175318502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055355018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009479434,0.00018838374,0.7926208,0.1910063,0.00068324147,0.0039534303,0.00015620084,0.0015727604,0.00033945584],"genre_scores_gemma":[0.87797683,0.0000049869345,0.10294264,0.0093139205,0.0015193524,0.004641114,0.00045017857,0.000072305,0.0030786495],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938656,0.000091549904,0.00092422776,0.0017628706,0.0018670929,0.0014886741],"domain_scores_gemma":[0.99167395,0.0005471025,0.00029361865,0.0019762584,0.0046106023,0.00089845824],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018539247,0.00069519953,0.000758528,0.00069264905,0.0010598165,0.0012678191,0.002344298,0.0003761662,0.000004047864],"category_scores_gemma":[0.0006338442,0.00073023775,0.0001708939,0.0038962376,0.000045973436,0.0002918707,0.0005194425,0.00045223566,0.00025356622],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002166685,0.0008602861,0.0027654145,0.00017387806,0.0002493393,0.000008687581,0.0018628462,0.13352056,0.0073150108,0.1590912,0.48195285,0.21198326],"study_design_scores_gemma":[0.0009168894,0.0003219085,0.004968721,0.00020353645,0.00006973577,0.000012308141,0.00007990374,0.19843219,0.00078109355,0.0034783208,0.7896913,0.0010440544],"about_ca_topic_score_codex":0.00010019498,"about_ca_topic_score_gemma":0.00009522425,"teacher_disagreement_score":0.86849743,"about_ca_system_score_codex":0.00032935603,"about_ca_system_score_gemma":0.00014918555,"threshold_uncertainty_score":0.999769},"labels":[],"label_agreement":null},{"id":"W2055986973","doi":"10.1109/bsc.2010.5473013","title":"Implementation of bootstrapping for P2P overlays in MANETs","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bootstrapping (finance); Computer science; Overlay; Mobile ad hoc network; Overlay network; Java; Distributed computing; Computer network; Wireless ad hoc network; Peer-to-peer; Wireless; Operating system","score_opus":0.01234998215228119,"score_gpt":0.3074471760896438,"score_spread":0.2950971939373626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055986973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55251735,0.0000048605743,0.44409543,0.0016768291,0.00020101883,0.00029083813,0.0000019444606,0.00017139624,0.0010403474],"genre_scores_gemma":[0.8353749,8.0787976e-7,0.1644121,0.00011820144,0.000012770117,0.000030203253,0.0000010524718,0.0000026875298,0.00004727978],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935234,0.0000043813616,0.00017228817,0.00018021752,0.00010188748,0.00018888465],"domain_scores_gemma":[0.9995363,0.000054817374,0.000045400036,0.00030822807,0.000033994344,0.000021307475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019679073,0.000057991245,0.00008495979,0.00014672693,0.000017869534,0.000026635475,0.00055288896,0.0000439867,0.000014813482],"category_scores_gemma":[0.000021966955,0.00005589827,0.000021974209,0.00026612479,0.0000142830295,0.00018113942,0.0001596048,0.00006846069,0.000004338471],"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.000005266108,0.000043925447,0.02519626,0.000026384052,0.000011481863,0.0000031883685,0.0005822034,0.00023756466,0.121558726,0.4025074,0.009529323,0.4402983],"study_design_scores_gemma":[0.00170308,0.00044079166,0.34881943,0.000033115302,0.000005932496,0.000012902129,0.00072494114,0.06280929,0.4954471,0.06694337,0.022483254,0.0005768041],"about_ca_topic_score_codex":0.0001442116,"about_ca_topic_score_gemma":0.0017472932,"teacher_disagreement_score":0.43972147,"about_ca_system_score_codex":0.000011930793,"about_ca_system_score_gemma":0.000023778173,"threshold_uncertainty_score":0.22794652},"labels":[],"label_agreement":null},{"id":"W2056148364","doi":"10.1109/glocom.2012.6503405","title":"A study on peer startup process and initial offset placement in P2P live streaming systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Offset (computer science); Computer science; Joins; Lag; Peer-to-peer; Process (computing); Buffer (optical fiber); Computer network; Real-time computing; Distributed computing; Operating system; Telecommunications","score_opus":0.039315365978881064,"score_gpt":0.3152008135549737,"score_spread":0.2758854475760926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056148364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9853665,0.00006338908,0.01071094,0.00057162746,0.00030713275,0.00082159654,0.0000030656954,0.000345072,0.0018106364],"genre_scores_gemma":[0.99793833,9.914777e-7,0.001470876,0.00010834499,0.000059591024,0.00014478555,0.0000012487723,0.0000074365266,0.00026836107],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983975,0.00006430861,0.00022946221,0.00035373218,0.0005245161,0.00043046434],"domain_scores_gemma":[0.9992504,0.00010491807,0.00005359038,0.0004142784,0.00007961444,0.00009718548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549384,0.00016266028,0.00019231625,0.00023089438,0.00006194212,0.00015510451,0.0005371999,0.000059562,0.000003881716],"category_scores_gemma":[0.00008832527,0.00013328335,0.000011108812,0.000383676,0.000022635615,0.00042214908,0.00048710557,0.00016283675,0.00004394367],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018542037,0.0053576943,0.7186551,0.00018092638,0.00019564139,0.0002972014,0.13686833,0.0052073617,0.000107994405,0.039655223,0.022731064,0.070558034],"study_design_scores_gemma":[0.011012869,0.014574894,0.44451752,0.0012718131,0.000087358305,0.00020659869,0.34983113,0.1602882,0.0043473463,0.0020724782,0.0072005,0.00458929],"about_ca_topic_score_codex":0.00012388539,"about_ca_topic_score_gemma":0.00013971153,"teacher_disagreement_score":0.27413762,"about_ca_system_score_codex":0.00008419075,"about_ca_system_score_gemma":0.000029270852,"threshold_uncertainty_score":0.5435137},"labels":[],"label_agreement":null},{"id":"W2056724677","doi":"10.3166/isi.18.1.125-149","title":"Vers une vision pervasive d’un système de vidéosurveillance distribué. Extension en vue d'un contrôle d'accès adaptatif","year":2013,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Computer science; Search engine indexing; Context (archaeology); Political science; Philosophy; World Wide Web; Geography","score_opus":0.011261273013073078,"score_gpt":0.22447598988034256,"score_spread":0.21321471686726948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056724677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21605007,0.0024494764,0.76118803,0.011061193,0.0025589345,0.0019149845,0.00014135383,0.001310712,0.0033252207],"genre_scores_gemma":[0.9406472,0.00044956172,0.056874525,0.0009128161,0.00020286586,0.00029778708,0.00015794497,0.000042593852,0.00041474547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948864,0.00048320342,0.0015290241,0.00065665744,0.0009398172,0.0015048714],"domain_scores_gemma":[0.9951052,0.0006721715,0.0008908842,0.0013964394,0.0014902148,0.0004450757],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015587261,0.00071983755,0.0007958656,0.00049765356,0.0008152635,0.0018628634,0.0018592998,0.0007083703,0.00013009146],"category_scores_gemma":[0.0018768815,0.00075043173,0.00022992039,0.0022199797,0.00048400208,0.009827791,0.0010497192,0.0006270797,0.0021480492],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055564138,0.000088976114,0.0009342,0.0004353368,0.00012044931,0.00004844868,0.01858152,0.009959281,0.0009080664,0.019796493,0.0153427925,0.9337289],"study_design_scores_gemma":[0.002413132,0.001410787,0.17577565,0.0029413046,0.000097454795,0.0008398852,0.007250549,0.67927307,0.0069485726,0.048202846,0.07262257,0.0022241655],"about_ca_topic_score_codex":0.004063293,"about_ca_topic_score_gemma":0.00018557868,"teacher_disagreement_score":0.9315047,"about_ca_system_score_codex":0.0027552466,"about_ca_system_score_gemma":0.0004518623,"threshold_uncertainty_score":0.9994947},"labels":[],"label_agreement":null},{"id":"W2057443477","doi":"10.5555/1837164.1837180","title":"FizzX: multiplayer time manipulation in networked games","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multimedia; Human–computer interaction","score_opus":0.012215192592573814,"score_gpt":0.23762749689881818,"score_spread":0.22541230430624437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057443477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2221355,0.00014705607,0.72904557,0.019830722,0.00032615534,0.00058050174,4.922515e-7,0.0031531597,0.024780866],"genre_scores_gemma":[0.86213666,0.0000034376635,0.13454144,0.0011528268,0.000043536853,0.000007437645,0.0000017118582,0.0000045018514,0.002108458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988498,0.000026606855,0.0002089739,0.0003604254,0.00019593356,0.0003582267],"domain_scores_gemma":[0.9992494,0.00005789195,0.000037333113,0.00057205296,0.00003137669,0.000051969964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020304367,0.00012967148,0.00014771946,0.00020432522,0.00003602639,0.00009776029,0.00088108756,0.00009885902,0.000028037994],"category_scores_gemma":[0.000046588535,0.00011722734,0.0000314682,0.00082351844,0.000012516046,0.00036188186,0.00019713031,0.00012320856,0.00044255596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017333246,0.00013078953,0.0047091623,0.000002336253,0.000008651812,0.000059535952,0.00036400417,0.06951677,0.002374972,0.041314237,0.07307259,0.8084296],"study_design_scores_gemma":[0.00030666453,0.00010731758,0.112095445,0.000023539857,0.0000012872964,0.000007452755,0.000006968158,0.8662718,0.0010787809,0.012411412,0.0074129063,0.00027644643],"about_ca_topic_score_codex":0.00001931437,"about_ca_topic_score_gemma":0.000038566242,"teacher_disagreement_score":0.80815315,"about_ca_system_score_codex":0.000057213136,"about_ca_system_score_gemma":0.000012835652,"threshold_uncertainty_score":0.5688309},"labels":[],"label_agreement":null},{"id":"W2057879653","doi":"10.1145/1185373.1185427","title":"A progressive flow auction approach for low-cost on-demand P2P media streaming","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Bidding; Scalability; Real Time Streaming Protocol; Implementation; Live streaming; Computer network; On demand; Asynchronous communication; Peer-to-peer; Distributed computing; Multimedia; The Internet; World Wide Web","score_opus":0.013928953150495957,"score_gpt":0.23692078275240477,"score_spread":0.22299182960190883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057879653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011915119,0.000058441074,0.9816643,0.0010515694,0.0002906795,0.00088984804,0.00000715415,0.0011813935,0.0029415113],"genre_scores_gemma":[0.4016,0.0000011246318,0.5971443,0.000113277565,0.00025348406,0.0004294773,0.000026336289,0.000013805766,0.00041816517],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843323,0.000018934346,0.00021246469,0.00057807943,0.00030492278,0.00045238188],"domain_scores_gemma":[0.9990268,0.00013693483,0.00007846959,0.00059700914,0.000102926795,0.000057893605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021207055,0.0001908635,0.00018484874,0.00019394587,0.00014439781,0.000186814,0.00086374435,0.00012592976,0.0000028944517],"category_scores_gemma":[0.000094587864,0.0001567086,0.000063500804,0.0005328983,0.00005531951,0.00028409032,0.0002413216,0.00012574863,0.00002399631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005741934,0.00063975976,0.00063942355,0.00007237711,0.000050733346,0.000041437765,0.00057714677,0.056633316,0.00053296186,0.07900644,0.11176101,0.74998796],"study_design_scores_gemma":[0.00078811456,0.00020636982,0.0020730519,0.000059760165,0.0000115140265,0.000030997144,0.00011155058,0.96141696,0.018633645,0.013079721,0.0030689596,0.000519356],"about_ca_topic_score_codex":0.000016847913,"about_ca_topic_score_gemma":0.00001965151,"teacher_disagreement_score":0.90478367,"about_ca_system_score_codex":0.00008063719,"about_ca_system_score_gemma":0.000033341363,"threshold_uncertainty_score":0.63903916},"labels":[],"label_agreement":null},{"id":"W2058225249","doi":"10.1016/j.bjp.2013.11.005","title":"On the performance and fairness of BitTorrent-like data swarming systems with NAT devices","year":2013,"lang":"en","type":"article","venue":"Computer Networks","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"BitTorrent; Computer science; Nat; Swarming (honey bee); Computer network; Peer-to-peer","score_opus":0.02061111153448912,"score_gpt":0.21095981312702092,"score_spread":0.1903487015925318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058225249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26685992,0.0006142302,0.72992146,0.0007791011,0.0009467149,0.0004884665,0.0000014577662,0.00029559416,0.00009306208],"genre_scores_gemma":[0.9806062,0.00003923214,0.018584993,0.00047203217,0.00019222444,0.00004591417,0.0000050121653,0.00001561592,0.00003878921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825484,0.00007128938,0.00027977087,0.0006235023,0.00034419983,0.00042640662],"domain_scores_gemma":[0.9971488,0.0004248286,0.00017238258,0.0020413124,0.00012725979,0.000085408385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038816786,0.00024473158,0.00028647808,0.00011167939,0.00017785317,0.00041878442,0.003614584,0.00009309808,0.0000017216453],"category_scores_gemma":[0.000008347608,0.00014944175,0.000018941339,0.0006337538,0.0001348149,0.0006781235,0.0026271641,0.0002885732,0.000018815184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001988444,0.000104248844,0.01881476,0.00017619481,0.00016969397,0.000018065826,0.0005900975,0.3443923,0.000009270228,0.019454388,0.12718153,0.48906958],"study_design_scores_gemma":[0.00013568603,0.00018397802,0.007082963,0.0003828883,0.0000068589325,0.000028124221,0.000024523051,0.9889741,0.000014295665,0.00006596974,0.0028897927,0.00021083016],"about_ca_topic_score_codex":0.000056586585,"about_ca_topic_score_gemma":0.0000122994015,"teacher_disagreement_score":0.71374625,"about_ca_system_score_codex":0.000021777289,"about_ca_system_score_gemma":0.000024390856,"threshold_uncertainty_score":0.67168564},"labels":[],"label_agreement":null},{"id":"W2058413515","doi":"10.1177/0037549708092832","title":"A Visibility-Driven Approach for Zone Management in Simulations","year":2008,"lang":"en","type":"article","venue":"SIMULATION","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Distributed computing; Visibility; Computer network; Overlay network; Architecture; Resilience (materials science); Overlay; Peer-to-peer; Layer (electronics); Boundary (topology); The Internet; World Wide Web; Operating system","score_opus":0.046627197405583506,"score_gpt":0.30125731499936964,"score_spread":0.2546301175937861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058413515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110295,0.000011738037,0.88749504,0.00030797964,0.000059344176,0.00089870044,0.0000028350605,0.00034617796,0.0005831831],"genre_scores_gemma":[0.6526294,9.858117e-7,0.34708357,0.00006735581,0.000018382145,0.000052530708,0.000012431598,0.0000055063915,0.00012987814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988721,0.000026302832,0.00023643025,0.00041628137,0.00020387906,0.00024500626],"domain_scores_gemma":[0.99911314,0.00014926777,0.00004940178,0.00058247696,0.00006948494,0.000036204558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015964614,0.000106392654,0.00012743147,0.00030208143,0.00012218839,0.0000342704,0.00048160323,0.00006763324,0.0000015093233],"category_scores_gemma":[0.00006214531,0.000112767484,0.000039649,0.0008531576,0.00002529573,0.00031832542,0.00021843798,0.00006963787,0.000010679578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007336802,0.000069014546,0.0019507542,0.000008648905,0.0000063020643,0.0000021157884,0.00030584636,0.9734772,0.000022331153,0.0066983094,0.00009965018,0.017352518],"study_design_scores_gemma":[0.00042956846,0.00004053321,0.018988458,0.0000055806577,0.0000027448455,7.60004e-7,0.000013564242,0.9751855,0.00003795781,0.0039175614,0.00125322,0.00012454749],"about_ca_topic_score_codex":0.000007328462,"about_ca_topic_score_gemma":0.000012591374,"teacher_disagreement_score":0.5423344,"about_ca_system_score_codex":0.00011136484,"about_ca_system_score_gemma":0.000014360999,"threshold_uncertainty_score":0.45985243},"labels":[],"label_agreement":null},{"id":"W2058437491","doi":"10.1109/mownet.2013.6613803","title":"Coping with flash crowd in multi-channel live video streaming for peer-to-peer networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Crowds; Computer science; Live streaming; Computer network; Quality of service; Video streaming; Channel (broadcasting); Video quality; Multimedia; Flash (photography); Real-time computing; Computer security; Engineering","score_opus":0.02513706156967129,"score_gpt":0.259935843535695,"score_spread":0.2347987819660237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058437491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025102887,0.000058582078,0.95310736,0.018192377,0.0003509971,0.0016447144,0.000003080069,0.0010724374,0.00046756477],"genre_scores_gemma":[0.49129435,0.000003804488,0.49956807,0.0027651826,0.00009315762,0.0007285709,0.000005946584,0.00004133541,0.005499548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968748,0.000036235975,0.0004267767,0.0009674641,0.0005686593,0.0011260326],"domain_scores_gemma":[0.99748427,0.0003782567,0.00010527445,0.001009409,0.0007229811,0.00029979745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054927723,0.0003881551,0.0004207105,0.00041424224,0.00016551027,0.000522363,0.0018943711,0.00022009539,0.000021095631],"category_scores_gemma":[0.00049381016,0.00032663316,0.00007210574,0.0011486338,0.00006471936,0.00081084913,0.001009654,0.00033228265,0.0002651064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057606296,0.0003212888,0.0036210425,0.00006195044,0.000115043214,0.00006216287,0.0051597115,0.49470988,0.00039413382,0.005555873,0.37632734,0.113613985],"study_design_scores_gemma":[0.001295259,0.00051912916,0.0050697085,0.0002162414,0.000008675423,0.00001598386,0.0005564469,0.97879106,0.0014425435,0.0010955839,0.010107147,0.000882219],"about_ca_topic_score_codex":0.00058867317,"about_ca_topic_score_gemma":0.001836796,"teacher_disagreement_score":0.4840812,"about_ca_system_score_codex":0.00016736092,"about_ca_system_score_gemma":0.000075358395,"threshold_uncertainty_score":0.9999186},"labels":[],"label_agreement":null},{"id":"W205915633","doi":"10.1609/aiide.v4i1.18688","title":"Otello: A Next-Generation Reputation System For Humans and NPCs","year":2008,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alchemy (Canada)","funders":"","keywords":"Reputation; Realm; Resource (disambiguation); Reputation management; Affect (linguistics); Population; Computer science; Internet privacy; Knowledge management; Data science; Psychology; Sociology; Political science; Communication","score_opus":0.1087807845829082,"score_gpt":0.28703146778274796,"score_spread":0.17825068319983978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205915633","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89667064,0.000021539616,0.09806187,0.0022374005,0.00027270074,0.0007857381,0.00001147227,0.00010487711,0.0018337871],"genre_scores_gemma":[0.99801975,0.000030230765,0.001492899,0.00014626233,0.000044153352,0.00009928822,0.000002164113,0.000008789261,0.00015647437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986286,0.0000068759828,0.00039267563,0.00048058762,0.00026312476,0.00022814091],"domain_scores_gemma":[0.9990545,0.00008050681,0.00024090766,0.00016493164,0.00039183054,0.00006735891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014830388,0.00019535008,0.00021031557,0.00013556599,0.00022150349,0.0005061471,0.0005477599,0.000058161735,0.0000013753641],"category_scores_gemma":[0.0002295143,0.00015040801,0.000066506385,0.0001990174,0.00016180162,0.00119636,0.00034523645,0.00012176212,0.000006887073],"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.00021314753,0.00028025903,0.00087117834,0.00010080061,0.000075278396,0.0000020344326,0.008894593,0.000123633,0.070904195,0.60794824,0.00059025746,0.3099964],"study_design_scores_gemma":[0.00011525821,0.0014895512,0.00046855514,0.00057635584,0.000019073757,0.000048214533,0.0067283004,0.19379961,0.7738917,0.021834176,0.00058167754,0.00044753944],"about_ca_topic_score_codex":0.000010735116,"about_ca_topic_score_gemma":0.0000031585946,"teacher_disagreement_score":0.7029875,"about_ca_system_score_codex":0.000095310024,"about_ca_system_score_gemma":0.000024439083,"threshold_uncertainty_score":0.6133461},"labels":[],"label_agreement":null},{"id":"W2059789746","doi":"10.1109/jsyst.2014.2306147","title":"MR-Chord: Improved Chord Lookup Performance in Structured Mobile P2P Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Chord (peer-to-peer); Computer science; Distributed hash table; Pastry; Computer network; Routing table; Routing protocol; Overlay network; Hash table; Distributed computing; Peer-to-peer; Hash function; Routing (electronic design automation); The Internet; Computer security; Operating system","score_opus":0.0071153042009722695,"score_gpt":0.21788011481176933,"score_spread":0.21076481061079705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059789746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47062525,0.00083718664,0.5186959,0.00024529969,0.008041853,0.0005814292,0.0000013271814,0.00041258053,0.0005591663],"genre_scores_gemma":[0.992342,0.000077303506,0.005773904,0.00013382682,0.0012516738,0.00007794182,6.6159583e-7,0.000030386229,0.00031228585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692196,0.00021538248,0.0008229578,0.00054041034,0.000537458,0.0009618401],"domain_scores_gemma":[0.9979873,0.00009802428,0.000401496,0.0010423157,0.00019923909,0.00027165044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015810273,0.0003480817,0.0005304562,0.00045942047,0.00025489507,0.00062639,0.0025794287,0.0002911057,0.000005088736],"category_scores_gemma":[0.00007132467,0.00029675046,0.00010489104,0.000947449,0.00006132691,0.00072020636,0.00028639,0.001122184,0.000046246318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036005178,0.000051767198,0.009512786,0.00005906376,0.000057200807,0.00006194894,0.0005447814,0.8204959,0.0032546746,0.0007093748,0.008940718,0.15627575],"study_design_scores_gemma":[0.00089606515,0.0005040179,0.006532301,0.00025919173,0.000007684673,0.00088562135,0.00005510336,0.9615876,0.000689163,0.0003853279,0.027640486,0.00055742596],"about_ca_topic_score_codex":0.000048807928,"about_ca_topic_score_gemma":0.00006259905,"teacher_disagreement_score":0.5217168,"about_ca_system_score_codex":0.00026406528,"about_ca_system_score_gemma":0.000090633344,"threshold_uncertainty_score":0.99994844},"labels":[],"label_agreement":null},{"id":"W2060137540","doi":"10.1109/atc.2008.4760501","title":"The state-of-the-art of on-demand P2P media streaming over the Internet","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Server; Real Time Streaming Protocol; The Internet; Scheduling (production processes); Computer network; Overlay; On demand; Bandwidth (computing); Internet traffic; Multimedia; World Wide Web; Operating system","score_opus":0.015204172667236483,"score_gpt":0.22462521104097538,"score_spread":0.2094210383737389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060137540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92795706,0.00018181384,0.058520045,0.005935476,0.00062936195,0.00027537363,0.0000034320751,0.00021011366,0.006287333],"genre_scores_gemma":[0.9944752,0.00004328529,0.0025308477,0.00030017048,0.000017985012,0.000008239849,1.8981801e-7,0.0000057084803,0.002618416],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9988707,0.00005177483,0.00023569592,0.0001965667,0.0004110991,0.00023418204],"domain_scores_gemma":[0.9980486,0.0006794363,0.00011235053,0.0010756,0.000057739122,0.000026283216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032203455,0.00010861851,0.00012899797,0.000044612254,0.00010489765,0.00003377314,0.002598754,0.00003517722,0.000007481671],"category_scores_gemma":[0.0001836009,0.000046525387,0.00006427694,0.00041772638,0.00030367897,0.000093614435,0.0010214188,0.00016105831,0.000023649985],"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.000039278395,0.00015864607,0.017807717,0.000014352502,0.00015684111,0.000021967011,0.009998577,0.0023914743,0.0008177411,0.11883811,0.53563493,0.31412035],"study_design_scores_gemma":[0.0013191738,0.0008690399,0.3923765,0.00033512388,0.00003142753,0.00009391454,0.0005482922,0.08996444,0.24173647,0.10409982,0.1676499,0.00097587664],"about_ca_topic_score_codex":0.000066440385,"about_ca_topic_score_gemma":0.00025866466,"teacher_disagreement_score":0.37456882,"about_ca_system_score_codex":0.000020932797,"about_ca_system_score_gemma":0.000038089307,"threshold_uncertainty_score":0.48291746},"labels":[],"label_agreement":null},{"id":"W2060425749","doi":"10.1145/1557626.1557646","title":"Component placement and location for a dynamic software composition system","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Installation; Component (thermodynamics); Server; Component-based software engineering; Cloud computing; Software; Distributed computing; Software system; Software engineering; Operating system; Embedded system","score_opus":0.008851668295871494,"score_gpt":0.23818564009285614,"score_spread":0.22933397179698464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060425749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028670518,0.000083033105,0.9657137,0.0036865533,0.00010413882,0.0005407267,0.000001997613,0.0011152633,0.000084064086],"genre_scores_gemma":[0.6868405,0.0000014487093,0.31280622,0.00026200013,0.0000072741745,0.00003582853,0.000007965508,0.0000024203396,0.000036381327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922895,0.000013124589,0.00014998991,0.0002800379,0.00014267184,0.0001852498],"domain_scores_gemma":[0.9994396,0.000046443467,0.000043754386,0.0003145545,0.00010771662,0.000047909805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014090566,0.000097293145,0.000113170645,0.00010015487,0.000105208936,0.000102031496,0.00033751727,0.00004505894,2.967117e-7],"category_scores_gemma":[0.000010861434,0.00008931547,0.0000153595,0.0002579345,0.000012930459,0.00014735134,0.00010633146,0.000038438313,0.000010185182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009610625,0.00030078948,0.00031117914,0.0002872705,0.000052309213,0.0000123370955,0.0008152921,0.030107982,0.011489604,0.38695222,0.015146094,0.5544288],"study_design_scores_gemma":[0.00059030787,0.0005473005,0.007506931,0.0001479144,0.000009248615,0.000039161,0.00012488407,0.9860732,0.002046184,0.00199547,0.0006461304,0.00027325706],"about_ca_topic_score_codex":0.0000044395783,"about_ca_topic_score_gemma":0.000005142434,"teacher_disagreement_score":0.9559652,"about_ca_system_score_codex":0.00015886084,"about_ca_system_score_gemma":0.00001457552,"threshold_uncertainty_score":0.36421794},"labels":[],"label_agreement":null},{"id":"W2060784838","doi":"10.1109/waimw.2006.5","title":"An XML Routing Synopsis for Unstructured P2P Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software deployment; XML; The Internet; Distributed computing; Routing (electronic design automation); Computer network; World Wide Web; Software engineering","score_opus":0.007185019927441732,"score_gpt":0.23588549813504525,"score_spread":0.22870047820760353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060784838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019833669,0.00005041607,0.97290707,0.0018495645,0.00045038082,0.00030312737,0.0000020162647,0.0020566832,0.0025470713],"genre_scores_gemma":[0.6359853,7.007404e-7,0.36295062,0.00040559738,0.00018476321,0.000028466044,0.0000053426206,0.000011072709,0.0004280932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983663,0.000022596809,0.00025884958,0.00055444543,0.0001930447,0.00060476706],"domain_scores_gemma":[0.99869204,0.0001105431,0.00007322147,0.00095115165,0.00009411028,0.00007894028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026464052,0.00018958491,0.0001985122,0.00012119228,0.00018968419,0.00029967097,0.0017324393,0.00015743393,0.000006158243],"category_scores_gemma":[0.000044306194,0.0001665231,0.00006842381,0.00068775215,0.000039199564,0.00036816945,0.00032047913,0.00012796423,0.0000096001395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010105645,0.000053220232,0.002921613,0.0000065871573,0.00002222865,0.000011633613,0.00008165809,0.11991782,0.0011492957,0.4764439,0.062831596,0.33655035],"study_design_scores_gemma":[0.00025107886,0.00012878187,0.004537007,0.00001199993,0.0000067414467,0.000014149373,0.000026474892,0.95539826,0.0031311777,0.027878098,0.008247871,0.00036834524],"about_ca_topic_score_codex":0.00011758482,"about_ca_topic_score_gemma":0.00018240497,"teacher_disagreement_score":0.83548045,"about_ca_system_score_codex":0.000055249177,"about_ca_system_score_gemma":0.000024091582,"threshold_uncertainty_score":0.6790615},"labels":[],"label_agreement":null},{"id":"W2061511005","doi":"10.1145/1730836.1730853","title":"Analysis of peer-assisted video-on-demand systems with scalable video streams","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Throughput; Peer-to-peer; Video streaming; Real Time Streaming Protocol; Quality (philosophy); Real-time computing; Computer network; Multimedia; Video quality; Distributed computing; Database; World Wide Web; The Internet; Telecommunications; Wireless","score_opus":0.010908436864796724,"score_gpt":0.23678869154866394,"score_spread":0.22588025468386722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061511005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6203607,0.00005557599,0.35424885,0.0033098564,0.0005404032,0.0004846789,0.000017626619,0.0014625249,0.019519847],"genre_scores_gemma":[0.95278275,0.00000203421,0.044784915,0.00012762411,0.00002983543,0.000042519107,0.000006680847,0.000013140619,0.0022104923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974723,0.00004702351,0.0004075824,0.0007043663,0.00090732606,0.0004614344],"domain_scores_gemma":[0.9969572,0.00025413034,0.00019373055,0.0020260387,0.00040715424,0.00016178351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068228715,0.0002548517,0.000588905,0.0008452772,0.00010133123,0.0002581569,0.0018705042,0.00017631328,0.000028912713],"category_scores_gemma":[0.00015408189,0.00017970387,0.00012257686,0.0042384225,0.00012497458,0.00030794778,0.00040587963,0.00028992604,0.000048203146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002285137,0.0017855718,0.23593776,0.00019415001,0.0070087123,0.00021692479,0.0010415486,0.10857625,0.03439374,0.28611052,0.084790245,0.23971607],"study_design_scores_gemma":[0.0014060241,0.001655967,0.14652203,0.00017781314,0.0008563316,0.000056651927,0.00036828106,0.8090741,0.021090636,0.00080652116,0.016546832,0.0014388387],"about_ca_topic_score_codex":0.00051508116,"about_ca_topic_score_gemma":0.001259443,"teacher_disagreement_score":0.7004978,"about_ca_system_score_codex":0.000040300172,"about_ca_system_score_gemma":0.000055115957,"threshold_uncertainty_score":0.7328111},"labels":[],"label_agreement":null},{"id":"W2062134786","doi":"10.1016/j.ipm.2009.04.007","title":"Empirical observations on the session timeout threshold","year":2009,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Peer-to-Peer Network Technologies","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 Alberta","funders":"","keywords":"Timeout; Session (web analytics); Computer science; Computer network; World Wide Web","score_opus":0.04708374987156168,"score_gpt":0.2914557649864874,"score_spread":0.24437201511492573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062134786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012006107,0.000035432146,0.78014606,0.13546519,0.0002197704,0.0006881586,0.0000010706725,0.0016504006,0.06978782],"genre_scores_gemma":[0.91904503,0.000006398731,0.05054024,0.02970883,0.000028047125,0.00006865836,0.000008219872,0.0000040073146,0.0005905606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99873596,0.00001383052,0.00031115414,0.0001688675,0.00051520596,0.00025498445],"domain_scores_gemma":[0.9991029,0.000028435159,0.00013371978,0.0005911335,0.00010024359,0.000043550255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036590025,0.00013580818,0.00008706122,0.00022583024,0.00038369297,0.00069249683,0.0012071478,0.000050456132,0.000005166815],"category_scores_gemma":[0.000044118882,0.00009252426,0.000031080912,0.0010404105,0.000022175898,0.0019001584,0.0003035297,0.00015535134,0.00030710356],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004363228,0.000036902944,0.00008533392,0.000015725,0.000005882296,0.0000018259498,0.0008681007,0.004895676,0.0000060990283,0.100245304,0.076113336,0.8177214],"study_design_scores_gemma":[0.0004884462,0.00023609077,0.08344646,0.00043881,0.000019401667,0.0000071257355,0.00048071635,0.3568058,0.00068977044,0.10734428,0.4494084,0.0006346848],"about_ca_topic_score_codex":4.7416884e-7,"about_ca_topic_score_gemma":3.2293312e-7,"teacher_disagreement_score":0.9070389,"about_ca_system_score_codex":0.000084620646,"about_ca_system_score_gemma":0.000025008487,"threshold_uncertainty_score":0.6677763},"labels":[],"label_agreement":null},{"id":"W2062846288","doi":"10.3166/isi.17.5.113-138","title":"Distribution d’applications client-serveur sur des réseaux déclaratifs","year":2012,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.03151098509530046,"score_gpt":0.25773985732984916,"score_spread":0.2262288722345487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062846288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09720323,0.0039274427,0.88832325,0.0017981833,0.0019463572,0.001171042,0.00026980016,0.0010560186,0.0043046772],"genre_scores_gemma":[0.95800275,0.00027881458,0.038616188,0.0004852015,0.00046803823,0.0006301999,0.0005956907,0.000025874197,0.0008972648],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99625653,0.00016750039,0.0011747372,0.00033331945,0.0006451464,0.0014227811],"domain_scores_gemma":[0.99667513,0.00017866457,0.00056079624,0.001143638,0.0010105523,0.0004312308],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0012954079,0.00046820915,0.00039673076,0.00033739902,0.00094441586,0.0011517637,0.001326849,0.00046750004,0.000047254434],"category_scores_gemma":[0.0007320041,0.0005195044,0.00016650552,0.0024927428,0.0006068368,0.016149478,0.00079178123,0.00042781673,0.002558599],"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.0000152062985,0.00016763365,0.011733174,0.00051270134,0.00005952056,0.0000016741374,0.008425386,0.0013558497,0.00007065703,0.29096133,0.020005118,0.6666917],"study_design_scores_gemma":[0.00054984784,0.00027395232,0.11725694,0.0005818199,0.00008255156,0.00021840328,0.0011881685,0.029936198,0.0029260134,0.034423687,0.8114123,0.0011501465],"about_ca_topic_score_codex":0.00034694496,"about_ca_topic_score_gemma":0.00006740415,"teacher_disagreement_score":0.8607995,"about_ca_system_score_codex":0.0015459446,"about_ca_system_score_gemma":0.0002523036,"threshold_uncertainty_score":0.99988514},"labels":[],"label_agreement":null},{"id":"W2063258423","doi":"10.1145/1989240.1989252","title":"Understanding demand volatility in large VoD systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Volatility (finance); Probabilistic logic; Server; Workload; Quality of service; The Internet; Computer network; Econometrics; Economics","score_opus":0.16327805583718752,"score_gpt":0.2572563179210015,"score_spread":0.09397826208381399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063258423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03428976,0.000072580755,0.9363772,0.0002586664,0.00029712834,0.00019014269,7.443153e-7,0.0006790262,0.027834726],"genre_scores_gemma":[0.9765664,0.0000021925875,0.023046326,0.00008427097,0.000010866194,0.000012871544,2.3514659e-7,0.000004602566,0.00027224037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988363,0.000042160864,0.00020790155,0.00034110292,0.00018033102,0.00039223343],"domain_scores_gemma":[0.99919915,0.00004953235,0.00003698364,0.0006290249,0.000023943645,0.00006136329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006416699,0.00010596231,0.00015533423,0.00018634327,0.000057320845,0.000079179925,0.0009313042,0.00008730049,0.000011557759],"category_scores_gemma":[0.000051964376,0.0000917738,0.00002349518,0.00064838614,0.000023769482,0.00033868852,0.0005164751,0.00012639223,0.000049903585],"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.0000059250583,0.000080692516,0.13254304,0.000018131914,0.000011367731,0.000041130334,0.0014829648,0.00007055746,0.00004550535,0.86033744,0.004536514,0.0008267396],"study_design_scores_gemma":[0.0008144016,0.00018757817,0.11137938,0.00011480484,0.0000051933634,0.000024969047,0.0014537298,0.778878,0.0010503295,0.10292027,0.002495875,0.0006754632],"about_ca_topic_score_codex":0.00013049546,"about_ca_topic_score_gemma":0.0005680784,"teacher_disagreement_score":0.94227666,"about_ca_system_score_codex":0.0001718937,"about_ca_system_score_gemma":0.000021974733,"threshold_uncertainty_score":0.3742427},"labels":[],"label_agreement":null},{"id":"W2064017205","doi":"10.5555/1404595.1404618","title":"A zone based architecture for massively multi-user simulations","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Node (physics); Overhead (engineering); Computer network; Distributed computing; Architecture; Resilience (materials science); Massively parallel; Layer (electronics); Operating system; Engineering","score_opus":0.025634791693965032,"score_gpt":0.2871175129773663,"score_spread":0.2614827212834013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064017205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055631706,0.000012583854,0.98410255,0.008234116,0.00014562334,0.0004795671,0.000008789189,0.0011456938,0.00030791055],"genre_scores_gemma":[0.36785638,7.299144e-8,0.628984,0.0012316523,0.000028177315,0.000017959848,0.000002549105,0.000007815169,0.0018714003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988104,0.000010522688,0.00018632169,0.0003723906,0.00018645031,0.00043391742],"domain_scores_gemma":[0.9986807,0.0004313636,0.000045146015,0.0006250947,0.00012115538,0.000096538744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023745597,0.00013854062,0.00012742094,0.00027072174,0.00012233005,0.000078517645,0.0009487355,0.00010106429,0.00001050119],"category_scores_gemma":[0.00019096809,0.00011734096,0.000064970234,0.00067179184,0.000035162353,0.00011569004,0.00021829156,0.00012017807,0.000029519882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006884862,0.000395076,0.0026041442,0.000031782172,0.000060898838,0.000043436656,0.0007559842,0.3182328,0.011692429,0.14841667,0.028983194,0.48871472],"study_design_scores_gemma":[0.0013299842,0.0002002311,0.008689524,0.000021325051,0.0000083509785,0.0000050357758,0.00003818333,0.7479911,0.024117598,0.0041572717,0.21295562,0.00048580277],"about_ca_topic_score_codex":0.000013959629,"about_ca_topic_score_gemma":0.00040133082,"teacher_disagreement_score":0.48822892,"about_ca_system_score_codex":0.000043106134,"about_ca_system_score_gemma":0.000040633346,"threshold_uncertainty_score":0.47850254},"labels":[],"label_agreement":null},{"id":"W2065025227","doi":"10.1016/j.jag.2010.04.001","title":"Real-time notification and improved situational awareness in fire emergencies using geospatial-based publish/subscribe","year":2010,"lang":"en","type":"article","venue":"International Journal of Applied Earth Observation and Geoinformation","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":35,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Al-Balqa' Applied University","keywords":"Geospatial analysis; Situation awareness; Computer science; Context (archaeology); Middleware (distributed applications); Geospatial PDF; Publication; Computer security; Data science; World Wide Web; Geography; Engineering; Database; Remote sensing; Business","score_opus":0.017856490998497274,"score_gpt":0.24721905697232996,"score_spread":0.2293625659738327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065025227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8880401,0.0000061441224,0.10785576,0.0031995885,0.0005002634,0.00018240004,0.000006460283,0.000056670677,0.00015259699],"genre_scores_gemma":[0.8817778,0.00002305251,0.11768702,0.00033179153,0.00009804387,0.000009155847,0.000052580475,0.000005760447,0.000014776978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843323,0.000014653871,0.00069452456,0.00016595247,0.0005350622,0.00015655214],"domain_scores_gemma":[0.998281,0.000088154906,0.0005674695,0.00017503636,0.00080987485,0.000078450066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007329722,0.00013680707,0.00016285582,0.00048793026,0.00009729691,0.00039130234,0.00049918797,0.00011681842,0.000015587337],"category_scores_gemma":[0.00019337688,0.0001349499,0.000031714626,0.0004070066,0.000042309763,0.0022852775,0.000119171455,0.0002275087,0.0000054857455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038585594,0.00022639771,0.02864219,0.00006634884,0.000108977416,0.000008342499,0.005227498,0.08083158,0.28058538,0.064331144,0.00082320016,0.5387631],"study_design_scores_gemma":[0.00065189385,0.000036942656,0.19095643,0.000026325155,0.000004845848,0.000016104177,0.00008221031,0.8013339,0.0036286945,0.002286292,0.00082596747,0.00015040285],"about_ca_topic_score_codex":0.00010411341,"about_ca_topic_score_gemma":0.00018255868,"teacher_disagreement_score":0.7205023,"about_ca_system_score_codex":0.000046854253,"about_ca_system_score_gemma":0.00019107493,"threshold_uncertainty_score":0.5503098},"labels":[],"label_agreement":null},{"id":"W2065318940","doi":"10.48550/arxiv.1405.4027","title":"Three-Way Joins on MapReduce: An Experimental Study","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Joins; Computer science; Join (topology); Traverse; Theoretical computer science; Node (physics); Computation; Programming paradigm; Data mining; Distributed computing; Algorithm; Programming language","score_opus":0.09650214532738621,"score_gpt":0.22270171571543018,"score_spread":0.12619957038804397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065318940","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7975103,0.000021221456,0.19742748,0.00015798042,0.001010125,0.00074080966,0.00000675324,0.0013498846,0.0017753943],"genre_scores_gemma":[0.9957059,0.0000048107313,0.003522066,0.00021868978,0.0001456914,0.000007958632,0.00000765989,0.000035075835,0.00035215938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964981,0.00016073762,0.0002463926,0.0022367623,0.0002499933,0.00060799415],"domain_scores_gemma":[0.995389,0.00007722026,0.00020965617,0.00392286,0.00011054992,0.00029070073],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00037304626,0.00055319536,0.0005049182,0.0005785936,0.00024137637,0.00026659938,0.0058697304,0.0005087269,0.000022137136],"category_scores_gemma":[0.0000352559,0.00062375446,0.00017385148,0.00073568296,0.00012569121,0.00037056583,0.0064215064,0.00116401,0.00034885903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002468404,0.0077523603,0.023303349,0.000054949745,0.0004878947,0.0023449976,0.003122314,0.48534662,0.0007307702,0.4597445,0.009342144,0.00752327],"study_design_scores_gemma":[0.0034080297,0.009223629,0.04302715,0.00034251707,0.00019555363,0.000024374416,0.0023339395,0.81792533,0.011319401,0.10441275,0.0029123235,0.004875016],"about_ca_topic_score_codex":0.00020211155,"about_ca_topic_score_gemma":0.00022029757,"teacher_disagreement_score":0.35533175,"about_ca_system_score_codex":0.00041453048,"about_ca_system_score_gemma":0.00010407514,"threshold_uncertainty_score":0.9996214},"labels":[],"label_agreement":null},{"id":"W2066292413","doi":"10.1007/s12083-012-0190-2","title":"The performance and locality tradeoff in bittorrent-like file sharing systems","year":2013,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Toronto","funders":"University of Hong Kong; Yale University","keywords":"BitTorrent; Computer science; Locality; Distributed computing; Peer-to-peer; Computer network; Selection (genetic algorithm); File sharing; The Internet; Matching (statistics); Pareto principle; Download; Mathematical optimization","score_opus":0.015682504293287103,"score_gpt":0.2372985244764094,"score_spread":0.2216160201831223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066292413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34975904,0.0033096075,0.53761345,0.090664595,0.0022350196,0.008620274,0.00009601805,0.0027848312,0.00491715],"genre_scores_gemma":[0.9854188,0.00007987007,0.0077435197,0.0005624586,0.00036904644,0.0033585483,0.000016460544,0.000025826954,0.0024254636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973477,0.000042340558,0.00045385244,0.0008709686,0.000514301,0.000770817],"domain_scores_gemma":[0.99788046,0.00034661117,0.000095985655,0.0011483151,0.00021066675,0.000317989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009068808,0.00027879246,0.00027895006,0.00019678727,0.0006870385,0.0010065067,0.0015207201,0.00012033932,0.0000053203703],"category_scores_gemma":[0.00005902295,0.0002323153,0.000032978864,0.0015550202,0.00010220103,0.00026454296,0.0010744572,0.0003675305,0.00012936858],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007256233,0.00008336827,0.023173228,0.000060808175,0.000033962,0.000002171033,0.0012285078,0.019019768,0.000106416686,0.015757026,0.23346552,0.70706195],"study_design_scores_gemma":[0.00014440766,0.00005465378,0.034079373,0.00012850136,0.000006552975,0.000018605102,0.00017050622,0.24221596,0.000022068512,0.001154254,0.7216097,0.00039538744],"about_ca_topic_score_codex":0.0003032139,"about_ca_topic_score_gemma":0.00009617766,"teacher_disagreement_score":0.7066666,"about_ca_system_score_codex":0.00008838654,"about_ca_system_score_gemma":0.000029279277,"threshold_uncertainty_score":0.97057676},"labels":[],"label_agreement":null},{"id":"W2067014395","doi":"10.1145/2386958.2386971","title":"A multihop supplying partner protocol for 3D streaming systems over thin mobile devices","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Protocol (science); Bandwidth (computing); Real Time Streaming Protocol; Mobile computing; Wireless; Wireless network; Mobile device; Wireless ad hoc network; Distributed computing; Wireless Application Protocol; Network packet; The Internet; Telecommunications; Operating system","score_opus":0.04331453921668309,"score_gpt":0.3422116208524233,"score_spread":0.2988970816357402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067014395","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008351302,0.000057916543,0.7673353,0.0002469362,0.0005144572,0.21903613,0.000006945695,0.0024240427,0.0020269738],"genre_scores_gemma":[0.18318674,1.5860803e-7,0.27049938,0.00018153565,0.00017765696,0.54499,0.0000014865176,0.000019801684,0.00094322383],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99809325,0.00004213729,0.0003265867,0.00042680575,0.00032079357,0.0007904047],"domain_scores_gemma":[0.9986088,0.00025282474,0.0001212074,0.00078465603,0.00009174631,0.00014071967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896233,0.00022815695,0.00024317538,0.00014327536,0.00017410587,0.00032227824,0.001152361,0.00013178744,0.000016657688],"category_scores_gemma":[0.00007118317,0.0001742781,0.00006489293,0.0003885987,0.000029323573,0.0010685886,0.00063896144,0.00012368402,0.000067906054],"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.00009489706,0.0012982034,0.1257577,0.0015505684,0.000265135,0.000020227882,0.0073675658,0.016323213,0.004260772,0.14209878,0.15857776,0.54238516],"study_design_scores_gemma":[0.0008238075,0.00020078188,0.0017432827,0.00016308331,0.000007913376,0.000011628491,0.0004484123,0.4611754,0.003270452,0.00017086425,0.5314332,0.00055110734],"about_ca_topic_score_codex":0.00014161933,"about_ca_topic_score_gemma":0.000056599238,"teacher_disagreement_score":0.54183406,"about_ca_system_score_codex":0.00008154959,"about_ca_system_score_gemma":0.00003451852,"threshold_uncertainty_score":0.71068543},"labels":[],"label_agreement":null},{"id":"W2067309023","doi":"10.1109/wcnc.2013.6555302","title":"Exploiting cluster multicast for P2P streaming application in cellular system","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Computer science; Multicast; Computer network; Reliable multicast; Retransmission; Bottleneck; Distributed computing; Cellular network; Source-specific multicast; Network packet","score_opus":0.013189423679702692,"score_gpt":0.2270122723575025,"score_spread":0.2138228486777998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067309023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12833172,0.000013852158,0.8676849,0.0013565705,0.0000759081,0.0009474418,5.135198e-7,0.00075153616,0.0008375571],"genre_scores_gemma":[0.71473837,2.2740191e-7,0.28431964,0.000101466,0.000032324024,0.000681161,0.0000014750923,0.000007861025,0.000117470234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988311,0.000018279192,0.00025998242,0.00039982313,0.0001388839,0.00035193574],"domain_scores_gemma":[0.9990629,0.00015371539,0.000059993727,0.0005893456,0.00008210709,0.000051966534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002481249,0.00011630408,0.00014051402,0.00015806168,0.00006211387,0.00015181758,0.00082485785,0.0000771325,0.0000013632018],"category_scores_gemma":[0.000054010612,0.00010548986,0.000030621974,0.0003615068,0.000014261052,0.00039780606,0.0003919887,0.00007640795,0.00015943276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007376821,0.0001168155,0.0038272212,0.00023830541,0.000019204148,0.0000064234173,0.0013527246,0.0053171897,0.03993116,0.17915568,0.0039841672,0.7660437],"study_design_scores_gemma":[0.00024053616,0.000034222012,0.0004923431,0.000050874372,0.0000014907702,0.00000270114,0.00073638564,0.98418313,0.012635456,0.0007909147,0.0006629979,0.00016895428],"about_ca_topic_score_codex":0.0001890577,"about_ca_topic_score_gemma":0.000050603805,"teacher_disagreement_score":0.9788659,"about_ca_system_score_codex":0.00011091303,"about_ca_system_score_gemma":0.000010223516,"threshold_uncertainty_score":0.43017516},"labels":[],"label_agreement":null},{"id":"W2068651027","doi":"10.1145/1459359.1459504","title":"Online adaptation for video sharing applications","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Adaptation (eye); Metadata; Live streaming; Multimedia; Relay; Scheme (mathematics); Overlay; Peer-to-peer; Bandwidth (computing); Computer network; Video streaming; World Wide Web; Power (physics); Operating system","score_opus":0.06631609530878185,"score_gpt":0.28432101264843773,"score_spread":0.21800491733965588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068651027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005194174,0.000031626027,0.98903733,0.0033474765,0.00004963688,0.00037961497,0.0000030835695,0.0010517894,0.0009052899],"genre_scores_gemma":[0.2303124,0.000005020705,0.7676991,0.0006639442,0.000052032934,0.0002732004,0.0000064808505,0.0000051779202,0.0009826033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993002,0.0000025149427,0.00012639016,0.00029112818,0.000106969106,0.00017282135],"domain_scores_gemma":[0.99927175,0.000059996215,0.00003124757,0.0005146231,0.00008270581,0.0000396938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000688899,0.000065826694,0.00007118638,0.00009487516,0.00013536384,0.000032286767,0.0009027944,0.000031225856,0.0000024055994],"category_scores_gemma":[0.000039870065,0.000062652725,0.000028314205,0.00043220213,0.000019065092,0.00020827776,0.000258787,0.000046888104,0.000046652247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004373864,0.00018494527,0.00074765715,0.000011508366,0.000017899561,0.0000038144829,0.0005268654,0.010019808,0.00083974213,0.57815945,0.02841441,0.3810695],"study_design_scores_gemma":[0.00024197603,0.00008344662,0.0029430666,0.00000771384,0.0000032636156,0.000025233483,0.00006393475,0.7790345,0.0022136413,0.03713805,0.17799835,0.00024680462],"about_ca_topic_score_codex":0.000017400183,"about_ca_topic_score_gemma":0.00005540138,"teacher_disagreement_score":0.7690147,"about_ca_system_score_codex":0.00002926286,"about_ca_system_score_gemma":0.000024556,"threshold_uncertainty_score":0.2554904},"labels":[],"label_agreement":null},{"id":"W2068686849","doi":"10.1109/sc.companion.2012.77","title":"A New Framework for Publishing and Sharing Network and Security Datasets","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Metadata; Ambiguity; XML; Key (lock); Construct (python library); Component (thermodynamics); Information retrieval; Focus (optics); Data mining; Data science; World Wide Web","score_opus":0.031146484683059934,"score_gpt":0.2822080885172266,"score_spread":0.2510616038341667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068686849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061829058,0.0011770357,0.98303205,0.0080063855,0.00037767034,0.00024903263,0.000010553109,0.0005703499,0.00039401313],"genre_scores_gemma":[0.20556223,0.00001962657,0.7927101,0.0012195744,0.00040656122,0.000017343282,0.000010330034,0.000008214205,0.000046010766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986736,0.0000110415485,0.00014495879,0.00041384652,0.00014521628,0.00061132986],"domain_scores_gemma":[0.9986904,0.00030153024,0.00004675368,0.00066159334,0.000020007019,0.00027969503],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00066598406,0.00013631814,0.0001559361,0.00006745504,0.00015748586,0.0013018239,0.0009999747,0.00014903527,0.000004073205],"category_scores_gemma":[0.0005105952,0.00012326612,0.000015317422,0.0004473612,0.00002509424,0.0028696684,0.0023620967,0.00022834903,0.0000038427834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003425501,0.000008059058,0.011336939,0.000010216517,0.000011886157,8.834466e-7,0.00037965318,0.000011746464,0.000002801241,0.62041837,0.23528962,0.13252641],"study_design_scores_gemma":[0.00029451255,0.000071380164,0.0078950655,0.00009280724,0.0000124204025,0.000035832178,0.00006459889,0.026350131,0.0001234492,0.71398413,0.25061986,0.00045581438],"about_ca_topic_score_codex":0.000059657814,"about_ca_topic_score_gemma":0.000041135936,"teacher_disagreement_score":0.19937932,"about_ca_system_score_codex":0.000017722998,"about_ca_system_score_gemma":0.000017707705,"threshold_uncertainty_score":0.99973494},"labels":[],"label_agreement":null},{"id":"W2068790982","doi":"10.1145/1073814.1073872","title":"A scheme for load balancing in heterogenous distributed hash tables","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Joins; Computer science; Hash function; Node (physics); Scheme (mathematics); Distributed computing; Distributed hash table; Merkle tree; Computer network; Join (topology); Hash table; Hash chain; Theoretical computer science; Mathematics; Peer-to-peer; Computer security; Combinatorics","score_opus":0.01537367574269511,"score_gpt":0.2497174017020115,"score_spread":0.2343437259593164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068790982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12153377,0.00018550106,0.8697949,0.0067790877,0.00009519784,0.00034647592,0.000014326225,0.0008831338,0.0003675996],"genre_scores_gemma":[0.5869706,0.0000033415408,0.4121898,0.00052556326,0.000039821094,0.00007509572,0.0000055490345,0.0000068950353,0.00018331064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857545,0.000010759968,0.00023627769,0.0004089181,0.00020916933,0.0005594443],"domain_scores_gemma":[0.9991409,0.0000835622,0.00004059328,0.0005827993,0.000082878774,0.00006923336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028922225,0.00014444716,0.00019167211,0.00011368963,0.00007075135,0.00013812604,0.0011363714,0.000088901164,0.000006768003],"category_scores_gemma":[0.00014774958,0.0001337765,0.000046184643,0.0006376511,0.000023790346,0.00032805584,0.00046819664,0.000102135244,0.000056352983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065841654,0.00073272956,0.024982817,0.00009043734,0.000099292956,0.00008873265,0.0015521835,0.022810921,0.031101536,0.09170506,0.16981678,0.6569537],"study_design_scores_gemma":[0.0016604834,0.00027742874,0.0034455052,0.00009650289,0.0000051801503,0.000046306643,0.00008505554,0.6582504,0.059808582,0.006302803,0.26914644,0.00087530044],"about_ca_topic_score_codex":0.00007138503,"about_ca_topic_score_gemma":0.0011491171,"teacher_disagreement_score":0.65607834,"about_ca_system_score_codex":0.000259504,"about_ca_system_score_gemma":0.0000752863,"threshold_uncertainty_score":0.5455247},"labels":[],"label_agreement":null},{"id":"W2069213416","doi":"10.1109/iscas.2010.5537739","title":"Streaming capacity in multi-channel P2P VoD systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Channel (broadcasting); Upload; Computer network; Bandwidth (computing); Shared resource; Channel capacity; Channel allocation schemes; Video on demand; Telecommunications; Wireless; World Wide Web","score_opus":0.05474572862012204,"score_gpt":0.25216563102159384,"score_spread":0.1974199024014718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069213416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3999634,0.000026506199,0.5941497,0.0010262803,0.0013475635,0.00026422212,0.0000017814125,0.001199171,0.0020213255],"genre_scores_gemma":[0.9016219,0.0000012209372,0.09766689,0.00009125819,0.000037317055,0.00003315029,3.984599e-7,0.0000072935436,0.0005405921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986671,0.000025055613,0.00022366217,0.00043444757,0.00021748595,0.00043221813],"domain_scores_gemma":[0.99883634,0.00007725501,0.000047947426,0.0008874796,0.00006217356,0.00008877812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003767939,0.00015012015,0.00018429861,0.00024106613,0.00005912164,0.00016672062,0.0014794545,0.00015643882,0.0000025722986],"category_scores_gemma":[0.00015857405,0.00013196349,0.000030233128,0.00061112107,0.000046461126,0.00032921185,0.00058815803,0.00038985646,0.000111237045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017755083,0.0015156188,0.04888256,0.00020604621,0.000111944326,0.0005014365,0.009336404,0.040161304,0.08903678,0.5623661,0.026803108,0.22106092],"study_design_scores_gemma":[0.00054290355,0.000071224764,0.02177861,0.00005847661,0.0000022133613,0.000049685237,0.00029149308,0.9620101,0.009096341,0.0020111736,0.0035356348,0.00055213063],"about_ca_topic_score_codex":0.0011107003,"about_ca_topic_score_gemma":0.0036917177,"teacher_disagreement_score":0.92184883,"about_ca_system_score_codex":0.000044769033,"about_ca_system_score_gemma":0.00002590691,"threshold_uncertainty_score":0.5381315},"labels":[],"label_agreement":null},{"id":"W2069737692","doi":"10.1007/s12083-009-0038-6","title":"Subscriber mobility management for a P2P publish/subscribe overlay in mobile tactical networks","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Overlay; Computer network; Handover; Reliability (semiconductor); Publication; Mobility management; Scheme (mathematics); Overlay network; Distributed computing; Mobile device; World Wide Web; The Internet","score_opus":0.016292047550373966,"score_gpt":0.2836304494832623,"score_spread":0.2673384019328884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069737692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005327679,0.00044493735,0.9438926,0.04055241,0.00047749485,0.0048713335,0.000022962677,0.0011121769,0.0032984077],"genre_scores_gemma":[0.8334859,0.00005957308,0.15070829,0.0050810906,0.0008026797,0.0077812187,0.00006159814,0.0000505139,0.0019691132],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99519575,0.000069673944,0.00075031427,0.0017332333,0.00081704615,0.001433997],"domain_scores_gemma":[0.9965591,0.000366509,0.00012954569,0.0019247591,0.00041712957,0.0006029597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017639741,0.00050468626,0.0005617106,0.0005347141,0.00043969933,0.00087237026,0.0020897095,0.00027430363,0.000005539124],"category_scores_gemma":[0.00012372923,0.00053087255,0.00014007514,0.0034557113,0.00007899365,0.00044129713,0.0009022773,0.0005209837,0.00004539983],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056731606,0.00053547736,0.0011649241,0.000025328414,0.00004739046,0.000011003495,0.00047590348,0.05030533,0.000047523186,0.07811222,0.157233,0.7119852],"study_design_scores_gemma":[0.00058822706,0.00030087173,0.012443957,0.00008258622,0.00003575964,0.000015292939,0.00011374614,0.057463128,0.000050616407,0.018716529,0.90938824,0.0008010446],"about_ca_topic_score_codex":0.000029050625,"about_ca_topic_score_gemma":0.000085164356,"teacher_disagreement_score":0.82815826,"about_ca_system_score_codex":0.00024897567,"about_ca_system_score_gemma":0.000044103395,"threshold_uncertainty_score":0.99971426},"labels":[],"label_agreement":null},{"id":"W2069869616","doi":"10.1109/ms.2011.88","title":"Journey: A Massively Multiplayer Online Game Middleware","year":2011,"lang":"en","type":"article","venue":"IEEE Software","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Middleware (distributed applications); Scalability; Programmer; Fault tolerance; Reliability (semiconductor); Load balancing (electrical power); Consistency (knowledge bases); Peer-to-peer; Distributed computing; Multimedia; Operating system; Grid","score_opus":0.08319503254545663,"score_gpt":0.26244527294376613,"score_spread":0.1792502403983095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069869616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21479246,0.00024250886,0.77822304,0.0012281445,0.0014183283,0.00032522177,0.00006399835,0.0035180391,0.00018828198],"genre_scores_gemma":[0.5342588,0.000012305606,0.4638007,0.0010001205,0.00012811743,0.000034712742,0.0000047328135,0.00003054099,0.0007299974],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978337,0.000045598823,0.00032850332,0.0006766595,0.00042274233,0.0006927536],"domain_scores_gemma":[0.9980216,0.00010665143,0.00013748123,0.0012645837,0.00023060404,0.00023906551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015394864,0.00030662405,0.00030477988,0.00028042484,0.00018828169,0.00008533997,0.0026524276,0.0002134799,0.000039254028],"category_scores_gemma":[0.00035071964,0.00028066014,0.00012470671,0.00080620736,0.00008410033,0.00046141312,0.0009081477,0.00039448973,0.0004397145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012739825,0.0015419305,0.0684221,0.00013661206,0.00035847267,0.0024307887,0.027908683,0.0014421314,0.0026737927,0.0035068982,0.1796393,0.7118119],"study_design_scores_gemma":[0.0075021936,0.003316426,0.37179962,0.0017725809,0.00018641276,0.0013334893,0.0017927382,0.03408767,0.100751504,0.094017036,0.37429312,0.009147179],"about_ca_topic_score_codex":0.00006343467,"about_ca_topic_score_gemma":0.00010357284,"teacher_disagreement_score":0.70266473,"about_ca_system_score_codex":0.00009085655,"about_ca_system_score_gemma":0.00009492251,"threshold_uncertainty_score":0.99996454},"labels":[],"label_agreement":null},{"id":"W2069921855","doi":"10.1117/12.775143","title":"&lt;title&gt;A method for computing the reputation of multimedia services through selection and composition&lt;/title&gt;","year":2008,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reputation; Computer science; Incentive; Selection (genetic algorithm); Task (project management); Composition (language); The Internet; Multimedia; Dependency (UML); Service (business); World Wide Web; Artificial intelligence; Engineering","score_opus":0.01315149225241319,"score_gpt":0.25121754771546656,"score_spread":0.23806605546305337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069921855","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95164204,0.00014812492,0.04170107,0.00283662,0.00025530034,0.0004891029,0.0000148348145,0.00017342133,0.002739486],"genre_scores_gemma":[0.18394129,0.000044699238,0.81561995,0.00008960484,0.00015983303,0.00003536639,0.000003429113,0.000016932905,0.000088911365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998997,3.3041427e-8,0.00029859768,0.00022489374,0.0003090085,0.00017051813],"domain_scores_gemma":[0.998768,0.00017118068,0.00020591443,0.000046131096,0.0007786626,0.000030109693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003491674,0.00013033785,0.00018528872,0.000056305707,0.00009158537,0.00004861286,0.00062208745,0.000096630734,0.0000029629953],"category_scores_gemma":[0.00013074226,0.000101465,0.00015141028,0.00029209498,0.00008836358,0.0002702165,0.00016333842,0.00012006447,0.0000018392184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002093407,0.000050433064,0.00008029515,0.00028252654,0.00018394944,5.488862e-8,0.00077628467,0.0006073314,0.23456313,0.7485076,0.009394104,0.0055333497],"study_design_scores_gemma":[0.000450142,0.00020336812,0.0007242315,0.00019208954,0.000058085447,0.000038815637,0.00019003781,0.8944112,0.08475291,0.0059607434,0.012784174,0.00023418127],"about_ca_topic_score_codex":0.0000036955396,"about_ca_topic_score_gemma":1.2425916e-7,"teacher_disagreement_score":0.8938039,"about_ca_system_score_codex":0.000051099192,"about_ca_system_score_gemma":0.0000159483,"threshold_uncertainty_score":0.41376224},"labels":[],"label_agreement":null},{"id":"W2070808191","doi":"10.1109/iwqos.2013.6550279","title":"On the impact of popularity decays in peer-to-peer VoD systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Upload; Popularity; Scalability; Peer-to-peer; Overlay; Population; Replication (statistics); Server; Distributed computing; Scheduling (production processes); BitTorrent; Computer network; World Wide Web; Operating system","score_opus":0.02406072738770717,"score_gpt":0.2804117991950192,"score_spread":0.25635107180731204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070808191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8957979,0.000032897973,0.06623899,0.024370909,0.0003329422,0.0010586763,0.0000049140713,0.000495619,0.0116671575],"genre_scores_gemma":[0.98901653,7.781146e-7,0.008403423,0.00036179475,0.000024843795,0.000104377614,0.0000010803366,0.000011484826,0.0020756864],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.997713,0.00009984123,0.00037612458,0.0004430959,0.0008230664,0.0005448168],"domain_scores_gemma":[0.99750936,0.00027354734,0.00008672629,0.0016006199,0.0003980471,0.00013170122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010264345,0.00022422065,0.00031679095,0.00032835727,0.000060523398,0.0002573884,0.0026576417,0.00013745022,0.000039698454],"category_scores_gemma":[0.0007669623,0.0001306654,0.00010701239,0.0013561532,0.000045179262,0.00029028364,0.0007932119,0.00029009455,0.00055013085],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013316829,0.00026702846,0.024657514,0.000015400086,0.000059936327,0.000017146904,0.00090487575,0.022288822,0.0017429071,0.4120961,0.5204351,0.017501857],"study_design_scores_gemma":[0.00093453005,0.0019851595,0.5784203,0.00030594395,0.00001067149,0.000052882104,0.00065219664,0.32520202,0.0071276166,0.07947545,0.0043987376,0.0014345292],"about_ca_topic_score_codex":0.007676806,"about_ca_topic_score_gemma":0.00023760844,"teacher_disagreement_score":0.55376273,"about_ca_system_score_codex":0.00018581375,"about_ca_system_score_gemma":0.000060142334,"threshold_uncertainty_score":0.99893117},"labels":[],"label_agreement":null},{"id":"W2070840498","doi":"10.1007/s11042-009-0311-y","title":"A hybrid P2P communications architecture for zonal MMOGs","year":2009,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Peer-to-Peer Network Technologies","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":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Distributed computing; Architecture; Overlay network; Overlay; Server; Load balancing (electrical power); Computer network; Peer-to-peer; Virtual machine; Routing (electronic design automation); Metaverse; Virtual reality; Human–computer interaction; The Internet; World Wide Web; Operating system","score_opus":0.0288012268912045,"score_gpt":0.28187245609486505,"score_spread":0.25307122920366054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070840498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009853957,0.00031173756,0.95352924,0.04270764,0.00002692474,0.0010820365,0.00011581899,0.0005010712,0.0007401538],"genre_scores_gemma":[0.19960687,0.00006455768,0.79684824,0.0015546194,0.00010459043,0.0015745969,0.00008443972,0.000008331243,0.00015376612],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905705,0.000013715491,0.00018829406,0.00035673362,0.000119051336,0.00026515353],"domain_scores_gemma":[0.99807,0.00033996737,0.00005703297,0.001331833,0.000082460814,0.00011869961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012444823,0.0001322687,0.00014362625,0.00009618421,0.0003142721,0.00017244786,0.0015828168,0.000054166303,0.0000016869946],"category_scores_gemma":[0.000073510775,0.00012466747,0.000049462178,0.00030057202,0.00009749723,0.00014437278,0.00032638913,0.00015838988,0.000028214816],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018187112,0.00006649179,0.000020776293,0.0000027372644,0.0000060285934,2.2932056e-7,0.000097538934,0.00007153789,0.00090150617,0.06873058,0.0057491316,0.92435163],"study_design_scores_gemma":[0.000423507,0.0001127211,0.0056167413,0.000016271264,0.000013491615,0.000021580065,0.00001892214,0.05566696,0.001335652,0.10010863,0.83633447,0.00033106122],"about_ca_topic_score_codex":0.000003816128,"about_ca_topic_score_gemma":0.000009472962,"teacher_disagreement_score":0.9240206,"about_ca_system_score_codex":0.000020480993,"about_ca_system_score_gemma":0.0000326175,"threshold_uncertainty_score":0.50837916},"labels":[],"label_agreement":null},{"id":"W2071726508","doi":"10.1007/s00530-005-0191-6","title":"CollectCast: A peer-to-peer service for media streaming","year":2005,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":56,"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":"Purdue University; National Science Foundation","keywords":"Computer science; PlanetLab; Peer-to-peer; Communication source; Computer network; Quality of service; Network packet; Frame (networking); Distributed computing; The Internet; World Wide Web","score_opus":0.030816005106011325,"score_gpt":0.2710033394192735,"score_spread":0.2401873343132622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071726508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04731467,0.000626702,0.84536976,0.08667572,0.0077440063,0.0055114427,0.000251794,0.0045884713,0.001917453],"genre_scores_gemma":[0.38610756,0.000002465835,0.6038611,0.0014301568,0.001520062,0.0013133517,0.00003629903,0.00007360652,0.0056553837],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584097,0.00007747127,0.000653177,0.0009963459,0.0013334665,0.0010985733],"domain_scores_gemma":[0.9957042,0.0009314077,0.00017511554,0.0014500387,0.0012597361,0.0004795269],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012093893,0.0004329661,0.0005858027,0.0005538741,0.0002442054,0.0004697346,0.002775141,0.00028437105,0.00000787823],"category_scores_gemma":[0.0015849019,0.00041558093,0.000112968955,0.0019812966,0.000035008965,0.00044992505,0.00074202777,0.00025295283,0.000987129],"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.00006274211,0.00023839844,0.0006487134,0.00018947688,0.0001535494,0.000048205642,0.023403192,0.011406244,0.0043544644,0.001661332,0.51232606,0.44550762],"study_design_scores_gemma":[0.00073475635,0.00010318525,0.00041632573,0.00011407203,0.000012742296,0.000030449648,0.00036845737,0.62349683,0.0016266182,0.0000639868,0.37255296,0.00047959233],"about_ca_topic_score_codex":0.00033126597,"about_ca_topic_score_gemma":0.0010182263,"teacher_disagreement_score":0.6120906,"about_ca_system_score_codex":0.00035731777,"about_ca_system_score_gemma":0.00015564325,"threshold_uncertainty_score":0.9998296},"labels":[],"label_agreement":null},{"id":"W2071964306","doi":"10.1109/glocom.2011.6134411","title":"Blocking in Community-Centric Information Management Approaches for the Social Web","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Information flow; Blocking (statistics); World Wide Web; Web modeling; Key (lock); Web 2.0; Social Semantic Web; Control (management); Web page; Web service; Computer network; Computer security; Artificial intelligence","score_opus":0.08998948083445768,"score_gpt":0.25082322882366426,"score_spread":0.16083374798920658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071964306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013986794,0.000018865205,0.9549042,0.0026104935,0.00013715478,0.00067566324,8.243081e-7,0.00044151326,0.027224509],"genre_scores_gemma":[0.89657956,0.000005061157,0.10274182,0.00045152352,0.000011408502,0.00013374083,0.0000013302001,0.0000025424752,0.00007300884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993617,0.00003877073,0.00016230144,0.000076671386,0.00013016378,0.0002304047],"domain_scores_gemma":[0.9994306,0.00008796039,0.00004762793,0.0003969832,0.000023302324,0.000013547147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066433556,0.0000752921,0.000071809394,0.00019776229,0.00029733908,0.0000988177,0.0016128893,0.000043535285,0.0000027813119],"category_scores_gemma":[0.000022486285,0.00005416023,0.0000286011,0.0006408427,0.000029548677,0.00042492832,0.0008911159,0.00015908203,0.00001945065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051106977,0.000048910075,0.00042794662,0.000017900697,0.000016044583,4.22181e-7,0.007646356,0.00017082912,6.1338505e-7,0.34317344,0.003596861,0.64489555],"study_design_scores_gemma":[0.0018108927,0.00020090886,0.069168456,0.0000440833,0.00002944641,0.0000063697616,0.020365415,0.75204086,0.0006306589,0.07200291,0.082999825,0.00070019515],"about_ca_topic_score_codex":0.00005213911,"about_ca_topic_score_gemma":0.00008723688,"teacher_disagreement_score":0.8825928,"about_ca_system_score_codex":0.000048182268,"about_ca_system_score_gemma":0.000009735222,"threshold_uncertainty_score":0.29971763},"labels":[],"label_agreement":null},{"id":"W2072473220","doi":"10.1109/glocomw.2011.6162329","title":"Towards community-centric integrity management in crowd-sourced systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Integrity management; Computer science; Data integrity; Work (physics); Management system; Knowledge management; The Internet; Scale (ratio); Computer security; World Wide Web; Engineering","score_opus":0.06891329112870292,"score_gpt":0.2631192598547853,"score_spread":0.19420596872608237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072473220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16054156,0.00015544363,0.6485878,0.0010175566,0.00074363104,0.0007514842,0.000001277781,0.0021046915,0.18609652],"genre_scores_gemma":[0.90651524,0.00001606685,0.09212999,0.0003027209,0.000010964291,0.00006152137,8.4846516e-7,0.000008300672,0.0009543714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983951,0.00022580253,0.0003098888,0.00030384536,0.0002934537,0.00047193904],"domain_scores_gemma":[0.99824506,0.000051896375,0.000056566685,0.0014976988,0.00005929429,0.00008948741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010098263,0.00017913918,0.00022829829,0.0004978821,0.00011081633,0.00013876983,0.0034288822,0.00011034215,0.000019073042],"category_scores_gemma":[0.000050675764,0.0001552934,0.000042717173,0.0014837128,0.000048516824,0.00024969882,0.0024286993,0.000644096,0.00018886545],"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.000018687744,0.0006088147,0.0075817495,0.00010255715,0.000078735895,0.00020097107,0.00556378,0.00027257172,0.000033520486,0.7355215,0.0140734445,0.23594365],"study_design_scores_gemma":[0.005434002,0.0016531277,0.5207835,0.00096900313,0.00007587225,0.00021533751,0.02041152,0.22129557,0.008793435,0.10995687,0.10571686,0.0046949233],"about_ca_topic_score_codex":0.003082565,"about_ca_topic_score_gemma":0.0002333451,"teacher_disagreement_score":0.74597365,"about_ca_system_score_codex":0.00017641809,"about_ca_system_score_gemma":0.000019555837,"threshold_uncertainty_score":0.63717735},"labels":[],"label_agreement":null},{"id":"W2072584719","doi":"10.1109/3pgcic.2012.9","title":"Analysis of HnH Model for Live Streaming Channels with a Small Number of Viewers","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Channel (broadcasting); Block (permutation group theory); Scheme (mathematics); Order (exchange); Service (business); Quality of service; Multimedia; Computer network; Mathematics","score_opus":0.04004725187057664,"score_gpt":0.2749635565819492,"score_spread":0.23491630471137256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072584719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22935681,0.000030989188,0.7695846,0.00014342544,0.000030880725,0.00015255467,0.0000055269097,0.000104318315,0.00059089134],"genre_scores_gemma":[0.62206066,0.0000025629156,0.37758356,0.000046194276,0.0000070338156,0.00002405012,0.0000012418889,0.0000042814104,0.000270411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990468,0.000011012378,0.00021639981,0.00022269548,0.00018224398,0.00032084095],"domain_scores_gemma":[0.998918,0.00011130072,0.00013452329,0.0005829052,0.00018859959,0.00006467652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026035492,0.00011667598,0.0003445559,0.0002469964,0.000023909153,0.000014870862,0.00071562326,0.000058252615,0.0000069203097],"category_scores_gemma":[0.00004157399,0.00008791477,0.00011067193,0.0012069792,0.00004539588,0.00022100404,0.00026115333,0.000044142722,0.0000035077449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084119194,0.00069156295,0.11867584,0.00017131297,0.0036258765,0.000002190279,0.01703699,0.57696635,0.0011977633,0.1354032,0.0019674213,0.1441774],"study_design_scores_gemma":[0.00012421208,0.00006457313,0.0009956665,0.000020893345,0.00018439366,0.0000010212783,0.00018632795,0.99411905,0.0035545724,0.00055992824,0.000051999592,0.00013738625],"about_ca_topic_score_codex":0.000084042826,"about_ca_topic_score_gemma":0.00011170793,"teacher_disagreement_score":0.4171527,"about_ca_system_score_codex":0.000022419801,"about_ca_system_score_gemma":0.00002709336,"threshold_uncertainty_score":0.35850602},"labels":[],"label_agreement":null},{"id":"W2073500977","doi":"10.1145/1738921.1738924","title":"Architectural challenges and solutions for peer-to-peer massively multiplayer online games","year":2009,"lang":"en","type":"article","venue":"ACM SIGMultimedia Records","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scalability; Computer science; Context (archaeology); Architecture; Server; Peer-to-peer; Massively parallel; Metaverse; Key (lock); Socialization; Multimedia; Distributed computing; Virtual reality; Computer security; Human–computer interaction; World Wide Web; Psychology","score_opus":0.05621450380132717,"score_gpt":0.2980189746226646,"score_spread":0.2418044708213374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073500977","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19492276,0.0025338465,0.2621973,0.53260136,0.002190952,0.0023419885,0.00018999071,0.0025960235,0.0004257934],"genre_scores_gemma":[0.37318277,0.0001383202,0.6231055,0.0014594515,0.00039262738,0.00016754902,0.0000289185,0.000027415728,0.0014974154],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965576,0.00005766597,0.00043141362,0.001085295,0.00067561935,0.0011923935],"domain_scores_gemma":[0.9962637,0.0011052447,0.00012446039,0.0015391137,0.00054797466,0.000419519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064852583,0.0004436311,0.0004815782,0.00050686265,0.00026151663,0.00015608888,0.0024683827,0.00024925068,0.0000065487498],"category_scores_gemma":[0.005881372,0.00040248325,0.00013374629,0.0004998638,0.0001094174,0.00036328795,0.0012401786,0.0003960832,0.000052222327],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004201534,0.00011925677,0.00009527026,0.000008986783,0.00003209988,0.000011861458,0.0021165241,0.00027773058,0.0014138102,0.0012547559,0.023475552,0.9711521],"study_design_scores_gemma":[0.005482743,0.0048194057,0.24075183,0.00030204654,0.000109677494,0.000261105,0.001282594,0.2469666,0.005967012,0.0641898,0.42623347,0.0036337292],"about_ca_topic_score_codex":0.000035320554,"about_ca_topic_score_gemma":0.00032791987,"teacher_disagreement_score":0.9675184,"about_ca_system_score_codex":0.00009973023,"about_ca_system_score_gemma":0.00007941032,"threshold_uncertainty_score":0.9998427},"labels":[],"label_agreement":null},{"id":"W2073818951","doi":"10.5555/2157848.2157850","title":"AntReckoning: dead reckoning using interest modeling by pheromones","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dead reckoning; Computer science; Motion (physics); Inertia; Key (lock); Quake (natural phenomenon); Artificial intelligence; Simulation; Computer security; Telecommunications; Global Positioning System","score_opus":0.17279109879679933,"score_gpt":0.27807542272553776,"score_spread":0.10528432392873843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073818951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25937125,0.00024367709,0.73489517,0.00025163774,0.00025806966,0.00008632238,5.85173e-7,0.0011886103,0.0037046995],"genre_scores_gemma":[0.58228785,0.000005722139,0.4173512,0.00015939116,0.00002064489,0.00000490117,4.982696e-7,0.000013165844,0.00015664053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831545,0.000035597564,0.0003051861,0.00058488146,0.0001913037,0.00056760036],"domain_scores_gemma":[0.99889,0.00003846241,0.000073046656,0.0007905852,0.00008763607,0.000120298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027716593,0.00022568913,0.00022183354,0.00018240557,0.00016194352,0.0001736214,0.0017599316,0.00012226429,0.000024471941],"category_scores_gemma":[0.00008027549,0.00020825912,0.000055495417,0.00062644074,0.000041779705,0.0006736206,0.0010743052,0.00021680824,0.00007213812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090254274,0.0005529119,0.009048515,0.000051773804,0.00026622764,0.00027374263,0.012599306,0.0147875585,0.087891124,0.15389554,0.019946877,0.70059615],"study_design_scores_gemma":[0.000119854296,0.00007512952,0.000025384701,0.000078397185,0.0000059407607,0.000031816908,0.0002075135,0.96226484,0.03177301,0.0046262206,0.00042271893,0.00036917016],"about_ca_topic_score_codex":0.0004035866,"about_ca_topic_score_gemma":0.00007040789,"teacher_disagreement_score":0.9474773,"about_ca_system_score_codex":0.00007119295,"about_ca_system_score_gemma":0.000032740074,"threshold_uncertainty_score":0.8492561},"labels":[],"label_agreement":null},{"id":"W207418988","doi":"10.1007/978-3-642-20798-3_2","title":"Enhancing Peer-to-Peer Traffic Locality through Selective Tracker Blocking","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Blocking (statistics); Locality; Peer-to-peer; Computer network","score_opus":0.025854159240142952,"score_gpt":0.26183584712629543,"score_spread":0.23598168788615248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207418988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011578813,0.00025290967,0.98306745,0.0057131764,0.0027987254,0.0010804669,0.000011115133,0.0013835982,0.0045346916],"genre_scores_gemma":[0.3809916,0.000010894832,0.61311007,0.003947593,0.00056841574,0.000045681834,0.00000469851,0.00008731564,0.0012337501],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98985654,0.000083384046,0.0010885617,0.0038292347,0.0031230906,0.0020192137],"domain_scores_gemma":[0.9937142,0.0006830205,0.000427815,0.0031393047,0.00161019,0.00042545886],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0026347945,0.0012590312,0.0012315856,0.0014775887,0.0005682157,0.0009331243,0.009015541,0.00091293635,0.000029018829],"category_scores_gemma":[0.0008222705,0.0012124524,0.00026403286,0.0029262737,0.0009059741,0.0011209545,0.004083854,0.0023031784,0.00030974805],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002440577,0.000118445096,0.000038839684,0.000052561954,0.00005742001,0.00025522284,0.011032025,0.1003321,0.00037161724,0.016098816,0.0012892961,0.87032926],"study_design_scores_gemma":[0.0014204863,0.002276067,0.00075686903,0.0030785194,0.000103996725,0.000667075,0.000008181256,0.22815669,0.08444577,0.60947025,0.061266147,0.008349981],"about_ca_topic_score_codex":0.00010753774,"about_ca_topic_score_gemma":0.0007244791,"teacher_disagreement_score":0.86197925,"about_ca_system_score_codex":0.001067134,"about_ca_system_score_gemma":0.00088676024,"threshold_uncertainty_score":0.99999857},"labels":[],"label_agreement":null},{"id":"W2074814683","doi":"10.1108/07378830010314500","title":"Linux: a viable alternative or desert mirage?","year":2000,"lang":"en","type":"article","venue":"Library Hi Tech","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Council of University Libraries; York University","funders":"","keywords":"Desert (philosophy); Corporation; Computer science; Microsoft excel; World Wide Web; Computer security; Operating system; Political science; Law","score_opus":0.014615442013445073,"score_gpt":0.23291945741643075,"score_spread":0.21830401540298566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074814683","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4867646,0.0011981768,0.20004542,0.049788117,0.0013941193,0.0020176717,0.000051444524,0.025765339,0.2329751],"genre_scores_gemma":[0.34305912,0.00015347694,0.55810505,0.005242671,0.00023021676,0.00014660564,0.000009102622,0.000058933667,0.092994854],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982588,0.000040754418,0.00024300693,0.0006100741,0.00030328435,0.0005440539],"domain_scores_gemma":[0.99851507,0.00010632893,0.000048427937,0.001176013,0.000017546903,0.00013659887],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008973811,0.00022845007,0.00023047875,0.00021886767,0.00012053944,0.0002879711,0.003252923,0.00014038263,0.0008519293],"category_scores_gemma":[0.00003152698,0.00018596646,0.00006181239,0.0016090034,0.00006177184,0.0021045448,0.0008896213,0.0002834973,0.001232328],"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.00009779444,0.00016392476,0.0015012533,0.000021660067,0.000059418584,0.0007363982,0.00069533434,0.0008184621,0.00053630705,0.028304342,0.28098303,0.68608207],"study_design_scores_gemma":[0.00041824637,0.00042109535,0.0009029729,0.00009806536,0.0000053998547,0.00008720924,0.000024416398,0.027420877,0.0450969,0.053352516,0.8715434,0.0006288812],"about_ca_topic_score_codex":0.000025954947,"about_ca_topic_score_gemma":0.0000035071914,"teacher_disagreement_score":0.6854532,"about_ca_system_score_codex":0.00003666132,"about_ca_system_score_gemma":0.00010629096,"threshold_uncertainty_score":0.99954534},"labels":[],"label_agreement":null},{"id":"W2075050074","doi":"10.1504/ijwbc.2005.006065","title":"Towards a formal data management strategy for a web-based community","year":2005,"lang":"en","type":"article","venue":"International Journal of Web Based Communities","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Web application; Process management; Knowledge management; World Wide Web; Business","score_opus":0.09044378607478219,"score_gpt":0.3322232905375959,"score_spread":0.2417795044628137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075050074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09662754,0.00024669815,0.86332744,0.031546883,0.0010121245,0.0003927985,0.00032908932,0.00035590184,0.0061615068],"genre_scores_gemma":[0.79269636,0.000023386825,0.20461346,0.0023739804,0.00014820538,0.000022734737,0.00006116503,0.000013474895,0.00004724445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977473,0.000276853,0.000646426,0.0001246837,0.0008456507,0.00035906097],"domain_scores_gemma":[0.9964548,0.0005765116,0.0003986648,0.001638478,0.0008315605,0.00010001453],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0021399087,0.00022098521,0.00027667146,0.00076322,0.0003005019,0.0004944247,0.013209395,0.000076904886,0.00003261175],"category_scores_gemma":[0.00010010815,0.00020724616,0.00014401483,0.00025171923,0.0001306022,0.001553964,0.0023057791,0.00069705787,0.000009422293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063692615,0.0013587842,0.0006061627,0.00009199202,0.00079616637,0.00010229397,0.0011489069,0.08799091,0.00026371054,0.06864795,0.060157016,0.7781992],"study_design_scores_gemma":[0.004543336,0.00079774077,0.0013055259,0.00039702945,0.00004742745,0.00009424653,0.0021657539,0.77651596,0.0011750531,0.0055847033,0.20695582,0.00041740763],"about_ca_topic_score_codex":0.00010208211,"about_ca_topic_score_gemma":0.0005889043,"teacher_disagreement_score":0.7777818,"about_ca_system_score_codex":0.00025224095,"about_ca_system_score_gemma":0.0004416449,"threshold_uncertainty_score":0.9921296},"labels":[],"label_agreement":null},{"id":"W2075629438","doi":"10.1109/icsmc.2006.384474","title":"Framework for Developing Distributed Systems in a Peer-to-Peer Environment","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Interface (matter); Focus (optics); Peer-to-peer; Distributed computing; Process (computing); Software; Operating system","score_opus":0.023377814003180203,"score_gpt":0.2608950839062131,"score_spread":0.23751726990303287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075629438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010450317,0.0000824467,0.95154184,0.035565764,0.0004195814,0.000927507,0.000024321513,0.0007102086,0.00027801155],"genre_scores_gemma":[0.38082227,0.0000014154921,0.61710775,0.00041458345,0.00008045843,0.00038846952,0.000020709487,0.000014965503,0.0011493895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973905,0.000030646283,0.00045469336,0.0006976851,0.00067974493,0.0007467414],"domain_scores_gemma":[0.9985796,0.0002643673,0.000074639145,0.0008696458,0.00012247123,0.00008928181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066070515,0.00025052435,0.0003089226,0.0002691583,0.000100931655,0.00028051008,0.0015435566,0.0002111636,0.0000034688378],"category_scores_gemma":[0.00034851552,0.00023450839,0.000056341134,0.00095398084,0.000028896653,0.00019132275,0.000735269,0.00019314708,0.00015743863],"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.000010119742,0.00007778031,0.0023985808,0.00002581251,0.000014848902,0.000023407376,0.00015648428,0.042460475,0.0002240414,0.8748453,0.069455095,0.010308023],"study_design_scores_gemma":[0.0007295562,0.0002395197,0.027166901,0.00029942865,0.000008938114,0.000022419523,0.00022871043,0.08700695,0.003945876,0.13107024,0.7478955,0.0013859865],"about_ca_topic_score_codex":0.00025549717,"about_ca_topic_score_gemma":0.00007283345,"teacher_disagreement_score":0.74377507,"about_ca_system_score_codex":0.00045903702,"about_ca_system_score_gemma":0.00005241382,"threshold_uncertainty_score":0.95629746},"labels":[],"label_agreement":null},{"id":"W2077384962","doi":"10.1109/emc.2010.5575761","title":"Uniform and Non-Uniform Zoning for Load Balancing in Virtual Environments","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Load balancing (electrical power); Computer science; Distributed computing; Server; Network Load Balancing Services; Load management; Overlay; Computer network; Operating system; Grid","score_opus":0.007011827977267231,"score_gpt":0.2208321049726608,"score_spread":0.21382027699539355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077384962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38121846,0.00000602557,0.6152929,0.0008297154,0.0002248604,0.00023688629,0.0000011671889,0.00015490189,0.002035095],"genre_scores_gemma":[0.7660266,0.0000044847707,0.23257883,0.0002615385,0.000027148591,0.00003302402,8.7821724e-7,0.000007530277,0.0010599212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.0000036600354,0.00018539428,0.00036487292,0.00019872187,0.00040770127],"domain_scores_gemma":[0.99930066,0.00009604871,0.00004163122,0.00046925453,0.000013058835,0.00007933499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040489394,0.00013807719,0.00014857923,0.00013864579,0.00008549042,0.00010301563,0.0007556619,0.00011552577,0.0000048444517],"category_scores_gemma":[0.00008522714,0.00012447321,0.000022272028,0.00023344952,0.00005015653,0.00043326436,0.00067791983,0.00022484122,0.000025623753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003244967,0.0001493409,0.028226707,0.000026191636,0.00003179586,0.000036374593,0.0024432854,0.0026066978,0.08116255,0.22261468,0.0033830353,0.6592869],"study_design_scores_gemma":[0.002752006,0.0008575229,0.05156994,0.0000941856,0.000009296345,0.000055924535,0.00062399067,0.7819453,0.05255715,0.016670901,0.091573276,0.0012905261],"about_ca_topic_score_codex":0.000050952596,"about_ca_topic_score_gemma":0.00057663507,"teacher_disagreement_score":0.7793386,"about_ca_system_score_codex":0.00007496081,"about_ca_system_score_gemma":0.000035629662,"threshold_uncertainty_score":0.5075871},"labels":[],"label_agreement":null},{"id":"W2077709959","doi":"10.1007/s12083-009-0052-8","title":"CliqueStream: Creating an efficient and resilient transport overlay for peer-to-peer live streaming using a clustered DHT","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Royal Society of Canada","keywords":"Overlay; Computer science; Computer network; Overlay network; Robustness (evolution); Distributed computing; Locality; Exploit; Redundancy (engineering); Fault tolerance; Peer-to-peer; Computer security; Operating system","score_opus":0.026118050683652198,"score_gpt":0.30730839674303867,"score_spread":0.2811903460593865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077709959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2789933,0.00019745647,0.69100815,0.02431661,0.00029244125,0.003271735,0.00010560114,0.0011111967,0.00070352014],"genre_scores_gemma":[0.7190198,0.000009914671,0.27606434,0.0018216997,0.0008118188,0.000725747,0.00008463703,0.00007009774,0.0013920065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936472,0.00009388925,0.0009793416,0.0022229934,0.0015108678,0.0015456879],"domain_scores_gemma":[0.9950232,0.00042997938,0.00027689262,0.0017379589,0.0014201411,0.0011118634],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002014611,0.00076710735,0.0007841074,0.00066611473,0.0013129922,0.0007740696,0.0015802643,0.00032961354,0.0000029788337],"category_scores_gemma":[0.00031156235,0.00081079826,0.000154494,0.0020527826,0.00010882225,0.0003121628,0.00055602053,0.00049136,0.000021094103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023352499,0.00083075155,0.0039640814,0.00009474254,0.00014162985,0.000032534215,0.016565034,0.3323652,0.0039500417,0.015607536,0.016074106,0.6101408],"study_design_scores_gemma":[0.0019559849,0.0022838165,0.02705882,0.0009940171,0.00032184954,0.00017823969,0.0020088824,0.56868565,0.0017910625,0.0046866196,0.3865922,0.0034428483],"about_ca_topic_score_codex":0.00024251152,"about_ca_topic_score_gemma":0.00019472961,"teacher_disagreement_score":0.6066979,"about_ca_system_score_codex":0.00028318507,"about_ca_system_score_gemma":0.0001399438,"threshold_uncertainty_score":0.9999872},"labels":[],"label_agreement":null},{"id":"W2077846458","doi":"10.1145/2002259.2002320","title":"eQoSystem","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.050039945245971856,"score_gpt":0.21140660675745065,"score_spread":0.1613666615114788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077846458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010112779,0.000022024922,0.81762433,0.00094690843,0.00030374402,0.00008754958,1.7237237e-7,0.0020591803,0.1688433],"genre_scores_gemma":[0.68492085,6.29775e-7,0.31286678,0.00034186264,0.000013227734,0.000009639052,4.845629e-8,0.0000026570142,0.0018443221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936795,0.000009641884,0.00009213367,0.0002114815,0.00011755864,0.0002012577],"domain_scores_gemma":[0.99921787,0.000013651475,0.000017436829,0.00066709274,0.000032515876,0.000051444254],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001152373,0.00006349219,0.000071465656,0.000074942305,0.000029952897,0.00003554514,0.0013744301,0.000039695307,0.000028495166],"category_scores_gemma":[0.000020288495,0.00005006336,0.000020711906,0.00035753695,0.0000125071665,0.00017127652,0.0005069984,0.00004826141,0.0010110451],"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.0000012352162,0.000025232623,0.0014843164,0.0000033705348,0.000008188036,0.000026743013,0.0006431851,0.00000451716,0.0002772222,0.85164475,0.046390273,0.09949097],"study_design_scores_gemma":[0.0009885554,0.0011192458,0.06609585,0.00012641399,0.000014607154,0.00027508213,0.0006377116,0.050149452,0.2411998,0.17983948,0.4571113,0.0024424973],"about_ca_topic_score_codex":0.000036867088,"about_ca_topic_score_gemma":0.000018955068,"teacher_disagreement_score":0.6748081,"about_ca_system_score_codex":0.000015357557,"about_ca_system_score_gemma":0.0000104821065,"threshold_uncertainty_score":0.99976677},"labels":[],"label_agreement":null},{"id":"W2077929058","doi":"10.1007/s10922-006-9025-x","title":"Reducing Resource Usage Based on User Hints and Policies","year":2006,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Research Council Canada","keywords":"Computer science; Window (computing); Resource (disambiguation); Architecture; Resource consumption; User requirements document; Multimedia; Video on demand; User experience design; User interface; World Wide Web; Human–computer interaction; Computer network; Operating system; Software engineering","score_opus":0.012464181021066511,"score_gpt":0.22420762149031126,"score_spread":0.21174344046924476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077929058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5116494,0.005478843,0.43946236,0.013765131,0.002315742,0.0010160275,0.0000020612358,0.00036420545,0.025946215],"genre_scores_gemma":[0.9826485,0.0000598095,0.014733612,0.00050335063,0.0005366635,0.0000059999484,2.8801404e-7,0.000011284392,0.0015005294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99840885,0.00010154315,0.00047166235,0.0002407919,0.00043711643,0.00034003446],"domain_scores_gemma":[0.9990488,0.00010610248,0.00031438255,0.00038957412,0.000051126277,0.00009000607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011693116,0.00016175983,0.00029226023,0.0003033321,0.00022917215,0.00031925374,0.0005379055,0.000054657117,5.532104e-7],"category_scores_gemma":[0.000013107552,0.00012744815,0.000045918892,0.00041492062,0.000037317805,0.00016316367,0.00043577887,0.00015997933,0.0000020033515],"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.000043782846,0.0000719508,0.0049933493,0.00012337134,0.00008855847,0.0003407202,0.00025511664,0.64147115,0.00002903961,0.047430683,0.27442732,0.030724982],"study_design_scores_gemma":[0.0012592524,0.0007737804,0.058812104,0.0019507727,0.00006468717,0.00022278156,0.0003291071,0.21290435,0.000025116584,0.0025659832,0.7205379,0.00055416196],"about_ca_topic_score_codex":0.000043847675,"about_ca_topic_score_gemma":0.0000042444694,"teacher_disagreement_score":0.47099906,"about_ca_system_score_codex":0.00006579447,"about_ca_system_score_gemma":0.000008272379,"threshold_uncertainty_score":0.51971847},"labels":[],"label_agreement":null},{"id":"W2078201083","doi":"10.1145/2676585.2676622","title":"Cooperative channel resource sharing in P2P networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Block (permutation group theory); Scheme (mathematics); Shared resource; Computer network; Resource (disambiguation); Distributed computing; Multimedia","score_opus":0.014186201141252568,"score_gpt":0.22967182913679338,"score_spread":0.2154856279955408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078201083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018454062,0.000046537618,0.95455015,0.0036311664,0.00014823455,0.00016206213,1.4646025e-7,0.00090255495,0.022105103],"genre_scores_gemma":[0.97099966,0.0000030092247,0.02495576,0.0017889568,0.00008404235,0.000033179243,9.4389225e-7,0.000010224853,0.0021242378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986013,0.000042410382,0.00019646408,0.0005312196,0.00017167011,0.00045689655],"domain_scores_gemma":[0.9989186,0.00011104625,0.000033997163,0.0008143325,0.00004399282,0.00007805954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353932,0.000147027,0.00018968419,0.00018481382,0.00009486571,0.00011727076,0.0018451241,0.000104637475,0.0000075454936],"category_scores_gemma":[0.00013279253,0.00013014177,0.000025550262,0.0010093449,0.000044243196,0.0002388479,0.0014436257,0.00025521082,0.00007537018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014358846,0.00008759939,0.0054411213,0.0000071804516,0.000018912144,0.00005487042,0.0018638672,0.50287634,0.00010885899,0.37071183,0.04695321,0.07186184],"study_design_scores_gemma":[0.00018797287,0.000084383966,0.0031658001,0.000030190033,7.4112074e-7,0.000007933565,0.000040104456,0.9823461,0.00043207878,0.0032058735,0.010268881,0.00022993574],"about_ca_topic_score_codex":0.00005128985,"about_ca_topic_score_gemma":0.00016905348,"teacher_disagreement_score":0.9525456,"about_ca_system_score_codex":0.000049756385,"about_ca_system_score_gemma":0.00001201346,"threshold_uncertainty_score":0.5307027},"labels":[],"label_agreement":null},{"id":"W2078614414","doi":"10.1007/s10922-014-9316-6","title":"A Game-Theoretic Approach for Dynamic and Adaptive Managers Selection in Service Specific Overlay Networks","year":2014,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","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","keywords":"Computer science; Overlay; Overlay network; Quality of service; Distributed computing; Service provider; Service (business); Computer network; Game theory; Network management; World Wide Web; The Internet","score_opus":0.011040775092231682,"score_gpt":0.21329497819690546,"score_spread":0.2022542031046738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078614414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010223335,0.0018964096,0.98514813,0.00046055982,0.00048790075,0.00072877307,2.996636e-7,0.000061932034,0.0009926787],"genre_scores_gemma":[0.92934245,0.0005543054,0.06943214,0.00020079459,0.00025887007,0.000048274225,8.017222e-7,0.000017100112,0.00014526713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817806,0.00016336494,0.00055326003,0.00037981334,0.00027976243,0.00044575956],"domain_scores_gemma":[0.99902254,0.00014242373,0.0003761942,0.00024512678,0.000106910964,0.0001068075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019761275,0.00021347933,0.00043361337,0.00034100327,0.00009680081,0.0002736742,0.00055859005,0.000097980104,2.3682794e-7],"category_scores_gemma":[0.000007953747,0.00018572407,0.000054242922,0.00085991796,0.00003589602,0.00025151257,0.00029393093,0.00022925733,6.582737e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010374062,0.000043092536,0.00054806296,0.00021859219,0.000118177246,0.00001756386,0.00022785102,0.8303071,0.0000033753124,0.11208125,0.004291421,0.052039716],"study_design_scores_gemma":[0.00069831364,0.00034219743,0.0046407473,0.00031153206,0.000028617866,0.000084702806,0.00028872062,0.9803213,2.6431127e-7,0.004376689,0.008705782,0.00020114896],"about_ca_topic_score_codex":0.000007064506,"about_ca_topic_score_gemma":0.000013264112,"teacher_disagreement_score":0.9191191,"about_ca_system_score_codex":0.00012771347,"about_ca_system_score_gemma":0.000006635064,"threshold_uncertainty_score":0.75736076},"labels":[],"label_agreement":null},{"id":"W2080203737","doi":"10.1109/pacrim.2009.5291287","title":"Peer-to-peer file sharing over wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; File sharing; Distributed computing; Wireless network; Peer-to-peer; Mesh networking; Overlay network; Wireless; Overlay; Order One Network Protocol; Wireless WAN; Shared mesh; The Internet; Wi-Fi array; World Wide Web; Operating system","score_opus":0.01515542386284889,"score_gpt":0.253879782632563,"score_spread":0.2387243587697141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080203737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021209845,0.00003862825,0.89073277,0.047046784,0.0008404886,0.0005106737,0.000015525611,0.0041906587,0.03541461],"genre_scores_gemma":[0.80057865,0.0000052955893,0.13471104,0.010558376,0.00033313784,0.00006120144,0.0000222374,0.000031449,0.053698592],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637187,0.000023496234,0.0003830479,0.0010631047,0.0010995091,0.0010589641],"domain_scores_gemma":[0.9972408,0.00012372984,0.000076572345,0.0018539433,0.0003728124,0.0003321882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059048645,0.0003616827,0.00036540165,0.0003089212,0.00019303297,0.00058749766,0.0038969314,0.00023934976,0.00050580536],"category_scores_gemma":[0.0002427868,0.000334828,0.0001162436,0.0017571651,0.000035905552,0.0006085514,0.0015996835,0.00042624577,0.0005379445],"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.00000526844,0.000044312994,0.00032606762,0.0000016612129,0.000012748903,0.000035750356,0.00017475495,0.0032063604,0.00012588379,0.068042345,0.7928607,0.13516417],"study_design_scores_gemma":[0.00048530442,0.0004389618,0.028444923,0.000103447666,0.000011758849,0.000040143837,0.00006179605,0.6869981,0.0018702627,0.012005809,0.26815262,0.0013868678],"about_ca_topic_score_codex":0.00005984335,"about_ca_topic_score_gemma":0.000059789658,"teacher_disagreement_score":0.7793688,"about_ca_system_score_codex":0.00013045622,"about_ca_system_score_gemma":0.000038588594,"threshold_uncertainty_score":0.99991035},"labels":[],"label_agreement":null},{"id":"W2080354976","doi":"10.1109/emc.2010.5575766","title":"A Quality Control Algorithm Based on Virtual Distance in Games","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Server; Latency (audio); Quality of experience; Architecture; Control (management); Quality (philosophy); Game theory; Task (project management); Distributed computing; Computer network; Artificial intelligence; Quality of service","score_opus":0.009540124845038736,"score_gpt":0.2628297634236902,"score_spread":0.25328963857865144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080354976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019644419,0.000005726283,0.9679089,0.008199244,0.00044284947,0.0002034246,0.000007529345,0.0007548434,0.0028330225],"genre_scores_gemma":[0.8102938,3.3856327e-7,0.18711479,0.0021939687,0.0000308331,0.00004162752,6.787938e-7,0.0000053571425,0.0003186312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984903,0.00006251162,0.00024433207,0.0004810114,0.0003533405,0.00036854198],"domain_scores_gemma":[0.998342,0.00042160644,0.000052224936,0.0010515569,0.0000502173,0.00008241967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006572104,0.00015079434,0.00021519481,0.0001599969,0.00004179138,0.000108293665,0.0013605009,0.0001102314,0.00001838811],"category_scores_gemma":[0.00033885048,0.00012691798,0.000045208388,0.0005724303,0.000076785815,0.00018419864,0.00015614394,0.00037176788,0.00008513293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023407092,0.00019095816,0.0038019007,0.0000025467918,0.0000048545226,0.000032232274,0.0000930924,0.0011049542,0.0012978453,0.2385585,0.0044359313,0.75045377],"study_design_scores_gemma":[0.0013088994,0.00024696096,0.04117373,0.000018688215,0.0000010888643,0.0000020054986,0.00002975747,0.9301798,0.0027069417,0.0072896853,0.016634064,0.00040839578],"about_ca_topic_score_codex":0.000077904726,"about_ca_topic_score_gemma":0.0006443906,"teacher_disagreement_score":0.9290748,"about_ca_system_score_codex":0.00004092068,"about_ca_system_score_gemma":0.000053987307,"threshold_uncertainty_score":0.51755655},"labels":[],"label_agreement":null},{"id":"W2080485692","doi":"10.1145/2678508.2678517","title":"PSBench","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Variety (cybernetics); Benchmark (surveying); Publication; Data science; Artificial intelligence; Business","score_opus":0.006264466055601031,"score_gpt":0.20966472854888457,"score_spread":0.20340026249328355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080485692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062117307,0.000009322362,0.9037322,0.009050678,0.00020251947,0.00004261698,5.7276207e-8,0.001322177,0.079428725],"genre_scores_gemma":[0.6776854,7.3029906e-7,0.3183912,0.0015361091,0.0000335959,0.000006004405,1.1025695e-7,0.0000025279642,0.0023443408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999356,0.000011893214,0.000073064766,0.00021840265,0.00013737268,0.00020329398],"domain_scores_gemma":[0.99918795,0.000044221746,0.0000127372405,0.00067865633,0.000027023354,0.000049439393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016679602,0.000059887738,0.00006662958,0.000070082926,0.000037364975,0.00007535431,0.0012525943,0.000036891597,0.00001640711],"category_scores_gemma":[0.00007550404,0.000048594407,0.00001817798,0.00036110773,0.000015567235,0.00013607417,0.00049507,0.00005706163,0.0007739956],"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":[2.0085616e-7,0.000007809242,0.00039783528,8.224059e-7,0.0000018221581,0.0000012150967,0.00003591637,0.00008091299,0.00028284607,0.62869656,0.078833915,0.29166016],"study_design_scores_gemma":[0.00017538895,0.00018858281,0.009002166,0.000009461363,0.0000015917111,0.000015351769,0.0000115272105,0.123482265,0.013795764,0.1410818,0.71185327,0.00038284273],"about_ca_topic_score_codex":0.000011334163,"about_ca_topic_score_gemma":0.000012974202,"teacher_disagreement_score":0.6714736,"about_ca_system_score_codex":0.000011319506,"about_ca_system_score_gemma":0.0000075689472,"threshold_uncertainty_score":0.99484056},"labels":[],"label_agreement":null},{"id":"W2080541747","doi":"10.1109/wetice.2007.105","title":"A Dominating Set Based Peer-to-Peer Protocol for Real-Time Multi-source Collaboration","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Provisioning; Peer-to-peer; Overlay; Protocol (science); Overlay network; Architecture; Graph; Computer network; Set (abstract data type); Theoretical computer science; The Internet; World Wide Web","score_opus":0.03552573415768297,"score_gpt":0.3558637745260935,"score_spread":0.32033804036841057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080541747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001744699,3.2654447e-7,0.8840246,0.0128585715,0.00009436799,0.09762484,0.0000114612085,0.0019094319,0.0017317057],"genre_scores_gemma":[0.0068508885,1.772668e-8,0.86382276,0.0011312268,0.000094530944,0.11407932,0.000011259253,0.000034229655,0.013975748],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968921,0.000053272113,0.000536331,0.0008064625,0.00090264814,0.00080921187],"domain_scores_gemma":[0.99649495,0.0005190353,0.00017798005,0.0010249199,0.0015499524,0.00023314648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002915982,0.00030606776,0.00029969835,0.00046726764,0.00026385652,0.00042279437,0.0015227676,0.0002075381,0.000023036968],"category_scores_gemma":[0.0017375526,0.00028183818,0.000078064586,0.0021075292,0.000042048217,0.00042740125,0.00046340004,0.00015317509,0.00018962183],"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.00050681253,0.0005728237,0.0010464799,0.00015533454,0.000052876414,0.00004401317,0.0047372137,0.015730217,0.08307823,0.009912992,0.6218826,0.26228037],"study_design_scores_gemma":[0.0031279193,0.0007227105,0.00095644535,0.00010360718,0.00000736883,0.0000065773706,0.00036996795,0.6331012,0.095475115,0.00036023022,0.26500738,0.0007614366],"about_ca_topic_score_codex":0.00006349837,"about_ca_topic_score_gemma":0.00021737661,"teacher_disagreement_score":0.617371,"about_ca_system_score_codex":0.00024367568,"about_ca_system_score_gemma":0.00018125784,"threshold_uncertainty_score":0.9999634},"labels":[],"label_agreement":null},{"id":"W2081552268","doi":"10.1109/iwcmc.2011.5982756","title":"A DHT-based hierarchical overlay for Peer-to-Peer MMOGs over MANETs","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Distributed computing; Overlay network; Scalability; Distributed hash table; Overlay; Wireless ad hoc network; Peer-to-peer; The Internet; World Wide Web; Wireless; Telecommunications","score_opus":0.04028141054414466,"score_gpt":0.27461035005796874,"score_spread":0.23432893951382408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081552268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027510995,0.000017971553,0.9232169,0.029146861,0.0008165789,0.0009881231,0.000023009981,0.0022093377,0.016070243],"genre_scores_gemma":[0.4048232,4.5372812e-7,0.57681173,0.0074808216,0.00011066676,0.00023980213,0.0000078133535,0.00003526042,0.010490225],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647963,0.000043509444,0.0003950503,0.001022396,0.0010415547,0.0010178374],"domain_scores_gemma":[0.9971948,0.00027453873,0.000074116084,0.0016758443,0.00039264603,0.00038800875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007426902,0.00036879446,0.00036919347,0.00043934424,0.00015436001,0.00020356901,0.002948591,0.00024656614,0.00018517957],"category_scores_gemma":[0.00052421185,0.0003201358,0.00018104144,0.00090109074,0.00009478699,0.00033505412,0.0009268151,0.00030141906,0.00049831514],"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.00013682412,0.00030719436,0.001293929,0.000024701054,0.00005314235,0.00006796106,0.000882144,0.00026111427,0.000984653,0.22870143,0.6954389,0.071848005],"study_design_scores_gemma":[0.002060146,0.0018930618,0.026702143,0.00006697268,0.000029145505,0.000031259286,0.000044304245,0.08351448,0.029496668,0.039691668,0.8148379,0.0016322489],"about_ca_topic_score_codex":0.00011738414,"about_ca_topic_score_gemma":0.000108399356,"teacher_disagreement_score":0.37731224,"about_ca_system_score_codex":0.000104998544,"about_ca_system_score_gemma":0.00012793369,"threshold_uncertainty_score":0.9999251},"labels":[],"label_agreement":null},{"id":"W2081605040","doi":"10.4236/ijcns.2012.512084","title":"A Scalable and Robust DHT Protocol for Structured P2P Network","year":2012,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Distributed hash table; Computer science; Latency (audio); Computer network; Hash table; Scalability; Liveness; Routing protocol; Routing table; Distributed computing; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Lookup table; Peer-to-peer; Dynamic Source Routing; Routing (electronic design automation); Hash function; Computer security; Operating system","score_opus":0.06644405462662982,"score_gpt":0.34436077077511823,"score_spread":0.2779167161484884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081605040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005232208,0.00397036,0.9354361,0.021266079,0.0029693672,0.025457086,0.000009685379,0.00026036025,0.0053987233],"genre_scores_gemma":[0.52349675,0.000039739316,0.47160253,0.00018967081,0.00067949883,0.003945902,6.8111564e-7,0.000006205832,0.000039038394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982832,0.000145219,0.0005569124,0.00017154645,0.00047500676,0.00036811442],"domain_scores_gemma":[0.9978239,0.00052093895,0.0005060363,0.0005190216,0.0004787893,0.00015134219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025385285,0.00013397964,0.00023871771,0.00018140861,0.0005561068,0.00050029886,0.0036784823,0.00006724529,0.0000016191623],"category_scores_gemma":[0.00010163829,0.00010249171,0.000057456542,0.0005533178,0.00028548887,0.0009378407,0.0010864349,0.00016745101,0.0000014295164],"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.000069089045,0.000094558105,0.03905994,0.000043535172,0.000168145,0.0000027306808,0.00083017914,0.041970346,0.00003682317,0.81144017,0.03476659,0.07151789],"study_design_scores_gemma":[0.003046003,0.0010723047,0.035238773,0.0025197107,0.000069062866,0.002467346,0.0016178832,0.43108055,0.00010977796,0.05012968,0.4716026,0.0010463133],"about_ca_topic_score_codex":0.00000793467,"about_ca_topic_score_gemma":0.000020759315,"teacher_disagreement_score":0.7613105,"about_ca_system_score_codex":0.00006707307,"about_ca_system_score_gemma":0.00009787043,"threshold_uncertainty_score":0.68355966},"labels":[],"label_agreement":null},{"id":"W2081918782","doi":"10.5555/1400549.1400709","title":"Simulating a file sharing system based on BitTorrent","year":2008,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"BitTorrent; Computer science; File sharing; BitTorrent tracker; The Internet; Protocol (science); Computer network; Internet traffic; Peer-to-peer; Torrent file; World Wide Web; Operating system; Device file; Computer file","score_opus":0.05246489183112127,"score_gpt":0.2758144007743804,"score_spread":0.22334950894325914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081918782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26551834,0.000007765041,0.7309149,0.0001176026,0.0002978635,0.00034598014,0.000007689607,0.0019378101,0.00085204135],"genre_scores_gemma":[0.9080887,3.6201897e-7,0.09159785,0.00012529189,0.00006027364,0.000042349984,0.000004766852,0.000019839821,0.00006056022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977373,0.00004759687,0.00041283522,0.00076552597,0.00054594496,0.00049079],"domain_scores_gemma":[0.9974846,0.0007665157,0.00016457209,0.0012435726,0.00019564874,0.00014509105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023252168,0.0002713446,0.00026170016,0.00036259403,0.00038456466,0.00017541366,0.0013018716,0.0001155695,0.000032105338],"category_scores_gemma":[0.0006166776,0.00027702717,0.00007770506,0.00064373657,0.000043694206,0.00033154743,0.0004942387,0.00026755824,0.00024876636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064784026,0.0000318169,0.010813218,0.000022188056,0.0000046061473,0.000020345058,0.00020682129,0.9760235,0.0001795829,0.0041942634,0.00002440428,0.008472775],"study_design_scores_gemma":[0.00033636126,0.000059511865,0.03626266,0.0003109684,0.0000027639535,0.0000018152565,0.000019845755,0.9615352,0.0007191496,0.000047307556,0.00040298715,0.00030139415],"about_ca_topic_score_codex":0.00008398465,"about_ca_topic_score_gemma":0.0000072674006,"teacher_disagreement_score":0.6425704,"about_ca_system_score_codex":0.00024390404,"about_ca_system_score_gemma":0.00007899183,"threshold_uncertainty_score":0.9999682},"labels":[],"label_agreement":null},{"id":"W2082253563","doi":"10.1145/1230040.1230080","title":"Applying database replication to multi-player online games","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Replication (statistics); Scalability; Replica; Distributed computing; Fault tolerance; Distributed database; Consistency (knowledge bases); Database; Computer network; Artificial intelligence","score_opus":0.036086463105345405,"score_gpt":0.2979042050350595,"score_spread":0.2618177419297141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082253563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027435867,0.000044542543,0.96191055,0.007424154,0.00010898534,0.0005176826,0.000011436708,0.00163517,0.0009116179],"genre_scores_gemma":[0.19685556,0.000002305281,0.7989212,0.0017193905,0.00007024841,0.00019853635,0.00002879747,0.0000089279765,0.0021950365],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855095,0.000014269638,0.0002183099,0.0006821757,0.00022454074,0.0003097549],"domain_scores_gemma":[0.9977314,0.000049449158,0.00004483155,0.0020263302,0.0000750071,0.0000730167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022241358,0.00012983337,0.00011987196,0.00018799095,0.000074001866,0.000112073685,0.0013200347,0.000052760555,0.0000076281385],"category_scores_gemma":[0.00012243997,0.00011687403,0.000025669566,0.0008055741,0.000016322118,0.00030854993,0.00087793154,0.00010115611,0.0002716081],"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.0000069863345,0.0003650345,0.0028733471,0.000011763416,0.000010991552,0.000023606273,0.00010815402,0.0045734853,0.06509817,0.06342405,0.21501768,0.64848673],"study_design_scores_gemma":[0.00063967047,0.00013375863,0.028652277,0.000070906965,0.000009269628,0.00003700213,0.0001103497,0.3269652,0.11730009,0.0028738189,0.5221944,0.0010132695],"about_ca_topic_score_codex":0.0003214451,"about_ca_topic_score_gemma":0.00043537037,"teacher_disagreement_score":0.64747345,"about_ca_system_score_codex":0.000050682964,"about_ca_system_score_gemma":0.000019602627,"threshold_uncertainty_score":0.47659844},"labels":[],"label_agreement":null},{"id":"W2082607696","doi":"10.1504/ijista.2007.014263","title":"Adaptive peer-to-peer streaming over hybrid wireless networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Intelligent Systems Technologies and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Handover; Wireless network; Wireless; Network packet; Scheme (mathematics); Peer-to-peer; Throughput; Live streaming; Telecommunications","score_opus":0.01567608283512919,"score_gpt":0.28061086305974564,"score_spread":0.2649347802246165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082607696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025775617,0.00076240045,0.96429044,0.006840762,0.00091114204,0.00050812087,0.000015806781,0.0005381936,0.0003575312],"genre_scores_gemma":[0.97196656,0.00021267917,0.026921345,0.00016813037,0.00031574766,0.000082731654,0.000003388466,0.00001819486,0.00031122897],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970999,0.000019367633,0.00092818803,0.00042555897,0.001103505,0.00042349694],"domain_scores_gemma":[0.99646026,0.00029986445,0.00055220793,0.000589796,0.0019512118,0.00014666232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011780725,0.00025919982,0.00034750122,0.00096645195,0.00013826977,0.00036693498,0.0032296095,0.00017482188,0.000001991359],"category_scores_gemma":[0.00027340042,0.0002251961,0.0001124695,0.0007577348,0.00012366674,0.00033889833,0.0010243647,0.0004917501,0.000021174708],"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.00004018858,0.00012828651,0.0012092256,0.000007270681,0.00023777017,0.00009566159,0.00016079635,0.009206389,0.000702926,0.17311133,0.0116779255,0.8034222],"study_design_scores_gemma":[0.0008759952,0.0011064442,0.0042138267,0.0010085066,0.000076183846,0.0025234474,0.01176534,0.07138835,0.03849126,0.02382804,0.843066,0.0016566112],"about_ca_topic_score_codex":0.000044016208,"about_ca_topic_score_gemma":0.000022283086,"teacher_disagreement_score":0.94619095,"about_ca_system_score_codex":0.00030643068,"about_ca_system_score_gemma":0.000048837574,"threshold_uncertainty_score":0.91832304},"labels":[],"label_agreement":null},{"id":"W2083644394","doi":"10.1109/ccgrid.2005.1558564","title":"A secure trust and incentive management framework for public-resource based computing utilities","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba","funders":"","keywords":"Incentive; Computational trust; Computer science; Trust management (information system); Resource (disambiguation); Process (computing); Computer security; Shared resource; Autonomy; Trust anchor; Computer network; Microeconomics","score_opus":0.02147544829672147,"score_gpt":0.25814590739233506,"score_spread":0.2366704590956136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083644394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009803793,0.00010446359,0.95887107,0.024530007,0.000087638255,0.00051105063,0.000004232181,0.0010658586,0.005021884],"genre_scores_gemma":[0.4627527,0.0000018261211,0.5345913,0.0022274945,0.000051450665,0.000029270235,0.0000016138615,0.0000072760577,0.00033704995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984396,0.00002866244,0.00021243398,0.00054171734,0.00024958636,0.00052801927],"domain_scores_gemma":[0.9988483,0.00031053947,0.000064971304,0.000601203,0.00007045277,0.000104512765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032925792,0.00018831453,0.00018501816,0.00021976886,0.00022589834,0.00041098156,0.0010936293,0.00011147088,0.000011112225],"category_scores_gemma":[0.000094620955,0.00017330212,0.00005163422,0.0005291969,0.00008530136,0.0002771966,0.0010158565,0.00016438606,0.000011857228],"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.000006118878,0.000036127753,0.0004811274,0.000025818686,0.000024236697,0.0000025314193,0.00044820967,0.00032923263,0.0000014631711,0.7122829,0.00971217,0.27665007],"study_design_scores_gemma":[0.0005016743,0.00010984451,0.0014941873,0.00008663604,0.000009159967,0.000002406424,0.0010817607,0.6438175,0.00041118643,0.031207625,0.32090166,0.00037640732],"about_ca_topic_score_codex":0.0000037668224,"about_ca_topic_score_gemma":0.000013743042,"teacher_disagreement_score":0.6810753,"about_ca_system_score_codex":0.00007554814,"about_ca_system_score_gemma":0.000017920138,"threshold_uncertainty_score":0.7067056},"labels":[],"label_agreement":null},{"id":"W2084270914","doi":"10.1109/ipdpsw.2010.5470791","title":"A design aid and real-time measurement framework for Virtual collaborative simulation Environment","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Control reconfiguration; Virtual reality; Virtual machine; Real-time simulation; Distributed computing; Reuse; Measure (data warehouse); Simulation; Human–computer interaction; Embedded system; Operating system","score_opus":0.028278471118275757,"score_gpt":0.2603393097606056,"score_spread":0.23206083864232985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084270914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075770677,0.000014354539,0.9886687,0.0021911736,0.00014326285,0.0008402166,0.000002282727,0.00038978647,0.00017318055],"genre_scores_gemma":[0.3572219,0.000005910203,0.6424285,0.00012231922,0.0000299683,0.0000940515,5.1833746e-7,0.000007004442,0.00008979192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987227,0.000040042523,0.00017088471,0.0004268912,0.00038115965,0.00025832272],"domain_scores_gemma":[0.9987775,0.00043387644,0.00006482901,0.00052252365,0.000114196686,0.00008705039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006749559,0.00014955552,0.00015033588,0.00008303242,0.00012900929,0.00013028906,0.00045926022,0.0001471401,0.000016799451],"category_scores_gemma":[0.00030815357,0.00013169709,0.000019452653,0.00024547006,0.000058660273,0.0002175727,0.00025508075,0.0001265371,0.0000516667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016348943,0.00023610974,0.00020846,0.000010408765,0.00010952286,0.000006182715,0.0025902144,0.15038815,0.16723011,0.4162944,0.008786036,0.2539769],"study_design_scores_gemma":[0.00065161916,0.0012044345,0.0010444854,0.000026203945,0.000016669705,0.0000020789682,0.000088082066,0.8526873,0.03912098,0.09227549,0.012348684,0.00053399295],"about_ca_topic_score_codex":0.0000039957886,"about_ca_topic_score_gemma":0.0000052020164,"teacher_disagreement_score":0.7022991,"about_ca_system_score_codex":0.00006815964,"about_ca_system_score_gemma":0.00005064662,"threshold_uncertainty_score":0.5370451},"labels":[],"label_agreement":null},{"id":"W2084450010","doi":"10.1049/iet-ifs.2014.0337","title":"Hijacking the Vuze BitTorrent network: all your hop are belong to us","year":2014,"lang":"en","type":"article","venue":"IET Information Security","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Stillwater (Canada)","funders":"","keywords":"BitTorrent; Computer science; Computer network; Set (abstract data type); File sharing; Theoretical computer science; Computer security; Information retrieval; Peer-to-peer; World Wide Web; The Internet","score_opus":0.018611614816251537,"score_gpt":0.25277974296869793,"score_spread":0.2341681281524464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084450010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17092682,0.00006938436,0.78903925,0.031034244,0.002165112,0.0007622863,0.000011648243,0.0016763539,0.0043149004],"genre_scores_gemma":[0.9802959,0.0000100701,0.010582857,0.008753701,0.00025483363,0.000062084684,0.000011228066,0.000006950588,0.000022391347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981066,0.00007203969,0.00045132026,0.00022659163,0.00056289014,0.00058055844],"domain_scores_gemma":[0.9981953,0.00012031653,0.0002576547,0.0010618375,0.00021848358,0.00014643162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093859225,0.00020822573,0.00020144826,0.000156893,0.0002932311,0.0005894129,0.0019519369,0.00012289116,0.000006095474],"category_scores_gemma":[0.00029289728,0.00016194237,0.00007103714,0.0009363435,0.00003565215,0.0016752108,0.0011831134,0.0003266912,0.00058031],"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.000025685884,0.000057656773,0.009094306,0.0000610232,0.00006288216,0.0000047966305,0.025523413,0.06640469,0.000014208595,0.1437608,0.3615576,0.39343292],"study_design_scores_gemma":[0.00021423005,0.00008479529,0.020924678,0.00005385134,0.000006389658,0.000017432798,0.00022582104,0.15400733,0.00018948363,0.0063977074,0.8175228,0.00035547337],"about_ca_topic_score_codex":0.000058331774,"about_ca_topic_score_gemma":0.00009034721,"teacher_disagreement_score":0.809369,"about_ca_system_score_codex":0.000107252374,"about_ca_system_score_gemma":0.00003137226,"threshold_uncertainty_score":0.74589044},"labels":[],"label_agreement":null},{"id":"W2084970449","doi":"10.1145/2663165.2663337","title":"Publish/subscribe network designs for multiplayer games","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Computer science; Scalability; Middleware (distributed applications); Latency (audio); Semantics (computer science); Distributed computing; World Wide Web; Multimedia; Operating system; Programming language; Telecommunications","score_opus":0.03557567991276311,"score_gpt":0.2564647351809568,"score_spread":0.2208890552681937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084970449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014792625,0.000047067497,0.97736806,0.011426732,0.00078708463,0.00043577226,0.0000011491962,0.0020340828,0.006420763],"genre_scores_gemma":[0.299955,0.0000018452042,0.694014,0.0027538114,0.00027968173,0.000098515666,0.000002329244,0.000016768043,0.002878014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99806446,0.000049063467,0.0002500912,0.00060682074,0.00025697233,0.00077261095],"domain_scores_gemma":[0.99797523,0.0005021098,0.00006690506,0.0011306759,0.00017607695,0.00014900455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157142,0.00020734576,0.00023964854,0.00013104916,0.0001578161,0.00048765528,0.0022895634,0.00014541043,0.00001535688],"category_scores_gemma":[0.0005419902,0.00017521698,0.000093223534,0.000705159,0.00004438933,0.0006410581,0.00067301624,0.00013367619,0.00014297741],"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.000005598213,0.000023344728,0.00071353756,0.0000048145316,0.000015252748,0.0000010445946,0.00008221431,0.0029621646,0.00017347002,0.23544587,0.6301752,0.13039748],"study_design_scores_gemma":[0.0005073319,0.00022187947,0.001407238,0.00002263456,0.000007595974,0.000006430528,0.000025576735,0.3442151,0.0032626018,0.065111674,0.5846866,0.00052534207],"about_ca_topic_score_codex":0.000014246971,"about_ca_topic_score_gemma":0.00008345609,"teacher_disagreement_score":0.34125295,"about_ca_system_score_codex":0.000035551682,"about_ca_system_score_gemma":0.000031342537,"threshold_uncertainty_score":0.71451414},"labels":[],"label_agreement":null},{"id":"W2085356565","doi":"10.1145/1671954.1671955","title":"Server selection in large-scale video-on-demand systems","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Upload; Server farm; Computer network; Video server; Selection (genetic algorithm); The Internet; Selection algorithm; Server; Internet video; Context (archaeology); Client–server model; Operating system","score_opus":0.01540457074696431,"score_gpt":0.2747916544071967,"score_spread":0.2593870836602324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085356565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03447497,0.00008955887,0.9572335,0.005809124,0.00018018665,0.0010490948,0.000020529518,0.00077583885,0.00036720998],"genre_scores_gemma":[0.74164957,0.00009478047,0.25735387,0.0002081347,0.00004332478,0.00056048436,0.000010319327,0.000017343877,0.00006216312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982137,0.00011428798,0.00044870444,0.00059514126,0.00023025424,0.00039789744],"domain_scores_gemma":[0.995493,0.0010042223,0.00012160392,0.003075975,0.00014852556,0.00015666845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005963405,0.0002357735,0.0002425461,0.00051860756,0.0009395283,0.00020866065,0.0027555658,0.0001923839,0.000004069119],"category_scores_gemma":[0.000055193475,0.00024950452,0.00006040393,0.001606325,0.00013574027,0.000225096,0.0002337295,0.0010290868,0.0000823684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021559223,0.0030163163,0.0048933774,0.000059255563,0.00010352611,0.0000016523775,0.0037604345,0.048626542,0.009726931,0.067135744,0.00073013484,0.8619245],"study_design_scores_gemma":[0.0007596759,0.00011817136,0.011889196,0.00008900086,0.000019717805,0.000028077422,0.00029462707,0.94399697,0.0007662529,0.0023200905,0.039219327,0.00049891486],"about_ca_topic_score_codex":0.0001295628,"about_ca_topic_score_gemma":0.00096893194,"teacher_disagreement_score":0.8953704,"about_ca_system_score_codex":0.00006810038,"about_ca_system_score_gemma":0.000052974956,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W2086071537","doi":"10.1109/wimob.2010.5645002","title":"A framework toward a self-organizing and self-healing certificate authority group in a Content Addressable Network","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Certificate authority; Collusion; Certificate; Computer security; Public key certificate; Public-key cryptography; Node (physics); Key (lock); The Internet; Bootstrapping (finance); Man-in-the-middle attack; Computer network; Public key infrastructure; Group (periodic table); World Wide Web; Business; Theoretical computer science; Engineering; Encryption","score_opus":0.08329711805905171,"score_gpt":0.2777422618305311,"score_spread":0.19444514377147937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086071537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4292806,0.0005234037,0.5464268,0.014533169,0.0016147433,0.00091074273,0.0000019584447,0.005715216,0.000993405],"genre_scores_gemma":[0.5459142,0.000025563602,0.45341104,0.00045281113,0.00011086512,0.000041682248,5.7992884e-7,0.000014881117,0.000028390405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971973,0.00008241281,0.00046884993,0.0009219672,0.00034704822,0.0009824223],"domain_scores_gemma":[0.9981515,0.00032249175,0.00011257937,0.0010569829,0.000105064166,0.00025139627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012252801,0.0003025256,0.00040855657,0.00019897906,0.00021976863,0.00047054037,0.0015123014,0.00040401335,0.0000131454535],"category_scores_gemma":[0.0003008481,0.00027973746,0.000050511597,0.0016209641,0.00005989141,0.0004602161,0.0014156625,0.0011739766,0.00004388533],"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.00004145147,0.0007761526,0.10628691,0.00014778959,0.0001576227,0.0001967592,0.008561001,0.000669096,0.006454635,0.8199399,0.008746508,0.048022185],"study_design_scores_gemma":[0.0021836697,0.000787566,0.17088199,0.0006789864,0.00008757244,0.00028220753,0.0011293526,0.49580514,0.006997326,0.26016095,0.05740162,0.0036036083],"about_ca_topic_score_codex":0.00028513678,"about_ca_topic_score_gemma":0.0004871382,"teacher_disagreement_score":0.5597789,"about_ca_system_score_codex":0.000088863606,"about_ca_system_score_gemma":0.000059383732,"threshold_uncertainty_score":0.9999655},"labels":[],"label_agreement":null},{"id":"W2086303636","doi":"10.1145/1517494.1517496","title":"A peer auditing scheme for cheat elimination in MMOGs","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Audit; Scheme (mathematics); Computer science; Computer security; Business; Accounting; Mathematics","score_opus":0.03735863165576908,"score_gpt":0.2723260982447497,"score_spread":0.2349674665889806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086303636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13333063,0.000026571977,0.829882,0.031180931,0.0001471789,0.00029301416,7.802367e-7,0.00073604146,0.004402828],"genre_scores_gemma":[0.5959504,0.0000024528429,0.3991933,0.00040757126,0.000035406007,0.00007094234,0.0000015962705,0.0000051551815,0.004333143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989223,0.000009042677,0.00017020927,0.00031007855,0.00027586785,0.00031250133],"domain_scores_gemma":[0.9993008,0.000106041334,0.00003576573,0.0003469232,0.00017397605,0.00003649686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003481188,0.00009394167,0.00011494945,0.00020703096,0.00008471852,0.0000567472,0.00067375234,0.000073858384,0.0000038263825],"category_scores_gemma":[0.0005154188,0.000089690126,0.00003314287,0.0006077223,0.000026014142,0.0004958688,0.00026000562,0.00009181006,0.00003544019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020225521,0.00021777928,0.01018994,0.00004065473,0.000020125339,0.000073821815,0.0032794478,0.0011108364,0.0090608895,0.45540267,0.23977445,0.28080916],"study_design_scores_gemma":[0.0020628849,0.00047304944,0.073563665,0.00010631872,0.000004635871,0.00013436767,0.00035546673,0.6919644,0.08043047,0.02882969,0.12089174,0.0011833146],"about_ca_topic_score_codex":0.000021536083,"about_ca_topic_score_gemma":0.000040629166,"teacher_disagreement_score":0.69085354,"about_ca_system_score_codex":0.00008203044,"about_ca_system_score_gemma":0.00003369005,"threshold_uncertainty_score":0.3657457},"labels":[],"label_agreement":null},{"id":"W2086956374","doi":"10.1109/have.2010.5623987","title":"Load balancing model for mobile peer-to-peer networks-based 3D streaming","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Load balancing (electrical power); Peer-to-peer; Computer network; Mobile device; Distributed computing; Bandwidth (computing); Overhead (engineering); Mobile computing; Load management; Load distribution; World Wide Web; Operating system","score_opus":0.01359605435549074,"score_gpt":0.26434855903065496,"score_spread":0.25075250467516425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086956374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03224693,0.000023302919,0.9556641,0.006118219,0.0009788644,0.0010381362,0.0000121037265,0.0020775339,0.0018408324],"genre_scores_gemma":[0.497336,4.649698e-7,0.4964991,0.0014804435,0.00014183724,0.0003539961,0.0000061529604,0.000028119508,0.0041538966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965311,0.000017520171,0.00041119827,0.0009935303,0.0009474211,0.0010992029],"domain_scores_gemma":[0.9966052,0.000324613,0.00009848081,0.0017439828,0.0009080818,0.0003196397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001165823,0.0003788518,0.00037137466,0.00026048804,0.0002632479,0.00040497468,0.002603247,0.0002886189,0.00001847816],"category_scores_gemma":[0.0005671381,0.00035089484,0.00013772052,0.0009035695,0.000056705696,0.00041464422,0.0008074793,0.00048406707,0.00008413552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014790087,0.000070137394,0.00035079417,0.000010791124,0.000014890793,0.000006033339,0.00023620517,0.81787175,0.0029415695,0.0068681417,0.051067073,0.1205478],"study_design_scores_gemma":[0.00037207457,0.00015713074,0.00011243871,0.000022367429,0.000008299396,0.0000042032607,0.000026575177,0.96868616,0.0030468807,0.001128472,0.02596155,0.00047387418],"about_ca_topic_score_codex":0.000066530825,"about_ca_topic_score_gemma":0.000626598,"teacher_disagreement_score":0.46508905,"about_ca_system_score_codex":0.00014180338,"about_ca_system_score_gemma":0.00025558114,"threshold_uncertainty_score":0.9998943},"labels":[],"label_agreement":null},{"id":"W2087292805","doi":"10.1145/1878537.1878654","title":"Peer-to-peer delivery system for short video sharing","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scalability; The Internet; Multimedia; Peer-to-peer; Internet traffic; Video streaming; World Wide Web; Computer network; Database","score_opus":0.02228085603669359,"score_gpt":0.26295292085834887,"score_spread":0.2406720648216553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087292805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1609253,0.00001557167,0.8046412,0.017132878,0.0024617927,0.00088528433,0.000009731694,0.003748791,0.010179453],"genre_scores_gemma":[0.6752998,2.9796075e-7,0.31504264,0.00063294603,0.00019171165,0.00019593118,0.0000029515802,0.000023000419,0.0086107],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99705213,0.000010349164,0.00037000378,0.00096295885,0.00083062385,0.00077391416],"domain_scores_gemma":[0.9968498,0.00016382949,0.000043369262,0.001815174,0.00085281685,0.00027505064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011666159,0.00027623784,0.0003102181,0.00034360003,0.00021139218,0.0004914574,0.0038241216,0.00021876533,0.000011481441],"category_scores_gemma":[0.0004802333,0.00024944582,0.0001229832,0.00076035346,0.00003600915,0.0004996329,0.0019209171,0.00033210078,0.00036940377],"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.000028704226,0.000079177655,0.00457247,0.00008981631,0.0000832563,0.00005298892,0.0006430075,0.0010886795,0.03203618,0.3514398,0.35571358,0.25417233],"study_design_scores_gemma":[0.00063196616,0.000463715,0.005751688,0.00014887852,0.000038877948,0.00017126916,0.00046015138,0.22645356,0.10697151,0.0047329166,0.65232766,0.0018478185],"about_ca_topic_score_codex":0.00007540553,"about_ca_topic_score_gemma":0.00027131234,"teacher_disagreement_score":0.5143745,"about_ca_system_score_codex":0.000106446656,"about_ca_system_score_gemma":0.000056450903,"threshold_uncertainty_score":0.99999577},"labels":[],"label_agreement":null},{"id":"W2088756844","doi":"10.1007/s00530-012-0275-z","title":"Interest modeling in games: the case of dead reckoning","year":2012,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Peer-to-Peer Network Technologies","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":"McGill University","funders":"","keywords":"Computer science; Dead reckoning; Quake (natural phenomenon); Upload; Inertia; Artificial intelligence; Simulation; Human–computer interaction; World Wide Web; Telecommunications","score_opus":0.08767808642116706,"score_gpt":0.2902838422597908,"score_spread":0.20260575583862375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088756844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71980625,0.0015276875,0.27568275,0.0004385562,0.0015904326,0.0004231181,0.0000023407163,0.0002664029,0.00026242182],"genre_scores_gemma":[0.9592959,0.0000053356152,0.040424068,0.000027417711,0.00012749877,0.000075683536,5.5472213e-7,0.0000108073955,0.000032695185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862516,0.00012224328,0.00041400455,0.00023719952,0.00014895643,0.00045240924],"domain_scores_gemma":[0.9986174,0.00030984965,0.00011188488,0.0008141603,0.00006476038,0.00008192692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011212722,0.00014080356,0.00024229991,0.00020612335,0.000051220966,0.000065542205,0.0010499303,0.00009960603,6.5401747e-7],"category_scores_gemma":[0.00032559468,0.000099345205,0.000040272316,0.00057105324,0.00004342383,0.0003195942,0.0004934955,0.00022751195,0.00004247837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027305072,0.0003472305,0.024931747,0.00030227518,0.00011807842,0.0010446868,0.064119026,0.10007379,0.005027911,0.016215768,0.0031860636,0.7846061],"study_design_scores_gemma":[0.00013271536,0.000019211839,0.00009385579,0.00018136817,0.0000027552744,0.0003044944,0.0015309008,0.99680895,0.00036874216,0.000047566766,0.0003917781,0.0001176554],"about_ca_topic_score_codex":0.0013991277,"about_ca_topic_score_gemma":0.0003518654,"teacher_disagreement_score":0.8967352,"about_ca_system_score_codex":0.000083452134,"about_ca_system_score_gemma":0.00002317794,"threshold_uncertainty_score":0.405118},"labels":[],"label_agreement":null},{"id":"W2088863122","doi":"10.1145/2107596.2107599","title":"When multi-touch meets streaming","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Testbed; Gesture; Mobile device; Session (web analytics); Multimedia; Human–computer interaction; Cloud computing; Computer network; World Wide Web; Artificial intelligence; Operating system","score_opus":0.06186052839953388,"score_gpt":0.249977385449075,"score_spread":0.18811685704954112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088863122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022414023,0.00005596524,0.940873,0.0020612653,0.00033101844,0.00016897052,6.9335846e-7,0.0024468387,0.031648185],"genre_scores_gemma":[0.4506383,0.000002059507,0.54746807,0.00028903136,0.0000132051955,0.000011502785,2.0047908e-7,0.0000053944236,0.0015722634],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887246,0.000016705726,0.00015357416,0.0003989053,0.0001864007,0.00037196017],"domain_scores_gemma":[0.99888855,0.000032315365,0.00003581602,0.000898678,0.000054963002,0.00008966803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012486051,0.00013184788,0.00012553151,0.00013932341,0.000066723806,0.000070249385,0.00185847,0.00007847326,0.000060047325],"category_scores_gemma":[0.00005607587,0.00011167776,0.000036642752,0.00030467653,0.000034732864,0.00034553488,0.00096953614,0.00010503847,0.00041482504],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050197823,0.00023083188,0.0067816144,0.000008775316,0.000047486472,0.00011579563,0.005184656,0.000047680263,0.0021314453,0.18488964,0.045195267,0.7553618],"study_design_scores_gemma":[0.0024519863,0.0010819453,0.10165221,0.00018519946,0.000038233837,0.00014995303,0.0011975061,0.27725127,0.33015072,0.097326085,0.1849064,0.003608472],"about_ca_topic_score_codex":0.00021904876,"about_ca_topic_score_gemma":0.0001772082,"teacher_disagreement_score":0.75175333,"about_ca_system_score_codex":0.000031317948,"about_ca_system_score_gemma":0.000020307061,"threshold_uncertainty_score":0.5331875},"labels":[],"label_agreement":null},{"id":"W2089762145","doi":"10.1145/2678508.2678518","title":"A publish/subscribe network engine testbed for multiplayer games","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Testbed; Computer science; Middleware (distributed applications); Scalability; Computer network; Server; Latency (audio); Load balancing (electrical power); Distributed computing; Operating system; Telecommunications","score_opus":0.012399604691234158,"score_gpt":0.22620208990709997,"score_spread":0.2138024852158658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089762145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026885448,0.00006253669,0.97390974,0.015284307,0.00075338717,0.00044497283,0.0000017698419,0.0025422485,0.004312473],"genre_scores_gemma":[0.35012838,0.0000014473381,0.6449198,0.0022036377,0.00032139994,0.00010885645,0.000003688882,0.000018132221,0.0022946517],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809,0.00003298635,0.000270064,0.00060902117,0.00025980006,0.0007381167],"domain_scores_gemma":[0.9978732,0.00054828153,0.000066832625,0.001159936,0.00019723244,0.00015453198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007112645,0.00022584907,0.00026652656,0.00015620522,0.00011933039,0.00041188064,0.0020791155,0.00014213359,0.000014111976],"category_scores_gemma":[0.00091852143,0.00019124443,0.00009280946,0.0008855693,0.000038312006,0.00057464425,0.00070138165,0.00015308887,0.000110963505],"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.000007374321,0.00004095657,0.0008866321,0.00000880226,0.000022964701,0.0000018145789,0.00008272412,0.005238198,0.00021333677,0.14934714,0.6252838,0.21886626],"study_design_scores_gemma":[0.0005880493,0.00018776667,0.0013821672,0.000024181587,0.0000068031145,0.000007227361,0.000015600477,0.5082592,0.0022158837,0.026859311,0.46000364,0.0004501971],"about_ca_topic_score_codex":0.00001466274,"about_ca_topic_score_gemma":0.00006883525,"teacher_disagreement_score":0.50302094,"about_ca_system_score_codex":0.000034011886,"about_ca_system_score_gemma":0.000028850112,"threshold_uncertainty_score":0.7798722},"labels":[],"label_agreement":null},{"id":"W2089975859","doi":"10.1145/643550.643552","title":"Using publish/subscribe middleware for mobile systems","year":2002,"lang":"en","type":"article","venue":"ACM SIGMOBILE Mobile Computing and Communications Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Middleware (distributed applications); Publication; Implementation; Mobile computing; Message oriented middleware; Computer network; Distributed computing; Software; Software engineering; Operating system; Software architecture","score_opus":0.13790127389464568,"score_gpt":0.3515278876058448,"score_spread":0.21362661371119912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089975859","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040093362,0.75131696,0.23314367,0.0031720756,0.00048427554,0.0056856438,0.00002596147,0.001546931,0.00061515195],"genre_scores_gemma":[0.48502862,0.097792596,0.40997058,0.0016452512,0.00014142766,0.004972167,0.000048041384,0.00007935452,0.00032194366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970439,0.00033932505,0.0008848934,0.0007963549,0.0003026107,0.00063291844],"domain_scores_gemma":[0.9901005,0.0012877738,0.0003644528,0.007564241,0.00048413218,0.00019888551],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013194026,0.0003766497,0.00074228266,0.00022550572,0.0008951821,0.0005857159,0.0075146053,0.00014715389,0.000008850378],"category_scores_gemma":[0.00079640956,0.0003670041,0.00018699934,0.0015742326,0.00017982101,0.00050860946,0.005270759,0.00037189797,0.000046673682],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001591784,0.00037379362,0.00027144823,0.0020686968,0.00010592582,0.0000035120233,0.00073192455,0.004975623,0.00013723665,0.012265055,0.052296918,0.9267683],"study_design_scores_gemma":[0.00026275968,0.00023797096,0.000015790838,0.0034002508,0.00006842466,0.000113883645,0.00016182094,0.3945717,0.00003081516,0.0005166857,0.6000366,0.0005832742],"about_ca_topic_score_codex":0.000044052813,"about_ca_topic_score_gemma":0.0000055891405,"teacher_disagreement_score":0.926185,"about_ca_system_score_codex":0.00013255331,"about_ca_system_score_gemma":0.000046140303,"threshold_uncertainty_score":0.99987817},"labels":[],"label_agreement":null},{"id":"W2090507423","doi":"10.1109/icc.2012.6364557","title":"MR-Chord: A scheme for enhancing Chord lookup accuracy and performance in mobile P2P network","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Chord (peer-to-peer); Pastry; Distributed hash table; Computer science; Computer network; Routing protocol; Routing table; Overlay network; Distributed computing; Peer-to-peer; Hash table; Enhanced Interior Gateway Routing Protocol; The Internet; Wireless Routing Protocol; Routing (electronic design automation); Hash function; Computer security; World Wide Web","score_opus":0.016223705741838068,"score_gpt":0.26441495454659275,"score_spread":0.24819124880475468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090507423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72548616,0.0015894515,0.2691714,0.00060285727,0.00046631604,0.0008303607,8.500099e-7,0.0006047133,0.0012479048],"genre_scores_gemma":[0.75840753,0.00010746507,0.24018133,0.0003863683,0.00020523161,0.00033695588,0.0000010801529,0.000013019741,0.00036102853],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980623,0.00002019538,0.00031445184,0.00043610125,0.00019097954,0.00097595557],"domain_scores_gemma":[0.99875396,0.0002916244,0.000079315956,0.0006766317,0.00005595002,0.00014250503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077331235,0.00021414836,0.00025787926,0.00015435612,0.00013952049,0.00013122105,0.00094716303,0.00012888818,0.0000104992005],"category_scores_gemma":[0.00015716875,0.00019358228,0.00003935532,0.00077397295,0.00004487295,0.0012474853,0.00087316544,0.00021543578,0.00004940277],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057970195,0.00018141637,0.16303633,0.00012845025,0.00003813437,0.0000041121284,0.0017113417,0.002158508,0.0022586612,0.024565328,0.019718649,0.7861411],"study_design_scores_gemma":[0.0024346684,0.0014331539,0.10967701,0.0005319513,0.000022847149,0.00008331432,0.00050081895,0.36006245,0.03589863,0.0052786395,0.48157653,0.002499995],"about_ca_topic_score_codex":0.000014648083,"about_ca_topic_score_gemma":0.00012237167,"teacher_disagreement_score":0.7836411,"about_ca_system_score_codex":0.00007191473,"about_ca_system_score_gemma":0.000036518213,"threshold_uncertainty_score":0.78940564},"labels":[],"label_agreement":null},{"id":"W2091130460","doi":"10.1145/1180639.1180754","title":"Scaling laws and tradeoffs in peer-to-peer live multimedia streaming","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Upload; Computer science; Network topology; Heuristics; Peer-to-peer; Server; Computer network; Live streaming; Bandwidth (computing); Key (lock); Distributed computing; Heuristic; Multimedia; World Wide Web; Computer security","score_opus":0.011475056123091718,"score_gpt":0.23800395104334582,"score_spread":0.2265288949202541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091130460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6432587,0.00032819307,0.29015172,0.051209092,0.000498992,0.00074060366,0.000008668997,0.0019995237,0.011804501],"genre_scores_gemma":[0.6110761,0.0000029866787,0.38653174,0.0005949833,0.000071227456,0.0000225084,0.0000026513417,0.000012064377,0.0016857109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768937,0.00003858266,0.00033895575,0.0006812516,0.0006331484,0.0006186913],"domain_scores_gemma":[0.9987387,0.00033338973,0.00004586066,0.0005740747,0.00016915069,0.0001388389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060006545,0.00023529136,0.00026140484,0.0003916894,0.00008359093,0.00025262186,0.0009968193,0.00014925923,0.000007252518],"category_scores_gemma":[0.0004579318,0.00022029034,0.00003754967,0.00092324684,0.000063259824,0.00041788857,0.00069766433,0.00024556316,0.000112994414],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002110951,0.00038077214,0.01698218,0.000022019902,0.000027658854,0.00033978728,0.0063572456,0.00751839,0.0031120495,0.03594878,0.05334889,0.8759411],"study_design_scores_gemma":[0.0034577858,0.00056930963,0.1612577,0.00037695642,0.000029442419,0.0001682862,0.0034151978,0.639636,0.024455244,0.019230474,0.14445788,0.0029457523],"about_ca_topic_score_codex":0.001272235,"about_ca_topic_score_gemma":0.0011312683,"teacher_disagreement_score":0.8729954,"about_ca_system_score_codex":0.000089760826,"about_ca_system_score_gemma":0.000030115018,"threshold_uncertainty_score":0.89831793},"labels":[],"label_agreement":null},{"id":"W2091541911","doi":"10.1109/vetecf.2010.5594219","title":"Penalty Function Method for Peer Selection over Wireless Mesh Network","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Computer science; Peer-to-peer; Distributed computing; Computer network; Throughput; Wireless mesh network; File sharing; Bandwidth (computing); Selection (genetic algorithm); Wireless; Wireless network; Mathematical optimization; The Internet","score_opus":0.014099685935385247,"score_gpt":0.28543468719769144,"score_spread":0.2713350012623062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091541911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014409609,0.000006293823,0.9748913,0.004418786,0.0022294023,0.00042479776,0.0000011995958,0.0015694709,0.0020491146],"genre_scores_gemma":[0.20384382,0.0000011890497,0.78818625,0.0012390643,0.0005960022,0.00014336787,0.0000044572444,0.000018670815,0.0059671756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982188,0.000040678984,0.00022414216,0.00058513635,0.00039428996,0.0005369776],"domain_scores_gemma":[0.9986362,0.00023037742,0.000084890664,0.00061292114,0.00033566752,0.0000999448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012057596,0.00018875403,0.00020058661,0.00013092888,0.00024054888,0.00021427598,0.0008697559,0.00022554265,0.00006304892],"category_scores_gemma":[0.00014149457,0.00016530941,0.0000939897,0.0009676439,0.000024392126,0.00046281976,0.0003190481,0.00035948932,0.000054819448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003109615,0.00003594002,0.0010175069,0.000007804321,0.00003472803,7.3510455e-7,0.00005121604,0.001172319,0.009641131,0.39297596,0.37875098,0.2162806],"study_design_scores_gemma":[0.00040260726,0.00027900413,0.006892607,0.000007715052,0.00002131731,0.00002300855,0.000011513766,0.700823,0.011615678,0.04551275,0.2339861,0.0004246656],"about_ca_topic_score_codex":0.00006297587,"about_ca_topic_score_gemma":0.000667081,"teacher_disagreement_score":0.6996507,"about_ca_system_score_codex":0.000044353692,"about_ca_system_score_gemma":0.00005454505,"threshold_uncertainty_score":0.6741122},"labels":[],"label_agreement":null},{"id":"W2092675829","doi":"10.5555/1639809.1639848","title":"A novel bio-inspired load balancing algorithm with QoS assurance for large-scale peer-to-peer systems","year":2009,"lang":"en","type":"article","venue":"Spring Simulation Multiconference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Load balancing (electrical power); Quality of service; Distributed computing; Emulation; Scheduling (production processes); Mobile QoS; Computer network; Service (business); Service provider; Grid; Engineering","score_opus":0.022551842952102868,"score_gpt":0.2780396939670481,"score_spread":0.2554878510149452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092675829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043156423,0.000040731953,0.9501728,0.0031970164,0.0006078187,0.001396717,0.000039416886,0.0012603378,0.00012872672],"genre_scores_gemma":[0.5935468,6.998686e-7,0.4057048,0.00025259328,0.00011202731,0.00007561239,0.000004434101,0.000018235009,0.0002848113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962934,0.000035956735,0.0005285219,0.0010388428,0.0011940824,0.0009091857],"domain_scores_gemma":[0.99610126,0.00038739128,0.00022341352,0.0012285272,0.0018098339,0.0002495733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088920584,0.00041242692,0.00047319042,0.00029732508,0.00031340204,0.00058994663,0.0014512867,0.00019167621,0.0000017152448],"category_scores_gemma":[0.00084634736,0.00038860564,0.00008061071,0.00094079203,0.000032382995,0.0006463366,0.00024782436,0.00025438,0.00006304362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047648642,0.00017216228,0.0025976645,0.000045780187,0.000032351047,0.000008215574,0.0014261745,0.9024389,0.007830012,0.0053373952,0.00019454189,0.07986915],"study_design_scores_gemma":[0.0012981255,0.00025342946,0.027287036,0.00029030695,0.000013349431,0.0000049841474,0.00008615694,0.9600596,0.0018815252,0.00010839465,0.008159119,0.00055798475],"about_ca_topic_score_codex":0.00013709317,"about_ca_topic_score_gemma":0.00012018903,"teacher_disagreement_score":0.55039036,"about_ca_system_score_codex":0.00028627247,"about_ca_system_score_gemma":0.00021518687,"threshold_uncertainty_score":0.9998566},"labels":[],"label_agreement":null},{"id":"W2092968801","doi":"10.1109/ic2e.2014.87","title":"Enabling A Load Adaptive Distributed Stream Processing Platform on Synchronized Clusters","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Stream processing; Data stream mining; Node (physics); Process (computing); Digital signal processing; Load balancing (electrical power); Cluster (spacecraft); Software; Real-time computing; Computer network; Operating system; Data mining; Computer hardware; Grid","score_opus":0.019962309609300333,"score_gpt":0.24059991486282495,"score_spread":0.2206376052535246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092968801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020980986,0.00004677304,0.96858525,0.0020237442,0.00016213085,0.00027556534,0.0000036598444,0.0020105948,0.005911282],"genre_scores_gemma":[0.9058752,0.0000025637953,0.09315872,0.0006356302,0.000060999322,0.00003359554,0.0000046754853,0.000013518126,0.00021508746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979287,0.000025437117,0.00026437326,0.0006393272,0.0005262716,0.0006159227],"domain_scores_gemma":[0.99864227,0.00018205844,0.000110898574,0.00075979327,0.000167405,0.00013754937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039677942,0.00025754084,0.00026835213,0.00017122811,0.00021066827,0.00031711426,0.0014393639,0.00013187232,0.0000062920026],"category_scores_gemma":[0.00027343928,0.00021078614,0.00005870936,0.0009178118,0.00006572591,0.0005553874,0.0006541421,0.0002554246,0.00011827089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068054214,0.00010078368,0.0000709179,0.000022975972,0.000029959194,0.000017283306,0.00048519621,0.008520561,0.0002513537,0.029857375,0.0057361554,0.9548394],"study_design_scores_gemma":[0.001012192,0.00068410154,0.00026872757,0.00024483993,0.000010195198,0.000015281872,0.0002696182,0.97403485,0.0074302875,0.00609221,0.009343142,0.0005945713],"about_ca_topic_score_codex":0.00004514365,"about_ca_topic_score_gemma":0.00006523667,"teacher_disagreement_score":0.96551424,"about_ca_system_score_codex":0.0003879239,"about_ca_system_score_gemma":0.00013776615,"threshold_uncertainty_score":0.8595609},"labels":[],"label_agreement":null},{"id":"W2094484544","doi":"10.1145/1806565.1806591","title":"Collaborative delay-aware scheduling in peer-to-peer UGC video sharing","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Peer-to-peer; Scheduling (production processes); The Internet; Shared resource; Multimedia; File sharing; World Wide Web; Computer network","score_opus":0.012640985360689914,"score_gpt":0.2746761710222113,"score_spread":0.2620351856615214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094484544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54674506,0.000028610444,0.402571,0.040546186,0.001152199,0.00062507973,0.000007639172,0.0017117872,0.006612456],"genre_scores_gemma":[0.6439995,0.0000012550048,0.3522658,0.0011531474,0.00008328157,0.00008493467,0.0000026530136,0.000020319814,0.0023891039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664265,0.00003138751,0.00045068955,0.0010946926,0.0009230163,0.0008575542],"domain_scores_gemma":[0.9969905,0.00017331808,0.00008495034,0.0015166627,0.00096092856,0.0002736634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011576765,0.00033396608,0.00036091573,0.0006632084,0.0001695915,0.0005729952,0.0034029153,0.0002750857,0.00005218399],"category_scores_gemma":[0.0011732386,0.0003183004,0.000056842047,0.0036438769,0.00006594482,0.0008215073,0.002413364,0.0008482703,0.0005452371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009680964,0.0005200685,0.08321562,0.000058681897,0.00014926727,0.00080091314,0.014289965,0.06296681,0.042034734,0.4770023,0.10518609,0.21367876],"study_design_scores_gemma":[0.0020980572,0.0005869301,0.027870422,0.00029526287,0.000020642994,0.00011751902,0.0026246447,0.66822785,0.07277068,0.035937943,0.18603024,0.00341984],"about_ca_topic_score_codex":0.00016831547,"about_ca_topic_score_gemma":0.002759687,"teacher_disagreement_score":0.605261,"about_ca_system_score_codex":0.00012873499,"about_ca_system_score_gemma":0.0001696619,"threshold_uncertainty_score":0.9999269},"labels":[],"label_agreement":null},{"id":"W2095190402","doi":"10.1145/1178477.1178486","title":"Characterization of user behavior in a multi-player online game","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workload; Session (web analytics); Scalability; Popularity; Human–computer interaction; Multimedia; World Wide Web; Database","score_opus":0.03284658182307019,"score_gpt":0.28591404445425705,"score_spread":0.25306746263118685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095190402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7596706,0.0000045542765,0.23810962,0.0017353676,0.000054425833,0.00015469789,0.000005045713,0.00023395158,0.00003173966],"genre_scores_gemma":[0.79213125,0.000004703273,0.20679954,0.00032227574,0.000016302272,0.000021159361,0.0000074920363,0.000005057536,0.00069222937],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9991802,0.000013990229,0.0002344243,0.00023291557,0.00014570948,0.00019273949],"domain_scores_gemma":[0.9994135,0.000014460017,0.000055240915,0.00043240713,0.000051465253,0.00003293247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008840061,0.00008912812,0.00013138588,0.0002202701,0.000009244235,0.000024710458,0.0006748542,0.000073493175,0.000019450663],"category_scores_gemma":[0.000025551906,0.00008076643,0.000023482462,0.00054058555,0.00001886692,0.00035313316,0.00028673734,0.0000888434,0.000042839056],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001036896,0.0012670207,0.04800708,0.000008040464,0.000007574164,0.000019685303,0.0007371774,0.00053813827,0.63850236,0.004570675,0.00038210186,0.3059498],"study_design_scores_gemma":[0.00048623516,0.000083232335,0.8406824,0.000022661541,0.0000033542767,0.0000066336306,0.000014744215,0.066844665,0.0832711,0.000025502983,0.008335014,0.0002244661],"about_ca_topic_score_codex":0.000024038385,"about_ca_topic_score_gemma":0.00038132272,"teacher_disagreement_score":0.7926753,"about_ca_system_score_codex":0.000037757865,"about_ca_system_score_gemma":0.000018304545,"threshold_uncertainty_score":0.32935596},"labels":[],"label_agreement":null},{"id":"W2095232315","doi":"10.1145/1453175.1453188","title":"Running applications efficiently in online social networks","year":2008,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exploit; Computer science; The Internet; World Wide Web; Computer security","score_opus":0.09291162759527359,"score_gpt":0.3481661690136663,"score_spread":0.2552545414183927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095232315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16966921,0.1579501,0.6520108,0.011470871,0.000674461,0.005792973,0.0000063121693,0.0011533515,0.0012719259],"genre_scores_gemma":[0.83586556,0.072672315,0.086006194,0.0038341822,0.00024403981,0.0011927148,0.00007739982,0.000026914466,0.000080690275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970834,0.000105650215,0.000689041,0.0005599158,0.0010928286,0.00046913238],"domain_scores_gemma":[0.99770826,0.00021830843,0.0002684513,0.0012307412,0.00049822405,0.00007599533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023982418,0.00021688796,0.00039452306,0.0007965526,0.00035308,0.000048301677,0.0023524752,0.0001190936,0.000019344188],"category_scores_gemma":[0.0012430109,0.00021433135,0.000082336956,0.011851844,0.000059506878,0.000455808,0.0007447873,0.0003852383,0.00013830881],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013716053,0.00011038067,0.006529527,0.00012800694,0.0000068940494,0.0000018626122,0.000098932775,0.019675544,0.000005157395,0.00056139193,0.006217627,0.9666633],"study_design_scores_gemma":[0.0005560303,0.000111943315,0.13428663,0.0007379367,0.000041372805,0.000028026709,0.000011947727,0.80672926,0.00003058915,0.00022111015,0.056701157,0.0005440296],"about_ca_topic_score_codex":0.0000039903007,"about_ca_topic_score_gemma":0.0000042390407,"teacher_disagreement_score":0.9661193,"about_ca_system_score_codex":0.00029780707,"about_ca_system_score_gemma":0.00019143787,"threshold_uncertainty_score":0.8740179},"labels":[],"label_agreement":null},{"id":"W2095334143","doi":"10.1145/1233341.1233373","title":"Apocrita","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph-Humber","funders":"","keywords":"Computer science; World Wide Web; Process (computing); File sharing; Document management system; Electronic document; Information retrieval; The Internet","score_opus":0.010966502107829505,"score_gpt":0.25662697796108347,"score_spread":0.24566047585325396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095334143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009049175,0.000030928695,0.9020639,0.0061565815,0.00023877183,0.000055532582,8.8901885e-8,0.0014254306,0.08097959],"genre_scores_gemma":[0.57495975,0.0000010002959,0.42091778,0.0014477306,0.000032479395,0.0000019536756,1.13050085e-7,0.0000029228413,0.0026362492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992149,0.0000038755347,0.00009913968,0.00021386558,0.00016191193,0.00030630265],"domain_scores_gemma":[0.9992328,0.000053517157,0.0000118885555,0.0006015751,0.000033564942,0.000066639455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088239,0.00006252059,0.000060872026,0.00011512326,0.000038884136,0.000058661095,0.0012320749,0.000041317428,0.000012532398],"category_scores_gemma":[0.000053990145,0.00005323896,0.000020079864,0.0005649968,0.000018718622,0.00016043807,0.00051904726,0.00007048736,0.00052466197],"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.000001148855,0.00001821497,0.00076747127,0.0000010700513,0.0000037227142,0.00003606485,0.000079364196,0.000016000718,0.00087222114,0.5178665,0.09986432,0.3804739],"study_design_scores_gemma":[0.00033204508,0.00023875614,0.029469188,0.000016351107,0.000002931299,0.00007473113,0.00012762498,0.007831354,0.09081729,0.09673895,0.77361894,0.0007318352],"about_ca_topic_score_codex":0.000014928117,"about_ca_topic_score_gemma":0.000039400842,"teacher_disagreement_score":0.67375463,"about_ca_system_score_codex":0.000023077388,"about_ca_system_score_gemma":0.000009875582,"threshold_uncertainty_score":0.6743643},"labels":[],"label_agreement":null},{"id":"W2095653244","doi":"10.1145/1877911.1877917","title":"Collaborative content synchronization through an event-based framework","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Upload; Event (particle physics); Popularity; Similarity (geometry); Greedy algorithm; Information retrieval; Focus (optics); Synchronization (alternating current); Image (mathematics); Artificial intelligence; Data mining; World Wide Web; Algorithm","score_opus":0.019196992276816302,"score_gpt":0.2838299660000001,"score_spread":0.2646329737231838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095653244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03335104,0.000023916447,0.9521887,0.011182238,0.00079994765,0.0003269812,0.0000034890672,0.0012859533,0.000837749],"genre_scores_gemma":[0.5701868,0.0000017531169,0.42821568,0.0014099816,0.000048618185,0.00003291552,0.0000036063186,0.0000070163346,0.000093634786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866414,0.000045981313,0.00020082374,0.00046663237,0.00030575955,0.00031668734],"domain_scores_gemma":[0.99827284,0.000119639146,0.00007711056,0.0010653188,0.0003721452,0.00009297878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019257775,0.00016335043,0.00015731395,0.000081740945,0.00013905359,0.00023809807,0.0012641593,0.00019926055,0.000053287527],"category_scores_gemma":[0.00032419615,0.00014012173,0.000029061104,0.001303724,0.00008261285,0.00085618824,0.00022462643,0.00031336083,0.0001188422],"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.000009440054,0.00017268809,0.001569633,0.0000047505637,0.00001671293,0.000013353074,0.00093294564,0.005557218,0.005330354,0.9508578,0.0062556895,0.029279418],"study_design_scores_gemma":[0.0009964389,0.0012673178,0.006969149,0.00010056818,0.000017570199,0.000012546782,0.0008083992,0.6944652,0.1434665,0.09400207,0.05652109,0.0013731323],"about_ca_topic_score_codex":0.000036355483,"about_ca_topic_score_gemma":0.00026421095,"teacher_disagreement_score":0.85685575,"about_ca_system_score_codex":0.000050611878,"about_ca_system_score_gemma":0.00016471732,"threshold_uncertainty_score":0.57139987},"labels":[],"label_agreement":null},{"id":"W2096052856","doi":"10.1109/icdcs.2006.61","title":"Overlay Multicast with Inferred Link Capacity Correlations","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Overlay multicast; Overlay; Computer science; Overlay network; Heuristics; Distributed computing; Computer network; Bandwidth (computing); Xcast; Pragmatic General Multicast; The Internet; Programming language; Operating system","score_opus":0.01419830829199164,"score_gpt":0.21104969896805154,"score_spread":0.1968513906760599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096052856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057871643,0.000009765551,0.91474915,0.0057498678,0.00015111745,0.00018107846,0.000002422481,0.0015775542,0.019707397],"genre_scores_gemma":[0.7196191,3.1615068e-7,0.27869484,0.00020347418,0.000045203742,0.0000150994865,0.0000013946451,0.0000055944834,0.0014150107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989497,0.00001597835,0.00016601448,0.00032424682,0.00024231317,0.00030174598],"domain_scores_gemma":[0.9989942,0.00009881727,0.000044937817,0.00070216396,0.00010023273,0.00005967932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092790724,0.00013184219,0.00012746466,0.00012652883,0.00011479517,0.00013745668,0.0006976613,0.00008321984,0.000014011861],"category_scores_gemma":[0.00005093139,0.00010247747,0.00002727609,0.0007315233,0.00007796037,0.0003410553,0.00025789964,0.00016488439,0.00021109222],"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.000010233218,0.00021495356,0.094655424,0.0000071346426,0.000031635358,0.0000479998,0.0003672284,0.053175233,0.00060192624,0.73992914,0.064097196,0.046861906],"study_design_scores_gemma":[0.0008276059,0.00027732115,0.32613128,0.000041003223,0.000013531847,0.00007181992,0.000031163592,0.6084498,0.0032057685,0.017264664,0.04291183,0.00077417237],"about_ca_topic_score_codex":0.0003782431,"about_ca_topic_score_gemma":0.0008543618,"teacher_disagreement_score":0.7226645,"about_ca_system_score_codex":0.000050003626,"about_ca_system_score_gemma":0.000034981764,"threshold_uncertainty_score":0.41789097},"labels":[],"label_agreement":null},{"id":"W2096079521","doi":"10.1109/jsac.2007.071202","title":"Characterizing Peer-to-Peer Streaming Flows","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bandwidth (computing); Peer-to-peer; Computer network; Server; Upload; World Wide Web","score_opus":0.037605225110638824,"score_gpt":0.31407590511332834,"score_spread":0.2764706800026895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096079521","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5762758,0.00019060868,0.31358436,0.100000046,0.0013009981,0.00062974234,0.000013189481,0.0011085513,0.006896638],"genre_scores_gemma":[0.8148578,0.00006784371,0.18292925,0.0015743684,0.00016223143,0.000027044305,0.000008161408,0.00002830406,0.00034504666],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996744,0.0002248217,0.0008066482,0.00040315982,0.0009726323,0.0008487671],"domain_scores_gemma":[0.99434453,0.0008794001,0.00026962432,0.002847201,0.0012958549,0.00036340178],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024617736,0.00029222653,0.00033822042,0.0014040412,0.000631452,0.00048036219,0.006427789,0.00018017893,0.000007739863],"category_scores_gemma":[0.0016116931,0.0002946035,0.000086389045,0.004107064,0.000055940072,0.0005683611,0.00082797103,0.0017783236,0.0001590511],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015670962,0.001837414,0.014132042,0.000014575684,0.00023509309,0.00036224246,0.010789014,0.006701057,0.10843658,0.023225373,0.04074941,0.7933605],"study_design_scores_gemma":[0.0022963162,0.0013322515,0.32566652,0.0015723122,0.000052374686,0.0017242751,0.0010171975,0.04922891,0.03703423,0.007732645,0.5695885,0.0027544652],"about_ca_topic_score_codex":0.00003485309,"about_ca_topic_score_gemma":0.00067099027,"teacher_disagreement_score":0.790606,"about_ca_system_score_codex":0.00057803304,"about_ca_system_score_gemma":0.00019675335,"threshold_uncertainty_score":0.9999506},"labels":[],"label_agreement":null},{"id":"W2096705495","doi":"10.1109/icme.2009.5202697","title":"A light-weight federated video adaptation system for P2P overlays","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Adaptation (eye); Metadata; Live streaming; Multimedia; Bandwidth (computing); Computer network; Spare part; World Wide Web; Operating system","score_opus":0.01705731713563692,"score_gpt":0.23400987178988908,"score_spread":0.21695255465425217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096705495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003917991,0.000082626524,0.96946645,0.011822373,0.00040021923,0.0005210473,0.000001437089,0.0029663113,0.010821559],"genre_scores_gemma":[0.7988498,0.0000017974406,0.1992886,0.000757035,0.000073026364,0.000056601417,0.000002403223,0.000007397539,0.00096328236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860466,0.000023134176,0.00026328885,0.00046786977,0.00025306788,0.00038797723],"domain_scores_gemma":[0.9990507,0.00007933912,0.00007683671,0.00052633655,0.0001828235,0.00008399683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022199092,0.0001701947,0.0002008878,0.00016824591,0.00018849665,0.00032921715,0.00084628374,0.00011939638,0.0000025917514],"category_scores_gemma":[0.000069987545,0.00014335281,0.00006342778,0.00068685453,0.0000065685954,0.00043555803,0.00011598651,0.00007915673,0.00010153163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036590332,0.00008409794,0.000027073898,0.000030027404,0.000032252818,0.000025595607,0.00051178585,0.0014629777,0.012407131,0.6346234,0.14155525,0.20920378],"study_design_scores_gemma":[0.00087509793,0.0008050154,0.00078510394,0.00012109639,0.000013683681,0.00004312637,0.00024005419,0.84339255,0.0814363,0.011182962,0.060471937,0.0006330607],"about_ca_topic_score_codex":0.00001557307,"about_ca_topic_score_gemma":0.000029598044,"teacher_disagreement_score":0.8419296,"about_ca_system_score_codex":0.00013481108,"about_ca_system_score_gemma":0.000051645377,"threshold_uncertainty_score":0.5845758},"labels":[],"label_agreement":null},{"id":"W2096799432","doi":"10.1109/icmss.2009.5302401","title":"A Social Web Approach to Managing Information and Knowledge in the AEC Industry","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"World Wide Web; Social web; The Internet; Computer science; Web 2.0; Social Semantic Web; Knowledge management; Social media; Web development; Web intelligence; Web service","score_opus":0.021749033403451738,"score_gpt":0.2652778459449461,"score_spread":0.24352881254149433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096799432","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22989465,0.000057551995,0.3131639,0.06929299,0.00009421945,0.00062936236,6.085127e-7,0.0008570257,0.38600966],"genre_scores_gemma":[0.9697366,0.0000012266374,0.026682721,0.0034412004,0.000031034448,0.000017156437,5.4333003e-7,0.0000012214488,0.000088300534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.00002453443,0.00012725306,0.00013214497,0.00013175658,0.00020479168],"domain_scores_gemma":[0.9996862,0.000020045265,0.00002086838,0.00022409645,0.000021655984,0.000027173217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003768314,0.000075854165,0.00007461801,0.00021364841,0.00008517036,0.00022967765,0.0008294124,0.00010994412,4.4263362e-7],"category_scores_gemma":[0.000021905893,0.000055175766,0.00001111915,0.0009958422,0.000015936685,0.00054392684,0.00029939803,0.0002545581,0.000026131796],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020450223,0.0000395954,0.0002899292,0.0000047927747,0.0000020329655,0.0000011477615,0.009158167,0.000117160955,0.000012970687,0.2698595,0.04218036,0.67833227],"study_design_scores_gemma":[0.0014897024,0.00042522384,0.21062016,0.00007353032,0.000010523078,0.00008632326,0.012867007,0.4752189,0.00035076315,0.06712765,0.23041683,0.0013133881],"about_ca_topic_score_codex":0.000009875561,"about_ca_topic_score_gemma":0.000017629078,"teacher_disagreement_score":0.73984194,"about_ca_system_score_codex":0.00003260995,"about_ca_system_score_gemma":0.000027921085,"threshold_uncertainty_score":0.22500025},"labels":[],"label_agreement":null},{"id":"W2097364154","doi":"10.1109/icdcs.2004.1281630","title":"sFlow: towards resource-efficient and agile service federation in service overlay networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Quality of service; Service (business); Agile software development; Computer network; Differentiated service; Provisioning; Path (computing); Service composition; Graph; Resource (disambiguation); Overlay network; Service provider; Service design; World Wide Web; The Internet; Software engineering; Business; Theoretical computer science","score_opus":0.011531737662192093,"score_gpt":0.22583581429198077,"score_spread":0.21430407662978868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097364154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36355114,0.00021481515,0.5761425,0.051811315,0.00023954675,0.00045548961,0.0000012654071,0.0011196233,0.006464335],"genre_scores_gemma":[0.9369238,0.000010873609,0.05197297,0.0108379135,0.00006526944,0.000036363934,0.0000046898567,0.000014970214,0.00013312178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822503,0.000041966323,0.00028712538,0.00061391864,0.000338317,0.0004936254],"domain_scores_gemma":[0.99896467,0.00005247312,0.000056641078,0.0006882327,0.000121063524,0.00011693598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040413777,0.00021342392,0.00020719055,0.00019639617,0.00015892605,0.00037520038,0.00091843185,0.00017179006,0.000006805687],"category_scores_gemma":[0.000036426467,0.0001998391,0.000023726867,0.0018448732,0.000020407868,0.00027309562,0.00097447407,0.00025130683,0.000048068792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011194284,0.00008837122,0.00021499733,0.000016016676,0.000007468213,0.000026380101,0.0013241759,0.9426046,0.00022546023,0.019698145,0.0020131452,0.033770047],"study_design_scores_gemma":[0.00079746795,0.00010159734,0.012354361,0.00009556307,0.0000039889674,0.000035047095,0.00023519897,0.971102,0.0013272038,0.002256733,0.011242524,0.00044831182],"about_ca_topic_score_codex":0.0010136369,"about_ca_topic_score_gemma":0.0037439337,"teacher_disagreement_score":0.57337266,"about_ca_system_score_codex":0.00017099027,"about_ca_system_score_gemma":0.00006960574,"threshold_uncertainty_score":0.8149202},"labels":[],"label_agreement":null},{"id":"W2098055383","doi":"10.1109/cira.2003.1222087","title":"Approximate matching in publish/ subscribe","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Matching (statistics); Process (computing); Dissemination; World Wide Web; Distributed computing; Telecommunications; Business","score_opus":0.0148143715828012,"score_gpt":0.23397587133426206,"score_spread":0.21916149975146088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098055383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11453482,0.000052554664,0.848635,0.019927263,0.0002569319,0.00017379696,4.0407124e-7,0.001726819,0.014692401],"genre_scores_gemma":[0.676637,0.000002555304,0.32223305,0.0008665605,0.000015470427,0.000020158786,5.8756797e-7,0.000006178644,0.00021845583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870205,0.000013051316,0.0001946067,0.0003975105,0.00024159007,0.0004511934],"domain_scores_gemma":[0.9991406,0.000024830273,0.00002989329,0.00070405094,0.0000321894,0.00006842101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033344366,0.00012280888,0.00013942191,0.00029031938,0.000045977795,0.0003752086,0.0017998983,0.000075450516,0.000006521489],"category_scores_gemma":[0.000057011217,0.00010941516,0.000028703651,0.0011950665,0.00002444459,0.0010025637,0.0008400359,0.00019242984,0.00013389894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022611644,0.00007999827,0.0010073954,0.000008148804,0.000005146736,0.00008267362,0.0009740055,0.007354194,0.0005663631,0.9321083,0.0035089934,0.054302547],"study_design_scores_gemma":[0.0011880544,0.00012247132,0.011667796,0.0000988739,0.0000022361446,0.000076799966,0.00037778702,0.015824819,0.012099796,0.94939727,0.008261909,0.00088220555],"about_ca_topic_score_codex":0.00027752432,"about_ca_topic_score_gemma":0.00034266067,"teacher_disagreement_score":0.5621022,"about_ca_system_score_codex":0.000111947964,"about_ca_system_score_gemma":0.000045332818,"threshold_uncertainty_score":0.44618207},"labels":[],"label_agreement":null},{"id":"W2098195139","doi":"10.1109/vecims.2008.4592758","title":"A microcell oriented load balancing model for collaborative virtual environments","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Microcell; Computer science; Load balancing (electrical power); Overlay; Server; Distributed computing; Computer network; Context (archaeology); Round-robin DNS; Architecture; Network Load Balancing Services; Load management; Overlay network; Peer-to-peer; Context model; The Internet; Operating system; Engineering","score_opus":0.018329268170754004,"score_gpt":0.2240435785896199,"score_spread":0.2057143104188659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098195139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05533562,0.000047185375,0.9418062,0.0008271503,0.0001222648,0.00040726116,0.000012340076,0.0004169196,0.0010250855],"genre_scores_gemma":[0.5035235,0.000019236484,0.4789991,0.00083588675,0.00002278728,0.00009748814,0.0000031610377,0.000012850848,0.016485952],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985466,0.000012657316,0.00020443359,0.0005084942,0.0003131389,0.00041469754],"domain_scores_gemma":[0.9991643,0.00006697638,0.00006111546,0.00052925077,0.00008582033,0.00009254987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012897677,0.000175819,0.00018417843,0.00008829605,0.00018998311,0.000034868724,0.00086384517,0.000089874025,0.0000033191343],"category_scores_gemma":[0.0000668353,0.0001626575,0.00004223895,0.00053901854,0.00007108153,0.0002932652,0.00048576118,0.00009117262,0.0000939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021186631,0.00078735565,0.002259641,0.000022035327,0.00019536976,0.00011705745,0.01920303,0.17136006,0.1415454,0.22758031,0.40117308,0.035544764],"study_design_scores_gemma":[0.0007424294,0.0002512927,0.000131258,0.000009940707,0.000004210094,0.000013655192,0.00015951213,0.9118152,0.041948922,0.0010477509,0.043528244,0.00034757095],"about_ca_topic_score_codex":0.0000063623297,"about_ca_topic_score_gemma":0.000016853011,"teacher_disagreement_score":0.74045515,"about_ca_system_score_codex":0.00020290673,"about_ca_system_score_gemma":0.00016211768,"threshold_uncertainty_score":0.663298},"labels":[],"label_agreement":null},{"id":"W2098749004","doi":"10.1145/1281100.1281117","title":"On the complexity of greedy routing in ring-based peer-to-peer networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Upper and lower bounds; Routing (electronic design automation); Ring (chemistry); Successor cardinal; Node (physics); Mathematics; Greedy algorithm; Discrete mathematics; Network topology; Topology (electrical circuits); Computer science; Computer network; Algorithm; Physics","score_opus":0.05092940374219191,"score_gpt":0.2797051576839101,"score_spread":0.22877575394171817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098749004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13653938,0.000007669063,0.8215906,0.03119397,0.0002728677,0.0003878945,0.0000013260001,0.00050645514,0.009499811],"genre_scores_gemma":[0.929278,1.7721837e-7,0.0670095,0.0032340863,0.00004760141,0.000012589773,0.0000013690227,0.000013277637,0.00040337222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997218,0.000070914946,0.00049411267,0.0005267815,0.00091539446,0.0007747932],"domain_scores_gemma":[0.99737215,0.00079696986,0.00012287372,0.0013064353,0.00028272942,0.0001188159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035173586,0.00023466538,0.00029325005,0.00035773043,0.00012475677,0.000100942925,0.0025797146,0.00013605782,0.000022183978],"category_scores_gemma":[0.00082849804,0.00017146135,0.000079762765,0.0020875554,0.00019817006,0.00011603389,0.0008367729,0.00046557287,0.000053412507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004557912,0.00015289866,0.009060047,0.0000057992424,0.000014385965,0.000033338853,0.0004256014,0.11743703,0.00015450256,0.829897,0.01427106,0.028502759],"study_design_scores_gemma":[0.0005381712,0.00035235746,0.09342705,0.00012966486,0.000004109729,0.0000047722133,0.00017498771,0.8778188,0.0065297033,0.018489836,0.0020347543,0.00049576437],"about_ca_topic_score_codex":0.0003690142,"about_ca_topic_score_gemma":0.0016668105,"teacher_disagreement_score":0.81140715,"about_ca_system_score_codex":0.00013192574,"about_ca_system_score_gemma":0.000041543735,"threshold_uncertainty_score":0.6991991},"labels":[],"label_agreement":null},{"id":"W2098814515","doi":"10.1109/lcn.2008.4664286","title":"Understanding and using mobility on Publish/Subscribe based architectures for MANETs","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Publication; Mobility model; Computer network; Wireless ad hoc network; Mobile computing; Process (computing); Distributed computing; Vehicular ad hoc network; Wireless; Telecommunications","score_opus":0.24190014590481534,"score_gpt":0.2894497762669816,"score_spread":0.04754963036216625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098814515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2802751,0.000016813978,0.7155352,0.0025019676,0.000104630344,0.0002868948,0.0000023672153,0.00050663756,0.00077038724],"genre_scores_gemma":[0.77607256,5.612459e-7,0.22300392,0.00083733833,0.000019939545,0.000014547685,7.209798e-7,0.000006853598,0.000043556593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987401,0.000025595667,0.00014782962,0.0004923349,0.00022881375,0.0003653728],"domain_scores_gemma":[0.99898255,0.0002820358,0.000038484835,0.00056747324,0.00003882621,0.00009063218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027065608,0.00014835461,0.00015491959,0.00023699396,0.00026317072,0.00015507948,0.0006136128,0.00007901057,0.0000036030528],"category_scores_gemma":[0.00016350848,0.00012560203,0.000041380135,0.00038115546,0.00011144968,0.0001192166,0.0002370023,0.0001210242,0.0000015080401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042140833,0.0008803699,0.036007367,0.00028333496,0.00017337158,0.0002280054,0.0029813221,0.24867934,0.0063301576,0.53128225,0.09052758,0.08220551],"study_design_scores_gemma":[0.0007570709,0.00042616192,0.0076982854,0.00004072533,0.0000063864527,0.00006421962,0.00008246892,0.9119362,0.008306981,0.06871157,0.0014749417,0.0004949875],"about_ca_topic_score_codex":0.000028407401,"about_ca_topic_score_gemma":0.0000430962,"teacher_disagreement_score":0.6632569,"about_ca_system_score_codex":0.00013757721,"about_ca_system_score_gemma":0.00005050512,"threshold_uncertainty_score":0.5121902},"labels":[],"label_agreement":null},{"id":"W2099068777","doi":"10.1109/packet.2009.5152154","title":"Understanding the flash crowd in P2P live video streaming systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Gossip; Software deployment; Popularity; Flash (photography); Multimedia; Live streaming; Peer-to-peer; Real Time Streaming Protocol; The Internet; Computer security; Distributed computing; World Wide Web; Operating system","score_opus":0.06185949641653108,"score_gpt":0.25507378137883663,"score_spread":0.19321428496230555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099068777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02582786,0.00024853175,0.93697476,0.011895695,0.00042439124,0.00038314308,5.7070616e-7,0.0011240308,0.023121022],"genre_scores_gemma":[0.9890133,0.0000096296135,0.009623942,0.0005913498,0.000040643754,0.0000104944065,2.3803433e-7,0.000004895233,0.0007055064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998697,0.000048791153,0.00021914496,0.00034718757,0.00027597765,0.00041188853],"domain_scores_gemma":[0.9989422,0.00021265334,0.000051271585,0.0007081073,0.000026608774,0.000059138623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004297419,0.00013704503,0.00015558641,0.0001854924,0.00012426508,0.000372687,0.0015220515,0.00007981164,0.000003967892],"category_scores_gemma":[0.00011209929,0.00009473478,0.000032784486,0.0008641635,0.000036949685,0.0003228997,0.00033199348,0.00019788835,0.000092424736],"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.0000054524303,0.000056881647,0.0017974838,0.000010335199,0.00001970357,0.000100768164,0.0032870367,0.020651545,0.0006141716,0.9009772,0.034864828,0.037614606],"study_design_scores_gemma":[0.00091932964,0.0006509276,0.015995987,0.0005962992,0.000013575313,0.000115720046,0.011411931,0.7920144,0.0018757393,0.16686735,0.008246123,0.0012925899],"about_ca_topic_score_codex":0.00009070102,"about_ca_topic_score_gemma":0.00020991029,"teacher_disagreement_score":0.9631854,"about_ca_system_score_codex":0.0002920494,"about_ca_system_score_gemma":0.000038174137,"threshold_uncertainty_score":0.3863172},"labels":[],"label_agreement":null},{"id":"W2099309980","doi":"10.1109/ism.2005.112","title":"Supporting Low-Cost Video-on-Demand in Heterogeneous Peer-to-Peer Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Server; Exploit; Architecture; Peer-to-peer; Computer network; The Internet; On demand; Key (lock); Video on demand; Bandwidth (computing); Distributed computing; Network topology; Multimedia; World Wide Web; Computer security","score_opus":0.01059308295484578,"score_gpt":0.264338147219972,"score_spread":0.2537450642651262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099309980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21729673,0.00007789774,0.7499856,0.019790808,0.00084287516,0.0009867307,0.0000052780115,0.00193037,0.009083725],"genre_scores_gemma":[0.95080286,0.000002400164,0.03952033,0.0037045646,0.00024766184,0.0001248548,0.000011114582,0.00003918139,0.0055470415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99551845,0.00007041478,0.0007679806,0.0011423563,0.001009835,0.0014909531],"domain_scores_gemma":[0.9976613,0.00024030716,0.00014442827,0.0014608486,0.00025688953,0.00023622056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012306038,0.00042946322,0.00044980904,0.0005674603,0.00015400554,0.00044433968,0.0023637116,0.0002643793,0.000037055914],"category_scores_gemma":[0.0003313812,0.00040134563,0.00012012445,0.0017615444,0.000056232595,0.00032486932,0.0011560551,0.00045963214,0.0004693456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029555933,0.00020767815,0.012441713,0.000010678625,0.000017739578,0.0005731379,0.00020557495,0.6862851,0.00032772665,0.00961965,0.21950163,0.07077981],"study_design_scores_gemma":[0.0020461737,0.00074168795,0.02956472,0.00031103316,0.000018413475,0.00026596658,0.000106325635,0.7576704,0.027159596,0.01623921,0.16273986,0.0031366157],"about_ca_topic_score_codex":0.00023926843,"about_ca_topic_score_gemma":0.0008073036,"teacher_disagreement_score":0.7335061,"about_ca_system_score_codex":0.00020193927,"about_ca_system_score_gemma":0.000051970288,"threshold_uncertainty_score":0.99984384},"labels":[],"label_agreement":null},{"id":"W2099323605","doi":"10.1109/p2p.2008.20","title":"pSense - Maintaining a Dynamic Localized Peer-to-Peer Structure for Position Based Multicast in Games","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Multicast; Peer-to-peer; Distributed computing; Locality; Computer network; Sequential game; Overlay network; Overhead (engineering); Server; Non-cooperative game; Metaverse; Multimedia; Game theory; Human–computer interaction; Virtual reality; The Internet; World Wide Web","score_opus":0.015515092822087084,"score_gpt":0.2728800668646674,"score_spread":0.25736497404258035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099323605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24914546,0.000010532655,0.72596925,0.023124952,0.00017775931,0.00069233804,0.000024324654,0.00074578106,0.00010959784],"genre_scores_gemma":[0.57985646,4.788288e-7,0.41787136,0.0017499371,0.00001751539,0.0000628224,0.000017392125,0.000016874905,0.00040714498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739456,0.000062007566,0.00038559188,0.0007759956,0.0006417648,0.00074007205],"domain_scores_gemma":[0.99824625,0.00026871942,0.00007122384,0.0008615213,0.00037882125,0.0001734672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041619095,0.00030226307,0.00035516132,0.0005991614,0.00016195861,0.00012846311,0.0010743667,0.00020415304,0.000015768383],"category_scores_gemma":[0.00063607725,0.0002788385,0.00009470461,0.0011612304,0.000083901905,0.00027407764,0.00034881022,0.00025510724,0.00003471797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001521836,0.0009678408,0.0086858,0.00016915172,0.00020329485,0.0020920867,0.011910008,0.40280905,0.062160075,0.09753572,0.10563226,0.30631286],"study_design_scores_gemma":[0.0016815342,0.00033536897,0.00492581,0.0000621516,0.0000068580143,0.00011383023,0.00017745208,0.97796714,0.0046964935,0.004931397,0.004575636,0.00052631466],"about_ca_topic_score_codex":0.0000743947,"about_ca_topic_score_gemma":0.0003780914,"teacher_disagreement_score":0.5751581,"about_ca_system_score_codex":0.0002807165,"about_ca_system_score_gemma":0.00011298294,"threshold_uncertainty_score":0.9999664},"labels":[],"label_agreement":null},{"id":"W2099361733","doi":"","title":"PPDN — A Framework for Peer-to-peer Collaborative Research Network","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Peer-to-peer; Collaborative network; Graph; World Wide Web; Distributed computing; Knowledge management; Theoretical computer science","score_opus":0.06654990809779329,"score_gpt":0.3880552241299136,"score_spread":0.3215053160321203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099361733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026265553,0.000117948905,0.82004046,0.16820143,0.0007885755,0.001624091,0.000013283731,0.0013040976,0.0052835536],"genre_scores_gemma":[0.11589505,0.0000068528375,0.8729825,0.003400014,0.0005510687,0.0007468411,0.000004889351,0.00003867198,0.0063741277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99433,0.00011721699,0.00041968178,0.0011948538,0.0019539085,0.001984354],"domain_scores_gemma":[0.9930175,0.0011654635,0.00007157047,0.0018928772,0.0034271409,0.0004254709],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036417022,0.0003366453,0.00041659366,0.00047244542,0.0006941547,0.000726942,0.0038752148,0.0003865071,0.00002269851],"category_scores_gemma":[0.004179232,0.0003038225,0.00010213136,0.0077769514,0.0001709993,0.0004280894,0.0021646372,0.0007698513,0.0007843956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030755706,0.000053807235,0.00005519223,0.0000051993266,0.00002502122,0.000015295727,0.0010609047,0.0126372725,0.000046528286,0.68070114,0.29359606,0.011772807],"study_design_scores_gemma":[0.00044988355,0.0008633876,0.00034166643,0.00011002526,0.0000044989392,0.000006701157,0.00048759638,0.0015120117,0.0031785788,0.63062114,0.36193755,0.0004869557],"about_ca_topic_score_codex":0.000063982254,"about_ca_topic_score_gemma":0.00023136887,"teacher_disagreement_score":0.16480142,"about_ca_system_score_codex":0.0004032989,"about_ca_system_score_gemma":0.00050590665,"threshold_uncertainty_score":0.9999936},"labels":[],"label_agreement":null},{"id":"W2099650694","doi":"10.1109/isspa.2010.5605426","title":"A fault tolerance procedure for P2P online games","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Fault tolerance; Computer network; Distributed computing; Overlay network; Overlay; Node (physics); Routing (electronic design automation); Scope (computer science); Peer-to-peer; Overlay multicast; Pragmatic General Multicast; Protocol Independent Multicast; The Internet; Operating system","score_opus":0.0129380213357993,"score_gpt":0.2686986444776939,"score_spread":0.2557606231418946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099650694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30919498,0.00006852968,0.64750093,0.037197847,0.000875691,0.00072134763,0.000013847725,0.0026173869,0.0018094174],"genre_scores_gemma":[0.4069845,0.0000020477287,0.5876505,0.0018354033,0.00013569056,0.00009511071,0.0000023682444,0.000008855619,0.0032855389],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885905,0.0000040783475,0.00015784957,0.00043735068,0.00017565305,0.00036601376],"domain_scores_gemma":[0.9989136,0.00007015435,0.000041852003,0.00075829687,0.00013950211,0.00007661769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012072006,0.00013894806,0.00015166997,0.00008853532,0.000071884126,0.0001149603,0.0016608916,0.000117897835,0.00000916086],"category_scores_gemma":[0.00024613045,0.00011184908,0.00005042253,0.0004294563,0.00004271303,0.00024853993,0.00035104138,0.00021332188,0.000042892658],"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.000019211373,0.00027143228,0.0011765077,0.000054685934,0.000022743101,0.000010126142,0.00047299825,0.0006376089,0.028587326,0.19434004,0.2754354,0.49897194],"study_design_scores_gemma":[0.000830692,0.00038437673,0.00670781,0.000050231338,0.000007432851,0.0000642464,0.00008667058,0.31427082,0.05197801,0.03740292,0.5873814,0.0008353483],"about_ca_topic_score_codex":0.000009199854,"about_ca_topic_score_gemma":0.00046690548,"teacher_disagreement_score":0.4981366,"about_ca_system_score_codex":0.000010905136,"about_ca_system_score_gemma":0.00005962154,"threshold_uncertainty_score":0.45610732},"labels":[],"label_agreement":null},{"id":"W2099883026","doi":"10.1109/mic.2010.57","title":"A Survey of First-Person Shooter Gaming Traffic on the Internet","year":2010,"lang":"en","type":"article","venue":"IEEE Internet Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"The Internet; Computer science; Internet traffic; Order (exchange); Measure (data warehouse); Internet privacy; World Wide Web; Business; Data mining","score_opus":0.03978988050488683,"score_gpt":0.25701888342813917,"score_spread":0.21722900292325234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099883026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85850185,0.000018571765,0.1366855,0.0014819694,0.0020312574,0.00020967839,0.0000025083305,0.0004560641,0.0006126213],"genre_scores_gemma":[0.99157864,4.7417544e-7,0.0074989796,0.0004996845,0.00012687135,0.000007155895,0.0000015335384,0.0000242811,0.00026238564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787015,0.00013827784,0.00043233603,0.00062536093,0.0004033214,0.0005305419],"domain_scores_gemma":[0.997119,0.0013225441,0.00023112584,0.0010715796,0.0001726182,0.000083123756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014457435,0.0002862042,0.00032717132,0.00023738886,0.000071095965,0.00023887069,0.003581122,0.00015044674,0.000019879903],"category_scores_gemma":[0.0005635862,0.00021528988,0.00011037868,0.0006483809,0.00013673677,0.00013374981,0.0006409483,0.000818317,0.00011261911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011882896,0.00056763855,0.054122426,0.000098017,0.00036656586,0.00014313543,0.026502972,0.031886335,0.0052382518,0.013341075,0.1597348,0.70787996],"study_design_scores_gemma":[0.000199646,0.00025323872,0.029254895,0.00026077768,0.0000048508637,0.000029361097,0.00006494771,0.95374084,0.014125619,0.00005440382,0.0016699783,0.0003414583],"about_ca_topic_score_codex":0.00059450575,"about_ca_topic_score_gemma":0.001796339,"teacher_disagreement_score":0.9218545,"about_ca_system_score_codex":0.000050260616,"about_ca_system_score_gemma":0.000026597407,"threshold_uncertainty_score":0.87792665},"labels":[],"label_agreement":null},{"id":"W2100110129","doi":"10.1109/icc.2009.5198768","title":"Atomic Distributed Semaphores for Accessing Networked Data","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Distributed computing; Overlay network; Hash table; Testbed; Computer network; Distributed hash table; Fault tolerance; Consistency (knowledge bases); Overlay; Pastry; Load balancing (electrical power); Replication (statistics); Data consistency; Distributed database; Distributed data store; Atomicity; Node (physics); Hash function; Peer-to-peer; Database; Operating system; Computer security; Database transaction","score_opus":0.055574818272267214,"score_gpt":0.320185215528576,"score_spread":0.26461039725630875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100110129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011366479,0.00016994977,0.9716808,0.014058848,0.00025407076,0.00031630974,0.00003579598,0.0016702564,0.0004474434],"genre_scores_gemma":[0.6557411,0.000008548192,0.34280416,0.0010798103,0.00011129439,0.0000117256,0.00010632825,0.0000067779238,0.00013022486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983398,0.000018700472,0.00024190031,0.00066999317,0.00019671457,0.00053292274],"domain_scores_gemma":[0.99744934,0.00013952375,0.00007000292,0.002178913,0.00006851153,0.000093704715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035618615,0.00016914365,0.00020530132,0.00010142564,0.00016946935,0.00046575064,0.0053167734,0.00009464863,0.000003960098],"category_scores_gemma":[0.00015640323,0.00014395511,0.0000392929,0.00082050974,0.000026062344,0.00082514266,0.0014502803,0.00010829237,0.000021761067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015519909,0.00004906193,0.00028757603,0.000004914958,0.000019653235,0.0000090031535,0.000044334884,0.0013830987,0.0004288307,0.043674216,0.44373706,0.5103467],"study_design_scores_gemma":[0.00037349807,0.000112854395,0.004132783,0.00003596597,0.000010003348,0.000011269207,0.000018907465,0.8538524,0.00194431,0.044878427,0.09422922,0.0004003482],"about_ca_topic_score_codex":0.000009576195,"about_ca_topic_score_gemma":0.00003271058,"teacher_disagreement_score":0.8524693,"about_ca_system_score_codex":0.000045921428,"about_ca_system_score_gemma":0.00004954686,"threshold_uncertainty_score":0.98799765},"labels":[],"label_agreement":null},{"id":"W2100653413","doi":"10.1109/iccgi.2007.1","title":"A Fully Distributed Mechanism for Locating Mobile Agents","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Distributed computing; Mobile agent; Reuse; Distributed hash table; Protocol (science); Mobile computing; Peer-to-peer; Mechanism (biology); Computer network; Hash function; Computer security; Database","score_opus":0.021369553103567463,"score_gpt":0.2830796994744025,"score_spread":0.261710146370835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100653413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02301687,0.000012512635,0.9730325,0.0009888454,0.0002788862,0.00052614504,0.0000072138732,0.0013257297,0.00081132463],"genre_scores_gemma":[0.6287877,7.4897497e-7,0.37005764,0.0006264628,0.000035312714,0.00009751031,0.0000058517053,0.0000075104003,0.00038129286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986178,0.0000072065473,0.00023034438,0.00038879892,0.00021778618,0.00053803256],"domain_scores_gemma":[0.9989378,0.00013004028,0.000058628848,0.0006103615,0.00016316517,0.000100020785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049893756,0.00013095669,0.00013318045,0.000111747366,0.00012314104,0.00010317097,0.0012734581,0.00008825008,0.000006750578],"category_scores_gemma":[0.0001660375,0.000119156255,0.000051984414,0.00064598105,0.000018207722,0.00017285775,0.00053777295,0.00008198977,0.00006140603],"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.00001094282,0.000094521965,0.00015614055,0.00001777234,0.000028842198,0.000025739131,0.00026863726,0.00059510866,0.0042931065,0.7023839,0.031241963,0.26088333],"study_design_scores_gemma":[0.0013607263,0.0012045966,0.0014856514,0.00007334662,0.000019333875,0.000053018495,0.0007478649,0.3763853,0.33688626,0.21591513,0.064564385,0.0013043808],"about_ca_topic_score_codex":0.00001839064,"about_ca_topic_score_gemma":0.000043195167,"teacher_disagreement_score":0.6057708,"about_ca_system_score_codex":0.000079497666,"about_ca_system_score_gemma":0.000025754625,"threshold_uncertainty_score":0.4859051},"labels":[],"label_agreement":null},{"id":"W2101014048","doi":"10.1109/grid.2005.1542756","title":"Semantic overlay network for grid resource discovery","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Semantic grid; RDF; Scalability; Overlay network; RDF query language; Metadata; Information retrieval; Flooding (psychology); Grid; Semantics (computer science); Query optimization; Resource (disambiguation); Distributed computing; Database; Computer network; Semantic Web; Web search query; World Wide Web; Web query classification; Search engine; The Internet","score_opus":0.012641470667979327,"score_gpt":0.24002596946940283,"score_spread":0.2273844988014235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101014048","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005517178,0.0002158886,0.96121097,0.024541935,0.00045650042,0.0003957442,0.0000041260837,0.001460306,0.0061973813],"genre_scores_gemma":[0.28881082,0.000012259012,0.68806523,0.006443205,0.0016738842,0.00010323542,0.0000067789388,0.000028284716,0.014856316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829626,0.000020957652,0.00024059138,0.0005233397,0.00025587704,0.00066296395],"domain_scores_gemma":[0.99855787,0.00023603276,0.000059372254,0.0010211953,0.000039196162,0.00008633089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035055593,0.00018173082,0.00020690155,0.00009209188,0.00015259239,0.0003075362,0.001660248,0.00009441089,0.00001111668],"category_scores_gemma":[0.0000837237,0.00015419793,0.000097960976,0.0006066749,0.00003948443,0.0006068579,0.0007435784,0.00012570737,0.00016727742],"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.000008765877,0.000028648114,0.0003302789,0.0000059870695,0.000016120453,0.000003623815,0.00006484293,0.022336155,0.00006358828,0.08922101,0.8241392,0.06378178],"study_design_scores_gemma":[0.00024437773,0.000121602076,0.0009999692,0.000029323548,0.000006474069,0.000012938582,0.000015310787,0.085572705,0.0011597039,0.0070905737,0.9044132,0.0003337896],"about_ca_topic_score_codex":0.000011578885,"about_ca_topic_score_gemma":0.00009667579,"teacher_disagreement_score":0.28329363,"about_ca_system_score_codex":0.00006611257,"about_ca_system_score_gemma":0.00003155317,"threshold_uncertainty_score":0.6288009},"labels":[],"label_agreement":null},{"id":"W2101201598","doi":"10.1109/icpads.2009.119","title":"A Diffusive Load Balancing Scheme for Clustered Peer-to-Peer Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Load balancing (electrical power); Distributed computing; Peer-to-peer; Node (physics); Scheme (mathematics); Cluster analysis; Reliability (semiconductor); Load management; Service (business); Computer network; Engineering","score_opus":0.01803077558680245,"score_gpt":0.2711876379820838,"score_spread":0.25315686239528135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101201598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017404135,0.000108354005,0.923994,0.049008895,0.0008602146,0.0012977438,0.000013623938,0.0020496703,0.005263339],"genre_scores_gemma":[0.71102625,0.000001381464,0.26420683,0.0036471635,0.00023782556,0.0001595048,0.0000060827983,0.000022131642,0.020692822],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966192,0.00002343075,0.00044377075,0.0008869553,0.0011070068,0.0009196103],"domain_scores_gemma":[0.99698305,0.00017045368,0.00010877602,0.0013821707,0.0010771878,0.00027837142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006907975,0.00033775382,0.00043560736,0.0002807089,0.00018368286,0.0007581021,0.0024153017,0.00019731543,0.0000050715907],"category_scores_gemma":[0.0009552411,0.00029746577,0.00012223114,0.0011178718,0.00002590732,0.0004949876,0.00066535064,0.00020202635,0.00030217698],"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.00007389845,0.00021632868,0.00047527906,0.00006147559,0.000081024715,0.00005695833,0.002037469,0.0032873335,0.010170523,0.12461023,0.73637104,0.122558445],"study_design_scores_gemma":[0.0022717733,0.0015219332,0.0029323727,0.00028336153,0.00002253849,0.00011392841,0.0007110807,0.5407418,0.005335108,0.0074452492,0.4368009,0.0018199661],"about_ca_topic_score_codex":0.00004285114,"about_ca_topic_score_gemma":0.000024735178,"teacher_disagreement_score":0.6936221,"about_ca_system_score_codex":0.00031800845,"about_ca_system_score_gemma":0.000119016884,"threshold_uncertainty_score":0.9999477},"labels":[],"label_agreement":null},{"id":"W2101221497","doi":"10.1109/ptp.2003.1231516","title":"The costs of using JXTA","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Computer network; Throughput; Benchmarking; Limiting; Java; Cache; Byte; Overhead (engineering); Distributed computing; Latency (audio); Operating system; Wireless; Telecommunications","score_opus":0.021867241463125613,"score_gpt":0.2644268455506199,"score_spread":0.2425596040874943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101221497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12745106,0.00009649634,0.8613839,0.00622295,0.00019452335,0.000091032554,2.2622211e-7,0.00032869462,0.0042310916],"genre_scores_gemma":[0.8074796,0.0000047773383,0.19221371,0.00018259606,0.000010248619,0.0000016275558,3.3495546e-8,0.0000022513793,0.00010512369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994413,0.0000074526033,0.000101333935,0.00012702716,0.00015265634,0.00017020572],"domain_scores_gemma":[0.9992799,0.000051773248,0.000030498411,0.00056913856,0.00004549832,0.000023190103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015363122,0.000049795795,0.000059339014,0.000038364014,0.000078653684,0.000052695566,0.0011774137,0.000028168772,9.1941774e-7],"category_scores_gemma":[0.000054255048,0.00003140973,0.00002069306,0.00041902543,0.0000534445,0.000103381695,0.00048490285,0.000051592157,0.000019381394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014774143,0.00001734898,0.00027949217,0.000001155735,0.000008087299,0.0000049324294,0.00010736573,0.006087884,0.0031853612,0.874865,0.0014911365,0.11395076],"study_design_scores_gemma":[0.0014487801,0.0004699992,0.00865432,0.0002226229,0.0000163921,0.00013685312,0.00050792604,0.13346076,0.39205983,0.41603106,0.0459207,0.0010707524],"about_ca_topic_score_codex":0.000103570106,"about_ca_topic_score_gemma":0.00006700911,"teacher_disagreement_score":0.68002856,"about_ca_system_score_codex":0.000057418973,"about_ca_system_score_gemma":0.000039535316,"threshold_uncertainty_score":0.21879472},"labels":[],"label_agreement":null},{"id":"W2101737843","doi":"10.1007/978-3-540-88313-5_30","title":"Structured Peer-to-Peer Overlay Networks: Ideal Botnets Command and Control Infrastructures?","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; École de Technologie Supérieure; University of Victoria; Polytechnique Montréal","funders":"","keywords":"Computer science; Botnet; Overlay network; Overlay; Resilience (materials science); Peer-to-peer; The Internet; Command and control; Computer network; Distributed computing; Network topology; Node (physics); Computer security; World Wide Web; Telecommunications; Engineering","score_opus":0.009577313000847259,"score_gpt":0.23135061119489034,"score_spread":0.22177329819404307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101737843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007364261,0.0011740478,0.983613,0.008306205,0.00305113,0.0012929378,0.000043563265,0.0007774422,0.0010052096],"genre_scores_gemma":[0.55841476,0.00008770584,0.4303621,0.009461595,0.0009816943,0.00003567096,0.000016250882,0.000099802324,0.00054042233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99104404,0.00008078049,0.0010036285,0.0030838065,0.0029502988,0.0018374285],"domain_scores_gemma":[0.9940258,0.0008678404,0.0004559078,0.0029629539,0.00094173907,0.00074570917],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0012439964,0.0013665985,0.0014357468,0.0017684303,0.0006634001,0.0012992112,0.0070136497,0.0010216454,0.000019096535],"category_scores_gemma":[0.00058497605,0.0012520452,0.00018971456,0.0015642549,0.001378103,0.0007260232,0.0043400656,0.0021693215,0.00003150233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054052227,0.000020868772,0.00052977103,0.000029135383,0.000067097615,0.00043042263,0.0013901241,0.36699986,0.0001398895,0.0061138743,0.011037118,0.6131878],"study_design_scores_gemma":[0.0024226157,0.0012535376,0.017638661,0.0007685911,0.000055144727,0.0014406585,0.0000010730797,0.7327255,0.0006138342,0.14589128,0.09289508,0.0042940034],"about_ca_topic_score_codex":0.00007094977,"about_ca_topic_score_gemma":0.00034984187,"teacher_disagreement_score":0.60889375,"about_ca_system_score_codex":0.000488917,"about_ca_system_score_gemma":0.00048310176,"threshold_uncertainty_score":0.9999085},"labels":[],"label_agreement":null},{"id":"W2101842406","doi":"10.1109/vecims.2007.4373946","title":"Supporting Large-Scale Networked Virtual Environments","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay network; Distributed computing; Routing (electronic design automation); Scale (ratio); Set (abstract data type); Class (philosophy); Heuristic; Greedy algorithm; Overlay; Table (database); Object (grammar); Routing table; Dissemination; Computer network; Human–computer interaction; Artificial intelligence; Routing protocol; Data mining; World Wide Web; Algorithm; The Internet","score_opus":0.008978208369794464,"score_gpt":0.25871408579607735,"score_spread":0.2497358774262829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101842406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058295075,0.000026467584,0.9309312,0.0010460645,0.00037841938,0.00015139415,7.9379095e-7,0.0008744961,0.00829605],"genre_scores_gemma":[0.77948123,0.000003989536,0.2040526,0.0017251285,0.00013788631,0.0000083414825,0.0000027968865,0.000014750168,0.014573257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99771595,0.000018922261,0.00034947885,0.0005074685,0.00039557356,0.0010126063],"domain_scores_gemma":[0.9988035,0.000094306175,0.00008803505,0.0008291707,0.0000129350865,0.00017208482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011420908,0.00017090677,0.00016735597,0.00013424864,0.00014212339,0.0000876208,0.0014735243,0.00011890831,0.000055769022],"category_scores_gemma":[0.000049821676,0.00015828515,0.00005647032,0.0005558827,0.00004112475,0.00030992716,0.0012314725,0.00019053918,0.00052165554],"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.00002565798,0.00035796862,0.03019175,0.000004796049,0.000057855177,0.00025232093,0.0016888938,0.004432147,0.005471479,0.12803258,0.11061428,0.7188703],"study_design_scores_gemma":[0.00078405585,0.00038145695,0.026267944,0.000023355407,0.0000091104075,0.00004027886,0.0006347592,0.06592158,0.02429349,0.004320603,0.8763909,0.0009325012],"about_ca_topic_score_codex":0.0000067673614,"about_ca_topic_score_gemma":0.000059946924,"teacher_disagreement_score":0.7657766,"about_ca_system_score_codex":0.00007164217,"about_ca_system_score_gemma":0.000014369473,"threshold_uncertainty_score":0.67050004},"labels":[],"label_agreement":null},{"id":"W2102015928","doi":"10.1109/aina.2004.1283924","title":"An efficient clustered architecture for P2P networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Distributed computing; Flooding (psychology); Computer network; Peer-to-peer; Overlay network; Fault tolerance; Architecture; Routing protocol; Network topology; Anonymity; Load balancing (electrical power); Routing (electronic design automation); Computer security; The Internet","score_opus":0.01102776144974391,"score_gpt":0.25146980422932247,"score_spread":0.24044204277957856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102015928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01871243,0.000051983112,0.97027594,0.0077933804,0.00040063652,0.0005272648,0.0000017905107,0.0016562312,0.0005803635],"genre_scores_gemma":[0.5613789,7.806968e-7,0.43713912,0.0012461762,0.000086584885,0.00005110704,0.000002506154,0.000010033473,0.00008480348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984739,0.00001731591,0.00018812624,0.00055483455,0.00020673606,0.000559126],"domain_scores_gemma":[0.99856234,0.00006477764,0.000043341235,0.001114398,0.00006927016,0.0001458609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002301912,0.00018046977,0.00016975975,0.00014824733,0.00013895515,0.0001849285,0.0019353114,0.00013001294,0.000002747392],"category_scores_gemma":[0.00003988085,0.00014725764,0.00007109656,0.00057628716,0.000044730445,0.000100333884,0.00041489283,0.0001637364,0.0000214974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008114583,0.000054745607,0.000011648539,0.0000027180338,0.00000603799,0.000004179983,0.00017561912,0.8865312,0.00011447585,0.042036984,0.0015891071,0.069465205],"study_design_scores_gemma":[0.00093682867,0.0006611516,0.00060179096,0.000029786303,0.000006127226,0.00003258857,0.000039772658,0.9552462,0.002740059,0.028066438,0.01115335,0.00048588842],"about_ca_topic_score_codex":0.000019409783,"about_ca_topic_score_gemma":0.00010890601,"teacher_disagreement_score":0.54266644,"about_ca_system_score_codex":0.00007333137,"about_ca_system_score_gemma":0.000042674445,"threshold_uncertainty_score":0.6004992},"labels":[],"label_agreement":null},{"id":"W2102773241","doi":"10.1145/1266894.1266927","title":"Modelling performance optimizations for content-based publish/subscribe","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Scalability; Publication; Matching (statistics); Abstraction; Distributed computing; Scale (ratio); Database","score_opus":0.08653118873146938,"score_gpt":0.25657758908842027,"score_spread":0.1700464003569509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102773241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008383834,0.000030418485,0.98245907,0.0042612716,0.00030064618,0.0003884934,0.0000022786967,0.0012811568,0.0028928558],"genre_scores_gemma":[0.34353757,0.0000022112429,0.65470237,0.00087437156,0.000028146856,0.000039677554,0.0000050355143,0.000008367359,0.00080224796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986343,0.0000057688876,0.00025817403,0.00036637994,0.00022374478,0.00051167636],"domain_scores_gemma":[0.9987391,0.0001447627,0.000055299704,0.0006339511,0.0003210162,0.00010582964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054351665,0.00013338412,0.00013283381,0.00027372953,0.0001872549,0.00026109422,0.001286807,0.00008816015,0.000005668958],"category_scores_gemma":[0.00008319738,0.00012185504,0.00005575995,0.0007951046,0.000035495745,0.0007860268,0.000184221,0.000100375684,0.0000204336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008822663,0.000034595778,0.00024378391,0.0000070041897,0.000007176438,0.0000011814807,0.00004559746,0.91120785,0.00008421448,0.06108015,0.0055333534,0.021746235],"study_design_scores_gemma":[0.0002699607,0.00007757418,0.00005066415,0.000011470319,0.0000030412298,0.0000016511988,0.000035527315,0.98458,0.00820414,0.00044399453,0.006146843,0.00017514285],"about_ca_topic_score_codex":0.000016240283,"about_ca_topic_score_gemma":0.000016295344,"teacher_disagreement_score":0.33515373,"about_ca_system_score_codex":0.000059494596,"about_ca_system_score_gemma":0.00005753346,"threshold_uncertainty_score":0.49691045},"labels":[],"label_agreement":null},{"id":"W2103192406","doi":"10.1109/saint.2009.31","title":"A Subscription Coverage Technique for XML Message Dissemination","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Centres of Excellence","keywords":"Computer science; XML; Computer network; Multicast; Scheme (mathematics); Routing (electronic design automation); Layer (electronics); Table (database); Distributed computing; World Wide Web; Database","score_opus":0.01120916132817975,"score_gpt":0.2735166269117974,"score_spread":0.26230746558361767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103192406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026833045,0.00002613205,0.98274124,0.007367663,0.000113031536,0.00071231154,0.0000022618608,0.0012837712,0.0050703166],"genre_scores_gemma":[0.7454561,0.0000063932152,0.25220072,0.00055723026,0.000024704099,0.00015455861,0.0000049915266,0.0000046453115,0.0015906786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905163,0.000013919617,0.00015862181,0.00033333083,0.00018285781,0.00025961077],"domain_scores_gemma":[0.999242,0.000062420106,0.00004745033,0.0005131464,0.00008896095,0.00004600222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032026818,0.000117197575,0.00011675095,0.00017701434,0.00008269279,0.00013389795,0.00080308923,0.00010334683,0.0000047046565],"category_scores_gemma":[0.00011826011,0.000106606705,0.00004824871,0.0005231187,0.000012316723,0.0004814995,0.00010494956,0.000078556695,0.00001690865],"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.0000102620625,0.00008640964,0.000050712297,0.000007730695,0.0000048580787,0.00000617239,0.00015454747,0.00006663555,0.16174354,0.43985808,0.06873396,0.3292771],"study_design_scores_gemma":[0.00037351908,0.00085866614,0.008858839,0.00008723072,0.000008876532,0.00003186766,0.00002983838,0.028687399,0.63302565,0.29048586,0.036888506,0.0006637282],"about_ca_topic_score_codex":0.0000028148754,"about_ca_topic_score_gemma":0.000005329678,"teacher_disagreement_score":0.74277276,"about_ca_system_score_codex":0.00007476996,"about_ca_system_score_gemma":0.0000144780215,"threshold_uncertainty_score":0.43472952},"labels":[],"label_agreement":null},{"id":"W2103279418","doi":"10.1109/percom.2008.68","title":"Distributed Video Adaptation and Streaming for Heterogeneous Devices","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Adaptation (eye); Communication source; Overlay; Distributed computing; Context (archaeology); Peer-to-peer; Live streaming; Overlay network; Mobile device; Incentive; Multimedia; Computer network; World Wide Web; The Internet","score_opus":0.03712310797336707,"score_gpt":0.24566771212038335,"score_spread":0.20854460414701628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103279418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21998124,0.00011392045,0.7781217,0.001030022,0.000052812487,0.00015479577,0.0000060956686,0.00048207224,0.0000573093],"genre_scores_gemma":[0.7785243,0.000010471093,0.2211863,0.00016980276,0.000014735359,0.000029039396,0.0000058625947,0.0000037233845,0.00005579704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992805,0.000008478065,0.00012012991,0.00027579645,0.00010867322,0.00020642582],"domain_scores_gemma":[0.99947923,0.0001138008,0.000036081045,0.00025841306,0.000061367056,0.000051097588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000065656095,0.00008962428,0.00009770821,0.00006423164,0.0001430277,0.0000624758,0.00037602778,0.00004591271,9.3669445e-7],"category_scores_gemma":[0.00006312241,0.000079721714,0.000021593518,0.00022629985,0.00003046242,0.00022630756,0.00019436276,0.000033239055,0.00000539121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031095264,0.000104506966,0.008902709,0.000047001908,0.00008480982,0.00008932267,0.0016891115,0.018880848,0.0017157373,0.030181661,0.014138408,0.9241348],"study_design_scores_gemma":[0.0006069224,0.0004391561,0.016739413,0.000030269375,0.000010810594,0.00023224688,0.00016176041,0.93176866,0.01748375,0.0057384283,0.026254911,0.00053368084],"about_ca_topic_score_codex":0.0000298166,"about_ca_topic_score_gemma":0.00012582814,"teacher_disagreement_score":0.9236011,"about_ca_system_score_codex":0.000022236329,"about_ca_system_score_gemma":0.000016798558,"threshold_uncertainty_score":0.3250957},"labels":[],"label_agreement":null},{"id":"W2103660213","doi":"10.1145/1577222.1577228","title":"A scheme for balancing heterogeneous request load in DHT-based P2P systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Load balancing (electrical power); Computer science; Network Load Balancing Services; Round-robin DNS; Scalability; Popularity; Distributed computing; Load distribution; Peer-to-peer; Computer network; Load management; Load sharing; Pastry; Server; Database; The Internet; World Wide Web","score_opus":0.01799929674482617,"score_gpt":0.2684084102847062,"score_spread":0.25040911353988005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103660213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07970992,0.00026953107,0.9155423,0.00097623066,0.0004700102,0.00057223183,0.0000018476098,0.0011476426,0.0013102632],"genre_scores_gemma":[0.7635244,0.0000010047279,0.23560014,0.00052024884,0.00005496256,0.000067922185,0.0000012184076,0.000012179468,0.00021791062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980734,0.00001913784,0.00037648546,0.0005206219,0.00032847226,0.00068188726],"domain_scores_gemma":[0.99863315,0.0002281369,0.00007261662,0.0008299046,0.00013461012,0.00010157956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001171461,0.00017809375,0.0002406612,0.00026872347,0.00006044417,0.00014999615,0.0012049569,0.00014246552,0.0000015495096],"category_scores_gemma":[0.00019801201,0.00016573168,0.000057142373,0.0007258568,0.000027374643,0.00016826109,0.00024265044,0.00012972637,0.00004328139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045020643,0.0011625756,0.063141234,0.0009994793,0.00020145507,0.002516891,0.0015786098,0.1256913,0.103436306,0.31803846,0.0664619,0.31632158],"study_design_scores_gemma":[0.0015350488,0.0005701925,0.0012205992,0.00029974445,0.0000049436344,0.00009158438,0.00008590018,0.88794696,0.069500685,0.0013592101,0.036474504,0.0009106477],"about_ca_topic_score_codex":0.00022056622,"about_ca_topic_score_gemma":0.00071074057,"teacher_disagreement_score":0.76225567,"about_ca_system_score_codex":0.00035427255,"about_ca_system_score_gemma":0.000112740694,"threshold_uncertainty_score":0.6758342},"labels":[],"label_agreement":null},{"id":"W2103989375","doi":"10.1109/icc.2006.254703","title":"Structured Peer-to-Peer Control Plane","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chord (peer-to-peer); Computer science; Scalability; Peer-to-peer; Computer network; Distributed computing; Robustness (evolution); Forwarding plane; Overlay; Implementation; Operating system; Software engineering","score_opus":0.053119662832878965,"score_gpt":0.32023050545049003,"score_spread":0.2671108426176111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103989375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095925005,0.00005211395,0.49089122,0.36097065,0.0017741406,0.00080619287,0.0005338391,0.0013297594,0.13404961],"genre_scores_gemma":[0.9160836,0.000011173324,0.07374022,0.0023963994,0.00015082465,0.00017032807,0.00014404868,0.000018039496,0.0072853756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736595,0.00010724506,0.00047960907,0.00052009756,0.0011156069,0.0004114768],"domain_scores_gemma":[0.99501246,0.0002811115,0.00016790883,0.0029445947,0.0014538858,0.00014006671],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039780914,0.00027904136,0.00025378735,0.00049711764,0.00027251925,0.0004996142,0.008405853,0.00014416616,0.00009435761],"category_scores_gemma":[0.00027284978,0.00028253824,0.00008434554,0.0005828319,0.00013395134,0.0003159931,0.00073903246,0.00047769706,0.0008605095],"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.000022077771,0.00016619389,0.0006642016,0.0000013950985,0.000048239508,0.0000065669783,0.00013173524,0.0035917107,0.0035524487,0.82091296,0.15825208,0.012650399],"study_design_scores_gemma":[0.0016829324,0.00033729532,0.024965348,0.00013769614,0.000026490237,0.0000569087,0.00011385836,0.14924583,0.004912811,0.107736446,0.70952964,0.0012547423],"about_ca_topic_score_codex":0.00043624555,"about_ca_topic_score_gemma":0.0012234468,"teacher_disagreement_score":0.9064911,"about_ca_system_score_codex":0.00020175942,"about_ca_system_score_gemma":0.00013321494,"threshold_uncertainty_score":0.9999627},"labels":[],"label_agreement":null},{"id":"W2104739501","doi":"10.1109/ccece.2007.212","title":"A Peer-to-Peer Collaborative Virtual Environment for E-Commerce","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Purchasing; Emulation; VRML; Scalability; Product (mathematics); World Wide Web; Architecture; Virtual reality; E-commerce; Multimedia; The Internet; Human–computer interaction; Business; Marketing","score_opus":0.016086391998968913,"score_gpt":0.2704783569370059,"score_spread":0.25439196493803695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104739501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009489127,0.00002532806,0.91452324,0.06769564,0.00039196224,0.00096308324,0.000019397072,0.00075750507,0.0061347396],"genre_scores_gemma":[0.22606009,0.0000028057,0.722667,0.005677952,0.00012896447,0.00019119692,0.0000075233697,0.000027544836,0.04523692],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970629,0.000026532862,0.00036014474,0.0007590243,0.00097608607,0.0008153041],"domain_scores_gemma":[0.9977873,0.00038577276,0.00007173528,0.001071953,0.00039068217,0.0002925826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014856358,0.00028337492,0.00028022856,0.00029796065,0.00018562759,0.0001808829,0.0019184761,0.00015469523,0.000033654742],"category_scores_gemma":[0.00047512454,0.00025781844,0.00007495231,0.0010429956,0.000072640636,0.000298843,0.0010346096,0.0001725533,0.00063600356],"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.00006774741,0.00016519331,0.00025359413,0.000003699507,0.000049689752,0.000021332155,0.0024757762,0.0016039019,0.002268651,0.16291487,0.52931434,0.3008612],"study_design_scores_gemma":[0.00045885466,0.00084192725,0.0021597256,0.00000873276,0.000006557997,0.0000061487076,0.0007663425,0.0022737565,0.017070098,0.001859007,0.97408116,0.000467673],"about_ca_topic_score_codex":0.000019091334,"about_ca_topic_score_gemma":0.00008335213,"teacher_disagreement_score":0.44476685,"about_ca_system_score_codex":0.00022626514,"about_ca_system_score_gemma":0.000059529826,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W2105247914","doi":"10.1109/pacrim.2009.5291271","title":"Approaching the limits of fixed-delay broadcasting schemes for Video-on-Demand","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bandwidth (computing); Computer science; Broadcasting (networking); Upper and lower bounds; Computer network; Bandwidth allocation; Upload; Fixed point; Real-time computing; Mathematical optimization; Mathematics","score_opus":0.04026847636786779,"score_gpt":0.28392224325399923,"score_spread":0.24365376688613144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105247914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041659296,0.00015727295,0.94086605,0.009484209,0.00012458497,0.0004215559,0.0000012147125,0.0005700259,0.0067157736],"genre_scores_gemma":[0.7407398,0.0000022740496,0.25755697,0.001412352,0.000053886604,0.000021279197,3.9044065e-7,0.0000058810906,0.00020712032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986936,0.000027529528,0.00026147123,0.00037939637,0.00026044837,0.00037759775],"domain_scores_gemma":[0.99850625,0.0004809036,0.00010946326,0.0007780826,0.0000783324,0.00004695777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062953576,0.00015629259,0.0001931238,0.000116521594,0.00018683381,0.000114625494,0.0016686645,0.00006413919,0.0000012926224],"category_scores_gemma":[0.00047491238,0.00010084762,0.00008199867,0.00048123946,0.000042403626,0.00022291373,0.00024112154,0.00016639993,0.000008205248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016553076,0.00007569252,0.00016862246,0.000014825023,0.000025531173,0.0000031449008,0.00048997975,0.0041683107,0.0032298074,0.34404716,0.013622723,0.63413763],"study_design_scores_gemma":[0.0010913896,0.0016650996,0.0018438793,0.00025582532,0.000027986427,0.000059350474,0.00032268063,0.69099957,0.16793562,0.075481236,0.05939282,0.00092453987],"about_ca_topic_score_codex":0.0000037073899,"about_ca_topic_score_gemma":0.000002393165,"teacher_disagreement_score":0.6990805,"about_ca_system_score_codex":0.000020560343,"about_ca_system_score_gemma":0.000026273638,"threshold_uncertainty_score":0.41124466},"labels":[],"label_agreement":null},{"id":"W2105729709","doi":"10.1109/icmcs.2012.6320162","title":"Service specific overlay composition and reconfiguration","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Overlay; Computer science; Chord (peer-to-peer); Overlay network; Computer network; Quality of service; Distributed computing; Control reconfiguration; Limiting; Service (business); Node (physics); Bounded function; Network topology; Embedded system; Operating system; Engineering","score_opus":0.02271080765636071,"score_gpt":0.23408339614860324,"score_spread":0.21137258849224252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105729709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2591156,0.00032092695,0.7030967,0.018897684,0.0005817504,0.00021523441,0.0000010909301,0.0010942388,0.016676765],"genre_scores_gemma":[0.8945526,0.000017483157,0.10369094,0.0015301794,0.00007785764,0.0000075959865,0.000002625725,0.000003656306,0.00011709456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993943,0.000017885814,0.00009841871,0.00017064351,0.000114092414,0.00020463382],"domain_scores_gemma":[0.9995189,0.000035719804,0.00002732649,0.0003180259,0.00004354191,0.00005652166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001507328,0.00007423761,0.00006985869,0.00007264748,0.00006481341,0.00011116143,0.00028914926,0.00004981765,0.000019162142],"category_scores_gemma":[0.000004194154,0.000067617875,0.000009595566,0.00033025673,0.0000107057,0.00073018397,0.00016216582,0.000060101265,0.00022437418],"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.0000101609585,0.00010549186,0.0030475957,0.000018079376,0.000015778789,0.0000030747792,0.001482809,0.00010018311,0.06998439,0.36444464,0.11032176,0.45046604],"study_design_scores_gemma":[0.00091728964,0.000258481,0.24375962,0.00009829577,0.000013479037,0.00027702798,0.0004276427,0.04558285,0.1916502,0.011518045,0.50403666,0.0014604236],"about_ca_topic_score_codex":0.000016403668,"about_ca_topic_score_gemma":0.000013100508,"teacher_disagreement_score":0.63543695,"about_ca_system_score_codex":0.000027335158,"about_ca_system_score_gemma":0.000004409829,"threshold_uncertainty_score":0.28839508},"labels":[],"label_agreement":null},{"id":"W2105802050","doi":"10.1109/glocom.2008.ecp.103","title":"Adaptive Multicast Tree Construction for Elastic Data Streams","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Multicast; Computer science; Computer network; Pragmatic General Multicast; Protocol Independent Multicast; Source-specific multicast; Xcast; IP multicast; Tree (set theory); Distributed computing; Server; Multicast address; Distance Vector Multicast Routing Protocol; Quality of service; Overlay multicast; Overlay network; The Internet","score_opus":0.09178307478414847,"score_gpt":0.28082932673366123,"score_spread":0.18904625194951274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105802050","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00918504,0.000020651945,0.98639446,0.0012204833,0.0003380585,0.00030734355,0.000029549108,0.0008539943,0.0016504321],"genre_scores_gemma":[0.3991578,0.000004571784,0.6004068,0.00007986153,0.000045514305,0.000021624764,0.000009286932,0.000005462792,0.00026908747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877363,0.000013380075,0.00016990355,0.0005520224,0.00018468182,0.0003063605],"domain_scores_gemma":[0.9982269,0.00022596387,0.000047916663,0.0013340997,0.00009225242,0.00007291021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010049711,0.00013000568,0.00014759353,0.00010972981,0.00014393688,0.000044999975,0.0018693696,0.00007016221,0.0000051888283],"category_scores_gemma":[0.00021833077,0.00011293639,0.000027416654,0.00037010043,0.00014447706,0.00050185324,0.0009769836,0.00008696864,0.00007257437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029265646,0.000089504065,0.00074730057,0.000005194171,0.000048870254,0.00002492704,0.0001967152,0.0006357457,0.00038367632,0.09684714,0.04638619,0.8546055],"study_design_scores_gemma":[0.00067413936,0.0003760887,0.002168188,0.000017290044,0.000012540392,0.00020696601,0.00018422515,0.9789152,0.002555785,0.005055061,0.0094800675,0.00035444688],"about_ca_topic_score_codex":0.00002680635,"about_ca_topic_score_gemma":0.00009295214,"teacher_disagreement_score":0.9782795,"about_ca_system_score_codex":0.000038121634,"about_ca_system_score_gemma":0.000057371984,"threshold_uncertainty_score":0.46054122},"labels":[],"label_agreement":null},{"id":"W2106327888","doi":"10.1145/2484239.2484282","title":"Brief announcement","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overlay; Computer science; Scalability; Overlay network; Parameterized complexity; Fault tolerance; Distributed computing; Computer network; Theoretical computer science; Algorithm; World Wide Web; Programming language; Operating system; The Internet","score_opus":0.010480708746382307,"score_gpt":0.21424709288400828,"score_spread":0.203766384137626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106327888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016448345,0.000037455822,0.88682204,0.03144524,0.0002845988,0.00026149853,3.043741e-7,0.0016674886,0.06303303],"genre_scores_gemma":[0.5890978,0.000004273981,0.39685637,0.0049929,0.000040349805,0.000086842105,5.946803e-7,0.000004975456,0.008915867],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917173,0.000007500198,0.00010311955,0.00025091594,0.0001972635,0.00026946058],"domain_scores_gemma":[0.99916077,0.000019838992,0.000017223014,0.00066999823,0.00006743328,0.00006476132],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000084648025,0.00007661999,0.000071809685,0.00006607789,0.00004375247,0.00018467184,0.0011866665,0.000034185163,0.000119866636],"category_scores_gemma":[0.000023672532,0.0000615692,0.000019385669,0.00037673482,0.000020506608,0.00034700937,0.00066173536,0.000057463436,0.0022656387],"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":[2.2267587e-7,0.00002387657,0.00050792063,0.0000012692317,0.0000059003564,0.000003463538,0.000080681995,0.000066147244,0.0010086608,0.16853116,0.58663267,0.24313805],"study_design_scores_gemma":[0.0002694082,0.00026179175,0.01922959,0.0000144365695,0.000001910407,0.00001615218,0.000063075735,0.041078,0.01007508,0.061274312,0.86718804,0.000528174],"about_ca_topic_score_codex":0.00012746276,"about_ca_topic_score_gemma":0.000011473645,"teacher_disagreement_score":0.5726495,"about_ca_system_score_codex":0.000030954387,"about_ca_system_score_gemma":0.00001545354,"threshold_uncertainty_score":0.9985112},"labels":[],"label_agreement":null},{"id":"W2106722388","doi":"10.1109/cnsr.2011.13","title":"A Peer-to-Peer Model for XML Publish/Subscribe Services","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Centres of Excellence","keywords":"Computer science; Multicast; Computer network; Efficient XML Interchange; XML Signature; Distributed computing; Streaming XML; Source-specific multicast; IP multicast; Xcast; XML Encryption; XML; World Wide Web","score_opus":0.059357999389417805,"score_gpt":0.2631129485435706,"score_spread":0.2037549491541528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106722388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007518481,0.00002746255,0.9244184,0.03757005,0.0005400487,0.00071667344,0.000018259021,0.0025468057,0.026643837],"genre_scores_gemma":[0.29451028,0.0000010728851,0.66520685,0.0057994793,0.000067788176,0.00028667654,0.0000068576182,0.00002893115,0.034092102],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968098,0.000018326444,0.00037074272,0.00095537445,0.00091060466,0.000935172],"domain_scores_gemma":[0.9965213,0.00006644225,0.00008364678,0.0017527036,0.0012464154,0.00032952626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084472616,0.00032782598,0.0003183296,0.00042279245,0.00016749997,0.00057927944,0.0049536033,0.00021060408,0.00003363143],"category_scores_gemma":[0.00023210984,0.00028563742,0.00012639939,0.0011098519,0.000040569987,0.0015513728,0.0018179143,0.0001931559,0.0003553588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039660346,0.00019136842,0.0004989271,0.000045722376,0.000060013943,0.000011857936,0.008191919,0.002265576,0.00038682867,0.33431336,0.59325236,0.06074243],"study_design_scores_gemma":[0.00037269053,0.00023108468,0.0005516105,0.00002348504,0.000012733382,0.000010459251,0.00026706816,0.8271251,0.0037516884,0.071214445,0.095792085,0.0006475977],"about_ca_topic_score_codex":0.00018898466,"about_ca_topic_score_gemma":0.0004893844,"teacher_disagreement_score":0.8248595,"about_ca_system_score_codex":0.0000688031,"about_ca_system_score_gemma":0.00008845011,"threshold_uncertainty_score":0.9999596},"labels":[],"label_agreement":null},{"id":"W2107184547","doi":"10.1007/978-3-642-05148-7_14","title":"Efficient Hierarchical Quorums in Unstructured Peer-to-Peer Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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; Distributed computing; Intersection (aeronautics); Peer-to-peer; Load balancing (electrical power); Theoretical computer science; Computer network","score_opus":0.011264694821669995,"score_gpt":0.24241836309950568,"score_spread":0.23115366827783568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107184547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006932547,0.00030209916,0.96864945,0.023151191,0.0031271635,0.0011738819,0.000008227295,0.0008131273,0.0020815895],"genre_scores_gemma":[0.3408403,0.0000124420285,0.6492606,0.007893633,0.0007947058,0.00003654998,0.000011430392,0.00008208329,0.0010682887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892659,0.00008834215,0.0011697543,0.0036420717,0.0035078332,0.002326056],"domain_scores_gemma":[0.99430066,0.00065532565,0.000303211,0.003416688,0.0006868866,0.0006372286],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0024435513,0.0012413121,0.001274979,0.0033507114,0.0003209477,0.0010298254,0.010534058,0.0010979614,0.000014432218],"category_scores_gemma":[0.00069166225,0.0011580173,0.00024105361,0.00399522,0.00087722763,0.00031480496,0.004745736,0.0031134712,0.000104176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011193332,0.000026939633,0.00003030225,0.000005505464,0.000004995971,0.00018303854,0.00038537217,0.5236127,0.000025776326,0.01215746,0.0002866407,0.46327007],"study_design_scores_gemma":[0.00043358761,0.0004466219,0.0012919831,0.0005508928,0.000007148926,0.00013819581,3.7567068e-7,0.85623133,0.00021341791,0.12833233,0.01083115,0.0015229748],"about_ca_topic_score_codex":0.000039788192,"about_ca_topic_score_gemma":0.0003467505,"teacher_disagreement_score":0.4617471,"about_ca_system_score_codex":0.0010549992,"about_ca_system_score_gemma":0.00063504704,"threshold_uncertainty_score":0.9991864},"labels":[],"label_agreement":null},{"id":"W2107301663","doi":"10.1109/imsaa.2009.5439468","title":"A locality preserving routing overlay using geographic coordinates","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Pastry; Locality; Computer science; Overlay network; Overlay; Distributed computing; Computer network; Routing (electronic design automation); Network topology; Overhead (engineering); Convergence (economics)","score_opus":0.02166633646561679,"score_gpt":0.2701148819199329,"score_spread":0.2484485454543161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107301663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29760107,0.00008046338,0.68903905,0.0067100786,0.0001057014,0.00016528096,4.7404603e-7,0.0017206343,0.004577274],"genre_scores_gemma":[0.8413211,0.0000018867696,0.157449,0.0010846236,0.000027443324,0.0000030179533,2.7683242e-7,0.000005309818,0.00010732133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982881,0.000049593837,0.00025133384,0.00051918277,0.00031054663,0.00058127736],"domain_scores_gemma":[0.99864995,0.00011913362,0.00007341055,0.00095469627,0.00010204175,0.00010079184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755257,0.00018192438,0.00020255306,0.00022194095,0.00019352802,0.00031329598,0.0017608006,0.00010184304,0.000017310866],"category_scores_gemma":[0.00025768738,0.00016454814,0.00007301496,0.0014063144,0.000038406826,0.0005837171,0.0009101263,0.00019460556,0.00001943754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012227387,0.00025487016,0.07337388,0.000025379293,0.00007337847,0.00011756036,0.0005319158,0.012349065,0.017599594,0.7099503,0.013114572,0.17259723],"study_design_scores_gemma":[0.00017856443,0.00012956285,0.034586817,0.00010390542,0.0000070283254,0.000024051657,0.000072916,0.8940919,0.00989555,0.05890287,0.0014606057,0.00054622354],"about_ca_topic_score_codex":0.00023353328,"about_ca_topic_score_gemma":0.000021609216,"teacher_disagreement_score":0.88174284,"about_ca_system_score_codex":0.000057541583,"about_ca_system_score_gemma":0.000030260207,"threshold_uncertainty_score":0.6710078},"labels":[],"label_agreement":null},{"id":"W2107345347","doi":"10.1109/icccn.2007.4317809","title":"Grid Computing on Massively Multi-User Online Platform","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Massively parallel; Grid computing; Scalability; Distributed computing; Flexibility (engineering); Grid; Data-intensive computing; End-user computing; Utility computing; Supercomputer; Architecture; Computer cluster; Cloud computing; Parallel computing; Operating system","score_opus":0.04071652320563771,"score_gpt":0.298007846829855,"score_spread":0.25729132362421725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107345347","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13496359,0.00001604583,0.85639,0.0026274663,0.00070292037,0.00017756433,0.000002884157,0.0018866964,0.0032328442],"genre_scores_gemma":[0.39551842,0.0000017628462,0.6002229,0.0023836026,0.00016156914,0.0000013220099,0.0000033466736,0.000011928538,0.0016951534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819374,0.000007781459,0.0003018211,0.0004992384,0.00035978708,0.00063764234],"domain_scores_gemma":[0.99875575,0.00020826366,0.00008069533,0.0007329467,0.00008763776,0.00013470574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043811902,0.00020275524,0.00018796774,0.0002803129,0.00011462957,0.0001068449,0.0016444173,0.00012315654,0.000008433485],"category_scores_gemma":[0.00011321671,0.00016846575,0.000056648783,0.0007495025,0.000042692638,0.0002430041,0.00091704953,0.00030006302,0.00028721886],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026053829,0.00049001776,0.004761706,0.000010663938,0.000041426098,0.0002601486,0.0005193238,0.0039261174,0.0012869326,0.19083923,0.040829614,0.75700873],"study_design_scores_gemma":[0.0028285321,0.0012171855,0.27408117,0.0002381756,0.000012999501,0.0001230878,0.00069533376,0.389852,0.059373807,0.0033399381,0.2660233,0.0022144862],"about_ca_topic_score_codex":0.0000335424,"about_ca_topic_score_gemma":0.00016675808,"teacher_disagreement_score":0.7547943,"about_ca_system_score_codex":0.000103907325,"about_ca_system_score_gemma":0.00002558466,"threshold_uncertainty_score":0.68698335},"labels":[],"label_agreement":null},{"id":"W2107442425","doi":"10.1109/lcn.2007.65","title":"Search Algorithms for Unstructured Peer-to-Peer Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Network topology; Flooding (psychology); Computer science; Algorithm; Random graph; Random walk; Theoretical computer science; Mathematics; Graph; Computer network","score_opus":0.030292038186458318,"score_gpt":0.3103137241820121,"score_spread":0.28002168599555377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107442425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004873473,0.00004580096,0.9637181,0.024063252,0.0013331254,0.00090184464,0.000006640816,0.0017176461,0.0033401235],"genre_scores_gemma":[0.2248962,0.0000017899165,0.76134074,0.00269267,0.00043275414,0.00005357697,0.000010235938,0.00003293421,0.010539112],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960067,0.000026570126,0.0004242287,0.0009365208,0.001143614,0.0014623223],"domain_scores_gemma":[0.9968409,0.00035339996,0.000052550993,0.0013865243,0.00093758473,0.0004290684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022904698,0.00032677257,0.00033223408,0.0004704036,0.00024070605,0.00035186458,0.0031147734,0.0002972005,0.000023840872],"category_scores_gemma":[0.00035970964,0.00028753554,0.0001287401,0.0019731831,0.000076611585,0.00029983194,0.0012178733,0.00037903138,0.000121204466],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003294582,0.000036415528,0.0004356477,0.0000069340676,0.000038206235,0.00003118836,0.00038913215,0.013431231,0.0003266786,0.04973776,0.20650795,0.7290259],"study_design_scores_gemma":[0.0011220274,0.0007513726,0.0078374315,0.000034182856,0.000015261796,0.000082718914,0.00027910003,0.4604203,0.024167571,0.012098624,0.49185574,0.0013356556],"about_ca_topic_score_codex":0.000056021017,"about_ca_topic_score_gemma":0.00010741496,"teacher_disagreement_score":0.7276903,"about_ca_system_score_codex":0.00015328638,"about_ca_system_score_gemma":0.0000708839,"threshold_uncertainty_score":0.9999577},"labels":[],"label_agreement":null},{"id":"W2107572007","doi":"10.1002/dac.2952","title":"Exploring the accuracy of capturing snapshots in large‐scale P2P IPTV systems","year":2015,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Web crawler; Computer science; IPTV; Focused crawler; Crawling; Overlay network; Peer-to-peer; Server; The Internet; Computer network; World Wide Web; Web server","score_opus":0.13945193238444195,"score_gpt":0.32284527230853616,"score_spread":0.1833933399240942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107572007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.849906,0.009951671,0.11959649,0.011244308,0.0062347827,0.0005116771,0.000009761219,0.00011523922,0.0024300178],"genre_scores_gemma":[0.9955189,0.0003466366,0.0038590862,0.00004711187,0.00014516577,0.000037100686,0.0000018132879,0.000009063323,0.00003509157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724317,0.0003664715,0.0010487651,0.0001275128,0.0010291858,0.00018487012],"domain_scores_gemma":[0.99599105,0.0005583101,0.0009954135,0.0010284734,0.0013452113,0.00008156501],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0029427402,0.00012000603,0.00029219623,0.00050247763,0.000048423644,0.00027902256,0.0059320936,0.00004947491,5.7882914e-7],"category_scores_gemma":[0.00063952303,0.00009095396,0.00007597403,0.00047911785,0.000045210636,0.0012786599,0.0009539571,0.00036554015,0.000010215965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021927286,0.0007048956,0.039578967,0.000058975525,0.00066978077,0.00011973229,0.06677283,0.5910377,0.0018896188,0.26820615,0.011390945,0.01935111],"study_design_scores_gemma":[0.008883349,0.0007582272,0.08025744,0.010871495,0.000075065385,0.0029509098,0.08807252,0.49138525,0.006435115,0.011447253,0.29706994,0.0017934268],"about_ca_topic_score_codex":0.00028034783,"about_ca_topic_score_gemma":0.00006199549,"teacher_disagreement_score":0.28567898,"about_ca_system_score_codex":0.00029018975,"about_ca_system_score_gemma":0.00013310509,"threshold_uncertainty_score":0.9994463},"labels":[],"label_agreement":null},{"id":"W2107661213","doi":"10.1109/glocom.2010.5683292","title":"Towards a Scalable Content-Based Publish/Subscribe Service over DHT","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Multicast; Publication; Distributed computing; Computer network; Service (business); Key (lock); Matching (statistics); Tree (set theory); Database","score_opus":0.0310672329254186,"score_gpt":0.24407267069464036,"score_spread":0.21300543776922176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107661213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32253668,0.00004319978,0.51109093,0.11641666,0.0027625398,0.0006090129,0.000010886478,0.0056921686,0.040837906],"genre_scores_gemma":[0.61927617,9.089418e-7,0.35702533,0.020621123,0.00010576009,0.000075868025,0.000005688625,0.000023046576,0.0028660838],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777776,0.00002552485,0.0002724713,0.0006689681,0.0005630037,0.0006922535],"domain_scores_gemma":[0.9974271,0.00007632524,0.00007174666,0.0017638409,0.000422857,0.00023812804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000460029,0.0002448697,0.0002479974,0.00025079353,0.00012176362,0.00083095377,0.0034193348,0.00022671542,0.0002655042],"category_scores_gemma":[0.00025970538,0.00020628305,0.00007768508,0.0016783035,0.00006268263,0.0011561171,0.0010936762,0.00046808936,0.0004999605],"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.000031654596,0.00039538005,0.008438075,0.000047593494,0.0000642429,0.000076227545,0.00027992474,0.00020920722,0.06830382,0.32908374,0.4292699,0.16380024],"study_design_scores_gemma":[0.0026047907,0.00032570658,0.04183202,0.0000664847,0.000024107114,0.00005108172,0.00017025987,0.2484027,0.18720558,0.011255689,0.50624555,0.0018160339],"about_ca_topic_score_codex":0.00093721197,"about_ca_topic_score_gemma":0.0018229363,"teacher_disagreement_score":0.31782806,"about_ca_system_score_codex":0.00004747433,"about_ca_system_score_gemma":0.00019706145,"threshold_uncertainty_score":0.84119785},"labels":[],"label_agreement":null},{"id":"W2108602152","doi":"10.1504/ijnvo.2011.042482","title":"A real-time XML protocol for bridging virtual communities","year":2011,"lang":"en","type":"article","venue":"International Journal of Networking and Virtual Organisations","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bridging (networking); Computer science; XML; Implementation; Protocol (science); World Wide Web; Computer network; Software engineering","score_opus":0.057967688603983956,"score_gpt":0.30847972406811297,"score_spread":0.25051203546412903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108602152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057122182,0.000011173924,0.92581004,0.00355431,0.00161995,0.010040159,0.000014455907,0.00037729254,0.0014504401],"genre_scores_gemma":[0.90726614,0.000014683615,0.08781137,0.00039881762,0.0011825745,0.003007579,0.0000039000624,0.000029563686,0.0002853568],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866456,0.00006576809,0.0005090556,0.00014624684,0.00038472173,0.00022966704],"domain_scores_gemma":[0.9984172,0.00033028814,0.0003767272,0.00023636877,0.0005393715,0.000100041565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000554965,0.00015491854,0.00020843036,0.0003420232,0.00021878416,0.00025360959,0.0014520966,0.00007399057,0.000023091805],"category_scores_gemma":[0.00009406452,0.00014353268,0.00008093491,0.00022761177,0.000089808185,0.00053455355,0.00042997152,0.00021790167,0.000009411051],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007740823,0.0009118426,0.008312117,0.00002276607,0.0012571017,0.00014553688,0.050164565,0.00421683,0.011605388,0.32977274,0.061891675,0.53092533],"study_design_scores_gemma":[0.019712491,0.017941,0.062215257,0.0045540542,0.0003271507,0.0044393754,0.012496316,0.3526608,0.018124001,0.13450007,0.3682308,0.004798691],"about_ca_topic_score_codex":0.000040677558,"about_ca_topic_score_gemma":0.000015812047,"teacher_disagreement_score":0.85014397,"about_ca_system_score_codex":0.000103995764,"about_ca_system_score_gemma":0.0001269059,"threshold_uncertainty_score":0.5853093},"labels":[],"label_agreement":null},{"id":"W2108832510","doi":"10.1109/icme.2006.262828","title":"Substream Allocation in Layered P2P Streaming","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheme (mathematics); Computer science; Time allocation; Population; Distributed computing; Computer network; Mathematical optimization; Mathematics","score_opus":0.009683641381422572,"score_gpt":0.223258749058381,"score_spread":0.21357510767695842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108832510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6029628,0.000057917492,0.3748104,0.004279797,0.00012617608,0.0001617105,4.2588624e-7,0.0011097165,0.016491054],"genre_scores_gemma":[0.9098564,0.0000020097139,0.088878274,0.00011858914,0.000025118361,0.000017363382,0.000002698645,0.0000046864293,0.0010949059],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99904925,0.000015712712,0.00018036754,0.00030624983,0.00017050996,0.00027790348],"domain_scores_gemma":[0.99934596,0.000046429745,0.000032473643,0.0005130933,0.000035306297,0.000026752552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013920447,0.00009775051,0.00009828377,0.00020621163,0.000032527438,0.00008795821,0.0007888744,0.00006640853,0.000005747903],"category_scores_gemma":[0.000027774597,0.00009295343,0.000019379591,0.0008061197,0.000016716625,0.00025836262,0.00023824001,0.00008177714,0.000087681394],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063504226,0.00031034093,0.07039025,0.000011146633,0.00001054593,0.00007618789,0.00034307188,0.024382714,0.01299654,0.37340486,0.030754078,0.48731393],"study_design_scores_gemma":[0.0011010902,0.00019931301,0.5407342,0.00008879616,0.0000046322803,0.000028078368,0.0002696594,0.26179594,0.11754551,0.064105935,0.013018047,0.0011088054],"about_ca_topic_score_codex":0.0009286909,"about_ca_topic_score_gemma":0.0021442452,"teacher_disagreement_score":0.4862051,"about_ca_system_score_codex":0.00007496163,"about_ca_system_score_gemma":0.000023273002,"threshold_uncertainty_score":0.3790531},"labels":[],"label_agreement":null},{"id":"W2109065271","doi":"10.1145/2089085.2089090","title":"Diagnosing network-wide P2P live streaming inefficiencies","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Live streaming; Real Time Streaming Protocol; Bandwidth (computing); Upload; Peer-to-peer; Computer network; The Internet; Server; World Wide Web","score_opus":0.028921637722711134,"score_gpt":0.28427854171968037,"score_spread":0.25535690399696925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109065271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008090536,0.0010826691,0.98155653,0.0069438093,0.00016425225,0.0007360184,0.000011931705,0.0010385264,0.0003757151],"genre_scores_gemma":[0.55776846,0.00029957923,0.44115677,0.00037002796,0.0000749245,0.00028184627,0.000009424287,0.00001533348,0.000023635543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980443,0.00012228488,0.0004536067,0.00045933668,0.00024533458,0.000675142],"domain_scores_gemma":[0.9921496,0.0034505085,0.00016263443,0.0038174198,0.00015047059,0.00026936238],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005495969,0.00027602646,0.00026101794,0.00028183244,0.0018322163,0.00021506379,0.0033255396,0.00012695267,0.000005345284],"category_scores_gemma":[0.00015415938,0.00029117402,0.00008173177,0.0014556829,0.00028286607,0.00041975328,0.0005702952,0.000545896,0.000119487035],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016922585,0.00048625554,0.0029589322,0.000008828295,0.00004201843,2.503357e-7,0.0022575497,0.010050213,0.00016793012,0.00840751,0.0003938395,0.975225],"study_design_scores_gemma":[0.001023652,0.0002955638,0.043981213,0.00041731258,0.00016952309,0.00007365082,0.00249248,0.7737267,0.0014767234,0.006218317,0.16809177,0.0020330579],"about_ca_topic_score_codex":0.00007174992,"about_ca_topic_score_gemma":0.000051973337,"teacher_disagreement_score":0.9731919,"about_ca_system_score_codex":0.000100207326,"about_ca_system_score_gemma":0.00004818503,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W2109392587","doi":"10.1109/infcom.2007.138","title":"QoS-Aware Streaming in Overlay Multicast Considering the Selfishness in Construction Action","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multicast; Selfishness; Computer network; Computer science; Overlay multicast; Overlay; Quality of service; Distributed computing; Overlay network; Node (physics); Xcast; Reliable multicast; The Internet; Engineering","score_opus":0.02781340391667811,"score_gpt":0.2863643504683164,"score_spread":0.25855094655163824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109392587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69327724,0.000011986184,0.30314317,0.0015634078,0.00050787954,0.00019608633,3.3816957e-7,0.00039934085,0.00090052915],"genre_scores_gemma":[0.94788283,0.000004700182,0.05187523,0.00015429556,0.000037845766,0.000010463561,3.916796e-7,0.0000058208025,0.000028423177],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99880105,0.000035292356,0.00027497538,0.00033323842,0.00017680341,0.00037865058],"domain_scores_gemma":[0.99911505,0.00030986304,0.00005733026,0.00043758386,0.000042379743,0.000037815906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060151337,0.00012369266,0.00013211195,0.0003147043,0.000074716656,0.00010876002,0.00050526403,0.00010038281,0.0000053707554],"category_scores_gemma":[0.00013180837,0.00009941344,0.000021718408,0.0010613657,0.000072937124,0.00043745837,0.00031651635,0.0002704323,0.0000128866195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021160622,0.00008776582,0.12953618,0.000018460938,0.0000133101175,0.00016045374,0.0021326065,0.0070868414,0.004279056,0.030288566,0.00052928395,0.8258463],"study_design_scores_gemma":[0.0016148235,0.00010960377,0.65680027,0.00025419643,0.0000067518977,0.00040059528,0.016020427,0.25608718,0.05816125,0.005780412,0.003834348,0.00093010697],"about_ca_topic_score_codex":0.00037267766,"about_ca_topic_score_gemma":0.0068389364,"teacher_disagreement_score":0.8249162,"about_ca_system_score_codex":0.00018851754,"about_ca_system_score_gemma":0.000029964564,"threshold_uncertainty_score":0.40539622},"labels":[],"label_agreement":null},{"id":"W2109866065","doi":"","title":"A Peer Auditing Scheme for Cheat Detection in MMOGs","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cheating; Scalability; Computer science; Computer security; Scheme (mathematics); Audit; Peer-to-peer; Distributed computing; Internet privacy; Business; Psychology","score_opus":0.030903555461234265,"score_gpt":0.2573384806698332,"score_spread":0.22643492520859895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109866065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22226857,0.000019811907,0.7678452,0.0063982606,0.0001812096,0.00023266795,4.2974042e-7,0.0008516145,0.0022022408],"genre_scores_gemma":[0.7231505,0.0000019244237,0.27437013,0.00029240584,0.00004696755,0.000080068916,4.3800603e-7,0.000005933845,0.002051605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989271,0.000009465882,0.00016323017,0.00033050837,0.00023225287,0.00033740877],"domain_scores_gemma":[0.9993566,0.00008239025,0.000032367054,0.00036728,0.000120394194,0.000040951672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029775497,0.00009866899,0.000119351775,0.00019723433,0.00010692839,0.000040690204,0.000590345,0.00008350969,0.000003740639],"category_scores_gemma":[0.00037966622,0.00009381842,0.00003936743,0.0006797327,0.00002625531,0.00029187938,0.00025421812,0.00011794272,0.00004657031],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041772084,0.00020857998,0.010788291,0.00004599766,0.000034475583,0.00009966387,0.0025791477,0.0013791432,0.0590711,0.039205752,0.08830458,0.7982415],"study_design_scores_gemma":[0.001497013,0.00044460734,0.02282727,0.000057572208,0.0000033904234,0.00020603834,0.00018818521,0.52273947,0.33715978,0.014952893,0.09901333,0.0009104249],"about_ca_topic_score_codex":0.00004867493,"about_ca_topic_score_gemma":0.00015698397,"teacher_disagreement_score":0.7973311,"about_ca_system_score_codex":0.00008865483,"about_ca_system_score_gemma":0.000026542964,"threshold_uncertainty_score":0.3825804},"labels":[],"label_agreement":null},{"id":"W2110304680","doi":"10.1145/2047196.2047219","title":"TwitApp","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Computer science; World Wide Web; Database transaction; Multimedia; Database","score_opus":0.0490016391951694,"score_gpt":0.21726657233729668,"score_spread":0.1682649331421273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110304680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00993628,0.000018764107,0.78096855,0.0014293111,0.00020418735,0.00006151567,1.0334731e-7,0.0016951805,0.20568614],"genre_scores_gemma":[0.5537471,0.0000010077938,0.44364375,0.00071233214,0.000011030568,0.0000074182635,4.9889398e-8,0.0000025227691,0.0018747748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994103,0.0000060706634,0.00007287264,0.00020373921,0.00010539732,0.00020162397],"domain_scores_gemma":[0.9992695,0.000012323866,0.000012856235,0.0006289056,0.000026462345,0.000049945644],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008824513,0.00006049811,0.000059278336,0.000075337266,0.000027676286,0.00003096785,0.0013391285,0.000035625228,0.000055602024],"category_scores_gemma":[0.00002254979,0.000048733044,0.000019083585,0.0003619368,0.000019819296,0.00017592819,0.0005560976,0.00005365178,0.0010255222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011872929,0.000031129566,0.0016423912,0.000001091916,0.0000066047724,0.000021545855,0.0005882476,0.0000036756662,0.00021855699,0.76541936,0.07977931,0.1522869],"study_design_scores_gemma":[0.000504134,0.00067702396,0.07801623,0.00002741913,0.000007510653,0.000080596124,0.00023181218,0.015695015,0.11790356,0.45664614,0.3288889,0.0013216878],"about_ca_topic_score_codex":0.000031283536,"about_ca_topic_score_gemma":0.0000141186765,"teacher_disagreement_score":0.54381084,"about_ca_system_score_codex":0.000010658386,"about_ca_system_score_gemma":0.000010746495,"threshold_uncertainty_score":0.9997523},"labels":[],"label_agreement":null},{"id":"W2110395857","doi":"10.1007/978-3-540-30469-2_21","title":"Performance Evaluation of JXTA Rendezvous","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"University of Saskatchewan","funders":"","keywords":"Rendezvous; Computer science; Scalability; Distributed computing; Computer network; Peer-to-peer; Cache; Overlay network; Database; Operating system; The Internet","score_opus":0.02998033245907782,"score_gpt":0.2666480941658179,"score_spread":0.2366677617067401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110395857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003008031,0.00043943763,0.9869996,0.0010249689,0.0015081093,0.00063609786,0.0000034120064,0.0003315357,0.006048827],"genre_scores_gemma":[0.6642749,0.000034596083,0.33506784,0.000341228,0.00014976268,0.00001601921,0.0000023802502,0.00002240786,0.00009086625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945564,0.00003379833,0.0006212467,0.0014908724,0.0026216542,0.00067601446],"domain_scores_gemma":[0.9961894,0.00019001661,0.0003810253,0.0023137757,0.0008019894,0.00012380243],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002403606,0.0004914241,0.0005540346,0.0013267484,0.00015783802,0.00019338846,0.005549238,0.00038921318,0.000019004894],"category_scores_gemma":[0.0002462642,0.00046480226,0.00010442146,0.0013290573,0.0006681068,0.00057425426,0.0022334782,0.0007025828,0.000050370214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025185539,0.000014288762,0.00004145398,0.000018303863,0.0000061315363,0.000008318721,0.00029158476,0.24372531,0.00009619556,0.008635857,0.00002010945,0.74713993],"study_design_scores_gemma":[0.0003979876,0.0003962529,0.0010103807,0.00082279684,0.000016993508,0.000050727784,1.4272928e-7,0.7734966,0.006757988,0.21583681,0.00047470353,0.0007386007],"about_ca_topic_score_codex":0.000019824158,"about_ca_topic_score_gemma":0.000051548097,"teacher_disagreement_score":0.7464013,"about_ca_system_score_codex":0.00086392363,"about_ca_system_score_gemma":0.0013558159,"threshold_uncertainty_score":0.9998312},"labels":[],"label_agreement":null},{"id":"W2110402613","doi":"10.1109/fpl.2011.92","title":"Acceleration of Multi-agent Simulation on FPGAs","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Field-programmable gate array; Speedup; Benchmark (surveying); Pipeline (software); Parallel computing; Acceleration; Interleaving; Grid; Embedded system; Distributed computing; Operating system","score_opus":0.14322489049685752,"score_gpt":0.3036740026852097,"score_spread":0.1604491121883522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110402613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088397846,0.000005912886,0.9062872,0.0002589151,0.00015221094,0.00015023841,3.2472175e-7,0.0004093227,0.0043380605],"genre_scores_gemma":[0.801872,9.885641e-7,0.19767922,0.00016559825,0.000008780908,0.00000600665,4.7408003e-7,0.0000029320004,0.00026395527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999343,0.000015586407,0.00015232844,0.00020188998,0.00016186824,0.00012534362],"domain_scores_gemma":[0.9993435,0.000036179474,0.00005209069,0.00046573934,0.000073296826,0.00002920444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011687569,0.00007138974,0.000078393314,0.0001228871,0.00003057172,0.000021600266,0.00053747767,0.000050961276,0.0000245684],"category_scores_gemma":[0.000053891396,0.00006044382,0.000024260089,0.00027962014,0.00001467686,0.00021685773,0.00017772386,0.000048902293,0.00011238318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028540666,0.0005313592,0.003092491,0.000012262414,0.000029346636,0.0000081575145,0.0030876226,0.24750033,0.006345864,0.18404403,0.0032753628,0.55204463],"study_design_scores_gemma":[0.00019581676,0.00023554613,0.025336605,0.000010864418,0.0000020114612,4.848411e-7,0.000019981322,0.8696776,0.101330325,0.0021482254,0.0009100456,0.00013248048],"about_ca_topic_score_codex":0.000028861687,"about_ca_topic_score_gemma":0.00001941322,"teacher_disagreement_score":0.7134742,"about_ca_system_score_codex":0.0000249748,"about_ca_system_score_gemma":0.000010408771,"threshold_uncertainty_score":0.24648274},"labels":[],"label_agreement":null},{"id":"W2110495371","doi":"10.1145/1060745.1060824","title":"G-ToPSS","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.009676126024829796,"score_gpt":0.2333867109384794,"score_spread":0.22371058491364962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110495371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116582895,0.000048575013,0.87982416,0.04112892,0.00015144378,0.000067926005,1.6601375e-7,0.0021127153,0.0650078],"genre_scores_gemma":[0.47428155,0.000001985292,0.5185322,0.0022230428,0.000058745336,0.000006399189,9.2555126e-8,0.000002604004,0.0048933593],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999341,0.000006403103,0.00008250107,0.00021185428,0.00013697185,0.00022124402],"domain_scores_gemma":[0.9993005,0.000024540206,0.000012139287,0.0005871773,0.000024391662,0.000051248946],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000966394,0.000063008534,0.00006244255,0.00007355533,0.000035717785,0.000073158364,0.0012187407,0.000037566202,0.00003156917],"category_scores_gemma":[0.000027147167,0.00005274998,0.000020470558,0.00037533106,0.000014511341,0.00024142906,0.0004889979,0.000063072395,0.0013414416],"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":[3.5399378e-7,0.000013915514,0.00019829706,4.5377146e-7,0.000002523213,0.000003641538,0.00006935154,0.0003045441,0.00027578563,0.23562697,0.10122007,0.6622841],"study_design_scores_gemma":[0.00011726307,0.00005005282,0.0030388206,0.000004365843,9.2216675e-7,0.00001787417,0.000012318017,0.03612683,0.016712233,0.009068581,0.93462193,0.00022882543],"about_ca_topic_score_codex":0.000006354331,"about_ca_topic_score_gemma":0.000028618646,"teacher_disagreement_score":0.83340186,"about_ca_system_score_codex":0.000026831303,"about_ca_system_score_gemma":0.00001225505,"threshold_uncertainty_score":0.99943614},"labels":[],"label_agreement":null},{"id":"W2110499194","doi":"10.1109/infcom.2009.5062193","title":"Keep Cache Replacement Simple in Peer-Assisted VoD Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Cache algorithms; Bandwidth (computing); Flexibility (engineering); Cache invalidation; Peer-to-peer; Computer network; Upload; Smart Cache; CPU cache; Distributed computing; Online algorithm; Operating system; Algorithm","score_opus":0.022259442868969623,"score_gpt":0.27001230666434456,"score_spread":0.24775286379537492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110499194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1780878,0.00048032516,0.6937673,0.0563821,0.0011018795,0.0014721457,0.0000041378084,0.0049484866,0.0637558],"genre_scores_gemma":[0.9657974,0.000003052037,0.028676542,0.0009607434,0.000037275524,0.0000366911,0.0000036817369,0.0000068254953,0.004477754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978351,0.000059073987,0.00039093025,0.00059107674,0.0005723518,0.00055149634],"domain_scores_gemma":[0.99834377,0.00006723219,0.00007412047,0.0012924981,0.00011851646,0.00010388411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006968524,0.00019021,0.00026235817,0.0002847394,0.00006520775,0.00024211795,0.0015561734,0.00012296006,0.000008626872],"category_scores_gemma":[0.00015811311,0.00016787901,0.0000442455,0.0011962402,0.000019152365,0.00025874597,0.00039893563,0.00019377841,0.00013088556],"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.000044172746,0.0005657242,0.007975262,0.000028908216,0.000042524152,0.00024973287,0.0009874554,0.009842155,0.002256156,0.19731992,0.3615773,0.4191107],"study_design_scores_gemma":[0.002962828,0.0024865395,0.1380377,0.00019504588,0.000018919416,0.00022791325,0.0011868303,0.47411716,0.007455443,0.021565065,0.3495092,0.0022373307],"about_ca_topic_score_codex":0.0003086368,"about_ca_topic_score_gemma":0.00029489963,"teacher_disagreement_score":0.78770965,"about_ca_system_score_codex":0.00026364723,"about_ca_system_score_gemma":0.000054853044,"threshold_uncertainty_score":0.68459076},"labels":[],"label_agreement":null},{"id":"W2110922787","doi":"10.1109/ispass.2001.990690","title":"Behavior and performance of interactive multi-player game servers","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Bottleneck; Scalability; Benchmarking; Online transaction processing; Game Developer; The Internet; Class (philosophy); Transaction processing; Multimedia; World Wide Web; Database transaction; Game design; Operating system; Database; Artificial intelligence; Embedded system","score_opus":0.0178635317526674,"score_gpt":0.2623930380820536,"score_spread":0.24452950632938622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110922787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9662542,0.00002941281,0.031878274,0.00084631424,0.00007594917,0.00013017986,9.921617e-7,0.00024286058,0.0005418387],"genre_scores_gemma":[0.82720375,0.000010028,0.17204437,0.00016463897,0.000009504237,0.000014984606,2.2038684e-7,0.000003555363,0.0005489568],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99931365,0.000008974712,0.00013867924,0.0002334535,0.00012436126,0.00018089269],"domain_scores_gemma":[0.9994625,0.000030781703,0.000047158213,0.00035427502,0.000058630514,0.000046663812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008506133,0.0000933793,0.000116197916,0.00011027677,0.000024024805,0.000032728094,0.00057129725,0.000047809506,0.000013345066],"category_scores_gemma":[0.000016305827,0.00008014066,0.000020575191,0.00022470439,0.000045605364,0.00058591634,0.00047366836,0.00010350839,0.000041324234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003220096,0.0002662725,0.09114572,0.000018411529,0.000029910816,0.000010483757,0.0020981447,0.0008827462,0.007871603,0.0028124854,0.0024477425,0.8923843],"study_design_scores_gemma":[0.0008809172,0.00057838095,0.46185455,0.000062245,0.000015038527,0.000052398806,0.000188119,0.3462772,0.18298101,0.00004036138,0.0065876194,0.00048217576],"about_ca_topic_score_codex":0.00002334157,"about_ca_topic_score_gemma":0.000054491553,"teacher_disagreement_score":0.8919021,"about_ca_system_score_codex":0.000032820455,"about_ca_system_score_gemma":0.000012570559,"threshold_uncertainty_score":0.32680413},"labels":[],"label_agreement":null},{"id":"W2110968869","doi":"10.1109/icw.2005.33","title":"Building Multicast Trees for Multimedia Streaming in Heterogeneous P2P Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Multicast; Scalability; Computer network; The Internet; Distributed computing; Tree (set theory); Heterogeneous network; Reliable multicast; Communication source; Focus (optics); Source-specific multicast; World Wide Web; Telecommunications","score_opus":0.01689682923586756,"score_gpt":0.27274054717180557,"score_spread":0.255843717935938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110968869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09837117,0.00017193895,0.89783406,0.001982718,0.00021513346,0.00043017507,0.0000017394223,0.0008445383,0.00014849877],"genre_scores_gemma":[0.5146107,0.0000051612906,0.48490807,0.00022635821,0.000103055805,0.00006121742,8.623172e-7,0.000010784639,0.00007379143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981247,0.000022880506,0.00033930608,0.0005907924,0.00018741957,0.00073488575],"domain_scores_gemma":[0.9987345,0.0003798107,0.000059215276,0.0006574575,0.000052312407,0.00011673876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027188173,0.00022262998,0.00024903327,0.0002770586,0.00008435437,0.00015011747,0.0013631772,0.00014680738,0.0000054838856],"category_scores_gemma":[0.00016321795,0.00020856422,0.000076543816,0.0005441888,0.000041461204,0.00033091943,0.00058014144,0.00016799118,0.000020194148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000615996,0.000056462428,0.000664321,0.0000025044487,0.000009576768,0.0000131222405,0.00014335457,0.23409064,0.00060969114,0.00240515,0.0006860697,0.76131296],"study_design_scores_gemma":[0.0004497708,0.00007307961,0.000977366,0.000028957986,0.000002810534,0.000013360281,0.000018642566,0.98823965,0.005025543,0.00033417283,0.00457167,0.00026499003],"about_ca_topic_score_codex":0.000044924287,"about_ca_topic_score_gemma":0.001229465,"teacher_disagreement_score":0.76104796,"about_ca_system_score_codex":0.00012711388,"about_ca_system_score_gemma":0.00001890854,"threshold_uncertainty_score":0.8505002},"labels":[],"label_agreement":null},{"id":"W2111227779","doi":"10.14778/1454159.1454189","title":"P2P logging and timestamping for reconciliation","year":2008,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed hash table; Peer-to-peer; Hash function; Distributed computing; Consistency (knowledge bases); Hash table; Logging; Computer network; Computer security","score_opus":0.025745073631701223,"score_gpt":0.22740153810719047,"score_spread":0.20165646447548924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111227779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91437715,0.000564041,0.055805214,0.02082683,0.00057353976,0.0018979567,0.0000052259356,0.00075752905,0.0051925248],"genre_scores_gemma":[0.8988047,0.000062966225,0.100351974,0.00026573372,0.00003806987,0.000093224924,1.8100945e-7,0.0000072968837,0.00037581316],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991657,0.0000019876645,0.00017696132,0.00025161073,0.00018864613,0.00021508064],"domain_scores_gemma":[0.9995276,0.000046996345,0.00013493611,0.00013864216,0.0001174423,0.000034421148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027281212,0.00009582069,0.00012663688,0.000067882014,0.00015634828,0.000041653206,0.0006989679,0.00003800457,3.6439846e-7],"category_scores_gemma":[0.00016304766,0.00007293664,0.000041082414,0.00018027054,0.000050318755,0.00025079967,0.00051310775,0.0000655128,0.0000013665828],"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.00009286942,0.00024022067,0.024745053,0.00059017923,0.0001897761,0.000002587148,0.012585212,0.00058359525,0.19543579,0.29220843,0.1442031,0.3291232],"study_design_scores_gemma":[0.0014863653,0.00054733997,0.011267107,0.00035251427,0.000035382967,0.00014764848,0.00035699847,0.03991204,0.821818,0.05558104,0.06780891,0.0006866307],"about_ca_topic_score_codex":0.000013140626,"about_ca_topic_score_gemma":7.9910444e-7,"teacher_disagreement_score":0.62638223,"about_ca_system_score_codex":0.00006657117,"about_ca_system_score_gemma":0.000017438117,"threshold_uncertainty_score":0.29742697},"labels":[],"label_agreement":null},{"id":"W2111286384","doi":"10.1109/icdcs.2007.122","title":"mTreebone: A Hybrid Tree/Mesh Overlay for Application-Layer Live Video Multicast","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Multicast; PlanetLab; Overlay multicast; Distributed computing; Shared mesh; Overlay network; Overlay; Robustness (evolution); Wireless mesh network; Overhead (engineering); Switched mesh; Tree (set theory); Source-specific multicast; The Internet; Reliable multicast; Wireless network; Wireless","score_opus":0.017165079196162024,"score_gpt":0.2772278169130873,"score_spread":0.2600627377169253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111286384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071928413,0.000050909057,0.97997046,0.0047510937,0.00022628038,0.00089430035,0.000009694042,0.0014829483,0.0054214536],"genre_scores_gemma":[0.582723,0.000003110395,0.4138802,0.0013937423,0.000116052426,0.0001953159,0.000005107218,0.000016816937,0.0016666579],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979007,0.000011858378,0.00035423305,0.00072950457,0.00033059774,0.00067308586],"domain_scores_gemma":[0.99775696,0.0005040633,0.000094264,0.0012382263,0.00019029267,0.00021619411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005523229,0.00022843496,0.00023268604,0.0002217538,0.00013612061,0.0001369421,0.0016365978,0.00009874441,0.000016413731],"category_scores_gemma":[0.00026085047,0.00020666241,0.00010486035,0.000566722,0.00006636148,0.00031241038,0.00056750193,0.00014234068,0.00042046467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038299815,0.00019599317,0.0007119567,0.000014647721,0.00004619122,0.000024145958,0.00035437415,0.00015320393,0.006190231,0.124447785,0.121180385,0.74664277],"study_design_scores_gemma":[0.0022268426,0.0006687556,0.012242923,0.000051506846,0.000038259892,0.00010929659,0.00028649092,0.3915871,0.14033204,0.02970053,0.42110994,0.0016462936],"about_ca_topic_score_codex":0.0000554939,"about_ca_topic_score_gemma":0.00025704494,"teacher_disagreement_score":0.7449965,"about_ca_system_score_codex":0.00010264564,"about_ca_system_score_gemma":0.00004949473,"threshold_uncertainty_score":0.8427449},"labels":[],"label_agreement":null},{"id":"W2111308842","doi":"10.1109/jsac.2004.829342","title":"oEvolve : Toward Evolutionary Overlay Topologies for High-Bandwidth Data Dissemination","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PlanetLab; Computer science; Network topology; Testbed; Overlay network; Computer network; Overlay; Distributed computing; Throughput; Quality of service; Dissemination; Overlay multicast; Bandwidth (computing); Routing (electronic design automation); The Internet; Wireless; Telecommunications","score_opus":0.06477464549766751,"score_gpt":0.3455923242920603,"score_spread":0.2808176787943928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111308842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028824124,0.0011690775,0.8551907,0.11164738,0.00092252437,0.0007706189,0.00012451166,0.00080000615,0.0005510795],"genre_scores_gemma":[0.72813207,0.0005280623,0.27080923,0.00023993387,0.00007580543,0.00007210824,0.00008343196,0.000013076715,0.00004630185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813175,0.00014865675,0.0005098757,0.0004032649,0.00037465506,0.0004318166],"domain_scores_gemma":[0.99463624,0.0010350923,0.00025271982,0.003445712,0.0005264318,0.000103832404],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006200633,0.00020625847,0.0002533689,0.0005569772,0.0005191371,0.00022229183,0.008002384,0.00015426787,0.000003346444],"category_scores_gemma":[0.0012725629,0.00019543915,0.000051028106,0.0017000068,0.00013689583,0.00090510765,0.0010566035,0.00075002655,0.00001816812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023734738,0.0031497432,0.004107698,0.000039969986,0.00033795406,0.00005747302,0.0035997871,0.035089593,0.005561173,0.47581106,0.250974,0.22103418],"study_design_scores_gemma":[0.0048052464,0.0023857872,0.16813064,0.0016724196,0.00011125473,0.0008308206,0.0008424558,0.09189071,0.009352262,0.65981317,0.057895094,0.0022701183],"about_ca_topic_score_codex":0.00004857388,"about_ca_topic_score_gemma":0.00022115094,"teacher_disagreement_score":0.6993079,"about_ca_system_score_codex":0.00065122376,"about_ca_system_score_gemma":0.00036186175,"threshold_uncertainty_score":0.9973648},"labels":[],"label_agreement":null},{"id":"W2111503504","doi":"","title":"Performance evaluation and benchmarking of the JXTA peer-to-peer platform","year":2004,"lang":"en","type":"article","venue":"University Library - University of Saskatchewan (University of Saskatchewan)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmarking; Peer-to-peer; Computer science; Business; World Wide Web; Marketing","score_opus":0.011308464117607567,"score_gpt":0.17954856208763642,"score_spread":0.16824009797002887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111503504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97305804,0.00003183574,0.015948193,0.008031503,0.00020267682,0.00070946757,0.000114363946,0.0002607389,0.001643179],"genre_scores_gemma":[0.91932285,0.00003755309,0.07552477,0.00008445308,0.000020381369,3.664309e-8,0.000021895767,0.00001663124,0.004971422],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99677837,0.00012131407,0.00026028833,0.00083880825,0.0014405765,0.0005606337],"domain_scores_gemma":[0.9970445,0.00013144861,0.00051774876,0.001293368,0.0006807653,0.00033215564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006130359,0.00038455264,0.00063942664,0.0008672061,0.0007000923,0.000035145404,0.00407944,0.0003465204,0.000100464655],"category_scores_gemma":[0.00003664533,0.00048044382,0.0002905356,0.002509323,0.00088153436,0.0032617154,0.0039108545,0.00044508927,0.000018515426],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013778907,0.00083018176,0.053785138,0.0005085502,0.00081550976,0.00022468551,0.78236604,0.025070336,0.0060327514,0.002463504,0.0049086525,0.12161675],"study_design_scores_gemma":[0.0054541365,0.0010912,0.12280985,0.0008142446,0.00042393673,0.00003098826,0.8403049,0.0062671453,0.008056645,0.0018524702,0.011561798,0.0013326615],"about_ca_topic_score_codex":0.0063011283,"about_ca_topic_score_gemma":0.0034013407,"teacher_disagreement_score":0.12028409,"about_ca_system_score_codex":0.000343356,"about_ca_system_score_gemma":0.0012128336,"threshold_uncertainty_score":0.99976474},"labels":[],"label_agreement":null},{"id":"W2111847669","doi":"10.1109/ccnc.2007.137","title":"Fairness in Multi-Player Online Games on Deadline-Based Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Quality of service; Computer network; Network packet; Voice over IP; The Internet; Operating system","score_opus":0.035369677093633874,"score_gpt":0.30057481438999256,"score_spread":0.2652051372963587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111847669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0962913,0.00005920524,0.8981232,0.0032486066,0.0003410422,0.00023450595,0.0000013271846,0.0011008442,0.0005999647],"genre_scores_gemma":[0.7201025,0.0000028725135,0.2767401,0.0027259686,0.00005599753,0.000010619599,0.0000046447044,0.0000128738275,0.00034444072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979439,0.000033414948,0.00037341,0.0006051972,0.00031629478,0.0007278227],"domain_scores_gemma":[0.99846226,0.00031948418,0.0000641403,0.00095101097,0.00007749171,0.00012559113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392452,0.00024455396,0.00024932632,0.0004796028,0.000050763603,0.00008565082,0.0015945155,0.00020893647,0.000010794829],"category_scores_gemma":[0.000122723,0.00020878813,0.00005837718,0.0014432915,0.000051236257,0.00017065286,0.00035560274,0.0003883036,0.0000694885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092793125,0.00114519,0.028556585,0.000011766551,0.000018164916,0.0004317086,0.00015563102,0.3973392,0.00031179335,0.027260838,0.008395213,0.5362811],"study_design_scores_gemma":[0.00097009976,0.00018708658,0.07333116,0.00006811242,0.0000020655991,0.0000051938696,0.00004597688,0.9154483,0.004189593,0.00040432852,0.004907686,0.00044041066],"about_ca_topic_score_codex":0.00009616797,"about_ca_topic_score_gemma":0.002496829,"teacher_disagreement_score":0.6238112,"about_ca_system_score_codex":0.00011862598,"about_ca_system_score_gemma":0.0000436057,"threshold_uncertainty_score":0.85141325},"labels":[],"label_agreement":null},{"id":"W2112133246","doi":"10.1109/ccnc.2009.4784804","title":"Sip-Based Protocol for P2P Large-Scale Multiparty VoIP (MVoIP) Conference Support","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Overhead (engineering); Software deployment; Voice over IP; Protocol (science); Computer network; Distributed computing; Process (computing); Control (management); Host (biology); Operating system; The Internet; Artificial intelligence","score_opus":0.04019353316079419,"score_gpt":0.3298949209598225,"score_spread":0.2897013877990283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112133246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027443853,5.7228436e-7,0.9077793,0.010297605,0.00009779855,0.07423162,0.000017968425,0.0019504064,0.005350349],"genre_scores_gemma":[0.103195675,9.431066e-8,0.7200715,0.00516481,0.00007780994,0.16913398,0.000009663445,0.00001709648,0.0023293642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975569,0.000033021053,0.00038195043,0.0007676812,0.00040395276,0.0008564732],"domain_scores_gemma":[0.9980391,0.00012261828,0.00010911337,0.0012647804,0.00027186182,0.00019250123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005203575,0.00028653973,0.00030703717,0.00016764189,0.00017297699,0.00024331624,0.0021205456,0.0001778048,0.000065164866],"category_scores_gemma":[0.00014106861,0.00023917177,0.00011636477,0.0005421659,0.000055290184,0.00038401072,0.0002883345,0.00018648796,0.00013724195],"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.00023528005,0.0015924821,0.0020024069,0.00011087721,0.000028761551,0.000056340166,0.0006177241,0.0012460764,0.0061983396,0.13127585,0.62513864,0.23149724],"study_design_scores_gemma":[0.0034538596,0.0018763937,0.0025408433,0.000059405535,0.0000067068017,0.000008624821,0.000043998265,0.41356164,0.09863057,0.01466023,0.4643082,0.00084951514],"about_ca_topic_score_codex":0.000006264095,"about_ca_topic_score_gemma":0.00008689885,"teacher_disagreement_score":0.41231558,"about_ca_system_score_codex":0.000060846585,"about_ca_system_score_gemma":0.00021840038,"threshold_uncertainty_score":0.9753142},"labels":[],"label_agreement":null},{"id":"W2112265244","doi":"10.1109/vtcf.2006.504","title":"Performance of Pub/Sub Systems in Wired/Wireless Networks","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Reliability (semiconductor); Workload; Computer science; Wireless; Cover (algebra); Wireless network; Set (abstract data type); Computer network; Publication; Baseline (sea); Reliability engineering; Telecommunications; Engineering; Operating system","score_opus":0.009413890568838595,"score_gpt":0.20164112662675798,"score_spread":0.1922272360579194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112265244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8351617,0.0006120734,0.16052885,0.0011933933,0.00053926423,0.0004300942,0.0000021685012,0.0011919762,0.00034046816],"genre_scores_gemma":[0.9949254,0.00011209638,0.004609892,0.0000417345,0.00004327631,0.00017948581,0.0000027698877,0.000020885924,0.00006446336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713695,0.00006576252,0.0007154672,0.00082565506,0.0003988712,0.00085731334],"domain_scores_gemma":[0.9975946,0.00006924779,0.00028258804,0.0016781376,0.0003153621,0.00006004897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046201042,0.00035490165,0.00062994135,0.0011383989,0.00009093054,0.000091628506,0.0033303138,0.0007343589,0.0000012020498],"category_scores_gemma":[0.000041388266,0.00035602952,0.00006651361,0.0031951393,0.00041833118,0.00034459343,0.0006151091,0.00058062334,0.000029353492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003875845,0.00045425937,0.13767496,0.0001891524,0.00008107102,0.0004385079,0.000106999185,0.2290739,0.120354965,0.32041228,0.0030183734,0.18815678],"study_design_scores_gemma":[0.00048331136,0.00026816913,0.0090068765,0.00038166228,0.000009506757,0.00009842211,0.000039392133,0.9039347,0.081721194,0.002414308,0.0010534376,0.00058899017],"about_ca_topic_score_codex":0.00017376305,"about_ca_topic_score_gemma":0.00017497675,"teacher_disagreement_score":0.67486084,"about_ca_system_score_codex":0.00012066761,"about_ca_system_score_gemma":0.00013011113,"threshold_uncertainty_score":0.9998892},"labels":[],"label_agreement":null},{"id":"W2112336602","doi":"10.1109/tmm.2008.2008929","title":"Optimal Prefetching Scheme in P2P VoD Applications With Guided Seeks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scheme (mathematics); Cache; Popularity; Peer-to-peer; Position (finance); Distributed computing; Computer network","score_opus":0.02571846912565651,"score_gpt":0.2541340654331863,"score_spread":0.22841559630752978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112336602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06427931,0.000022615455,0.932123,0.0013553273,0.00015782946,0.0006399722,0.000007979542,0.00095643685,0.00045749877],"genre_scores_gemma":[0.5275467,0.000018851904,0.47160026,0.00012601465,0.000024065705,0.00042900184,0.0000014076029,0.000016546108,0.0002371214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981665,0.000037215385,0.00031208273,0.0006245434,0.000389656,0.00047000966],"domain_scores_gemma":[0.9985654,0.0001518405,0.00006480609,0.0009788256,0.00008929808,0.00014984248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001518046,0.00024557638,0.0002331425,0.00047787747,0.00025243184,0.00005066243,0.0010926712,0.00014602019,0.000011406978],"category_scores_gemma":[0.000009848282,0.00023106813,0.0000622708,0.0013638702,0.00012534496,0.00041576344,0.000011147756,0.00053246465,0.00021940308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008564289,0.0011408998,0.0007125654,0.000025474668,0.00011022576,0.0001535514,0.00498674,0.63627124,0.00901114,0.00033200296,0.002048334,0.3451222],"study_design_scores_gemma":[0.0030509979,0.0005144013,0.005591312,0.00015240745,0.000027607088,0.0003484439,0.00016926137,0.9017306,0.07866708,0.00024299813,0.008159533,0.0013453525],"about_ca_topic_score_codex":0.00007695073,"about_ca_topic_score_gemma":0.00017562295,"teacher_disagreement_score":0.46326742,"about_ca_system_score_codex":0.00014133943,"about_ca_system_score_gemma":0.00011857075,"threshold_uncertainty_score":0.9422685},"labels":[],"label_agreement":null},{"id":"W2112601556","doi":"10.1016/s0166-5316(02)00137-2","title":"Delimiting the range of effectiveness of scalable on-demand streaming","year":2002,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Peer-to-Peer Network Technologies","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 Saskatchewan","funders":"Fudan University","keywords":"Scalability; Range (aeronautics); Computer science; On demand; Computer network; Multimedia; Database; Engineering; Aerospace engineering","score_opus":0.04085063400201436,"score_gpt":0.27225049110612776,"score_spread":0.2313998571041134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112601556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97856086,0.00021434505,0.018729445,0.00020263303,0.00012076328,0.00038953294,7.189983e-7,0.00006499295,0.001716699],"genre_scores_gemma":[0.99676913,0.000038467268,0.0030681286,0.000021925473,0.000021502188,0.00005865626,8.3054044e-7,0.0000046280265,0.000016712029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987255,0.00014593189,0.00021059632,0.0001854116,0.0005652648,0.00016731759],"domain_scores_gemma":[0.99876803,0.00035834417,0.00014096609,0.00047158432,0.00024552792,0.000015538979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026280102,0.00008575686,0.00013820222,0.00011851724,0.00009944999,0.00001992306,0.00054838526,0.00004080549,0.000012909796],"category_scores_gemma":[0.00024116716,0.00006284242,0.000030193189,0.0005890454,0.000047357236,0.0002950196,0.000128844,0.00008627589,0.000020717933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020959276,0.0000681365,0.023468344,0.00012097462,0.000019841804,2.2589802e-7,0.00083531305,0.0907389,0.0041799825,0.0010108957,0.00011126788,0.87942517],"study_design_scores_gemma":[0.00029095192,0.00018409354,0.12832738,0.00023838672,0.000010788218,0.0000013159681,0.000019889134,0.8160195,0.054583892,0.00023065752,0.00002509505,0.000068094305],"about_ca_topic_score_codex":0.0000063525395,"about_ca_topic_score_gemma":0.000001670916,"teacher_disagreement_score":0.87935704,"about_ca_system_score_codex":0.000058599897,"about_ca_system_score_gemma":0.000016878304,"threshold_uncertainty_score":0.25626394},"labels":[],"label_agreement":null},{"id":"W2113507793","doi":"10.1109/cive.2009.4926319","title":"Intelligent path finding for avatars in Massively Multiplayer Online Games","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Path (computing); Computation; Massively parallel; Process (computing); Distributed computing; Parallel computing; Computer network; Algorithm","score_opus":0.040330585131274355,"score_gpt":0.29994173125104656,"score_spread":0.2596111461197722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113507793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1457609,0.00008267746,0.8429271,0.009584044,0.00026659772,0.00045244422,0.000008096436,0.0006351871,0.00028295876],"genre_scores_gemma":[0.5601091,0.000013340535,0.43812257,0.0012022636,0.000035568773,0.000019831374,0.000004100966,0.0000052884384,0.00048795887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986071,0.000013961913,0.00027925172,0.00045752135,0.00018165965,0.00046049026],"domain_scores_gemma":[0.9991543,0.00014623585,0.00005553726,0.000504684,0.00007173719,0.00006749067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021852023,0.00016282826,0.0001937389,0.0002969712,0.000046177855,0.000088648194,0.0012339139,0.00009248028,0.000005797266],"category_scores_gemma":[0.0002839671,0.00014025315,0.000055636974,0.0005752623,0.000018464036,0.0002496226,0.00028582252,0.0001500864,0.00003022478],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018817762,0.00024072379,0.0028554546,0.000007062907,0.000010148596,0.00003584663,0.00061663194,0.003687763,0.0016753327,0.026767751,0.024014823,0.9400696],"study_design_scores_gemma":[0.0013939423,0.0011969969,0.0660996,0.00023911634,0.000007854142,0.000018741284,0.000566483,0.75714797,0.05964025,0.046350975,0.06606269,0.0012753744],"about_ca_topic_score_codex":0.000018718252,"about_ca_topic_score_gemma":0.000098902456,"teacher_disagreement_score":0.93879426,"about_ca_system_score_codex":0.000095160125,"about_ca_system_score_gemma":0.00003229124,"threshold_uncertainty_score":0.5719358},"labels":[],"label_agreement":null},{"id":"W2113708154","doi":"10.1109/milcom.2010.5679576","title":"Building robust and decentralized tactical name services with JXTA: Performance issues and solutions","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Scalability; Tactical communications; Service (business); Computer network; Bandwidth (computing); De facto; Distributed computing; The Internet; Computer security; World Wide Web; Database","score_opus":0.013275378163786222,"score_gpt":0.2432416919079136,"score_spread":0.22996631374412738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113708154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720127,0.00022621018,0.11834032,0.008303541,0.00010064426,0.00011963566,5.7436984e-7,0.0005625955,0.00033381124],"genre_scores_gemma":[0.5881229,0.00006632577,0.411548,0.0001444179,0.000016728229,0.0000074576665,1.9756796e-7,0.000004260907,0.00008970154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989652,0.00001064523,0.000108273,0.00035741736,0.0001705518,0.0003879218],"domain_scores_gemma":[0.9993548,0.00005674987,0.00003045723,0.0003773367,0.000058863898,0.000121831705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016736334,0.00013360844,0.00013955853,0.00008206941,0.00022990309,0.00030874097,0.00049168564,0.00008144508,0.000014011885],"category_scores_gemma":[0.000020249392,0.0000991273,0.000009237199,0.00027844755,0.00013633423,0.00071635295,0.00058848376,0.00022080555,0.000012671278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007050978,0.00017805793,0.15767582,0.00015972494,0.00011628328,0.000049505536,0.00163978,0.001209745,0.014471406,0.5900473,0.004642962,0.22973889],"study_design_scores_gemma":[0.0013956877,0.0005422344,0.15652852,0.00015898493,0.00004198023,0.0006010067,0.00025315976,0.76103735,0.011717666,0.0053666965,0.06123848,0.0011182023],"about_ca_topic_score_codex":0.00007952944,"about_ca_topic_score_gemma":0.00030004446,"teacher_disagreement_score":0.7598276,"about_ca_system_score_codex":0.000010325263,"about_ca_system_score_gemma":0.000019490215,"threshold_uncertainty_score":0.4042294},"labels":[],"label_agreement":null},{"id":"W2113807221","doi":"10.1109/imtc.2008.4547411","title":"Model and Measurement of State Dissemination in MMOGs","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cheating; Computer science; Server; Scalability; Peer-to-peer; Task (project management); Fault tolerance; State (computer science); Distributed computing; Consistency (knowledge bases); Computer network; Psychology; Operating system; Engineering; Artificial intelligence","score_opus":0.03972422444226882,"score_gpt":0.2504633629487039,"score_spread":0.2107391385064351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113807221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5361147,0.000048634647,0.46182805,0.00094484235,0.000014510999,0.000072849936,3.0922965e-7,0.0000961583,0.0008799546],"genre_scores_gemma":[0.9232818,0.000024846717,0.076464124,0.000031043695,0.0000010103034,0.0000062630697,9.611166e-8,0.000001686717,0.00018915911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936765,0.000007343029,0.00011720555,0.0001476222,0.00025193425,0.000108242406],"domain_scores_gemma":[0.9996646,0.000014334191,0.000023715053,0.00020988133,0.000066134984,0.00002135124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021640911,0.000048254915,0.00007523369,0.00011597073,0.00001648854,0.000008345892,0.00027048588,0.00001952273,4.3694118e-7],"category_scores_gemma":[0.000042158325,0.000042304542,0.0000074610307,0.00026234682,0.000025749658,0.00015133791,0.00017629047,0.000036505644,0.0000015891229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026749962,0.00042080623,0.043002054,0.00005761064,0.000028020011,0.000051018258,0.010647713,0.08550144,0.09585319,0.07646668,0.027033735,0.66091096],"study_design_scores_gemma":[0.00016671493,0.00006258294,0.05389789,0.00003368462,7.780193e-7,0.0000061998185,0.000021776137,0.8994201,0.03394043,0.01222812,0.000087250046,0.00013451418],"about_ca_topic_score_codex":0.000022382254,"about_ca_topic_score_gemma":0.00010080391,"teacher_disagreement_score":0.8139186,"about_ca_system_score_codex":0.000033902797,"about_ca_system_score_gemma":0.00001932539,"threshold_uncertainty_score":0.17251292},"labels":[],"label_agreement":null},{"id":"W2114018317","doi":"10.1016/j.im.2005.07.001","title":"Agent-based buddy-finding methodology for knowledge sharing","year":2005,"lang":"en","type":"article","venue":"Information & Management","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Software agent; World Wide Web; The Internet; Set (abstract data type); Context (archaeology); Knowledge sharing; Intelligent agent; Information exchange; Knowledge management; Software; Human–computer interaction; Artificial intelligence","score_opus":0.09397574145568963,"score_gpt":0.33273524432323703,"score_spread":0.2387595028675474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114018317","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015196617,0.000026569627,0.97967905,0.003908103,0.00041735137,0.0006346552,0.00000199375,0.00080716447,0.013005428],"genre_scores_gemma":[0.12043111,0.0000042206298,0.87652224,0.0019658261,0.000056091452,0.00031616507,0.000014220455,0.000006397829,0.0006837111],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880326,0.000022212313,0.00038932846,0.00021720192,0.0001861372,0.00038185157],"domain_scores_gemma":[0.99899197,0.00012412682,0.00013582881,0.00060519495,0.000085650754,0.000057208064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000988583,0.00014136614,0.00014325148,0.0006136032,0.00015397063,0.00024369932,0.0013615541,0.000062731146,0.000010171079],"category_scores_gemma":[0.000089767935,0.00014544229,0.00006404467,0.0005534966,0.000016896667,0.0013056863,0.00077494234,0.00007772791,0.00049549644],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005581824,0.000015983474,0.00002079803,0.000056475717,0.000022488763,5.8323036e-7,0.00072732195,0.020860396,0.000009971328,0.17771356,0.015055586,0.78551126],"study_design_scores_gemma":[0.000501495,0.000042452946,0.0005758284,0.000028953576,0.000010523713,0.0000013090943,0.00013410892,0.3221571,0.0013166267,0.0038704707,0.6711555,0.00020561104],"about_ca_topic_score_codex":0.000002826631,"about_ca_topic_score_gemma":0.000008379673,"teacher_disagreement_score":0.7853057,"about_ca_system_score_codex":0.00019160549,"about_ca_system_score_gemma":0.000014794789,"threshold_uncertainty_score":0.63687694},"labels":[],"label_agreement":null},{"id":"W2114348744","doi":"10.1109/nof.2015.7333309","title":"Enhancing DHT-based object naming service architectures with geographic-awareness","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Chord (peer-to-peer); Distributed hash table; Pastry; Computer science; Computer network; Scalability; Distributed computing; Routing table; Hash table; Overlay network; Geographic routing; Routing (electronic design automation); Hash function; Static routing; Routing protocol; Peer-to-peer; Database; World Wide Web","score_opus":0.01952416623237188,"score_gpt":0.24522940270668153,"score_spread":0.22570523647430965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114348744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3035233,0.000051941435,0.6898533,0.003271294,0.00012839524,0.0002562734,8.949826e-7,0.0019221131,0.0009924913],"genre_scores_gemma":[0.73411506,2.496507e-7,0.26373374,0.0019766781,0.00003613318,0.00006753367,0.0000016918132,0.000015727794,0.00005317472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791986,0.000057367197,0.00021131347,0.0006377699,0.00057926995,0.00059442164],"domain_scores_gemma":[0.9981269,0.00015225702,0.00007633344,0.0011496106,0.00028062105,0.00021424227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042225973,0.00026934966,0.0002478438,0.00044766412,0.00014295563,0.00024560528,0.0019301792,0.00009936992,0.0000033372035],"category_scores_gemma":[0.00007810676,0.00020240912,0.00004327027,0.0020569726,0.000054759865,0.00018036479,0.0005746376,0.00023363941,0.000040795447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003695968,0.00058846734,0.123544276,0.00040771806,0.000354621,0.0007298029,0.0092656445,0.53510743,0.018028282,0.025680084,0.0052270056,0.28069705],"study_design_scores_gemma":[0.0046096737,0.0028854688,0.04195517,0.0012163131,0.00007094503,0.0003330984,0.0017679203,0.53686976,0.37195396,0.016531207,0.017330524,0.004475944],"about_ca_topic_score_codex":0.0008067467,"about_ca_topic_score_gemma":0.0054461067,"teacher_disagreement_score":0.43059176,"about_ca_system_score_codex":0.0000557407,"about_ca_system_score_gemma":0.00028508765,"threshold_uncertainty_score":0.8254005},"labels":[],"label_agreement":null},{"id":"W2114682631","doi":"10.1109/icdcs.2007.99","title":"Differentiated Data Persistence with Priority Random Linear Codes","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Node (physics); Scalability; Server; Distributed computing; Salient; Persistent data structure; Computer network; Random access; Algorithm; Engineering; Artificial intelligence; Database","score_opus":0.05003348200019574,"score_gpt":0.27578635488977404,"score_spread":0.2257528728895783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114682631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12807135,0.00006019187,0.867069,0.0014029619,0.00012176428,0.0002057165,0.0000052099745,0.0012075133,0.0018562683],"genre_scores_gemma":[0.7036513,0.000007366143,0.2955626,0.00022009037,0.00002995251,0.0000024711235,0.000010107038,0.0000061854703,0.0005099473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983002,0.000025062876,0.00019605692,0.0006376811,0.00038986086,0.0004511684],"domain_scores_gemma":[0.9973882,0.00017172351,0.00005614719,0.0021560683,0.00011011286,0.000117773154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006589481,0.00016513797,0.00021562225,0.00012072446,0.00012047437,0.00012786762,0.0036974095,0.000077254655,0.000010409087],"category_scores_gemma":[0.00013412816,0.000115312265,0.000024283068,0.00079107465,0.00010135355,0.00045510434,0.0017761966,0.00018343367,0.000058358233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016435619,0.0015607754,0.15332624,0.00014708708,0.000829711,0.0010596886,0.0034550102,0.0011246509,0.014471911,0.08491738,0.06716162,0.67030233],"study_design_scores_gemma":[0.009849568,0.0013835551,0.20055835,0.00027238086,0.0001292159,0.00027110582,0.00084349053,0.664618,0.058168415,0.0026927378,0.05830641,0.0029067572],"about_ca_topic_score_codex":0.000058856727,"about_ca_topic_score_gemma":0.00048421026,"teacher_disagreement_score":0.6673956,"about_ca_system_score_codex":0.000031934953,"about_ca_system_score_gemma":0.000043978092,"threshold_uncertainty_score":0.6870768},"labels":[],"label_agreement":null},{"id":"W2114774737","doi":"10.1109/icise.2009.1156","title":"Tambour: A Scalable and Robust DHT Protocol","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Distributed hash table; Hash table; Scalability; Latency (audio); Routing table; Computer network; Distributed computing; Robustness (evolution); Routing protocol; Lookup table; Peer-to-peer; Hash function; Routing (electronic design automation)","score_opus":0.016637137659600586,"score_gpt":0.2575493082852298,"score_spread":0.24091217062562922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114774737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00439179,0.000017645269,0.87874633,0.027500888,0.00007818774,0.042286213,5.483539e-7,0.0033022026,0.043676212],"genre_scores_gemma":[0.058106743,0.0000012735383,0.912806,0.003486395,0.000059446756,0.01936938,2.6205387e-7,0.000008858054,0.0061616395],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998975,0.000013279555,0.00013215358,0.00036414305,0.0001831575,0.00033228478],"domain_scores_gemma":[0.99923074,0.000020739131,0.0000283836,0.0005825885,0.000044450215,0.0000930692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017530438,0.000116256655,0.00012367399,0.00010554034,0.00007913138,0.00023003349,0.00083741103,0.00006884636,0.000015338954],"category_scores_gemma":[0.00003868437,0.00009366026,0.000019041841,0.00053837727,0.00003174387,0.00033341668,0.0003678122,0.000105923136,0.00008115483],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012611819,0.00014106608,0.0013485311,0.000013764774,0.000008993759,0.00004509246,0.00017202078,0.0011009813,0.0010489825,0.15896192,0.20085503,0.636291],"study_design_scores_gemma":[0.0028094132,0.002652089,0.057726655,0.00018230693,0.000010236905,0.00026264967,0.000083707855,0.28964218,0.03577415,0.18382898,0.4250617,0.001965916],"about_ca_topic_score_codex":0.000015389262,"about_ca_topic_score_gemma":0.000012387927,"teacher_disagreement_score":0.6343251,"about_ca_system_score_codex":0.000023483166,"about_ca_system_score_gemma":0.00002530605,"threshold_uncertainty_score":0.38193545},"labels":[],"label_agreement":null},{"id":"W2114817726","doi":"10.1109/distra.2005.5","title":"A novel solution for the development of collaborative virtual environment simulations in large scale","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Task (project management); Process (computing); Scale (ratio); Architecture; Human–computer interaction; Multimedia; Software engineering; Programming language; Systems engineering","score_opus":0.01952216465450747,"score_gpt":0.25720505273097577,"score_spread":0.2376828880764683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114817726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026970038,0.00002669245,0.9678551,0.004473332,0.000035254467,0.00045799295,0.000011548671,0.000063501924,0.00010656083],"genre_scores_gemma":[0.5343749,8.974192e-7,0.4653469,0.00007839794,0.000007362795,0.00005409652,0.0000012928188,0.0000018947811,0.00013426745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921507,0.000008940123,0.00022419683,0.00018672597,0.00016620409,0.00019884077],"domain_scores_gemma":[0.9994488,0.0001708058,0.000049823066,0.00027229646,0.00003837982,0.00001989908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027812444,0.0000727873,0.00008709758,0.000084730935,0.00011144362,0.000019283629,0.0004683896,0.000040968876,0.0000065948993],"category_scores_gemma":[0.000034606626,0.00005400998,0.000016158632,0.00038556295,0.000029640467,0.00015323925,0.0003157368,0.000045933102,0.000012049104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028330207,0.0008257778,0.0011883738,0.0000052760583,0.000047545505,1.8534286e-7,0.018291319,0.50039744,0.023119165,0.0734158,0.0024499008,0.38023084],"study_design_scores_gemma":[0.00052241184,0.00006033332,0.008688202,0.000007908321,0.0000022402655,2.5882727e-7,0.00039457815,0.94009197,0.016071541,0.00024180334,0.033802368,0.00011637233],"about_ca_topic_score_codex":0.0000025648906,"about_ca_topic_score_gemma":0.0010390617,"teacher_disagreement_score":0.50740486,"about_ca_system_score_codex":0.00013290363,"about_ca_system_score_gemma":0.00007430414,"threshold_uncertainty_score":0.22024632},"labels":[],"label_agreement":null},{"id":"W2115177716","doi":"10.1109/lcn.2010.5735745","title":"TreeClimber: A network-driven push-pull hybrid scheme for peer-to-peer video live streaming","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Robustness (evolution); Overlay; Live streaming; Scheme (mathematics); Computer network; Peer-to-peer; Distributed computing; Overlay network; The Internet; Video streaming; Real-time computing; World Wide Web","score_opus":0.015478441932680139,"score_gpt":0.26281335098097336,"score_spread":0.24733490904829322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115177716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20596138,0.000054324766,0.7241401,0.053149443,0.0029534935,0.0020058497,0.00004889939,0.0039753034,0.007711197],"genre_scores_gemma":[0.3387233,0.0000030654023,0.64747894,0.0021131157,0.0006804908,0.00034329965,0.000020366419,0.000055062817,0.010582348],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952182,0.000040832187,0.0006031588,0.0014386586,0.0010603151,0.0016388131],"domain_scores_gemma":[0.99551874,0.00055287604,0.00017615643,0.0022861997,0.0009580092,0.0005080282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010686158,0.0005530915,0.0005786244,0.00035939386,0.00037705168,0.00060395186,0.0039713033,0.00027377193,0.00008800625],"category_scores_gemma":[0.0011886,0.0005167802,0.00025472048,0.0011007274,0.00011450423,0.0006862911,0.0021759905,0.0007070976,0.0007523617],"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.000060934297,0.00017835888,0.0032077217,0.000022649288,0.0001214879,0.00006867171,0.000596469,0.0028748827,0.0052602165,0.05251431,0.75581294,0.17928132],"study_design_scores_gemma":[0.0012153066,0.0010148337,0.0023639177,0.000096949545,0.00004155602,0.00011540772,0.0001517504,0.20877598,0.012750655,0.012534586,0.75924754,0.0016915015],"about_ca_topic_score_codex":0.00012121291,"about_ca_topic_score_gemma":0.0014844137,"teacher_disagreement_score":0.2059011,"about_ca_system_score_codex":0.00010549055,"about_ca_system_score_gemma":0.00013787723,"threshold_uncertainty_score":0.9997284},"labels":[],"label_agreement":null},{"id":"W2115923606","doi":"10.1007/978-3-540-85230-8_14","title":"Weighing Down “The Unbearable Lightness of PIN Cracking”","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Carleton University","funders":"","keywords":"Computer science; Issuer; Cracking; ATM card; Operating system; Computer network; Embedded system; Payment; Chemistry; World Wide Web; Finance","score_opus":0.01618204368452554,"score_gpt":0.23417412414593197,"score_spread":0.21799208046140645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115923606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030686625,0.0010337206,0.98650664,0.005156976,0.0023270908,0.0004882658,0.0000036617175,0.00042260534,0.0037541434],"genre_scores_gemma":[0.31401756,0.0002628959,0.6812665,0.0025893925,0.0006563284,0.000028480232,0.0000025778957,0.00007128629,0.0011050137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950817,0.00004441349,0.00072985096,0.0016496397,0.001535298,0.0009590637],"domain_scores_gemma":[0.9953229,0.0007427738,0.00045066685,0.0029327543,0.00040676777,0.00014414644],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011269281,0.0006197021,0.0007468807,0.0010940694,0.0004965075,0.0004179683,0.010041799,0.0004350436,0.000010110812],"category_scores_gemma":[0.00023633661,0.00046894574,0.0001717448,0.0018704345,0.0014971093,0.00059911923,0.004101266,0.0012354152,0.00006273274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008329379,0.000043900433,0.00007544683,0.000051433177,0.000027915547,0.00020069847,0.002149438,0.09397329,0.00041539775,0.03355897,0.0012228404,0.86827236],"study_design_scores_gemma":[0.0007013881,0.00079056795,0.00085312687,0.0027113322,0.000031713647,0.000602944,0.0000013488292,0.54113704,0.03478814,0.3357119,0.079543345,0.0031271437],"about_ca_topic_score_codex":0.000054677235,"about_ca_topic_score_gemma":0.00008563281,"teacher_disagreement_score":0.8651452,"about_ca_system_score_codex":0.0002872174,"about_ca_system_score_gemma":0.0005711098,"threshold_uncertainty_score":0.99977624},"labels":[],"label_agreement":null},{"id":"W2116102335","doi":"10.1109/icme.2006.262800","title":"Peer-to-Peer Asynchronous Video Streaming using Skip List","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Asynchronous communication; Overlay; Scalability; Overlay network; Peer-to-peer; Flexibility (engineering); Task (project management); Computer network; Distributed computing; Multimedia; The Internet; Operating system","score_opus":0.016223484843085875,"score_gpt":0.2578480424630488,"score_spread":0.24162455761996293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116102335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13711835,0.00006758618,0.8254301,0.01606284,0.00060077733,0.00032309568,0.0000055869336,0.002210396,0.018181255],"genre_scores_gemma":[0.6032554,5.091698e-7,0.38744467,0.000770005,0.00021846047,0.00001593879,0.0000039242386,0.000024460871,0.008266637],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964776,0.000040470484,0.0004403239,0.0009252184,0.0011512543,0.0009651171],"domain_scores_gemma":[0.9975919,0.00013512882,0.00009691669,0.001467944,0.0005102138,0.00019790014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000604487,0.00035954814,0.0003384751,0.0004551523,0.00028155572,0.00065023993,0.0023203304,0.00018107255,0.00004435211],"category_scores_gemma":[0.0003156047,0.00034480993,0.00010283112,0.0016022447,0.000060804716,0.00059032324,0.0014696127,0.00026589946,0.0003805244],"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.000017189377,0.00041171003,0.012438967,0.000034009307,0.000076931385,0.00039987103,0.0008879332,0.082428426,0.017409723,0.14175464,0.4109793,0.3331613],"study_design_scores_gemma":[0.0012068519,0.0006326958,0.024276432,0.00022504645,0.000053730397,0.00033190017,0.0004019424,0.44954854,0.064523324,0.026622979,0.42880023,0.0033763156],"about_ca_topic_score_codex":0.0019058562,"about_ca_topic_score_gemma":0.00073079875,"teacher_disagreement_score":0.46613702,"about_ca_system_score_codex":0.00033495182,"about_ca_system_score_gemma":0.00011035656,"threshold_uncertainty_score":0.9999004},"labels":[],"label_agreement":null},{"id":"W2116477781","doi":"10.1109/wcnc.2007.524","title":"A Novel Gnutella Application Layer Multicast Protocol for Collaborative Virtual Environments over Mobile Ad-Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Multicast; Pragmatic General Multicast; Distributed computing; Protocol Independent Multicast; Reliable multicast; Source-specific multicast; IP multicast; Application layer; Xcast; Wireless ad hoc network; Operating system; Wireless","score_opus":0.022568278463890267,"score_gpt":0.30938133871192003,"score_spread":0.28681306024802977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116477781","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005439334,0.000013563127,0.883373,0.00019805021,0.00007729582,0.114860214,0.000008705948,0.0004356032,0.0004895926],"genre_scores_gemma":[0.040120013,0.0000033518693,0.49219128,0.0007658633,0.00012430846,0.46497843,0.000008211562,0.00003704599,0.0017714832],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978395,0.000016905966,0.00039426176,0.00075616763,0.00036717622,0.0006259838],"domain_scores_gemma":[0.99845237,0.0002528136,0.00015399106,0.00090225175,0.00008813127,0.00015045538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000504655,0.0002718278,0.00022628761,0.00013557175,0.00015593716,0.00012590304,0.0011317477,0.00022102178,0.000014117774],"category_scores_gemma":[0.000037799127,0.00024298963,0.00005929794,0.000830171,0.00009230354,0.000329013,0.0006040169,0.00016849957,0.000073465126],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004025223,0.0011352076,0.00040746565,0.00001850712,0.000083088504,0.0000068509776,0.00073643524,0.03303303,0.034789868,0.037414763,0.023056818,0.86891544],"study_design_scores_gemma":[0.002112509,0.0008387449,0.0012808744,0.000019010391,0.000006007957,0.000004620392,0.00016932246,0.22132488,0.016057951,0.0002989432,0.7573924,0.0004947413],"about_ca_topic_score_codex":0.0000030959493,"about_ca_topic_score_gemma":0.000050508148,"teacher_disagreement_score":0.8684207,"about_ca_system_score_codex":0.00018271965,"about_ca_system_score_gemma":0.000039677736,"threshold_uncertainty_score":0.99088293},"labels":[],"label_agreement":null},{"id":"W2116752490","doi":"10.1109/atc.2008.4760559","title":"A novel method for flash crowd avoidance in P2P video on demand streaming via pre-release distribution","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Crowds; Upload; Server; Computer network; Encryption; Bandwidth (computing); Schedule; Video quality; Peer-to-peer; Multimedia; Real-time computing; Computer security; Operating system","score_opus":0.019511278034637116,"score_gpt":0.2769859549885204,"score_spread":0.2574746769538833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116752490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066291645,0.000044894965,0.9306088,0.001618316,0.00013478735,0.0005019462,0.000020497007,0.00056300336,0.00021610627],"genre_scores_gemma":[0.45714626,0.0000059204085,0.5418314,0.0002871194,0.000033282853,0.00013050532,0.000008937621,0.000009121125,0.0005474997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982183,0.000041420262,0.00031175735,0.0006491043,0.00027030258,0.00050910853],"domain_scores_gemma":[0.9985667,0.00045091883,0.00008714407,0.00071305933,0.000088414665,0.00009377524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046850857,0.00021064891,0.00024814444,0.00015006559,0.00016575295,0.000065150656,0.00097145984,0.00013374953,0.0000026448222],"category_scores_gemma":[0.00046453433,0.00019539843,0.00007108168,0.0007721026,0.000047974696,0.0003540575,0.0003464165,0.00019770607,0.000026146705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024049608,0.00093135785,0.0032682698,0.00008395491,0.00005939189,0.000090088644,0.0010502317,0.05520652,0.04970671,0.07052249,0.034434978,0.7844055],"study_design_scores_gemma":[0.001339596,0.00044296993,0.026733747,0.000113957256,0.000007352473,0.00008206346,0.000016479615,0.8727178,0.082856625,0.0055989986,0.009516791,0.0005735992],"about_ca_topic_score_codex":0.00012532617,"about_ca_topic_score_gemma":0.00024666273,"teacher_disagreement_score":0.8175113,"about_ca_system_score_codex":0.000185322,"about_ca_system_score_gemma":0.000057106437,"threshold_uncertainty_score":0.79681164},"labels":[],"label_agreement":null},{"id":"W2116820886","doi":"10.1109/ipdps.2004.1303197","title":"Experimental studies of scalability in clustered web systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scalability; Testbed; Server; The Internet; Web service; Web server; Application server; Benchmark (surveying); Distributed computing; World Wide Web; Database","score_opus":0.04506985813381103,"score_gpt":0.31620540333318603,"score_spread":0.271135545199375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116820886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748682,0.0012206567,0.020356175,0.001455302,0.00037487358,0.0003212123,9.278395e-7,0.00040479234,0.0009978586],"genre_scores_gemma":[0.9705782,0.0000054810657,0.029237123,0.000058480065,0.000010506644,0.00004085639,1.2668511e-7,0.00000341328,0.0000658285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888384,0.000033480843,0.0003083135,0.00032140603,0.00022344546,0.0002295066],"domain_scores_gemma":[0.9991652,0.0000574854,0.000049342925,0.0006318775,0.00006166868,0.000034457087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031640715,0.0001083669,0.0002583096,0.00014258765,0.00002565073,0.000029395458,0.0008468604,0.000054029842,0.0000011503295],"category_scores_gemma":[0.000082541075,0.00008901591,0.000031305764,0.0005866456,0.000106417676,0.00020140356,0.00084416685,0.000070346316,0.000017280508],"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.00010472416,0.0030168323,0.04682912,0.00051383895,0.00029000067,0.00016791263,0.024855802,0.09576713,0.17814182,0.6172738,0.010267142,0.02277185],"study_design_scores_gemma":[0.0059294435,0.002007859,0.026393525,0.0008557905,0.000010948471,0.00007320616,0.02222983,0.05526396,0.8603012,0.023799676,0.0015017902,0.0016327522],"about_ca_topic_score_codex":0.00012998827,"about_ca_topic_score_gemma":0.00010950945,"teacher_disagreement_score":0.6821594,"about_ca_system_score_codex":0.00022281575,"about_ca_system_score_gemma":0.000043201504,"threshold_uncertainty_score":0.36299634},"labels":[],"label_agreement":null},{"id":"W2116893958","doi":"10.5555/1515984.1515996","title":"Dynamic load balancing in distributed content-based publish/subscribe","year":2006,"lang":"en","type":"article","venue":"TSpace","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Load balancing (electrical power); Scalability; Distributed computing; Publication; Load management; Context (archaeology); Network Load Balancing Services; Overhead (engineering); Computer network; Server; Operating system; Engineering","score_opus":0.01776372115982685,"score_gpt":0.2621603242008821,"score_spread":0.24439660304105523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116893958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3458081,0.00022697441,0.62806416,0.0226241,0.00032791047,0.00025801588,0.000008539196,0.0013523119,0.0013299426],"genre_scores_gemma":[0.95410043,0.0000012781147,0.044646405,0.00040803134,0.000018712337,0.000034825116,0.000023764658,0.000012636513,0.00075389],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981458,0.000043730903,0.00025395676,0.00050954334,0.0004166642,0.00063028245],"domain_scores_gemma":[0.9987352,0.000096878706,0.00008606088,0.0008670491,0.0001381834,0.00007664289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036754526,0.00019877178,0.00024003495,0.00021996698,0.00006362364,0.00029146238,0.0013901845,0.00012168457,0.0000074130053],"category_scores_gemma":[0.0002395838,0.00019860844,0.0000532108,0.001504402,0.000054724234,0.0003612497,0.00036373912,0.00025405214,0.00007610865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018886212,0.0015932157,0.18373361,0.00018321087,0.00009321097,0.0019110064,0.0026236172,0.09512193,0.10595354,0.12888266,0.37176275,0.1079524],"study_design_scores_gemma":[0.0032517337,0.0002505074,0.24217674,0.00027191624,0.0000135989985,0.00003354746,0.0007979327,0.6921445,0.017985286,0.0053333747,0.036193933,0.001546929],"about_ca_topic_score_codex":0.0014757413,"about_ca_topic_score_gemma":0.002471571,"teacher_disagreement_score":0.6082924,"about_ca_system_score_codex":0.00050758355,"about_ca_system_score_gemma":0.0001401802,"threshold_uncertainty_score":0.8099017},"labels":[],"label_agreement":null},{"id":"W2116910210","doi":"10.1109/icdcs.2010.31","title":"Practical Robust Communication in DHTs Tolerating a Byzantine Adversary","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Mitacs","keywords":"Computer science; Protocol (science); Binary logarithm; Cryptography; Communication complexity; Bounded function; Theoretical computer science; Quantum Byzantine agreement; Byzantine fault tolerance; Key (lock); Discrete logarithm; Distributed computing; Algorithm; Computer network; Fault tolerance; Public-key cryptography; Computer security; Discrete mathematics; Mathematics","score_opus":0.029069254972453766,"score_gpt":0.2944271993237668,"score_spread":0.26535794435131305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116910210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1679372,0.000025883393,0.7281267,0.07536499,0.00031174556,0.00031662543,5.954316e-7,0.0012878419,0.026628407],"genre_scores_gemma":[0.5026761,0.0000028566865,0.49682015,0.000382086,0.000013640754,0.000011738333,0.0000012619239,0.0000033197473,0.000088822155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901,0.000046902405,0.00021612985,0.0002766362,0.00018631862,0.00026397625],"domain_scores_gemma":[0.99838835,0.00030502985,0.000055699435,0.0011333321,0.000062377556,0.000055217068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005173001,0.000098215,0.000119405624,0.00014133504,0.00008288341,0.00013098081,0.0011680076,0.00010869135,0.000026329091],"category_scores_gemma":[0.0006778327,0.00009028442,0.000020335145,0.000621026,0.000037056536,0.00063593575,0.0010485932,0.00056418485,0.00012020519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012441468,0.00034145228,0.012656797,0.000011372129,0.000013533018,0.00007849047,0.00088879577,0.0021530774,0.015264416,0.8365264,0.04493649,0.08711673],"study_design_scores_gemma":[0.0005638479,0.00010596059,0.016661936,0.00006953516,0.000004128905,0.0001331103,0.00021352286,0.9376981,0.012800581,0.0038653892,0.027331708,0.0005521423],"about_ca_topic_score_codex":0.00009284748,"about_ca_topic_score_gemma":0.00080595445,"teacher_disagreement_score":0.9355451,"about_ca_system_score_codex":0.000012865246,"about_ca_system_score_gemma":0.00005064578,"threshold_uncertainty_score":0.3681692},"labels":[],"label_agreement":null},{"id":"W2116970140","doi":"10.1109/twc.2009.080550","title":"Distributed sender scheduling for multimedia transmission in wireless mobile peer-to-peer networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Wireless network; Distributed computing; Wireless; Communication source; Peer-to-peer; Telecommunications","score_opus":0.02759172987007586,"score_gpt":0.2963445592225808,"score_spread":0.26875282935250494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116970140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014120972,0.00011413652,0.9516257,0.030831652,0.00033342277,0.0017035673,0.00010270668,0.0010999023,0.00006792574],"genre_scores_gemma":[0.7580868,0.00013925476,0.2398552,0.00058087753,0.00002639668,0.0010226989,0.00006535457,0.00003341702,0.00018999047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968148,0.00018149751,0.0007385729,0.0007958844,0.0006244864,0.00084479235],"domain_scores_gemma":[0.9946969,0.0008067368,0.0001263319,0.0034467306,0.0005756864,0.0003476087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007434069,0.00043714393,0.0005006214,0.0006821028,0.00075643376,0.00022956554,0.0042304676,0.00037104797,0.000006203817],"category_scores_gemma":[0.000037117923,0.0004710777,0.00022174616,0.002651898,0.0001258136,0.0004896744,0.000040245275,0.0010264816,0.000036176523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050021226,0.0007842465,0.0000137503675,0.000008026761,0.000031676427,0.0000027923636,0.00096445624,0.4655652,0.0022525976,0.0017008738,0.00086269283,0.52776366],"study_design_scores_gemma":[0.0010112796,0.00032546214,0.00044618314,0.00019888846,0.000029579702,0.000008619802,0.00020858037,0.980627,0.007918651,0.000625027,0.007972016,0.0006287349],"about_ca_topic_score_codex":0.000060976403,"about_ca_topic_score_gemma":0.00026226,"teacher_disagreement_score":0.74396586,"about_ca_system_score_codex":0.0003114192,"about_ca_system_score_gemma":0.00012346118,"threshold_uncertainty_score":0.9997741},"labels":[],"label_agreement":null},{"id":"W2117364228","doi":"10.1109/ccece.2005.1557148","title":"Effects of lying in reputation-based multi-agent systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Reputation; Computer science; Computer security; Lying; The Internet; Scheme (mathematics); Strengths and weaknesses; Multi-agent system; Internet privacy; Autonomous agent; World Wide Web; Artificial intelligence","score_opus":0.010302240166063936,"score_gpt":0.23298967712332827,"score_spread":0.22268743695726434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117364228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15102512,0.00017176151,0.8471198,0.00026908534,0.00021983532,0.00033861873,2.5426613e-7,0.00042498874,0.00043050438],"genre_scores_gemma":[0.8712863,3.900488e-7,0.12844647,0.000057966405,0.000011488756,0.000047831818,6.267752e-7,0.000004287495,0.00014463784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905974,0.00004057059,0.00024886313,0.00025257433,0.00019850674,0.00019976783],"domain_scores_gemma":[0.9992582,0.00023942339,0.00006995445,0.00035992137,0.000050469956,0.000022037666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021639376,0.000087075496,0.00014773541,0.00024224208,0.00002274945,0.000048640915,0.0005316621,0.000054192726,3.8369797e-7],"category_scores_gemma":[0.00009153975,0.000078350145,0.000027079617,0.000681122,0.000018538218,0.00010757404,0.00011968927,0.000057941506,0.000014380419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093664585,0.0005709118,0.045552433,0.0004943975,0.000018091667,0.000199379,0.00034613512,0.8108923,0.028190808,0.065106384,0.0045870147,0.044032805],"study_design_scores_gemma":[0.0005500417,0.000053136835,0.045240175,0.00012780777,0.0000020572797,0.0000016100425,0.000018243469,0.90439427,0.048737872,0.00044645564,0.00027403672,0.00015428982],"about_ca_topic_score_codex":0.0006421009,"about_ca_topic_score_gemma":0.000074802905,"teacher_disagreement_score":0.72026116,"about_ca_system_score_codex":0.00006872699,"about_ca_system_score_gemma":0.000030149884,"threshold_uncertainty_score":0.31950262},"labels":[],"label_agreement":null},{"id":"W2117718929","doi":"10.1007/s12083-009-0048-4","title":"Adaptive topology formation for peer-to-peer video streaming","year":2009,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Upload; Video quality; Bandwidth (computing); Overlay; Peer-to-peer; Distributed computing; Overlay network; Network topology; The Internet; Real-time computing","score_opus":0.025986668830844765,"score_gpt":0.2889531711439613,"score_spread":0.2629665023131165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117718929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004443948,0.00014278162,0.8308169,0.1574212,0.00051114906,0.0027936308,0.000074931595,0.0012644186,0.002531003],"genre_scores_gemma":[0.6802312,0.000013222645,0.30231023,0.0070649358,0.0013891548,0.0024443946,0.00012367498,0.00006061429,0.006362562],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9945935,0.00007735137,0.0008594251,0.0015941939,0.0013496277,0.0015258797],"domain_scores_gemma":[0.99482656,0.00053368876,0.000253762,0.0016977628,0.0019240691,0.0007641683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016827724,0.00064168154,0.000672197,0.0007931032,0.0010444517,0.00065409864,0.0022541878,0.00035209212,0.000005833293],"category_scores_gemma":[0.00052296254,0.00068079896,0.00016904042,0.0027406006,0.00009047518,0.0005377867,0.0008363945,0.00049055857,0.00023604647],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058760266,0.00014289156,0.00016238168,0.000015978985,0.000050556337,0.000004403994,0.002358069,0.0145394,0.00070568983,0.067782536,0.2181941,0.69598526],"study_design_scores_gemma":[0.00053719553,0.00074582756,0.002120187,0.00010802154,0.00005676344,0.00004676148,0.0004369255,0.036253143,0.0010950755,0.023857202,0.9337176,0.0010252829],"about_ca_topic_score_codex":0.00006002915,"about_ca_topic_score_gemma":0.00012865519,"teacher_disagreement_score":0.71552354,"about_ca_system_score_codex":0.00028962377,"about_ca_system_score_gemma":0.00009444459,"threshold_uncertainty_score":0.9995643},"labels":[],"label_agreement":null},{"id":"W2117760870","doi":"10.1145/1111604.1111607","title":"An analytical study of peer-to-peer media streaming systems","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Peer-to-peer; Server; Distributed computing; Bandwidth (computing); Exponential growth; Live streaming; File sharing; Computer network; The Internet; World Wide Web","score_opus":0.04184076431951861,"score_gpt":0.3316497509503699,"score_spread":0.2898089866308513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117760870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07049881,0.00007976603,0.9172882,0.009768238,0.000083222054,0.0013979167,0.000039659808,0.00067697925,0.00016721581],"genre_scores_gemma":[0.6675952,0.000019461291,0.3318382,0.000092955546,0.00005312021,0.00032171363,0.00001622158,0.000017962493,0.000045179586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973819,0.00018221691,0.00071432575,0.00068194646,0.0006539314,0.00038564554],"domain_scores_gemma":[0.99139726,0.001460197,0.00016880756,0.0059194146,0.00070945494,0.0003448587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077969325,0.00027771672,0.0003798287,0.00065016904,0.00080228254,0.0002089779,0.004822813,0.00012720187,0.0000029035682],"category_scores_gemma":[0.00016855655,0.0002897113,0.00006281151,0.0018355885,0.00016646103,0.0002909511,0.00035807397,0.0005011579,0.00004484036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006181452,0.002626648,0.00052419316,0.000008874681,0.00008201095,4.9182444e-7,0.006594648,0.060110897,0.00038544004,0.005465929,0.00021218645,0.9239825],"study_design_scores_gemma":[0.0006512531,0.00043107435,0.0051534045,0.000055733217,0.000076861565,0.000012136076,0.0041274265,0.97246826,0.00023448521,0.00024329296,0.016082747,0.00046333353],"about_ca_topic_score_codex":0.00028060813,"about_ca_topic_score_gemma":0.00039955587,"teacher_disagreement_score":0.9235192,"about_ca_system_score_codex":0.00009662445,"about_ca_system_score_gemma":0.00006051777,"threshold_uncertainty_score":0.9999555},"labels":[],"label_agreement":null},{"id":"W2118295498","doi":"10.1109/ipdps.2007.370661","title":"Shrack: Description and Performance Evaluation of a Peer-to-Peer System for Document Sharing and Tracking using Pull-Only Information Dissemination","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Scalability; Peer-to-peer; Overlay; Protocol (science); World Wide Web; Information sharing; Overlay network; Tracking (education); Information retrieval; Database; The Internet","score_opus":0.041362275052722164,"score_gpt":0.3165338728196836,"score_spread":0.27517159776696143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118295498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5349466,0.000020274314,0.46382418,0.00026299633,0.000116395146,0.000558717,9.893794e-7,0.00011519303,0.0001546341],"genre_scores_gemma":[0.8969465,0.0000022614136,0.102894686,0.000027971058,0.000025044103,0.00003448664,0.000008327693,0.0000062512827,0.000054470696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979874,0.0000179185,0.00048147445,0.0002885358,0.000937298,0.00028739183],"domain_scores_gemma":[0.9980335,0.000068616064,0.00020038038,0.00029037922,0.0013317365,0.00007535204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005062792,0.00014511189,0.0001656395,0.0004911847,0.00016828772,0.0003608877,0.0003063356,0.00009285584,8.556188e-7],"category_scores_gemma":[0.00038692288,0.00014042784,0.000022368742,0.0005155137,0.000021739583,0.0030260268,0.00025521233,0.00007140636,0.000001749997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045015666,0.000017814578,0.011899934,0.0002299591,0.00001675368,2.7474493e-7,0.0036217857,0.004474833,0.0059215114,0.012891928,0.00014458672,0.9607356],"study_design_scores_gemma":[0.000381918,0.00019069834,0.053356435,0.0003188366,0.000034221328,0.00003499331,0.0010708856,0.9263505,0.017514689,0.0003670944,0.00016823519,0.00021149572],"about_ca_topic_score_codex":0.000028827017,"about_ca_topic_score_gemma":0.000031902327,"teacher_disagreement_score":0.9605241,"about_ca_system_score_codex":0.00034384304,"about_ca_system_score_gemma":0.00003961459,"threshold_uncertainty_score":0.5726481},"labels":[],"label_agreement":null},{"id":"W2118412486","doi":"10.1109/p2p.2009.5284521","title":"The impact of NAT on BitTorrent-like P2P systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Carnegie Mellon University; University of Southern California","keywords":"BitTorrent; Nat; NAT traversal; Computer science; Network address translation; The Internet; Computer network; Peer-to-peer; Distributed computing; World Wide Web; Internet Protocol","score_opus":0.014278709938625636,"score_gpt":0.28056715927504694,"score_spread":0.2662884493364213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118412486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5846064,0.0023529066,0.30222827,0.01741674,0.004805163,0.0016562938,0.000009009417,0.004866511,0.08205866],"genre_scores_gemma":[0.99681187,0.0000164123,0.0018782549,0.00012557048,0.00003682033,0.0000058318537,2.5364116e-7,0.0000035909682,0.0011213981],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891454,0.000031709234,0.00019261811,0.00023450263,0.0003075688,0.00031908904],"domain_scores_gemma":[0.99862385,0.00013857825,0.000070615315,0.0010291657,0.00007910564,0.00005868806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026760934,0.00012581851,0.00014940849,0.00010915848,0.00008983355,0.00016586925,0.0017989792,0.000060187594,0.000001808651],"category_scores_gemma":[0.00006400258,0.00006672854,0.00008662911,0.0005924351,0.000034423763,0.00013589325,0.00014108929,0.00011632203,0.00007511432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023236931,0.00015403579,0.0009752796,0.0000050569806,0.000057003952,0.000013920926,0.0002182674,0.01217812,0.0022773645,0.29360664,0.3893225,0.3011686],"study_design_scores_gemma":[0.00195007,0.0125910435,0.16409515,0.0005562702,0.000026070275,0.00016854735,0.00049587106,0.6488106,0.03053201,0.045255702,0.09315463,0.0023640215],"about_ca_topic_score_codex":0.00010518808,"about_ca_topic_score_gemma":0.000006883537,"teacher_disagreement_score":0.6366325,"about_ca_system_score_codex":0.000082856386,"about_ca_system_score_gemma":0.00003923401,"threshold_uncertainty_score":0.3342981},"labels":[],"label_agreement":null},{"id":"W2118440380","doi":"10.1109/wi-iat.2011.231","title":"A Distributed Wiki System Based on Peer-to-Peer File Sharing Principles","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Software versioning; Collaborative editing; Upload; World Wide Web; Download; File sharing; Peer-to-peer; BitTorrent tracker; Reuse; Software; The Internet; Operating system","score_opus":0.05278702542740035,"score_gpt":0.24078373550846488,"score_spread":0.18799671008106453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118440380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013353828,0.000006824859,0.9186443,0.005929815,0.0005677369,0.0007210619,0.00024557053,0.0059425943,0.054588247],"genre_scores_gemma":[0.7641681,1.1906443e-7,0.22908011,0.00079231116,0.000054346885,0.0002110052,0.000053027634,0.000027099557,0.0056138947],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672866,0.000037766247,0.00040764702,0.0010168663,0.0010214936,0.0007875414],"domain_scores_gemma":[0.9968388,0.00015112964,0.000102829654,0.0021945594,0.00040595466,0.00030672716],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006729224,0.00034187472,0.0003372888,0.00036608503,0.00018344137,0.0002726505,0.0035960665,0.00016686316,0.00025271694],"category_scores_gemma":[0.0005941757,0.00029344193,0.0001041764,0.0013452993,0.00004157351,0.0002800319,0.0015950357,0.00026216832,0.0011699786],"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.0000992105,0.00045203717,0.0068085394,0.00012520731,0.000087283275,0.0003708204,0.0012558054,0.012546222,0.0003103623,0.40250388,0.5508968,0.024543792],"study_design_scores_gemma":[0.0006330825,0.0007138074,0.030116249,0.00045768011,0.000017307433,0.000030658513,0.00028173983,0.72379977,0.012660653,0.00078563776,0.22925268,0.0012507684],"about_ca_topic_score_codex":0.00017713761,"about_ca_topic_score_gemma":0.0000820799,"teacher_disagreement_score":0.75081426,"about_ca_system_score_codex":0.00027093542,"about_ca_system_score_gemma":0.00007254608,"threshold_uncertainty_score":0.9999518},"labels":[],"label_agreement":null},{"id":"W2118877017","doi":"10.1145/1536513.1536566","title":"Mammoth","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mammoth; Modular design; Architecture; Computer science; Replication (statistics); Software engineering; Archaeology; Geography; Programming language","score_opus":0.008340718693413083,"score_gpt":0.23186885663818885,"score_spread":0.22352813794477577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118877017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007295022,0.000030179646,0.87229496,0.032864936,0.00012507598,0.00006587346,1.04857946e-7,0.0020604988,0.08526333],"genre_scores_gemma":[0.64465785,0.0000019132217,0.34881902,0.0038485164,0.000021609307,0.0000017097044,1.01385936e-7,0.0000014865318,0.00264777],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993793,0.0000053345652,0.000071265364,0.00020224381,0.0001311536,0.00021073817],"domain_scores_gemma":[0.9993432,0.00001350597,0.000011348554,0.00056351617,0.000020332584,0.0000480975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000776344,0.00006117303,0.00006298172,0.000076163575,0.000031487212,0.00007762566,0.0011259656,0.000034401663,0.000011975685],"category_scores_gemma":[0.000023221646,0.00005026517,0.000019292642,0.00043173958,0.000009019799,0.00016361708,0.00017674195,0.000056907393,0.00043177584],"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":[4.658152e-7,0.000014561725,0.000083316874,2.3692688e-7,0.0000012958352,0.000010982612,0.00003706552,0.000043910288,0.00044839026,0.41523498,0.07841214,0.5057126],"study_design_scores_gemma":[0.00040295813,0.00076597277,0.054328475,0.000021068063,0.0000033423541,0.00006883987,0.000031620526,0.031420447,0.04061162,0.3991918,0.4723038,0.0008500282],"about_ca_topic_score_codex":0.0000037454085,"about_ca_topic_score_gemma":0.000003863013,"teacher_disagreement_score":0.63736284,"about_ca_system_score_codex":0.000015964999,"about_ca_system_score_gemma":0.000010109779,"threshold_uncertainty_score":0.5549749},"labels":[],"label_agreement":null},{"id":"W2119865281","doi":"10.26503/dl.v2005i1.154","title":"Bringing New HOPE to Networked Games: Using Optimistic Execution to Improve Quality of Service","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Turns, rounds and time-keeping systems in games; Consistency (knowledge bases); Variety (cybernetics); Service (business); Quality of service; Latency (audio); Quality (philosophy); Game mechanics; Multimedia; Video game design; Computer network; Artificial intelligence; Telecommunications","score_opus":0.046771860175964464,"score_gpt":0.314923021224254,"score_spread":0.2681511610482895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119865281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17399257,0.000040515646,0.81346905,0.010410944,0.00022432904,0.00034179885,0.0000013286805,0.0006280386,0.0008914105],"genre_scores_gemma":[0.42137772,0.0000011593115,0.57483083,0.0031427029,0.00013924345,0.000006888561,5.5185006e-7,0.000010456747,0.0004904318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789256,0.000044180277,0.0004892702,0.00062045525,0.00037621445,0.0005773124],"domain_scores_gemma":[0.99817115,0.00010473812,0.00012106077,0.0011036088,0.00021982979,0.00027958976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005905316,0.00021243116,0.00032025966,0.00022909133,0.000077806784,0.00014458131,0.0015204302,0.00009628607,0.000016573451],"category_scores_gemma":[0.00022324755,0.00021459568,0.00005582191,0.0018666141,0.000014469283,0.0003703048,0.0013195839,0.0001317484,0.000085018524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026896469,0.00004193931,0.000111560345,0.00002966051,0.00002083978,0.0000025514908,0.00095725316,0.7034218,0.029767098,0.005647066,0.008110612,0.25186273],"study_design_scores_gemma":[0.00036233876,0.00016018463,0.0021348896,0.00017917262,0.000013437481,0.000008643052,0.00014699236,0.9662847,0.021375375,0.00089887483,0.0078000072,0.0006353993],"about_ca_topic_score_codex":0.0017404968,"about_ca_topic_score_gemma":0.0005598789,"teacher_disagreement_score":0.2628629,"about_ca_system_score_codex":0.00021852534,"about_ca_system_score_gemma":0.00010751445,"threshold_uncertainty_score":0.8750958},"labels":[],"label_agreement":null},{"id":"W2119991450","doi":"10.1109/mmedia.2009.27","title":"Prefetching Optimization in P2P VoD Applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheme (mathematics); Computer science; Cache; Peer-to-peer; Position (finance); Computer network; Video on demand; Real-time computing; Distributed computing","score_opus":0.009776042106337432,"score_gpt":0.2449176335173662,"score_spread":0.23514159141102878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119991450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083426194,0.000026199503,0.97252464,0.008436941,0.00002737771,0.00023950681,1.4952681e-7,0.0008590129,0.0170519],"genre_scores_gemma":[0.4191102,0.000005164972,0.5799786,0.0006451859,0.00001388777,0.000035376142,0.0000010636104,0.0000020727264,0.00020844258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992952,0.000011235135,0.00013559264,0.00025728517,0.000116503754,0.00018418353],"domain_scores_gemma":[0.9993791,0.000023405768,0.000025556921,0.00051052513,0.000028001674,0.000033416127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012356772,0.00006864993,0.000071840484,0.00017581676,0.0000443289,0.000086294545,0.00084859953,0.00004891512,0.000003927284],"category_scores_gemma":[0.000024054078,0.00006549139,0.000013964365,0.0009242055,0.000007611283,0.00030177212,0.00015142203,0.00008703674,0.00004327507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.337833e-7,0.000055887915,0.00023692119,0.0000011445414,0.0000013965873,0.0000016731547,0.00015669795,0.39088425,0.00017616102,0.17350732,0.001853408,0.4331243],"study_design_scores_gemma":[0.00017999446,0.00006771524,0.0064802784,0.000014210906,0.0000013062099,0.0000054926604,0.000023006321,0.9455082,0.0012382122,0.038606994,0.007634629,0.000239985],"about_ca_topic_score_codex":0.000008396183,"about_ca_topic_score_gemma":0.000021011176,"teacher_disagreement_score":0.5546239,"about_ca_system_score_codex":0.000044152865,"about_ca_system_score_gemma":0.000016625583,"threshold_uncertainty_score":0.26706612},"labels":[],"label_agreement":null},{"id":"W2120064332","doi":"10.1109/icip.2005.1530619","title":"Graceful image retrieval performance degradation using small world distributed indexing","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Search engine indexing; Computer science; Index (typography); Degradation (telecommunications); Image retrieval; Small-world network; Information retrieval; Image (mathematics); Object (grammar); Architecture; Set (abstract data type); Small data; Distributed computing; Data mining; Artificial intelligence; World Wide Web; Telecommunications; Geography","score_opus":0.031593424545540635,"score_gpt":0.2541400835864346,"score_spread":0.22254665904089393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120064332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39465824,0.000025132165,0.6013156,0.0022215403,0.00012134751,0.0001221134,0.0000019509412,0.0008485195,0.00068550784],"genre_scores_gemma":[0.5382061,0.0000037499256,0.46072468,0.00024119166,0.000071089824,0.0000027836534,0.000006757687,0.0000085499405,0.00073510606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984052,0.000027146749,0.00029540012,0.0004518357,0.0003177988,0.00050257583],"domain_scores_gemma":[0.9989065,0.000060159608,0.00010105211,0.000705121,0.00013235396,0.00009479348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038092566,0.00018841868,0.00016784795,0.0003194182,0.0002048668,0.0002940471,0.0012086631,0.00007857165,0.000014842255],"category_scores_gemma":[0.00010545478,0.00017848803,0.000044560024,0.0020771634,0.00005193419,0.0010997708,0.0006637283,0.00025349663,0.000094144896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010476253,0.00028792906,0.0353802,0.00006236341,0.00008274772,0.000055188753,0.0005743579,0.029387634,0.052968066,0.04232555,0.012217263,0.82655394],"study_design_scores_gemma":[0.00030541053,0.00005834467,0.010189001,0.00005347007,0.000008013331,0.000027649567,0.000021496233,0.848356,0.12017509,0.000524119,0.019813254,0.00046812795],"about_ca_topic_score_codex":0.00002062981,"about_ca_topic_score_gemma":0.00012834955,"teacher_disagreement_score":0.8260858,"about_ca_system_score_codex":0.0002563676,"about_ca_system_score_gemma":0.000056083805,"threshold_uncertainty_score":0.72785306},"labels":[],"label_agreement":null},{"id":"W2120362491","doi":"10.1109/wocn.2005.1436041","title":"RAON: a P2P network for MANET","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network","score_opus":0.015944623134989067,"score_gpt":0.2508273383348236,"score_spread":0.23488271519983456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120362491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016537481,0.00017685058,0.9573979,0.028125204,0.00033285923,0.00033562156,0.0000013516025,0.0016814043,0.010295068],"genre_scores_gemma":[0.09647481,0.0000070396864,0.8923083,0.0042573465,0.00051743,0.0000894048,0.0000019675742,0.0000099493145,0.00633374],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877644,0.0000105652125,0.00016672428,0.00036739054,0.0001603888,0.0005185131],"domain_scores_gemma":[0.9989875,0.000106461215,0.000033920638,0.00074579794,0.00004707526,0.000079256926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025313106,0.00012639878,0.00014287779,0.000065730994,0.000094393305,0.000120440614,0.0015025244,0.00008176051,0.000026880634],"category_scores_gemma":[0.000036252015,0.00011025856,0.00005372343,0.0004670943,0.00002316065,0.0002362298,0.00048962387,0.00008245331,0.00038048613],"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.000003164277,0.000012583732,0.00007640207,0.0000018797526,0.0000068124964,0.0000020275227,0.000030438287,0.004682958,0.000020262034,0.1597169,0.6066958,0.22875078],"study_design_scores_gemma":[0.00018815938,0.00008018392,0.00029577274,0.0000074805357,0.0000024098356,0.000010956544,0.000004111429,0.10075069,0.0006330363,0.015646258,0.88218796,0.00019296116],"about_ca_topic_score_codex":0.000006656688,"about_ca_topic_score_gemma":0.000092402544,"teacher_disagreement_score":0.2754922,"about_ca_system_score_codex":0.000039720533,"about_ca_system_score_gemma":0.000022522787,"threshold_uncertainty_score":0.48905063},"labels":[],"label_agreement":null},{"id":"W2120709141","doi":"10.1109/lcomm.2015.2411591","title":"Accurate One-Way Delay Estimation With Reduced Client Trustworthiness","year":2015,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canada Research Chairs","keywords":"Computer science; Server; Synchronization (alternating current); Trustworthiness; Clock synchronization; Real-time computing; Probability distribution; Client–server model; Algorithm; Network Time Protocol; Time synchronization; Computer network; Distributed computing; Computer security","score_opus":0.07258303302495243,"score_gpt":0.2979948296452297,"score_spread":0.22541179662027727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120709141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15083335,0.00008097152,0.7453327,0.10149536,0.00026549582,0.00036496934,0.0000027217698,0.00094447244,0.0006799457],"genre_scores_gemma":[0.61444825,0.0000108312015,0.38321173,0.00211823,0.000019690695,0.00013339063,0.000012183107,0.000013017367,0.00003268642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983897,0.00016101585,0.00032451018,0.00037404773,0.00039944155,0.00035124685],"domain_scores_gemma":[0.99453753,0.00016554624,0.00018266476,0.004720233,0.00023529673,0.0001587536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050290633,0.00019899009,0.00020416506,0.00025729963,0.00026311478,0.00025441372,0.00490692,0.00007417582,9.715669e-7],"category_scores_gemma":[0.00011933111,0.00018415756,0.000038031652,0.0013323827,0.00019981171,0.0007292561,0.0008525312,0.00034408472,0.00014322043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009503631,0.00074538944,0.0014307406,0.000029278175,0.00027330386,0.000048571044,0.009013102,0.5142936,0.0144135235,0.04458203,0.1576709,0.2574045],"study_design_scores_gemma":[0.0016948364,0.0003513196,0.0059807277,0.00026937618,0.00007395811,0.00014310282,0.00023615462,0.9420809,0.007846603,0.0038091925,0.036044087,0.0014697376],"about_ca_topic_score_codex":0.00006386596,"about_ca_topic_score_gemma":0.000090439215,"teacher_disagreement_score":0.46361488,"about_ca_system_score_codex":0.00020145466,"about_ca_system_score_gemma":0.000096231655,"threshold_uncertainty_score":0.9118359},"labels":[],"label_agreement":null},{"id":"W2121285657","doi":"10.1109/mmcs.1999.778518","title":"Dynamic optimization of readsize in hypermedia servers","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Throughput; Server; Hypermedia; Bandwidth (computing); Quality of service; Scheduling (production processes); Computer network; Service (business); Operating system; Distributed computing; Real-time computing; Engineering","score_opus":0.007983484071134505,"score_gpt":0.22304314416871782,"score_spread":0.21505966009758332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121285657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08478281,0.000037281778,0.9036625,0.001124741,0.00018487286,0.00014490071,4.96807e-7,0.0003295948,0.0097327735],"genre_scores_gemma":[0.54886144,0.000010554194,0.45078135,0.00009140811,8.8547034e-7,0.0000051336965,5.7085157e-7,0.0000030591646,0.0002455885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992761,0.00002835785,0.00016368032,0.00020839697,0.00014452098,0.0001789197],"domain_scores_gemma":[0.9994082,0.000050191255,0.000036812653,0.00043373826,0.000041506864,0.000029549694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019561409,0.00007077067,0.00011153394,0.00017827706,0.000012457234,0.000017479113,0.00056862313,0.00006115529,0.00001540658],"category_scores_gemma":[0.00017142121,0.00006670315,0.00001842925,0.0009195899,0.000027325677,0.0001916984,0.00012135768,0.00006293784,0.000013941579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004272258,0.00009560055,0.008331731,0.000013996321,0.000009639786,0.000017959,0.00039614737,0.8535722,0.00092604314,0.11459416,0.0019250574,0.020113207],"study_design_scores_gemma":[0.00040020485,0.000087617234,0.0070366915,0.000028137838,0.0000021576393,0.000009188307,0.00010463857,0.98158705,0.0045119706,0.0052014333,0.00079644815,0.00023446725],"about_ca_topic_score_codex":0.000023784174,"about_ca_topic_score_gemma":0.000094578136,"teacher_disagreement_score":0.46407863,"about_ca_system_score_codex":0.000051301817,"about_ca_system_score_gemma":0.000035448942,"threshold_uncertainty_score":0.27200755},"labels":[],"label_agreement":null},{"id":"W2121522742","doi":"10.1016/j.comnet.2014.12.009","title":"Fighting pollution attacks in P2P streaming","year":2015,"lang":"en","type":"article","venue":"Computer Networks","topic":"Peer-to-Peer Network Technologies","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 Calgary","funders":"","keywords":"Computer science; Reputation; Key (lock); Reputation system; The Internet; Computer security; Peer-to-peer; Computer network; Single point of failure; Pollution; Distributed computing; World Wide Web","score_opus":0.027746372644504188,"score_gpt":0.25555827052893887,"score_spread":0.22781189788443468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121522742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025851043,0.00041134647,0.96771646,0.0021570325,0.001633647,0.00022229977,5.6918867e-7,0.0010453624,0.0009622704],"genre_scores_gemma":[0.8002204,0.000007295947,0.19810961,0.000954045,0.00059805263,0.000018471977,0.0000044830444,0.000016710486,0.000070934555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977565,0.00009759488,0.00039064616,0.00066731544,0.0003303214,0.00075766526],"domain_scores_gemma":[0.9985511,0.000102731094,0.00010897091,0.0009153302,0.00010190032,0.00022000787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061899895,0.0002570998,0.0002958756,0.00032354528,0.00008895531,0.00027663325,0.0017840981,0.00020379023,0.0000016466098],"category_scores_gemma":[0.00004774969,0.00026060583,0.000059240578,0.0014387334,0.000043012937,0.0005056755,0.0016527214,0.0004288625,0.0000683434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054827497,0.00004162654,0.004024472,0.000003471379,0.000010030651,0.000084718806,0.00044168197,0.49671337,0.000005270244,0.0049900333,0.039976593,0.45370322],"study_design_scores_gemma":[0.00038868823,0.00011369965,0.007710156,0.00010959143,0.0000022654901,0.000027685375,0.000018012866,0.9786752,0.000031151514,0.0019812211,0.010612855,0.00032945952],"about_ca_topic_score_codex":0.000038868126,"about_ca_topic_score_gemma":0.00006286298,"teacher_disagreement_score":0.77436936,"about_ca_system_score_codex":0.00023134939,"about_ca_system_score_gemma":0.0000622867,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W2121847544","doi":"10.1109/ptp.2003.1231532","title":"Efa: an efficient content routing algorithm in large peer-to-peer overlay networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Flooding (psychology); Computer science; Scalability; Overlay network; Peer-to-peer; Overlay; Distributed computing; Routing algorithm; Computer network; Network topology; The Internet; Routing protocol; Routing (electronic design automation); World Wide Web","score_opus":0.023441307182458366,"score_gpt":0.2627235434834612,"score_spread":0.23928223630100284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121847544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08745313,0.000067924084,0.8942705,0.013903375,0.0009131687,0.0006165803,0.0000066591792,0.0015167748,0.0012519377],"genre_scores_gemma":[0.7244456,0.0000019293675,0.2718391,0.0025315655,0.00013054501,0.000056623485,0.0000075961816,0.000026689491,0.0009603542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954211,0.000072840616,0.0006069712,0.0011683734,0.0012018854,0.0015288137],"domain_scores_gemma":[0.99750614,0.000098001656,0.00010514342,0.0014707186,0.00043058494,0.00038943047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018555779,0.00041202232,0.00045643252,0.00045644055,0.00020387833,0.00041021605,0.0024798396,0.000252742,0.000014078457],"category_scores_gemma":[0.0003380954,0.0003745647,0.00010765923,0.0020735804,0.00004923274,0.00039774735,0.00169917,0.0005611372,0.00019347909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015115794,0.0006890196,0.0023861963,0.0000044530443,0.000029476085,0.00026705136,0.0021809752,0.7546293,0.00017977544,0.0936318,0.005097659,0.14088915],"study_design_scores_gemma":[0.001673711,0.00044377006,0.020146672,0.00010051254,0.0000065959866,0.000040274677,0.00058075617,0.96521825,0.0012253631,0.0010027647,0.008683545,0.00087778486],"about_ca_topic_score_codex":0.00045443882,"about_ca_topic_score_gemma":0.0006222416,"teacher_disagreement_score":0.63699245,"about_ca_system_score_codex":0.00048853346,"about_ca_system_score_gemma":0.00009546093,"threshold_uncertainty_score":0.99987066},"labels":[],"label_agreement":null},{"id":"W2122453932","doi":"10.5555/1996039.1996047","title":"On long-term social relationships in peer-to-peer systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"BitTorrent; PlanetLab; Computer science; Upload; Software deployment; File sharing; Peer-to-peer; The Internet; Term (time); Social network (sociolinguistics); Set (abstract data type); Locality; Internet privacy; World Wide Web; Social media","score_opus":0.08871505342169277,"score_gpt":0.2798284344872455,"score_spread":0.1911133810655527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122453932","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4984858,0.000034257864,0.40583986,0.017208556,0.0015918048,0.0009394481,0.0000052343416,0.0023084779,0.07358657],"genre_scores_gemma":[0.9703024,5.0933846e-7,0.019451685,0.00042618395,0.00007974516,0.00008784822,0.0000026237424,0.000016445329,0.00963254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976664,0.00011109523,0.0003541674,0.00057817553,0.0007611824,0.000528948],"domain_scores_gemma":[0.9986162,0.00014902714,0.00006816407,0.0008094184,0.00023051957,0.00012662963],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010262394,0.00020915724,0.00024127802,0.00052988384,0.00017359815,0.00017621845,0.0017741668,0.00021835238,0.000025370184],"category_scores_gemma":[0.00044462935,0.00019255183,0.000054067717,0.0012653602,0.000041689855,0.00032854476,0.0005789757,0.00043307155,0.0012929636],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002461072,0.00019423285,0.07200059,0.000015753587,0.000021831705,0.000114576455,0.0052664718,0.0004664389,0.000053646745,0.8115885,0.09685757,0.013395766],"study_design_scores_gemma":[0.0006108384,0.00038224706,0.96963066,0.00011905266,0.000008316407,0.000028155517,0.00030775822,0.005304089,0.0007169855,0.01774171,0.004232197,0.00091798196],"about_ca_topic_score_codex":0.00012991387,"about_ca_topic_score_gemma":0.0003549758,"teacher_disagreement_score":0.8976301,"about_ca_system_score_codex":0.00017488858,"about_ca_system_score_gemma":0.000046914236,"threshold_uncertainty_score":0.99948466},"labels":[],"label_agreement":null},{"id":"W2123592286","doi":"10.1145/2405688.2405689","title":"Language expressiveness and quality of service for publish/subscribe systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Event (particle physics); Service (business); Publication; Software deployment; Quality of service; Reliability (semiconductor); Scale (ratio); Throughput; Quality (philosophy); Complex event processing; Focus (optics); Distributed computing; Database; Computer network; Software engineering; Telecommunications","score_opus":0.0621493757070321,"score_gpt":0.3127150113639017,"score_spread":0.25056563565686957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123592286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43237442,0.0010922395,0.5616003,0.0019980932,0.0004919815,0.0004233111,0.000014910248,0.0005019894,0.0015027397],"genre_scores_gemma":[0.95466363,0.0000017094645,0.044545807,0.0003319004,0.000057611425,0.000077605466,0.0000023421492,0.000006084921,0.00031331962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901557,0.000048361355,0.00022323389,0.00021520276,0.00018778609,0.00030986985],"domain_scores_gemma":[0.99879926,0.00020907757,0.00010001406,0.0006357852,0.0001660052,0.000089861554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073932525,0.00009785137,0.00020957622,0.00008198665,0.000040000454,0.00011873781,0.0008605994,0.000077758974,0.0000019035003],"category_scores_gemma":[0.00015746645,0.00008042947,0.000024749677,0.00036199615,0.00002216452,0.00082837156,0.0005554478,0.00004933562,0.000004339948],"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.000031224197,0.00019766868,0.026409222,0.00096881104,0.00006966718,0.0000014200837,0.0078172935,0.00017414155,0.046888452,0.87543076,0.016607543,0.02540378],"study_design_scores_gemma":[0.0058753,0.0006867468,0.32072031,0.0008078931,0.00008867943,0.000094784285,0.025524776,0.07109476,0.44999364,0.008707331,0.11222081,0.004184973],"about_ca_topic_score_codex":0.00046862804,"about_ca_topic_score_gemma":0.00006767726,"teacher_disagreement_score":0.8667234,"about_ca_system_score_codex":0.000012535854,"about_ca_system_score_gemma":0.000015313797,"threshold_uncertainty_score":0.32798186},"labels":[],"label_agreement":null},{"id":"W2123641375","doi":"10.5555/1944796.1944811","title":"Unsynchronized multiplayer networked games: feasibility with time rewind","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Real-time computing; Computer graphics (images); Multimedia","score_opus":0.01010805125805784,"score_gpt":0.2328878945718129,"score_spread":0.22277984331375505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123641375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883905,0.000032274373,0.3909202,0.0050474405,0.0005172957,0.00083629397,0.0000024670185,0.0035299517,0.01072358],"genre_scores_gemma":[0.6419502,0.0000010769758,0.3547497,0.000476965,0.00008635497,0.000028483586,0.0000018918195,0.000015687068,0.0026896338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770755,0.00005033876,0.00027157326,0.0008741684,0.0004173207,0.0006790539],"domain_scores_gemma":[0.9970948,0.00019698798,0.00008487858,0.0022502914,0.00016542972,0.00020761722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005677201,0.00028518922,0.00031680067,0.0001306412,0.00013792075,0.00023463713,0.0021894325,0.00020676323,0.00018615839],"category_scores_gemma":[0.00016901176,0.00020474744,0.00006244797,0.0009998851,0.00016899439,0.00045601127,0.000769461,0.0005256124,0.0007504873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056839606,0.0012595683,0.06454528,0.000055240573,0.00036573992,0.0003780282,0.001718748,0.007973788,0.07589392,0.04322317,0.30849525,0.4955229],"study_design_scores_gemma":[0.0062735323,0.0014262762,0.06298622,0.00012319357,0.00004771416,0.00029126558,0.00007935601,0.74569696,0.0268356,0.010645266,0.14257564,0.0030190116],"about_ca_topic_score_codex":0.000042387714,"about_ca_topic_score_gemma":0.00032009077,"teacher_disagreement_score":0.7377232,"about_ca_system_score_codex":0.00006425964,"about_ca_system_score_gemma":0.00012076324,"threshold_uncertainty_score":0.96462464},"labels":[],"label_agreement":null},{"id":"W2123664910","doi":"10.1109/ism.2009.55","title":"Empirical Analysis of Multi-sender Segment Transmission Algorithms in Peer-to-Peer Streaming","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Communication source; PlanetLab; Live streaming; Distributed computing; Algorithm; Computer network; Fair-share scheduling; Round-robin scheduling; Real Time Streaming Protocol; Real-time computing; Quality of service; The Internet; Mathematical optimization","score_opus":0.04380006345967934,"score_gpt":0.3344083257568027,"score_spread":0.29060826229712333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123664910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07173393,0.00004587505,0.9014678,0.025459355,0.000066262226,0.00024959777,0.000003953262,0.00040112107,0.0005721314],"genre_scores_gemma":[0.52468276,0.0000036846695,0.47334272,0.00080079434,0.000010228508,0.0000085905795,0.0000048309817,0.0000057894986,0.0011405862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698293,0.00006334132,0.00055267656,0.0007541178,0.0010904302,0.00055649463],"domain_scores_gemma":[0.9984528,0.000099701174,0.00007231402,0.00090056204,0.00026033868,0.00021430422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070150493,0.00025485418,0.00052502437,0.001442937,0.00005277376,0.00007902757,0.0013750647,0.0001675757,0.000027715607],"category_scores_gemma":[0.00011406194,0.00021395918,0.00018196381,0.0052838405,0.00002851994,0.00022979095,0.00026679173,0.00022753356,0.0000184481],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013668479,0.0005736106,0.009681514,0.0000050105346,0.00015864235,0.00005245524,0.002844404,0.04980448,0.0033719784,0.000523114,0.005133121,0.927838],"study_design_scores_gemma":[0.00053927884,0.00029117588,0.20134443,0.000033649925,0.000076353055,0.000003199453,0.00025532075,0.78055733,0.011414718,0.0003550503,0.004693764,0.00043571874],"about_ca_topic_score_codex":0.00011769873,"about_ca_topic_score_gemma":0.00013296746,"teacher_disagreement_score":0.92740226,"about_ca_system_score_codex":0.00014586565,"about_ca_system_score_gemma":0.000049321032,"threshold_uncertainty_score":0.8725002},"labels":[],"label_agreement":null},{"id":"W2123710754","doi":"10.1109/glocom.2007.82","title":"A Measurement Study of Piece Population in BitTorrent","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; Computer science; PlanetLab; Upload; The Internet; Population; BitTorrent tracker; Computer network; World Wide Web; Artificial intelligence","score_opus":0.03843550481187226,"score_gpt":0.2822549934407483,"score_spread":0.24381948862887604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123710754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74925196,0.000027987235,0.24929881,0.00024000843,0.00015030884,0.0002845485,3.6724916e-8,0.00019318007,0.0005531352],"genre_scores_gemma":[0.98641205,4.0948487e-7,0.013511496,0.000038876835,0.000008903298,0.000008263081,9.240857e-8,0.000002580902,0.000017325328],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9987446,0.000020394897,0.0002727876,0.00022432208,0.0005440019,0.0001938594],"domain_scores_gemma":[0.9993734,0.000016820843,0.000050356884,0.00044875406,0.000079905854,0.00003076291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010607011,0.000071281516,0.000113854745,0.00029528158,0.000016759173,0.00001690184,0.00057779055,0.000030228439,0.0000018102287],"category_scores_gemma":[0.00006733985,0.0000621067,0.000014065889,0.00087468966,0.00000573053,0.00011207502,0.00027244093,0.00006323969,0.0000068150466],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018429895,0.0014514227,0.61609733,0.000009836469,0.000017898938,0.000019918973,0.0020097948,0.0032388072,0.001291363,0.015455984,0.00089300616,0.3594962],"study_design_scores_gemma":[0.0003557799,0.00033992185,0.991888,0.000021663298,0.0000016732556,8.9103435e-7,0.00032660327,0.00395152,0.0018991138,0.0009427535,0.0001621705,0.00010992657],"about_ca_topic_score_codex":0.0006551056,"about_ca_topic_score_gemma":0.0050977296,"teacher_disagreement_score":0.37579066,"about_ca_system_score_codex":0.0001343833,"about_ca_system_score_gemma":0.000010427476,"threshold_uncertainty_score":0.28446528},"labels":[],"label_agreement":null},{"id":"W2123849822","doi":"10.5539/cis.v2n4p153","title":"The Pastry Algorithm Based on DHT","year":2009,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pastry; Computer science; Key (lock); Disadvantage; Algorithm; Measure (data warehouse); Computer network; Data mining; Artificial intelligence; Operating system","score_opus":0.006236218227188754,"score_gpt":0.22570082162001212,"score_spread":0.21946460339282337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123849822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013557513,0.0000103961875,0.9852191,0.009361373,0.0004033317,0.00011616582,7.528021e-7,0.00028135066,0.0032517712],"genre_scores_gemma":[0.5222533,0.000016292623,0.45996618,0.017659009,0.00007352686,0.000008333098,0.0000010839618,0.0000015509148,0.00002073486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988077,0.000011059941,0.00019154772,0.00018344574,0.00050888193,0.00029735226],"domain_scores_gemma":[0.9990458,0.000078653684,0.00006294752,0.0005626678,0.00014921694,0.00010071841],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006818418,0.00009497759,0.00006868297,0.00023380767,0.00059255835,0.0011593498,0.0016610376,0.00002938908,4.9803623e-7],"category_scores_gemma":[0.000048695347,0.000062990475,0.000018074132,0.0012323369,0.00018315093,0.00373118,0.00029977306,0.00011091116,0.000060768416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.401273e-7,0.000004179019,0.000012797784,5.23827e-7,2.780137e-7,3.3499805e-7,0.00012521927,0.0015730244,0.0000062482263,0.024748558,0.0029927797,0.9705352],"study_design_scores_gemma":[0.00009933115,0.00018244726,0.013855936,0.000011239853,3.1792476e-7,0.000006580714,0.000009246643,0.93862575,0.00037885975,0.0012447449,0.045489408,0.00009613586],"about_ca_topic_score_codex":7.2433016e-7,"about_ca_topic_score_gemma":8.6001435e-8,"teacher_disagreement_score":0.9704391,"about_ca_system_score_codex":0.000034011788,"about_ca_system_score_gemma":0.0000788005,"threshold_uncertainty_score":0.9998776},"labels":[],"label_agreement":null},{"id":"W2124329125","doi":"10.1109/icppw.2002.1039769","title":"Security in distributed digital libraries: issues and challenges","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Variety (cybernetics); Digital library; Computer security; Information security; Computer security model; Cloud computing security; Cloud computing; Operating system","score_opus":0.02263842366630491,"score_gpt":0.2312042984180463,"score_spread":0.20856587475174138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124329125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39694712,0.042277735,0.2816119,0.16022933,0.00069749163,0.0011007176,0.00005688558,0.0073723407,0.10970648],"genre_scores_gemma":[0.98454094,0.0005006182,0.014688413,0.00010846912,0.00000937426,0.000010574148,0.0000018675496,0.000004561591,0.00013516832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911505,0.000020850877,0.00012657783,0.00034051036,0.00012822752,0.00026880243],"domain_scores_gemma":[0.9994024,0.00008022847,0.000018719487,0.00041458613,0.00001940563,0.00006465564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001149424,0.00011381447,0.00014094074,0.00009404062,0.000032082207,0.0003238389,0.00053915655,0.00007508569,0.0000048887864],"category_scores_gemma":[0.00020696956,0.00009957852,0.000014161211,0.00041475327,0.000060367962,0.0009149708,0.00042816432,0.00009908041,0.000019873225],"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.0000017691455,0.000055905744,0.004019628,0.000012027924,0.000006175305,0.000029076109,0.0007514739,0.0000134867805,0.0000045079933,0.9538045,0.00428426,0.03701719],"study_design_scores_gemma":[0.00042902213,0.00019094833,0.012175579,0.00004158483,0.0000015240935,0.000033820932,0.0008867616,0.0034665125,0.0026715703,0.4859052,0.49363852,0.00055897026],"about_ca_topic_score_codex":0.000008943282,"about_ca_topic_score_gemma":0.00003570131,"teacher_disagreement_score":0.58759385,"about_ca_system_score_codex":0.000015757358,"about_ca_system_score_gemma":0.000018537941,"threshold_uncertainty_score":0.40606943},"labels":[],"label_agreement":null},{"id":"W2124736545","doi":"10.1109/icdsc.2009.5289376","title":"A distributed camera network architecture supporting video adaptation","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Software deployment; Architecture; Adaptation (eye); Video quality; Real-time computing; Bandwidth (computing); Content adaptation; Video tracking; Computer network; Multimedia; Video processing; Artificial intelligence; Software engineering","score_opus":0.012557934543118423,"score_gpt":0.2461775564751967,"score_spread":0.23361962193207828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124736545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091321,0.000055340934,0.96386087,0.023078732,0.00016691288,0.00021118535,0.0000029695752,0.0019191029,0.0015727583],"genre_scores_gemma":[0.66857,0.0000018637348,0.32904655,0.002039547,0.00010364349,0.000009725791,0.0000113113265,0.0000049915056,0.00021240061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982729,0.000037374633,0.0002981342,0.00046089693,0.0002947595,0.0006359662],"domain_scores_gemma":[0.9989222,0.00008863028,0.0001093376,0.00068627135,0.0000770884,0.00011644907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030481975,0.00017913038,0.0001888288,0.0001018394,0.00014658105,0.00018879004,0.0011226005,0.00009600378,0.000013189946],"category_scores_gemma":[0.00017312211,0.00015638604,0.000060531096,0.0012825386,0.000023707813,0.00023856449,0.00025171155,0.00023569677,0.00005493735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007748447,0.000027821094,0.0002700175,0.0000024921096,0.000011117556,0.00003854532,0.00040689862,0.13957864,0.00026349686,0.045040168,0.04844598,0.76590705],"study_design_scores_gemma":[0.00060889614,0.00078131905,0.027071401,0.00009095346,0.000015778312,0.00012043265,0.00018888002,0.6301495,0.0022806907,0.22418813,0.1133247,0.0011793344],"about_ca_topic_score_codex":0.000026172465,"about_ca_topic_score_gemma":0.000058339683,"teacher_disagreement_score":0.7647277,"about_ca_system_score_codex":0.00005433377,"about_ca_system_score_gemma":0.00004669819,"threshold_uncertainty_score":0.63772374},"labels":[],"label_agreement":null},{"id":"W2125132187","doi":"10.1002/cpe.1543","title":"In search of simplicity: a self‐organizing group communication overlay","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"PlanetLab; Computer science; Testbed; Distributed computing; Overlay network; Node (physics); Overlay; Communication in small groups; Overhead (engineering); Simplicity; Computer network; Simple (philosophy); The Internet; World Wide Web","score_opus":0.02199167398356057,"score_gpt":0.33153495658569965,"score_spread":0.3095432826021391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125132187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6804656,0.0015495772,0.30879092,0.008187375,0.00007630862,0.0002165092,6.3525454e-7,0.00015401372,0.0005591051],"genre_scores_gemma":[0.9420387,0.00041525156,0.056615677,0.0009083212,0.0000072024936,0.000008947717,0.0000011126205,0.000002285938,0.0000024752935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899995,0.000110121866,0.00024600534,0.00028836704,0.0001852621,0.00017027339],"domain_scores_gemma":[0.99904394,0.00040777418,0.00011105731,0.00026274094,0.00011985834,0.00005459855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036824401,0.00009727652,0.0001422566,0.00013455856,0.00011678441,0.00011622142,0.00038887255,0.000052376705,0.0000010034363],"category_scores_gemma":[0.00023211013,0.000101549915,0.000010217804,0.00069190597,0.000067236164,0.0016934978,0.000248722,0.00016861549,0.0000021791889],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034404187,0.0003420493,0.0017110218,0.000034694007,0.000011753083,0.000017605487,0.09286869,0.00044771947,0.0058965613,0.23003016,0.00040148446,0.66820383],"study_design_scores_gemma":[0.0042730016,0.003763175,0.18621364,0.00077317806,0.00005519955,0.0006483088,0.03924603,0.6213671,0.019135598,0.093810506,0.028376585,0.0023376846],"about_ca_topic_score_codex":0.000048144946,"about_ca_topic_score_gemma":0.0000035205558,"teacher_disagreement_score":0.6658662,"about_ca_system_score_codex":0.000020827332,"about_ca_system_score_gemma":0.000029060064,"threshold_uncertainty_score":0.41410854},"labels":[],"label_agreement":null},{"id":"W2125264722","doi":"10.1007/978-3-540-87353-2_1","title":"SOON: A Scalable Self-organized Overlay Network for Distributed Information Retrieval","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":19,"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; Overlay network; Scalability; Overlay; Distributed computing; Information retrieval; Computer network; World Wide Web; Database; Operating system; The Internet","score_opus":0.010437612924810864,"score_gpt":0.2180584741621273,"score_spread":0.20762086123731646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125264722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093800605,0.0002986687,0.99121267,0.0024403941,0.002453161,0.0013374412,0.00004861357,0.001505219,0.000610014],"genre_scores_gemma":[0.014987342,0.00010080364,0.9812638,0.0025170865,0.0008008434,0.000033953238,0.000081031736,0.000047834932,0.00016728666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949626,0.000028650753,0.0008815048,0.0014021809,0.0013459728,0.0013790963],"domain_scores_gemma":[0.995784,0.0007124444,0.0004971438,0.0020085005,0.000738939,0.00025901216],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010966623,0.00074040506,0.000827007,0.0008367199,0.0006107024,0.0008726779,0.005414178,0.0007115426,0.000007888938],"category_scores_gemma":[0.0004731067,0.0007130607,0.0001918701,0.0024827705,0.00044556553,0.0016428417,0.0025603415,0.0009073585,0.00009967851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014240075,0.00009330539,0.00015871497,0.00016634152,0.000106084895,0.00011184742,0.0018298908,0.31940937,0.00008687385,0.025386998,0.039890654,0.6126175],"study_design_scores_gemma":[0.001141683,0.0006228868,0.0002680187,0.00046309995,0.000024145325,0.00022046678,2.826338e-7,0.7507533,0.001620903,0.087765574,0.1553947,0.0017249659],"about_ca_topic_score_codex":0.000009624389,"about_ca_topic_score_gemma":0.000020862732,"teacher_disagreement_score":0.61089253,"about_ca_system_score_codex":0.00080810237,"about_ca_system_score_gemma":0.0008920828,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W2125299519","doi":"10.1109/.2006.1629466","title":"Truthful Application-Layer Multicast in Mesh-based Selfish Overlays","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multicast; Computer science; Computer network; Overlay multicast; Overlay network; Protocol Independent Multicast; Source-specific multicast; Overlay; Xcast; Pragmatic General Multicast; Distributed computing; Node (physics); Tree (set theory); IP multicast; Application layer; Distance Vector Multicast Routing Protocol; Layer (electronics); Cheating; The Internet; Engineering; Operating system","score_opus":0.008701086989439208,"score_gpt":0.23169991960710629,"score_spread":0.22299883261766706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125299519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05178659,0.000022026776,0.924406,0.006770013,0.00010393931,0.00037393701,0.0000024518663,0.0014361426,0.015098889],"genre_scores_gemma":[0.7938857,4.9829106e-7,0.20474453,0.00079928176,0.000034621422,0.00010242664,0.0000032465362,0.000009200202,0.00042047544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842924,0.000024308429,0.00028368976,0.0005487146,0.00029703596,0.00041701432],"domain_scores_gemma":[0.99868685,0.00014192928,0.000051977906,0.0009934526,0.000066028406,0.000059790666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021576391,0.00016617416,0.00017515328,0.00025781832,0.000052748368,0.000120274926,0.0013290911,0.00011323936,0.000016242837],"category_scores_gemma":[0.000045904304,0.00015647367,0.000044013184,0.0012036163,0.00004326175,0.00021883156,0.00028133515,0.00014487145,0.00027429752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021234857,0.0009201626,0.05196545,0.000025157637,0.000017891492,0.00007763043,0.00019699748,0.0369725,0.010105818,0.6510794,0.11018002,0.13843775],"study_design_scores_gemma":[0.00089354964,0.00006514252,0.061801996,0.000016645485,0.0000036713573,0.000006704255,0.000022300002,0.8705769,0.018164864,0.011722625,0.036187977,0.00053761003],"about_ca_topic_score_codex":0.00036472187,"about_ca_topic_score_gemma":0.0005673736,"teacher_disagreement_score":0.8336044,"about_ca_system_score_codex":0.0001010436,"about_ca_system_score_gemma":0.00004719682,"threshold_uncertainty_score":0.63808113},"labels":[],"label_agreement":null},{"id":"W2125430046","doi":"10.1109/tnet.2014.2310735","title":"Minimum-Delay Multicast Algorithms for Mesh Overlays","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Latency (audio); Network delay; Overlay network; Overlay; Computer network; Algorithm; Node (physics); Overlay multicast; Time complexity; Set (abstract data type); Distributed computing; Source-specific multicast; Pragmatic General Multicast","score_opus":0.039391372062308645,"score_gpt":0.28298174869595577,"score_spread":0.24359037663364713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125430046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017030204,0.00006147958,0.9884854,0.0026731223,0.0042560813,0.00063608214,0.0000120220775,0.0014931276,0.00067964714],"genre_scores_gemma":[0.6311736,0.000027060603,0.36665282,0.00084713014,0.0006316061,0.00025432618,0.000002578056,0.000047527057,0.00036333082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709564,0.00008486318,0.00046595788,0.0009455588,0.00044583957,0.00096212083],"domain_scores_gemma":[0.99668044,0.0010131459,0.00012857487,0.0018222263,0.00013601437,0.00021959424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006194698,0.00039459395,0.00040423332,0.00035257443,0.00056337495,0.00027401894,0.0022462676,0.00025921676,0.000008972824],"category_scores_gemma":[0.000060313152,0.0004045178,0.00024974614,0.0010389612,0.00008417367,0.0003394962,0.000047178546,0.00045058702,0.00009713756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035759014,0.00014744658,0.00001981769,0.000016001,0.00008165999,0.000008945407,0.00029526162,0.060524464,0.00050837826,0.0023532417,0.004488762,0.9315203],"study_design_scores_gemma":[0.0009430537,0.0005165883,0.000060764924,0.00014849255,0.000045965095,0.000037795253,0.000045641278,0.8695837,0.0035577205,0.0057985834,0.11855093,0.0007107164],"about_ca_topic_score_codex":0.000021451699,"about_ca_topic_score_gemma":0.00006577958,"teacher_disagreement_score":0.93080956,"about_ca_system_score_codex":0.00019231568,"about_ca_system_score_gemma":0.00004251466,"threshold_uncertainty_score":0.9998407},"labels":[],"label_agreement":null},{"id":"W2125750876","doi":"10.1109/pdcat.2005.178","title":"Ontology-Based Clustering and Routing in Peer-to-Peer Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Distributed hash table; Peer-to-peer; Overlay network; Ontology; Computer network; Distributed computing; Exploit; Overlay; Architecture; Hash table; Routing (electronic design automation); Cluster analysis; Routing table; Hash function; Routing protocol; World Wide Web; Computer security; The Internet","score_opus":0.015596493431746308,"score_gpt":0.2573568253738768,"score_spread":0.24176033194213048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125750876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06800585,0.00005564068,0.86567044,0.0616206,0.00023081209,0.0002655524,4.853681e-7,0.0009239099,0.0032266865],"genre_scores_gemma":[0.67416406,0.0000011401658,0.32117918,0.0036669613,0.00007591448,0.000024989864,8.6180034e-7,0.000010625315,0.0008762657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779195,0.00004478146,0.0003440802,0.0006718551,0.000387296,0.0007600532],"domain_scores_gemma":[0.9987792,0.00016682636,0.000053327843,0.0007099304,0.0001247387,0.00016600898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091746903,0.0002303753,0.00027955192,0.00035867508,0.000100658894,0.00022034522,0.0011726837,0.00018401777,0.0000098037335],"category_scores_gemma":[0.00027682754,0.00022233547,0.000035855766,0.00090937305,0.00004562343,0.00031581102,0.0010828924,0.00033010295,0.00005373829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022347207,0.000068703506,0.020469425,0.000008269392,0.000012940813,0.00005892882,0.0008463477,0.39371604,0.00020237337,0.013947939,0.016815394,0.5538313],"study_design_scores_gemma":[0.00039279304,0.000083092935,0.013055197,0.00004119576,0.0000021528226,0.000017458973,0.000048302234,0.9700092,0.0003322437,0.0002357519,0.015457737,0.00032487029],"about_ca_topic_score_codex":0.00012406186,"about_ca_topic_score_gemma":0.0032526073,"teacher_disagreement_score":0.6061582,"about_ca_system_score_codex":0.00013544044,"about_ca_system_score_gemma":0.000036673297,"threshold_uncertainty_score":0.9066577},"labels":[],"label_agreement":null},{"id":"W2125948488","doi":"10.1007/s12083-007-0007-x","title":"An inexpensive unstructured platform for wireless mobile peer-to-peer networks","year":2008,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Gossip; Peer-to-peer; Wireless; Computer network; Distributed computing; Robustness (evolution); Wireless network; Mobile device; Gossip protocol; Bandwidth (computing); Exploit; Mobile computing; Computer security; Operating system","score_opus":0.02363411094292499,"score_gpt":0.2832382619596718,"score_spread":0.2596041510167468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125948488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0697234,0.00023774368,0.8981573,0.022305897,0.0012176334,0.0053326576,0.00013620524,0.0021539987,0.0007351874],"genre_scores_gemma":[0.81245226,0.000037162557,0.16829748,0.0049274345,0.0025877103,0.006965839,0.0002991516,0.00016365666,0.0042692837],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99233496,0.000070726375,0.0010619822,0.0024960986,0.0019421178,0.0020940914],"domain_scores_gemma":[0.99166834,0.00055303355,0.00030696244,0.0030012894,0.002947108,0.0015232709],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013608035,0.0009899685,0.0010314917,0.0007833244,0.0017657479,0.00078188657,0.0037984096,0.0005708502,0.000009428427],"category_scores_gemma":[0.00024997376,0.0010229168,0.00023120892,0.0038945652,0.00023397058,0.0005820557,0.0014098902,0.00081245747,0.00014315423],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013020137,0.00027741876,0.0016530886,0.00003250591,0.00015382153,0.000027660222,0.0046446617,0.22270145,0.0009914744,0.017813297,0.3300624,0.42151204],"study_design_scores_gemma":[0.00082589884,0.0006982066,0.0026812607,0.000096883436,0.00005970838,0.00016351642,0.00040779452,0.09824942,0.0008121911,0.004164017,0.89015913,0.0016820005],"about_ca_topic_score_codex":0.00012488381,"about_ca_topic_score_gemma":0.00017601914,"teacher_disagreement_score":0.7427289,"about_ca_system_score_codex":0.00027170408,"about_ca_system_score_gemma":0.00018257655,"threshold_uncertainty_score":0.99953383},"labels":[],"label_agreement":null},{"id":"W2126331019","doi":"10.1109/pccc.2011.6108085","title":"Can P2P help the cloud go green?","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cloud computing; Computer science; Server; Energy consumption; Data center; Efficient energy use; Computer network; Rendering (computer graphics); Service provider; Proxy (statistics); Peer-to-peer; Database; Service (business); Distributed computing; Operating system; Engineering","score_opus":0.03577469169998003,"score_gpt":0.22376311995438053,"score_spread":0.18798842825440049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126331019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085280426,0.00024208582,0.56865346,0.10770945,0.0025136166,0.0007162346,0.000004147319,0.005733883,0.22914669],"genre_scores_gemma":[0.9201309,0.000005560936,0.067691326,0.0032222774,0.000107952466,0.000025625814,2.5590745e-7,0.000008604511,0.008807492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896765,0.000037293437,0.00012867896,0.00030227136,0.00021016397,0.00035395686],"domain_scores_gemma":[0.99853927,0.000056514735,0.00003352147,0.0012569628,0.000047571928,0.000066151384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028800897,0.00011703652,0.00009953,0.00006236216,0.00013500481,0.000066541266,0.0029688675,0.000060798746,0.00004606427],"category_scores_gemma":[0.000042090425,0.0000714172,0.00004046947,0.0005495463,0.00007733112,0.000119076736,0.0011079587,0.0001821583,0.00048734373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035952105,0.000044939243,0.0024463336,0.0000029370467,0.000024887015,0.00003487803,0.0027910701,0.000010974715,0.0001407937,0.59911853,0.14059561,0.25478545],"study_design_scores_gemma":[0.00058207824,0.0007455348,0.05047008,0.000041547355,0.000024158066,0.00015603402,0.0010205724,0.018566016,0.03722005,0.47214442,0.4175697,0.0014598041],"about_ca_topic_score_codex":0.00097550184,"about_ca_topic_score_gemma":0.0012372923,"teacher_disagreement_score":0.8348505,"about_ca_system_score_codex":0.000026689482,"about_ca_system_score_gemma":0.000030483166,"threshold_uncertainty_score":0.626398},"labels":[],"label_agreement":null},{"id":"W2126669697","doi":"10.1109/have.2008.4685298","title":"A distributed latency-aware architecture for massively multi-user virtual environments","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Hilbert curve; Distributed computing; Routing (electronic design automation); Computer network; Theoretical computer science; Algorithm","score_opus":0.022495470832986187,"score_gpt":0.23398548286307794,"score_spread":0.21149001203009174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126669697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01712789,0.000021361435,0.9771743,0.0040814583,0.00017317181,0.0004998102,0.00007741773,0.0007887163,0.000055885877],"genre_scores_gemma":[0.50122356,0.000015598032,0.47733313,0.0010052157,0.00005726573,0.00022736365,0.00004809812,0.000029168395,0.020060606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982886,0.000023777757,0.000227283,0.0006087221,0.00029701923,0.000554605],"domain_scores_gemma":[0.99889237,0.00009892909,0.000066401255,0.0007724898,0.00003083482,0.00013897305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008380926,0.00024216657,0.00022069343,0.0001235233,0.00022080474,0.000048556554,0.0015797894,0.0001540432,0.000011858],"category_scores_gemma":[0.0000878784,0.00020110812,0.000096337986,0.00038060523,0.00010458833,0.00019811481,0.00074718957,0.00018722772,0.00012362284],"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.00023022463,0.0019007215,0.023309417,0.000053884625,0.00051148783,0.00083720975,0.0040927012,0.05098957,0.020511,0.19953099,0.3991987,0.2988341],"study_design_scores_gemma":[0.0029029222,0.0009209797,0.046769515,0.000040912662,0.000018849363,0.0001619284,0.00011713886,0.048122797,0.022758214,0.00330337,0.87348664,0.001396741],"about_ca_topic_score_codex":0.000012335272,"about_ca_topic_score_gemma":0.000019875148,"teacher_disagreement_score":0.49984115,"about_ca_system_score_codex":0.000079323196,"about_ca_system_score_gemma":0.000037640562,"threshold_uncertainty_score":0.8200951},"labels":[],"label_agreement":null},{"id":"W2126868220","doi":"10.1145/2405153.2405154","title":"Introducing Publiy","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Middleware (distributed applications); Computer science; Java; Variety (cybernetics); Fault tolerance; Throughput; Publication; Reliability (semiconductor); Scale (ratio); Software; Distributed computing; Operating system; Software engineering; World Wide Web; Wireless","score_opus":0.01626559681099098,"score_gpt":0.24245988707958485,"score_spread":0.22619429026859386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126868220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017792236,0.00011709911,0.9295007,0.019380825,0.00086387823,0.00007518193,1.2180138e-7,0.0017960068,0.030473936],"genre_scores_gemma":[0.6232559,0.0000012137773,0.3742445,0.00094577245,0.00017500822,0.0000077206805,1.8622363e-7,0.0000034578936,0.0013662288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990879,0.000012402121,0.00009529696,0.00020647858,0.00016349,0.00043438445],"domain_scores_gemma":[0.99903667,0.00003647189,0.000018694784,0.00077119673,0.000034764344,0.0001022202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003522008,0.000073697236,0.00007667592,0.00012681197,0.000050555114,0.00012947514,0.0011224055,0.000041896754,0.000033969744],"category_scores_gemma":[0.00014353769,0.000060657672,0.00002034797,0.0006125021,0.00001540399,0.0008588076,0.0008355917,0.00009187838,0.0007300045],"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":[4.803417e-7,0.000032086842,0.005429316,0.0000018164288,0.0000066505254,0.0000012845687,0.000306046,0.000077103105,0.00069146283,0.4968408,0.22311029,0.27350265],"study_design_scores_gemma":[0.00025060464,0.00011080396,0.03395452,0.00001546268,0.000005079576,0.00006745436,0.00012719938,0.015170184,0.043798298,0.0146854725,0.89102525,0.0007896716],"about_ca_topic_score_codex":0.000013217991,"about_ca_topic_score_gemma":0.000004285532,"teacher_disagreement_score":0.667915,"about_ca_system_score_codex":0.000032738713,"about_ca_system_score_gemma":0.000011926239,"threshold_uncertainty_score":0.9382975},"labels":[],"label_agreement":null},{"id":"W2127884172","doi":"10.1109/icumt.2009.5345394","title":"Toward new peering strategies for push-pull based P2P streaming systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Peering; Computer science; Overhead (engineering); Computer network; Session (web analytics); Focus (optics); Minification; Mechanism (biology); Performance improvement; Distributed computing; The Internet; World Wide Web; Operating system","score_opus":0.04129510462410473,"score_gpt":0.2656911848008989,"score_spread":0.2243960801767942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127884172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005603107,0.00017684264,0.9783736,0.008072658,0.00046729605,0.00046144758,0.000002416157,0.0022974156,0.00454521],"genre_scores_gemma":[0.72111434,0.0000017815639,0.27726853,0.0004606645,0.000113198446,0.000026401683,0.0000022757251,0.000009866498,0.0010029586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983268,0.000015490068,0.00028509393,0.0005226989,0.00026824186,0.000581669],"domain_scores_gemma":[0.99878794,0.00011882013,0.00007186823,0.0007728831,0.000101276135,0.00014718882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024092494,0.00023201063,0.0002656233,0.00021027196,0.000101097656,0.0008134932,0.0015836571,0.00011676205,0.0000037711134],"category_scores_gemma":[0.00007034824,0.00020892647,0.00008082371,0.0005217085,0.000017291708,0.0006426515,0.00016861492,0.00011989735,0.000024421763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016069856,0.000062693776,0.00009112693,0.00006951068,0.00002803693,0.000036161484,0.00049952924,0.072293006,0.0038506712,0.60625726,0.06681254,0.2499834],"study_design_scores_gemma":[0.0009130685,0.00086372416,0.0009148147,0.00017434156,0.000015900754,0.000028001681,0.0011674637,0.9132055,0.0077921962,0.036763806,0.037202846,0.00095835916],"about_ca_topic_score_codex":0.00017231173,"about_ca_topic_score_gemma":0.000037081994,"teacher_disagreement_score":0.84091246,"about_ca_system_score_codex":0.00008545592,"about_ca_system_score_gemma":0.00020182914,"threshold_uncertainty_score":0.8519774},"labels":[],"label_agreement":null},{"id":"W2127892380","doi":"10.1109/glocom.1997.644597","title":"AgentSys: a mobile agent system for digital media access and interaction on an Internet","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile agent; The Internet; Mobile computing; Negotiation; Mobile Web; Resource (disambiguation); Protocol (science); Mobile device; Mobile database; World Wide Web; Distributed computing; Computer network; Mobile station; Mobile technology; Base station","score_opus":0.0567140554255563,"score_gpt":0.29222947730014537,"score_spread":0.23551542187458907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127892380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3450071,0.00004676726,0.64566374,0.00053055905,0.001130357,0.000754294,0.000013216852,0.0015308901,0.005323077],"genre_scores_gemma":[0.9943167,0.0000038806425,0.004681141,0.00018402842,0.00006387903,0.00017552351,0.000005346851,0.000009841954,0.00055967655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891746,0.000014575718,0.00018613049,0.00044274793,0.00017857744,0.0002604967],"domain_scores_gemma":[0.99920195,0.00011410518,0.000058559355,0.00047295733,0.000047289053,0.00010513786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105202846,0.00013910524,0.00014166239,0.00016771833,0.000046331978,0.0008742311,0.0010454643,0.000061232735,0.000012730121],"category_scores_gemma":[0.000049596638,0.00011459581,0.000034034405,0.00020719446,0.000021982192,0.0016749727,0.0006002172,0.000078629346,0.000080612284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019309955,0.00015742827,0.0002590177,0.000036127396,0.000028777587,0.000019415227,0.0011987456,0.00025424696,0.00004473645,0.0145210195,0.029507091,0.9539541],"study_design_scores_gemma":[0.001324683,0.0026940128,0.0015516683,0.00039840446,0.000019762978,0.00015796206,0.0011264512,0.90218484,0.013453423,0.0025205598,0.073507495,0.0010607255],"about_ca_topic_score_codex":0.000014316729,"about_ca_topic_score_gemma":0.000024271258,"teacher_disagreement_score":0.9528934,"about_ca_system_score_codex":0.000100540055,"about_ca_system_score_gemma":0.0000033643169,"threshold_uncertainty_score":0.84302306},"labels":[],"label_agreement":null},{"id":"W2127908902","doi":"10.1109/ptp.2003.1231530","title":"3LS - a peer-to-peer network simulator","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Scalability; Peer-to-peer; Distributed computing; Protocol (science); File sharing; Computer network; World Wide Web; The Internet; Operating system","score_opus":0.015407661830555017,"score_gpt":0.2609306850864746,"score_spread":0.24552302325591957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127908902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026912708,0.00006318009,0.8677729,0.091331325,0.001036281,0.0005116271,0.0000027608266,0.0034150546,0.00895418],"genre_scores_gemma":[0.58905524,0.0000014569304,0.394332,0.007144403,0.00029698652,0.000045890076,0.000001991475,0.000024994073,0.009097074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647045,0.000027944387,0.00037177786,0.0008773183,0.0011487944,0.0011036877],"domain_scores_gemma":[0.9972216,0.00011885089,0.00006271912,0.0017821104,0.00042294335,0.00039178337],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000694528,0.00033256735,0.00034168523,0.00023744153,0.00020185039,0.0003869806,0.0031083208,0.00019407456,0.0000437154],"category_scores_gemma":[0.00044272415,0.00029703122,0.000113883405,0.0022496306,0.00005455598,0.0004345608,0.0017182962,0.00029827355,0.0024440698],"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.000010102,0.00007888689,0.00055468595,0.000004476063,0.000034330405,0.00007898445,0.00044415903,0.47125122,0.00017467292,0.20118552,0.2946207,0.03156224],"study_design_scores_gemma":[0.0010899919,0.0005886342,0.0044524823,0.00009015566,0.000014710144,0.0000513658,0.000066374574,0.024444245,0.004346403,0.109476686,0.8540081,0.0013708585],"about_ca_topic_score_codex":0.00008829348,"about_ca_topic_score_gemma":0.00010545025,"teacher_disagreement_score":0.5621425,"about_ca_system_score_codex":0.00019452462,"about_ca_system_score_gemma":0.00012724209,"threshold_uncertainty_score":0.9999482},"labels":[],"label_agreement":null},{"id":"W2128053953","doi":"10.1109/icc.2005.1494558","title":"A hybrid overlay network for video-on-demand","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Gossip; Gossip protocol; Overlay network; Joins; Computer network; Overlay; Distributed computing; Network topology; Bandwidth (computing); Tree (set theory); On demand; The Internet; Scalability; Multimedia","score_opus":0.01402328999285121,"score_gpt":0.24813333317599992,"score_spread":0.2341100431831487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128053953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077537843,0.00014819307,0.96011025,0.019482555,0.00044943986,0.0004475024,0.0000033972758,0.0016079267,0.009996968],"genre_scores_gemma":[0.3560994,0.000006698575,0.62948745,0.010753277,0.00062586006,0.00012083238,0.0000014790425,0.00001643354,0.002888563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984414,0.000015906615,0.00020885009,0.0005052735,0.00023389207,0.00059466204],"domain_scores_gemma":[0.99863434,0.00025692405,0.00005146276,0.00089711166,0.000056002846,0.00010414608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034340148,0.00017465292,0.00019153528,0.000093842806,0.00013436312,0.00015498252,0.0014070029,0.00004941639,0.000018172477],"category_scores_gemma":[0.0000968543,0.0001477395,0.00008352984,0.00032629754,0.000029248982,0.00027493967,0.0004177076,0.000112753914,0.0003182958],"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.000009885998,0.000027400201,0.000077272336,0.0000024558558,0.000012693201,0.000005041883,0.00002422539,0.014221935,0.000039076618,0.13939245,0.7452551,0.10093248],"study_design_scores_gemma":[0.00036930628,0.00026451855,0.00039363204,0.000023307513,0.0000040731984,0.000018527879,0.0000029963016,0.13179517,0.0042448076,0.03532816,0.827236,0.00031948788],"about_ca_topic_score_codex":0.000004533584,"about_ca_topic_score_gemma":0.000021537378,"teacher_disagreement_score":0.3483456,"about_ca_system_score_codex":0.00006145683,"about_ca_system_score_gemma":0.000030721003,"threshold_uncertainty_score":0.6024642},"labels":[],"label_agreement":null},{"id":"W2128079280","doi":"10.1109/ccnc.2006.1593038","title":"A peer-to-peer framework for cost-effective on-demand media streaming","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Peer-to-peer; Computer science; Video on demand; On demand; Live streaming; Computer network; Multimedia","score_opus":0.018076837362121533,"score_gpt":0.2855823219347887,"score_spread":0.2675054845726672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128079280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012125774,0.000037491576,0.94664997,0.030756198,0.0009856556,0.0026287013,0.000020003796,0.0015470581,0.0052491277],"genre_scores_gemma":[0.41693738,9.0309896e-7,0.57528955,0.0019621425,0.00037587975,0.0014083505,0.000010214614,0.00003215502,0.003983427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688846,0.000045042303,0.00031673847,0.0009313882,0.0009629984,0.00085540325],"domain_scores_gemma":[0.9958911,0.0021238935,0.00008424085,0.0011472625,0.00055648934,0.00019699353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007718008,0.0003534409,0.00037488792,0.00038595728,0.00020467216,0.00032685473,0.0017785622,0.00028115767,0.000013574098],"category_scores_gemma":[0.0022384794,0.00030642,0.00012426276,0.0011446952,0.00006221743,0.00026076223,0.0006218959,0.00034336667,0.00027975938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000338982,0.0001291739,0.0005759873,0.000009544179,0.00003131585,0.000021424601,0.0005729845,0.003035038,0.00015716837,0.51139396,0.22927617,0.2547633],"study_design_scores_gemma":[0.001290747,0.001333554,0.01975892,0.00025495794,0.000033475506,0.000020413638,0.00029117466,0.02702112,0.026464846,0.5054513,0.4164902,0.0015892915],"about_ca_topic_score_codex":0.00007447526,"about_ca_topic_score_gemma":0.00017584294,"teacher_disagreement_score":0.40481162,"about_ca_system_score_codex":0.00018475541,"about_ca_system_score_gemma":0.00004551728,"threshold_uncertainty_score":0.9999388},"labels":[],"label_agreement":null},{"id":"W2128113014","doi":"10.1109/e-science.2005.10","title":"A Semantics-Based Routing Scheme for Grid Resource Discovery","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; RDF; RDF query language; Metadata; Flooding (psychology); Semantic grid; Grid; Distributed computing; Query optimization; Overlay network; Semantics (computer science); Resource (disambiguation); Web query classification; Computer network; Information retrieval; Database; World Wide Web; Web search query; Semantic Web; The Internet; Search engine","score_opus":0.011657064320947288,"score_gpt":0.2335258074035503,"score_spread":0.22186874308260301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128113014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02517896,0.000031571435,0.9587047,0.011286674,0.00017408207,0.00028899338,0.0000046655528,0.0013689976,0.0029613683],"genre_scores_gemma":[0.50902206,1.700841e-7,0.48765185,0.00091725047,0.00017318943,0.000041218875,0.00000659923,0.000012709676,0.0021749334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985558,0.000014574185,0.00023006518,0.0004643419,0.00024322358,0.000492031],"domain_scores_gemma":[0.9988484,0.00020875577,0.00006765939,0.00077805034,0.000056051013,0.000041103096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003034327,0.00015642631,0.00016637662,0.00013867878,0.00014390975,0.00035557977,0.0012073211,0.000079709345,0.0000015189696],"category_scores_gemma":[0.000118350836,0.00013772666,0.00008617966,0.0005383416,0.00004025096,0.00033257654,0.00043139144,0.00010149522,0.000024482682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032020398,0.00019936735,0.0075386968,0.00005346059,0.000026756808,0.00003192704,0.00007913411,0.015521818,0.006436431,0.5882873,0.36304572,0.018747354],"study_design_scores_gemma":[0.00085204747,0.00020637599,0.0024982698,0.00008585251,0.000009402392,0.000008675147,0.00005099496,0.7752513,0.055203337,0.012951687,0.1521725,0.00070953503],"about_ca_topic_score_codex":0.00006311775,"about_ca_topic_score_gemma":0.000058222988,"teacher_disagreement_score":0.7597295,"about_ca_system_score_codex":0.00005487323,"about_ca_system_score_gemma":0.000047131143,"threshold_uncertainty_score":0.561633},"labels":[],"label_agreement":null},{"id":"W2128773879","doi":"10.1109/mic.2006.115","title":"A Multilayer Peer-to-Peer Framework for Distributed Synchronous Collaboration","year":2006,"lang":"en","type":"article","venue":"IEEE Internet Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Computer science; Asynchronous communication; Peer-to-peer; Java; Distributed computing; Collaborative software; World Wide Web; The Internet; Web server; Computer network; Operating system","score_opus":0.01502337827437994,"score_gpt":0.2890421864684344,"score_spread":0.27401880819405444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128773879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1526234,0.00003345061,0.83341557,0.009304409,0.0021643096,0.0007905965,0.000043030712,0.0014681185,0.00015711259],"genre_scores_gemma":[0.61196816,1.340009e-7,0.38643873,0.00053975364,0.0004457618,0.00005344816,0.000025612755,0.000025993453,0.0005023918],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676025,0.000056952158,0.00063070224,0.0009631999,0.0007110351,0.0008778649],"domain_scores_gemma":[0.9969434,0.0005908972,0.00022880956,0.00090800424,0.0011715315,0.00015736771],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068599737,0.00037790282,0.00040557637,0.00030158146,0.0001816518,0.00080375717,0.0020862585,0.00026821473,0.0000044950452],"category_scores_gemma":[0.00092762365,0.00039590968,0.00012258578,0.001435508,0.000049688886,0.0002858951,0.0006664104,0.00034928913,0.00018083506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008834947,0.00034030268,0.002118627,0.00006193969,0.00011473105,0.00008058447,0.0029875082,0.22633159,0.0029249985,0.084997736,0.55159825,0.12835535],"study_design_scores_gemma":[0.0005788117,0.0003897138,0.0019361147,0.0002788286,0.000016648499,0.000028322576,0.000108412256,0.8783609,0.024442742,0.011872428,0.08116868,0.000818364],"about_ca_topic_score_codex":0.00019569023,"about_ca_topic_score_gemma":0.00013833541,"teacher_disagreement_score":0.65202934,"about_ca_system_score_codex":0.0003738411,"about_ca_system_score_gemma":0.0000860102,"threshold_uncertainty_score":0.99984926},"labels":[],"label_agreement":null},{"id":"W2128809037","doi":"10.1109/ccnc.2012.6181156","title":"Reliable interactive video streaming in peer-to-peer networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Burstiness; Forward error correction; Computer network; Communication source; Peer-to-peer; The Internet; Network packet; Packet loss; Disjoint sets; Path (computing); Unicast; Coding (social sciences); Markov chain; Distributed computing; Algorithm; Decoding methods; Machine learning","score_opus":0.0148502291650416,"score_gpt":0.2673875360718549,"score_spread":0.2525373069068133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128809037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076107286,0.00016125874,0.8697327,0.020759152,0.001936514,0.00056932704,0.0000019067332,0.0015466703,0.029185187],"genre_scores_gemma":[0.83139455,0.0000040807554,0.15913215,0.0017492246,0.00018523567,0.0000774494,0.0000028482846,0.000021805996,0.0074326647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970504,0.000051843872,0.00038720702,0.0006220513,0.00067055266,0.0012179371],"domain_scores_gemma":[0.99790555,0.000278447,0.000080200436,0.0011472233,0.0002852358,0.00030336287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011367595,0.0002936997,0.000322808,0.00049566024,0.000093099654,0.00024316052,0.0019060932,0.0001866937,0.000045604458],"category_scores_gemma":[0.0006069354,0.0002703426,0.00006462022,0.0019118303,0.00003407259,0.0014753242,0.0018066396,0.0005234186,0.00053930434],"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.00005638312,0.0004587093,0.06672699,0.000012458422,0.000067421,0.000065525826,0.005423877,0.05321568,0.00054410886,0.054148626,0.5203436,0.2989366],"study_design_scores_gemma":[0.0012114599,0.0005754914,0.0977443,0.0003910301,0.000021689912,0.00008844872,0.0018575421,0.33461034,0.010959398,0.0057441145,0.5443318,0.0024643973],"about_ca_topic_score_codex":0.0003531602,"about_ca_topic_score_gemma":0.00024182179,"teacher_disagreement_score":0.75528723,"about_ca_system_score_codex":0.00029140787,"about_ca_system_score_gemma":0.000037271464,"threshold_uncertainty_score":0.99997485},"labels":[],"label_agreement":null},{"id":"W2129306751","doi":"10.1007/978-3-540-72606-7_49","title":"Peer-Assisted On-Demand Streaming of Stored Media Using BitTorrent-Like Protocols","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":44,"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 Saskatchewan","funders":"","keywords":"BitTorrent; Computer science; On demand; Video on demand; Computer network; Peer-to-peer; Multimedia","score_opus":0.0581833418029555,"score_gpt":0.3118027656632388,"score_spread":0.2536194238602833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129306751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008084123,0.00012067965,0.9907904,0.00049003743,0.0019221859,0.004435111,0.000013581313,0.00044942248,0.0009701318],"genre_scores_gemma":[0.07420594,0.000005056607,0.92392683,0.0007411828,0.00053413236,0.0002036107,0.000007411961,0.00007710077,0.00029872038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99286133,0.00004842788,0.0009831936,0.002037975,0.0029411071,0.0011279408],"domain_scores_gemma":[0.9947041,0.00096992997,0.00068301975,0.0025544793,0.0008104815,0.0002779576],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019887122,0.0008213972,0.0009984976,0.0025130147,0.00025102048,0.00040774493,0.0063018664,0.00065034896,0.000009903891],"category_scores_gemma":[0.00051826576,0.00075452536,0.00019085077,0.0019141356,0.0009969793,0.00046155328,0.0026752052,0.0011719923,0.000017271692],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002595473,0.000090906426,0.00015531106,0.00008094215,0.00002485699,0.00016472858,0.0010186537,0.03828393,0.000892806,0.005167742,0.0001180274,0.95397615],"study_design_scores_gemma":[0.0019581493,0.0021270094,0.0026626014,0.009185129,0.000055742767,0.00030769582,0.0000040014843,0.8639805,0.030319216,0.071600005,0.013441115,0.0043588644],"about_ca_topic_score_codex":0.000035044253,"about_ca_topic_score_gemma":0.00014211048,"teacher_disagreement_score":0.94961727,"about_ca_system_score_codex":0.00069824397,"about_ca_system_score_gemma":0.0007045534,"threshold_uncertainty_score":0.99949056},"labels":[],"label_agreement":null},{"id":"W2130042506","doi":"10.1109/imtc.2009.5168555","title":"Model and measurement of MMOG time-constraint relaxation algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Latency (audio); Architecture; Server; Client–server model; Constraint (computer-aided design); Distributed computing; Computer network; Operating system","score_opus":0.023612973993577133,"score_gpt":0.22746548723078575,"score_spread":0.2038525132372086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130042506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006178523,0.00006535571,0.98409164,0.0041506356,0.000025789834,0.000129741,8.0041065e-7,0.00034277706,0.0050147246],"genre_scores_gemma":[0.46931526,0.0000043700907,0.5303427,0.00018859279,0.0000051681172,0.000002349983,2.2249606e-7,0.0000015555321,0.00013978535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909705,0.0000112905045,0.00016509596,0.0002284179,0.0003429015,0.00015523698],"domain_scores_gemma":[0.9994086,0.000011737373,0.000054515334,0.00035403197,0.00012608679,0.000045052322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036845365,0.000082475344,0.000113277296,0.00009933131,0.000030138872,0.00003289215,0.00038190867,0.00005281288,0.0000026354091],"category_scores_gemma":[0.000048195896,0.00007175977,0.000020069658,0.00022600908,0.0000331888,0.00017199114,0.0001190572,0.00006045541,0.000013270138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010697471,0.000029728364,0.000015761558,0.000001405989,0.000005780278,0.0000011828412,0.000108115404,0.0023547837,0.0076520364,0.027035953,0.003016936,0.95977724],"study_design_scores_gemma":[0.00012813708,0.00012364278,0.001276048,0.000015842514,0.0000028502272,0.000006228688,0.000007673043,0.9580251,0.008622291,0.031543158,0.00014146754,0.00010753538],"about_ca_topic_score_codex":0.0000052276914,"about_ca_topic_score_gemma":0.0000028573788,"teacher_disagreement_score":0.9596697,"about_ca_system_score_codex":0.000042125896,"about_ca_system_score_gemma":0.000036076894,"threshold_uncertainty_score":0.29262784},"labels":[],"label_agreement":null},{"id":"W2130187113","doi":"10.1109/icc.2007.283","title":"A Peer-to-Peer Approach for Remote Rendering and Image Streaming in Walkthrough Applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Peer-to-peer; Software walkthrough; Rendering (computer graphics); Parallel rendering; Multimedia; Virtual reality; Scheduling (production processes); Human–computer interaction; Computer graphics (images); Distributed computing; Software; Software system","score_opus":0.023305953979397456,"score_gpt":0.2919638226314384,"score_spread":0.26865786865204094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130187113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006162662,0.000042338117,0.97470003,0.007887382,0.000044351666,0.0009665294,0.0000034493962,0.0006755129,0.009517724],"genre_scores_gemma":[0.20393707,0.0000023163395,0.7939701,0.00032546266,0.000046328703,0.00009457783,0.000004775046,0.000014683241,0.0016047006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795693,0.000010477693,0.00031371505,0.0007198692,0.0003899004,0.0006091287],"domain_scores_gemma":[0.998629,0.00016334694,0.000050151913,0.00080719014,0.0002164117,0.00013393004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189666,0.0001898376,0.0002091081,0.0003551492,0.00012758037,0.00018726355,0.0009862147,0.00011258217,0.0000010064855],"category_scores_gemma":[0.00024654286,0.00018667614,0.000036900074,0.0011678183,0.00004752933,0.00033773165,0.000731098,0.0001733576,0.000009921798],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012849867,0.00007698008,0.0003543906,0.00003822716,0.0000140213615,0.0000085336915,0.0013843168,0.00057418423,0.004135756,0.055671334,0.0055448883,0.9321845],"study_design_scores_gemma":[0.002388652,0.0005029795,0.016514113,0.00011738887,0.000028727409,0.00015555204,0.0041578524,0.5412979,0.041829344,0.052673485,0.33783188,0.0025020917],"about_ca_topic_score_codex":0.0001472658,"about_ca_topic_score_gemma":0.0001894149,"teacher_disagreement_score":0.92968243,"about_ca_system_score_codex":0.0001428881,"about_ca_system_score_gemma":0.000024496514,"threshold_uncertainty_score":0.7612432},"labels":[],"label_agreement":null},{"id":"W2130330271","doi":"10.1002/ecja.20212","title":"A new multihoming architecture based on overlay network","year":2006,"lang":"en","type":"article","venue":"Electronics and Communications in Japan (Part I Communications)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Intecsea (Canada)","funders":"","keywords":"Multihoming; Computer network; Software deployment; Computer science; Architecture; Scalability; Overlay network; Distributed computing; Robustness (evolution); Overlay; Network architecture; The Internet; World Wide Web; Internet Protocol","score_opus":0.015766898665578233,"score_gpt":0.2568268089899032,"score_spread":0.24105991032432494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130330271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069318707,0.043094918,0.65177137,0.22119293,0.0003002236,0.0025717723,0.000022862414,0.0024778445,0.071636185],"genre_scores_gemma":[0.57047445,0.0011633196,0.42645505,0.001171868,0.00004948458,0.00022524482,0.00005729426,0.000027807888,0.0003754657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99753374,0.00038455447,0.000581547,0.00050101423,0.00028228134,0.0007168416],"domain_scores_gemma":[0.9876587,0.0010918453,0.0001930287,0.010846837,0.00009159801,0.00011798592],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00081054104,0.00030855744,0.00032507008,0.00041536984,0.0007857644,0.00028397585,0.008684394,0.00017121273,0.000005085308],"category_scores_gemma":[0.00011714011,0.0003346506,0.00008223788,0.0019309506,0.0002067515,0.00020744563,0.003034206,0.0011691574,0.000026531408],"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.000015297433,0.0003108577,0.0023487648,0.000004932655,0.00001982067,6.011708e-7,0.00027345849,0.017856793,0.000120752804,0.7828036,0.016301118,0.179944],"study_design_scores_gemma":[0.0006509747,0.0001567122,0.004010171,0.00015213627,0.000013225157,0.000010160345,0.000033448214,0.2688875,0.00009768162,0.053177364,0.6723039,0.0005067193],"about_ca_topic_score_codex":0.00022812402,"about_ca_topic_score_gemma":0.0038190968,"teacher_disagreement_score":0.72962624,"about_ca_system_score_codex":0.00025153506,"about_ca_system_score_gemma":0.00027438658,"threshold_uncertainty_score":0.99991053},"labels":[],"label_agreement":null},{"id":"W2131033443","doi":"10.1109/ipdps.2009.5160947","title":"Reliable P2P networks: TrebleCast and TrebleCast","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Computer network; Overlay; Node (physics); Overlay network; Distributed computing; Residual; Reliability (semiconductor); Computer security; The Internet; Engineering; Operating system","score_opus":0.008601863893528279,"score_gpt":0.21790885091449771,"score_spread":0.20930698702096945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131033443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013854785,0.0009668618,0.9067907,0.024416907,0.0003914837,0.00034023004,8.945097e-7,0.003060441,0.050177697],"genre_scores_gemma":[0.79754144,0.00011885985,0.1927847,0.0036572276,0.00012210189,0.000012421341,0.0000014278115,0.000012528244,0.0057493146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982126,0.000019637651,0.0002466958,0.0006286481,0.00024797276,0.0006444812],"domain_scores_gemma":[0.9986921,0.000060021714,0.000051846364,0.0009520564,0.00006348915,0.00018048284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025390743,0.0002292097,0.00024777264,0.00019413656,0.00015768794,0.0003305446,0.0011916305,0.00014237105,0.000017873996],"category_scores_gemma":[0.000041931737,0.00019925072,0.000043346143,0.001144603,0.000050473685,0.0004979185,0.00043743456,0.00021341702,0.0000825301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013576107,0.00009326733,0.0007561608,0.0000043941236,0.000016296426,0.000066629575,0.00018304476,0.006047234,0.0003034564,0.105082385,0.24748585,0.6399477],"study_design_scores_gemma":[0.0012983521,0.0016589282,0.016819969,0.00012401825,0.000020199359,0.0002949489,0.00010926297,0.72225267,0.0030328748,0.0426616,0.21015888,0.0015682983],"about_ca_topic_score_codex":0.000029930588,"about_ca_topic_score_gemma":0.000037284462,"teacher_disagreement_score":0.78368664,"about_ca_system_score_codex":0.000045650017,"about_ca_system_score_gemma":0.000028047405,"threshold_uncertainty_score":0.8125208},"labels":[],"label_agreement":null},{"id":"W2131086061","doi":"10.1109/icassp.2009.4960372","title":"Cheat-proof cooperation strategies for wireless live streaming social networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Incentive; Wireless network; Wireless; Cheating; Game theory; Quality (philosophy); Live streaming; The Internet; Quality of experience; Social network (sociolinguistics); Computer network; Multimedia; Social media; Quality of service; World Wide Web; Telecommunications; Microeconomics","score_opus":0.01882376320393333,"score_gpt":0.26546732379617405,"score_spread":0.2466435605922407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131086061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026990136,0.00005541982,0.9641486,0.0052287737,0.00019525152,0.00041443526,0.000001489134,0.0009323035,0.0020336155],"genre_scores_gemma":[0.9373913,0.000004662417,0.061168343,0.0008178443,0.00025615652,0.000048576352,0.000007368616,0.000007824069,0.00029795265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987309,0.00002132462,0.00021577101,0.0004152478,0.00017107054,0.0004456829],"domain_scores_gemma":[0.99932355,0.000068657435,0.000057225094,0.00032771073,0.00017124141,0.00005164561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019063854,0.00017748907,0.00019929667,0.000086031796,0.0002924839,0.00048843713,0.00086684525,0.00016200058,0.000004672495],"category_scores_gemma":[0.000020605217,0.00016289024,0.000057306414,0.00044648952,0.000037061833,0.0006700745,0.0001421481,0.00013920867,0.000009659846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012286029,0.000055410826,0.0000193402,0.000004991914,0.0000141678065,0.0000037234324,0.00079553324,0.014035289,0.0008676675,0.46473494,0.015956651,0.5035],"study_design_scores_gemma":[0.00045548932,0.0005737224,0.0012145189,0.000026679932,0.000009621325,0.0000055322644,0.00071986334,0.9645362,0.0038009344,0.026724247,0.0014406628,0.000492515],"about_ca_topic_score_codex":0.000017310198,"about_ca_topic_score_gemma":0.000098025324,"teacher_disagreement_score":0.9505009,"about_ca_system_score_codex":0.00006541884,"about_ca_system_score_gemma":0.000082377504,"threshold_uncertainty_score":0.6642471},"labels":[],"label_agreement":null},{"id":"W2131198707","doi":"10.1007/3-540-36261-4_10","title":"Experimenting with Gnutella Communities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Java; The Internet; Distributed computing; Host (biology); Software; Peer-to-peer; World Wide Web; Operating system","score_opus":0.026088979673936814,"score_gpt":0.2371510652515974,"score_spread":0.2110620855776606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131198707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000337232,0.0006581991,0.98269296,0.0015653233,0.0008151215,0.0004233484,0.0000025187862,0.00084819697,0.012657111],"genre_scores_gemma":[0.21986374,0.000054437576,0.7767585,0.001927626,0.0002653953,0.000026690524,0.0000029327198,0.000058663125,0.0010420087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99593836,0.00003545549,0.00047917236,0.0012667535,0.0012493695,0.0010308733],"domain_scores_gemma":[0.9959853,0.00046775062,0.0002597453,0.0028552224,0.00025306767,0.00017890029],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00060546456,0.00071060896,0.00063910644,0.001267745,0.00045327606,0.00097595283,0.00765384,0.00034171264,0.000029959117],"category_scores_gemma":[0.00003780614,0.0006137456,0.00009192776,0.0010833135,0.0011278647,0.00060304085,0.0040731058,0.001168998,0.00009585015],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007282776,0.000050225357,0.00017529259,0.000036521677,0.000031614603,0.00026516026,0.004922167,0.049879413,0.00009863731,0.03616658,0.00031159143,0.90805554],"study_design_scores_gemma":[0.00088672753,0.0015018729,0.00016309158,0.002908243,0.000026066104,0.00064931216,0.000009013697,0.81664944,0.011701457,0.1277461,0.033498853,0.0042598066],"about_ca_topic_score_codex":0.00004980198,"about_ca_topic_score_gemma":0.00013781305,"teacher_disagreement_score":0.9037957,"about_ca_system_score_codex":0.0003361851,"about_ca_system_score_gemma":0.00019542666,"threshold_uncertainty_score":0.9996314},"labels":[],"label_agreement":null},{"id":"W2131476128","doi":"10.1109/vecims.2009.5068925","title":"An adaptive virtual simulation and real-time emergency response system","year":2009,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems./Proceedings of the ... IEEE International Conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Emergency response; Response time; Computer science; Scalability; Virtual machine; Distributed computing; Real-time simulation; Virtual reality; Real-time computing; Simulation; Human–computer interaction; Operating system","score_opus":0.0807553638736896,"score_gpt":0.29039596456811756,"score_spread":0.20964060069442797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131476128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96714264,0.00012994869,0.020390674,0.0012605499,0.0053450754,0.002744044,0.00012107518,0.00026983052,0.002596186],"genre_scores_gemma":[0.9967326,0.00020879666,0.00046544886,0.0001481641,0.000608768,0.00018190518,0.00000688641,0.00008853027,0.0015589269],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884702,0.00023023963,0.0026690487,0.0024384367,0.0052383444,0.00095372193],"domain_scores_gemma":[0.99484026,0.00010155671,0.0027414784,0.0008444664,0.0010216539,0.00045058006],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0034831276,0.0015030354,0.0014643348,0.0008357887,0.0007693617,0.0013081823,0.005393155,0.00048495023,0.00003328236],"category_scores_gemma":[0.00007005444,0.0011958558,0.00031835234,0.00030678543,0.000659955,0.0019069064,0.0013760622,0.00088909094,0.000034825403],"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.0014673797,0.0010234672,0.00061349216,0.0001726864,0.0011250969,0.0000034035925,0.0027582913,0.016097525,0.7932776,0.17727397,0.001704507,0.0044825277],"study_design_scores_gemma":[0.009050878,0.029453464,0.02945817,0.019899216,0.0006996516,0.00021299008,0.012806966,0.6797031,0.20741364,0.0019584403,0.0036538355,0.005689616],"about_ca_topic_score_codex":0.00017280538,"about_ca_topic_score_gemma":0.000008352783,"teacher_disagreement_score":0.66360563,"about_ca_system_score_codex":0.0014353909,"about_ca_system_score_gemma":0.000074070194,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W2131607682","doi":"10.1109/vtcf.2006.556","title":"Congestion-Aware Ad Hoc Overlay Network","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Download; Mobile ad hoc network; Overlay network; Selection (genetic algorithm); Wireless ad hoc network; Distributed computing; The Internet; Wireless; Operating system","score_opus":0.010361734034786463,"score_gpt":0.22140585338511384,"score_spread":0.21104411935032738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131607682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20375171,0.0021447295,0.7546595,0.02752873,0.0014406068,0.0006942967,0.000010701294,0.008445529,0.0013242008],"genre_scores_gemma":[0.93530774,0.000096797754,0.063173875,0.00049952377,0.00012313463,0.00018138546,0.000008220667,0.000030043415,0.0005792985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966051,0.000069273454,0.0005025145,0.0011927988,0.00047675366,0.0011535629],"domain_scores_gemma":[0.99691206,0.00010862189,0.00021271387,0.0022226707,0.00042891622,0.00011501547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033361404,0.00046891565,0.0005223407,0.00060556177,0.00030930556,0.00022818327,0.0037210265,0.00084409816,0.000019211027],"category_scores_gemma":[0.00010863092,0.00047208113,0.000110894594,0.00275698,0.00046859894,0.00035933772,0.0008604755,0.0007886811,0.0004968712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000214389,0.00021786812,0.008599659,0.000029585852,0.00011642366,0.00080912845,0.00006787716,0.017631834,0.013332919,0.6462419,0.09300055,0.2199308],"study_design_scores_gemma":[0.001785326,0.0010706906,0.017426232,0.0005400272,0.00008266328,0.0006348457,0.000101889185,0.086050406,0.053642288,0.42570212,0.4097104,0.003253095],"about_ca_topic_score_codex":0.000032986416,"about_ca_topic_score_gemma":0.0002081853,"teacher_disagreement_score":0.731556,"about_ca_system_score_codex":0.00013293559,"about_ca_system_score_gemma":0.00018929299,"threshold_uncertainty_score":0.9997731},"labels":[],"label_agreement":null},{"id":"W2131848171","doi":"10.1109/ccnc.2007.28","title":"An Overlay Architecture for Information Publication and Discovery After the Composition of Registries in Ambient Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Overlay network; Computer network; Middleware (distributed applications); Architecture; Overlay; Composition (language); Distributed computing; Network architecture; World Wide Web; The Internet; Operating system","score_opus":0.005619130745595021,"score_gpt":0.23037855232471866,"score_spread":0.22475942157912362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131848171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13671309,0.000028296181,0.85774475,0.004875084,0.000053670297,0.00033978617,0.0000031537445,0.000082403625,0.00015973633],"genre_scores_gemma":[0.96567947,0.0000041717512,0.033506785,0.00071115355,0.00001787544,0.00004543237,0.000019073364,0.0000020980706,0.00001393719],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99932235,0.000016134609,0.00023066573,0.00012945315,0.00013422,0.00016717744],"domain_scores_gemma":[0.9992937,0.00010946177,0.00009191843,0.00039481343,0.00008494666,0.00002515048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052575086,0.00007208747,0.000079036334,0.00016638708,0.000043999615,0.0002221475,0.00037971404,0.000060840262,3.0435618e-7],"category_scores_gemma":[0.000036542435,0.00004948964,0.000017437806,0.00043592395,0.00006204241,0.0014194091,0.00012888496,0.000080962396,3.3438386e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004937766,0.00013000207,0.013006865,0.000052038587,0.000018602186,0.0000012096065,0.0038889647,0.02834016,0.0011523204,0.3409395,0.0066400827,0.6053365],"study_design_scores_gemma":[0.0009088363,0.0006776556,0.6726418,0.00009483939,0.000010310502,0.00002833064,0.00046642037,0.27480033,0.010637949,0.01661247,0.022651771,0.0004692384],"about_ca_topic_score_codex":0.000033235236,"about_ca_topic_score_gemma":0.0001988541,"teacher_disagreement_score":0.8289664,"about_ca_system_score_codex":0.000030454743,"about_ca_system_score_gemma":0.000011623783,"threshold_uncertainty_score":0.21421735},"labels":[],"label_agreement":null},{"id":"W2131866571","doi":"10.1109/mmcs.1995.484903","title":"The design and performance of a multimedia server for high-speed networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Weighting; Architecture; Admission control; Scheme (mathematics); Multimedia; Set (abstract data type); File server; Distributed computing; Computer network; Real-time computing","score_opus":0.025141748547831393,"score_gpt":0.21469019908145193,"score_spread":0.18954845053362054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131866571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10345623,0.00039156628,0.8923139,0.002722816,0.00020337869,0.00049311656,3.8417602e-7,0.00028618376,0.00013240386],"genre_scores_gemma":[0.720805,0.00011668461,0.2781238,0.00014162423,0.000024811747,0.00002588181,1.5904328e-7,0.0000051612133,0.00075691007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991599,0.000021928114,0.00016577396,0.00022139667,0.0001364762,0.00029454537],"domain_scores_gemma":[0.99883103,0.0004917794,0.00005461432,0.00050839107,0.000069897695,0.00004429687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003729326,0.00010224478,0.00012503173,0.000043335895,0.00013460426,0.000071486545,0.0009018952,0.000066497494,0.000004107572],"category_scores_gemma":[0.000061381485,0.00006524597,0.000022482101,0.0003115118,0.00008437736,0.0001909559,0.00030528882,0.000076478,0.000008065999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039753064,0.00004402923,0.0012257949,0.000015510765,0.000037925052,0.0000016168138,0.00032933918,0.023959508,0.00022994715,0.018843021,0.05055856,0.904715],"study_design_scores_gemma":[0.00023241468,0.00023435419,0.002715662,0.000009589999,0.0000029411556,0.0000026987332,0.000006241022,0.9926927,0.0023063459,0.0004553303,0.0012457216,0.00009600509],"about_ca_topic_score_codex":0.000007082852,"about_ca_topic_score_gemma":0.000006838049,"teacher_disagreement_score":0.9687332,"about_ca_system_score_codex":0.000012201757,"about_ca_system_score_gemma":0.0000056799963,"threshold_uncertainty_score":0.26606536},"labels":[],"label_agreement":null},{"id":"W2131950652","doi":"10.1109/ism.2006.152","title":"Traceroute-Based Fast Peer Selection without Offline Database","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"traceroute; Computer science; Computer network; The Internet; Upload; Bandwidth (computing); Database; World Wide Web","score_opus":0.012520830115509321,"score_gpt":0.24526746880100075,"score_spread":0.23274663868549145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131950652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028216733,0.000020197092,0.9526323,0.011086222,0.0002147328,0.0002130041,0.000007656377,0.0024173476,0.005191773],"genre_scores_gemma":[0.60419434,4.0733048e-7,0.3879831,0.00062916096,0.000110213216,0.000025326995,0.000023595348,0.000012194363,0.007021631],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982019,0.000032355994,0.00024498996,0.0005536825,0.00053879194,0.0004282784],"domain_scores_gemma":[0.9988144,0.000049784154,0.000063525826,0.00077702396,0.0002206368,0.000074649535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035206584,0.0001953105,0.00017518157,0.0002451457,0.000118032534,0.00019255921,0.0010109929,0.00009366741,0.000034926892],"category_scores_gemma":[0.000066537694,0.00017222145,0.00004818756,0.0011327731,0.00004280657,0.00045822552,0.00024720732,0.00019486021,0.0002210189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063092906,0.0007486518,0.033546973,0.000033491127,0.000036935427,0.000059512262,0.00010327553,0.041508883,0.033975795,0.10482549,0.6555613,0.1295366],"study_design_scores_gemma":[0.0010709655,0.00026953363,0.011084961,0.00003280773,0.000015545287,0.000037244172,0.00002068924,0.76241046,0.10675717,0.0020156603,0.11552866,0.0007563212],"about_ca_topic_score_codex":0.00039867163,"about_ca_topic_score_gemma":0.00089284906,"teacher_disagreement_score":0.72090155,"about_ca_system_score_codex":0.000084566775,"about_ca_system_score_gemma":0.00007444982,"threshold_uncertainty_score":0.7022987},"labels":[],"label_agreement":null},{"id":"W2132432849","doi":"10.1145/1517494.1517505","title":"Persistence in massively multiplayer online games","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Persistence (discontinuity); Computer science; Massively parallel; Multimedia; Human–computer interaction; Parallel computing; Engineering","score_opus":0.055488117171763336,"score_gpt":0.24804174159618023,"score_spread":0.1925536244244169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132432849","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8136974,0.000150644,0.16671225,0.013499159,0.00022541489,0.00021091063,0.0000028184884,0.0011929013,0.0043084803],"genre_scores_gemma":[0.70871294,0.000022297887,0.28868923,0.0007594662,0.000016542677,0.000009404246,6.172602e-7,0.0000043564237,0.0017851547],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987923,0.000019132687,0.00017794638,0.0004141188,0.0002388271,0.00035769344],"domain_scores_gemma":[0.99918395,0.000074535754,0.000032937158,0.00058403745,0.000055553173,0.00006898399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008629271,0.00012780093,0.00015320195,0.00022426268,0.000059439466,0.000030259722,0.0014114089,0.00007457063,0.000012671455],"category_scores_gemma":[0.00012761679,0.000110334695,0.00004175011,0.00080510014,0.000073449744,0.00029539093,0.00058257894,0.00016476247,0.00014056821],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052695374,0.0015025326,0.32043883,0.00003363293,0.00007428602,0.0031162803,0.009936284,0.013855052,0.014135072,0.04752525,0.14460547,0.44472462],"study_design_scores_gemma":[0.0010505198,0.00029109622,0.7386324,0.00007365037,0.000003060095,0.00029777756,0.0006538514,0.21422112,0.008999976,0.0018894271,0.032919828,0.0009673056],"about_ca_topic_score_codex":0.00006217622,"about_ca_topic_score_gemma":0.00019028556,"teacher_disagreement_score":0.4437573,"about_ca_system_score_codex":0.00006000486,"about_ca_system_score_gemma":0.000046267567,"threshold_uncertainty_score":0.44993183},"labels":[],"label_agreement":null},{"id":"W2133145073","doi":"10.1109/infocom.2006.101","title":"Epidemiological Modelling of Peer-to-Peer Viruses and Pollution","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Popularity; Peer-to-peer; Reputation; Computer security; Order (exchange); Pollution; Risk analysis (engineering); Distributed computing; Business; Ecology","score_opus":0.060676112415305995,"score_gpt":0.28029275901683,"score_spread":0.219616646601524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133145073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18333143,0.000096636715,0.797687,0.016099958,0.000088734734,0.00014085635,0.0000032348507,0.00050808216,0.0020441068],"genre_scores_gemma":[0.6477504,0.0000031836303,0.35054514,0.0009167222,0.00003546644,0.000008494769,7.668183e-7,0.0000043526084,0.0007355251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830717,0.00005128326,0.00036421555,0.0004766433,0.00041880104,0.000381883],"domain_scores_gemma":[0.99895436,0.00014763267,0.00007171575,0.00051340525,0.00022456792,0.00008833705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088330335,0.00016502294,0.0002929274,0.00020664866,0.00007364967,0.000055884146,0.0007570106,0.00014281568,0.000006110625],"category_scores_gemma":[0.00035385726,0.0001288408,0.00005058914,0.0005931679,0.00008326987,0.00021780489,0.0006111182,0.00013000303,0.00003668618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017151651,0.00008852252,0.006037478,0.0000097043985,0.000014301488,0.000009241473,0.00012050701,0.3823798,0.0039160256,0.5148102,0.060108043,0.032489058],"study_design_scores_gemma":[0.00033975366,0.0003972909,0.018501014,0.000045303572,0.000011622807,0.000037250138,0.000054270135,0.75254244,0.020032022,0.16624612,0.04115037,0.00064256677],"about_ca_topic_score_codex":0.00042097,"about_ca_topic_score_gemma":0.00003976509,"teacher_disagreement_score":0.46441892,"about_ca_system_score_codex":0.000034877485,"about_ca_system_score_gemma":0.000018160805,"threshold_uncertainty_score":0.52539754},"labels":[],"label_agreement":null},{"id":"W2133567111","doi":"10.1109/icc.2009.5199455","title":"Service Engineering for Inter-Domain Overlay Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Overlay; Computer science; Overlay network; Underlay; Computer network; Distributed computing; Domain (mathematical analysis); Service (business); Key (lock); Traffic engineering; The Internet; Computer security; Telecommunications; Signal-to-noise ratio (imaging)","score_opus":0.009563064887685914,"score_gpt":0.22508569662192737,"score_spread":0.21552263173424147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133567111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004062159,0.000058042868,0.976656,0.01593463,0.00035871798,0.0002500133,6.424529e-7,0.001699367,0.0009804107],"genre_scores_gemma":[0.4312601,0.0000024701687,0.5633864,0.0049923677,0.00011523043,0.000029589466,0.0000014198255,0.000009257583,0.00020316298],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887604,0.0000065833215,0.00017583914,0.0003573394,0.00012301184,0.00046119333],"domain_scores_gemma":[0.99906385,0.00009448016,0.000030694937,0.0006566993,0.00006930469,0.00008499093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020549468,0.00015874114,0.00015862146,0.0001252947,0.000049774753,0.00014361508,0.0014393308,0.00009616618,0.0000039121687],"category_scores_gemma":[0.000038171827,0.00014740927,0.000053577463,0.00073646836,0.0000053148906,0.000274044,0.00030583804,0.00012609754,0.000025549492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017056225,0.00007571461,0.000071971284,0.000016957767,0.000035160567,0.000018941542,0.00036932167,0.13500369,0.0020916269,0.3611171,0.12556137,0.3756211],"study_design_scores_gemma":[0.00024029156,0.00018619257,0.0007518984,0.000032399996,0.0000024776882,0.000012379697,0.000019739906,0.9187746,0.0010215071,0.008179591,0.070470765,0.0003081515],"about_ca_topic_score_codex":0.000007847591,"about_ca_topic_score_gemma":0.000024157825,"teacher_disagreement_score":0.7837709,"about_ca_system_score_codex":0.000050356677,"about_ca_system_score_gemma":0.0000121027815,"threshold_uncertainty_score":0.60111755},"labels":[],"label_agreement":null},{"id":"W2134123012","doi":"10.1109/surv.2011.040410.00097","title":"A Survey of Distributed Search Techniques in Large Scale Distributed Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed database; Peer-to-peer; Bandwidth (computing); Distributed computing; Distributed data store; Shared resource; Distributed Computing Environment; XML; World Wide Web; Computer network","score_opus":0.054644513751836196,"score_gpt":0.3304703817853918,"score_spread":0.2758258680335556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134123012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24525584,0.00033547502,0.7438656,0.0012854447,0.00257092,0.0014764733,0.0036920852,0.0012797224,0.00023843745],"genre_scores_gemma":[0.97683686,0.00007713331,0.022012472,0.000012664841,0.00007470779,0.00027278598,0.0006592279,0.000023165276,0.000030986288],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9927371,0.0043454785,0.0011152921,0.0005471977,0.00057292206,0.00068201794],"domain_scores_gemma":[0.9885263,0.0028108214,0.0003125605,0.0069768713,0.0012252178,0.00014821516],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.019851085,0.00027852593,0.00070725486,0.00046592276,0.00024279964,0.00023856125,0.008276837,0.00036897798,0.0000037619154],"category_scores_gemma":[0.0026568621,0.00028578466,0.00007873555,0.0039388943,0.00036257418,0.00041986982,0.0022915462,0.00084446016,0.000032765907],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000713456,0.00435535,0.7421946,0.00017566598,0.0002582929,0.00002119544,0.0024667108,0.0016362331,0.12440611,0.053439185,0.03588117,0.035094135],"study_design_scores_gemma":[0.00084521057,0.00017179365,0.920919,0.00020153758,0.000014743892,0.0000123309,0.00012438228,0.021809146,0.02943113,0.00086849666,0.024656551,0.00094568764],"about_ca_topic_score_codex":0.00739041,"about_ca_topic_score_gemma":0.021250926,"teacher_disagreement_score":0.73158103,"about_ca_system_score_codex":0.00016016472,"about_ca_system_score_gemma":0.00031382783,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W2134387352","doi":"10.1109/srds.2009.32","title":"Reliable and Highly Available Distributed Publish/Subscribe Service","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Publication; Reliability (semiconductor); Distributed computing; Service (business); Computer network; Crash; Context (archaeology); Matching (statistics); Routing (electronic design automation); High availability; Operating system","score_opus":0.01517492436064172,"score_gpt":0.21473418363592733,"score_spread":0.19955925927528562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134387352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05754277,0.0008779442,0.5008598,0.32924625,0.0008656687,0.00077642745,0.000024359862,0.0099893315,0.09981742],"genre_scores_gemma":[0.6254081,0.00006295954,0.34198505,0.019422648,0.00009335158,0.000029098246,0.000031553052,0.000018284234,0.012948939],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983022,0.000012685622,0.00022082194,0.00060546,0.0002963565,0.0005624584],"domain_scores_gemma":[0.9984472,0.000037168633,0.000050459705,0.0010792702,0.00020815717,0.00017778577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027524156,0.00018890205,0.00020544516,0.0001454333,0.00014353385,0.0007183741,0.0016228359,0.00012861907,0.000042223845],"category_scores_gemma":[0.000076595454,0.00016657874,0.000024039618,0.0018311504,0.000024620473,0.0012828696,0.0006673081,0.0001830256,0.00049720804],"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.0000046730206,0.000050286253,0.0005878243,0.0000058598966,0.000007761973,0.000018423534,0.000056670528,0.000117458105,0.000660943,0.07348199,0.912664,0.01234409],"study_design_scores_gemma":[0.0006548103,0.00036686865,0.011026394,0.000045967296,0.000011147622,0.000060665345,0.000051335162,0.050999682,0.009797709,0.038216863,0.8879703,0.0007982147],"about_ca_topic_score_codex":0.00015257034,"about_ca_topic_score_gemma":0.000059580776,"teacher_disagreement_score":0.5678654,"about_ca_system_score_codex":0.000053157528,"about_ca_system_score_gemma":0.000048875856,"threshold_uncertainty_score":0.6927298},"labels":[],"label_agreement":null},{"id":"W2134502143","doi":"10.1109/tpds.2007.70748","title":"A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Overlay; Computer network; Video on demand; On demand; Video streaming; Real Time Streaming Protocol; Live streaming; Multimedia; Operating system; The Internet","score_opus":0.019989506449667332,"score_gpt":0.24266425715382958,"score_spread":0.22267475070416226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134502143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026975313,0.00007546845,0.9692167,0.0010279755,0.0008288162,0.00067249977,0.0005064865,0.0006228061,0.00007394757],"genre_scores_gemma":[0.9890959,0.000018609782,0.009885879,0.00009803964,0.000028180382,0.0005280426,0.00005078909,0.0000206943,0.00027382994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982308,0.000056823148,0.00034243238,0.00060444523,0.00033035353,0.0004351425],"domain_scores_gemma":[0.99835837,0.0005603806,0.00011905829,0.00063401915,0.00013218985,0.00019599074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013268607,0.00031184827,0.00036286382,0.00028228975,0.00055386865,0.00015328678,0.00045496516,0.00012842283,0.0000028601155],"category_scores_gemma":[0.00001817607,0.00025803514,0.000101076716,0.0005980248,0.000108893924,0.00026378557,0.0000045334455,0.00027141304,0.000016058582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026316725,0.00037862486,0.00007430782,0.00005535585,0.0001186027,0.00005504681,0.00033349977,0.9908988,0.0001994478,0.00091775955,0.0037271972,0.0029781798],"study_design_scores_gemma":[0.0023853127,0.001019898,0.0009903874,0.0003527867,0.000056138917,0.00024013495,0.00031248,0.98748165,0.0003623054,0.00015149724,0.005976665,0.0006707635],"about_ca_topic_score_codex":0.000104656014,"about_ca_topic_score_gemma":0.0002972606,"teacher_disagreement_score":0.9621206,"about_ca_system_score_codex":0.00016893256,"about_ca_system_score_gemma":0.00009708415,"threshold_uncertainty_score":0.9999872},"labels":[],"label_agreement":null},{"id":"W2134551023","doi":"10.1109/icccn.2004.1401736","title":"Procedure for multicast tree maintenance based on member time duration","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Multicast; Duration (music); Computer science; Tree (set theory); Node (physics); Distributed computing; Computer network; Tree structure; Algorithm; Binary tree; Engineering; Mathematics","score_opus":0.015564839560080425,"score_gpt":0.2519738540242712,"score_spread":0.23640901446419077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134551023","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038110379,0.0000051886477,0.9276455,0.055916987,0.000083952975,0.0006526559,0.0000034627103,0.0012297805,0.010651409],"genre_scores_gemma":[0.48762533,3.271154e-7,0.5025088,0.0029838774,0.00007339681,0.00012796506,0.0000029707292,0.000009890916,0.0066674273],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884576,0.000010640169,0.00018216729,0.00041515156,0.00020932563,0.00033697046],"domain_scores_gemma":[0.9990953,0.00011705847,0.00004929863,0.0005673202,0.00011089139,0.000060130096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018424363,0.00014058233,0.0001230446,0.00010963638,0.00007625034,0.000094604904,0.000726725,0.000082038714,0.00002453489],"category_scores_gemma":[0.0002463835,0.00011094039,0.000048804483,0.0003344217,0.000025025713,0.0002693853,0.0001000711,0.00007876494,0.00045392953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008962164,0.00032176863,0.00015795247,0.00002694066,0.000017427363,0.0000069599773,0.00019744737,0.027041703,0.008575352,0.056950647,0.53486884,0.37174532],"study_design_scores_gemma":[0.00039303963,0.0001484689,0.0005776662,0.00002183669,0.000002247883,0.000003244294,0.0000045569604,0.9489872,0.016243696,0.0005454788,0.032902066,0.00017049527],"about_ca_topic_score_codex":0.0000016470325,"about_ca_topic_score_gemma":0.000058226226,"teacher_disagreement_score":0.9219455,"about_ca_system_score_codex":0.00008321364,"about_ca_system_score_gemma":0.000041901414,"threshold_uncertainty_score":0.5834497},"labels":[],"label_agreement":null},{"id":"W2135105254","doi":"10.1109/tpds.2007.70726","title":"Overlay Networks with Linear Capacity Constraints","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Ontario Tech University","funders":"","keywords":"Overlay network; Computer science; Overlay; Linear programming; Network topology; Distributed computing; Node (physics); Computer network; Virtual network; Path (computing); Maximum flow problem; Context (archaeology); The Internet; Mathematical optimization; Algorithm; Mathematics","score_opus":0.025990534380577652,"score_gpt":0.21677064655900524,"score_spread":0.19078011217842758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135105254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022052953,0.00012025378,0.97543216,0.00041901867,0.00049168116,0.00039098292,0.00014234228,0.0007460265,0.000204568],"genre_scores_gemma":[0.99020714,0.000050227485,0.009309652,0.00009989101,0.000042196574,0.00010239801,0.000008749363,0.000012549734,0.00016719855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829215,0.00007186047,0.00030326602,0.00053350476,0.00032963607,0.00046957683],"domain_scores_gemma":[0.9988239,0.000115984214,0.000087041524,0.0006210973,0.00011438966,0.00023762808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014933878,0.00027667018,0.0003461639,0.00012410081,0.00043583274,0.00009825497,0.0004895922,0.00018738925,0.0000043244872],"category_scores_gemma":[0.000005575986,0.00022589417,0.00006238769,0.0006663792,0.00031083013,0.00024735372,0.000006323697,0.00035679838,0.000032440756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042229683,0.00010867637,0.00019895133,0.000012699606,0.000070300695,0.00008293218,0.00012483806,0.99383736,0.000030030022,0.0015352606,0.0022119172,0.0017448248],"study_design_scores_gemma":[0.0020725722,0.00086921034,0.0024664921,0.00020602158,0.000042767766,0.0019573374,0.00019591114,0.9841942,0.00033835944,0.0001022915,0.0065012057,0.0010535932],"about_ca_topic_score_codex":0.00012410396,"about_ca_topic_score_gemma":0.000035234076,"teacher_disagreement_score":0.9681542,"about_ca_system_score_codex":0.00006957607,"about_ca_system_score_gemma":0.00005694107,"threshold_uncertainty_score":0.9211697},"labels":[],"label_agreement":null},{"id":"W2135846425","doi":"10.1109/jsac.2007.070108","title":"Distributed pattern matching: a key to flexible and efficient P2P search","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed hash table; Distributed computing; Overhead (engineering); Hash table; Matching (statistics); Service discovery; Peer-to-peer; Theoretical computer science; Hash function; Computer security","score_opus":0.03778736789509546,"score_gpt":0.32142386260348016,"score_spread":0.2836364947083847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135846425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39235163,0.00012402369,0.59146816,0.0150129,0.00012579809,0.00022611168,0.000009647717,0.0002688465,0.00041290733],"genre_scores_gemma":[0.9409146,0.00007837898,0.058210693,0.00068351545,0.000037741804,0.000016537777,0.0000057910047,0.000014434803,0.000038328075],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979462,0.00020969691,0.00047892783,0.00030027266,0.00046554304,0.00059935555],"domain_scores_gemma":[0.9967656,0.00066924794,0.000108525994,0.0017648942,0.00038160084,0.0003100966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013824748,0.00018341707,0.00022171519,0.00080031063,0.00048514697,0.00033907036,0.0035103874,0.000101687416,0.0000034930747],"category_scores_gemma":[0.0002558738,0.0001750902,0.000038110586,0.0031485343,0.000073616146,0.00014083523,0.0009440748,0.0011565164,0.000046202436],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024228694,0.0034858165,0.042273548,0.000036991667,0.00024776254,0.00034139052,0.018507687,0.16281173,0.019616302,0.034813244,0.026139703,0.69148356],"study_design_scores_gemma":[0.0026411752,0.0015622247,0.7760036,0.0011651417,0.00003464479,0.0016714726,0.0011087202,0.14295226,0.019775506,0.010732695,0.040409315,0.0019432483],"about_ca_topic_score_codex":0.00007947239,"about_ca_topic_score_gemma":0.00039540118,"teacher_disagreement_score":0.73373,"about_ca_system_score_codex":0.00035529005,"about_ca_system_score_gemma":0.00012795995,"threshold_uncertainty_score":0.7139971},"labels":[],"label_agreement":null},{"id":"W2136064925","doi":"10.1109/.2006.1629437","title":"Unstructured Peer-to-Peer Session over IP using SIP","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Session Initiation Protocol; Computer science; Scalability; Session (web analytics); Peer-to-peer; SIP trunking; Computer network; Service provider; Voice over IP; Service (business); Modular design; Protocol (science); Server; The Internet; World Wide Web; Database; Operating system","score_opus":0.015922274056027176,"score_gpt":0.26966963794424637,"score_spread":0.25374736388821917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136064925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32649726,0.000032038075,0.65190095,0.011505953,0.00095881906,0.0003033789,0.0000058274923,0.0018219914,0.0069737956],"genre_scores_gemma":[0.6307252,3.121509e-7,0.36126077,0.0011815322,0.00016987776,0.000007157055,0.0000031902111,0.00001910191,0.0066328817],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699396,0.000039979685,0.00034252316,0.00077006995,0.0011399968,0.00071346323],"domain_scores_gemma":[0.99812794,0.00006523423,0.00008299912,0.0012281627,0.0003367022,0.00015893932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003620359,0.00030616613,0.0002774898,0.0003743147,0.0001998113,0.0003796449,0.0018032148,0.00021585703,0.00007840983],"category_scores_gemma":[0.00015148694,0.00025560748,0.00008582586,0.0015575024,0.000052212057,0.00050463126,0.0012576941,0.0002475733,0.0001648882],"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.000027546494,0.00012995323,0.007842034,0.00002066882,0.000038884395,0.00014847827,0.00042835425,0.043129325,0.06484533,0.11911157,0.5916947,0.17258316],"study_design_scores_gemma":[0.0014916927,0.00030471027,0.120248154,0.00017485471,0.000036757803,0.00019560245,0.000133694,0.2799781,0.123283684,0.08047051,0.39106396,0.002618289],"about_ca_topic_score_codex":0.0003920453,"about_ca_topic_score_gemma":0.00011522849,"teacher_disagreement_score":0.30422795,"about_ca_system_score_codex":0.00017356152,"about_ca_system_score_gemma":0.00007435961,"threshold_uncertainty_score":0.9999896},"labels":[],"label_agreement":null},{"id":"W2136144445","doi":"10.1109/tpds.2008.229","title":"Enforcing Minimum-Cost Multicast Routing against Selfish Information Flows","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Xcast; Source-specific multicast; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Computer network; Routing (electronic design automation); Distributed computing; Cost allocation; Resource allocation; Protocol Independent Multicast; Mathematics; Economics; Telecommunications","score_opus":0.02178488400082582,"score_gpt":0.22697406040682014,"score_spread":0.20518917640599432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136144445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054580916,0.000037567745,0.9423656,0.00036143966,0.0007328821,0.00057718076,0.00016641521,0.0008560563,0.00032197245],"genre_scores_gemma":[0.9928319,0.000049498933,0.006640351,0.00015264528,0.000035430345,0.0001687305,0.000039496274,0.000009561384,0.00007241551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816656,0.000057780806,0.00055885623,0.0003550375,0.00037152594,0.00049022713],"domain_scores_gemma":[0.99882686,0.00013497859,0.00013705231,0.00055043184,0.00014448503,0.00020621814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023044054,0.00026837274,0.00031002215,0.00024335377,0.00063684845,0.00028080554,0.0005293745,0.00018226313,0.0000014899855],"category_scores_gemma":[0.000026081396,0.00025586432,0.00008325618,0.00072374055,0.00005486703,0.0010711818,0.000012427352,0.00028798942,0.000107954664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028790286,0.00008075816,0.00014146292,0.000038244805,0.00005261427,0.000034238652,0.0012069861,0.97851443,0.0002047753,0.00042474127,0.002297714,0.016975226],"study_design_scores_gemma":[0.00085349113,0.000097393095,0.00049058005,0.00010302804,0.000011989571,0.00017595378,0.00050580886,0.9905196,0.000251866,0.000013740252,0.0065721455,0.00040442217],"about_ca_topic_score_codex":0.00012698823,"about_ca_topic_score_gemma":0.000025029218,"teacher_disagreement_score":0.93825096,"about_ca_system_score_codex":0.00013102326,"about_ca_system_score_gemma":0.000057061145,"threshold_uncertainty_score":0.99998933},"labels":[],"label_agreement":null},{"id":"W2136255046","doi":"10.1109/jsac.2007.070103","title":"Enhancing peer-to-peer systems through redundancy","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Chord (peer-to-peer); Pastry; Redundancy (engineering); Distributed computing; Computer network; Routing table; Peer-to-peer; Fault tolerance; Network topology; Distributed hash table; Static routing; Routing (electronic design automation); Routing protocol","score_opus":0.04279279303619205,"score_gpt":0.33016500893815404,"score_spread":0.287372215901962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136255046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076396435,0.00090397435,0.8560479,0.05114579,0.002124066,0.00074148475,0.00000844752,0.0010400368,0.011591861],"genre_scores_gemma":[0.81035656,0.00013378568,0.1873546,0.000942451,0.00020171356,0.000046648744,0.0000048717807,0.000032534732,0.00092684967],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99604833,0.00034044468,0.0010529226,0.00044928497,0.0012002082,0.000908789],"domain_scores_gemma":[0.99290925,0.001058979,0.0003493136,0.0034700881,0.0019101242,0.0003022521],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0029799931,0.00031312602,0.0004123487,0.00096176483,0.0007249612,0.00058241986,0.0069706826,0.00022107172,0.000004503925],"category_scores_gemma":[0.0019100739,0.00030817604,0.00008973338,0.0050074863,0.000087990484,0.0006523437,0.00074670045,0.0018603576,0.00019879144],"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.0003051437,0.00375554,0.010013152,0.00007721972,0.0006247634,0.00077471207,0.032901585,0.058201015,0.07203703,0.322015,0.35499197,0.14430289],"study_design_scores_gemma":[0.0024582222,0.0017375083,0.039590687,0.0032999453,0.00006690237,0.0034571704,0.0021979455,0.019287253,0.045341093,0.023353888,0.85619086,0.0030185431],"about_ca_topic_score_codex":0.00011587136,"about_ca_topic_score_gemma":0.0008505773,"teacher_disagreement_score":0.7339601,"about_ca_system_score_codex":0.00079335284,"about_ca_system_score_gemma":0.00030062336,"threshold_uncertainty_score":0.99993706},"labels":[],"label_agreement":null},{"id":"W2136344560","doi":"10.1109/icdcs.2009.73","title":"Transactional Mobility in Distributed Content-Based Publish/Subscribe Systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Computer science; Transactional leadership; Publication; Distributed computing; Computer network; Resource (disambiguation); Transactional memory; Database transaction; Database","score_opus":0.03803314291173599,"score_gpt":0.24055224636905861,"score_spread":0.20251910345732263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136344560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05481863,0.00006759081,0.926204,0.016193194,0.00037376094,0.00039374887,0.00002250009,0.0012501142,0.0006764113],"genre_scores_gemma":[0.98256326,8.4113935e-7,0.01647182,0.00073340116,0.00001933715,0.000050343802,0.00001797766,0.000003760348,0.00013923841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981898,0.00006155239,0.00036495464,0.0005251268,0.00040873504,0.00044982092],"domain_scores_gemma":[0.99880993,0.00009800173,0.00005089879,0.00076647056,0.00015719094,0.000117521085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049060804,0.00016944784,0.00024197763,0.00021975405,0.000056781522,0.00033271156,0.0013151286,0.0001313709,0.000012037567],"category_scores_gemma":[0.00011696493,0.00014996748,0.00006596535,0.0012551375,0.000042654614,0.00067627744,0.000049448157,0.00022674112,0.000027293572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024086994,0.004206657,0.027454756,0.00009324963,0.0000851418,0.0002902387,0.00035395002,0.12074741,0.010917018,0.54219186,0.08753335,0.20588551],"study_design_scores_gemma":[0.0027515388,0.0006863673,0.28627086,0.00011601619,0.000009430764,0.000038787966,0.00033459367,0.6766219,0.010647602,0.0061676214,0.015187749,0.0011675197],"about_ca_topic_score_codex":0.00021123551,"about_ca_topic_score_gemma":0.0001199133,"teacher_disagreement_score":0.9277446,"about_ca_system_score_codex":0.00021443647,"about_ca_system_score_gemma":0.00009012792,"threshold_uncertainty_score":0.6115496},"labels":[],"label_agreement":null},{"id":"W2136550872","doi":"10.1109/ccece.1999.808169","title":"Information retrieval from networked heterogeneous sources","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Information retrieval; Set (abstract data type); Process (computing); Originality; Human–computer information retrieval; Information system; World Wide Web; Software agent; Search engine; Artificial intelligence; Engineering","score_opus":0.009924572434405815,"score_gpt":0.20833217819505173,"score_spread":0.19840760576064592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136550872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27015996,0.00011250114,0.7201971,0.0008906562,0.00046549758,0.00014788135,0.0000016316478,0.0013106646,0.006714137],"genre_scores_gemma":[0.88936806,0.0000085846805,0.10885869,0.0014489962,0.000039986116,0.000005655572,0.000004334664,0.000005061665,0.00026063892],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890375,0.000040559622,0.00023999036,0.00018883249,0.00029063522,0.0003362175],"domain_scores_gemma":[0.9990067,0.000080948244,0.00006810988,0.0006911629,0.000065827975,0.00008725675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001997228,0.00013466537,0.00013331098,0.000116454474,0.000096784446,0.0002880055,0.0009956502,0.00010660262,0.00004011267],"category_scores_gemma":[0.00015042869,0.00011829964,0.000043925767,0.00065921736,0.000027848242,0.0007164393,0.00027659722,0.00011365286,0.0005089057],"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.00009611961,0.00016316136,0.00850626,0.000017301169,0.00024198504,0.00006556018,0.0061762156,0.127563,0.0017130797,0.24192868,0.15081996,0.46270868],"study_design_scores_gemma":[0.0009072984,0.00034458528,0.0018626365,0.000034429824,0.0000147792825,0.00006472745,0.00026097064,0.16869755,0.07638034,0.051745344,0.6985433,0.0011440158],"about_ca_topic_score_codex":0.0000318478,"about_ca_topic_score_gemma":0.000013748466,"teacher_disagreement_score":0.6192081,"about_ca_system_score_codex":0.0000419625,"about_ca_system_score_gemma":0.000030145806,"threshold_uncertainty_score":0.6541123},"labels":[],"label_agreement":null},{"id":"W2136650348","doi":"10.1109/p2p.2007.20","title":"An Efficient Eigenvalue-based P2P XML Routing Framework","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Computer network; Static routing; Dynamic Source Routing; Policy-based routing; XML; Routing (electronic design automation); Routing protocol; World Wide Web","score_opus":0.01506827979690054,"score_gpt":0.2862163882874132,"score_spread":0.27114810849051263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136650348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493502,0.00003284737,0.84244114,0.0016663069,0.00043400403,0.00018144237,5.245693e-7,0.0024575226,0.0034360136],"genre_scores_gemma":[0.56302613,2.0910153e-7,0.43551803,0.0013248837,0.00006311427,0.0000044658727,6.0475213e-7,0.00000911597,0.000053430413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976495,0.000037200138,0.00031356962,0.000653547,0.00053151965,0.0008146974],"domain_scores_gemma":[0.9977282,0.0003022242,0.00007469035,0.0015800467,0.00009880213,0.00021598538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013508695,0.00020768325,0.00018343856,0.0002668368,0.00020314725,0.00023180929,0.002303266,0.00019950494,0.000022407534],"category_scores_gemma":[0.00025473433,0.0001852116,0.000066396235,0.0014051152,0.00006221459,0.0001423941,0.00042614414,0.00032101315,0.00023285465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018568655,0.00033998044,0.0062469286,0.000008651404,0.000017760849,0.000120297,0.00083167583,0.13107851,0.0019069087,0.57253206,0.002132271,0.2847664],"study_design_scores_gemma":[0.00027342813,0.00035182602,0.0143349655,0.000074397365,0.0000063687544,0.0000106122025,0.00018379706,0.9248371,0.047150612,0.008350037,0.0037239767,0.00070289755],"about_ca_topic_score_codex":0.000040433286,"about_ca_topic_score_gemma":0.00002563068,"teacher_disagreement_score":0.7937586,"about_ca_system_score_codex":0.000117142896,"about_ca_system_score_gemma":0.000065608205,"threshold_uncertainty_score":0.75527096},"labels":[],"label_agreement":null},{"id":"W2136664366","doi":"10.1002/cpe.3439","title":"Distributed wikis: a survey","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Viewpoints; Computer science; World Wide Web; Context (archaeology); Data science; Peer-to-peer; Collaborative editing; Scheme (mathematics); Knowledge management","score_opus":0.026882371793692638,"score_gpt":0.3181151629785834,"score_spread":0.29123279118489076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136664366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1208723,0.00044210436,0.8751243,0.0026042445,0.0002603652,0.00010701271,0.00000428936,0.00023516222,0.00035025566],"genre_scores_gemma":[0.979163,0.00008937708,0.019745426,0.0009261635,0.000021546371,0.000029025758,0.000010273185,0.0000036259648,0.0000116005585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.00018503654,0.00020308103,0.00044758333,0.00018855413,0.00022241913],"domain_scores_gemma":[0.99845946,0.00087623036,0.000115476876,0.00024662257,0.00018268012,0.00011955566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054158585,0.000133424,0.00014650884,0.00006736926,0.0002178379,0.0003164544,0.00036346028,0.000055794135,0.0000014188288],"category_scores_gemma":[0.0015903249,0.00012806014,0.000012052574,0.00050822925,0.00011754308,0.0012158205,0.0003223783,0.00013080677,0.000015070008],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028589237,0.0000791645,0.0048912163,0.000016668788,0.000014957411,0.00000906718,0.008095721,0.00028555043,0.00011424755,0.06670015,0.0032438878,0.9165208],"study_design_scores_gemma":[0.0015716851,0.0012282892,0.15969783,0.0001433639,0.00003098948,0.0003268961,0.0037150087,0.59794855,0.0008656779,0.021285111,0.21163969,0.0015469119],"about_ca_topic_score_codex":0.00006170869,"about_ca_topic_score_gemma":0.000008304257,"teacher_disagreement_score":0.91497386,"about_ca_system_score_codex":0.000010778186,"about_ca_system_score_gemma":0.000027399217,"threshold_uncertainty_score":0.5222141},"labels":[],"label_agreement":null},{"id":"W2136799899","doi":"10.5555/2043468.2043511","title":"Dissemination of address bindings in multi-substrate overlay networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overlay network; Computer science; Scalability; Computer network; Overlay; Gossip; Dissemination; Gossip protocol; Distributed computing; The Internet; Telecommunications; World Wide Web","score_opus":0.04440511736357004,"score_gpt":0.27900351948823077,"score_spread":0.2345984021246607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136799899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3211571,0.000058123445,0.6714469,0.0002310335,0.00025853404,0.00024303129,0.0000011754172,0.0004737309,0.0061303736],"genre_scores_gemma":[0.903428,0.000009686213,0.09613939,0.00004045017,0.0000064612495,0.000016922118,8.267461e-7,0.0000059031768,0.00035233903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998975,0.00002067056,0.00025468384,0.0002984946,0.00016258855,0.00028857516],"domain_scores_gemma":[0.9992536,0.000075625474,0.00009191975,0.00047142903,0.000060468377,0.000046996334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028850124,0.000114858085,0.00015466445,0.00025140264,0.000022974336,0.00003060856,0.0010873937,0.00010940325,0.00001882573],"category_scores_gemma":[0.00007369897,0.00010315253,0.000031299583,0.00092632504,0.000045180703,0.00036521847,0.00035239942,0.00013057113,0.000014769991],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075080556,0.0013263816,0.24628325,0.00006686653,0.000078838784,0.00016741196,0.011725061,0.0074364813,0.015670503,0.35312644,0.020148972,0.34389472],"study_design_scores_gemma":[0.00037401135,0.00017543181,0.58004695,0.00019950485,0.000004656924,0.000007047249,0.00020170539,0.34763965,0.06887774,0.0018184987,0.0001953516,0.00045942995],"about_ca_topic_score_codex":0.000112590504,"about_ca_topic_score_gemma":0.00021131856,"teacher_disagreement_score":0.5822709,"about_ca_system_score_codex":0.000032638305,"about_ca_system_score_gemma":0.000012281078,"threshold_uncertainty_score":0.4206438},"labels":[],"label_agreement":null},{"id":"W2137347515","doi":"10.1109/srds.2006.46","title":"Topology Sensitive Replica Selection","year":2006,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Reliable Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Replica; Computer science; Node (physics); Distributed computing; Replicate; Network topology; Reliability (semiconductor); Peer-to-peer; Computer network; Topology (electrical circuits); Selection (genetic algorithm); Engineering; Mathematics","score_opus":0.007874852410155642,"score_gpt":0.21892325307057015,"score_spread":0.2110484006604145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137347515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6105461,0.0004618056,0.12304554,0.049364343,0.0063836058,0.0072690127,0.00032272152,0.023541724,0.17906515],"genre_scores_gemma":[0.99143827,0.000022437793,0.0039148624,0.0004369311,0.001043526,0.0006243313,0.00006307943,0.000095312345,0.00236126],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99334174,0.00001548399,0.0012185416,0.0023837232,0.001188152,0.0018523809],"domain_scores_gemma":[0.9961172,0.0001011961,0.0007471108,0.0005059792,0.0021590688,0.00036947717],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011686134,0.0008873025,0.0009951566,0.0008432274,0.00077847904,0.0014926571,0.0020946225,0.0007397649,0.000004545005],"category_scores_gemma":[0.00024522017,0.00088563137,0.00020958298,0.004237132,0.00016719729,0.0011765927,0.00071788806,0.0008714061,0.00031212054],"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.00011964647,0.00027905434,0.0058973837,0.00022659288,0.00008909799,0.00002430816,0.0002483632,0.0023051742,0.103422344,0.42662883,0.46057004,0.00018914256],"study_design_scores_gemma":[0.002950456,0.0038391098,0.005023574,0.0014474324,0.00020830939,0.0023552165,0.0026068033,0.1814844,0.29280978,0.01060705,0.49164742,0.005020436],"about_ca_topic_score_codex":0.00051899994,"about_ca_topic_score_gemma":0.0000040371483,"teacher_disagreement_score":0.4160218,"about_ca_system_score_codex":0.001053768,"about_ca_system_score_gemma":0.000107489,"threshold_uncertainty_score":0.9995439},"labels":[],"label_agreement":null},{"id":"W2138515236","doi":"10.1109/infcom.2009.5061996","title":"apt-p2p: A Peer-to-Peer Distribution System for Software Package Releases and Updates","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; Computer science; Upload; File sharing; Software; Peer-to-peer; The Internet; Software development; World Wide Web; Software engineering; Distributed computing; Operating system","score_opus":0.011811013597927453,"score_gpt":0.2451681269181284,"score_spread":0.23335711332020093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138515236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023309687,0.00012786257,0.9394535,0.032866042,0.00024382999,0.0007218754,0.00013492201,0.0029091572,0.00023312458],"genre_scores_gemma":[0.79842603,0.000003772313,0.19867334,0.0009342521,0.000082303406,0.00008838008,0.000083180224,0.000012647315,0.0016960744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997757,0.0000285599,0.00030627084,0.00072563963,0.00057653897,0.00060595246],"domain_scores_gemma":[0.99810636,0.00018745949,0.000075984375,0.0009042063,0.0004997003,0.00022628928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047874587,0.00026926995,0.0003100782,0.00014630487,0.00023222617,0.00045147885,0.0011847212,0.00015275534,0.000002603276],"category_scores_gemma":[0.00096649746,0.00023127346,0.0000749395,0.0006986723,0.000039496183,0.00041939013,0.00044381816,0.00012453175,0.000078342295],"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.00004608702,0.00009795966,0.000961419,0.00007361992,0.00003215473,0.000034743607,0.00023753228,0.00016926511,0.0007607603,0.1612196,0.57844895,0.25791788],"study_design_scores_gemma":[0.0031298043,0.0042472812,0.04158749,0.0007917208,0.00013072198,0.00041686516,0.0013763101,0.045135062,0.08019267,0.045778975,0.77342606,0.0037870177],"about_ca_topic_score_codex":0.000023390807,"about_ca_topic_score_gemma":0.000017691205,"teacher_disagreement_score":0.7751164,"about_ca_system_score_codex":0.00014405683,"about_ca_system_score_gemma":0.000038735467,"threshold_uncertainty_score":0.94310576},"labels":[],"label_agreement":null},{"id":"W2138951802","doi":"10.1109/glocom.1991.188719","title":"Management in multimedia cooperative applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Syntax; Notation; Representation (politics); Architecture; Set (abstract data type); Software engineering; Multimedia; Programming language; Artificial intelligence; Linguistics","score_opus":0.01966307468375212,"score_gpt":0.24685320865514532,"score_spread":0.2271901339713932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138951802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057539885,0.000069053756,0.90830356,0.006566372,0.000047558773,0.0005093613,4.955288e-7,0.0006404748,0.08328774],"genre_scores_gemma":[0.34592387,0.00003854085,0.64572865,0.0007497382,0.00001472322,0.00051309395,6.510333e-7,0.000004360207,0.0070263464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929416,0.00001044455,0.00011142619,0.00027278837,0.00011838187,0.00019282331],"domain_scores_gemma":[0.99938494,0.000030870226,0.000013161122,0.00050919765,0.000023913399,0.00003790106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006657291,0.00007178257,0.00006973591,0.00015791586,0.000036381356,0.000051672876,0.0008790594,0.000029961417,0.000048596172],"category_scores_gemma":[0.000007864584,0.00006437734,0.000011709983,0.0009234906,0.000023309192,0.00013708079,0.00041881413,0.00007009252,0.0010565083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.994705e-7,0.00008868598,0.0002017568,0.0000019136094,0.000007980738,0.00001892459,0.00031597953,0.0007836986,0.000034796583,0.17763917,0.02437366,0.7965331],"study_design_scores_gemma":[0.0005428977,0.00006429991,0.0038749743,0.00001453605,0.0000030546425,0.0000071853196,0.00018597954,0.70344573,0.0014167445,0.00587103,0.28413913,0.00043442103],"about_ca_topic_score_codex":0.0000074267778,"about_ca_topic_score_gemma":0.000036856807,"teacher_disagreement_score":0.7960987,"about_ca_system_score_codex":0.000040479088,"about_ca_system_score_gemma":0.0000020092057,"threshold_uncertainty_score":0.9997213},"labels":[],"label_agreement":null},{"id":"W2139236490","doi":"10.1109/hicss.2005.653","title":"User Motivation and Persuasion Strategy for Peer-to-Peer Communities","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Persuasion; Peer-to-peer; Computer science; Set (abstract data type); Quality (philosophy); Peer review; Internet privacy; Psychology; Knowledge management; World Wide Web; Social psychology; Political science","score_opus":0.053796616500420676,"score_gpt":0.2909180157505555,"score_spread":0.2371213992501348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139236490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29117447,0.00003850426,0.6473318,0.057095326,0.00012313337,0.0004918944,0.000006256044,0.0008614935,0.0028771127],"genre_scores_gemma":[0.7618448,0.000004650533,0.22827838,0.0014537153,0.00006458318,0.000057216526,0.00000779106,0.0000111130175,0.0082777105],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987703,0.000027691296,0.00019286387,0.00027426513,0.00038795278,0.00034693882],"domain_scores_gemma":[0.9986105,0.00021607918,0.00003839206,0.00062837644,0.00040819388,0.000098479504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045616337,0.0001661583,0.00015700703,0.00022531378,0.00021579026,0.00031492906,0.00093175116,0.00010304702,0.000015295165],"category_scores_gemma":[0.0001705521,0.00014693511,0.000033562173,0.0003537244,0.00004688333,0.0006313799,0.00057750597,0.00013267127,0.000041330786],"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.000030135827,0.00011269378,0.002673108,0.000020680456,0.000030012263,0.0000015071843,0.0049519716,0.00850765,0.0010320137,0.22975136,0.22838412,0.5245047],"study_design_scores_gemma":[0.0013248299,0.0012565827,0.025828846,0.000076998,0.000016706159,0.00002802463,0.0059859413,0.19124092,0.014955711,0.011300018,0.7468685,0.0011169359],"about_ca_topic_score_codex":0.000089215304,"about_ca_topic_score_gemma":0.00030002347,"teacher_disagreement_score":0.5233878,"about_ca_system_score_codex":0.00006197505,"about_ca_system_score_gemma":0.000026164375,"threshold_uncertainty_score":0.599184},"labels":[],"label_agreement":null},{"id":"W2139591722","doi":"10.1109/giis.2007.4404172","title":"Policy-Based Context-Aware Overlay Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Overlay; Overlay network; Context (archaeology); Computer network; Service provider; Distributed computing; Network management; Layer (electronics); Service layer; Service (business); Set (abstract data type); Quality of service; World Wide Web; The Internet; Business; Operating system","score_opus":0.011163103980716677,"score_gpt":0.2601350026755866,"score_spread":0.2489718986948699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139591722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022760886,0.000058724712,0.9723827,0.012398638,0.00035983225,0.00018566038,9.863526e-7,0.0022310913,0.010106247],"genre_scores_gemma":[0.9247361,0.0000020943091,0.06255333,0.011346662,0.00018189513,0.00000957054,0.0000017320243,0.000013454345,0.0011551603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981514,0.00002131167,0.00026256562,0.00047069576,0.0003222593,0.00077174144],"domain_scores_gemma":[0.9983353,0.00023326259,0.00006212725,0.0010754246,0.000101277394,0.00019260467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005270324,0.00020114203,0.00019731048,0.00034020995,0.000113985036,0.00014304281,0.0018391723,0.00017593571,0.00001829877],"category_scores_gemma":[0.00010152828,0.00017778874,0.00007761073,0.0014863423,0.000071774906,0.00021491482,0.00052673655,0.00022772141,0.00015192507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019394249,0.00007524778,0.002980712,0.0000048421757,0.000022719109,0.000102579506,0.00009370038,0.011746733,0.00011760634,0.37742805,0.09799689,0.5094115],"study_design_scores_gemma":[0.001536916,0.000552895,0.028761197,0.000091843925,0.0000103362645,0.00004727801,0.00015658278,0.7214965,0.015348086,0.0138352765,0.21656223,0.0016008593],"about_ca_topic_score_codex":0.00018525985,"about_ca_topic_score_gemma":0.00039399648,"teacher_disagreement_score":0.92246,"about_ca_system_score_codex":0.000118966214,"about_ca_system_score_gemma":0.00010879458,"threshold_uncertainty_score":0.7250014},"labels":[],"label_agreement":null},{"id":"W2140357883","doi":"10.1109/ptp.2002.1046322","title":"Market structures in peer computation sharing","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Peer-to-peer; Usability; Computation; Order (exchange); Workstation; Architecture; Distributed computing; Power (physics); Idle; Sharing economy; Computer security; World Wide Web; Human–computer interaction; Business; Operating system; Finance","score_opus":0.01935498580430502,"score_gpt":0.2645360873487856,"score_spread":0.24518110154448056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140357883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090737134,0.000034595883,0.83285636,0.0026759463,0.0003099001,0.00016302346,3.4116565e-7,0.00070676015,0.07251596],"genre_scores_gemma":[0.7269395,7.428479e-7,0.2713924,0.000299403,0.0000073792708,0.000005869803,4.265774e-7,0.000003979824,0.0013502936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989869,0.000026119187,0.00014827382,0.00033119431,0.00025569045,0.000251819],"domain_scores_gemma":[0.9994825,0.00005046632,0.000025480076,0.00034558258,0.00005721161,0.00003876636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035901114,0.0000941301,0.000099180455,0.00020373712,0.000036436028,0.00013938567,0.00071231474,0.000057979865,0.000041068623],"category_scores_gemma":[0.0001736904,0.00008576948,0.000018208633,0.0006600925,0.00001521475,0.00023475461,0.00027050704,0.00011558041,0.000027885426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040242494,0.000032698616,0.02667711,0.000009058864,0.000010164542,0.00004049482,0.00050102314,0.017190535,0.00022266632,0.78452426,0.07897399,0.09181395],"study_design_scores_gemma":[0.0005668122,0.0000749675,0.16216685,0.000025646164,0.0000022508102,0.00004405448,0.00014350547,0.29224968,0.0046637696,0.5144715,0.02500718,0.000583826],"about_ca_topic_score_codex":0.000025711255,"about_ca_topic_score_gemma":0.00006821854,"teacher_disagreement_score":0.6362024,"about_ca_system_score_codex":0.000050667408,"about_ca_system_score_gemma":0.00001754928,"threshold_uncertainty_score":0.34975782},"labels":[],"label_agreement":null},{"id":"W2140492224","doi":"10.1109/ccece.2007.61","title":"A Simulation Study of Data Distribution Strategies for Large-Scale Scientific Data Collaborations","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scalability; Computer science; Data science; Context (archaeology); Dissemination; Scale (ratio); Data modeling; Set (abstract data type); Data set; Database; Artificial intelligence","score_opus":0.12217211493399147,"score_gpt":0.3773724618456438,"score_spread":0.2552003469116524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140492224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07753477,0.000018256602,0.9192005,0.00035222195,0.0002489746,0.00087071536,0.0013628183,0.00033691127,0.00007486382],"genre_scores_gemma":[0.8662126,2.5264316e-7,0.13186924,0.000014344629,0.000026870564,0.000011153382,0.0017726875,0.0000042934403,0.00008853372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981601,0.000024536128,0.0003556271,0.00076986523,0.00038215556,0.00030766785],"domain_scores_gemma":[0.9949528,0.00032415456,0.00011398365,0.004096727,0.00046416448,0.000048177528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021543414,0.00010287332,0.0001417703,0.00014755613,0.00030879714,0.00049294945,0.004131724,0.000055865665,0.000002454181],"category_scores_gemma":[0.0003533846,0.00009551063,0.0000103451885,0.0020790664,0.00004840958,0.0025565333,0.0027558208,0.00005845778,0.0000057536713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014717206,0.006917023,0.008296324,0.000096777876,0.00019497352,0.000011382626,0.007737738,0.27702093,0.0030620776,0.3717924,0.22569466,0.09902854],"study_design_scores_gemma":[0.0004056809,0.00018431952,0.0030137294,0.0000061692435,0.000014214726,2.8859085e-7,0.0051648095,0.9694923,0.00021674944,0.0020447157,0.019325212,0.00013181943],"about_ca_topic_score_codex":0.0000276755,"about_ca_topic_score_gemma":0.0050799334,"teacher_disagreement_score":0.7886779,"about_ca_system_score_codex":0.000036405854,"about_ca_system_score_gemma":0.00017216736,"threshold_uncertainty_score":0.767784},"labels":[],"label_agreement":null},{"id":"W2140703689","doi":"10.1109/have.2008.4685296","title":"A scalable adaptive time synchronization protocol for Large Scale Distributed Collaborative Simulation Environment","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scalability; Computer science; Distributed computing; Synchronization (alternating current); Architecture; Peer-to-peer; Consistency (knowledge bases); Fault tolerance; Implementation; Computer network; Artificial intelligence; Software engineering; Operating system","score_opus":0.017966567201192097,"score_gpt":0.26230942641469074,"score_spread":0.24434285921349863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140703689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003198724,0.0000023237576,0.91995645,0.00066866295,0.000019976926,0.078022875,0.00007893994,0.0006034064,0.00032751606],"genre_scores_gemma":[0.1638252,8.2376346e-7,0.5677881,0.00021639878,0.00006337778,0.2659084,0.00009505813,0.00002664581,0.0020760156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985135,0.000044834367,0.0002469276,0.00049332704,0.00030752813,0.00039387232],"domain_scores_gemma":[0.9989944,0.00012540788,0.000109696164,0.00048343628,0.00020584147,0.00008121285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018181122,0.00018045276,0.00018915319,0.00009586403,0.00031768344,0.00006410915,0.0005158807,0.00011146152,0.00005285326],"category_scores_gemma":[0.000075019925,0.00016413121,0.000037589634,0.00083112036,0.00004897963,0.00050977274,0.00033091003,0.000068503046,0.0002873404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025259104,0.00090211676,0.0012012282,0.00003150393,0.00007151842,0.000010678784,0.0014833793,0.87542135,0.0010757389,0.015465288,0.09347816,0.010606433],"study_design_scores_gemma":[0.0009450438,0.00038629558,0.0004727875,0.00001621479,0.0000027395258,0.0000016056661,0.000029327392,0.9469352,0.003831962,0.00077981036,0.046378013,0.0002210018],"about_ca_topic_score_codex":0.000002650416,"about_ca_topic_score_gemma":0.0000039994893,"teacher_disagreement_score":0.35216832,"about_ca_system_score_codex":0.00027929127,"about_ca_system_score_gemma":0.00009674225,"threshold_uncertainty_score":0.66930765},"labels":[],"label_agreement":null},{"id":"W2140714688","doi":"10.1109/ccece.2007.130","title":"Designing Secure Peer-to-Peer Voice Applications in Ad Hoc Wireless Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Voice over IP; Wireless network; Peer-to-peer; Network architecture; Quality of service; Mobile ad hoc network; Wireless; Telecommunications; Network packet; The Internet; World Wide Web","score_opus":0.014817148794253564,"score_gpt":0.2665589445467807,"score_spread":0.25174179575252714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140714688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018253151,0.00021332642,0.9653823,0.009769137,0.00023974548,0.0007898183,0.0000016728969,0.0015433019,0.003807593],"genre_scores_gemma":[0.6002061,0.000010129788,0.39525232,0.0015280715,0.0001064371,0.00015994068,0.000006894246,0.000026962944,0.0027031505],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967235,0.00004258321,0.00048187736,0.0008940474,0.00079281797,0.0010652097],"domain_scores_gemma":[0.99746543,0.0004047448,0.00009160858,0.0013377885,0.0004094179,0.00029103277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017294667,0.00031849346,0.00031200598,0.0005559032,0.00019145971,0.00024954774,0.0027846422,0.00028642698,0.000008195524],"category_scores_gemma":[0.00014569516,0.00030784134,0.00006779723,0.0037441896,0.00005877196,0.00038268964,0.0010309531,0.00055398204,0.00022979488],"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.000037615257,0.00030328293,0.009814907,0.000022167524,0.00004932119,0.000118021155,0.003382846,0.04524075,0.00236053,0.08529439,0.11033904,0.7430371],"study_design_scores_gemma":[0.0013300304,0.0005051789,0.04216313,0.00021722492,0.000029047173,0.000073449075,0.0024250657,0.21248712,0.017574083,0.011294251,0.7088882,0.0030132202],"about_ca_topic_score_codex":0.000047237205,"about_ca_topic_score_gemma":0.0009875091,"teacher_disagreement_score":0.7400239,"about_ca_system_score_codex":0.00020015755,"about_ca_system_score_gemma":0.000062225234,"threshold_uncertainty_score":0.99993736},"labels":[],"label_agreement":null},{"id":"W2140849952","doi":"10.1109/congress.2009.9","title":"A Framework for Continuous Compliance Monitoring of eHealth Processes","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"eHealth; Computer science; Process management; Legislation; Quality (philosophy); Compliance (psychology); Event (particle physics); Remote patient monitoring; Health care; Continuous monitoring; Risk analysis (engineering); Business; Operations management; Engineering; Medicine","score_opus":0.06285478211918237,"score_gpt":0.34613340737073295,"score_spread":0.28327862525155056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140849952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016546851,0.0003562492,0.97465205,0.0064258203,0.00022895585,0.00035621526,0.0000016373639,0.0007405039,0.00069174124],"genre_scores_gemma":[0.50129545,0.000011646311,0.49833238,0.00022177768,0.00004381776,0.000018688403,1.232269e-7,0.0000028371846,0.00007327719],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998927,0.0000073556403,0.00022532625,0.00030745153,0.00018329972,0.00034954332],"domain_scores_gemma":[0.9988217,0.00023326327,0.000102051985,0.00053361553,0.00024614058,0.000063256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015217795,0.00011212642,0.00023233827,0.000082379214,0.00006737465,0.000057403697,0.0012292947,0.00007978301,7.920728e-7],"category_scores_gemma":[0.0004198135,0.00010036896,0.00003139858,0.0007449746,0.000026531668,0.00017943927,0.000088028915,0.00010429715,0.0000068062973],"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.000024984633,0.00016212466,0.006976738,0.00021234764,0.000014583978,0.0000041508074,0.00064191467,0.00031802367,0.00076582405,0.47697398,0.004261633,0.5096437],"study_design_scores_gemma":[0.0006059342,0.002079683,0.03256619,0.0012521123,0.000009816894,0.000017029584,0.0003089628,0.0055309846,0.13947113,0.80800617,0.009396594,0.00075537816],"about_ca_topic_score_codex":0.0000070663277,"about_ca_topic_score_gemma":0.0000021360024,"teacher_disagreement_score":0.5088883,"about_ca_system_score_codex":0.000026922718,"about_ca_system_score_gemma":0.00007818558,"threshold_uncertainty_score":0.40929276},"labels":[],"label_agreement":null},{"id":"W2141276288","doi":"10.1109/icdcs.2008.31","title":"Routing of XML and XPath Queries in Data Dissemination Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; XPath; Policy-based routing; Computer network; Routing table; PlanetLab; Static routing; Distributed computing; Link-state routing protocol; Streaming XML; Dynamic Source Routing; Multipath routing; XML; Scalability; Routing protocol; Database; XML database; Routing (electronic design automation); World Wide Web","score_opus":0.03180211478679495,"score_gpt":0.27392468418999166,"score_spread":0.2421225694031967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141276288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2797706,0.00019184254,0.71751666,0.0012052837,0.00007128166,0.00009373411,0.0000014709622,0.00022316512,0.0009259118],"genre_scores_gemma":[0.9199464,0.00006174328,0.07978127,0.00004104628,0.000012464336,0.0000029565754,0.000004243289,0.0000029607297,0.00014694808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923676,0.000016888587,0.00017273844,0.0002806895,0.00012435472,0.00016857192],"domain_scores_gemma":[0.9990771,0.00011342038,0.000048926064,0.000708561,0.000028031305,0.000023969611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027669896,0.000070211005,0.0001181213,0.00009618091,0.00004375406,0.000026281654,0.00094810774,0.000050855564,0.0000011648485],"category_scores_gemma":[0.0001361983,0.000062869985,0.0000065204945,0.000503603,0.0000655969,0.00048483172,0.0013799679,0.000081348284,9.966574e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011892514,0.0001139144,0.23663498,0.000022349212,0.00001635904,0.000079079626,0.0035869267,0.003004772,0.0007967745,0.108298704,0.02132354,0.6261107],"study_design_scores_gemma":[0.000108441556,0.00004301561,0.11542304,0.00006423889,0.0000014352663,0.000028555714,0.0001453924,0.8814564,0.0011326032,0.000876505,0.00055348745,0.00016691233],"about_ca_topic_score_codex":0.0000691087,"about_ca_topic_score_gemma":0.00017365086,"teacher_disagreement_score":0.8784516,"about_ca_system_score_codex":0.000012990622,"about_ca_system_score_gemma":0.000014150555,"threshold_uncertainty_score":0.25637636},"labels":[],"label_agreement":null},{"id":"W2141412611","doi":"10.5555/2157848.2157853","title":"Triangle-based obstacle-aware load balancing for massively multiplayer games","year":2011,"lang":"en","type":"article","venue":"Open MIND","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Load balancing (electrical power); Computer science; Distributed computing; Server; Obstacle; Load management; Load distribution; Massively parallel; Heavy load; Semantics (computer science); Computer network; Operating system","score_opus":0.10622683879617695,"score_gpt":0.3026874392261328,"score_spread":0.19646060042995583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141412611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09784201,0.000103563536,0.8901181,0.0023570156,0.0007213812,0.0020972476,0.00005778533,0.0001198788,0.006582978],"genre_scores_gemma":[0.49887395,5.0379526e-7,0.4996336,0.00021730375,0.000030281393,0.00013343121,0.0000035793655,0.000013903213,0.0010934217],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823177,0.000036855938,0.0002879646,0.0006710726,0.00025986944,0.00051246234],"domain_scores_gemma":[0.99839497,0.0002208804,0.00014281606,0.000930565,0.00018599343,0.00012478561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051479775,0.00021264765,0.00030758814,0.00012538763,0.00013529813,0.00033411107,0.0032081942,0.00013206061,0.00014217387],"category_scores_gemma":[0.00030734474,0.00019368254,0.00009062716,0.0004160905,0.00004591248,0.000528656,0.0008665874,0.0001278999,0.00036076806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013272153,0.00012599681,0.0014529447,0.000009922332,0.00003879122,0.00006609168,0.001700819,0.00018451906,0.0014891486,0.00035946126,0.010468338,0.98397124],"study_design_scores_gemma":[0.008535789,0.0012957813,0.009802811,0.00040138885,0.00006452908,0.00003337075,0.00084157725,0.15747923,0.40099868,0.002842052,0.41566736,0.0020374577],"about_ca_topic_score_codex":0.00006840868,"about_ca_topic_score_gemma":0.00012910721,"teacher_disagreement_score":0.9819338,"about_ca_system_score_codex":0.00012303467,"about_ca_system_score_gemma":0.0002592449,"threshold_uncertainty_score":0.7898145},"labels":[],"label_agreement":null},{"id":"W2141425813","doi":"10.1109/hpdc.2005.1520983","title":"DHT overlay schemes for scalable p-range resource discovery","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre de Santé et de Services Sociaux Cavendish","funders":"","keywords":"Distributed hash table; Computer science; Scalability; Distributed computing; Replication (statistics); Node (physics); Hash function; Tree (set theory); Computer network; Hash table; Overlay network; Grid; Resource (disambiguation); Theoretical computer science; Peer-to-peer; Database; World Wide Web; Mathematics; Computer security; The Internet","score_opus":0.014956403295609082,"score_gpt":0.248363607553966,"score_spread":0.23340720425835693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141425813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01744765,0.00035480125,0.94016105,0.02311292,0.0001564608,0.0003957795,0.0000064501,0.0015906456,0.016774256],"genre_scores_gemma":[0.2670097,0.00001187083,0.68780106,0.003952958,0.00029118455,0.00012925713,0.0000033564918,0.000023995452,0.04077657],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984416,0.000013657483,0.00020528854,0.0005208175,0.00027764987,0.0005410028],"domain_scores_gemma":[0.99867517,0.00015662888,0.000048070757,0.0009834534,0.000052530242,0.00008415892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736046,0.00017259977,0.00018905268,0.00013719768,0.00013043804,0.0003355983,0.0016024588,0.000102377424,0.00001656893],"category_scores_gemma":[0.00010722221,0.00014652663,0.00008782433,0.0005242677,0.000050031183,0.0010366386,0.0007229638,0.00011285564,0.00017497691],"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.00001507544,0.000078557816,0.0006584749,0.000013333136,0.000021555728,0.0000033292724,0.000108789915,0.000615027,0.00082901213,0.17311685,0.57549894,0.24904108],"study_design_scores_gemma":[0.00027884304,0.00008145373,0.00037575667,0.000018506178,0.0000036225888,0.000005290969,0.000022863163,0.02875002,0.014480093,0.0023322976,0.9533909,0.00026033042],"about_ca_topic_score_codex":0.000012739857,"about_ca_topic_score_gemma":0.00004593164,"teacher_disagreement_score":0.37789202,"about_ca_system_score_codex":0.000080170634,"about_ca_system_score_gemma":0.00003543923,"threshold_uncertainty_score":0.5975182},"labels":[],"label_agreement":null},{"id":"W2141643443","doi":"10.1109/icdcs.2008.57","title":"Crystal: An Emulation Framework for Practical Peer-to-Peer Multimedia Streaming Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Troubleshooting; Computer science; Emulation; Server; Peer-to-peer; Software deployment; Real Time Streaming Protocol; Multimedia; Construct (python library); Distributed computing; The Internet; Computer network; Operating system","score_opus":0.06338150051736992,"score_gpt":0.3392275590357428,"score_spread":0.2758460585183729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141643443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037778646,0.000019249284,0.94121796,0.016452232,0.0010040945,0.0010256491,0.000009585444,0.0020004448,0.000492149],"genre_scores_gemma":[0.44415155,9.534469e-7,0.5539498,0.00032086406,0.00021590442,0.00012137671,0.000010335977,0.000021434429,0.0012078133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968025,0.00007107356,0.0004465868,0.0008544393,0.0011016482,0.0007237243],"domain_scores_gemma":[0.9964676,0.0009289782,0.00012603762,0.0013088248,0.0008087779,0.00035982055],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074140483,0.0002885795,0.000336937,0.00031313565,0.00030722242,0.00033985497,0.0011940799,0.0003368802,0.00000885903],"category_scores_gemma":[0.0033873552,0.00026642677,0.000078545025,0.0008807255,0.00006166509,0.0010587188,0.0004621999,0.000326417,0.00012970659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012996107,0.0008010848,0.0062511517,0.000083408275,0.00014209206,0.00022166711,0.008288389,0.04812908,0.00286607,0.6426576,0.18857816,0.10185136],"study_design_scores_gemma":[0.00043454868,0.00063427986,0.005551244,0.000075554715,0.000015056705,0.00014943181,0.0005266028,0.92549753,0.0013011246,0.008960281,0.056099765,0.0007546079],"about_ca_topic_score_codex":0.000094061375,"about_ca_topic_score_gemma":0.00003439888,"teacher_disagreement_score":0.8773684,"about_ca_system_score_codex":0.00014381843,"about_ca_system_score_gemma":0.0001380852,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W2141767282","doi":"10.1109/imtc.2006.328680","title":"Scalability Measurement of a Proxy based Personalized Multimedia Repurposing System","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Repurposing; Scalability; Computer science; Java; Distributed computing; Multimedia; Proxy (statistics); Computer network; Database; Operating system; Machine learning","score_opus":0.017547878208300387,"score_gpt":0.22334301161697864,"score_spread":0.20579513340867825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141767282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051881727,0.00018149111,0.93990207,0.0015461415,0.00020790682,0.00084776786,0.00000237449,0.001772764,0.0036577522],"genre_scores_gemma":[0.64505684,1.0448169e-7,0.354767,0.000036427216,0.000017580873,0.00004824843,5.6943065e-7,0.000005359737,0.000067863424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772626,0.00009473188,0.0004212765,0.0005122847,0.00091108313,0.0003343427],"domain_scores_gemma":[0.9983099,0.00008014861,0.00012841256,0.0010023,0.00041588597,0.00006331644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012925656,0.00016291748,0.0002826,0.00015159124,0.00006742828,0.000065332104,0.0009465952,0.00008471296,0.0000055149067],"category_scores_gemma":[0.00018701707,0.0001359842,0.0000939286,0.0007011758,0.000099195786,0.00014382799,0.00024424645,0.000092368115,0.000015777556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029637024,0.0028447704,0.12578674,0.0022766346,0.00023343353,0.00013987404,0.0014473521,0.012283777,0.27631205,0.23314586,0.036764145,0.308469],"study_design_scores_gemma":[0.0010131783,0.00015396153,0.0123436265,0.00029951197,0.000016376533,0.000009300958,0.00008685149,0.8413038,0.1410155,0.0005537448,0.0028120554,0.00039205857],"about_ca_topic_score_codex":0.00030047784,"about_ca_topic_score_gemma":0.00005317666,"teacher_disagreement_score":0.8290201,"about_ca_system_score_codex":0.00034577545,"about_ca_system_score_gemma":0.00012781192,"threshold_uncertainty_score":0.55452746},"labels":[],"label_agreement":null},{"id":"W2141964529","doi":"10.1109/icc.2011.5963110","title":"Modeling BitTorrent-Based P2P Video Streaming Systems in the Presence of NAT Devices","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"BitTorrent; Computer science; Nat; Computer network; Network address translation; Peer-to-peer; Metric (unit); The Internet; World Wide Web; Internet Protocol","score_opus":0.051999319644129974,"score_gpt":0.2527759140299458,"score_spread":0.20077659438581585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141964529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32087505,0.00041936178,0.6758191,0.00033683478,0.00025310813,0.0002945158,9.122022e-7,0.00031694054,0.0016841943],"genre_scores_gemma":[0.95669466,0.0000032579476,0.04311668,0.00010480147,0.000013830913,0.000041168678,3.1975117e-7,0.0000050900317,0.000020167585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985954,0.000083217354,0.000310693,0.0003290651,0.0003787253,0.0003029083],"domain_scores_gemma":[0.9987013,0.00020068385,0.00007287724,0.0008967323,0.000096120944,0.000032327047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063137134,0.00012902638,0.00017098499,0.00022216942,0.000048250815,0.00009101245,0.0026950252,0.00006690092,0.0000020721309],"category_scores_gemma":[0.00011668321,0.00008544675,0.00003573293,0.00081336376,0.000039050734,0.00037023306,0.00036842652,0.00013637256,0.000009586861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031122257,0.0004691958,0.035188183,0.0003024304,0.000049026752,0.00007651334,0.010191236,0.68564665,0.0019409799,0.18124989,0.00180062,0.08305416],"study_design_scores_gemma":[0.00008966357,0.000050947583,0.0006815102,0.0001383417,0.000002454736,0.0000026303255,0.00070560083,0.9957411,0.0018826645,0.0005112259,0.00007860139,0.0001152053],"about_ca_topic_score_codex":0.002286336,"about_ca_topic_score_gemma":0.000569314,"teacher_disagreement_score":0.6358196,"about_ca_system_score_codex":0.000027605023,"about_ca_system_score_gemma":0.00004760224,"threshold_uncertainty_score":0.5008072},"labels":[],"label_agreement":null},{"id":"W2142057708","doi":"10.1109/glocom.2010.5683534","title":"BFilter - A XML Message Filtering and Matching Approach in Publish/Subscribe Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Streaming XML; XML Signature; Efficient XML Interchange; XML Encryption; XML validation; XML database; XML Schema Editor; XML Schema (W3C); XML framework; SOAP; Document Structure Description; Multicast; XML; Information retrieval; Matching (statistics); Computer network; World Wide Web","score_opus":0.013002734502004034,"score_gpt":0.22096843266059024,"score_spread":0.2079656981585862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142057708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3988895,0.00007895119,0.5769384,0.0017606956,0.000735012,0.0003390224,0.0000014970296,0.0010817389,0.020175176],"genre_scores_gemma":[0.8091381,0.0000023174186,0.19003566,0.00019005692,0.000047537047,0.00006694288,0.000001159686,0.000011575244,0.00050662446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983649,0.00003489656,0.0002676127,0.00058475795,0.00026542554,0.0004823592],"domain_scores_gemma":[0.99885315,0.0000679512,0.000051673196,0.00088268775,0.000036024077,0.000108488966],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00069936557,0.00018706793,0.00023743395,0.00033791832,0.00007481452,0.0011421728,0.0014860027,0.00015020692,0.0000055247624],"category_scores_gemma":[0.000058150035,0.00015979669,0.000025723108,0.0006277694,0.00004603982,0.0012152517,0.0014282891,0.00048258304,0.000016498256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001331164,0.00024302611,0.014375588,0.0002642869,0.00005606245,0.00019161409,0.0058476026,0.0024733553,0.04935894,0.81356853,0.025032036,0.08857563],"study_design_scores_gemma":[0.0018119593,0.00019668497,0.042489864,0.00029195624,0.000014057614,0.0009227721,0.0020832254,0.88478565,0.0053614485,0.025907326,0.033492927,0.0026421265],"about_ca_topic_score_codex":0.0002646766,"about_ca_topic_score_gemma":0.00012198433,"teacher_disagreement_score":0.8823123,"about_ca_system_score_codex":0.000025678755,"about_ca_system_score_gemma":0.000020110589,"threshold_uncertainty_score":0.99989474},"labels":[],"label_agreement":null},{"id":"W2142330021","doi":"10.1109/infcom.2005.1498542","title":"Market-driven bandwidth allocation in selfish overlay networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Overlay; Overlay network; Revenue; Reinforcement learning; Bandwidth (computing); Resource allocation; Computer network; Service provider; Bandwidth allocation; Service (business); Distributed computing; Order (exchange); Game theory; The Internet; Microeconomics; Artificial intelligence; Economics","score_opus":0.008248246188653231,"score_gpt":0.2242224248745134,"score_spread":0.2159741786858602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142330021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015545494,0.0001297332,0.92524225,0.020800168,0.00030460584,0.0003183125,4.3805386e-7,0.0014407584,0.036218233],"genre_scores_gemma":[0.8075567,0.000038593316,0.18811895,0.0017992707,0.00011379764,0.00003235436,0.0000014452361,0.000009021701,0.0023298697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985682,0.000045177978,0.0002515683,0.00045029333,0.00024462698,0.00044014212],"domain_scores_gemma":[0.9989822,0.000096862816,0.000048554626,0.00074129377,0.000050933286,0.000080161975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003607026,0.00015118756,0.00016010551,0.00020817471,0.000049090042,0.00013819482,0.0013238591,0.00013333446,0.00006623498],"category_scores_gemma":[0.000052317413,0.00014349488,0.000036087575,0.0009961358,0.000025769836,0.0005455409,0.00050726923,0.00019770201,0.00010324086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009890199,0.00010605899,0.012551908,0.0000035557807,0.000014495433,0.000014918117,0.0002404933,0.112069875,0.000086349755,0.025671452,0.36735883,0.48187217],"study_design_scores_gemma":[0.00024131552,0.00004011086,0.045179226,0.00001947191,0.0000016001082,0.000007200036,0.000010834707,0.87911797,0.00023172432,0.0007316183,0.074182525,0.00023640663],"about_ca_topic_score_codex":0.000037704816,"about_ca_topic_score_gemma":0.00068703346,"teacher_disagreement_score":0.7920112,"about_ca_system_score_codex":0.00014780427,"about_ca_system_score_gemma":0.00003303444,"threshold_uncertainty_score":0.5851551},"labels":[],"label_agreement":null},{"id":"W2142935502","doi":"10.1145/2072298.2071981","title":"Risk management for video-on-demand servers leveraging demand forecast","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Server; Computer science; Provisioning; Bandwidth (computing); Computer network; Workload; Reservation; Quality of service; Bandwidth allocation; Operating system","score_opus":0.037269621282849864,"score_gpt":0.2362665485849781,"score_spread":0.19899692730212823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142935502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022104975,0.000042424537,0.9469182,0.0008572805,0.00037791423,0.0006473913,0.0000031910454,0.00093817007,0.028110484],"genre_scores_gemma":[0.5033527,0.000019814423,0.4937591,0.0010843781,0.0000326784,0.00013299375,8.821257e-7,0.000015782478,0.001601659],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998364,0.000025761072,0.00022870411,0.0006132574,0.000242277,0.00052603736],"domain_scores_gemma":[0.99872476,0.000091882976,0.000087615175,0.0009384443,0.00005508905,0.0001022274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005222514,0.00020943099,0.0001856146,0.00024072522,0.00020369585,0.00011884767,0.001552479,0.000059569647,0.000017900466],"category_scores_gemma":[0.000037302594,0.00017935222,0.00009030205,0.00039774523,0.000035567864,0.00033304616,0.00077000866,0.00011275529,0.00011369065],"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.000102190534,0.00020409044,0.0101414,0.00009821991,0.00034756362,0.00010782654,0.0022429964,0.0030205778,0.000025665562,0.37500843,0.20116118,0.40753987],"study_design_scores_gemma":[0.0042162985,0.0017728043,0.034789566,0.0002718464,0.00015515118,0.000046925412,0.00095659285,0.24878803,0.022451011,0.49422053,0.18991242,0.0024188163],"about_ca_topic_score_codex":0.000042271724,"about_ca_topic_score_gemma":0.000042420375,"teacher_disagreement_score":0.48124775,"about_ca_system_score_codex":0.0000615967,"about_ca_system_score_gemma":0.00001020751,"threshold_uncertainty_score":0.7313771},"labels":[],"label_agreement":null},{"id":"W2143107836","doi":"10.1145/1065983.1066007","title":"MOPAR","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.009805789324409137,"score_gpt":0.23160013897674173,"score_spread":0.22179434965233258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143107836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016707208,0.000058290912,0.87526506,0.039602317,0.00012984732,0.00007058548,1.6107259e-7,0.0022236274,0.06594292],"genre_scores_gemma":[0.5307234,0.000002106506,0.46395612,0.0018809323,0.000047414433,0.0000058682426,7.7868975e-8,0.0000022929084,0.0033817787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938864,0.000005304631,0.00007663147,0.00019620486,0.00012844858,0.00020475892],"domain_scores_gemma":[0.99935144,0.000018707036,0.0000111214495,0.00054990203,0.000021305845,0.000047520087],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000084677115,0.00005824293,0.000057671532,0.00006847171,0.0000325847,0.0000638646,0.0011326359,0.000032205116,0.000025939242],"category_scores_gemma":[0.00002241308,0.000048805396,0.000018115776,0.00033760816,0.000013529977,0.00022877406,0.00045349234,0.00005671307,0.0015043857],"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":[4.2989635e-7,0.000018072893,0.00021363453,5.1235946e-7,0.0000031104926,0.000004588658,0.00008274476,0.00075935194,0.00044574498,0.2646012,0.17683083,0.55703974],"study_design_scores_gemma":[0.00012083031,0.000058943155,0.0022466308,0.000004460258,0.0000010414857,0.000017245606,0.000012935001,0.07035203,0.02572911,0.011376678,0.8898314,0.0002486515],"about_ca_topic_score_codex":0.0000053264575,"about_ca_topic_score_gemma":0.000020691503,"teacher_disagreement_score":0.7130006,"about_ca_system_score_codex":0.000023594514,"about_ca_system_score_gemma":0.000010777346,"threshold_uncertainty_score":0.99927306},"labels":[],"label_agreement":null},{"id":"W2143275156","doi":"10.1109/aiccsa.2008.4493679","title":"A heterogeneous network architecture based Gnutella for mobile emergency preparedness applications","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Mobile ad hoc network; Node (physics); Wireless ad hoc network; Mobile computing; Network architecture; Architecture; Mobile device; Distributed computing; World Wide Web; Telecommunications; Engineering; Wireless","score_opus":0.018220575130155514,"score_gpt":0.25717689059370047,"score_spread":0.23895631546354495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143275156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008749699,0.0003487443,0.98547316,0.0006612366,0.000287513,0.0018057814,0.0000110657065,0.0017133689,0.00094942935],"genre_scores_gemma":[0.38927546,0.000026640653,0.60375005,0.00057468534,0.00024989684,0.0050074332,0.0000148932,0.000027722203,0.0010732053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981518,0.000026224718,0.00030436626,0.00068854715,0.00023723616,0.0005918619],"domain_scores_gemma":[0.9981304,0.00011098683,0.0000783807,0.0014064795,0.00013370562,0.00014008308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013328913,0.0002240387,0.00021887857,0.00011807513,0.00034996495,0.000036822003,0.0018460628,0.00011980952,0.000032789605],"category_scores_gemma":[0.000023393282,0.00020397473,0.00014122616,0.0010064768,0.000055843386,0.00007782942,0.00038311374,0.00011071052,0.00005323144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000259577,0.00020794079,0.00052071584,0.000030352952,0.000048659862,0.000016462378,0.00052112923,0.7342733,0.0003483314,0.0066874297,0.12193394,0.1353858],"study_design_scores_gemma":[0.00056149106,0.00059372967,0.0001848249,0.000019443156,0.000018451154,0.00015739567,0.00002213034,0.25037208,0.0050942646,0.025397098,0.71656406,0.0010150677],"about_ca_topic_score_codex":0.000009330573,"about_ca_topic_score_gemma":0.00005258269,"teacher_disagreement_score":0.59463006,"about_ca_system_score_codex":0.000049686318,"about_ca_system_score_gemma":0.00008922507,"threshold_uncertainty_score":0.83178484},"labels":[],"label_agreement":null},{"id":"W2143483230","doi":"10.1109/icdcsw.2002.1030850","title":"U-P2P: a peer-to-peer system for description and discovery of resource-sharing communities","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; XML; Schema (genetic algorithms); Shared resource; Peer-to-peer; World Wide Web; Resource (disambiguation); Publication; Information retrieval; Computer network","score_opus":0.05681637647587048,"score_gpt":0.24408126638302868,"score_spread":0.1872648899071582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143483230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30754983,0.0001517165,0.6790849,0.0062358375,0.00020299426,0.0005472503,0.000016769573,0.00083727564,0.0053734314],"genre_scores_gemma":[0.91107994,0.000003722729,0.08002996,0.00021293768,0.000035168458,0.00008307827,0.0000034021486,0.000014697954,0.008537087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985188,0.000035910845,0.000322629,0.00031666824,0.00044060606,0.00036535604],"domain_scores_gemma":[0.99840456,0.00018660437,0.00008486767,0.0010017111,0.0002447486,0.00007749793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006155576,0.00017713303,0.00028260716,0.00031167243,0.00017403395,0.0004070166,0.0013974153,0.00009501929,0.0000027362332],"category_scores_gemma":[0.00013997308,0.00015958141,0.000058815483,0.00045336934,0.000071183415,0.00065749645,0.0012357763,0.00012857947,0.000012915687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103256396,0.00033705606,0.008697713,0.00092059205,0.00019925328,0.000019334831,0.033974163,0.0039090277,0.0073821484,0.59806347,0.23355281,0.11284119],"study_design_scores_gemma":[0.0021074146,0.0019685256,0.0042763473,0.0014352681,0.00007695764,0.0001704805,0.031992935,0.7580134,0.026525749,0.007413004,0.16414756,0.0018723536],"about_ca_topic_score_codex":0.000180847,"about_ca_topic_score_gemma":0.00012489517,"teacher_disagreement_score":0.7541044,"about_ca_system_score_codex":0.000086604654,"about_ca_system_score_gemma":0.000007014412,"threshold_uncertainty_score":0.6507541},"labels":[],"label_agreement":null},{"id":"W2143797026","doi":"10.1145/1099384.1099394","title":"Optimal peer selection for minimum-delay peer-to-peer streaming with rateless codes","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Upload; Linear network coding; Computer network; Latency (audio); Scheme (mathematics); Live streaming; Bandwidth (computing); Selection (genetic algorithm); Distributed computing; Coding (social sciences); Telecommunications","score_opus":0.016460001670335053,"score_gpt":0.2667493955411988,"score_spread":0.25028939387086374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143797026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22601879,0.000015969794,0.7349996,0.03477619,0.0001830629,0.00065820833,0.000010246413,0.0014647148,0.0018732487],"genre_scores_gemma":[0.46203065,8.669841e-7,0.5133449,0.000623299,0.0001796939,0.00015659726,0.000009390493,0.000028698236,0.023625921],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645203,0.00003557588,0.0003802048,0.000984176,0.0011943252,0.0009537065],"domain_scores_gemma":[0.99708265,0.00020503327,0.00010565831,0.00076358736,0.0016019611,0.000241122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085622305,0.0004021894,0.00038611316,0.00040488198,0.00029748894,0.00052430626,0.001581062,0.00020119581,0.000026998103],"category_scores_gemma":[0.0002730434,0.00033181376,0.00008594526,0.0013085697,0.00006553568,0.0007877089,0.00043452522,0.00026599495,0.00015059092],"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.00027277792,0.00036216708,0.0021805286,0.000034985544,0.0001993792,0.000026210731,0.0025163477,0.22028747,0.0064077433,0.025889678,0.4420444,0.2997783],"study_design_scores_gemma":[0.0014481763,0.0016178535,0.0009943135,0.00006648194,0.00004205527,0.00016225295,0.0006336797,0.51578987,0.10526215,0.00033991566,0.3723122,0.0013310439],"about_ca_topic_score_codex":0.00006133379,"about_ca_topic_score_gemma":0.00067138846,"teacher_disagreement_score":0.29844728,"about_ca_system_score_codex":0.00022028478,"about_ca_system_score_gemma":0.00013304914,"threshold_uncertainty_score":0.9999134},"labels":[],"label_agreement":null},{"id":"W2144428086","doi":"10.1145/1141277.1141451","title":"Grid resource discovery based on semantic P2P communities","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Semantic grid; Grid; Variety (cybernetics); Resource (disambiguation); Distributed computing; Shared resource; Grid computing; Resource management (computing); Data science; Semantic Web; World Wide Web; Database; Computer network; Artificial intelligence","score_opus":0.011569926243683627,"score_gpt":0.21216832020109144,"score_spread":0.2005983939574078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144428086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12430882,0.00005784095,0.76939744,0.018257722,0.000374224,0.0002623181,0.000007491759,0.0029456979,0.08438847],"genre_scores_gemma":[0.96217185,9.328672e-7,0.031653516,0.00232189,0.0000878327,0.00001871502,0.000009978707,0.0000122384645,0.0037230481],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875045,0.00007117543,0.00018910508,0.00025211976,0.00035643048,0.00038073745],"domain_scores_gemma":[0.99806184,0.000303969,0.00004468873,0.001520669,0.00003133799,0.000037498186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002334756,0.0001739718,0.0001682638,0.00024163084,0.00017682966,0.00037054002,0.0019593453,0.00007068692,0.000009863363],"category_scores_gemma":[0.000024165836,0.00014545434,0.000059495324,0.0005634516,0.00009247384,0.00032383628,0.0006320181,0.00020940018,0.00012745571],"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.000028675551,0.00036946384,0.0067789797,0.000030414763,0.000017288976,0.00010590076,0.00028957054,0.08155156,0.0003278911,0.30533162,0.59031856,0.014850106],"study_design_scores_gemma":[0.0010480512,0.0008304315,0.03138917,0.00029822916,0.000016091173,0.000035375466,0.00068648777,0.6758225,0.016439576,0.02407772,0.24782808,0.0015282731],"about_ca_topic_score_codex":0.000642146,"about_ca_topic_score_gemma":0.0003802835,"teacher_disagreement_score":0.837863,"about_ca_system_score_codex":0.00005441644,"about_ca_system_score_gemma":0.000028332215,"threshold_uncertainty_score":0.5931456},"labels":[],"label_agreement":null},{"id":"W2144659039","doi":"10.1109/iwqos.2010.5542750","title":"Dynamic file-selection policies for bundling in BitTorrent-like systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Computer science; Upload; Download; BitTorrent tracker; Selection (genetic algorithm); Computer network; Distributed computing; Peer-to-peer; Operating system; Artificial intelligence","score_opus":0.010796448851620316,"score_gpt":0.26048383396037195,"score_spread":0.24968738510875163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144659039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14483514,0.00004890228,0.8470073,0.001848695,0.002989484,0.0006437744,0.000013709693,0.0016325808,0.0009804533],"genre_scores_gemma":[0.8742086,0.0000024303442,0.123695016,0.00013675168,0.00006367796,0.00021385234,0.0000062029044,0.00001163486,0.0016617941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885565,0.000012966424,0.00021684688,0.00034635328,0.00015718234,0.00041097857],"domain_scores_gemma":[0.9992305,0.00016582574,0.00005441579,0.00042124154,0.000077098826,0.000050905455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002450925,0.00012935858,0.00015472862,0.0003818832,0.000087367276,0.00021134125,0.000892943,0.00012953518,0.00001332133],"category_scores_gemma":[0.00013864,0.00011807979,0.00003896647,0.000804685,0.000026623426,0.00025920675,0.00023330026,0.00021297732,0.00003849635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003165678,0.00035221747,0.012237335,0.00018067526,0.00006344397,0.000009327023,0.0015213664,0.028992537,0.059827924,0.49228394,0.21794985,0.18654971],"study_design_scores_gemma":[0.00018646319,0.000098263765,0.0031747664,0.000032134776,0.0000019568167,0.00001893206,0.00007882307,0.9557002,0.0008246971,0.002020363,0.037612002,0.0002513663],"about_ca_topic_score_codex":0.0005406113,"about_ca_topic_score_gemma":0.0031514154,"teacher_disagreement_score":0.9267077,"about_ca_system_score_codex":0.00008137331,"about_ca_system_score_gemma":0.00004478893,"threshold_uncertainty_score":0.4815154},"labels":[],"label_agreement":null},{"id":"W2144800936","doi":"10.1109/iccs.2006.301466","title":"A User-Controlled Lightpath Provisioning System for Grid Optical Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Canarie","keywords":"Computer science; Computer network; Provisioning; Distributed computing; Scalability; Grid; Quality of service; Automatically switched optical network; Grid computing; Bandwidth (computing); Network management; Database","score_opus":0.005982562386618893,"score_gpt":0.21446667088618063,"score_spread":0.20848410849956173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144800936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056016976,0.00014057674,0.979821,0.0022422825,0.00086743623,0.0013649964,0.0000012708736,0.0027524892,0.007208215],"genre_scores_gemma":[0.654786,7.6694965e-7,0.34303895,0.0001565195,0.00043360356,0.00038088977,0.0000026913997,0.000016662269,0.0011838961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978355,0.000030952615,0.0004726533,0.0006340358,0.00031618844,0.00071067107],"domain_scores_gemma":[0.99844897,0.0003661968,0.000102714,0.00082016445,0.00015719303,0.000104784594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057119597,0.00024281508,0.0004768016,0.00017423328,0.00020745023,0.0004183853,0.00148709,0.00018009938,0.0000017198049],"category_scores_gemma":[0.00010604793,0.00018068946,0.00016309731,0.00057222886,0.000031823296,0.00029516013,0.0005534462,0.00016097446,0.00003840211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114706694,0.00009524454,0.0003300713,0.000032120453,0.000037376565,0.00004079916,0.000026872089,0.03947767,0.00030768703,0.88535064,0.050867006,0.023319831],"study_design_scores_gemma":[0.0026290405,0.00028255882,0.00037476484,0.00009149623,0.000018529237,0.000032032305,0.000032515873,0.9829225,0.0017613223,0.0014321712,0.010031362,0.0003917267],"about_ca_topic_score_codex":0.000029122988,"about_ca_topic_score_gemma":0.000034887144,"teacher_disagreement_score":0.9434448,"about_ca_system_score_codex":0.00012502972,"about_ca_system_score_gemma":0.000055880795,"threshold_uncertainty_score":0.7368302},"labels":[],"label_agreement":null},{"id":"W2145379941","doi":"10.1109/pccc.2012.6407748","title":"A system analysis of reputation-base defences against pollution attacks in P2P streaming","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reputation; Computer science; The Internet; Computer security; Limiting; Reputation system; Order (exchange); Quality (philosophy); Internet privacy; Computer network; World Wide Web; Business","score_opus":0.017989708437110834,"score_gpt":0.26181292427161573,"score_spread":0.2438232158345049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145379941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6829274,0.000108178036,0.3147734,0.00039188328,0.00012062658,0.000101150436,0.0000027915971,0.0003275133,0.0012470015],"genre_scores_gemma":[0.9523957,0.00000316312,0.047466632,0.00006156927,0.000014421622,0.000015441981,0.0000037041614,0.000003103731,0.000036309888],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987476,0.000059786475,0.0003465379,0.00026133144,0.00027743005,0.0003073424],"domain_scores_gemma":[0.99908954,0.00010966878,0.00013809888,0.00052999647,0.000070048474,0.00006266909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004892038,0.0001037251,0.00024628927,0.0009243254,0.00004313344,0.000042199463,0.0005886713,0.00006909175,0.0000023044324],"category_scores_gemma":[0.00011289528,0.000091085036,0.00007610551,0.004000058,0.000032430125,0.00045537233,0.00020089369,0.0000668512,0.000011116005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008505532,0.00019579567,0.57236326,0.000065970125,0.00036766854,0.000020678717,0.003286581,0.18303059,0.0016796956,0.08708327,0.00046448538,0.15143351],"study_design_scores_gemma":[0.00018002033,0.00005397707,0.23888065,0.00010926227,0.00010130765,0.0000030337424,0.002624192,0.752849,0.004670658,0.0001350472,0.000084979285,0.0003078809],"about_ca_topic_score_codex":0.0003003425,"about_ca_topic_score_gemma":0.00039555866,"teacher_disagreement_score":0.5698184,"about_ca_system_score_codex":0.00014339769,"about_ca_system_score_gemma":0.00003143537,"threshold_uncertainty_score":0.371434},"labels":[],"label_agreement":null},{"id":"W2146311503","doi":"10.1109/ccnc.2009.4784859","title":"A Novel Optimistic Unchoking Algorithm for BitTorrent","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"BitTorrent; Computer science; Upload; Download; BitTorrent tracker; Bandwidth (computing); Free riding; Computer network; Peer-to-peer; File sharing; Distributed computing; The Internet; World Wide Web; Artificial intelligence","score_opus":0.025042222716527375,"score_gpt":0.2707939639110136,"score_spread":0.24575174119448626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146311503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013399593,0.00004954565,0.99140716,0.005016894,0.00037648247,0.00027366995,0.0000028068553,0.0012114833,0.0015279473],"genre_scores_gemma":[0.04072603,0.000002168437,0.9570901,0.0013535076,0.000090041125,0.000033137007,0.0000014906237,0.0000057919965,0.0006977664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988106,0.000004303876,0.00016906674,0.00040686625,0.00020348735,0.00040568336],"domain_scores_gemma":[0.99913335,0.0000831535,0.000039064416,0.0005749278,0.00008429936,0.00008519753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001690857,0.0001396537,0.0001458331,0.00013879995,0.000090390655,0.00015730297,0.0012155384,0.000064821594,0.0000032661483],"category_scores_gemma":[0.00007975871,0.00012189927,0.000057889007,0.0004881263,0.000016539632,0.00017424749,0.0002184392,0.00008527875,0.000026240028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.90712e-7,0.000053569736,0.0000028673326,0.0000013973372,0.000005221185,0.0000026681155,0.000040846266,0.0011952313,0.0006725567,0.037446186,0.009942162,0.9506364],"study_design_scores_gemma":[0.00034414825,0.0002812259,0.0003283033,0.000021650778,0.0000049366545,0.000020224976,0.000012427341,0.9618341,0.0026338992,0.009700301,0.02453597,0.00028282407],"about_ca_topic_score_codex":0.0000067213114,"about_ca_topic_score_gemma":0.0000026541593,"teacher_disagreement_score":0.9606389,"about_ca_system_score_codex":0.00006906224,"about_ca_system_score_gemma":0.000033891294,"threshold_uncertainty_score":0.4970908},"labels":[],"label_agreement":null},{"id":"W2146322516","doi":"10.1109/icme.2007.4284579","title":"On the Efficiency of Peer-to-Peer File Sharing","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; File sharing; Upload; Peer-to-peer; Download; Bandwidth (computing); Computer network; Self-certifying File System; Load sharing; Distributed computing; File system; World Wide Web; Operating system; The Internet","score_opus":0.021214979958050554,"score_gpt":0.2634462877363343,"score_spread":0.24223130777828372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146322516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16448109,0.000013844452,0.7134792,0.028703399,0.00040708217,0.00039990435,0.000011421448,0.00093322305,0.091570795],"genre_scores_gemma":[0.9186255,3.393841e-7,0.06582718,0.0022159272,0.000040952407,0.00001872878,0.0000016595901,0.0000113424985,0.01325842],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99771017,0.00001328217,0.00028807376,0.00048045488,0.0009689776,0.00053902715],"domain_scores_gemma":[0.9974794,0.0006288794,0.000064797045,0.0014324555,0.00029118828,0.00010331877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016087274,0.00016142253,0.00016565286,0.00026588974,0.00012233987,0.00010267581,0.0034406718,0.000081046506,0.0003271375],"category_scores_gemma":[0.0013071689,0.00010606582,0.000065667344,0.0015145241,0.000059340975,0.00011611262,0.0013171224,0.00021467046,0.0005194846],"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.000009702296,0.00010204561,0.00031542525,0.0000045599095,0.000012162684,0.00001573457,0.0008138675,0.0012571377,0.0014592113,0.45075992,0.50789565,0.037354574],"study_design_scores_gemma":[0.0008532822,0.002286158,0.03585214,0.0003409572,0.000019366324,0.000052832373,0.0011502515,0.08981908,0.41407967,0.08453947,0.3688936,0.0021132035],"about_ca_topic_score_codex":0.00005092121,"about_ca_topic_score_gemma":0.000043456384,"teacher_disagreement_score":0.7541444,"about_ca_system_score_codex":0.00005399632,"about_ca_system_score_gemma":0.000026113168,"threshold_uncertainty_score":0.66770965},"labels":[],"label_agreement":null},{"id":"W2146437106","doi":"10.1109/vecims.2009.5068873","title":"An adaptive dynamic load balancing for large scale distributed and virtual simulations","year":2009,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems./Proceedings of the ... IEEE International Conference on Virtual Environments, Human-Computer Interfaces and Measurement Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Load balancing (electrical power); Distributed computing; Virtual machine; Distributed Computing Environment; Scale (ratio); Load management; Distributed algorithm; Operating system; Engineering","score_opus":0.060786281810458136,"score_gpt":0.2835923179067881,"score_spread":0.22280603609632998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146437106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8702399,0.00018112855,0.11787273,0.0018007028,0.0049059466,0.0034542398,0.0004949895,0.00020377936,0.00084658485],"genre_scores_gemma":[0.9971609,0.00013657815,0.0008664137,0.0002926109,0.00044125054,0.00021099686,0.000018401182,0.00007388307,0.00079893967],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903054,0.000100584664,0.0021381862,0.0021799707,0.004310398,0.0009654323],"domain_scores_gemma":[0.99566084,0.00009176692,0.0021141877,0.00068099913,0.0010718598,0.00038034027],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0022983006,0.0012947901,0.0012983619,0.0005687288,0.0008169634,0.0014292727,0.0046242755,0.00041019608,0.00001857353],"category_scores_gemma":[0.000072156065,0.0010379845,0.00029481732,0.00025010257,0.00055673113,0.0016293883,0.0011949558,0.00081939984,0.000010649339],"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.0007424937,0.0018181113,0.0012726816,0.00021826258,0.0014825877,0.0000018873492,0.0038306734,0.014640545,0.70126903,0.26619256,0.0025460033,0.0059851976],"study_design_scores_gemma":[0.010301166,0.018787257,0.017244484,0.01355455,0.0005838809,0.00011874991,0.010326789,0.7837689,0.1311943,0.0042037377,0.0056630764,0.004253102],"about_ca_topic_score_codex":0.000091893824,"about_ca_topic_score_gemma":0.000033792752,"teacher_disagreement_score":0.7691284,"about_ca_system_score_codex":0.0014343212,"about_ca_system_score_gemma":0.00008359113,"threshold_uncertainty_score":0.9999804},"labels":[],"label_agreement":null},{"id":"W2146681782","doi":"10.1145/2531602.2531616","title":"The effects of consistency maintenance methods on player experience and performance in networked games","year":2014,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Saskatchewan; Queen's University","funders":"","keywords":"Consistency (knowledge bases); Computer science; Lag; Compensation (psychology); Illusion; State (computer science); Space (punctuation); Distributed computing; Human–computer interaction; Artificial intelligence; Computer network; Cognitive psychology; Algorithm; Psychology; Social psychology","score_opus":0.009630603642454806,"score_gpt":0.27062879730402795,"score_spread":0.2609981936615731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146681782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6449764,0.00036187773,0.3469811,0.0014601138,0.00046985713,0.00032134945,8.094385e-8,0.00021581985,0.005213427],"genre_scores_gemma":[0.86607355,0.00014175147,0.13299197,0.00040797048,0.00001205333,0.00005995119,3.1616164e-8,0.000004654779,0.00030805083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987234,0.00015051337,0.00023372255,0.00034991404,0.000172492,0.0003699667],"domain_scores_gemma":[0.99749696,0.0015711295,0.00007792313,0.00076114375,0.000044807522,0.00004802028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008265971,0.00013916551,0.00021100293,0.0000834165,0.000100191806,0.00005780763,0.0010359491,0.000060364036,6.309392e-7],"category_scores_gemma":[0.00074663345,0.00008557614,0.000024006855,0.0005020973,0.00023170396,0.0001570782,0.00045331856,0.00014964172,0.000004090964],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023717113,0.0000227452,0.007983088,0.000030094303,0.0000062867643,0.0000028389043,0.00084063696,0.0003339034,0.0008018615,0.1106884,0.000842626,0.8784238],"study_design_scores_gemma":[0.0011185963,0.0018921673,0.33202162,0.0006922808,0.0000060829943,0.000029168483,0.00025419623,0.5470697,0.07303976,0.0129029425,0.03024254,0.0007308942],"about_ca_topic_score_codex":0.000012193801,"about_ca_topic_score_gemma":0.000017582788,"teacher_disagreement_score":0.8776929,"about_ca_system_score_codex":0.000021076872,"about_ca_system_score_gemma":0.000015570515,"threshold_uncertainty_score":0.34896937},"labels":[],"label_agreement":null},{"id":"W2146891860","doi":"10.1145/2382570.2382573","title":"The XtreemOS Resource Selection Service","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"Sixth Framework Programme","keywords":"Computer science; Scalability; RSS; Node (physics); Resource (disambiguation); Service (business); Distributed computing; Database; Set (abstract data type); Selection (genetic algorithm); Routing (electronic design automation); Data mining; Computer network; World Wide Web; Machine learning","score_opus":0.02526946131923585,"score_gpt":0.2352867514960244,"score_spread":0.21001729017678855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146891860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063770907,0.00070651196,0.9837263,0.0059740474,0.0006909951,0.00048050744,0.0000066565603,0.0007709655,0.0012669266],"genre_scores_gemma":[0.98832905,0.000024823597,0.0094314935,0.00033700225,0.00010240963,0.00015115607,4.84395e-7,0.000015826374,0.0016077686],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986585,0.00010900433,0.00022269918,0.00032440256,0.00021815494,0.00046726436],"domain_scores_gemma":[0.9986629,0.0002846834,0.000079533194,0.0007449094,0.000086291664,0.000141669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043566138,0.00018612127,0.00016322576,0.000118300355,0.0007899541,0.00022980294,0.00085321185,0.000103274215,0.0000017808635],"category_scores_gemma":[0.000019273573,0.00013717437,0.000044668155,0.00069993356,0.0000453448,0.00035876274,0.000045135665,0.00026802573,0.00008408322],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006563933,0.00023680812,0.00026678934,0.00003141579,0.00022420876,0.0000036411216,0.0032456254,0.022316223,0.00095728657,0.066516496,0.0033106992,0.9028252],"study_design_scores_gemma":[0.00054878235,0.00067714695,0.0046461807,0.00012990853,0.000048081805,0.00026662808,0.0026992534,0.115507886,0.0024043529,0.0010395958,0.8712156,0.0008165844],"about_ca_topic_score_codex":0.00024236251,"about_ca_topic_score_gemma":0.00013079181,"teacher_disagreement_score":0.98195195,"about_ca_system_score_codex":0.00012748544,"about_ca_system_score_gemma":0.000036446123,"threshold_uncertainty_score":0.60757685},"labels":[],"label_agreement":null},{"id":"W2147263224","doi":"10.1093/comjnl/bxu056","title":"A Resilient P2P Architecture for Mobile Resource Sharing","year":2014,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Delegate; Computer network; Overhead (engineering); Context (archaeology); Protocol (science); Network topology","score_opus":0.01251236382127508,"score_gpt":0.24111155991064237,"score_spread":0.2285991960893673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147263224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025844086,0.00013577471,0.96097404,0.01139813,0.000637889,0.0003143076,8.4674565e-7,0.00034741493,0.00034748667],"genre_scores_gemma":[0.26793364,0.0000070136675,0.724106,0.0050482946,0.0023107259,0.000077130426,0.0000010220953,0.00003562382,0.00048051422],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983199,0.00010357279,0.00029833024,0.00038459426,0.00034952787,0.00054404174],"domain_scores_gemma":[0.9981859,0.000338132,0.0001445428,0.0010880505,0.00009725308,0.0001461533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014083767,0.00018734731,0.00021106623,0.00018374373,0.00050423725,0.00058104825,0.0042989375,0.00006717602,0.0000025505137],"category_scores_gemma":[0.00006413951,0.00012195741,0.00013850255,0.00036277244,0.000058699734,0.00012968724,0.0015824207,0.0005513942,0.000026783775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024460664,0.00003484435,0.00009449317,0.00000914798,0.00003755103,0.000010528584,0.0015989017,0.11890827,0.00018049532,0.016782282,0.1017752,0.7605438],"study_design_scores_gemma":[0.0004781731,0.0005929813,0.0006810391,0.00008460997,0.000009933958,0.0007180794,0.000019919637,0.38904104,0.00052350364,0.08430375,0.52326095,0.0002860343],"about_ca_topic_score_codex":0.0000015214899,"about_ca_topic_score_gemma":0.0000033171737,"teacher_disagreement_score":0.7602578,"about_ca_system_score_codex":0.000059488808,"about_ca_system_score_gemma":0.000026402115,"threshold_uncertainty_score":0.7988567},"labels":[],"label_agreement":null},{"id":"W2147458575","doi":"10.1155/2007/169854","title":"High Performance Publish/Subscribe Middleware for Mobile Wireless Networks","year":2007,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Publication; Asynchronous communication; Computer network; Middleware (distributed applications); Wireless network; Wireless; Distributed computing; Mobile computing; Telecommunications; Operating system","score_opus":0.010735933871441733,"score_gpt":0.22276145623684834,"score_spread":0.21202552236540662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147458575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17551965,0.00017847515,0.8161911,0.000082671075,0.0030946343,0.0024821737,0.000020993202,0.0014700313,0.00096032844],"genre_scores_gemma":[0.9882205,0.00001945643,0.008122233,0.00034712785,0.00029434953,0.0025429043,0.00009073242,0.000018976414,0.00034372622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970457,0.000027440617,0.0010865884,0.00034357165,0.0006189205,0.0008778086],"domain_scores_gemma":[0.9973401,0.00019481275,0.0004438237,0.0011397268,0.0006882974,0.00019325009],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017658237,0.00030943897,0.00039381263,0.0005255641,0.00032012336,0.0010758942,0.0019437171,0.00030769597,0.000003616765],"category_scores_gemma":[0.000055240613,0.00029060454,0.000091797054,0.0013890655,0.000052764124,0.005422855,0.00042861464,0.00025280172,0.0001845297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049424943,0.000056951936,0.0012845756,0.0003236127,0.000047537545,0.0000032339913,0.0021659785,0.4491894,0.00004132552,0.021347137,0.045906708,0.47958413],"study_design_scores_gemma":[0.00069195434,0.00048318988,0.0010042567,0.00015714078,0.000007093914,0.00004527867,0.0011991945,0.61350226,0.001333833,0.000044512974,0.38093594,0.0005953487],"about_ca_topic_score_codex":0.000066103064,"about_ca_topic_score_gemma":0.000011480319,"teacher_disagreement_score":0.81270087,"about_ca_system_score_codex":0.00028231053,"about_ca_system_score_gemma":0.00006977386,"threshold_uncertainty_score":0.9999611},"labels":[],"label_agreement":null},{"id":"W2147472587","doi":"10.1109/hpcc.2011.86","title":"Simulation of DDOS Attacks on P2P Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Cloud computing; Computer network; Denial-of-service attack; Server; Overlay network; The Internet; Network packet; Computer security; Distributed computing; Operating system","score_opus":0.05167832845609758,"score_gpt":0.2694912733799962,"score_spread":0.2178129449238986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147472587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022832457,0.00001588001,0.95730543,0.00027649268,0.0002289535,0.0001356142,2.695751e-7,0.0005962511,0.018608639],"genre_scores_gemma":[0.9277723,0.0000017170818,0.071489125,0.0003376045,0.000026179547,0.0000058663823,4.3031977e-7,0.000005548505,0.00036121925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913466,0.000019036626,0.00018105973,0.00025994185,0.000183278,0.00022200259],"domain_scores_gemma":[0.9989183,0.0001303139,0.00008815891,0.0007440041,0.00007340224,0.00004582703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537979,0.00009963929,0.00012510277,0.00012125538,0.000032649918,0.00001994222,0.0009530424,0.000093382594,0.000032230302],"category_scores_gemma":[0.00008415661,0.000084247,0.00003807431,0.00047867344,0.000031921685,0.00016521817,0.00033497045,0.00010057436,0.000079821344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149481375,0.00008481591,0.0025467637,0.0000033615659,0.000014911764,0.0000060759517,0.00034323832,0.759688,0.000047830363,0.08179839,0.004801586,0.15065007],"study_design_scores_gemma":[0.00010289697,0.00022237435,0.007625541,0.000015412228,0.0000020812784,5.9531914e-7,0.000009373189,0.9840438,0.002665895,0.004048592,0.0011326367,0.00013083362],"about_ca_topic_score_codex":0.000020336583,"about_ca_topic_score_gemma":0.0000107941,"teacher_disagreement_score":0.90493983,"about_ca_system_score_codex":0.000019833566,"about_ca_system_score_gemma":0.000010508399,"threshold_uncertainty_score":0.3435493},"labels":[],"label_agreement":null},{"id":"W2147558078","doi":"10.1145/1375457.1375492","title":"Analysis of bittorrent-like protocols for on-demand stored media streaming","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"","keywords":"BitTorrent; Computer science; Video on demand; Computer network; On demand; Real Time Streaming Protocol; Multimedia; World Wide Web; Peer-to-peer; The Internet","score_opus":0.04894541978049163,"score_gpt":0.29945537423974167,"score_spread":0.25050995445925006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147558078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13079654,0.00002084874,0.8588802,0.00067008217,0.00018517656,0.007940444,0.000018610364,0.00076620455,0.00072186],"genre_scores_gemma":[0.8052657,0.0000034898678,0.18819535,0.00019800912,0.000045417706,0.005783407,0.000008719507,0.00001207201,0.0004878229],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985562,0.00002227416,0.0002990434,0.0004315088,0.00038097377,0.00030997963],"domain_scores_gemma":[0.99844986,0.00031696714,0.00011992066,0.0008982572,0.00013536819,0.00007959858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002289575,0.00015001443,0.0003743935,0.0006649793,0.000088634304,0.000030084615,0.0012334635,0.000079393525,0.000008337256],"category_scores_gemma":[0.0001682557,0.00012256709,0.00015690415,0.0019564065,0.00006877874,0.00015407412,0.00027051836,0.00007250381,0.0000074507093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029590912,0.0018654448,0.15587594,0.00017612815,0.003972163,0.00009944241,0.009552429,0.041561726,0.006206375,0.10646381,0.18503098,0.48889965],"study_design_scores_gemma":[0.0031691736,0.0023195024,0.18584348,0.0002123338,0.00043502302,0.000013404028,0.00034029328,0.69652116,0.0624862,0.0037881704,0.04313187,0.0017393797],"about_ca_topic_score_codex":0.0000215875,"about_ca_topic_score_gemma":0.00008114285,"teacher_disagreement_score":0.6744692,"about_ca_system_score_codex":0.000046237514,"about_ca_system_score_gemma":0.000052154828,"threshold_uncertainty_score":0.49981403},"labels":[],"label_agreement":null},{"id":"W2147638275","doi":"10.1109/ds-rt.2008.20","title":"A Dynamic Area of Interest Management and Collaboration Model for P2P MMOGs","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Overlay network; Overlay; Distributed computing; Scheme (mathematics); Computer network; Projection (relational algebra); Minimax; Algorithm; Mathematical optimization; Operating system; The Internet","score_opus":0.05303047507790764,"score_gpt":0.2654895826311632,"score_spread":0.21245910755325553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147638275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13104635,0.000034018685,0.86578876,0.0018918507,0.000041460997,0.0002925819,0.0000032645355,0.00018959616,0.0007120963],"genre_scores_gemma":[0.6369162,0.000019869332,0.3615361,0.00009502621,0.0000011583733,0.000034183828,0.0000010834168,0.0000025966851,0.0013938152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944353,0.0000041465987,0.00013124301,0.00021590067,0.0000779708,0.00012722565],"domain_scores_gemma":[0.9995103,0.00002190403,0.000037405527,0.0003282047,0.00007641621,0.000025804815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007060703,0.00007093551,0.00009853857,0.00012636806,0.000044670247,0.000026578857,0.00041029818,0.000033983866,5.746018e-7],"category_scores_gemma":[0.0000141077535,0.00006354611,0.0000151130425,0.0003216494,0.000037854832,0.00017542843,0.00033196836,0.000025479323,0.0000018269267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005844353,0.00020642838,0.00089008606,0.00013491492,0.00009819292,0.000022133605,0.0024648025,0.036649905,0.0021256877,0.76455164,0.071096756,0.121701],"study_design_scores_gemma":[0.00018303099,0.000072253904,0.0004925524,0.000011711567,0.0000027460544,0.000003864353,0.00005359782,0.98472273,0.00053950807,0.013483526,0.00035827045,0.00007622069],"about_ca_topic_score_codex":0.0000030695885,"about_ca_topic_score_gemma":0.00013621477,"teacher_disagreement_score":0.9480728,"about_ca_system_score_codex":0.00002985537,"about_ca_system_score_gemma":0.000015304498,"threshold_uncertainty_score":0.25913352},"labels":[],"label_agreement":null},{"id":"W2147781103","doi":"10.1145/1065983.1066019","title":"Efficient operating system support for group unicast","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unicast; Computer science; Multicast; Host (biology); Computer network; Kernel (algebra); The Internet; Communication in small groups; Distributed computing; Operating system","score_opus":0.01752098187653069,"score_gpt":0.2531054496855307,"score_spread":0.23558446780900003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147781103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019235231,0.000026148471,0.96447915,0.003879197,0.00025802,0.00043817534,0.0000023115522,0.0018678566,0.009813923],"genre_scores_gemma":[0.57576394,2.0734234e-7,0.42305574,0.00034562947,0.00006607949,0.00005780796,9.588723e-7,0.00000640276,0.00070324534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986611,0.000016015718,0.00025817333,0.00042624772,0.00021649741,0.000421947],"domain_scores_gemma":[0.99895144,0.00008405273,0.000043125812,0.0007553773,0.00008043611,0.000085585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047909995,0.00013096957,0.00016201503,0.00010539434,0.00015153314,0.00018276325,0.0013971888,0.00006609294,0.0000060832076],"category_scores_gemma":[0.000050399052,0.00010871341,0.000053465785,0.00038881396,0.000021740992,0.00010758516,0.00064633903,0.000077906545,0.00017896476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031030681,0.00008020451,0.00009773549,0.000032946395,0.000016477281,0.000010879246,0.00028775516,0.05782299,0.0015661367,0.77295107,0.020658527,0.1464722],"study_design_scores_gemma":[0.00023786504,0.00014871279,0.000105384745,0.000025211855,0.0000029143316,0.000035412264,0.00013078371,0.9553421,0.0024761704,0.000030933898,0.041261632,0.00020286872],"about_ca_topic_score_codex":0.000007362154,"about_ca_topic_score_gemma":0.000021767253,"teacher_disagreement_score":0.8975191,"about_ca_system_score_codex":0.00013560746,"about_ca_system_score_gemma":0.000030925243,"threshold_uncertainty_score":0.44332042},"labels":[],"label_agreement":null},{"id":"W2148589749","doi":"10.1109/icme.2009.5202613","title":"Improving the streaming capacity in P2P VoD systems with helpers","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Bottleneck; Upload; Video on demand; Live streaming; Computer network; Peer-to-peer; Video streaming; Real Time Streaming Protocol; Distributed computing; The Internet; World Wide Web","score_opus":0.020041245812546665,"score_gpt":0.20249664007091675,"score_spread":0.1824553942583701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148589749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50769055,0.00010968197,0.4794681,0.0053678877,0.0001834301,0.00041352055,5.409694e-7,0.0010209336,0.005745335],"genre_scores_gemma":[0.9670575,0.0000013678422,0.032326177,0.00036102431,0.000026057513,0.000014647412,1.3950195e-7,0.0000041372396,0.00020892471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988323,0.000034006083,0.00015640906,0.0003395296,0.000256414,0.00038134266],"domain_scores_gemma":[0.9990469,0.00006694215,0.000050794974,0.0007513384,0.000040015762,0.00004398892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034404168,0.00013185097,0.00014009839,0.00012050131,0.000091987495,0.00023706634,0.0012951512,0.000057583267,5.738053e-7],"category_scores_gemma":[0.000048719285,0.00007689168,0.00001900666,0.00076678424,0.000041004936,0.0003004393,0.00018615158,0.000200672,0.000011667354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019458,0.00015729871,0.010803376,0.00003494814,0.000034960674,0.0001453565,0.004640797,0.029396003,0.008075786,0.20153567,0.0034169431,0.7417394],"study_design_scores_gemma":[0.0009878452,0.0011200765,0.058266558,0.0003191017,0.000012537596,0.00020433351,0.0042050024,0.9181847,0.010613686,0.0027803518,0.0021015669,0.001204212],"about_ca_topic_score_codex":0.00083506183,"about_ca_topic_score_gemma":0.00057270867,"teacher_disagreement_score":0.8887887,"about_ca_system_score_codex":0.00009646606,"about_ca_system_score_gemma":0.000034225344,"threshold_uncertainty_score":0.31355518},"labels":[],"label_agreement":null},{"id":"W2149498440","doi":"10.1109/icde.2007.369021","title":"XML Routing in Data Dissemination Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; XPath; XML; Efficient XML Interchange; Streaming XML; Information retrieval; World Wide Web; Publication; XML database","score_opus":0.026941138381785506,"score_gpt":0.31420907169442036,"score_spread":0.28726793331263484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149498440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011904065,0.000040443734,0.97896963,0.0022808209,0.0002255096,0.00010595808,4.1814576e-7,0.0006109244,0.0058622533],"genre_scores_gemma":[0.8654645,0.000003953632,0.13384971,0.00021569099,0.00005202196,0.0000021165624,0.000007832048,0.0000045490974,0.00039958998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987683,0.000013097535,0.00021789846,0.0004191021,0.00018796432,0.00039359138],"domain_scores_gemma":[0.998414,0.00021312202,0.000041201773,0.0012563944,0.00002828393,0.000047029964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013808603,0.00008807057,0.00009335098,0.00017156149,0.000044341192,0.000104614075,0.0025145207,0.00008040056,0.000003645105],"category_scores_gemma":[0.00018595041,0.00008186817,0.000010174753,0.0011298083,0.000017351167,0.0005538962,0.0019363951,0.00016058487,0.00002426447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023093453,0.00003066657,0.008975222,0.000001455105,0.000002981332,0.00003635352,0.00016167878,0.0010814684,0.0001297307,0.060718477,0.017002324,0.9118573],"study_design_scores_gemma":[0.0000746601,0.000016162514,0.035371352,0.000034303037,9.4473864e-7,0.000006751442,0.00007389998,0.95967925,0.0005890234,0.0011195808,0.0028585687,0.00017552129],"about_ca_topic_score_codex":0.000038688002,"about_ca_topic_score_gemma":0.0006302047,"teacher_disagreement_score":0.9585978,"about_ca_system_score_codex":0.00005470784,"about_ca_system_score_gemma":0.000010508356,"threshold_uncertainty_score":0.46726468},"labels":[],"label_agreement":null},{"id":"W2149508831","doi":"10.1109/imtc.2005.1604594","title":"Measurement of the Effectiveness of Application-Layer Multicasting","year":2006,"lang":"en","type":"article","venue":"2005 IEEE Instrumentationand Measurement Technology Conference Proceedings","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; IP multicast; Source-specific multicast; Protocol Independent Multicast; Xcast; Pragmatic General Multicast; Internet Group Management Protocol; Overlay multicast; Application layer; Distributed computing; Multicast address; Operating system","score_opus":0.028481798863872344,"score_gpt":0.2443093660576812,"score_spread":0.21582756719380886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149508831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68624926,0.00012334643,0.30791026,0.0021002267,0.00028869818,0.0015404907,0.0000042415763,0.00045189308,0.0013315836],"genre_scores_gemma":[0.9792129,0.00000536352,0.020316085,0.000025771757,0.000018243632,0.00039952758,5.850667e-7,0.000012313435,0.000009210911],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969516,0.000035265453,0.0006375857,0.000547633,0.0014039224,0.00042404007],"domain_scores_gemma":[0.996782,0.000037017344,0.0004854369,0.0004762393,0.0021763914,0.00004290365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019322084,0.00025452435,0.0003434966,0.00043593778,0.00015746788,0.000045872224,0.0017243415,0.00019107806,0.0000020472667],"category_scores_gemma":[0.00034840772,0.00020895411,0.00007514869,0.001360983,0.00030431274,0.00029447966,0.0003166182,0.000219204,0.0000060863936],"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.000022881544,0.00016437496,0.0438506,0.00012599508,0.000045308407,1.9656369e-7,0.00005741113,0.00012216679,0.8357187,0.10135791,0.00020207714,0.018332405],"study_design_scores_gemma":[0.0007462923,0.000092386275,0.039128575,0.00046304904,0.000028151353,0.000007773968,0.00011508576,0.0022391255,0.93846637,0.018200899,0.00029279967,0.00021951033],"about_ca_topic_score_codex":0.00006203937,"about_ca_topic_score_gemma":0.000052111365,"teacher_disagreement_score":0.29296362,"about_ca_system_score_codex":0.00035104528,"about_ca_system_score_gemma":0.00026153322,"threshold_uncertainty_score":0.8520901},"labels":[],"label_agreement":null},{"id":"W2149855662","doi":"10.1109/wiapp.2003.1210295","title":"Deconstructing the Kazaa network","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":210,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science Foundation","keywords":"Internet traffic; The Internet; Web traffic; Computer science; Traffic generation model; Quarter (Canadian coin); Computer network; World Wide Web; Geography","score_opus":0.010102058540161146,"score_gpt":0.22070887552050822,"score_spread":0.21060681698034708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149855662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039858308,0.000116285075,0.91517174,0.023508701,0.00064909953,0.00014924744,1.297828e-7,0.0014756244,0.019070834],"genre_scores_gemma":[0.5811046,0.0000030482447,0.41669455,0.0018895653,0.0001239764,0.000010561347,8.993613e-8,0.0000045646557,0.00016906246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989844,0.000015304318,0.00014499814,0.00027212253,0.00017271424,0.00041046288],"domain_scores_gemma":[0.9989729,0.00009652188,0.00003850767,0.0008079401,0.000034336877,0.000049782844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029232362,0.00010140006,0.00009257929,0.000038985007,0.00023058183,0.00018043863,0.0018692221,0.000050505347,0.000008188998],"category_scores_gemma":[0.00007037766,0.000065061286,0.000038461814,0.00080658216,0.00006628501,0.00019581703,0.000811865,0.00015937373,0.00020059118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.3275195e-7,0.00000625904,0.0012319075,7.933756e-7,0.00000974861,0.000010287526,0.00014865254,0.025536342,0.000034376866,0.7942309,0.0091864215,0.16960372],"study_design_scores_gemma":[0.00056772353,0.00014945645,0.008388063,0.000067633584,0.000008885453,0.0003671574,0.0003077848,0.013489584,0.005548644,0.89370567,0.07666996,0.0007294187],"about_ca_topic_score_codex":0.00003497741,"about_ca_topic_score_gemma":0.00009483311,"teacher_disagreement_score":0.54124624,"about_ca_system_score_codex":0.000043510125,"about_ca_system_score_gemma":0.000045069788,"threshold_uncertainty_score":0.34735107},"labels":[],"label_agreement":null},{"id":"W2149875071","doi":"10.1109/ccece.2004.1344956","title":"Pie: scalable routing in peer-to-peer networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Pastry; Distributed hash table; Computer science; Chord (peer-to-peer); Scalability; Distributed computing; Peer-to-peer; Computer network; Hash table; Routing protocol; Routing (electronic design automation); Hash function; Consistent hashing; Load balancing (electrical power); Theoretical computer science; Database; Computer security","score_opus":0.013983236329861136,"score_gpt":0.24943918473975843,"score_spread":0.23545594840989728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149875071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039861906,0.00004491773,0.8893841,0.052464426,0.00060567085,0.00038439812,7.76919e-7,0.0017476747,0.015506129],"genre_scores_gemma":[0.74483144,0.000002565942,0.24748538,0.0026671446,0.000099971745,0.00004208128,0.0000017619616,0.000019574582,0.00485008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967381,0.000032375476,0.00043082316,0.0008410769,0.0008332985,0.0011243293],"domain_scores_gemma":[0.99810666,0.00009520991,0.000061171864,0.0012323901,0.00026952746,0.00023503961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011641224,0.00028666333,0.00032094755,0.00040819964,0.00013812692,0.0003799641,0.0025549706,0.0002131854,0.00002020633],"category_scores_gemma":[0.00046414204,0.0002712759,0.000067083114,0.0029769754,0.000045336827,0.00052924576,0.0016671581,0.00046160087,0.0005416369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012174278,0.00016587206,0.007973144,0.0000063158504,0.000019657506,0.000160462,0.0009985705,0.5585839,0.0002492461,0.25562695,0.0616924,0.114511274],"study_design_scores_gemma":[0.0045002657,0.0010753593,0.065874465,0.000656996,0.000021956375,0.00019687157,0.00091007113,0.6754079,0.012438073,0.08331351,0.15126699,0.0043375427],"about_ca_topic_score_codex":0.00047423597,"about_ca_topic_score_gemma":0.0006342131,"teacher_disagreement_score":0.7049695,"about_ca_system_score_codex":0.00031733306,"about_ca_system_score_gemma":0.00009494177,"threshold_uncertainty_score":0.99997395},"labels":[],"label_agreement":null},{"id":"W2149913911","doi":"10.1145/1404880.1404888","title":"Scalable on-demand media streaming for heterogeneous clients","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"","keywords":"Computer science; Bandwidth (computing); Scalability; Protocol (science); Computer network; Atomic broadcast; Population; Generalization; Quality of service; Distributed computing; Broadcasting (networking); Mathematics","score_opus":0.0410901255752412,"score_gpt":0.29031876644837434,"score_spread":0.24922864087313315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149913911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010410092,0.00020031338,0.9829698,0.0041580303,0.00012982401,0.0011419695,0.000050137696,0.0007589279,0.00018090318],"genre_scores_gemma":[0.56255174,0.00033152036,0.4361035,0.00028824917,0.000035430327,0.0005944256,0.00002551281,0.000018784085,0.000050840157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982287,0.00006841277,0.0004241694,0.00062280765,0.00023895227,0.0004169165],"domain_scores_gemma":[0.9931783,0.0024317645,0.00012978828,0.0038688644,0.00018519977,0.00020604773],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00024770893,0.00025911996,0.00026243858,0.0003469899,0.0020282613,0.00010306722,0.0031375107,0.0001307599,0.0000027416897],"category_scores_gemma":[0.00010038986,0.00027223342,0.000101907564,0.0008409808,0.00027704373,0.0001472864,0.00024958307,0.00035590044,0.0000641145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001202414,0.00082315,0.00020438191,0.000014400601,0.000074379524,0.0000011854593,0.0013655563,0.01350988,0.00037596424,0.005239744,0.0005467378,0.9778326],"study_design_scores_gemma":[0.0019365245,0.0005070546,0.0030174474,0.00017265898,0.00007588088,0.0001128608,0.00025228274,0.89721745,0.0041545616,0.008365753,0.08303188,0.0011556711],"about_ca_topic_score_codex":0.000023307772,"about_ca_topic_score_gemma":0.000032245534,"teacher_disagreement_score":0.97667694,"about_ca_system_score_codex":0.000075253454,"about_ca_system_score_gemma":0.000056595745,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W2149988228","doi":"10.1109/jsac.2007.070112","title":"Efficient search and scheduling in P2P-based media-on-demand streaming service","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hong Kong University of Science and Technology","keywords":"Computer science; Scheduling (production processes); Exploit; Computer network; Quality of service; Asynchronous communication; Coding (social sciences); Linear network coding; Overlay network; Distributed computing; The Internet; Network packet; World Wide Web","score_opus":0.04139729300686496,"score_gpt":0.3147303436373587,"score_spread":0.27333305063049373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149988228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92436385,0.00031733405,0.063553065,0.010915219,0.00012877118,0.00021250577,0.0000023489147,0.00016301892,0.00034386784],"genre_scores_gemma":[0.91241187,0.00008578697,0.08671067,0.00072504993,0.00003591385,0.000011134132,0.0000024677638,0.000013643331,0.000003449918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997853,0.0002948515,0.0005184903,0.00030162564,0.000489152,0.0005428934],"domain_scores_gemma":[0.99574775,0.0021721371,0.00011709891,0.0014117584,0.0003671329,0.00018411709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020674488,0.00018654164,0.0002309117,0.001317503,0.0003492124,0.00019156637,0.0026462723,0.00013401898,0.0000019709196],"category_scores_gemma":[0.0005642137,0.00018165245,0.000028298204,0.0038444172,0.000078816935,0.000109108296,0.00037528857,0.0015759055,0.000013959535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009779125,0.0010524647,0.016228927,0.000016965501,0.00003039086,0.000111335,0.0035950192,0.89550894,0.00411305,0.005326175,0.00010877437,0.07381018],"study_design_scores_gemma":[0.0012143494,0.00020298552,0.108582705,0.0008272319,0.0000058294245,0.00009216373,0.00035903088,0.8831602,0.0041760653,0.0007443409,0.00026862798,0.0003664967],"about_ca_topic_score_codex":0.0000606771,"about_ca_topic_score_gemma":0.0018215732,"teacher_disagreement_score":0.092353776,"about_ca_system_score_codex":0.00035220146,"about_ca_system_score_gemma":0.00021818916,"threshold_uncertainty_score":0.74075717},"labels":[],"label_agreement":null},{"id":"W2150116125","doi":"10.1109/icdcsw.2012.40","title":"Exploring the Sustainability of Credit-incentivized Peer-to-Peer Content Distribution","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sustainability; Incentive; Computer science; Environmental economics; Download; Peer-to-peer; Microeconomics; Computer network; Economics","score_opus":0.10599799215823268,"score_gpt":0.28281122786417523,"score_spread":0.17681323570594254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150116125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3960653,0.000029729477,0.564429,0.037236363,0.00088748755,0.000513988,0.000010558504,0.0004772406,0.00035032252],"genre_scores_gemma":[0.988462,0.00000302013,0.009802696,0.00019412047,0.00012767427,0.00018767708,0.000007536566,0.000008329155,0.0012069972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9973941,0.00010340608,0.0003826646,0.00038174444,0.0009579772,0.00078012043],"domain_scores_gemma":[0.99674714,0.00026462175,0.000098274184,0.0013684956,0.0013344026,0.00018707532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021776464,0.00019796204,0.00026653765,0.00009065304,0.00016051086,0.00010479283,0.001764381,0.000059602622,0.000009281837],"category_scores_gemma":[0.0019687607,0.0001338849,0.00010905129,0.001059532,0.00012277855,0.0010118643,0.0015120602,0.0002056892,0.000048355854],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011384599,0.000712293,0.05336425,0.00007237473,0.000114269984,0.000008113527,0.0056077912,0.0005507506,0.0023578182,0.46627912,0.11294572,0.35787365],"study_design_scores_gemma":[0.0011389538,0.00047794258,0.5087399,0.0000747462,0.000047820686,0.000018732944,0.0063322275,0.0076798615,0.116315335,0.010505689,0.3475361,0.0011327197],"about_ca_topic_score_codex":0.00018454345,"about_ca_topic_score_gemma":0.000018606012,"teacher_disagreement_score":0.5923967,"about_ca_system_score_codex":0.00036733874,"about_ca_system_score_gemma":0.000065409324,"threshold_uncertainty_score":0.54596674},"labels":[],"label_agreement":null},{"id":"W2150700219","doi":"10.1109/i-span.2008.38","title":"An Expedite State Dissemination Mechanism for MMOGs","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Software deployment; Task (project management); Context (archaeology); Distributed computing; Idle; State (computer science); Routing (electronic design automation); Tree (set theory); Mechanism (biology); Computer network; Software engineering; Engineering; Operating system","score_opus":0.010915720054480249,"score_gpt":0.24516731184816146,"score_spread":0.2342515917936812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150700219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30657542,0.00021475596,0.67042935,0.01713362,0.0022258856,0.0016068278,0.000064393884,0.0006812777,0.0010684889],"genre_scores_gemma":[0.920607,0.0003300782,0.07640604,0.0010152954,0.00061910145,0.00028116629,0.000014074267,0.000043329583,0.0006839318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737495,0.000017004106,0.00048380997,0.0008004776,0.00079469004,0.0005290591],"domain_scores_gemma":[0.99838525,0.00022304292,0.0003709802,0.0003613582,0.00048720988,0.00017213925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042215368,0.0003767325,0.0003366319,0.0002468841,0.0003951194,0.00019717091,0.0027751585,0.00015672317,0.000002061948],"category_scores_gemma":[0.00011124277,0.00029198898,0.00015342284,0.00036601708,0.00017169422,0.00034102486,0.00064786285,0.00036079774,0.0000019732543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016985064,0.001497312,0.003854561,0.00019353376,0.0008338369,0.000025151827,0.015198157,0.25173756,0.050087374,0.40462866,0.056588,0.21365736],"study_design_scores_gemma":[0.0012487209,0.0011278561,0.0046193176,0.00027863358,0.000033288467,0.000233918,0.00009414481,0.88475615,0.022360023,0.07956081,0.00479091,0.0008962233],"about_ca_topic_score_codex":0.000033659595,"about_ca_topic_score_gemma":0.000015678464,"teacher_disagreement_score":0.6330186,"about_ca_system_score_codex":0.0000886436,"about_ca_system_score_gemma":0.000025903848,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W2150707331","doi":"10.1145/1016540.1016554","title":"A cheat controlled protocol for centralized online multiplayer games","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cheating; Computer science; Protocol (science); Server; Smoothness; Computer network; Distributed computing; Computer security","score_opus":0.03748673905794603,"score_gpt":0.3380119314578192,"score_spread":0.3005251923998732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150707331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015209045,0.000005205997,0.76804173,0.014356609,0.00010987021,0.21367794,0.000005961855,0.001762911,0.0005188682],"genre_scores_gemma":[0.015913837,4.1711715e-7,0.6216543,0.0012968064,0.000065656415,0.3600337,0.0000021822777,0.000013871996,0.0010192756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832577,0.000019736504,0.0003446667,0.00048628522,0.0002495913,0.00057395914],"domain_scores_gemma":[0.99882954,0.00013045523,0.00007713494,0.0007048872,0.00013822656,0.000119777156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020634905,0.0002189382,0.00040046553,0.00013314352,0.000084462205,0.00014278735,0.0012547453,0.00011440558,0.000016234055],"category_scores_gemma":[0.00026913875,0.00015795438,0.00015042997,0.00038455796,0.000039772684,0.00023686848,0.000307998,0.000108844,0.000039591374],"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.005808769,0.0050335084,0.0010822245,0.00028847432,0.000562016,0.00011711382,0.0019219809,0.026360745,0.03173289,0.54580164,0.11602749,0.26526317],"study_design_scores_gemma":[0.19255535,0.0021171295,0.0018349426,0.00031295297,0.000035046505,0.00005181594,0.00013480215,0.18661423,0.10116251,0.068002634,0.44527835,0.0019002446],"about_ca_topic_score_codex":0.000032054202,"about_ca_topic_score_gemma":0.000089778245,"teacher_disagreement_score":0.477799,"about_ca_system_score_codex":0.0000975538,"about_ca_system_score_gemma":0.000097083,"threshold_uncertainty_score":0.6441192},"labels":[],"label_agreement":null},{"id":"W2150947497","doi":"10.1109/infcom.2009.5061964","title":"Absence of Evidence as Evidence of Absence: A Simple Mechanism for Scalable P2P Search","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Computer science; Overlay; Overlay network; Theoretical computer science; Graph; Distributed computing; Bounded function; Peer-to-peer; Population; Load balancing (electrical power); Random graph; Simple (philosophy); The Internet; World Wide Web; Database; Mathematics","score_opus":0.10818343836475516,"score_gpt":0.3605220244473227,"score_spread":0.25233858608256754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150947497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11724303,0.0004898424,0.8708483,0.00925405,0.00014401576,0.0009584879,0.0000038752614,0.00049610896,0.0005622852],"genre_scores_gemma":[0.7653694,0.00014167864,0.23317522,0.0005323837,0.000021031632,0.00003426031,2.784005e-7,0.0000076942015,0.0007180507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99692756,0.000057443052,0.00059578335,0.0007632418,0.0009601008,0.00069588743],"domain_scores_gemma":[0.9960191,0.001136341,0.00019709206,0.001633134,0.00086202554,0.00015225295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013654426,0.00023823803,0.00045061845,0.00029994146,0.00010838176,0.00009063616,0.003717193,0.00015317943,0.000030702413],"category_scores_gemma":[0.0020720228,0.000192719,0.00013229648,0.0017018215,0.00014609382,0.0011308665,0.0007619831,0.00018240277,0.000055035995],"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.00008889216,0.00014689783,0.0005601875,0.00020496278,0.000023180492,0.0000144945825,0.00064474065,0.0014305942,0.24288586,0.66267204,0.007468416,0.08385972],"study_design_scores_gemma":[0.00023396955,0.002294517,0.0023192037,0.0011098968,0.00000918817,0.000024071363,0.0001483764,0.08531084,0.6341833,0.2737506,0.00019054653,0.00042551404],"about_ca_topic_score_codex":0.0002919002,"about_ca_topic_score_gemma":0.00003163912,"teacher_disagreement_score":0.64812636,"about_ca_system_score_codex":0.00007511733,"about_ca_system_score_gemma":0.00029165743,"threshold_uncertainty_score":0.7858853},"labels":[],"label_agreement":null},{"id":"W2151371818","doi":"10.1109/iri.2011.6009520","title":"Research 2.0: Research-supporting features of World Wide Web","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"World Wide Web; Microblogging; Computer science; Social media; Web standards; Web intelligence; Web 2.0; Web service; Data science; Work (physics); Web development; Engineering","score_opus":0.19097683137206856,"score_gpt":0.4056782095686975,"score_spread":0.21470137819662893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151371818","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08954257,0.00032384254,0.031693805,0.016290564,0.00038863518,0.0008556379,0.0000027957337,0.001726907,0.85917526],"genre_scores_gemma":[0.79539454,0.00000949658,0.18878318,0.00013406356,0.00003779988,0.000035728033,3.6226626e-7,0.0000125247625,0.015592288],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99597234,0.00032210117,0.00038145966,0.00062380277,0.0014843255,0.0012159849],"domain_scores_gemma":[0.99634486,0.0009007071,0.00007234152,0.0016971697,0.0008053868,0.00017951503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071453494,0.00013328766,0.00022539953,0.0017187265,0.00023887843,0.00012025399,0.0042324853,0.00010667955,0.0001213617],"category_scores_gemma":[0.0015909061,0.0001110523,0.000059027974,0.0051592956,0.0004506422,0.0003701012,0.0035668279,0.000995435,0.00028059524],"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.000018894665,0.000095468386,0.00610108,0.000020744908,0.000019527413,0.00007711491,0.0011037413,0.0000069439416,0.0028794892,0.41508532,0.5087941,0.06579755],"study_design_scores_gemma":[0.0006287008,0.0012931022,0.11779683,0.00035122852,0.0000060805946,0.000039014172,0.0025406408,0.0038906178,0.42017102,0.3148335,0.13750917,0.0009401169],"about_ca_topic_score_codex":0.0005239266,"about_ca_topic_score_gemma":0.0011920852,"teacher_disagreement_score":0.8435829,"about_ca_system_score_codex":0.000078753175,"about_ca_system_score_gemma":0.00021868892,"threshold_uncertainty_score":0.78650814},"labels":[],"label_agreement":null},{"id":"W2151825596","doi":"10.1109/infcom.2005.1498489","title":"Strategyproof mechanisms for dynamic multicast tree formation in overlay networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Computer science; Overlay multicast; Computer network; Distributed computing; Protocol Independent Multicast; Source-specific multicast; PlanetLab; Xcast; Pragmatic General Multicast; Overlay network; Distance Vector Multicast Routing Protocol; IP multicast; Reliable multicast; Tree (set theory); Node (physics); The Internet; Operating system; Engineering","score_opus":0.012891919872077245,"score_gpt":0.2563884253529842,"score_spread":0.24349650548090693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151825596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058354735,0.000036421658,0.9872668,0.004268896,0.00014170053,0.0005976077,0.0000018492248,0.0006800776,0.001171193],"genre_scores_gemma":[0.6167375,0.000003775075,0.38261524,0.00030972838,0.000018736733,0.00008766638,0.000003977903,0.0000068878435,0.00021651128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986719,0.00001786428,0.00030466588,0.00034728317,0.00017887597,0.00047944128],"domain_scores_gemma":[0.999221,0.00008728101,0.00006289475,0.00051080674,0.000055823286,0.000062171275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002789322,0.00015960341,0.00016668501,0.00021269567,0.000060632865,0.00014336995,0.00093190494,0.00013385959,0.0000054089473],"category_scores_gemma":[0.000036621426,0.00014492513,0.00005008031,0.0005265739,0.000016094935,0.00089139777,0.00024467258,0.0001325521,0.000033263866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012725522,0.00007590776,0.000011062128,0.000007906148,0.0000063707703,0.0000037908942,0.00016088219,0.10233292,0.0016987871,0.21949847,0.002192916,0.67399824],"study_design_scores_gemma":[0.00042748876,0.00011835428,0.0004948824,0.00001446377,0.0000019543597,0.000007966554,0.00004506633,0.9789816,0.0027049207,0.016180445,0.0008342222,0.00018860326],"about_ca_topic_score_codex":0.0000096171625,"about_ca_topic_score_gemma":0.0017890453,"teacher_disagreement_score":0.8766487,"about_ca_system_score_codex":0.00016766797,"about_ca_system_score_gemma":0.000017434138,"threshold_uncertainty_score":0.5909875},"labels":[],"label_agreement":null},{"id":"W2151892095","doi":"10.1109/ccece.1998.685570","title":"Multimedia courseware delivery over the Internet","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"University of Ottawa","keywords":"Computer science; Multimedia; Rendering (computer graphics); The Internet; Java; Architecture; Exploit; Systems architecture; World Wide Web; Human–computer interaction; Operating system; Artificial intelligence","score_opus":0.02076593985380833,"score_gpt":0.22504346423250005,"score_spread":0.2042775243786917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151892095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14204903,0.00093601644,0.7797857,0.035261597,0.0016007664,0.0005462809,0.0000043055143,0.0038910636,0.035925254],"genre_scores_gemma":[0.950592,0.000017544826,0.038884617,0.0029658827,0.00006247664,0.00001867911,4.2835896e-7,0.000007287103,0.007451096],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900556,0.000022738288,0.00012371158,0.00029027392,0.00025719777,0.00030050418],"domain_scores_gemma":[0.99890506,0.00013455215,0.00003052795,0.000823271,0.000047625705,0.000058958092],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011914209,0.00011809183,0.000094415656,0.00007852365,0.00005342682,0.00014153641,0.00213519,0.00006480083,0.00030048794],"category_scores_gemma":[0.000059446655,0.00007433063,0.000044517026,0.00041142025,0.00006927603,0.0002277524,0.00089209457,0.0001601801,0.0012586195],"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":[7.8994606e-7,0.000027615062,0.0009960006,8.6417754e-7,0.00001282459,0.000019151505,0.0005753804,0.00006154713,0.000036064703,0.0063214623,0.6782264,0.3137219],"study_design_scores_gemma":[0.000313145,0.0001040613,0.012264809,0.000025085408,0.000006273926,0.000029363284,0.00008187686,0.79866683,0.0016499765,0.0015302805,0.18495263,0.00037564104],"about_ca_topic_score_codex":0.00006780285,"about_ca_topic_score_gemma":0.00007042238,"teacher_disagreement_score":0.80854297,"about_ca_system_score_codex":0.000034312445,"about_ca_system_score_gemma":0.000006665626,"threshold_uncertainty_score":0.999519},"labels":[],"label_agreement":null},{"id":"W2152733626","doi":"10.1109/tcsvt.2004.825532","title":"A proxy-assisted adaptation framework for object video multicasting","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Microsoft Research","keywords":"Computer science; Multicast; Computer network; Scalability; Bandwidth (computing); Distributed computing; Exploit; Xcast; Scalable Video Coding; IP multicast; Real-time computing","score_opus":0.04338176579147289,"score_gpt":0.28601350275611404,"score_spread":0.24263173696464113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152733626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009143276,0.0003817677,0.98051244,0.004305877,0.0009452651,0.0024787039,0.00004915147,0.0021482115,0.00003530638],"genre_scores_gemma":[0.8326753,0.000015901345,0.1644327,0.00016689852,0.00008256476,0.0024770983,0.0000013185318,0.00003525109,0.00011299899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975807,0.000039536386,0.00059099286,0.000878555,0.00023677932,0.00067340967],"domain_scores_gemma":[0.99778956,0.0007769884,0.00020993529,0.00082312344,0.00029171683,0.00010869129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047070568,0.00031907376,0.00047990071,0.0009342319,0.00054437213,0.00020264547,0.00080365967,0.0005418816,9.946012e-7],"category_scores_gemma":[0.00023578713,0.0003128066,0.0001316685,0.0011193276,0.00011491801,0.00033752047,0.00001102011,0.00038907025,0.000013985333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027713044,0.00016405266,0.000017232194,0.00015057798,0.00010923507,0.0000038326107,0.0004711789,0.015073683,0.003673089,0.0622334,0.00033453433,0.9177415],"study_design_scores_gemma":[0.0018137601,0.0016263289,0.000058557765,0.00066460646,0.00009699152,0.00025356875,0.0008946767,0.9269925,0.022132363,0.015117211,0.029428974,0.000920476],"about_ca_topic_score_codex":0.000025900252,"about_ca_topic_score_gemma":0.00008695534,"teacher_disagreement_score":0.916821,"about_ca_system_score_codex":0.00017830964,"about_ca_system_score_gemma":0.00007853689,"threshold_uncertainty_score":0.9999324},"labels":[],"label_agreement":null},{"id":"W2152979493","doi":"10.1109/icdcsw.2005.116","title":"Publisher Mobility in Distributed Publish/Subscribe Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Decoupling (probability); Distributed computing; Computer network; Engineering; Business","score_opus":0.015538560459756844,"score_gpt":0.23240328063823845,"score_spread":0.2168647201784816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152979493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0747972,0.00039015984,0.8233686,0.054977603,0.0022437517,0.0010515897,0.000013852012,0.004976274,0.03818096],"genre_scores_gemma":[0.96927357,0.0000025379668,0.028281985,0.000549269,0.00007792345,0.00012677965,0.000012342726,0.000009791476,0.0016658175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976021,0.000072617106,0.00045539995,0.0007225251,0.00045915245,0.0006881744],"domain_scores_gemma":[0.99790114,0.00009605005,0.00006694277,0.0015887611,0.00018214306,0.0001649624],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00094830914,0.00020485255,0.00027644087,0.0003159705,0.00005688955,0.0014109204,0.002893555,0.00018463729,0.000021378683],"category_scores_gemma":[0.00044009576,0.0001782442,0.00005246011,0.00234289,0.000055545956,0.0031015899,0.0010969426,0.0003069197,0.00016784275],"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.0000048364827,0.00030605905,0.01419274,0.000013563143,0.000013096526,0.00001877701,0.00014228738,0.0060645635,0.000048134334,0.11205883,0.8228855,0.044251584],"study_design_scores_gemma":[0.0010188303,0.00014103715,0.0851169,0.000059152866,0.0000051414486,0.000045282446,0.0003065868,0.23789726,0.0004145509,0.011545681,0.66230714,0.0011424503],"about_ca_topic_score_codex":0.00037064878,"about_ca_topic_score_gemma":0.0006171626,"teacher_disagreement_score":0.89447635,"about_ca_system_score_codex":0.00033080424,"about_ca_system_score_gemma":0.0000748339,"threshold_uncertainty_score":0.9996257},"labels":[],"label_agreement":null},{"id":"W2153116370","doi":"10.1109/icassp.2008.4518072","title":"Distributed throughput maximization in hybrid-forwarding P2P VoD applications","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Scalability; Network packet; Redundancy (engineering); Throughput; Packet forwarding; Coding (social sciences); Distributed computing; Operating system; Wireless","score_opus":0.03929896657977401,"score_gpt":0.2718730114178448,"score_spread":0.23257404483807081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153116370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11871169,0.00004559779,0.87283975,0.003424919,0.00021080684,0.00043911734,0.000026787546,0.00022543826,0.0040759],"genre_scores_gemma":[0.9667286,0.000086551816,0.03268111,0.0002017795,0.00010606818,0.000047962116,0.000004837238,0.000013495284,0.00012955561],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981244,0.0000073389338,0.00044555508,0.0005063241,0.000618315,0.00029801723],"domain_scores_gemma":[0.99852103,0.000054211832,0.00033701793,0.0001544584,0.0008637551,0.0000695042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027279992,0.00022279382,0.00024954713,0.00027750395,0.0002612058,0.00024892343,0.0016247341,0.00009139107,0.0000046851837],"category_scores_gemma":[0.00015312611,0.00018937119,0.000052483134,0.00060029636,0.00021177132,0.0006436711,0.00038958056,0.00032698,0.000004659505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028637444,0.0010343761,0.029366208,0.00063098734,0.00019433767,0.000045475383,0.0038491746,0.02538554,0.24202703,0.21326889,0.007887812,0.4760238],"study_design_scores_gemma":[0.00071245845,0.0001403705,0.0057629575,0.000757833,0.000026661415,0.00017751292,0.00055070175,0.8542699,0.059679184,0.07680251,0.00050904136,0.00061086996],"about_ca_topic_score_codex":0.000015029355,"about_ca_topic_score_gemma":0.000002264993,"teacher_disagreement_score":0.848017,"about_ca_system_score_codex":0.00013737363,"about_ca_system_score_gemma":0.00011805097,"threshold_uncertainty_score":0.77223325},"labels":[],"label_agreement":null},{"id":"W2153124215","doi":"10.1109/infcom.2007.63","title":"Strategies of Conflict in Coexisting Streaming Overlays","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overlay; Computer science; Computer network; Upload; Overlay network; Bandwidth (computing); Live streaming; Distributed computing; Network topology; Peer-to-peer; IPTV; Bandwidth allocation; The Internet; World Wide Web","score_opus":0.02535079206497916,"score_gpt":0.29460792501094096,"score_spread":0.2692571329459618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153124215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31494442,0.00006475086,0.5979469,0.00040809938,0.00010299341,0.00010535135,5.791402e-7,0.00044987717,0.08597707],"genre_scores_gemma":[0.87336344,0.000002436865,0.12634273,0.0000836318,0.000011603661,0.0000018297425,3.0515417e-7,0.000003904512,0.00019011306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989107,0.000010796641,0.00028932188,0.00024342761,0.00020553259,0.0003402152],"domain_scores_gemma":[0.99920535,0.00021617365,0.00007034032,0.00041421957,0.000054357777,0.000039574974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005467052,0.00009979036,0.0001597844,0.00025072155,0.000026180705,0.00006443509,0.00082806003,0.00006603053,0.000004845294],"category_scores_gemma":[0.00008825422,0.000093755356,0.000023838566,0.00077266677,0.00004857763,0.00031010175,0.00035788314,0.00011779327,0.000008670763],"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.000006336246,0.000055841338,0.012484728,0.000019466006,0.000010055692,0.000078150115,0.0012553354,0.0018174889,0.0114359595,0.83973855,0.0015125923,0.13158551],"study_design_scores_gemma":[0.0022122287,0.0010477095,0.466892,0.00045670843,0.00001195225,0.00008821916,0.025229394,0.1349278,0.2862081,0.051623777,0.029401703,0.0019004075],"about_ca_topic_score_codex":0.0003004026,"about_ca_topic_score_gemma":0.0005578977,"teacher_disagreement_score":0.7881148,"about_ca_system_score_codex":0.00004043315,"about_ca_system_score_gemma":0.00004221929,"threshold_uncertainty_score":0.38232327},"labels":[],"label_agreement":null},{"id":"W2153173332","doi":"10.1109/aina.2007.104","title":"OntSum: A Semantic Query Routing Scheme in P2P Networks Based on Concise Ontology Indexing","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Ontology; Search engine indexing; Scalability; Information retrieval; Routing (electronic design automation); Distributed computing; World Wide Web; Database; Computer network","score_opus":0.013597287739274279,"score_gpt":0.2540089236273682,"score_spread":0.24041163588809394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153173332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5299991,0.000106449756,0.45396215,0.0035213383,0.00043608728,0.0005149417,2.9926957e-7,0.0014775738,0.009982095],"genre_scores_gemma":[0.94031596,0.000002892381,0.05732575,0.0021218923,0.00011268773,0.00003358309,7.066755e-7,0.000022793181,0.00006371665],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720067,0.000010938424,0.0004906838,0.00078666466,0.00040512922,0.0011059276],"domain_scores_gemma":[0.9989356,0.00022968961,0.00018551222,0.00034316716,0.00015833261,0.0001477101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017256675,0.00029135254,0.00037315013,0.0006358554,0.0001310664,0.00018092337,0.0014360169,0.00030476885,0.000003078063],"category_scores_gemma":[0.0006078712,0.0003007406,0.00006276958,0.0017472192,0.00007943844,0.00041338353,0.00053877535,0.00071363035,0.000029159663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025452045,0.00038772495,0.64869153,0.00012792535,0.000042538013,0.00043160524,0.0033819715,0.0060282685,0.0035792922,0.14729592,0.004996721,0.18478198],"study_design_scores_gemma":[0.00086130813,0.00024740634,0.035954956,0.00047424214,0.0000055779697,0.00003233412,0.00020278605,0.9556051,0.0024800203,0.0021275135,0.001415929,0.00059284695],"about_ca_topic_score_codex":0.00009229578,"about_ca_topic_score_gemma":0.00017934936,"teacher_disagreement_score":0.9495768,"about_ca_system_score_codex":0.0003009199,"about_ca_system_score_gemma":0.00006539437,"threshold_uncertainty_score":0.99994445},"labels":[],"label_agreement":null},{"id":"W2153879456","doi":"10.1109/iscc.2011.5983985","title":"Effective epidemic dissemination of multimedia metadata in Peer-to-Peer overlay networks: The Metis architecture and prototype","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ministry of Economy, Trade and Industry","keywords":"Metadata; Computer science; Download; Metis; Dissemination; Peer-to-peer; Exploit; Overhead (engineering); World Wide Web; Overlay; Architecture; Set (abstract data type); Collaborative editing; Overlay network; Multimedia; The Internet; Telecommunications; Computer security; Operating system","score_opus":0.01483183665027879,"score_gpt":0.26621898141988637,"score_spread":0.25138714476960755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153879456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050913513,0.00027177393,0.93510985,0.008486394,0.00024426568,0.0035103024,0.000010057966,0.00032047948,0.0011333573],"genre_scores_gemma":[0.8009369,0.000009185879,0.19770098,0.00025521414,0.000030903855,0.0004870705,0.000003807119,0.000014244595,0.0005617033],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99791145,0.00021099189,0.00035049292,0.00059353316,0.0005171317,0.00041640986],"domain_scores_gemma":[0.9973273,0.0011746382,0.0001226847,0.0010371676,0.00023713511,0.00010102724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019857287,0.00024100066,0.0003561424,0.00031466683,0.000059345082,0.000072879804,0.0016148883,0.00014399504,0.000010705848],"category_scores_gemma":[0.0024943142,0.0001550617,0.000051295672,0.0013280552,0.00012869088,0.0004303042,0.0010676333,0.00037726972,0.000009037747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014054317,0.00014832272,0.013679352,0.00003468281,0.00010804652,0.00001900428,0.009365154,0.0023047293,0.0016751242,0.015328529,0.014461529,0.94273496],"study_design_scores_gemma":[0.0009249002,0.0017170573,0.7126478,0.0004852603,0.000084542895,0.000060842896,0.0004931643,0.20580296,0.04288585,0.021484846,0.012116289,0.0012964659],"about_ca_topic_score_codex":0.00033844085,"about_ca_topic_score_gemma":0.00051648455,"teacher_disagreement_score":0.9414385,"about_ca_system_score_codex":0.000046433266,"about_ca_system_score_gemma":0.000021160291,"threshold_uncertainty_score":0.63232327},"labels":[],"label_agreement":null},{"id":"W2154227811","doi":"10.1109/cnsr.2005.31","title":"Developing Secure Transcoding Intermediary for SVG Medical Images within Peer-to-Peer Ubiquitous Environment","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Transcoding; XML; Scalable Vector Graphics; Focus (optics); XML framework; Encryption; Multimedia; World Wide Web; Computer security; Computer network","score_opus":0.022400090716203316,"score_gpt":0.27989346993547964,"score_spread":0.25749337921927634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154227811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010910311,0.00007358065,0.782712,0.20361462,0.00053940195,0.00055543886,0.000007766346,0.00094039587,0.0006465233],"genre_scores_gemma":[0.31968608,0.000016129228,0.6712699,0.0063433447,0.00034199285,0.00019932546,0.000007432373,0.00003101145,0.0021048118],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959662,0.000046200676,0.00059402257,0.0009348252,0.0015805184,0.00087825715],"domain_scores_gemma":[0.99827373,0.00029350515,0.000084100466,0.00080817286,0.00013984273,0.00040067453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015413028,0.0003747831,0.00038263333,0.0003198396,0.00019458839,0.00022326373,0.0029306733,0.00028187394,0.00008035872],"category_scores_gemma":[0.0006431011,0.0003295521,0.00012331702,0.00042880038,0.00011977682,0.00049682154,0.0010240882,0.000412377,0.00025335196],"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.00004306976,0.00015399406,0.00027238703,0.00006613405,0.00011200269,0.00010614061,0.0073597156,0.0025510313,0.0028960279,0.07460747,0.2040938,0.7077382],"study_design_scores_gemma":[0.0017228987,0.0006264757,0.0010647121,0.00042059124,0.000037356338,0.0002309324,0.0008425087,0.09124445,0.15210332,0.010487602,0.73907655,0.0021426186],"about_ca_topic_score_codex":0.000009834036,"about_ca_topic_score_gemma":0.00009474662,"teacher_disagreement_score":0.7055956,"about_ca_system_score_codex":0.00033050383,"about_ca_system_score_gemma":0.00020304273,"threshold_uncertainty_score":0.99991566},"labels":[],"label_agreement":null},{"id":"W2154897200","doi":"10.1017/s0269888906000956","title":"Building autonomic systems using collaborative reinforcement learning","year":2006,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Reinforcement learning; Computer science; Adaptation (eye); Distributed computing; Routing (electronic design automation); Set (abstract data type); Protocol (science); Artificial intelligence; Computer network","score_opus":0.013846989711823748,"score_gpt":0.2570420959479594,"score_spread":0.24319510623613566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154897200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019174417,0.1756987,0.818711,0.0003879325,0.00067247386,0.00070113514,3.7737635e-7,0.0010221379,0.0008888421],"genre_scores_gemma":[0.8630313,0.0052736285,0.12896082,0.0001274028,0.0006477595,0.00034881078,0.0000034305478,0.00009029694,0.0015164977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985979,0.000070396956,0.00042629632,0.00031551518,0.00016738762,0.00042250974],"domain_scores_gemma":[0.99887025,0.0001541911,0.00012949882,0.0006678896,0.00012637665,0.000051786985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009013143,0.00024591704,0.00038709302,0.00013403056,0.00016688074,0.00016065981,0.001230687,0.00005173262,0.000002028452],"category_scores_gemma":[0.00017077831,0.00019009788,0.00006749806,0.0014259198,0.000021794935,0.00019809637,0.0005516515,0.00027593816,0.000100239886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3030975e-7,0.0000061657483,0.0000074353457,0.00045344408,0.000019712783,0.0000032462015,0.00007928521,0.9257914,0.001059803,0.06293482,0.0016443996,0.007999984],"study_design_scores_gemma":[0.000061783634,0.000024894118,0.000036613746,0.003218052,0.000022353404,0.00001955631,0.0000052785804,0.7803543,0.00034118973,0.000050324394,0.21561338,0.00025227116],"about_ca_topic_score_codex":0.000021170868,"about_ca_topic_score_gemma":0.0000013160708,"teacher_disagreement_score":0.8611139,"about_ca_system_score_codex":0.00033557045,"about_ca_system_score_gemma":0.00008029521,"threshold_uncertainty_score":0.7751967},"labels":[],"label_agreement":null},{"id":"W2154943390","doi":"10.1109/iwcmc.2011.5982751","title":"Peer to peer content sharing on ad hoc networks of smartphones","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Peer-to-peer; Upload; Server; BitTorrent; File sharing; Mobile device; Mobile computing; Protocol (science); Bandwidth (computing); Distributed computing; Operating system; The Internet","score_opus":0.09780551455651358,"score_gpt":0.25641616422758456,"score_spread":0.15861064967107097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154943390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25794554,0.00025335856,0.68660027,0.018321104,0.0017264098,0.0006369139,0.0000034080153,0.0017240727,0.03278892],"genre_scores_gemma":[0.84879476,0.000010315732,0.12647091,0.0017133685,0.00004924452,0.000043389562,0.0000012423214,0.00001767775,0.022899123],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978543,0.000017605778,0.00032587376,0.0005954707,0.0006888326,0.0005179143],"domain_scores_gemma":[0.9978676,0.000064106636,0.0000773146,0.0012981883,0.0005282166,0.00016459136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056719064,0.00021553738,0.00028386744,0.00023888749,0.00006253362,0.00007732125,0.002308343,0.0001237462,0.00006382524],"category_scores_gemma":[0.00022021355,0.00017702224,0.00008455247,0.0006801899,0.00004652051,0.00021387241,0.0014940772,0.00019779646,0.0002454522],"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.00018123894,0.0004470749,0.014353562,0.000020608095,0.00014356192,0.00008211185,0.006352624,0.0047395593,0.0020891821,0.16965798,0.27179086,0.53014165],"study_design_scores_gemma":[0.0024996186,0.0056988187,0.4562789,0.00061433384,0.000062198036,0.000069548536,0.0018616314,0.12219371,0.115817234,0.018605663,0.27261573,0.0036826308],"about_ca_topic_score_codex":0.000084320294,"about_ca_topic_score_gemma":0.00012437257,"teacher_disagreement_score":0.59084916,"about_ca_system_score_codex":0.00005038342,"about_ca_system_score_gemma":0.000018100442,"threshold_uncertainty_score":0.7218757},"labels":[],"label_agreement":null},{"id":"W2154980848","doi":"10.1023/a:1024072706526","title":"Multi-Agent Multi-User Modeling in I-Help","year":2003,"lang":"en","type":"article","venue":"User Modeling and User-Adapted Interaction","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":133,"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 Saskatchewan","funders":"","keywords":"Multitude; Computer science; Variety (cybernetics); Human–computer interaction; User modeling; World Wide Web; User interface; Artificial intelligence","score_opus":0.07546643995130994,"score_gpt":0.2944312865757056,"score_spread":0.21896484662439566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154980848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37921274,0.00016920075,0.618845,0.00039145237,0.0005895105,0.00023138928,0.0000014859113,0.00048826737,0.00007096673],"genre_scores_gemma":[0.75685996,0.000120108896,0.24215904,0.00030417173,0.00003336566,0.000052426534,0.000004055337,0.00003369499,0.00043319282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726534,0.00012866965,0.000644799,0.0009685678,0.00034732668,0.00064532674],"domain_scores_gemma":[0.9986119,0.00006953306,0.00011747475,0.0008144295,0.00021893812,0.00016772166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053700607,0.00039157076,0.00036391107,0.00063559413,0.00020786517,0.0003154043,0.0006609292,0.00025803086,0.000008079422],"category_scores_gemma":[0.00024417453,0.0003955192,0.00008982361,0.00066051737,0.000020087597,0.001283147,0.0003264029,0.0006875134,0.00006191667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028297374,0.00019652484,0.00075312477,0.000013279569,0.00002686944,0.000016439571,0.0010298894,0.9863764,0.002663495,0.0016739818,0.00024765215,0.0069740335],"study_design_scores_gemma":[0.00082614657,0.00006618338,0.000082616774,0.00018300938,0.000011547343,0.000027058944,0.0005956691,0.9918488,0.0009862025,0.00024237178,0.004682304,0.00044806444],"about_ca_topic_score_codex":0.00061156077,"about_ca_topic_score_gemma":0.0006357299,"teacher_disagreement_score":0.37764722,"about_ca_system_score_codex":0.00025544368,"about_ca_system_score_gemma":0.000055176086,"threshold_uncertainty_score":0.9998497},"labels":[],"label_agreement":null},{"id":"W2155530897","doi":"10.1007/s00453-007-9029-2","title":"Choosing a Random Peer in Chord","year":2007,"lang":"en","type":"article","venue":"Algorithmica","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 Victoria","funders":"","keywords":"Computer science; Peer-to-peer; Distributed hash table; Chord (peer-to-peer); Latency (audio); Hash table; Binary logarithm; Consistent hashing; Theoretical computer science; Fault tolerance; Distributed computing; Hash function; Algorithm; Discrete mathematics; Mathematics","score_opus":0.010186754765782775,"score_gpt":0.2626221448864828,"score_spread":0.2524353901207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155530897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04573036,0.00015285537,0.93926847,0.008524622,0.0005552342,0.00026984746,0.0000010327982,0.00076894753,0.00472866],"genre_scores_gemma":[0.65804267,0.000004668942,0.34042197,0.00074828265,0.00014488355,0.000016987176,0.0000013796198,0.000013630242,0.0006055042],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818283,0.000025549556,0.00028808872,0.00044806977,0.00043204753,0.000623393],"domain_scores_gemma":[0.99890256,0.00017924719,0.000049126862,0.0006717859,0.00009057756,0.00010668833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011572978,0.00015701712,0.00021499142,0.00038166885,0.00006627202,0.00011604816,0.0013222136,0.00011631933,0.0000059121435],"category_scores_gemma":[0.00024849366,0.00015266694,0.000051977342,0.0012913538,0.000043571992,0.00028141338,0.00049334776,0.00028544824,0.00014941499],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022250895,0.00005833325,0.0008266002,0.0000031349075,0.000011169431,0.00018320583,0.0005439148,0.00010843107,0.00076345354,0.004919841,0.008191553,0.9843681],"study_design_scores_gemma":[0.011040113,0.00055777945,0.101188354,0.00031895778,0.000024976269,0.00035488175,0.0004288193,0.17365411,0.07814812,0.06434283,0.56702924,0.0029118364],"about_ca_topic_score_codex":0.00007011327,"about_ca_topic_score_gemma":0.00006811626,"teacher_disagreement_score":0.9814563,"about_ca_system_score_codex":0.00011248857,"about_ca_system_score_gemma":0.000034692468,"threshold_uncertainty_score":0.6225577},"labels":[],"label_agreement":null},{"id":"W2157038360","doi":"10.1109/wetice.2006.8","title":"A Hybrid P2P Protocol for Real-Time Collaboration","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Scalability; Multicast; Distributed computing; Fault tolerance; Redundancy (engineering); Latency (audio); Backup; Network topology; Dissemination; Operating system","score_opus":0.01243001275028659,"score_gpt":0.284517521894748,"score_spread":0.2720875091444614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157038360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013428075,6.8843906e-7,0.81563103,0.0071560843,0.00006913272,0.14946263,0.000005944324,0.0025528136,0.023778887],"genre_scores_gemma":[0.004058627,7.527193e-8,0.58459115,0.00021491063,0.00010603904,0.40234423,0.0000049990854,0.000011420525,0.008668587],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989754,0.0000150578435,0.0001977091,0.00034317307,0.00018820407,0.00028043063],"domain_scores_gemma":[0.9990993,0.00005890798,0.000060936018,0.00055796676,0.00018801511,0.0000348437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019081116,0.00011263959,0.00011932046,0.00010910007,0.000088829285,0.0002171972,0.00075685774,0.000046279783,0.000012999238],"category_scores_gemma":[0.000046217723,0.00009806853,0.000030040432,0.00052133977,0.000021062506,0.00032456339,0.00020423983,0.00003703871,0.00014938656],"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.000017603685,0.000067160814,0.000060045357,0.000012428269,0.0000040119558,0.000004978664,0.000019536914,0.0005064319,0.009721154,0.13484673,0.83962655,0.015113336],"study_design_scores_gemma":[0.0015221256,0.00066028483,0.0010958654,0.000034976845,0.0000041042126,0.000015424139,0.000011132797,0.18602362,0.14249778,0.117903866,0.549632,0.0005988371],"about_ca_topic_score_codex":0.000054253087,"about_ca_topic_score_gemma":0.00003345151,"teacher_disagreement_score":0.2899946,"about_ca_system_score_codex":0.00006458418,"about_ca_system_score_gemma":0.00008116232,"threshold_uncertainty_score":0.39991185},"labels":[],"label_agreement":null},{"id":"W2157382712","doi":"10.1109/icc.2006.255055","title":"Peer-to-Peer Mobility Management for all-IP Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mobility management; Computer network; Scalability; Robustness (evolution); Single point of failure; Mobility model; File sharing; Wireless network; Mobile computing; Distributed computing; Wireless; Telecommunications; The Internet; World Wide Web; Database","score_opus":0.08502782887775434,"score_gpt":0.3521103720367123,"score_spread":0.26708254315895796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157382712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012120261,0.000031172523,0.7722271,0.15027781,0.0008692816,0.0009812354,0.00010088168,0.00060462154,0.07369586],"genre_scores_gemma":[0.75871325,0.000036523437,0.22334953,0.002155267,0.00012904193,0.0010160218,0.0001838088,0.000019987967,0.0143965585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741286,0.0000788364,0.00051976007,0.00063603825,0.00087898347,0.00047350707],"domain_scores_gemma":[0.99452126,0.0003049715,0.00015512508,0.003316453,0.0015784267,0.00012379076],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008101291,0.00027313255,0.00022419583,0.00038102103,0.0002844551,0.00046156743,0.0081173545,0.000127662,0.000032373508],"category_scores_gemma":[0.00014717464,0.00028985486,0.00012256582,0.0005495798,0.00012212752,0.00029690386,0.0014077167,0.0003330148,0.0002591053],"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.000016944814,0.0003300225,0.00016296908,0.0000032329783,0.00005944904,0.0000018242159,0.00006660098,0.014772302,0.000090813846,0.7668399,0.19256777,0.025088143],"study_design_scores_gemma":[0.00047002354,0.00014468122,0.0053763157,0.000070573435,0.000018717692,0.0000051601937,0.00006845992,0.3943532,0.0003306084,0.05792216,0.54072624,0.0005138558],"about_ca_topic_score_codex":0.0001818852,"about_ca_topic_score_gemma":0.0005245722,"teacher_disagreement_score":0.75750124,"about_ca_system_score_codex":0.0002858101,"about_ca_system_score_gemma":0.00005478173,"threshold_uncertainty_score":0.99995536},"labels":[],"label_agreement":null},{"id":"W2157788180","doi":"10.1109/have.2005.1545667","title":"An application-layer multicasting protocol for distributed collaboration","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; The Internet; Scalability; Computer network; IP multicast; Distributed computing; Application layer; Layer (electronics); Protocol Independent Multicast; Reliable multicast; Pragmatic General Multicast; Transmission (telecommunications); Xcast; Protocol (science); World Wide Web; Operating system; Telecommunications; Software deployment","score_opus":0.03164471756934676,"score_gpt":0.35842888835223485,"score_spread":0.3267841707828881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157788180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036690375,3.4483887e-7,0.91064775,0.006357606,0.000017710061,0.081213616,0.000007772542,0.0011650232,0.00022329282],"genre_scores_gemma":[0.11010596,1.26571065e-8,0.59084153,0.00024286238,0.00007317619,0.29866767,0.00000928295,0.0000056220824,0.000053858344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990022,0.000014275672,0.00020739602,0.0003739608,0.00015382127,0.00024833423],"domain_scores_gemma":[0.9988775,0.000070841204,0.00006712476,0.00063637,0.00027469543,0.00007347266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020313315,0.000103651255,0.00009133848,0.00006632928,0.00013527313,0.0002120282,0.0008267446,0.000068401925,0.0000038003786],"category_scores_gemma":[0.00011960761,0.00009282521,0.00001736486,0.0006972155,0.000017273818,0.00057662587,0.00012456559,0.000051311123,0.000047430854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039306535,0.0004257321,0.00089672854,0.000028897583,0.000014184566,8.345155e-7,0.00037159384,0.051041067,0.020287612,0.185564,0.04063015,0.70069987],"study_design_scores_gemma":[0.00039097934,0.00009460535,0.0003601178,0.000004651875,0.000001112798,0.0000011169692,0.00002524913,0.85051274,0.017923363,0.0010489707,0.12949961,0.00013746344],"about_ca_topic_score_codex":0.0000049215323,"about_ca_topic_score_gemma":0.00007331205,"teacher_disagreement_score":0.7994717,"about_ca_system_score_codex":0.00007749836,"about_ca_system_score_gemma":0.000047052577,"threshold_uncertainty_score":0.37853023},"labels":[],"label_agreement":null},{"id":"W2157835246","doi":"10.1109/aina.2006.333","title":"Towards Designing Secure Online Games","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Human–computer interaction; Multimedia; Computer security","score_opus":0.014140968411597156,"score_gpt":0.24171065740162526,"score_spread":0.2275696889900281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157835246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024785336,0.0001538797,0.951249,0.008912283,0.00017847105,0.00010466376,0.0000017715971,0.0021910863,0.01242352],"genre_scores_gemma":[0.41233474,0.0000026529044,0.5852647,0.0006140458,0.000084736945,0.000006767838,0.0000022759714,0.0000062746467,0.0016838382],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988676,0.000017677454,0.0001634795,0.0003493166,0.00024915725,0.0003527927],"domain_scores_gemma":[0.99924475,0.000038715487,0.000034064506,0.0005720728,0.00006293236,0.000047454883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014026322,0.00013266921,0.00013420972,0.00013833541,0.000060595237,0.00013717842,0.0012698856,0.00008082756,0.000014732174],"category_scores_gemma":[0.000040355902,0.000111271685,0.000040625517,0.0006672957,0.00003057462,0.0002341517,0.00054528884,0.00012929185,0.000084645435],"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.0000032346552,0.0001453927,0.0016716035,0.0000087906255,0.000016487453,0.0000877906,0.0001999451,0.0034876186,0.0042838603,0.30552045,0.26600552,0.41856933],"study_design_scores_gemma":[0.001003271,0.00057503884,0.04852769,0.0001255128,0.000019816338,0.00014636863,0.0002913263,0.1787021,0.15444873,0.26395997,0.3501802,0.002019958],"about_ca_topic_score_codex":0.0001371265,"about_ca_topic_score_gemma":0.00012939164,"teacher_disagreement_score":0.41654935,"about_ca_system_score_codex":0.000039873175,"about_ca_system_score_gemma":0.000041629013,"threshold_uncertainty_score":0.45375276},"labels":[],"label_agreement":null},{"id":"W2158065438","doi":"10.1109/reconfig.2010.23","title":"A Hardware Architecture of an XML/XPath Broker for Content-Based Publish/Subscribe Systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; XPath; XML; Architecture; Parsing; Field-programmable gate array; Simple API for XML; Throughput; Software architecture; XSLT; Operating system; Embedded system; Software; XML database; XML Signature; Programming language; Efficient XML Interchange; Wireless","score_opus":0.030024626247577478,"score_gpt":0.24721909712575824,"score_spread":0.21719447087818075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158065438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1597665,0.000042934986,0.83184665,0.004223378,0.0012631062,0.00089709094,0.000049651822,0.0012318535,0.0006788284],"genre_scores_gemma":[0.6919736,2.175444e-7,0.30635878,0.00058129284,0.000094725016,0.00017882581,0.000014578664,0.000019368083,0.00077856466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806976,0.00003902181,0.0003591788,0.0006050479,0.00040942873,0.0005175421],"domain_scores_gemma":[0.9973951,0.00016000636,0.00014451088,0.0016423499,0.00047126753,0.00018674975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000496326,0.00023171426,0.00035431885,0.00031105938,0.00008730347,0.0004018477,0.0026277169,0.00022155086,0.000008490714],"category_scores_gemma":[0.00038838206,0.00018126998,0.00012011705,0.00055254763,0.00009780608,0.0004982076,0.0003252846,0.0003237371,0.0000098796145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018425177,0.0007814703,0.0038106304,0.00044930237,0.00016629054,0.000051953866,0.001168481,0.005261066,0.17390406,0.47989008,0.0844836,0.24984881],"study_design_scores_gemma":[0.004982111,0.0028467681,0.006029873,0.00029031603,0.00006130362,0.00014412189,0.0009759613,0.5535043,0.20309694,0.011171838,0.21459994,0.0022965095],"about_ca_topic_score_codex":0.0001913984,"about_ca_topic_score_gemma":0.0004720867,"teacher_disagreement_score":0.5482432,"about_ca_system_score_codex":0.000023572136,"about_ca_system_score_gemma":0.00012187631,"threshold_uncertainty_score":0.7391975},"labels":[],"label_agreement":null},{"id":"W2158306844","doi":"10.1109/ispa.2008.126","title":"Authorization Using the Publish-Subscribe Model","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Authorization; Server; Authorization certificate; Overhead (engineering); Computer network; Single point of failure; Cache; Publication; Architecture; Computer security; Operating system; Public-key cryptography","score_opus":0.08689181657949556,"score_gpt":0.26911445357784886,"score_spread":0.18222263699835328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158306844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019544065,0.000024609122,0.96588796,0.007443659,0.00021603034,0.00012091716,4.1850976e-7,0.0010151975,0.0057471674],"genre_scores_gemma":[0.64310247,0.000003928037,0.35482398,0.00078527164,0.000032466927,0.0000067329247,5.699392e-7,0.0000054779453,0.0012390892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989933,0.000021294785,0.00013786962,0.00028054073,0.00029564058,0.00027137357],"domain_scores_gemma":[0.9990455,0.00002917798,0.000037593185,0.0007324715,0.00010746239,0.00004782496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020135556,0.000095882264,0.00008173755,0.000106487256,0.0002950737,0.00019283309,0.0015798159,0.00006689022,0.0000042124543],"category_scores_gemma":[0.00007182343,0.000064831474,0.000030373785,0.0010052342,0.000056261397,0.0008217089,0.0006245903,0.00012050067,0.000025613654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015557926,0.00002979396,0.00056933326,0.0000016178286,0.000009593032,0.000010818363,0.0010585424,0.19058575,0.0015290104,0.7304934,0.059303537,0.016407024],"study_design_scores_gemma":[0.000042304597,0.000010688821,0.00022214116,0.0000023061943,0.000001396306,0.000027052856,0.000017997892,0.98569214,0.0010069172,0.010811494,0.0020637638,0.000101771686],"about_ca_topic_score_codex":0.00002732642,"about_ca_topic_score_gemma":0.000009271946,"teacher_disagreement_score":0.7951064,"about_ca_system_score_codex":0.00004791121,"about_ca_system_score_gemma":0.00007726313,"threshold_uncertainty_score":0.2935717},"labels":[],"label_agreement":null},{"id":"W2158412185","doi":"10.1109/nswctc.2009.51","title":"A Solution for Whitewashing in P2P Systems Based on Observation Preorder","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Computer science; Preorder; Node (physics); Joins; Identity (music); Computer security; Theoretical computer science; Programming language; Mathematics; Engineering; Discrete mathematics","score_opus":0.032685307308131066,"score_gpt":0.2640138419991726,"score_spread":0.23132853469104153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158412185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015503364,0.000020734542,0.9678082,0.014062012,0.00022237658,0.0005848342,6.7505465e-7,0.0007056302,0.001092173],"genre_scores_gemma":[0.80819774,4.8075293e-7,0.19013944,0.0012665698,0.000028873868,0.00007639479,0.0000031099742,0.0000040334144,0.0002833311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989695,0.000026917478,0.00019682331,0.00032319987,0.00020193758,0.00028159804],"domain_scores_gemma":[0.9992888,0.000105474515,0.000050112638,0.00045621325,0.00006933601,0.000030042802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043427385,0.00010166357,0.00011829465,0.00022856801,0.000057246874,0.0001567285,0.0005869131,0.000088031935,6.196686e-7],"category_scores_gemma":[0.00016462764,0.00009336839,0.000027115022,0.0006764541,0.0000061981436,0.00036484931,0.000049632756,0.00008171247,0.000009645005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058650967,0.0002876872,0.0033611313,0.00004845539,0.0000065138724,0.0000066683374,0.00042128534,0.3432795,0.00391794,0.31761527,0.03457121,0.2964257],"study_design_scores_gemma":[0.0002694567,0.00023102843,0.009728039,0.00006882819,8.8913214e-7,5.390077e-7,0.000010576702,0.9846158,0.00041415892,0.0025418503,0.0019952478,0.0001235985],"about_ca_topic_score_codex":0.000040763647,"about_ca_topic_score_gemma":0.00005768163,"teacher_disagreement_score":0.7926944,"about_ca_system_score_codex":0.00012749458,"about_ca_system_score_gemma":0.000032680095,"threshold_uncertainty_score":0.38074523},"labels":[],"label_agreement":null},{"id":"W2158547290","doi":"10.1109/iwsm.1998.668134","title":"A quality of service management testbed","year":2002,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Testbed; Computer science; Quality of service; Service (business); Quality (philosophy); Work (physics); Reliability (semiconductor); Task (project management); Risk analysis (engineering); Systems engineering; Process management; Telecommunications; Engineering; Computer network","score_opus":0.060112370524334595,"score_gpt":0.27751681775078435,"score_spread":0.21740444722644975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158547290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05055196,0.000054267133,0.62774825,0.030857325,0.0001660155,0.0003288541,0.0000013345649,0.0017044527,0.2885875],"genre_scores_gemma":[0.6093625,0.000010587164,0.38648576,0.00210223,0.000008073191,0.000015687416,1.8736176e-7,0.0000036324764,0.0020113455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906063,0.000022889086,0.00020793076,0.00025105363,0.00025912977,0.00019835297],"domain_scores_gemma":[0.99887687,0.000050854385,0.000051111525,0.0009143653,0.00006709243,0.00003969048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022144504,0.00007944589,0.00012643928,0.00009853493,0.000024987115,0.000029491253,0.0014057253,0.00003465973,0.000043901193],"category_scores_gemma":[0.000023049832,0.00006955711,0.000027374826,0.0009940619,0.000015394031,0.00013377739,0.0008377717,0.00004914133,0.00027491341],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026300913,0.00020119385,0.0021165411,0.000076418866,0.000042969987,0.00001428342,0.0005194932,0.00030278068,0.0006826034,0.37419704,0.052344937,0.56949914],"study_design_scores_gemma":[0.0031094716,0.00064715114,0.23132354,0.00018786921,0.0000327659,0.000030806474,0.0010744889,0.3825208,0.026713345,0.09756887,0.25423312,0.0025577673],"about_ca_topic_score_codex":0.000082561,"about_ca_topic_score_gemma":0.00008358577,"teacher_disagreement_score":0.5669414,"about_ca_system_score_codex":0.00001900833,"about_ca_system_score_gemma":0.000002160522,"threshold_uncertainty_score":0.35335475},"labels":[],"label_agreement":null},{"id":"W2158743596","doi":"10.1109/jsac.2007.070105","title":"Outreach: peer-to-peer topology construction towards minimized server bandwidth costs","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network topology; Computer network; Server; Scalability; Upload; Bandwidth (computing); Overlay; Overlay network; Peer-to-peer; Outreach; Bandwidth allocation; Distributed computing; Multimedia; The Internet; World Wide Web; Operating system","score_opus":0.03574784777431684,"score_gpt":0.32129470986717157,"score_spread":0.28554686209285474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158743596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44736716,0.00034478356,0.3313558,0.19967426,0.0032929396,0.0011237543,0.000027058391,0.0014054102,0.015408835],"genre_scores_gemma":[0.7659661,0.00010423706,0.23157229,0.0016147817,0.00012848941,0.000036089634,0.000013039743,0.000025308618,0.0005396739],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963903,0.00046709203,0.00092013786,0.00046854944,0.0009317162,0.0008222056],"domain_scores_gemma":[0.9938049,0.0008653355,0.00033130567,0.0027128833,0.0019009274,0.0003846754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002413986,0.00033281898,0.0004744219,0.0013922178,0.00053179153,0.00030355316,0.005038937,0.00026932795,0.000023500981],"category_scores_gemma":[0.0018666426,0.00032452203,0.00011564476,0.0036174196,0.00021447071,0.00042335744,0.00069602445,0.0016817885,0.00012274894],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071242766,0.0020242836,0.027607447,0.000013586418,0.00041839216,0.00032076018,0.0054778806,0.003564975,0.00484007,0.07745913,0.13125607,0.746305],"study_design_scores_gemma":[0.012076482,0.003203563,0.3537198,0.0011352086,0.00017698405,0.008687043,0.0024526962,0.01845915,0.031064091,0.03824411,0.5265601,0.004220779],"about_ca_topic_score_codex":0.00013456553,"about_ca_topic_score_gemma":0.001518453,"teacher_disagreement_score":0.7420842,"about_ca_system_score_codex":0.0009311978,"about_ca_system_score_gemma":0.00035247015,"threshold_uncertainty_score":0.99992067},"labels":[],"label_agreement":null},{"id":"W2158747201","doi":"10.1109/icdcsw.2007.39","title":"Impact of Peer Churning in Trusted Gossiping for P2P Information Sharing","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba","funders":"","keywords":"Churning; Gossip; Rumor; Computer science; Node (physics); Protocol (science); Computer network; Gossip protocol; Trusted Computing; Peer-to-peer; Trusted Network Connect; Computer security; Engineering","score_opus":0.021614863131616143,"score_gpt":0.318069622246542,"score_spread":0.29645475911492586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158747201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41886932,0.000005053192,0.5782089,0.00021690078,0.000058697835,0.0001594263,6.4411154e-7,0.00020987068,0.002271139],"genre_scores_gemma":[0.85671484,4.2736815e-7,0.1431116,0.00005854289,0.000013190918,0.000008274615,0.0000025395868,0.0000032924945,0.00008726148],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9989136,0.000003947713,0.00036295614,0.00014744086,0.00022085196,0.00035119802],"domain_scores_gemma":[0.9992455,0.00010230033,0.00010677997,0.00034154434,0.00016112968,0.000042701053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010553024,0.00009417069,0.00014418691,0.00050908583,0.000038185208,0.00009390738,0.00077311276,0.00007812167,0.0000041797243],"category_scores_gemma":[0.00039486293,0.00008174671,0.00005977305,0.00088843046,0.000013497242,0.0011776559,0.00032735654,0.000103463804,0.000007442025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006485519,0.000055502576,0.16789998,0.00005788327,0.000041647276,0.000004052183,0.005695538,0.025648491,0.0030787066,0.044871394,0.0032090086,0.74937296],"study_design_scores_gemma":[0.00090190605,0.00029058027,0.50496584,0.00010646704,0.0000029963498,0.000009201948,0.00030020234,0.47915044,0.00906355,0.003452017,0.0014251937,0.00033157648],"about_ca_topic_score_codex":0.00012198946,"about_ca_topic_score_gemma":0.00006398843,"teacher_disagreement_score":0.7490414,"about_ca_system_score_codex":0.00014549283,"about_ca_system_score_gemma":0.000034188946,"threshold_uncertainty_score":0.3333534},"labels":[],"label_agreement":null},{"id":"W2158783011","doi":"10.1109/tpds.2007.70730","title":"Scalability Analysis of the Hierarchical Architecture for Distributed Virtual Environments","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Server; Distributed computing; Workload; Consistency (knowledge bases); Virtual machine; Architecture; Workstation; Computer network; Operating system","score_opus":0.01742337890183155,"score_gpt":0.22847064163481381,"score_spread":0.21104726273298227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158783011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11715449,0.000042435702,0.8786093,0.00094172335,0.0002621323,0.0005818574,0.0022754255,0.00012665564,0.0000059884987],"genre_scores_gemma":[0.99759054,0.000014471636,0.001969204,0.000042488773,0.000013019541,0.00019822181,0.00005704761,0.000007433588,0.00010755804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808985,0.00014480557,0.00045806443,0.0005431022,0.00040895998,0.00035521341],"domain_scores_gemma":[0.99840164,0.0003208675,0.00012806764,0.00095488154,0.000047421407,0.0001471379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021979124,0.00023205388,0.00047614484,0.00019443632,0.0004143363,0.000044092565,0.0008361092,0.00017166004,0.0000019762867],"category_scores_gemma":[0.00003044006,0.00016590625,0.00029695398,0.0015102938,0.00030571356,0.000090707574,0.000019863222,0.0002645277,0.0000025463796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007600582,0.00023718498,0.000931187,0.000014470243,0.00042730427,0.000002347308,0.00016703812,0.994032,0.0003782184,0.0009303837,0.00046549574,0.0023383098],"study_design_scores_gemma":[0.002874632,0.00111911,0.11357754,0.000102566744,0.0009766999,0.00010604766,0.0002479092,0.8616428,0.0023625651,0.0013055116,0.014523191,0.0011614347],"about_ca_topic_score_codex":0.00005656795,"about_ca_topic_score_gemma":0.000037973336,"teacher_disagreement_score":0.88043606,"about_ca_system_score_codex":0.00008709519,"about_ca_system_score_gemma":0.00004012939,"threshold_uncertainty_score":0.67654604},"labels":[],"label_agreement":null},{"id":"W2158809643","doi":"","title":"Scalable download protocols","year":2006,"lang":"en","type":"article","venue":"University Library - University of Saskatchewan (University of Saskatchewan)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Scalability; Multicast; Replica; Computer network; Upload; Distributed computing; Service (business); Reliable multicast; Server; Replication (statistics); Source-specific multicast; Database; Operating system","score_opus":0.0074992831365224095,"score_gpt":0.17035570278613263,"score_spread":0.16285641964961023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158809643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7663968,0.000110750174,0.19403116,0.00996976,0.00030773127,0.00706001,0.0009191894,0.003712331,0.01749222],"genre_scores_gemma":[0.81086355,0.000024806315,0.1546718,0.0000828202,0.000038473612,3.243017e-7,0.00008634399,0.000027041848,0.034204833],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9963833,0.00022374849,0.00033356756,0.0012678867,0.00083617656,0.0009553404],"domain_scores_gemma":[0.9966252,0.00018557873,0.00062501774,0.0018061764,0.0003136899,0.00044434832],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00027355758,0.0005649616,0.000989959,0.0012793787,0.00075315335,0.000072803894,0.006209186,0.0005514254,0.00044427984],"category_scores_gemma":[0.000010701438,0.0008432126,0.0005345968,0.00317569,0.0011194102,0.004505007,0.003570313,0.000560951,0.00024918112],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005989692,0.007077474,0.09297785,0.0020803928,0.00226401,0.009013446,0.46345842,0.011299824,0.03383352,0.01617538,0.27482492,0.081005074],"study_design_scores_gemma":[0.007274389,0.0012588433,0.01845038,0.000655412,0.00028431986,0.00004760165,0.7570372,0.0017082407,0.010690742,0.0049080127,0.19500539,0.0026794511],"about_ca_topic_score_codex":0.021500707,"about_ca_topic_score_gemma":0.005281991,"teacher_disagreement_score":0.2935788,"about_ca_system_score_codex":0.00028122743,"about_ca_system_score_gemma":0.0011067954,"threshold_uncertainty_score":0.99940187},"labels":[],"label_agreement":null},{"id":"W2159384568","doi":"10.1007/3-540-36124-3_14","title":"Supporting Peer-to-Peer User Communities","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":24,"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 Saskatchewan","funders":"","keywords":"File sharing; Software deployment; Peer-to-peer; Computer science; World Wide Web; Internet privacy; Coping (psychology); Peer review; Knowledge management; Psychology; Political science; The Internet; Software engineering","score_opus":0.028798004251518385,"score_gpt":0.2731503917317483,"score_spread":0.24435238748022994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159384568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038194656,0.00018077846,0.9678227,0.01838949,0.0024594392,0.0007679589,0.000016743123,0.0012685037,0.00871248],"genre_scores_gemma":[0.14807884,0.00002206154,0.82573366,0.010165549,0.0006430364,0.00005139654,0.000014062933,0.00011528683,0.015176117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99174255,0.000065960136,0.0010291891,0.0019526333,0.0032623287,0.0019473366],"domain_scores_gemma":[0.9927864,0.00086177513,0.0004171711,0.00422954,0.001241636,0.00046348583],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024902374,0.0010504313,0.0010184958,0.0024199772,0.0006224863,0.0016255889,0.013054463,0.000658273,0.0000892986],"category_scores_gemma":[0.00061471487,0.001024013,0.00021909943,0.0019680853,0.0009159609,0.00090633525,0.008475116,0.002069702,0.000576308],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076126034,0.00006425069,0.0004235101,0.000049349455,0.00003578795,0.0003281143,0.0066843247,0.07139975,0.00007921953,0.032036357,0.010409007,0.8784827],"study_design_scores_gemma":[0.0006535248,0.0010546441,0.00059400435,0.001641704,0.000033735927,0.00044212767,0.00000993175,0.42245385,0.003093889,0.1896894,0.37561494,0.0047182487],"about_ca_topic_score_codex":0.00010740241,"about_ca_topic_score_gemma":0.0003521317,"teacher_disagreement_score":0.87376446,"about_ca_system_score_codex":0.0006075003,"about_ca_system_score_gemma":0.00034756717,"threshold_uncertainty_score":0.99954414},"labels":[],"label_agreement":null},{"id":"W2159626197","doi":"10.1109/iwqos.2009.5201417","title":"Efficient allocation of seed servers in peer-to-peer streaming systems with scalable videos","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Server; Computer science; Scalability; Upload; Peer-to-peer; Distributed computing; Greedy algorithm; Computer network; Approximation algorithm; Algorithm; Database; Operating system","score_opus":0.01010505105567867,"score_gpt":0.22971760264767538,"score_spread":0.21961255159199672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159626197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6209612,0.000041964,0.36314568,0.010369523,0.0001609495,0.00070549897,0.0000018927444,0.0006185982,0.0039947014],"genre_scores_gemma":[0.93930936,4.3867843e-7,0.058852147,0.00024430847,0.0000147976625,0.000025939817,0.0000023357622,0.000008759636,0.0015419134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760824,0.000042478016,0.00038400342,0.00053760334,0.0009727934,0.00045487218],"domain_scores_gemma":[0.99832314,0.00006803454,0.000105996165,0.0008830826,0.00050298974,0.00011678324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007720121,0.00020195986,0.00029945394,0.00049283274,0.000051698706,0.00013552424,0.0011766137,0.00010009233,0.0000018131925],"category_scores_gemma":[0.00014284838,0.0001674018,0.000030898005,0.0021706128,0.000029656803,0.00018573165,0.00022536736,0.00014077738,0.000038927432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027399201,0.00019218933,0.0055598672,0.000028855004,0.000016244123,0.000019528808,0.00093667273,0.960626,0.0039454442,0.015212099,0.0033055327,0.010130145],"study_design_scores_gemma":[0.0008510832,0.00087622955,0.07973226,0.0004027629,0.000008376938,0.00001899997,0.0009418711,0.90009767,0.0148999235,0.00020120968,0.0014006575,0.00056897197],"about_ca_topic_score_codex":0.00066680263,"about_ca_topic_score_gemma":0.0001620368,"teacher_disagreement_score":0.31834814,"about_ca_system_score_codex":0.00019406866,"about_ca_system_score_gemma":0.0000980916,"threshold_uncertainty_score":0.6826447},"labels":[],"label_agreement":null},{"id":"W2159896477","doi":"10.1007/s12083-009-0066-2","title":"From P2P to reliable semantic P2P systems","year":2010,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scalability; Semantic Web; Semantics (computer science); Disconnection; Reliability (semiconductor); Fault tolerance; Social Semantic Web; Distributed computing; Information retrieval; Database; Power (physics)","score_opus":0.013452727753118765,"score_gpt":0.2577501957171053,"score_spread":0.24429746796398652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159896477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047977936,0.00028747212,0.87527543,0.06488232,0.0026442602,0.0024461807,0.00006340776,0.0023480565,0.004074908],"genre_scores_gemma":[0.82577085,0.000013766728,0.15908387,0.002497644,0.0028390754,0.0022219738,0.00004498522,0.00007644195,0.0074513997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99576116,0.00004058759,0.0005993442,0.0015522665,0.00095992244,0.0010867186],"domain_scores_gemma":[0.9954982,0.00031724919,0.00013802362,0.0026324312,0.00056372554,0.0008503787],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009858034,0.00046393243,0.0005236036,0.00043810427,0.0006557339,0.0010406215,0.0028015196,0.00027767982,0.000008534153],"category_scores_gemma":[0.00017194972,0.0004761394,0.000083084495,0.0027737026,0.00006861555,0.00021114582,0.001613557,0.00065880123,0.0011726425],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021067215,0.00020491898,0.0035668034,0.00004040433,0.00010869421,0.000018146284,0.0022443905,0.03214977,0.0089285765,0.05241494,0.6603957,0.2399066],"study_design_scores_gemma":[0.00016553713,0.000079249075,0.0018475592,0.00011213842,0.00002817179,0.000020739097,0.00009836466,0.021245383,0.0004107584,0.0048340103,0.97049063,0.00066743256],"about_ca_topic_score_codex":0.00081193616,"about_ca_topic_score_gemma":0.000262953,"teacher_disagreement_score":0.77779293,"about_ca_system_score_codex":0.000081427665,"about_ca_system_score_gemma":0.00007388848,"threshold_uncertainty_score":0.9999964},"labels":[],"label_agreement":null},{"id":"W2159942230","doi":"10.1109/p2p.2011.6038734","title":"Efficient stereo segment scheduling in peer-to-peer 3D/multi-view video streaming","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Distributed computing; Peer-to-peer; Job shop scheduling; Solver; Server; Overlay; Real-time computing; Computer network; Mathematical optimization","score_opus":0.04839325720699011,"score_gpt":0.27505600836218747,"score_spread":0.22666275115519735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159942230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28087124,0.00014403524,0.70975655,0.003916721,0.0005496967,0.0006800248,0.0000029452822,0.0011283215,0.0029504602],"genre_scores_gemma":[0.47256726,0.000003258665,0.52526367,0.00075079483,0.000025192441,0.0000714385,0.0000011720575,0.000019076026,0.0012981502],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960828,0.000079032994,0.00063843216,0.0011088848,0.0010405438,0.0010503266],"domain_scores_gemma":[0.99760044,0.000103289916,0.00010913373,0.0015471419,0.00034789307,0.00029210822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013766749,0.00040775066,0.00043841044,0.00066759164,0.00012750902,0.00021770134,0.0025855608,0.00016991606,0.00005753314],"category_scores_gemma":[0.00038980134,0.00036568765,0.00009157796,0.0017362974,0.000053326447,0.00022708534,0.0022126618,0.00038657317,0.00070558547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046389654,0.0015022233,0.016900683,0.00010518777,0.00010344223,0.0003601991,0.016036574,0.1180671,0.0027063566,0.024182884,0.004337949,0.815651],"study_design_scores_gemma":[0.001739927,0.00057876366,0.03501956,0.0006840267,0.000023881801,0.000045178975,0.0013635276,0.92414993,0.019337725,0.00070206437,0.014407065,0.0019483665],"about_ca_topic_score_codex":0.0003177736,"about_ca_topic_score_gemma":0.0003548222,"teacher_disagreement_score":0.81370264,"about_ca_system_score_codex":0.00028960954,"about_ca_system_score_gemma":0.00008470702,"threshold_uncertainty_score":0.9998795},"labels":[],"label_agreement":null},{"id":"W2160116957","doi":"10.1109/reldis.2002.1180203","title":"Using file-grain connectivity to implement a peer-to-peer file system","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; File system; Locality; Exploit; Node (physics); Key (lock); Flexibility (engineering); File server; Granularity; Peer-to-peer; Self-certifying File System; Torrent file; Distributed File System; Distributed computing; Virtual file system; Operating system; Database; Computer file; SSH File Transfer Protocol; Device file; Computer security","score_opus":0.04433366289566271,"score_gpt":0.297675753430856,"score_spread":0.2533420905351933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160116957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021082044,0.00001388427,0.9492474,0.009407008,0.0008686987,0.0012991556,0.0005894731,0.0023370849,0.015155229],"genre_scores_gemma":[0.4472118,1.17581294e-7,0.545019,0.0016679687,0.00006552396,0.0002752152,0.000019001362,0.000029117877,0.0057122656],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960791,0.00016331761,0.0004559034,0.0010789994,0.0011094895,0.0011131901],"domain_scores_gemma":[0.9968668,0.00037100818,0.00009659182,0.0017023549,0.0005294442,0.00043375016],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001412161,0.0003811545,0.00044915613,0.0004452606,0.00028474157,0.00040559567,0.0017724545,0.00014133824,0.0013515636],"category_scores_gemma":[0.0016484456,0.00035593487,0.00011612132,0.0020471402,0.000024119692,0.00030797778,0.0013068028,0.00022121433,0.0008561807],"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.000004886472,0.000052443145,0.00016973265,0.000017504284,0.000029215658,0.000043059506,0.00044666958,0.0016254401,0.0008923166,0.0739341,0.9139838,0.008800789],"study_design_scores_gemma":[0.0004533797,0.0004355902,0.0014288524,0.00016722549,0.000014650826,0.00014520306,0.0011553038,0.035145987,0.012923927,0.0011537845,0.9458182,0.0011579038],"about_ca_topic_score_codex":0.00049211935,"about_ca_topic_score_gemma":0.0004296517,"teacher_disagreement_score":0.42612976,"about_ca_system_score_codex":0.0005938777,"about_ca_system_score_gemma":0.00016868731,"threshold_uncertainty_score":0.99992174},"labels":[],"label_agreement":null},{"id":"W2160466238","doi":"10.1109/have.2008.4685295","title":"An auxiliary area of interest management for synchronization and load regulation in zonal P2P MMOGs","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Synchronization (alternating current); Computer science; Hotspot (geology); Distributed computing; Computer network; Geology; Geophysics","score_opus":0.04187171304347299,"score_gpt":0.2568238713250683,"score_spread":0.2149521582815953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160466238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25818124,0.000027188176,0.74027336,0.0006130921,0.000045458677,0.0002335264,9.3611146e-7,0.00012463993,0.0005005675],"genre_scores_gemma":[0.84135157,0.000012983179,0.15840256,0.00006126277,0.00000769229,0.000013203906,0.000004964629,0.0000028553757,0.0001428902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999321,0.00001203809,0.0001710489,0.00024952355,0.00011602814,0.00013038299],"domain_scores_gemma":[0.9995158,0.000028453902,0.00004271028,0.00032004176,0.00006640895,0.0000266261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015243716,0.00007260275,0.00009444207,0.00017062743,0.000033460496,0.00002032427,0.000355785,0.00004558361,0.000004361294],"category_scores_gemma":[0.000019350546,0.00006968741,0.00001260287,0.00033203303,0.00004248653,0.00032604305,0.00015312528,0.0000320328,0.000001570426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005831307,0.00024269968,0.049745627,0.00011145586,0.00003137274,0.000024412837,0.0008963829,0.0125698885,0.000899461,0.24978298,0.005903003,0.6797344],"study_design_scores_gemma":[0.00049379736,0.0002361898,0.28488594,0.00005698133,0.000003302495,0.000013226195,0.000052056228,0.68873143,0.0023199115,0.022650002,0.0003923244,0.00016485211],"about_ca_topic_score_codex":0.000025684816,"about_ca_topic_score_gemma":0.00026004037,"teacher_disagreement_score":0.67956954,"about_ca_system_score_codex":0.000057312172,"about_ca_system_score_gemma":0.000019323992,"threshold_uncertainty_score":0.28417704},"labels":[],"label_agreement":null},{"id":"W2160955579","doi":"10.1109/tnet.2011.2107563","title":"On Dynamic Server Provisioning in Multichannel P2P Live Streaming","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Upload; Server; Computer network; Bandwidth (computing); Real Time Streaming Protocol; Provisioning; Live streaming; The Internet; Quality of service; Channel (broadcasting); Peer-to-peer; Operating system","score_opus":0.03435184294614749,"score_gpt":0.25355584554659694,"score_spread":0.21920400260044945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160955579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19159368,0.00008195336,0.8037815,0.00035989255,0.0020688586,0.00054266554,0.0000029894243,0.0010743606,0.0004940937],"genre_scores_gemma":[0.9284503,0.00003622145,0.070835784,0.00029912757,0.000065760156,0.00011342358,0.0000011895446,0.00004196056,0.00015622369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972743,0.00010390567,0.00044712552,0.0009081027,0.00041857857,0.0008479785],"domain_scores_gemma":[0.9978296,0.00038873425,0.00012606663,0.001452075,0.00006550214,0.00013800662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040806172,0.0003781544,0.00032435003,0.00067342375,0.00033864728,0.00013440003,0.0018516881,0.00023011526,0.000018481216],"category_scores_gemma":[0.000036939713,0.00038724756,0.00012513468,0.0014157183,0.00005590221,0.00044687706,0.000066601104,0.0008122088,0.00015219823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008745802,0.00046802696,0.00039390876,0.000021593345,0.00006402269,0.00016493043,0.005616819,0.3065368,0.00025591798,0.0007432189,0.00010359221,0.6855437],"study_design_scores_gemma":[0.0013119468,0.0010362362,0.0044966196,0.0017868939,0.000035627134,0.000039651113,0.0005978979,0.9699347,0.003615233,0.015371595,0.0004216697,0.0013519294],"about_ca_topic_score_codex":0.00020684942,"about_ca_topic_score_gemma":0.0010850689,"teacher_disagreement_score":0.73685664,"about_ca_system_score_codex":0.00030394722,"about_ca_system_score_gemma":0.000050953793,"threshold_uncertainty_score":0.99985796},"labels":[],"label_agreement":null},{"id":"W2161170999","doi":"10.1109/aina.2007.140","title":"Trusted Gossip:A Rumor Resistant Dissemination Mechanism for Peer-to-Peer Information Sharing","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Manitoba","funders":"","keywords":"Gossip; Rumor; Gossip protocol; Computer science; Peer-to-peer; Protocol (science); Internet privacy; Trustworthiness; Computer security; Computer network; Information sharing; World Wide Web; Psychology; Political science; Public relations","score_opus":0.01433020433644468,"score_gpt":0.2758453056533596,"score_spread":0.2615151013169149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161170999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16339494,0.0000074805944,0.81004554,0.017766118,0.0004650423,0.001171041,0.000011156079,0.0016580148,0.0054806727],"genre_scores_gemma":[0.78906786,8.9075877e-7,0.20805408,0.0006952529,0.00010057613,0.00018700202,0.000012817554,0.000019017176,0.0018624747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99736995,0.0000017346949,0.0005084822,0.00048503597,0.00093515305,0.00069964543],"domain_scores_gemma":[0.99730796,0.00007879947,0.00020350289,0.00030598117,0.0019092154,0.00019452674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019038913,0.00024087523,0.00021589908,0.0006622245,0.0002711942,0.00071570196,0.0015653938,0.00016798773,0.00000298419],"category_scores_gemma":[0.0021973865,0.00024020269,0.00006642042,0.0014386087,0.000020922642,0.002042868,0.0006216445,0.00018466562,0.00007437094],"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.0001306225,0.000041546053,0.00023287672,0.00012291936,0.000021220845,0.0000026591676,0.0069678803,0.000014651188,0.030427042,0.80167764,0.043942384,0.11641855],"study_design_scores_gemma":[0.001624101,0.0012650017,0.013504959,0.0005819978,0.000053076343,0.000056324665,0.003703251,0.09652493,0.5573244,0.142142,0.18118457,0.0020353836],"about_ca_topic_score_codex":0.000010572445,"about_ca_topic_score_gemma":0.000009128005,"teacher_disagreement_score":0.65953565,"about_ca_system_score_codex":0.00027775788,"about_ca_system_score_gemma":0.000026738375,"threshold_uncertainty_score":0.9795181},"labels":[],"label_agreement":null},{"id":"W2161365491","doi":"10.1109/icc.2004.1312746","title":"Distributed algorithms in service overlay networks: a game theoretic perspective","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stochastic game; Computer science; Overlay; Overlay network; Distributed computing; Perspective (graphical); Game theory; Node (physics); Distributed algorithm; Service (business); Mathematical optimization; Mathematics; Mathematical economics; Artificial intelligence; Engineering","score_opus":0.009281579690737013,"score_gpt":0.24366770583637498,"score_spread":0.23438612614563797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161365491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011412304,0.0001850056,0.95856893,0.025396109,0.00022405828,0.0003261326,0.000005235028,0.0012899585,0.002592246],"genre_scores_gemma":[0.9266026,0.00001982269,0.07121786,0.0019680008,0.0000574618,0.000051737432,0.0000043491236,0.000014057773,0.00006411759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981023,0.000043358566,0.00024330626,0.0006629251,0.00030197113,0.0006461484],"domain_scores_gemma":[0.9986333,0.000099931545,0.00005545355,0.0009111396,0.00018464247,0.00011548806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027547337,0.00023497058,0.00024835294,0.00019751996,0.000054676293,0.00016863392,0.0018154791,0.00014550476,0.000013313134],"category_scores_gemma":[0.00010895694,0.00020678755,0.00005394952,0.0029036514,0.0000745768,0.00036877807,0.00085228495,0.00032138967,0.0001155981],"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.000009109766,0.00010981686,0.00019678619,0.0000034607126,0.000016608168,0.0000969515,0.0012842623,0.13570966,0.000025606621,0.8570689,0.00072018674,0.0047586686],"study_design_scores_gemma":[0.0015707314,0.00027665056,0.012424775,0.0001251095,0.000009216474,0.000076647426,0.0014562923,0.49350646,0.0007786508,0.48723796,0.0016753814,0.0008621285],"about_ca_topic_score_codex":0.0006787663,"about_ca_topic_score_gemma":0.00065130333,"teacher_disagreement_score":0.9151903,"about_ca_system_score_codex":0.00055697653,"about_ca_system_score_gemma":0.00008761946,"threshold_uncertainty_score":0.84325516},"labels":[],"label_agreement":null},{"id":"W2162214767","doi":"10.1109/icme.2009.5202864","title":"A Cooperative video adaptation and streaming scheme for mobile and heterogeneous devices in a community network","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Bandwidth (computing); Adaptation (eye); Overlay; Distributed computing; Computer network; Scheme (mathematics); Mobile device; Peer-to-peer; Live streaming; Overlay network; Video streaming; Simple (philosophy); Resilience (materials science); Multimedia; The Internet; World Wide Web","score_opus":0.02664706975523297,"score_gpt":0.27183944247034103,"score_spread":0.24519237271510808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162214767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7575661,0.0005701955,0.24047104,0.00061442313,0.000021542624,0.00045619594,0.0000012240374,0.00020458548,0.00009470717],"genre_scores_gemma":[0.79359245,0.000020057581,0.20578009,0.0005109548,0.000011488395,0.00006383773,0.0000016886868,0.0000030038443,0.000016433274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992406,0.00006552832,0.0001543539,0.00022482606,0.00007366583,0.00024107512],"domain_scores_gemma":[0.9993165,0.00026574722,0.00003879142,0.00027314248,0.000058503534,0.00004727274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031349887,0.000116025396,0.00015759969,0.00007666536,0.00018855566,0.00015238844,0.00032882427,0.000060933107,4.9982077e-7],"category_scores_gemma":[0.000057204295,0.00010550206,0.000011975521,0.00034389464,0.000036245765,0.0002923927,0.00023310892,0.00013225857,6.643006e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051042225,0.00015621856,0.005124183,0.000030424693,0.000029194414,0.000012116744,0.0066695013,0.05446555,0.0009401887,0.018873235,0.0008040363,0.9128443],"study_design_scores_gemma":[0.00070458226,0.0014588332,0.012235136,0.000107823624,0.00000497389,0.000027386512,0.0010461905,0.971952,0.0013842137,0.009324761,0.0014050208,0.00034906765],"about_ca_topic_score_codex":0.00010353733,"about_ca_topic_score_gemma":0.0021744394,"teacher_disagreement_score":0.9174864,"about_ca_system_score_codex":0.000026023557,"about_ca_system_score_gemma":0.000016795415,"threshold_uncertainty_score":0.43022493},"labels":[],"label_agreement":null},{"id":"W2162271439","doi":"10.1109/tip.2010.2045035","title":"Cooperation Stimulation Strategies for Peer-to-Peer Wireless Live Video-Sharing Social Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless network; Wireless; Cheating; Computer network; Incentive; Quality of experience; The Internet; Video quality; Game theory; Bandwidth (computing); Quality (philosophy); Multimedia; Quality of service; World Wide Web; Telecommunications","score_opus":0.021318333442030667,"score_gpt":0.29396678211015975,"score_spread":0.2726484486681291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162271439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046583958,0.000009522907,0.94517803,0.0052201124,0.00096471416,0.00069806894,0.000012156754,0.001169019,0.00016440364],"genre_scores_gemma":[0.825392,9.687143e-7,0.17324708,0.00040386737,0.00024398716,0.00029748952,0.0000070238225,0.00004052197,0.00036702634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758434,0.000026640084,0.00041061334,0.0008097506,0.00056808733,0.00060059485],"domain_scores_gemma":[0.9978393,0.00012584554,0.00013177955,0.00046178765,0.001280645,0.00016066113],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005819031,0.00032798265,0.0002796251,0.00036908407,0.0012191336,0.0019027946,0.0010044848,0.00027101647,0.000014103904],"category_scores_gemma":[0.000054537635,0.0003495655,0.00010314817,0.0010276034,0.0000936415,0.0022729447,0.000019267527,0.00069036614,0.00003815329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008953796,0.00016929934,0.00000871455,0.00006639651,0.00003185164,0.000005304405,0.003989599,0.3426543,0.05911074,0.0017538829,0.0015849113,0.59053546],"study_design_scores_gemma":[0.00047156148,0.00015245698,0.00011518933,0.00007320132,0.000030372052,0.00000976453,0.00033162363,0.9700703,0.026018657,0.001734899,0.0004890469,0.00050292455],"about_ca_topic_score_codex":0.000025559337,"about_ca_topic_score_gemma":0.00022061294,"teacher_disagreement_score":0.77880806,"about_ca_system_score_codex":0.00011152362,"about_ca_system_score_gemma":0.00022846727,"threshold_uncertainty_score":0.99989563},"labels":[],"label_agreement":null},{"id":"W2162431292","doi":"10.1109/icsmc.1989.71415","title":"Software indexing for reuse","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Smalltalk; Computer science; Reuse; Software; Porting; Programming language; Class hierarchy; Software engineering; Operating system; Object-oriented programming; Engineering","score_opus":0.022442704739210808,"score_gpt":0.25648760526193753,"score_spread":0.23404490052272672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162431292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038127014,0.00004051615,0.98841345,0.0026257667,0.00024244004,0.00018924839,6.1258356e-7,0.0014575104,0.0032177758],"genre_scores_gemma":[0.0905225,0.0000013645098,0.9063208,0.0009951399,0.000015616553,0.000046690697,3.0488494e-7,0.0000069563466,0.0020906243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991618,0.000011375733,0.00011026051,0.00029203732,0.00012445917,0.0003001053],"domain_scores_gemma":[0.9986945,0.00012744869,0.00002382576,0.0010393899,0.00006179909,0.00005304806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022601038,0.000085839754,0.00009197746,0.00009567698,0.00008220093,0.000095031384,0.0014939454,0.00006433678,0.0000068623294],"category_scores_gemma":[0.001152209,0.00007593875,0.00003495056,0.000413568,0.000015688967,0.00020497419,0.00039591032,0.00006695829,0.0000551657],"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.0000023138543,0.00003091611,0.0019789557,0.000009011464,0.000012997263,0.0000073264823,0.00023878535,0.00042955685,0.00026052262,0.7062396,0.17415741,0.116632625],"study_design_scores_gemma":[0.00044080778,0.00018993898,0.0007164098,0.000023722598,0.0000037780317,0.000021743681,0.000052019175,0.005084649,0.02925931,0.28836903,0.6753451,0.0004934772],"about_ca_topic_score_codex":0.0000033339309,"about_ca_topic_score_gemma":0.000008531663,"teacher_disagreement_score":0.5011877,"about_ca_system_score_codex":0.000030894826,"about_ca_system_score_gemma":0.000034550154,"threshold_uncertainty_score":0.30966923},"labels":[],"label_agreement":null},{"id":"W2162433845","doi":"10.1162/1054746041422325","title":"End System Multicast Protocol for Collaborative Virtual Environments","year":2004,"lang":"en","type":"article","venue":"PRESENCE Virtual and Augmented Reality","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; IP multicast; Source-specific multicast; Protocol Independent Multicast; Pragmatic General Multicast; Xcast; Distributed computing; Protocol (science); Inter-domain; Scalability; Application layer; Reliable multicast; Software deployment; Operating system","score_opus":0.035420533202559557,"score_gpt":0.3012817380715596,"score_spread":0.26586120486900006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162433845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008066204,0.000009234408,0.91063106,0.0029921134,0.00019305089,0.076874614,0.00014951684,0.00061290927,0.00047132053],"genre_scores_gemma":[0.8135833,0.0000035449514,0.022247858,0.00018208228,0.00008201895,0.16340859,0.000010897509,0.00001955319,0.0004621479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99771243,0.00010128501,0.0003869984,0.0008136291,0.00046688644,0.00051874405],"domain_scores_gemma":[0.99868226,0.00018085756,0.00015255205,0.00068911165,0.000075837976,0.00021936823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046003467,0.00028166827,0.00029805567,0.000105229636,0.00031369558,0.0001857654,0.00093789917,0.00013271408,0.0000024832382],"category_scores_gemma":[0.00018159907,0.00023422948,0.00004947992,0.0004896802,0.00026624618,0.00049950526,0.00087926607,0.00016864396,0.000022297007],"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.0008365147,0.0014514999,0.0006935648,0.00030931906,0.0002653381,0.0001011172,0.004714865,0.014833994,0.029921627,0.7452191,0.005577966,0.1960751],"study_design_scores_gemma":[0.0368621,0.016443295,0.017422758,0.0028579931,0.00013849755,0.00019499323,0.014097277,0.19460034,0.36582807,0.026912885,0.3189841,0.0056577087],"about_ca_topic_score_codex":0.00008170687,"about_ca_topic_score_gemma":0.000025348218,"teacher_disagreement_score":0.88838315,"about_ca_system_score_codex":0.00019782034,"about_ca_system_score_gemma":0.00008509654,"threshold_uncertainty_score":0.9551601},"labels":[],"label_agreement":null},{"id":"W2162644896","doi":"10.4304/jmm.1.2.38-49","title":"A Cost-Effective Peer-to-Peer Architecture for Large-Scale On-Demand Media Streaming","year":2006,"lang":"en","type":"article","venue":"Journal of Multimedia","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Peer-to-peer; Architecture; On demand; Scale (ratio); Computer network; Distributed computing; Multimedia","score_opus":0.015686311882926778,"score_gpt":0.2794938965098616,"score_spread":0.2638075846269348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162644896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083290145,0.00017249511,0.891205,0.020955672,0.0020474985,0.0017147913,0.00006972245,0.00022922947,0.00031541561],"genre_scores_gemma":[0.338108,0.0000043797463,0.65854734,0.0009268424,0.0015282463,0.0001933461,0.000010257654,0.00004606393,0.00063554297],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674094,0.00008930611,0.00061249523,0.00046137546,0.0013291074,0.0007667879],"domain_scores_gemma":[0.99602544,0.0016707251,0.00038398468,0.00057444285,0.0010079192,0.00033750993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016109963,0.0003412512,0.0005692269,0.00071929797,0.00015183116,0.0001779156,0.0016654239,0.00021686377,0.0000069050575],"category_scores_gemma":[0.0021358468,0.0002720446,0.00025982596,0.0007031883,0.000052258776,0.00027286672,0.00033218277,0.00066781975,0.00004753806],"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.00036597648,0.0006275663,0.001994168,0.000033570344,0.00014847287,0.00024538275,0.008150402,0.026215997,0.0036157125,0.00083535,0.29529884,0.66246855],"study_design_scores_gemma":[0.010989462,0.0042089587,0.08786627,0.00085715536,0.00017462802,0.00053471385,0.0009852148,0.10679746,0.04268657,0.019800471,0.7231321,0.0019670476],"about_ca_topic_score_codex":0.000012162147,"about_ca_topic_score_gemma":0.00018223442,"teacher_disagreement_score":0.6605015,"about_ca_system_score_codex":0.00020302663,"about_ca_system_score_gemma":0.00009788925,"threshold_uncertainty_score":0.9999732},"labels":[],"label_agreement":null},{"id":"W2162646483","doi":"10.1109/ism.2006.41","title":"BM-ALM: An Application Layer Multicasting with Behavior Monitoring Approach","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; Backup; Scalability; Quality of service; Distributed computing; Bandwidth (computing); Network topology; Node (physics); Engineering; Operating system","score_opus":0.02688487057093377,"score_gpt":0.2663786390398739,"score_spread":0.23949376846894013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162646483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3155339,0.0000095028045,0.68021655,0.00013494193,0.000040572053,0.0002569481,2.9746914e-7,0.001227917,0.0025793964],"genre_scores_gemma":[0.555841,1.4762298e-7,0.44375896,0.000013618065,0.00007493931,0.00015586386,0.0000016438271,0.000008232706,0.00014556282],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986602,0.000015694934,0.00016596657,0.0005248818,0.00028543538,0.0003478166],"domain_scores_gemma":[0.9989469,0.000026750951,0.000054560474,0.0008208483,0.000084605635,0.00006632919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015928436,0.00014892669,0.00011848751,0.000112621565,0.00012627314,0.00017891265,0.0009610241,0.000074934615,7.98398e-7],"category_scores_gemma":[0.000008628087,0.0001216283,0.00001803093,0.00059697736,0.000033056185,0.00045262295,0.000269044,0.00013603535,0.000026819047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012173921,0.0008746735,0.2825187,0.000020398234,0.000015466132,0.00003349954,0.00048660266,0.024449285,0.041891802,0.059720445,0.0005737705,0.58940315],"study_design_scores_gemma":[0.0007189904,0.00033835394,0.2683047,0.000034331242,0.00003352906,0.000113577946,0.0004627541,0.63468677,0.09155031,0.0011090757,0.0014998363,0.0011477511],"about_ca_topic_score_codex":0.0002380106,"about_ca_topic_score_gemma":0.00001948911,"teacher_disagreement_score":0.6102375,"about_ca_system_score_codex":0.00005298772,"about_ca_system_score_gemma":0.00001570585,"threshold_uncertainty_score":0.4959858},"labels":[],"label_agreement":null},{"id":"W2162719103","doi":"10.1109/ccgrid.2002.1017191","title":"Invisible Network: Concepts and Architecture","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Service discovery; Service (business); Architecture; Quality of service; Overlay network; Computer network; Network architecture; The Internet; Resource (disambiguation); Telecommunications; World Wide Web; Web service; Business","score_opus":0.011192391296992043,"score_gpt":0.2498334808727116,"score_spread":0.23864108957571956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162719103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012393251,0.0005074953,0.944102,0.0043881675,0.00024523574,0.00016552063,3.1690487e-7,0.0009124716,0.037285533],"genre_scores_gemma":[0.4337858,0.000015678037,0.5619344,0.0026332855,0.00004065398,0.000012662115,2.6350995e-7,0.0000071413037,0.0015701129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893224,0.00004053137,0.00011453914,0.0003571166,0.00014780008,0.00040778486],"domain_scores_gemma":[0.999217,0.00008344247,0.00002468918,0.0005458732,0.00002739792,0.000101628444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022128904,0.00012319043,0.00013129368,0.00007006393,0.00009252541,0.00012551124,0.0006132105,0.00007460774,0.000017833225],"category_scores_gemma":[0.00008093418,0.00010102683,0.000020947231,0.000608529,0.00006486494,0.00012660031,0.00037426365,0.00014949187,0.00004524468],"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.0000014834328,0.0000122410065,0.002531509,0.000003918157,0.00001179645,0.000016245775,0.0002134866,0.0037540635,0.00014044174,0.7314018,0.07245932,0.18945369],"study_design_scores_gemma":[0.00040789662,0.00020118542,0.002655116,0.000028135157,0.0000043753384,0.00012068824,0.0000512025,0.0045857662,0.0037977328,0.21651056,0.771093,0.00054434483],"about_ca_topic_score_codex":0.000007138718,"about_ca_topic_score_gemma":0.000029356495,"teacher_disagreement_score":0.6986337,"about_ca_system_score_codex":0.0000130121425,"about_ca_system_score_gemma":0.00002533727,"threshold_uncertainty_score":0.41197544},"labels":[],"label_agreement":null},{"id":"W2162881450","doi":"10.1109/icoci.2006.5276416","title":"Security enhancements for a user-controlled lightpath provisioning system","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Canarie","keywords":"Computer science; Computer network; Provisioning; Computer security","score_opus":0.005150600761691321,"score_gpt":0.22342600865343104,"score_spread":0.21827540789173971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162881450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04908003,0.000083330364,0.9358695,0.0010979319,0.0004122651,0.0016303324,0.0000027217145,0.00201643,0.009807468],"genre_scores_gemma":[0.85414785,5.7341265e-7,0.14310189,0.0001263785,0.00009402029,0.00048836065,0.0000020666064,0.000010165113,0.0020287102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.000028304099,0.00037934078,0.0005396836,0.00032005628,0.0004948924],"domain_scores_gemma":[0.9988468,0.00012672225,0.000121287114,0.0006986067,0.00014799401,0.000058579517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045345825,0.00019011278,0.00035305944,0.0001631182,0.00018123306,0.00025967625,0.0012360205,0.000094282404,0.0000027390477],"category_scores_gemma":[0.00006722142,0.000147705,0.00010569501,0.0004349898,0.000015724545,0.00032340837,0.00044453985,0.00008336331,0.00005817439],"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.00012248883,0.00021087035,0.0006741132,0.00011144803,0.000059193095,0.000021962142,0.00021413712,0.0007296387,0.0041520107,0.93380535,0.04557174,0.014327073],"study_design_scores_gemma":[0.013828123,0.001159352,0.00083248486,0.00045340703,0.00005427103,0.000031014497,0.00028683222,0.7714743,0.102154106,0.03441511,0.0737509,0.001560097],"about_ca_topic_score_codex":0.00006146246,"about_ca_topic_score_gemma":0.000060742186,"teacher_disagreement_score":0.8993902,"about_ca_system_score_codex":0.00013443547,"about_ca_system_score_gemma":0.00005131971,"threshold_uncertainty_score":0.60232353},"labels":[],"label_agreement":null},{"id":"W2162906436","doi":"10.1109/jsac.2007.070122","title":"Diverse: application-layer service differentiation in peer-to-peer communications","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Scalability; Upload; Computer network; Multimedia; The Internet; Application layer; Differentiated services; Quality of service; Bandwidth (computing); Service (business); Server; Distributed computing; World Wide Web; Operating system","score_opus":0.050234549141776955,"score_gpt":0.3295456896473329,"score_spread":0.27931114050555594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162906436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20279543,0.00029080786,0.57360405,0.21489319,0.00058328966,0.0015410829,0.000027875441,0.00084558653,0.0054186936],"genre_scores_gemma":[0.89157027,0.00014707804,0.10537215,0.0024309799,0.00006439246,0.00015629373,0.00004735158,0.000029692032,0.00018179721],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9963254,0.0004185285,0.0010449362,0.0004720238,0.0010187023,0.00072045834],"domain_scores_gemma":[0.99015033,0.0012129004,0.000379564,0.005776823,0.0021732328,0.000307122],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002296743,0.00032018565,0.00036485563,0.001805728,0.00068272825,0.00033472592,0.010757617,0.00024447162,0.000007736118],"category_scores_gemma":[0.0009247114,0.00034141692,0.000074063035,0.007947541,0.0000903406,0.00060355786,0.0013539115,0.0018929136,0.00024491374],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031717692,0.008587003,0.15287213,0.000045684043,0.00036160176,0.0000700751,0.02529399,0.034841716,0.03289535,0.20641565,0.06098466,0.47731495],"study_design_scores_gemma":[0.0024558296,0.00034768498,0.7288331,0.0005415652,0.00004726697,0.00020521476,0.0015327323,0.117988914,0.0033842637,0.014433927,0.1286329,0.0015966342],"about_ca_topic_score_codex":0.00028151477,"about_ca_topic_score_gemma":0.01465951,"teacher_disagreement_score":0.6887748,"about_ca_system_score_codex":0.0009021367,"about_ca_system_score_gemma":0.00021525193,"threshold_uncertainty_score":0.9999038},"labels":[],"label_agreement":null},{"id":"W2163157713","doi":"10.1109/icme.2006.262625","title":"A Cross-Layered Peer-to-Peer Architecture for Wireless Mobile Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Architecture; Computer network; Peer-to-peer; Gossip; Wireless; Bandwidth (computing); Flexibility (engineering); Wireless network; Distributed computing; Wireless Application Protocol; Mobile computing; Gossip protocol; Computer architecture; Telecommunications; Operating system; Scalability","score_opus":0.010175798101354239,"score_gpt":0.2680437258103127,"score_spread":0.2578679277089585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163157713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06191494,0.00008301122,0.9194089,0.011092284,0.00071444915,0.0013949974,0.000021195261,0.0023624203,0.0030077714],"genre_scores_gemma":[0.7094081,0.0000011396343,0.26270515,0.0017051998,0.00045202032,0.0008383397,0.00002261205,0.000047598023,0.02481985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99627864,0.00003438108,0.00048678234,0.0011240426,0.0008402034,0.0012359408],"domain_scores_gemma":[0.9970681,0.00027942276,0.000102868165,0.0016256815,0.000692312,0.00023163142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066798355,0.00043147363,0.00043519845,0.00032847942,0.00029615994,0.0007721658,0.0031374993,0.000321252,0.000026586013],"category_scores_gemma":[0.00014294838,0.00037782,0.00019533793,0.0014504965,0.00010367353,0.0002775179,0.0011451828,0.0003637114,0.00011345588],"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.000045135595,0.00011935504,0.0010649964,0.000014625799,0.000028114207,0.000020741472,0.0001721336,0.53110105,0.0007992132,0.028018005,0.28318667,0.15542993],"study_design_scores_gemma":[0.001136913,0.00068737235,0.004643219,0.000045690053,0.000012767931,0.000052342366,0.000041645806,0.32120168,0.007938008,0.017237404,0.6457112,0.001291773],"about_ca_topic_score_codex":0.00019001716,"about_ca_topic_score_gemma":0.00043469213,"teacher_disagreement_score":0.65670377,"about_ca_system_score_codex":0.000113439484,"about_ca_system_score_gemma":0.00006792281,"threshold_uncertainty_score":0.9998674},"labels":[],"label_agreement":null},{"id":"W2163194490","doi":"10.1145/1101149.1101212","title":"Impact of incentive mechanisms on quality of experience","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Incentive; Computer science; Implementation; Context (archaeology); Quality (philosophy); Quality of experience; Rationality; Risk analysis (engineering); Process management; Human–computer interaction; Knowledge management; Quality of service; Computer network; Business; Software engineering; Microeconomics","score_opus":0.03938405749707853,"score_gpt":0.3553108671570815,"score_spread":0.31592680966000297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163194490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5600319,0.0000072978514,0.43718997,0.00035571362,0.000039909868,0.00008301191,0.0000022680238,0.00015070406,0.0021392358],"genre_scores_gemma":[0.8518305,0.0000020462692,0.14795609,0.00009561851,0.000006634432,0.0000066915863,1.9368197e-7,0.0000026654159,0.000099572004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988531,0.000037523456,0.0002869015,0.00026782678,0.00033949333,0.00021517779],"domain_scores_gemma":[0.998853,0.00009419465,0.00013560742,0.0007615412,0.0001053199,0.00005033441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000249099,0.000105187064,0.00021150513,0.00011980303,0.000022034079,0.000014447879,0.0012295513,0.000055357898,0.00003172093],"category_scores_gemma":[0.000114894734,0.00007998529,0.00008872772,0.00053143344,0.00006643209,0.0002417624,0.0004436629,0.00006971578,0.000023455756],"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.00003914004,0.00034446252,0.004075753,0.0000068936874,0.000035202018,0.00000159908,0.0032104326,0.0020640024,0.070771694,0.8179814,0.0013174039,0.100152016],"study_design_scores_gemma":[0.00037951916,0.0011050896,0.10257841,0.000039680366,0.0000020687276,0.0000017090492,0.000283123,0.010157588,0.8589192,0.026073365,0.00013677675,0.00032347036],"about_ca_topic_score_codex":0.00016880884,"about_ca_topic_score_gemma":0.000026227317,"teacher_disagreement_score":0.791908,"about_ca_system_score_codex":0.000080332684,"about_ca_system_score_gemma":0.000036955127,"threshold_uncertainty_score":0.32617056},"labels":[],"label_agreement":null},{"id":"W2163362805","doi":"10.1109/scc.2005.42","title":"Coordination and enterprise wide P2P computing","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Distributed computing; Software deployment; Middleware (distributed applications); Distributed design patterns; Peer-to-peer; Distributed algorithm; Software engineering","score_opus":0.008154471452629406,"score_gpt":0.23495286862737633,"score_spread":0.22679839717474692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163362805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17190434,0.00007682292,0.8021561,0.020351324,0.00008988132,0.00008833105,1.5523828e-7,0.0008552149,0.0044778166],"genre_scores_gemma":[0.75740796,0.000003319299,0.24091381,0.0011012556,0.000030397452,0.0000018052858,2.6182596e-7,0.000002948571,0.0005382489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992741,0.0000134820875,0.00012252097,0.0002591113,0.00013076964,0.00020002654],"domain_scores_gemma":[0.99948925,0.00008921434,0.000031256906,0.00030484205,0.000033438606,0.00005199864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017684672,0.00008068628,0.000083882165,0.000108893975,0.00007259362,0.00012993084,0.0005178872,0.00003907203,0.000004033192],"category_scores_gemma":[0.000062203035,0.00007422026,0.000014472438,0.00022169446,0.000025065026,0.00030229302,0.0006150515,0.00007314261,0.000064906235],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012409957,0.000022583605,0.0063333646,0.0000024468386,0.0000057899933,0.0000041527496,0.00039684237,0.0006609233,0.0003925053,0.02533872,0.032835215,0.9340062],"study_design_scores_gemma":[0.00033737646,0.00008821834,0.018593702,0.000030851872,0.0000023464804,0.000028840466,0.00006681398,0.8905882,0.0063757026,0.0040343427,0.079542644,0.00031090467],"about_ca_topic_score_codex":0.00001343037,"about_ca_topic_score_gemma":0.000027251066,"teacher_disagreement_score":0.9336953,"about_ca_system_score_codex":0.00003474813,"about_ca_system_score_gemma":0.000008357577,"threshold_uncertainty_score":0.30266145},"labels":[],"label_agreement":null},{"id":"W2163628887","doi":"10.1007/s10723-008-9113-0","title":"Beyond Music Sharing: An Evaluation of Peer-to-Peer Data Dissemination Techniques in Large Scientific Collaborations","year":2008,"lang":"en","type":"article","venue":"Journal of Grid Computing","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 British Columbia","funders":"","keywords":"Computer science; Provisioning; Peer-to-peer; Dissemination; Incentive; Data sharing; Distributed computing; Fault tolerance; Bandwidth (computing); Load balancing (electrical power); Data science; Computer network; Telecommunications","score_opus":0.10166859175382205,"score_gpt":0.36346876694512426,"score_spread":0.2618001751913022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163628887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7491351,0.00008462908,0.24652854,0.0026738504,0.0009215753,0.0003301851,0.000018836576,0.000108896966,0.0001984193],"genre_scores_gemma":[0.8271491,0.00000188387,0.17248385,0.00005974145,0.00021478407,0.000003221152,0.00002770775,0.000010229776,0.000049505907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958029,0.00014992991,0.0009142996,0.00050999055,0.0022710073,0.0003518875],"domain_scores_gemma":[0.9935867,0.00014547724,0.0006506671,0.0012334539,0.0042599766,0.0001237334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011054874,0.00016034374,0.0003215967,0.0013110605,0.00031827192,0.00029693395,0.0032703162,0.00009123549,0.000004646064],"category_scores_gemma":[0.0020396023,0.0001591488,0.00004414518,0.0034672585,0.00006790369,0.001592698,0.00145005,0.00033234843,0.0000037083796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070395545,0.0021914046,0.06726493,0.00007837964,0.00012593534,0.00020142713,0.03294738,0.07380247,0.053090528,0.01290043,0.21583186,0.54149485],"study_design_scores_gemma":[0.00054549216,0.0003955389,0.05050634,0.00038242465,0.000034829252,0.00018980724,0.00061635626,0.92505115,0.014980608,0.0030024543,0.0039306013,0.00036442687],"about_ca_topic_score_codex":0.000008562978,"about_ca_topic_score_gemma":0.00010037071,"teacher_disagreement_score":0.8512487,"about_ca_system_score_codex":0.00024210691,"about_ca_system_score_gemma":0.00042075722,"threshold_uncertainty_score":0.64899},"labels":[],"label_agreement":null},{"id":"W2163801947","doi":"10.1109/p2p.2008.35","title":"CliqueStream: An Efficient and Fault-Resilient Live Streaming Network on a Clustered Peer-to-Peer Overlay","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Overlay; Computer science; Computer network; Overlay network; Robustness (evolution); Distributed computing; Locality; Fault tolerance; Redundancy (engineering); Peer-to-peer; Exploit; Operating system; The Internet","score_opus":0.02324268495598053,"score_gpt":0.2827185691821755,"score_spread":0.259475884226195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163801947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7336675,0.00030449047,0.23005195,0.016971555,0.0028463614,0.0031917403,0.00010520931,0.004941945,0.00791926],"genre_scores_gemma":[0.79319024,0.00010463746,0.19802259,0.002565653,0.0005488807,0.00029223616,0.000087058914,0.00011238283,0.005076336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99171394,0.00022178495,0.0009561095,0.0032521607,0.0022121067,0.001643871],"domain_scores_gemma":[0.9933297,0.00039370276,0.00038580675,0.004203437,0.0008283644,0.0008589606],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010079298,0.001207367,0.0011065392,0.0007128108,0.00042226634,0.001132067,0.004319428,0.0009492306,0.000014643235],"category_scores_gemma":[0.0005562322,0.0011089036,0.0002356389,0.00094817823,0.0001894969,0.00024945894,0.010555863,0.0016216898,0.00027616313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009918105,0.00045246305,0.00073766906,0.000047902206,0.000110927474,0.00026865152,0.0035712258,0.79515845,0.000019474426,0.005060433,0.08947719,0.10499644],"study_design_scores_gemma":[0.0013713386,0.0033342296,0.01500079,0.0016402849,0.00008276397,0.00022623644,0.00066146447,0.9165607,0.00082231977,0.005893905,0.049947444,0.0044584884],"about_ca_topic_score_codex":0.0004364983,"about_ca_topic_score_gemma":0.00023482773,"teacher_disagreement_score":0.12140229,"about_ca_system_score_codex":0.0005275533,"about_ca_system_score_gemma":0.00029353742,"threshold_uncertainty_score":0.9999049},"labels":[],"label_agreement":null},{"id":"W2164485427","doi":"10.1109/mnet.2007.334311","title":"Video-on-Demand Networks: Design Approaches and Future Challenges","year":2007,"lang":"en","type":"article","venue":"IEEE Network","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scope (computer science); Video on demand; Peer-to-peer; On demand; Scalability; Network planning and design; Systems design; Telecommunications; Computer network; Multimedia","score_opus":0.05255701149944859,"score_gpt":0.2409562709058612,"score_spread":0.1883992594064126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164485427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001991883,0.017980162,0.960197,0.007843604,0.00543151,0.00059297704,5.4741594e-7,0.001357819,0.00460454],"genre_scores_gemma":[0.6965726,0.0051985616,0.264222,0.0032242707,0.030261448,0.00013430681,0.0000024527071,0.00010321001,0.00028115534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997058,0.00012740341,0.00035145905,0.00093376584,0.00039588494,0.0011335037],"domain_scores_gemma":[0.9977751,0.00064590055,0.00011966895,0.0011430517,0.000050141734,0.0002661796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019968327,0.00039860618,0.00039084183,0.00016963073,0.00028261056,0.00018931327,0.0013971347,0.00036901046,0.0000012362108],"category_scores_gemma":[0.0000279571,0.00035368727,0.00006977702,0.00090854306,0.00011986774,0.0002695849,0.00036003222,0.0004802931,0.000037549034],"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.00012229617,0.00007652834,0.00022113946,0.000018869423,0.000083018625,0.00011886721,0.0006956564,0.18915677,0.0000116041165,0.044332165,0.14778015,0.61738294],"study_design_scores_gemma":[0.002155028,0.0025857722,0.029205699,0.0005339469,0.00008777055,0.00034818685,0.0006271591,0.19386636,0.0014530638,0.12815101,0.63712907,0.0038569407],"about_ca_topic_score_codex":0.0000017906941,"about_ca_topic_score_gemma":0.000022856171,"teacher_disagreement_score":0.69597495,"about_ca_system_score_codex":0.00005672164,"about_ca_system_score_gemma":0.000024604513,"threshold_uncertainty_score":0.9998915},"labels":[],"label_agreement":null},{"id":"W2164580472","doi":"10.1109/iwqos.2010.5542713","title":"Exploring BitTorrent peer distribution via hybrid PlanetLab-Internet measurement","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"PlanetLab; BitTorrent; BitTorrent tracker; Computer science; Scalability; The Internet; Peer-to-peer; Computer network; Key (lock); Distributed computing; World Wide Web; Computer security","score_opus":0.08915928998745853,"score_gpt":0.23553900361201027,"score_spread":0.14637971362455174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164580472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14308931,0.000016658567,0.84734946,0.0043898467,0.0026225974,0.00019292533,0.000006702558,0.0014615153,0.0008710115],"genre_scores_gemma":[0.97906095,0.0000032695373,0.020161666,0.00013643327,0.0001454489,0.00008111168,0.000021911128,0.000009695278,0.00037952058],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770755,0.00002047054,0.00025107144,0.0005204342,0.0010173171,0.0004831802],"domain_scores_gemma":[0.99857944,0.000028637634,0.000057932444,0.00090335944,0.000276731,0.00015388745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068083557,0.00020297775,0.0001618067,0.000105451894,0.00007360754,0.00021523744,0.0015086,0.00005072386,0.00003601572],"category_scores_gemma":[0.00017457058,0.00017638637,0.000052899264,0.00030751567,0.000036916324,0.0005178539,0.00072604086,0.00034988584,0.0004822853],"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.000020890828,0.00025391203,0.0029621352,0.000019834617,0.00007487055,0.000089751346,0.00037061333,0.00029549166,0.03022711,0.06897334,0.341305,0.55540705],"study_design_scores_gemma":[0.00044369273,0.0002554694,0.016616493,0.00004611182,0.000013045972,0.00011525701,0.00003086113,0.05644688,0.30824625,0.0026527983,0.6142772,0.0008559493],"about_ca_topic_score_codex":0.00013704602,"about_ca_topic_score_gemma":0.0001948024,"teacher_disagreement_score":0.83597165,"about_ca_system_score_codex":0.00013963049,"about_ca_system_score_gemma":0.000032504886,"threshold_uncertainty_score":0.71928275},"labels":[],"label_agreement":null},{"id":"W2164725579","doi":"","title":"The ACORN multi-agent system","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; National Research Council Canada","funders":"","keywords":"Acorn; Computer science; World Wide Web; Intelligent agent; Mobile agent; Distributed computing; Artificial intelligence","score_opus":0.021929914883416276,"score_gpt":0.23814645781790864,"score_spread":0.21621654293449236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164725579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003183971,0.00020356657,0.97512627,0.0023509155,0.0008263517,0.000206873,2.6263206e-7,0.0016286738,0.0164731],"genre_scores_gemma":[0.7877274,0.0000067297156,0.20657168,0.00030232844,0.000015221567,0.000039026574,6.9261056e-8,0.0000059767135,0.005331574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899936,0.000051076633,0.00014420295,0.00026665677,0.00020243682,0.00033623996],"domain_scores_gemma":[0.9987639,0.00009580508,0.000032140506,0.0009968682,0.000050042414,0.00006121491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040764682,0.00009839088,0.00008461088,0.000041897514,0.00021779435,0.00019942838,0.0015436715,0.000047364727,0.000002242893],"category_scores_gemma":[0.00010449923,0.00005845817,0.000036394715,0.00042901398,0.000031572898,0.00009877921,0.00034791298,0.0000918091,0.0005405065],"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":[6.675348e-7,0.00002024973,0.00041784858,0.000004603392,0.000013718608,0.000017538012,0.00010446772,0.00028007614,0.00022006716,0.92229205,0.02999974,0.046628952],"study_design_scores_gemma":[0.0005121325,0.00012825525,0.0032267524,0.00004492414,0.00000733196,0.00011424045,0.0009754913,0.13137192,0.019403951,0.0024503889,0.8411524,0.0006121985],"about_ca_topic_score_codex":0.0000103977045,"about_ca_topic_score_gemma":0.000033110526,"teacher_disagreement_score":0.9198417,"about_ca_system_score_codex":0.00007333526,"about_ca_system_score_gemma":0.000027244927,"threshold_uncertainty_score":0.6947298},"labels":[],"label_agreement":null},{"id":"W2164768159","doi":"","title":"Mobile P2P: Data Retrieval and Caching","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Distributed computing; Mobile computing; Computer network; Overlay network; Overlay; Network topology; Peer-to-peer; Bandwidth (computing); Mobile database; Mobile device; Mobile Web; Mobile technology; The Internet; Mobile station; World Wide Web; Database; Base station","score_opus":0.030535040957431255,"score_gpt":0.28567620326095844,"score_spread":0.2551411623035272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164768159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11956342,0.00085110706,0.85643786,0.009087722,0.00024436958,0.000294686,0.0000081737335,0.0022251445,0.01128752],"genre_scores_gemma":[0.6767082,0.000025497875,0.32142684,0.00069382763,0.000071849514,0.0000025857678,0.0000026330174,0.0000047420917,0.0010638165],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989967,0.000014409315,0.000119247445,0.00044907667,0.00017956668,0.00024105461],"domain_scores_gemma":[0.99831283,0.000054620043,0.000022797321,0.001522051,0.00001990635,0.00006778067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003474571,0.00008736239,0.00009554394,0.000077575896,0.00007840816,0.00016461722,0.002202217,0.00005238665,0.000009140654],"category_scores_gemma":[0.00009282698,0.00007494657,0.000008729069,0.00033253795,0.000031994827,0.0007084068,0.0032143183,0.00012847173,0.00008804026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006816268,0.00003821148,0.0005909802,0.00000481745,0.000013697216,0.000015393613,0.0003994723,0.00086818734,0.0012588273,0.019618336,0.10067192,0.87651336],"study_design_scores_gemma":[0.00025060272,0.0001565504,0.0012667666,0.000014534091,0.000004843526,0.00005945173,0.000061141924,0.37243727,0.004977807,0.002087815,0.61831963,0.0003636145],"about_ca_topic_score_codex":0.00002192009,"about_ca_topic_score_gemma":0.0000432328,"teacher_disagreement_score":0.8761497,"about_ca_system_score_codex":0.000022630531,"about_ca_system_score_gemma":0.000019187642,"threshold_uncertainty_score":0.40923035},"labels":[],"label_agreement":null},{"id":"W2164871650","doi":"10.1109/nca.2008.55","title":"Improving Efficiency and Performance of Distributed File-Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Replication (statistics); Server; File server; Distributed computing; Fault tolerance; Overlay; Workstation; Middleware (distributed applications); Operating system; Overlay network; Computer network; Self-certifying File System; Erasure code; Distributed data store; Routing (electronic design automation); High availability; File system; Decoding methods; The Internet","score_opus":0.012178856564771981,"score_gpt":0.194678831283119,"score_spread":0.182499974718347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164871650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54440624,0.00010627834,0.4542354,0.00013721017,0.000106983505,0.00011132227,0.000015782438,0.00036211504,0.00051867275],"genre_scores_gemma":[0.97871435,0.0000136038325,0.020950435,0.000023031205,0.000012228015,0.000012876922,0.0000029895843,0.0000033109268,0.00026719805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911493,0.000010368348,0.00018812779,0.00025233102,0.00019343235,0.00024080287],"domain_scores_gemma":[0.9992853,0.0000684624,0.0000671411,0.00045719478,0.00007026153,0.000051643616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012065723,0.00009292125,0.00014550825,0.00009063644,0.000100033045,0.000030600422,0.00069270114,0.000050187395,0.000006740467],"category_scores_gemma":[0.00007958826,0.0000761663,0.000016974755,0.0005524257,0.000083685474,0.00022110017,0.00048049196,0.000073529496,0.000012212747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085092666,0.0006474468,0.18180943,0.00069603784,0.0001050804,0.00019657353,0.0033760346,0.037088208,0.018158732,0.064209715,0.22944775,0.4641799],"study_design_scores_gemma":[0.00016594345,0.00033086468,0.026358666,0.000031762887,0.0000016813898,0.00009857283,0.00002954025,0.9661596,0.00469818,0.000022770368,0.0018992205,0.00020323305],"about_ca_topic_score_codex":0.00006840094,"about_ca_topic_score_gemma":0.0000019581048,"teacher_disagreement_score":0.92907137,"about_ca_system_score_codex":0.000019238558,"about_ca_system_score_gemma":0.000032351043,"threshold_uncertainty_score":0.31059718},"labels":[],"label_agreement":null},{"id":"W2164888355","doi":"","title":"Linking and Navigating Data in a P2P File-Sharing Network","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Publication; Data sharing; World Wide Web; File sharing; Data publishing; Scheme (mathematics); Publishing; Computer network; Database; The Internet; Business; Advertising","score_opus":0.036430799992315153,"score_gpt":0.29181658250434966,"score_spread":0.25538578251203453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164888355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18056586,0.0011971744,0.78444785,0.0187704,0.00043187264,0.0005867348,0.000014564245,0.0035170587,0.010468484],"genre_scores_gemma":[0.48141527,0.00001154436,0.51713103,0.0012422325,0.00010019539,0.0000047021,0.0000151392105,0.0000050149456,0.000074903706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852514,0.0000145385775,0.00021714003,0.0006271105,0.00017052476,0.00044552618],"domain_scores_gemma":[0.9983834,0.00013156576,0.000047404556,0.001363332,0.000017022956,0.000057259527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052657694,0.000121704805,0.00015280723,0.00005975625,0.00009363457,0.00027958458,0.0025639732,0.00007441914,0.000009545374],"category_scores_gemma":[0.00014370908,0.00011644148,0.000010317107,0.00086678733,0.000018411218,0.0006017703,0.0031374171,0.0003188805,0.000013486381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015373753,0.000014582433,0.012451443,0.000004931046,0.0000035891226,0.00005156982,0.00027095375,0.0022999365,0.00006828054,0.016123066,0.009879284,0.95883083],"study_design_scores_gemma":[0.00020223446,0.00007637798,0.030006822,0.00058005337,0.0000020225182,0.000031983276,0.00003945904,0.911948,0.00009273979,0.051048696,0.005602402,0.0003691831],"about_ca_topic_score_codex":0.00004364764,"about_ca_topic_score_gemma":0.00011705093,"teacher_disagreement_score":0.95846164,"about_ca_system_score_codex":0.000024572677,"about_ca_system_score_gemma":0.000015438527,"threshold_uncertainty_score":0.4764543},"labels":[],"label_agreement":null},{"id":"W2164888948","doi":"10.1109/iscas.2009.5117855","title":"Streaming capacity in P2P VoD systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Live streaming; Bandwidth (computing); Real Time Streaming Protocol; Computer network; Upper and lower bounds; Video streaming; Video on demand; The Internet; Peer-to-peer; Decomposition; Streaming current; Distributed computing; Mathematics; World Wide Web","score_opus":0.034142471266333276,"score_gpt":0.2335123286749859,"score_spread":0.19936985740865262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164888948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43285358,0.00013984882,0.5247724,0.0056915707,0.00045840046,0.00030300484,8.1981625e-7,0.0019966066,0.03378379],"genre_scores_gemma":[0.94873625,0.0000023104956,0.050488066,0.0002965976,0.000027040147,0.000006990639,2.192757e-7,0.0000025798115,0.00043995443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893457,0.000024648625,0.00018076923,0.0003173808,0.00020234477,0.0003402645],"domain_scores_gemma":[0.99921113,0.00004071782,0.000031183197,0.000630991,0.00003153103,0.00005446688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023515632,0.000106852574,0.00015003537,0.00019174538,0.000035809764,0.00013838246,0.0011031269,0.00007634877,0.0000014692457],"category_scores_gemma":[0.00005730199,0.00009405844,0.000021611457,0.0007374981,0.000015859212,0.00028233425,0.00018679435,0.00013822038,0.000068345944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031607576,0.00014654637,0.006442445,0.000012956651,0.000009329401,0.000106497944,0.00080775924,0.006590754,0.0026095435,0.5783594,0.016415568,0.388496],"study_design_scores_gemma":[0.001223298,0.00088906666,0.23610878,0.0003840348,0.0000070392425,0.00015895831,0.00064805563,0.6596027,0.016095096,0.055587173,0.027411932,0.0018838904],"about_ca_topic_score_codex":0.00022493393,"about_ca_topic_score_gemma":0.00015865627,"teacher_disagreement_score":0.6530119,"about_ca_system_score_codex":0.00008717182,"about_ca_system_score_gemma":0.000017609955,"threshold_uncertainty_score":0.3835592},"labels":[],"label_agreement":null},{"id":"W2165458239","doi":"10.1007/978-3-7091-1538-1_13","title":"From Increased Availability to Increased Productivity: How Researchers Benefit from Online Resources","year":2013,"lang":"en","type":"book-chapter","venue":"","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 Calgary","funders":"","keywords":"Microblogging; World Wide Web; Social media; Computer science; Productivity; Data science; Web 2.0; Web intelligence; Web service; Web development","score_opus":0.04939347545445855,"score_gpt":0.25875139120439805,"score_spread":0.2093579157499395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165458239","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62896395,0.0017382137,0.022914777,0.14552161,0.0014321939,0.0082888035,0.0040993607,0.010895468,0.17614561],"genre_scores_gemma":[0.0578005,0.000054732067,0.45445684,0.0028265365,0.0024440042,0.00032840628,0.00069567276,0.0002841478,0.48110914],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9924432,0.00017401874,0.0006975429,0.0035882841,0.001959762,0.0011371936],"domain_scores_gemma":[0.99000657,0.0012574062,0.0003357559,0.00671202,0.00074418366,0.00094409625],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001106162,0.0010682738,0.0013134675,0.0008377863,0.0002260741,0.0010164548,0.0067159045,0.0010214503,0.0010646182],"category_scores_gemma":[0.001961245,0.0009722527,0.00027276968,0.0005381709,0.00039564774,0.000703498,0.0061484943,0.0015855742,0.0020121187],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041628018,0.0006552874,0.0016413056,0.00008274605,0.0010517635,0.00025718895,0.0017994896,0.000086114545,0.0048903557,0.037146565,0.49424213,0.45773077],"study_design_scores_gemma":[0.0007552712,0.0005756248,0.011973019,0.0005284422,0.00008829901,0.000004787985,0.00011856988,0.0021683332,0.002813729,0.2328392,0.7455498,0.0025849254],"about_ca_topic_score_codex":0.034667946,"about_ca_topic_score_gemma":0.007055145,"teacher_disagreement_score":0.5711634,"about_ca_system_score_codex":0.0006214717,"about_ca_system_score_gemma":0.00030361657,"threshold_uncertainty_score":0.99984854},"labels":[],"label_agreement":null},{"id":"W2165611534","doi":"10.1109/icdcs.2010.86","title":"Publisher Placement Algorithms in Content-Based Publish/Subscribe","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; PlanetLab; Testbed; Exploit; Computer network; Scheduling (production processes); Distributed computing; BitTorrent; Publication; Load balancing (electrical power); Content delivery network; Algorithm; Peer-to-peer; Server; Scalability; Mathematical optimization; Operating system","score_opus":0.03457674618963852,"score_gpt":0.2468603760444202,"score_spread":0.2122836298547817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165611534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07071886,0.000045155153,0.7980644,0.08286372,0.0060076634,0.0009099114,0.0000031294155,0.0032228685,0.03816428],"genre_scores_gemma":[0.47799674,8.081196e-7,0.5120337,0.0051828343,0.000077885044,0.000183839,0.000008094633,0.000020502654,0.0044955797],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977102,0.000032472304,0.00035125765,0.0006731924,0.00054145994,0.0006913917],"domain_scores_gemma":[0.9980905,0.00010153136,0.00006726599,0.0013565089,0.00019824853,0.00018595961],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007895392,0.00022000159,0.00022617343,0.0005332227,0.00006125818,0.0011277554,0.002898387,0.0001923284,0.00010252833],"category_scores_gemma":[0.00039776764,0.00018922206,0.00005855043,0.0013966681,0.000074885684,0.0016044215,0.0008053459,0.0005517659,0.00014171163],"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.00001762309,0.00046625428,0.01857695,0.000010389748,0.000028975226,0.000092607996,0.0002165219,0.00038167415,0.005071455,0.12619168,0.6341967,0.21474919],"study_design_scores_gemma":[0.00789761,0.00092379545,0.06622102,0.00009742921,0.00001881668,0.00005528989,0.00087831885,0.2991307,0.0383628,0.021682264,0.5613896,0.0033423076],"about_ca_topic_score_codex":0.0002737643,"about_ca_topic_score_gemma":0.001374032,"teacher_disagreement_score":0.40727788,"about_ca_system_score_codex":0.00008032055,"about_ca_system_score_gemma":0.00012897735,"threshold_uncertainty_score":0.99990916},"labels":[],"label_agreement":null},{"id":"W2165799071","doi":"10.1109/soca.2007.34","title":"On the Emergence of an Application-Oriented Network Architecture","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software deployment; Architecture; Mainstream; Service-oriented architecture; Applications architecture; Service (business); Next-generation network; Perspective (graphical); Service provider; Reference architecture; Telecommunications; Software engineering; Software architecture; World Wide Web; The Internet; Software; Web service; Artificial intelligence; Business","score_opus":0.008260939535422505,"score_gpt":0.24577313102295073,"score_spread":0.23751219148752822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165799071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050649185,0.000019960311,0.9385287,0.003679943,0.0001491102,0.00024280824,5.422246e-7,0.00041822443,0.0063115167],"genre_scores_gemma":[0.8409129,0.0000014012563,0.15775013,0.0011118795,0.00006287867,0.000019421821,9.868968e-7,0.00000521346,0.00013519172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888116,0.000024450885,0.00019475156,0.00030497496,0.000283968,0.00031071046],"domain_scores_gemma":[0.9983246,0.00022335889,0.00006745829,0.0012529453,0.000070493545,0.0000611888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069577,0.00010277688,0.00009461665,0.0000707669,0.00009756058,0.000017102731,0.0017508417,0.00005608583,0.00001756665],"category_scores_gemma":[0.00007165076,0.000064856715,0.000031198862,0.0013276865,0.00006183692,0.000063458865,0.00029977012,0.00015442453,0.00003300989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007455585,0.000035281795,0.00024121544,0.0000012231485,0.0000062590702,0.000001374336,0.0001583448,0.012746008,0.00056256587,0.8371619,0.01040651,0.13867188],"study_design_scores_gemma":[0.00040290027,0.0012497094,0.038013313,0.000070930524,0.000013197752,0.000027321474,0.00041775036,0.17330444,0.06894956,0.61205655,0.10443527,0.0010590492],"about_ca_topic_score_codex":0.000024655881,"about_ca_topic_score_gemma":0.00013984153,"teacher_disagreement_score":0.7902637,"about_ca_system_score_codex":0.0000092504215,"about_ca_system_score_gemma":0.00001390997,"threshold_uncertainty_score":0.32535285},"labels":[],"label_agreement":null},{"id":"W2165862274","doi":"10.1109/nof.2015.7333294","title":"The assessment of BitTorrent's performance using SDN in a Mesh topology","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"BitTorrent; Computer science; Computer network; Topology (electrical circuits); Network topology; Distributed computing; Peer-to-peer","score_opus":0.057465542301178604,"score_gpt":0.3455538093384805,"score_spread":0.2880882670373019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165862274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63734174,0.00036458788,0.34728453,0.004448341,0.0026624997,0.00064863055,0.000002810365,0.00042705896,0.0068197977],"genre_scores_gemma":[0.81784433,0.00006872118,0.18176179,0.000064881264,0.00004116868,0.000047789203,0.000001078644,0.000008642938,0.00016160087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797183,0.00010444268,0.00048599436,0.0005507651,0.00043061434,0.0004563457],"domain_scores_gemma":[0.99766487,0.0001298797,0.00024451863,0.0017044493,0.00019692189,0.000059361675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012309988,0.00023843748,0.00040241962,0.0002989929,0.00006831826,0.000112593414,0.0036137274,0.00027433655,0.0000034131692],"category_scores_gemma":[0.00008311964,0.00016906932,0.0000641226,0.00053890323,0.00015875633,0.00009258143,0.00758382,0.0006804977,0.0000052280966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002254356,0.0003125124,0.076384656,0.00024972516,0.00017433455,0.00004366053,0.0014851029,0.4085391,0.00042114762,0.2501394,0.015443131,0.24678473],"study_design_scores_gemma":[0.00014358165,0.00007513262,0.009567073,0.00011644187,0.0000058300743,0.00000968504,0.00007633205,0.9791903,0.00044668,0.008438558,0.0016692607,0.0002611239],"about_ca_topic_score_codex":0.0002458516,"about_ca_topic_score_gemma":0.00018728495,"teacher_disagreement_score":0.57065123,"about_ca_system_score_codex":0.00035630827,"about_ca_system_score_gemma":0.00062375364,"threshold_uncertainty_score":0.94526887},"labels":[],"label_agreement":null},{"id":"W2166042493","doi":"10.1109/icdcs.2011.82","title":"Green Resource Allocation Algorithms for Publish/Subscribe Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Publication; Testbed; Middleware (distributed applications); Workload; Distributed computing; Resource allocation; Message passing; Computer network; Operating system","score_opus":0.07213349900972417,"score_gpt":0.25188073262361177,"score_spread":0.1797472336138876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166042493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007190831,0.00010170007,0.97411984,0.0044043893,0.00052267493,0.0006158665,0.0000032229934,0.0018556215,0.017657572],"genre_scores_gemma":[0.2565433,0.0000037130974,0.72663146,0.0011818093,0.00025733327,0.0005271016,0.000013465435,0.000032945583,0.01480887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984821,0.000030190176,0.00026398615,0.00050951133,0.00028246082,0.00043172692],"domain_scores_gemma":[0.9984485,0.000070080365,0.000082108774,0.0010717739,0.00021675685,0.00011080197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055534375,0.0001532573,0.0001707387,0.00021889311,0.00010491711,0.000271345,0.0022405325,0.00013086027,0.000005446306],"category_scores_gemma":[0.000105305946,0.0001339389,0.00005219821,0.0006633357,0.00003635772,0.0007334439,0.000514075,0.00009759978,0.00008281881],"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.000011618656,0.00008558776,0.00035370773,0.00003458871,0.000044815068,0.0000073656292,0.0013736467,0.00012423395,0.00019040551,0.52865326,0.24917203,0.21994874],"study_design_scores_gemma":[0.00064058765,0.0005617026,0.0032796122,0.00005728111,0.000018017601,0.00004887375,0.00062190136,0.34941313,0.0044668866,0.020142173,0.61988515,0.00086466834],"about_ca_topic_score_codex":0.00051830424,"about_ca_topic_score_gemma":0.0000614248,"teacher_disagreement_score":0.50851107,"about_ca_system_score_codex":0.00004669071,"about_ca_system_score_gemma":0.00003587431,"threshold_uncertainty_score":0.546187},"labels":[],"label_agreement":null},{"id":"W2166090968","doi":"10.1109/iscc.2011.5984033","title":"Hierarchically distributed tree","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Tree (set theory); Tree structure; Fractal tree index; Distributed computing; Overlay; Routing (electronic design automation); Node (physics); Routing table; Table (database); Hierarchical database model; Data structure; Interval tree; Computer network; Data mining; Routing protocol; Mathematics; Database","score_opus":0.031605647809147305,"score_gpt":0.22284526952192607,"score_spread":0.19123962171277875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166090968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007836668,0.0000116072615,0.9315777,0.0037144073,0.00014863317,0.00009242728,0.000002346731,0.0018873536,0.054728877],"genre_scores_gemma":[0.5730062,0.0000017115339,0.4256271,0.0005769984,0.000016310003,0.000014176094,0.0000016211819,0.0000044398084,0.00075141725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900967,0.000017621442,0.0001413828,0.0003206736,0.00017932837,0.0003313498],"domain_scores_gemma":[0.9989434,0.000037186233,0.00002351615,0.00084070646,0.00004648845,0.00010874312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012578761,0.00010420904,0.00010914201,0.00009461574,0.000051643165,0.0000542927,0.0019583842,0.00006581763,0.000046364643],"category_scores_gemma":[0.000078986144,0.00008384191,0.000038086313,0.0006255791,0.000050227663,0.00018808318,0.00081677304,0.00012652251,0.0003828318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062654863,0.00007817399,0.0016007012,0.0000017655357,0.000014798714,0.000050474522,0.00029194014,0.000007419056,0.00038068407,0.641902,0.04852614,0.3071396],"study_design_scores_gemma":[0.00087245967,0.0009853366,0.26315773,0.000035637473,0.000013080134,0.000086296786,0.00007239676,0.03076797,0.042474803,0.49840733,0.16167457,0.001452399],"about_ca_topic_score_codex":0.000027661787,"about_ca_topic_score_gemma":0.000048212427,"teacher_disagreement_score":0.5651696,"about_ca_system_score_codex":0.000022463182,"about_ca_system_score_gemma":0.000024647821,"threshold_uncertainty_score":0.49206558},"labels":[],"label_agreement":null},{"id":"W2167104962","doi":"10.1109/e2emon.2005.1564472","title":"Tracerouting peer-to-peer networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"traceroute; Computer science; Peer-to-peer; Computer network; The Internet; Distributed computing; Bandwidth (computing); Overlay network; Pace; World Wide Web; Network topology","score_opus":0.01043639729597467,"score_gpt":0.23560200217396357,"score_spread":0.2251656048779889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167104962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016703019,0.000065271866,0.8969547,0.04314114,0.00067637244,0.00029431848,0.0000012821463,0.0029524053,0.0392115],"genre_scores_gemma":[0.692839,7.590975e-7,0.28098252,0.0019313596,0.00031628477,0.000034130608,0.000003622879,0.000021373051,0.023870898],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969249,0.00003732633,0.00040005942,0.00077917223,0.0008933196,0.0009652358],"domain_scores_gemma":[0.998017,0.00014008027,0.00007210207,0.0012298214,0.00036272453,0.00017826707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083834806,0.00028720387,0.0002755994,0.0002700045,0.00020370644,0.00047159437,0.0024199372,0.00018883805,0.000031554966],"category_scores_gemma":[0.00021317654,0.00026303035,0.00009238267,0.0017237304,0.000042060674,0.00037643776,0.0011173876,0.0003247792,0.0005562561],"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.000005091885,0.000069115835,0.0025548334,0.0000030942376,0.000013820761,0.00004801468,0.0001676044,0.08562238,0.00029934116,0.1264389,0.63547605,0.14930175],"study_design_scores_gemma":[0.00056093227,0.00026915703,0.026293695,0.00005372328,0.0000137351935,0.00007025902,0.00011953411,0.42054424,0.004055498,0.01364425,0.53294057,0.0014343938],"about_ca_topic_score_codex":0.00026424954,"about_ca_topic_score_gemma":0.00023027681,"teacher_disagreement_score":0.676136,"about_ca_system_score_codex":0.000107265194,"about_ca_system_score_gemma":0.00003454751,"threshold_uncertainty_score":0.9999822},"labels":[],"label_agreement":null},{"id":"W2167234454","doi":"10.1145/974043.974088","title":"Performance of publish/subscribe middleware in mobile wireless networks","year":2004,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Middleware (distributed applications); Scalability; Message oriented middleware; Publication; Computer network; Distributed computing; Domain (mathematical analysis); Asynchronous communication; Mobile computing; Wireless network; Handover; Wireless; Software; Telecommunications; Software architecture; Operating system","score_opus":0.010652935694869192,"score_gpt":0.20740566968702345,"score_spread":0.19675273399215426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167234454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83300215,0.0007739962,0.16364464,0.00024238991,0.000474952,0.00029122058,0.00000484914,0.0015635369,0.0000022540387],"genre_scores_gemma":[0.859113,0.00006800088,0.14049582,0.00007624355,0.000060908973,0.00013145688,0.00000812762,0.00003797891,0.000008507376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9977612,0.000013353198,0.00048343462,0.00058755634,0.0003926004,0.000761891],"domain_scores_gemma":[0.9936874,0.0043429565,0.00010739709,0.0015830257,0.00014423097,0.00013498386],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031601693,0.00035068524,0.0004386593,0.00049790205,0.00005831065,0.000115804476,0.0031000685,0.0002477143,0.0000037655877],"category_scores_gemma":[0.013398769,0.0003724577,0.00008813939,0.002019881,0.000052390318,0.0008860415,0.0012372852,0.00046730187,0.000016258487],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007177122,0.00007350971,0.22408018,0.00010264908,0.000016740974,0.000027924081,0.00046455712,0.72363365,0.0004899225,0.0005250234,0.0001321681,0.050446477],"study_design_scores_gemma":[0.0029070533,0.0015311267,0.8041137,0.0029457717,0.000035190635,0.00012940232,0.00009172652,0.11606837,0.064909,0.0004964196,0.0032670803,0.003505145],"about_ca_topic_score_codex":0.0000564656,"about_ca_topic_score_gemma":0.000023108616,"teacher_disagreement_score":0.6075653,"about_ca_system_score_codex":0.00018364894,"about_ca_system_score_gemma":0.000081103026,"threshold_uncertainty_score":0.99987274},"labels":[],"label_agreement":null},{"id":"W2167318748","doi":"10.1109/mdm.2004.1263041","title":"Disconnected operation in publish/subscribe middleware","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Unicast; Middleware (distributed applications); Publication; Computer network; Multicast; Distributed computing; Mobile computing; Architecture","score_opus":0.012659921646186956,"score_gpt":0.22569960217875853,"score_spread":0.21303968053257158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167318748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24316159,0.00004620891,0.70930594,0.039674725,0.00035567716,0.00030728616,0.0000015721905,0.0014925825,0.005654399],"genre_scores_gemma":[0.8772437,0.000002709904,0.12142681,0.0008973778,0.000024008063,0.000035906534,0.00000628918,0.0000059372965,0.0003572801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882776,0.000019806244,0.00019931077,0.0004074326,0.00021563459,0.00033008622],"domain_scores_gemma":[0.9991882,0.000024357252,0.000023865265,0.000638731,0.000060811926,0.0000640655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017082442,0.00011996251,0.00012474222,0.00026899672,0.000054774075,0.00041976327,0.0012777082,0.00008595655,0.000021408374],"category_scores_gemma":[0.00016320015,0.0001034051,0.000024363457,0.001231662,0.00002439605,0.0013214176,0.00048096696,0.00014439726,0.00014515105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058226597,0.00018303994,0.0028537484,0.0000073398837,0.000010376318,0.00008049512,0.0015816918,0.019810967,0.0027566075,0.9084786,0.010432103,0.053799212],"study_design_scores_gemma":[0.008240109,0.0013441615,0.22775587,0.00046721677,0.000014989757,0.00018708727,0.0021129048,0.12453926,0.13951668,0.44612628,0.045438632,0.004256804],"about_ca_topic_score_codex":0.00032274573,"about_ca_topic_score_gemma":0.0026901558,"teacher_disagreement_score":0.6340821,"about_ca_system_score_codex":0.00014495505,"about_ca_system_score_gemma":0.00007357533,"threshold_uncertainty_score":0.42167377},"labels":[],"label_agreement":null},{"id":"W2167420935","doi":"10.1109/aina.2007.41","title":"Automating Overlay Networks Management","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Overlay; Overlay network; Computer science; Computer network; Context (archaeology); Architecture; Distributed computing; Layer (electronics); Set (abstract data type); Enforcement; World Wide Web; Operating system; The Internet","score_opus":0.0065751223385149965,"score_gpt":0.23165435431888273,"score_spread":0.22507923198036772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167420935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047661558,0.000112264075,0.8677715,0.0019940606,0.0004373484,0.00033561507,1.3153435e-7,0.0036300046,0.07805751],"genre_scores_gemma":[0.718882,0.000007706434,0.27976358,0.0007134822,0.00010759392,0.000020474217,2.4330697e-7,0.000012040996,0.0004928455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982988,0.0000016196083,0.0002464967,0.00045373142,0.00034779715,0.0006515512],"domain_scores_gemma":[0.999428,0.000032296055,0.00009079342,0.00024776888,0.00009005396,0.00011113595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079879776,0.00016275939,0.00013792703,0.00023321762,0.0001392193,0.00025717868,0.0014316482,0.00008685369,0.0000036269432],"category_scores_gemma":[0.000047468267,0.0001597848,0.00004054499,0.0012185002,0.000027516679,0.00044384532,0.0010785225,0.000185828,0.000074485106],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049975074,0.000032887805,0.0051060473,0.00003814762,0.000028720095,0.000034725075,0.00049943675,0.00020975679,0.00032652836,0.27891386,0.03320432,0.6816006],"study_design_scores_gemma":[0.0012049993,0.0004591809,0.21525745,0.000602319,0.000046198154,0.00017657774,0.0007836392,0.5205164,0.011742755,0.032867886,0.21401176,0.0023308638],"about_ca_topic_score_codex":0.000003116822,"about_ca_topic_score_gemma":0.0000014551869,"teacher_disagreement_score":0.67926973,"about_ca_system_score_codex":0.00009634277,"about_ca_system_score_gemma":0.000005168136,"threshold_uncertainty_score":0.6515835},"labels":[],"label_agreement":null},{"id":"W2167945904","doi":"10.1109/icc.2011.5963410","title":"Reducing the Overhead of View-Upload Decoupling in Peer-to-Peer Video On-Demand Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Upload; Peer-to-peer; Video on demand; Overhead (engineering); Decoupling (probability); Distributed computing; Bandwidth (computing); Integer programming; On demand; Computer network; Algorithm; Operating system; Multimedia","score_opus":0.04362824049383891,"score_gpt":0.2674703870582781,"score_spread":0.22384214656443918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167945904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6581635,0.0006132102,0.29862002,0.011838567,0.0019231103,0.0014604726,0.0000050863564,0.0010789542,0.026297126],"genre_scores_gemma":[0.964985,0.000012121223,0.03258987,0.0005325346,0.000060417868,0.00008131129,5.188288e-7,0.00002053549,0.0017176883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970737,0.00006990139,0.0006358616,0.00068948756,0.0009097306,0.00062129187],"domain_scores_gemma":[0.9973355,0.00031494128,0.00015324775,0.0017490039,0.0003248517,0.00012247439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021987946,0.00026994565,0.0004243642,0.00042439607,0.00010901289,0.00013640166,0.0027195925,0.00014603518,0.00001492197],"category_scores_gemma":[0.00061004824,0.00018762966,0.00008032119,0.001435502,0.000071450115,0.00030515887,0.000940264,0.00033087208,0.0001829739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021879708,0.00096172804,0.025684739,0.00030932372,0.00028782597,0.0002104799,0.037319846,0.1240603,0.008829868,0.41875774,0.22220385,0.1611555],"study_design_scores_gemma":[0.003222767,0.0031781874,0.09958917,0.0046346304,0.00008658206,0.00022937534,0.005644329,0.62815094,0.14502048,0.02538098,0.080514394,0.0043481356],"about_ca_topic_score_codex":0.00096178864,"about_ca_topic_score_gemma":0.0001692704,"teacher_disagreement_score":0.50409067,"about_ca_system_score_codex":0.00011527094,"about_ca_system_score_gemma":0.00006771214,"threshold_uncertainty_score":0.76513153},"labels":[],"label_agreement":null},{"id":"W2168156325","doi":"10.1109/icdim.2007.4444312","title":"Accessibility and scalability in collaborative eCommerce environments","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Edward Via College of Osteopathic Medicine","keywords":"Computer science; Scalability; Architecture; World Wide Web; The Internet; Recommender system; Benchmark (surveying); VRML; Peer-to-peer; Human–computer interaction; Multimedia; Database","score_opus":0.010574455734503985,"score_gpt":0.2744508578967034,"score_spread":0.26387640216219943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168156325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7817432,0.00004480172,0.21224684,0.0022337814,0.00006246155,0.0002560584,0.0000011580026,0.00016266071,0.0032490166],"genre_scores_gemma":[0.91180295,0.0000068278637,0.087581195,0.00041614295,0.0000062310005,0.0000092039045,3.517805e-7,0.0000028887039,0.00017419088],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986609,0.00005014815,0.00024382997,0.0005382375,0.00018306069,0.00032382217],"domain_scores_gemma":[0.9989684,0.00018880054,0.00003856405,0.0006921657,0.000018490073,0.00009354453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011673211,0.00011772968,0.00015257995,0.00011477191,0.000050735616,0.000073808675,0.00078322494,0.000085246145,0.000009952023],"category_scores_gemma":[0.00015376075,0.00010352238,0.000012303187,0.0008711602,0.00011816399,0.00044117495,0.0010077686,0.00013915604,0.000022517217],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019273912,0.00019799863,0.69310856,0.000006246368,0.000006119349,0.000015529824,0.00074005895,0.0000443166,0.0010037937,0.010282412,0.00073675223,0.29383892],"study_design_scores_gemma":[0.0001959667,0.00005234773,0.98163164,0.000004662985,6.603404e-7,0.0000012746934,0.00011977513,0.0012064036,0.0067325616,0.00701803,0.002893459,0.00014319619],"about_ca_topic_score_codex":0.000042239586,"about_ca_topic_score_gemma":0.00063723465,"teacher_disagreement_score":0.29369572,"about_ca_system_score_codex":0.0001428783,"about_ca_system_score_gemma":0.000020486234,"threshold_uncertainty_score":0.42215204},"labels":[],"label_agreement":null},{"id":"W2168425579","doi":"10.1109/hicss.2005.546","title":"Social Networks in Peer-to-Peer Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Peer-to-peer; Computer network; Protocol (science); Service (business); Quality of service; World Wide Web; Distributed computing","score_opus":0.020276196233205257,"score_gpt":0.274946441700225,"score_spread":0.2546702454670197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168425579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02016223,0.00015148737,0.82833016,0.12472304,0.0009851668,0.00061352126,0.000001759334,0.0021726827,0.022859944],"genre_scores_gemma":[0.92787653,0.000002273294,0.054128762,0.0022407616,0.0006398304,0.0000940804,0.0000022193449,0.00001988229,0.014995645],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997166,0.000060783394,0.00041201882,0.00064723537,0.0008602842,0.0008537068],"domain_scores_gemma":[0.99867165,0.000086187836,0.00005962279,0.00076036266,0.00026209562,0.00016006675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000971263,0.00024583438,0.0003266853,0.0003816032,0.00012675484,0.00038601167,0.00232708,0.00024055327,0.000013631047],"category_scores_gemma":[0.00014630739,0.00023134661,0.00006600444,0.0017598656,0.000038146878,0.00041635195,0.0010391108,0.0003573592,0.00061722787],"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.000007485971,0.000074942516,0.0012936328,0.0000050445265,0.000014540826,0.000030930383,0.0008566274,0.11,0.000045816854,0.12770502,0.6356519,0.12431408],"study_design_scores_gemma":[0.00039527263,0.000093122675,0.0058245375,0.000031681266,0.0000034541554,0.000020298483,0.00014803388,0.44258192,0.00015652015,0.0008085386,0.5493213,0.00061532995],"about_ca_topic_score_codex":0.00014718725,"about_ca_topic_score_gemma":0.0004265189,"teacher_disagreement_score":0.9077143,"about_ca_system_score_codex":0.00024715584,"about_ca_system_score_gemma":0.00004781419,"threshold_uncertainty_score":0.9434041},"labels":[],"label_agreement":null},{"id":"W2168683902","doi":"10.1109/icccn.2011.6005944","title":"Improving Sustainability of Private P2P Communities","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"BitTorrent; Upload; Sustainability; BitTorrent tracker; Computer science; Order (exchange); Business; Environmental economics; Peer-to-peer; World Wide Web; Ecology; Economics; Finance","score_opus":0.028931571903004084,"score_gpt":0.2364803375971033,"score_spread":0.20754876569409922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168683902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37289533,0.000021703238,0.6193808,0.000530105,0.00008093834,0.00017619994,5.746125e-7,0.00074139616,0.006172986],"genre_scores_gemma":[0.8126726,0.0000011371507,0.18704909,0.00007545076,0.000004205801,0.000011883403,2.0442157e-7,0.0000038956123,0.00018152634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999156,0.000045679626,0.0002077585,0.00015939778,0.00014862018,0.000282536],"domain_scores_gemma":[0.9982161,0.00007407432,0.0000700739,0.0013884334,0.00020890242,0.000042405933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926916,0.00009980733,0.00015164282,0.0001258109,0.00006759586,0.000031378946,0.0021766487,0.000056691042,0.00001714655],"category_scores_gemma":[0.000135531,0.00008574344,0.000038201735,0.00040287923,0.00014920076,0.0003171554,0.0020022395,0.00012693019,0.000008518027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010691158,0.00013704691,0.023784483,0.000079662976,0.00001875421,0.000009941855,0.007177502,0.00004312451,0.0004536386,0.8113879,0.0008144272,0.15608282],"study_design_scores_gemma":[0.00069782604,0.0013198513,0.11145099,0.000070329945,0.000018469862,0.000031987332,0.011768676,0.056179386,0.19656876,0.61581945,0.004807449,0.0012668291],"about_ca_topic_score_codex":0.00141731,"about_ca_topic_score_gemma":0.00010950846,"teacher_disagreement_score":0.43977728,"about_ca_system_score_codex":0.000057224435,"about_ca_system_score_gemma":0.000054297492,"threshold_uncertainty_score":0.40447912},"labels":[],"label_agreement":null},{"id":"W2169186802","doi":"","title":"Efficient multiple-keyword search in DHT-based decentralized systems","year":2008,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Distributed hash table; Hash table; File sharing; Peer-to-peer; Distributed File System; Keyword search; Hash function; Perspective (graphical); Information retrieval; Table (database); Journaling file system; Distributed computing; Database; World Wide Web; Operating system; Computer file; Artificial intelligence; Computer security","score_opus":0.050900097277354256,"score_gpt":0.3015814053070616,"score_spread":0.25068130802970734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169186802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87093353,0.00030996473,0.124330536,0.0014609749,0.0010250666,0.0009971377,0.0000058996875,0.00016050461,0.0007763853],"genre_scores_gemma":[0.9916841,0.00015216463,0.007719595,0.00009174367,0.000053529522,0.00023278783,0.000028093053,0.000013040047,0.00002499349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964108,0.00048688587,0.00082148926,0.0004381371,0.0015548116,0.00028787172],"domain_scores_gemma":[0.99718446,0.00040664748,0.00028397547,0.0010258682,0.001012475,0.0000865552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024111753,0.00021423363,0.00032133795,0.0005990247,0.00016276039,0.00013784728,0.0017581476,0.00011005437,0.0000034091975],"category_scores_gemma":[0.000058781185,0.00020821411,0.000053302996,0.0006411666,0.0000890357,0.00022855615,0.00036612904,0.00022894774,0.000030294304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004903471,0.00019060964,0.015812567,0.000024292043,0.000025913847,9.811592e-7,0.0005993779,0.96964484,0.00024479203,0.0025619557,0.00014079496,0.010704862],"study_design_scores_gemma":[0.0015366484,0.00015719148,0.054053865,0.0002526513,0.0000047499534,0.000026710453,0.00002745949,0.94190663,0.00076791056,0.000004879486,0.0010717658,0.00018955897],"about_ca_topic_score_codex":0.0001685899,"about_ca_topic_score_gemma":0.000009622159,"teacher_disagreement_score":0.12075052,"about_ca_system_score_codex":0.00038383465,"about_ca_system_score_gemma":0.00015498926,"threshold_uncertainty_score":0.8490725},"labels":[],"label_agreement":null},{"id":"W2169290493","doi":"","title":"CMS-ToPSS: efficient dissemination of RSS documents","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"RSS; World Wide Web; Popularity; The Internet; Computer science; Publishing; Internet privacy; Content management system; Electronic publishing; Multimedia; Political science","score_opus":0.006310582059609522,"score_gpt":0.26622058692838474,"score_spread":0.2599100048687752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169290493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.279642,0.00007827892,0.69684136,0.00679867,0.00022534799,0.00022208499,0.0000012632605,0.00069941423,0.01549158],"genre_scores_gemma":[0.87610996,0.0000031805864,0.12174875,0.00012419696,0.000021826803,0.000011181866,6.362914e-7,0.0000036480785,0.001976616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898857,0.000012738555,0.0001981528,0.00025508425,0.00032615665,0.00021931682],"domain_scores_gemma":[0.99918306,0.00007453761,0.000059519665,0.0005612868,0.00007480952,0.000046809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019826545,0.00009717393,0.000115122726,0.00015284386,0.00003579796,0.000050136234,0.0010099509,0.00004899928,0.000026802278],"category_scores_gemma":[0.000089432266,0.00007667266,0.000035192006,0.0005586261,0.000029025117,0.00018835635,0.0004482204,0.0000576685,0.00010882859],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046255423,0.0002476654,0.0011786753,0.000011515177,0.000017837818,0.0000041166204,0.00088471494,0.008510077,0.0077124466,0.11088292,0.041213702,0.8293317],"study_design_scores_gemma":[0.0004855897,0.00033191944,0.023489164,0.00018098485,0.0000135399005,0.000018823883,0.00019311735,0.5169351,0.39508748,0.0035753075,0.05893545,0.0007535366],"about_ca_topic_score_codex":0.0000099003655,"about_ca_topic_score_gemma":0.000010242174,"teacher_disagreement_score":0.8285782,"about_ca_system_score_codex":0.00006034733,"about_ca_system_score_gemma":0.000012948302,"threshold_uncertainty_score":0.31266204},"labels":[],"label_agreement":null},{"id":"W2169641895","doi":"10.1109/ipdps.2005.3","title":"A Category Overlay Infrastructure for Peer-to-Peer Content Search","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Overlay; Computer science; Peer-to-peer; Overlay network; Content (measure theory); Computer network; World Wide Web; Operating system; The Internet","score_opus":0.03971920008116998,"score_gpt":0.28690674856089715,"score_spread":0.24718754847972718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169641895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03806431,0.00005757714,0.79729235,0.15646726,0.0004961352,0.0010210829,0.000017951977,0.0014431028,0.0051402654],"genre_scores_gemma":[0.5428861,0.0000018961327,0.423333,0.0067744856,0.00023035627,0.00014179977,0.000006360012,0.000023407087,0.02660259],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969325,0.000030007775,0.00033360164,0.0007860189,0.0010150685,0.00090282114],"domain_scores_gemma":[0.99740106,0.00015893238,0.000046654473,0.0012203924,0.00087023276,0.000302742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072461145,0.00028890956,0.00030615387,0.00034505763,0.0001641329,0.00032431644,0.0025400023,0.00019319876,0.000063950545],"category_scores_gemma":[0.00039951917,0.0002405896,0.00011737481,0.00080779084,0.000059607202,0.00044146364,0.0011769062,0.00030889717,0.00039575584],"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.00002247852,0.00004226873,0.00037135198,0.000009486972,0.000031496384,0.0000067841434,0.0008926448,0.0060103233,0.002658278,0.07613487,0.6857552,0.2280648],"study_design_scores_gemma":[0.00073664804,0.00040487174,0.0076129152,0.000016767455,0.000007922029,0.000033976718,0.00027477584,0.043011315,0.026019847,0.004212178,0.91704154,0.0006272384],"about_ca_topic_score_codex":0.00007811479,"about_ca_topic_score_gemma":0.00014621625,"teacher_disagreement_score":0.5048218,"about_ca_system_score_codex":0.0002309068,"about_ca_system_score_gemma":0.00013675723,"threshold_uncertainty_score":0.9810959},"labels":[],"label_agreement":null},{"id":"W2170175875","doi":"10.1109/ccnc.2007.105","title":"An Architecture for Composing Registries when Ambient Networks Compose","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Architecture; Context (archaeology); Composition (language); Ambient intelligence; Host (biology); Set (abstract data type); Distributed computing; World Wide Web; Data science; Computer network; Human–computer interaction","score_opus":0.016305245528387035,"score_gpt":0.2711040460769598,"score_spread":0.2547988005485728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170175875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015921526,0.00011359574,0.9739616,0.0062982603,0.00045544453,0.0005047256,0.0000025045024,0.0017504755,0.0009918521],"genre_scores_gemma":[0.47068593,0.0000016521263,0.52766776,0.001316267,0.00012506211,0.000013813911,0.000008070589,0.000013068275,0.00016839411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980121,0.000029248957,0.0003231757,0.0006006434,0.0002809069,0.0007538723],"domain_scores_gemma":[0.9981041,0.00026449724,0.00009378885,0.0012104937,0.00012401855,0.00020313515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071134407,0.00023294541,0.00024991197,0.0002086446,0.00026424168,0.00033374716,0.0020535118,0.00014735611,0.0000027934807],"category_scores_gemma":[0.000043562475,0.00020507304,0.00007795457,0.00048239404,0.00011898436,0.00026847323,0.0004683948,0.00023987153,0.0000068606514],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014582396,0.00022616884,0.0012864355,0.000022210193,0.000050771865,0.00005478849,0.0014785025,0.068082996,0.005550017,0.19268289,0.07434047,0.65607893],"study_design_scores_gemma":[0.0012655919,0.0016105461,0.0051162946,0.00012273526,0.00002333186,0.00014392902,0.00028760638,0.52820194,0.03531265,0.0638539,0.36256632,0.0014951928],"about_ca_topic_score_codex":0.000045775952,"about_ca_topic_score_gemma":0.0003195454,"teacher_disagreement_score":0.65458375,"about_ca_system_score_codex":0.000075857584,"about_ca_system_score_gemma":0.000026962944,"threshold_uncertainty_score":0.8362636},"labels":[],"label_agreement":null},{"id":"W2170272988","doi":"10.1109/ptp.2002.1046311","title":"Building a P2P forum system with JXTA","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Scalability; File sharing; Single point of failure; Distributed computing; Robustness (evolution); Peer-to-peer; Shared resource; Distributed data store; Server; Service discovery; Computer network; World Wide Web; Web service; Database; The Internet","score_opus":0.009395165457868488,"score_gpt":0.21680307649683822,"score_spread":0.20740791103896974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170272988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012367639,0.000054486965,0.95506686,0.002048095,0.00017939019,0.0001705288,2.5700467e-7,0.0020108842,0.028101867],"genre_scores_gemma":[0.5785427,3.6909404e-7,0.42075777,0.00022456705,0.000007058171,0.00001812755,4.581855e-8,0.0000058774176,0.00044346187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987754,0.000023521981,0.00013050092,0.00038036495,0.00024926418,0.0004409425],"domain_scores_gemma":[0.9989519,0.00004355732,0.000038147533,0.0008340793,0.000053981694,0.00007833876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020604758,0.00013142524,0.00014421462,0.00012863411,0.00009773125,0.00015717515,0.0010785649,0.00005743489,0.0000032251423],"category_scores_gemma":[0.00003928414,0.00009545817,0.00002523067,0.0008037277,0.000024785311,0.00024909177,0.00028895904,0.00009740497,0.000084038205],"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.0000011049152,0.00000800699,0.00071466883,0.000006832094,0.000008780623,0.000026498492,0.000027021093,0.00035952585,0.00020727927,0.98404115,0.0063351835,0.008263936],"study_design_scores_gemma":[0.0027488745,0.002004077,0.0023778481,0.0009255904,0.000040523493,0.0022740895,0.003043488,0.22255291,0.15275338,0.036277633,0.5713398,0.0036618274],"about_ca_topic_score_codex":0.000024393954,"about_ca_topic_score_gemma":0.000037438258,"teacher_disagreement_score":0.9477635,"about_ca_system_score_codex":0.00007893302,"about_ca_system_score_gemma":0.00004132216,"threshold_uncertainty_score":0.38926712},"labels":[],"label_agreement":null},{"id":"W2170363415","doi":"10.1109/ds-rt.2007.39","title":"A Distributed Topology Control Algorithm for P2P Based Simulations","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; The Internet; Multicast; Distributed computing; Overlay network; Computer network; Network topology; Architecture; Multimedia; World Wide Web","score_opus":0.014173411691088692,"score_gpt":0.27925698028888324,"score_spread":0.2650835685977945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170363415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006600696,0.000014695865,0.98747283,0.009773593,0.00025658525,0.00045464226,0.000076127806,0.0010311361,0.0002603282],"genre_scores_gemma":[0.5086107,8.572231e-8,0.48986417,0.0013280011,0.0000380226,0.000022067903,0.000015044615,0.0000043691243,0.0001175314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988304,0.000015410977,0.0002200141,0.00032506834,0.00013605622,0.000473043],"domain_scores_gemma":[0.9983775,0.0007777601,0.000046082347,0.0005476398,0.00015964163,0.00009139725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032806725,0.000117651325,0.00016493796,0.00016242395,0.00012302364,0.000055376695,0.0008085597,0.00011493659,0.000015482563],"category_scores_gemma":[0.0002097538,0.00010639622,0.00005984934,0.0005690098,0.000052673717,0.000118468764,0.00012057621,0.000080220416,0.000020983387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002650753,0.00018425785,0.0010039539,0.000005198395,0.000053867443,0.000027521693,0.000052832354,0.02062289,0.0009077902,0.16324303,0.027447147,0.786425],"study_design_scores_gemma":[0.00085046474,0.0001437727,0.0012585128,0.0000024372043,0.0000055929822,0.0000028503214,0.000009779559,0.9557554,0.0026629933,0.0075030695,0.031649772,0.00015531149],"about_ca_topic_score_codex":0.000019987754,"about_ca_topic_score_gemma":0.00009565439,"teacher_disagreement_score":0.93513256,"about_ca_system_score_codex":0.000063075924,"about_ca_system_score_gemma":0.00004476522,"threshold_uncertainty_score":0.43387118},"labels":[],"label_agreement":null},{"id":"W2170641156","doi":"10.7557/5.3041","title":"ReView: a new approach to peer review, using WordPress","year":2014,"lang":"en","type":"article","venue":"Septentrio Conference Series","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Upper River Valley Hospital","funders":"","keywords":"Plug-in; World Wide Web; Computer science; User interface; Interface (matter); Peer-to-peer; User Friendly; Human–computer interaction; Operating system","score_opus":0.06551739536057011,"score_gpt":0.2976366440944745,"score_spread":0.23211924873390438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170641156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026211355,0.024041696,0.88363487,0.06911507,0.000623543,0.001578101,0.0000069120506,0.0011524407,0.019585235],"genre_scores_gemma":[0.012375508,0.020277577,0.87524414,0.05076459,0.00042910545,0.00026402794,0.000039384937,0.0000750625,0.04053061],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99667317,0.00015819716,0.00053111714,0.0009681725,0.000898618,0.0007707349],"domain_scores_gemma":[0.99650806,0.000063181906,0.00017854395,0.0020022797,0.0008529404,0.00039498645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011917728,0.000401546,0.0007373089,0.00018238947,0.00017205293,0.0003773042,0.0031733925,0.00011824084,0.00006465495],"category_scores_gemma":[0.0019076591,0.00035719312,0.00013408683,0.0014970232,0.000091006776,0.00079351343,0.0014868046,0.00032045282,0.00048429408],"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.000008296135,0.000038323313,0.000055077795,0.0009923215,0.000028446519,0.000004998786,0.00037991145,0.0001258308,0.0002635956,0.041302767,0.73623896,0.22056147],"study_design_scores_gemma":[0.00013299989,0.00008720795,0.00009845758,0.005044541,0.0000392884,0.000056873087,0.000027119157,0.002149774,0.0005508947,0.0026234996,0.98864543,0.00054391485],"about_ca_topic_score_codex":0.000069250484,"about_ca_topic_score_gemma":0.000025396683,"teacher_disagreement_score":0.25240648,"about_ca_system_score_codex":0.00007773609,"about_ca_system_score_gemma":0.00023841142,"threshold_uncertainty_score":0.999888},"labels":[],"label_agreement":null},{"id":"W2170735098","doi":"10.1109/icdcs.2011.93","title":"Foundations for Highly Available Content-Based Publish/Subscribe Overlays","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Overlay; Computer science; Scalability; Overlay network; Distributed computing; Overhead (engineering); Computer network; Publication; Variety (cybernetics); Set (abstract data type); Overlay multicast; Operating system; Multicast; The Internet; Programming language","score_opus":0.17198679018540583,"score_gpt":0.25835432811622594,"score_spread":0.08636753793082011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170735098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022280028,0.000030212717,0.93931514,0.006102965,0.00073882804,0.00053273625,0.000010727948,0.0019921104,0.049049262],"genre_scores_gemma":[0.17867938,0.0000017084261,0.8003684,0.0029989246,0.000047786685,0.00030942404,0.000014157353,0.000018486162,0.017561726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841696,0.000018055267,0.00026560485,0.00053054997,0.00024232415,0.0005265217],"domain_scores_gemma":[0.9981614,0.00014305407,0.0000808287,0.0011366352,0.00034925534,0.00012885898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032688281,0.0001724294,0.00018532349,0.00025028587,0.00018519627,0.00039806514,0.0019684655,0.000104974264,0.0002295684],"category_scores_gemma":[0.0003040768,0.00015408531,0.0000924872,0.0007032835,0.00006599943,0.0011398841,0.00035691983,0.00010112114,0.0007079973],"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.000011954654,0.00011542282,0.00083583285,0.000007440989,0.000022318678,0.0000034246932,0.00009602626,0.000016080483,0.0009710598,0.5064449,0.4812452,0.010230394],"study_design_scores_gemma":[0.002177742,0.0009543215,0.0035167865,0.000044522218,0.00003370275,0.0000101016,0.00019499703,0.07789122,0.09419684,0.03539746,0.7843766,0.0012056719],"about_ca_topic_score_codex":0.00022891388,"about_ca_topic_score_gemma":0.00018084155,"teacher_disagreement_score":0.47104737,"about_ca_system_score_codex":0.00007420748,"about_ca_system_score_gemma":0.00013906696,"threshold_uncertainty_score":0.91001093},"labels":[],"label_agreement":null},{"id":"W2170944998","doi":"10.1109/pimrc.2009.5450023","title":"An architecture with QoS support for application layer multicasting over wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer network; Computer science; Xcast; Protocol Independent Multicast; IP multicast; Source-specific multicast; Overlay multicast; Distributed computing; Pragmatic General Multicast; Wireless mesh network; Distance Vector Multicast Routing Protocol; Multicast address; Quality of service; Wireless network; Wireless; Telecommunications","score_opus":0.01201677244961261,"score_gpt":0.26607993601267815,"score_spread":0.2540631635630655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170944998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027018897,0.0000043336827,0.9681537,0.0021952966,0.00006637844,0.0006812405,0.0000014622873,0.00127306,0.00060562487],"genre_scores_gemma":[0.6790531,6.0410036e-7,0.31938347,0.0012300627,0.00012483397,0.00008054309,0.0000068189493,0.000010463081,0.000110070076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984587,0.000016560118,0.00019277411,0.0006020818,0.00023301675,0.0004968653],"domain_scores_gemma":[0.9986857,0.00008767686,0.00007724741,0.00092532363,0.00010049783,0.0001235447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022222831,0.00019948762,0.0001878687,0.00010675306,0.00012711731,0.00015817967,0.0011555073,0.00012106066,0.0000037125099],"category_scores_gemma":[0.000016735521,0.00015297357,0.00003802881,0.0005240142,0.000033609158,0.00027848958,0.000113163944,0.00018326342,0.000006174862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041119933,0.00011471492,0.00093922415,0.000006030193,0.000015968857,0.000007364143,0.00023896898,0.045343928,0.0032532443,0.07360399,0.0038379198,0.8725975],"study_design_scores_gemma":[0.00037725654,0.00058187434,0.0050974535,0.000014225865,0.000006501268,0.000021926628,0.000018406183,0.9854075,0.002540276,0.0018801945,0.0037251457,0.00032928938],"about_ca_topic_score_codex":0.000010475073,"about_ca_topic_score_gemma":0.000061983184,"teacher_disagreement_score":0.94006354,"about_ca_system_score_codex":0.00003500147,"about_ca_system_score_gemma":0.000030015755,"threshold_uncertainty_score":0.62380815},"labels":[],"label_agreement":null},{"id":"W2171612010","doi":"10.1109/jsac.2005.857210","title":"Market-based self-optimization for autonomic service overlay networks","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Selfishness; Computer network; Overlay network; Incentive; Distributed computing; Service (business); Multicast; Overlay; Resource allocation; Service provider; Node (physics); Optimization problem; Microeconomics; The Internet","score_opus":0.0207160599374679,"score_gpt":0.27275900646191137,"score_spread":0.2520429465244435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171612010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040231138,0.00025335804,0.9439218,0.04892709,0.0003218704,0.0005665518,0.0000065772547,0.0008439638,0.0011356431],"genre_scores_gemma":[0.420143,0.00019030846,0.57638913,0.0029361253,0.00013718475,0.00012002864,0.000012214913,0.000025429961,0.000046556474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980688,0.00028679712,0.0005947625,0.00031379188,0.00023909807,0.00049673393],"domain_scores_gemma":[0.9958053,0.0010227751,0.00032222114,0.0020674416,0.00063316483,0.00014904627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007912013,0.00023103906,0.00025671546,0.0005779872,0.00050283043,0.0003183419,0.0042624515,0.0001866517,0.000015497199],"category_scores_gemma":[0.00021432513,0.00024110782,0.0000786499,0.0023514,0.000032430686,0.0004942673,0.00025261543,0.00083352503,0.000018703464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028337503,0.00028155092,0.00024252951,0.0000027188973,0.000029122275,0.0000010316041,0.00011338088,0.9644899,0.000038171547,0.0013183011,0.01746969,0.015985278],"study_design_scores_gemma":[0.0006847381,0.00011052715,0.0020868771,0.00009474511,0.000012771988,0.000028973798,0.000007612647,0.9649013,0.00013952405,0.0002979555,0.031382535,0.00025242873],"about_ca_topic_score_codex":0.000009667274,"about_ca_topic_score_gemma":0.0003401197,"teacher_disagreement_score":0.4161199,"about_ca_system_score_codex":0.0007496116,"about_ca_system_score_gemma":0.00038215116,"threshold_uncertainty_score":0.98320913},"labels":[],"label_agreement":null},{"id":"W2171754572","doi":"10.1109/hpcs.2007.10","title":"Benefits of Clustering in Landmark-Aided Positioning Algorithms","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; PlanetLab; Implementation; Overhead (engineering); Cluster analysis; Denial-of-service attack; Distributed computing; Algorithm; Computer network; Artificial intelligence; The Internet","score_opus":0.017393157242943037,"score_gpt":0.25618482180567764,"score_spread":0.2387916645627346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171754572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24233493,0.0000632171,0.7507623,0.0006835922,0.00012713682,0.00008701033,5.0379344e-7,0.0002926196,0.0056487042],"genre_scores_gemma":[0.6914581,0.000003292935,0.30828145,0.00013786978,0.000017326947,0.0000025663528,5.2762596e-7,0.0000036452714,0.00009521623],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990406,0.0000093454455,0.00024177386,0.00022733171,0.00018230583,0.00029862352],"domain_scores_gemma":[0.99942714,0.00008883768,0.00004463686,0.00035104356,0.000046951347,0.00004137221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005048215,0.00008307374,0.0001319819,0.00029336484,0.000029105977,0.000035695466,0.0006735584,0.00006345348,0.0000038288895],"category_scores_gemma":[0.000040837593,0.000079661426,0.00002124873,0.0007689527,0.000017296627,0.00021274155,0.000508941,0.00009481075,0.000011368194],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001893653,0.000089205714,0.019791972,0.000021064317,0.00001684549,0.00004863699,0.0010759536,0.038898807,0.0031970465,0.050511137,0.0007385365,0.88559186],"study_design_scores_gemma":[0.0014414717,0.000439869,0.6261636,0.00043328095,0.0000060772413,0.00010870256,0.00033095074,0.25409013,0.10739024,0.007912242,0.0007852769,0.000898139],"about_ca_topic_score_codex":0.0001287051,"about_ca_topic_score_gemma":0.00089876424,"teacher_disagreement_score":0.88469374,"about_ca_system_score_codex":0.000045230037,"about_ca_system_score_gemma":0.00001066114,"threshold_uncertainty_score":0.32484987},"labels":[],"label_agreement":null},{"id":"W2172007097","doi":"10.1109/tcsvt.2010.2077553","title":"Solving Streaming Capacity Problems in P2P VoD Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Upload; Live streaming; Bandwidth (computing); Video on demand; Computer network; Peer-to-peer; Real Time Streaming Protocol; Resource allocation; The Internet; Video streaming; World Wide Web","score_opus":0.025730151705302816,"score_gpt":0.23809822546953985,"score_spread":0.21236807376423703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172007097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20850676,0.000280974,0.78501654,0.00068839436,0.0025705534,0.0014082218,0.000027863116,0.0013656564,0.00013500648],"genre_scores_gemma":[0.9964705,0.000025500456,0.0021121274,0.000034325905,0.000047150526,0.0011554747,6.247053e-7,0.000032374857,0.00012191849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739087,0.00004669446,0.0006334163,0.00089614297,0.00026462,0.00076828775],"domain_scores_gemma":[0.99818486,0.0002525622,0.00017625293,0.0010977897,0.00016975722,0.00011880697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007233741,0.0003343935,0.0005627638,0.0014573667,0.0003426811,0.00027313514,0.0011627799,0.00060689374,7.8352576e-7],"category_scores_gemma":[0.00006352659,0.00032571083,0.00007855423,0.0013201572,0.00017419484,0.0003825541,0.000017698318,0.0008888684,0.000012679982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016793421,0.000750272,0.002730532,0.00133731,0.00029428545,0.00007356598,0.0020796126,0.05927729,0.20861372,0.21056756,0.0008890588,0.51337],"study_design_scores_gemma":[0.006073956,0.0034037905,0.001422573,0.0031468617,0.00014823071,0.002980204,0.0032075893,0.83276314,0.06550653,0.022611568,0.054159775,0.0045757536],"about_ca_topic_score_codex":0.00047512882,"about_ca_topic_score_gemma":0.0014644467,"teacher_disagreement_score":0.78796375,"about_ca_system_score_codex":0.00012634312,"about_ca_system_score_gemma":0.00006605272,"threshold_uncertainty_score":0.9999195},"labels":[],"label_agreement":null},{"id":"W2172604031","doi":"10.1504/ijwmc.2015.070947","title":"Mobile services provisioning and sensor data sharing","year":2015,"lang":"en","type":"article","venue":"International Journal of Wireless and Mobile Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Computer network; Provisioning; Latency (audio); Mobile computing; Mobile device; Distributed computing; Computer security; Telecommunications; World Wide Web","score_opus":0.03867891219888032,"score_gpt":0.31704141274537534,"score_spread":0.27836250054649503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172604031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85147417,0.0010385226,0.14619909,0.0003541425,0.0006920392,0.00009894758,0.0000033289998,0.000069215486,0.00007054466],"genre_scores_gemma":[0.92964035,0.000082824095,0.06983076,0.00014143849,0.0002762227,0.0000019037433,0.00000218293,0.000007804466,0.00001653382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986265,0.000022371076,0.00038290952,0.00034062177,0.00044959402,0.00017802918],"domain_scores_gemma":[0.9986598,0.000093263254,0.0003017089,0.00035207084,0.00044596693,0.00014722742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084161473,0.000118755706,0.00019730174,0.00020419677,0.00007186247,0.00051717507,0.0024432712,0.0000459019,5.3480017e-7],"category_scores_gemma":[0.000054610715,0.000102128295,0.000021718619,0.00013666379,0.000035632092,0.0007307212,0.004029606,0.00019727803,0.0000016271073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029255832,0.000069219655,0.01776788,0.000029831692,0.000115880626,0.00022617339,0.0044886163,0.013396772,0.0014694318,0.0016414339,0.0005224038,0.9602431],"study_design_scores_gemma":[0.000951592,0.00045865597,0.0019082392,0.0007027125,0.000013309393,0.001310249,0.0018783693,0.9776908,0.00096974854,0.0014304471,0.012383586,0.00030229657],"about_ca_topic_score_codex":0.000029931229,"about_ca_topic_score_gemma":0.0000036438864,"teacher_disagreement_score":0.964294,"about_ca_system_score_codex":0.000041700318,"about_ca_system_score_gemma":0.0000501505,"threshold_uncertainty_score":0.5022616},"labels":[],"label_agreement":null},{"id":"W2175193062","doi":"10.1109/pacrim.2015.7334852","title":"Exploring peer-to-peer infrastructure for Computer Supported Collaborative Work applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cloud computing; Computer science; Software deployment; Computer-supported cooperative work; Peer-to-peer; Usability; Architecture; Collaborative software; World Wide Web; Work (physics); Multimedia; Human–computer interaction; Distributed computing; Software engineering; Operating system; Engineering","score_opus":0.08406388312964327,"score_gpt":0.2909286976734542,"score_spread":0.20686481454381092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175193062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00737053,0.000016353632,0.9559791,0.030978737,0.00088267034,0.0016552557,0.000026291696,0.0016506173,0.0014404625],"genre_scores_gemma":[0.09304282,0.0000014379227,0.9000283,0.0018002276,0.00046318688,0.0021186627,0.000030845058,0.000029375096,0.0024851623],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974199,0.000032072756,0.0003601128,0.0007990008,0.0007590976,0.0006298098],"domain_scores_gemma":[0.99594015,0.00016214342,0.000093722774,0.0012107334,0.0021591599,0.0004340956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054528186,0.00029945534,0.00032322932,0.000348384,0.00016984998,0.00038403802,0.0020542366,0.00012886702,0.000007046021],"category_scores_gemma":[0.00023216575,0.00027149814,0.00006162876,0.0034149066,0.00005514703,0.00069845794,0.0010372401,0.00020697831,0.0002227811],"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.00002389392,0.00004320983,0.000832784,0.000006403102,0.000044203975,0.000004627967,0.00247836,0.012830608,0.00007583282,0.033170484,0.8244952,0.12599437],"study_design_scores_gemma":[0.0005339255,0.00027733445,0.0032623918,0.00001837795,0.000010345761,0.000007042365,0.000495511,0.0070469724,0.0024853526,0.008382217,0.97693586,0.000544637],"about_ca_topic_score_codex":0.0000076864935,"about_ca_topic_score_gemma":0.00001837154,"teacher_disagreement_score":0.15244067,"about_ca_system_score_codex":0.00018068486,"about_ca_system_score_gemma":0.0002211367,"threshold_uncertainty_score":0.9999737},"labels":[],"label_agreement":null},{"id":"W2175394904","doi":"10.1162/105474603322955888","title":"VELVET: An Adaptive Hybrid Architecture for Very Large Virtual Environments","year":2003,"lang":"en","type":"article","venue":"PRESENCE Virtual and Augmented Reality","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Velvet; Collaborative virtual environment; Computer science; Architecture; Scheme (mathematics); Distributed computing; Computer architecture; Human–computer interaction; Virtual reality","score_opus":0.024516297120433957,"score_gpt":0.2602827406645452,"score_spread":0.23576644354411125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175394904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14336725,0.00009984821,0.8539896,0.0009283838,0.00027916132,0.0006205386,0.00017567116,0.00027972192,0.00025985352],"genre_scores_gemma":[0.9865224,0.000038683313,0.012158536,0.00048518283,0.000052852996,0.00014539048,0.000024579322,0.000016461467,0.00055591116],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974735,0.00020809431,0.00028850936,0.0009239145,0.0004169809,0.00068903016],"domain_scores_gemma":[0.9985088,0.000224312,0.00010370304,0.0008604015,0.000034191067,0.00026857728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066432543,0.00029873603,0.00028577168,0.0001244188,0.00032390538,0.00012786503,0.0009756498,0.00010794176,0.0000070764713],"category_scores_gemma":[0.00026727523,0.00026209382,0.00007060073,0.0002782274,0.00018276901,0.0005101956,0.0006023204,0.0002717316,0.000012786908],"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.0006405199,0.0017380251,0.0014216397,0.000042333428,0.0002930815,0.00009808764,0.0030914545,0.007148334,0.019859428,0.46852383,0.014463056,0.4826802],"study_design_scores_gemma":[0.0074858023,0.012785184,0.014036965,0.00029404505,0.00012208002,0.00020503844,0.0027895863,0.16698752,0.13845941,0.14821756,0.5047728,0.0038440542],"about_ca_topic_score_codex":0.00003484063,"about_ca_topic_score_gemma":0.000030243664,"teacher_disagreement_score":0.84315515,"about_ca_system_score_codex":0.0000601448,"about_ca_system_score_gemma":0.00004454499,"threshold_uncertainty_score":0.99998313},"labels":[],"label_agreement":null},{"id":"W2180873154","doi":"10.1142/s0219265904001179","title":"AN EFFICIENT CLUSTERED ARCHITECTURE FOR P2P NETWORKS","year":2004,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Distributed computing; Flooding (psychology); Computer network; Peer-to-peer; Overlay network; Fault tolerance; Anonymity; Architecture; Load balancing (electrical power); Routing protocol; Network topology; Protocol (science); Routing (electronic design automation); Computer security; The Internet; World Wide Web","score_opus":0.010497232985055869,"score_gpt":0.25816099520477714,"score_spread":0.24766376221972128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180873154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04779368,0.00033848514,0.94298697,0.004252967,0.00392495,0.00035453352,0.0000010744344,0.00028195497,0.00006541005],"genre_scores_gemma":[0.87668973,0.000023306231,0.12080029,0.0011348242,0.0012830219,0.000019829811,0.0000017382048,0.000027406679,0.000019852365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775684,0.00009240595,0.00079936755,0.00042018807,0.00033528925,0.00059592735],"domain_scores_gemma":[0.9977538,0.00022394481,0.00055476703,0.0006843329,0.00050369336,0.00027943592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010237877,0.0002897458,0.00043722338,0.0005091147,0.00020400411,0.00032238624,0.0018219899,0.00028634156,0.000004790063],"category_scores_gemma":[0.00018304824,0.00024386561,0.0003038739,0.0008331934,0.00005961662,0.00041553067,0.00023706775,0.00079086673,0.0000037968837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013107112,0.000114788774,0.000024053585,0.0000045552433,0.000052437765,0.000020241694,0.00030887304,0.9263195,0.00013334793,0.0031076723,0.0026921788,0.06709131],"study_design_scores_gemma":[0.0017255526,0.0027266084,0.0003567431,0.0003144647,0.000033947395,0.0009573675,0.00016908576,0.9796206,0.00075395295,0.0070333406,0.0058783945,0.0004299789],"about_ca_topic_score_codex":0.000008775803,"about_ca_topic_score_gemma":0.00008134466,"teacher_disagreement_score":0.82889605,"about_ca_system_score_codex":0.00031037163,"about_ca_system_score_gemma":0.0000778023,"threshold_uncertainty_score":0.9944551},"labels":[],"label_agreement":null},{"id":"W2182676089","doi":"10.22215/etd/2009-08835","title":"XML message filtering and matching in publish/subscribe systems","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"Ontario Centres of Excellence","keywords":"XML; Computer science; Matching (statistics); World Wide Web; Mathematics","score_opus":0.011321287266824213,"score_gpt":0.24374549558884873,"score_spread":0.2324242083220245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182676089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57316583,0.005839629,0.23103128,0.003931503,0.006437772,0.002249719,0.000012243354,0.0062923613,0.17103969],"genre_scores_gemma":[0.9258496,0.00013089277,0.056376964,0.00031631635,0.00011942445,0.00013825233,0.00010074145,0.00004879525,0.016919019],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9979237,0.000041766612,0.000425217,0.0007442343,0.0003881719,0.00047694446],"domain_scores_gemma":[0.99887925,0.00006596065,0.00014310236,0.00075655786,0.000068297995,0.000086839056],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004324922,0.00032627626,0.0004367953,0.0007006211,0.00007639173,0.0013700258,0.0016677119,0.00036551722,0.0000032005964],"category_scores_gemma":[0.000070652655,0.0003149699,0.000040926214,0.0007705752,0.000010709016,0.00093501306,0.00031827085,0.00048280493,0.00001682493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038814946,0.00015249939,0.0007033516,0.0010634325,0.000104340055,0.0006767851,0.008936499,0.0035723103,0.004204654,0.2594597,0.053550266,0.66753733],"study_design_scores_gemma":[0.0053024413,0.0016560509,0.30592498,0.021617707,0.00018062888,0.0008199999,0.03270329,0.28860837,0.01679134,0.19884057,0.10892464,0.018629972],"about_ca_topic_score_codex":0.00054553157,"about_ca_topic_score_gemma":0.0015405748,"teacher_disagreement_score":0.64890736,"about_ca_system_score_codex":0.00009725657,"about_ca_system_score_gemma":0.00005183623,"threshold_uncertainty_score":0.99993026},"labels":[],"label_agreement":null},{"id":"W2185699297","doi":"10.1007/978-3-319-18422-7_14","title":"Data Sharing and Exchange: General Data-Mapping Semantics","year":2015,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","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 Ottawa","funders":"","keywords":"Computer science; Semantics (computer science); Data exchange; Information retrieval; Data sharing; Meaning (existential); Conjunctive query; Information exchange; Theoretical computer science; Database; Programming language; Relational database","score_opus":0.2766356120714673,"score_gpt":0.36682020391340386,"score_spread":0.09018459184193656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185699297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007570662,0.0020711012,0.938875,0.005567956,0.00041867016,0.0004906849,0.0001416809,0.00034397002,0.05201523],"genre_scores_gemma":[0.0037822798,0.0046344157,0.9886236,0.001140118,0.00008881514,0.0000142249155,0.00060010323,0.000013028613,0.0011034214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978609,0.00001786515,0.0006039616,0.00067959516,0.0005367429,0.00030091836],"domain_scores_gemma":[0.9877325,0.00010483173,0.00026778475,0.011409641,0.00033974138,0.00014545993],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0028349885,0.00023277689,0.0002733068,0.0010874288,0.00040951962,0.0013197311,0.022020748,0.00013490306,0.0000014426183],"category_scores_gemma":[0.00015075333,0.00023932151,0.000010298283,0.00064767577,0.00069339655,0.0120881265,0.0757201,0.00046521102,0.00003061826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.575413e-7,0.000008142389,0.00011460273,0.000040918374,0.000008819464,0.0000010771203,0.0014080609,0.0002513303,0.0000014032694,0.38744292,0.011331319,0.5993906],"study_design_scores_gemma":[0.00008170354,0.000012352834,0.00018386703,0.00011128334,0.0000027431786,0.000022688479,0.000011509417,0.6076103,4.080678e-7,0.005647924,0.38612378,0.00019147572],"about_ca_topic_score_codex":0.000017692186,"about_ca_topic_score_gemma":0.00003827191,"teacher_disagreement_score":0.60735893,"about_ca_system_score_codex":0.00010212627,"about_ca_system_score_gemma":0.00023167554,"threshold_uncertainty_score":0.999717},"labels":[],"label_agreement":null},{"id":"W2189364752","doi":"10.1109/icspc.2007.4728547","title":"LMST-based searching and broadcasting algorithms over Internet graphs and peer-to-peer computing systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Gossip; Flooding (psychology); Network topology; Theoretical computer science; Scheme (mathematics); Algorithm; Computer network; Mathematics","score_opus":0.02137722896287981,"score_gpt":0.2844844782893046,"score_spread":0.2631072493264248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189364752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34262753,0.0001327202,0.65282387,0.0017972603,0.0003642912,0.00030135646,0.0000021269566,0.0009407937,0.0010100394],"genre_scores_gemma":[0.7482128,9.773993e-7,0.2502086,0.00074620947,0.00006133822,0.00000499757,0.000001977891,0.000020850079,0.000742246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966722,0.00006849417,0.00047073484,0.00090956775,0.0009544514,0.00092455285],"domain_scores_gemma":[0.9979706,0.0006476567,0.000108293054,0.000599282,0.0003002653,0.00037390404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003062788,0.00032413425,0.00035468838,0.0006880851,0.00022494885,0.00092313235,0.001028785,0.00014276843,0.0000025194586],"category_scores_gemma":[0.00043425223,0.00029707004,0.00004665864,0.0010502298,0.00011000918,0.00033811145,0.0016688342,0.00042868682,0.000016471906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040679148,0.00010414851,0.06465397,0.00018393782,0.00011092854,0.0003484216,0.0048210267,0.008137685,0.0022816411,0.05559783,0.02364673,0.840073],"study_design_scores_gemma":[0.0005690347,0.00024916965,0.023791252,0.00026243064,0.000008171129,0.00012271217,0.0003987572,0.96521837,0.0015517822,0.00056846207,0.006649059,0.00061080535],"about_ca_topic_score_codex":0.0008143284,"about_ca_topic_score_gemma":0.00009431476,"teacher_disagreement_score":0.95708066,"about_ca_system_score_codex":0.00008899396,"about_ca_system_score_gemma":0.00003368936,"threshold_uncertainty_score":0.99994814},"labels":[],"label_agreement":null},{"id":"W2189555499","doi":"10.22215/etd/2009-06185","title":"A pro-active mobility management scheme for publish/subscribe middleware systems","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Scheme (mathematics); Middleware (distributed applications); Computer science; Publication; Mobility management; Computer network; World Wide Web; Political science; Telecommunications; Business; Operating system; Advertising; Mathematics","score_opus":0.02648022300078899,"score_gpt":0.27786192068867177,"score_spread":0.25138169768788277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189555499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018129608,0.001725731,0.7607525,0.004130296,0.008623028,0.02353375,0.0001558267,0.010963263,0.17198601],"genre_scores_gemma":[0.106676236,0.000077224875,0.69455683,0.0008057682,0.0004449749,0.013478259,0.0019820617,0.00015855058,0.18182008],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99632865,0.00004208092,0.00059511274,0.0015313004,0.00072675734,0.0007760982],"domain_scores_gemma":[0.99684244,0.00007480675,0.000318668,0.0019477492,0.00066719943,0.00014914172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047701015,0.000554895,0.00062039774,0.0005560842,0.00018428364,0.0009611494,0.0034522964,0.0005290996,0.000005869993],"category_scores_gemma":[0.00014122171,0.00051541213,0.00021101217,0.0011442422,0.00002499177,0.00084858894,0.00036022678,0.00036864553,0.000050853992],"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.0002229236,0.00070329505,0.000055463297,0.002434048,0.00056224235,0.00005317476,0.0012926615,0.00029375302,0.00012031567,0.31324226,0.22028466,0.4607352],"study_design_scores_gemma":[0.004534421,0.0033717484,0.030294238,0.0044903085,0.00047691658,0.000049044545,0.02306442,0.12408391,0.01551804,0.09640725,0.68774605,0.009963668],"about_ca_topic_score_codex":0.00009447272,"about_ca_topic_score_gemma":0.000380051,"teacher_disagreement_score":0.46746138,"about_ca_system_score_codex":0.00033384157,"about_ca_system_score_gemma":0.00012737108,"threshold_uncertainty_score":0.99972975},"labels":[],"label_agreement":null},{"id":"W2198209924","doi":"","title":"How P2P streaming systems scale over time under a flash crowd","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Gossip; Computer science; Popularity; Software deployment; Scale (ratio); Flash (photography); The Internet; Peer-to-peer; Crowdsourcing; Multimedia; Computer security; World Wide Web","score_opus":0.00917755638359438,"score_gpt":0.21651647002567495,"score_spread":0.20733891364208057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198209924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13789684,0.0002872587,0.81313944,0.019175082,0.0005176701,0.00043928885,0.000002741234,0.0041430974,0.024398606],"genre_scores_gemma":[0.9111141,0.0000034279556,0.051171195,0.0009173507,0.00010323218,0.000011185547,0.0000013115042,0.000011146924,0.036667034],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838966,0.000028145036,0.0001658869,0.00050273404,0.00038548146,0.0005280995],"domain_scores_gemma":[0.9987205,0.000058676975,0.000055990833,0.000988572,0.00006472352,0.000111503694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018244277,0.000194862,0.00022406637,0.00017551676,0.00009657597,0.00079509174,0.0014156364,0.0001310426,0.000010394472],"category_scores_gemma":[0.000028160686,0.00016594699,0.00005799589,0.0006875693,0.000034978,0.000585072,0.0003927497,0.0001440022,0.00038909115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101858,0.00024937096,0.0015232803,0.000026944888,0.00007869164,0.00010941912,0.0004463047,0.0067824204,0.023221837,0.19532326,0.4911991,0.28102916],"study_design_scores_gemma":[0.0015161935,0.0010761685,0.05470143,0.00036797536,0.000036472087,0.00021422123,0.0003234073,0.764727,0.022174887,0.030654276,0.12153771,0.002670237],"about_ca_topic_score_codex":0.000022198888,"about_ca_topic_score_gemma":0.00001699025,"teacher_disagreement_score":0.77321726,"about_ca_system_score_codex":0.00009811359,"about_ca_system_score_gemma":0.000031942505,"threshold_uncertainty_score":0.7667088},"labels":[],"label_agreement":null},{"id":"W2245716219","doi":"10.5555/2984075.2984077","title":"DynFilter: limiting bandwidth of online games using adaptive pub/sub message filtering","year":2015,"lang":"en","type":"article","venue":"Network and System Support for Games","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bandwidth (computing); Provisioning; Limiting; Computer network; Server; Bandwidth allocation; Dynamic bandwidth allocation; Distributed computing","score_opus":0.051401572269831185,"score_gpt":0.2670634268096929,"score_spread":0.21566185453986172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245716219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37658256,0.0015875197,0.61714554,0.00039615226,0.0012890932,0.00094284455,0.00006975879,0.00083436235,0.0011522016],"genre_scores_gemma":[0.8371297,0.000020829071,0.1621671,0.00007365584,0.00036744663,0.000047761605,0.000014751406,0.00003079512,0.00014794973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974022,0.000082179286,0.0007042985,0.00064454274,0.00040321972,0.0007635482],"domain_scores_gemma":[0.9981699,0.000217731,0.0003914008,0.0006989824,0.00027294992,0.00024906156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010411986,0.00033491544,0.0007236448,0.00019553267,0.000144882,0.00016117479,0.0008644916,0.00017409553,0.000001451185],"category_scores_gemma":[0.000087812856,0.00030478515,0.0001324506,0.00054359983,0.00009057328,0.0004229639,0.0007410567,0.0001580983,0.0000026908915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007187485,0.0005257835,0.06844444,0.0024054681,0.001193004,0.00050300744,0.010088116,0.10414396,0.0041901646,0.077922,0.08827378,0.64159155],"study_design_scores_gemma":[0.002166881,0.0022143498,0.0027743888,0.0023361724,0.00015329508,0.0005523849,0.0039821207,0.95012677,0.005390233,0.0024854117,0.026307484,0.0015104914],"about_ca_topic_score_codex":0.000026254009,"about_ca_topic_score_gemma":0.000032140124,"teacher_disagreement_score":0.84598285,"about_ca_system_score_codex":0.00010723484,"about_ca_system_score_gemma":0.00014167398,"threshold_uncertainty_score":0.99994045},"labels":[],"label_agreement":null},{"id":"W2262033883","doi":"10.1145/2843966.2843973","title":"Graph-Based Publish/Subscribe Research with Dynamic Subscriptions","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Publication; Graph; Computer network; Distributed computing; World Wide Web; Theoretical computer science","score_opus":0.1440187815207426,"score_gpt":0.3425611339701227,"score_spread":0.19854235244938012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262033883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034517944,0.000111498586,0.89487886,0.04563366,0.00035617847,0.00045054365,0.0000035370942,0.0027158365,0.021331964],"genre_scores_gemma":[0.7605296,0.0000019668742,0.23623309,0.0006161749,0.000021360773,0.000113420356,0.0000060983766,0.000016638303,0.0024616467],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693197,0.00013494883,0.0002019791,0.0006780308,0.0012066977,0.0008463662],"domain_scores_gemma":[0.9967366,0.00012278117,0.00003662225,0.0017683351,0.0009636745,0.00037200857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394228,0.00018199671,0.00017996274,0.0010370552,0.00020667123,0.000787695,0.0030531771,0.00011940617,0.000013112684],"category_scores_gemma":[0.00031756237,0.00014002252,0.00004236425,0.0049347924,0.00026980016,0.0009933247,0.00069524226,0.00047920455,0.00031656347],"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.000047387195,0.00031395437,0.004803041,0.00001226525,0.000040499293,0.00013720564,0.00055907585,0.0033190656,0.00054732314,0.3288927,0.63584465,0.025482802],"study_design_scores_gemma":[0.0041267113,0.004133226,0.020947404,0.00019112063,0.000025585774,0.00016056356,0.002431187,0.4574246,0.0058929333,0.23315275,0.26901725,0.0024966367],"about_ca_topic_score_codex":0.00021561512,"about_ca_topic_score_gemma":0.0013314424,"teacher_disagreement_score":0.72601163,"about_ca_system_score_codex":0.0002033682,"about_ca_system_score_gemma":0.0004262432,"threshold_uncertainty_score":0.75957614},"labels":[],"label_agreement":null},{"id":"W2269510645","doi":"10.82308/28511","title":"Journey, a shared virtual space middleware","year":2011,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Fault tolerance; Middleware (distributed applications); Overhead (engineering); Load balancing (electrical power); Replication (statistics); Database; Operating system","score_opus":0.04390075642936186,"score_gpt":0.22998853536159886,"score_spread":0.186087778932237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269510645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8905615,0.0002797352,0.001195875,0.0009698818,0.0024624434,0.0011683393,0.00041820214,0.0063908836,0.09655309],"genre_scores_gemma":[0.9093627,0.00003260542,0.08697499,0.0011199579,0.000045769815,0.0001108196,0.00000833787,0.000095475836,0.0022493813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948263,0.0002724144,0.0007422933,0.0016057644,0.001054108,0.001499112],"domain_scores_gemma":[0.99577296,0.00020163938,0.00032110984,0.0025836409,0.00040827255,0.0007123609],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010756832,0.0007193541,0.000636249,0.0006740556,0.0010166639,0.0002879811,0.0053261044,0.00050618907,0.00019648044],"category_scores_gemma":[0.00110893,0.0007312626,0.00029634903,0.0021389897,0.00015037901,0.0024784047,0.0031077273,0.0013181877,0.0021387313],"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.00006254181,0.0003035481,0.00023942486,0.000025081652,0.00013111577,0.0004935422,0.000082777944,0.00006769228,0.010846247,0.7265647,0.00038816736,0.26079515],"study_design_scores_gemma":[0.0029941923,0.0023014443,0.009693668,0.0006575514,0.00012385819,0.0007639183,0.00057243224,0.001794487,0.2805481,0.27556482,0.42018402,0.004801515],"about_ca_topic_score_codex":0.0001925032,"about_ca_topic_score_gemma":0.00026459948,"teacher_disagreement_score":0.45099992,"about_ca_system_score_codex":0.0005364605,"about_ca_system_score_gemma":0.000058397683,"threshold_uncertainty_score":0.99951386},"labels":[],"label_agreement":null},{"id":"W2274602986","doi":"","title":"Agent-based simulation of twitter for building effective recommender system","year":2014,"lang":"en","type":"article","venue":"Annual Simulation Symposium","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scalability; Recommender system; Information retrieval; Social media; Process (computing); World Wide Web; Data mining; Database","score_opus":0.018087404767395076,"score_gpt":0.29665848541501116,"score_spread":0.2785710806476161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274602986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04410126,0.000007875897,0.95259964,0.0011383697,0.00046204694,0.000916741,0.000011468838,0.00054352405,0.00021908927],"genre_scores_gemma":[0.9615823,1.0481468e-7,0.03768402,0.00045088877,0.00011858526,0.00009595361,0.000009935462,0.000019720213,0.000038465485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839145,0.00014102514,0.00039866797,0.000458258,0.00030286596,0.00030775933],"domain_scores_gemma":[0.99698704,0.0016509941,0.00023855589,0.0005798806,0.000474325,0.00006922887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006693128,0.00019093418,0.00027562218,0.00027872768,0.00012811304,0.00007213315,0.0005435486,0.0001454452,0.0000012781785],"category_scores_gemma":[0.0001957841,0.00018663553,0.00010808613,0.00049572875,0.000025442252,0.00041746895,0.0001609704,0.0000836479,0.000015029212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034367877,0.000026637252,0.00045447153,0.000057718215,0.0000177864,2.7601598e-7,0.00038941935,0.98201716,0.0014477442,0.003227235,0.0002967885,0.012030386],"study_design_scores_gemma":[0.00064794364,0.00028158753,0.0009307026,0.00007110891,0.000014919435,3.544112e-7,0.000040906587,0.98110783,0.006835976,0.00049427175,0.009367795,0.00020659843],"about_ca_topic_score_codex":0.000009648629,"about_ca_topic_score_gemma":0.0000011935231,"teacher_disagreement_score":0.91748106,"about_ca_system_score_codex":0.0001433676,"about_ca_system_score_gemma":0.000018649773,"threshold_uncertainty_score":0.7610776},"labels":[],"label_agreement":null},{"id":"W2279678194","doi":"","title":"The State of Free Software in Mobile Devices","year":2010,"lang":"en","type":"article","venue":"˜The œopen source business resource","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Software; State (computer science); Operating system; Programming language","score_opus":0.011073350043129327,"score_gpt":0.2422569612130374,"score_spread":0.23118361116990807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279678194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86817425,0.0009985685,0.11607809,0.009354107,0.000495179,0.0020093126,0.000016177339,0.00082218007,0.0020521276],"genre_scores_gemma":[0.973959,0.000025925227,0.020551993,0.0011226524,0.00010528167,0.00038644575,0.000003471698,0.000065458604,0.0037797403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99753815,0.00013374806,0.00050768856,0.0005848049,0.00057634444,0.00065925106],"domain_scores_gemma":[0.9950356,0.0008203638,0.00030774905,0.0034729957,0.00027960766,0.00008371102],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0013919252,0.00028266612,0.00035615577,0.000178425,0.0004354536,0.0007700834,0.014906528,0.00012166985,0.000008102022],"category_scores_gemma":[0.00041652936,0.00017444824,0.0000628409,0.0026037344,0.00041294852,0.00036969283,0.007539647,0.0004907443,0.000053763742],"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.00006689726,0.00011885996,0.0068858606,0.00003240802,0.000033283366,0.000020951677,0.002685028,0.02171034,0.0010008188,0.0009829592,0.012486614,0.953976],"study_design_scores_gemma":[0.0004413692,0.00004626124,0.038685717,0.00006931154,0.0000066060175,0.000025992424,0.0002869915,0.004523118,0.0005945546,0.0037964385,0.95118225,0.0003413749],"about_ca_topic_score_codex":0.0008048337,"about_ca_topic_score_gemma":0.006481868,"teacher_disagreement_score":0.9536346,"about_ca_system_score_codex":0.000034961668,"about_ca_system_score_gemma":0.00011538891,"threshold_uncertainty_score":0.9904233},"labels":[],"label_agreement":null},{"id":"W2284445379","doi":"10.1109/cloudcom.2015.65","title":"The Ignite Distributed Collaborative Scientific Visualization System","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Visualization; Computer science; Data visualization; Data science; Human–computer interaction; Data mining","score_opus":0.02231549566164623,"score_gpt":0.26832782362588226,"score_spread":0.24601232796423603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284445379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058280104,0.00013556343,0.9849771,0.0028182182,0.0012084476,0.00034434008,0.000012341151,0.0016985646,0.0029773747],"genre_scores_gemma":[0.98392177,0.0000013302872,0.014380624,0.00007569693,0.000035836987,0.00005574977,0.000017101367,0.0000066934413,0.0015052272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858695,0.00009392179,0.00019036833,0.0003520163,0.00047777986,0.00029893694],"domain_scores_gemma":[0.998076,0.000100830825,0.00007550234,0.00079229916,0.0008391318,0.00011619909],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009228996,0.00010736481,0.000101628306,0.00010195055,0.00045184462,0.0012894702,0.0014502981,0.000052730353,4.90691e-7],"category_scores_gemma":[0.0003073879,0.000068799774,0.000017995968,0.0035043177,0.00013031212,0.00036362335,0.00058682647,0.000058337606,0.00022014749],"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.0000047560657,0.000015514457,0.00020268398,0.0000033973456,0.000011094367,0.0000058736373,0.00053635443,0.0008202876,0.00014310575,0.8034573,0.18900017,0.0057994258],"study_design_scores_gemma":[0.0005256226,0.00022797362,0.00060582504,0.000057605597,0.000009513596,0.000018395609,0.005135315,0.496395,0.012918885,0.008816862,0.47479156,0.0004974348],"about_ca_topic_score_codex":0.0000088665565,"about_ca_topic_score_gemma":0.000054516022,"teacher_disagreement_score":0.97809374,"about_ca_system_score_codex":0.00018661615,"about_ca_system_score_gemma":0.00018267421,"threshold_uncertainty_score":0.9997473},"labels":[],"label_agreement":null},{"id":"W2286153064","doi":"10.1007/s12083-016-0436-5","title":"A fault tolerant peer-to-peer spatial data structure","year":2016,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Bank of Canada","funders":"","keywords":"Computer science; Hash function; Hash table; Redundancy (engineering); Distributed hash table; Backup; Node (physics); Range query (database); Theoretical computer science; Algorithm; Peer-to-peer; Distributed computing; Search engine","score_opus":0.02979607622787121,"score_gpt":0.28679192954184785,"score_spread":0.2569958533139766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286153064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009234961,0.00016116581,0.7714662,0.21266559,0.0010722403,0.0020235148,0.0007972195,0.0015719236,0.0010071993],"genre_scores_gemma":[0.80867773,0.000022850478,0.16598146,0.0061744037,0.003297812,0.0011245558,0.00032504363,0.00014446153,0.014251704],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99144363,0.000112968606,0.0009568487,0.0029926049,0.0026801035,0.0018138697],"domain_scores_gemma":[0.99067366,0.00047281198,0.0002497541,0.0056652334,0.0016904781,0.0012480718],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017033038,0.0008721144,0.0008169574,0.0006755266,0.00090218516,0.0010169098,0.007050021,0.00042235208,0.000043952634],"category_scores_gemma":[0.0007584907,0.0007201007,0.00012632858,0.0030793734,0.00017047251,0.0005555617,0.0055010486,0.0006490055,0.0007217688],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033147775,0.00008926763,0.0011783972,0.000014660885,0.00007630965,0.000013516056,0.00071124424,0.0028315338,0.0019164744,0.0061812606,0.34969574,0.6372584],"study_design_scores_gemma":[0.00053795055,0.00016895862,0.0035130745,0.00016184947,0.00005335254,0.000060941773,0.00006575622,0.010155009,0.0006281278,0.004879835,0.97862697,0.0011482042],"about_ca_topic_score_codex":0.00031364444,"about_ca_topic_score_gemma":0.00064136455,"teacher_disagreement_score":0.79944277,"about_ca_system_score_codex":0.00023964875,"about_ca_system_score_gemma":0.0001950597,"threshold_uncertainty_score":0.999525},"labels":[],"label_agreement":null},{"id":"W2288875257","doi":"10.4108/icst.simutools2010.8632","title":"The perils of using simulations to evaluate Massively Multiplayer Online Game performance","year":2012,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Computer science; Benchmark (surveying); Massively parallel; Multimedia; Human–computer interaction; Distributed computing; Parallel computing; Database","score_opus":0.06748986261652791,"score_gpt":0.32995220484132937,"score_spread":0.26246234222480147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288875257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7776546,0.000055408887,0.21977755,0.0017191238,0.00023485343,0.00021106127,0.000004651656,0.00017727056,0.00016549802],"genre_scores_gemma":[0.79352635,0.0000036352346,0.2058937,0.0002119149,0.000049844984,0.0000057628404,6.177188e-7,0.0000063127914,0.00030185957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987506,0.000033320885,0.00024263431,0.00019219874,0.0003425949,0.00043862386],"domain_scores_gemma":[0.9987305,0.00019479408,0.00007460935,0.0007096474,0.00019356623,0.00009688955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036600218,0.000119993136,0.00013007317,0.00011743441,0.00016426042,0.000059825717,0.0010282905,0.000048648566,0.000010316402],"category_scores_gemma":[0.00020944473,0.000080054146,0.00003624623,0.00070085656,0.000049765113,0.0004317326,0.0006894325,0.000100030265,0.00004541483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028479195,0.00020566517,0.042026658,0.000014925945,0.00005625935,0.0000010921569,0.0027326017,0.66653633,0.039639477,0.008622021,0.0017360536,0.23840043],"study_design_scores_gemma":[0.0001185268,0.00004918199,0.042565905,0.000018609346,0.0000056697245,0.0000037674401,0.000066611574,0.941897,0.009424915,0.00012590828,0.0055799354,0.00014399861],"about_ca_topic_score_codex":0.000018104021,"about_ca_topic_score_gemma":0.000023923803,"teacher_disagreement_score":0.27536064,"about_ca_system_score_codex":0.000058998325,"about_ca_system_score_gemma":0.000041756575,"threshold_uncertainty_score":0.32645133},"labels":[],"label_agreement":null},{"id":"W2289132816","doi":"10.1109/glocom.2015.7417836","title":"A Hierarchical Architecture for Distributed EPCglobal Discovery Services","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Architecture; Service discovery; World Wide Web; Distributed computing; Computer network; Web service; Geography","score_opus":0.06012163465902565,"score_gpt":0.3265022655987379,"score_spread":0.26638063093971226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289132816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007814534,0.0006326411,0.93732756,0.045832936,0.00066281453,0.0009905915,0.0012871012,0.0012309892,0.0042208005],"genre_scores_gemma":[0.7817089,0.00005554001,0.21647547,0.0009318782,0.000079233716,0.0003193229,0.00029514942,0.000015871336,0.00011863478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674225,0.00028495994,0.0006087432,0.00082170696,0.00062238483,0.0009199352],"domain_scores_gemma":[0.9925972,0.00028372562,0.00024384406,0.0054944213,0.00082947576,0.00055129465],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006420354,0.00047166244,0.00053007546,0.000140041,0.00041681854,0.0010015134,0.012131034,0.00029123764,0.0000030640097],"category_scores_gemma":[0.0003040786,0.0004476166,0.00017898284,0.0015455277,0.00042433574,0.0009920564,0.003790239,0.0005004858,0.0001574266],"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.00013909086,0.0005820668,0.0033919164,0.000053390988,0.00016370477,0.000010097337,0.0007021803,0.0020935151,0.00011888804,0.7502738,0.13816804,0.10430329],"study_design_scores_gemma":[0.0021204033,0.0005910708,0.004519078,0.00023534845,0.000077881145,0.00013884176,0.00061540515,0.11162206,0.00024946473,0.39637083,0.48191866,0.0015409526],"about_ca_topic_score_codex":0.00040926627,"about_ca_topic_score_gemma":0.0024995953,"teacher_disagreement_score":0.77389437,"about_ca_system_score_codex":0.00048447918,"about_ca_system_score_gemma":0.0007004244,"threshold_uncertainty_score":0.9997976},"labels":[],"label_agreement":null},{"id":"W2291736261","doi":"","title":"On-Demand Media Streaming on the Internet: Trends and Issues","year":2001,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Multicast; Software deployment; Quality of service; Standardization; The Internet; Key (lock); Bandwidth (computing); Real Time Streaming Protocol; On demand; Reliable multicast; Video on demand; Service (business); Computer network; Multimedia; Telecommunications; World Wide Web; Computer security; Xcast; Business","score_opus":0.0213995650436841,"score_gpt":0.25747333833855696,"score_spread":0.23607377329487286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291736261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.731693,0.0003604136,0.054718964,0.11823158,0.00057948317,0.0001502444,0.0000011657975,0.0015317244,0.092733376],"genre_scores_gemma":[0.9844759,0.000042782463,0.0057271104,0.001380049,0.00005147741,0.000009059947,4.119252e-7,0.0000058342516,0.008307347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912745,0.000024713645,0.00010294171,0.0003070915,0.00020861563,0.00022917226],"domain_scores_gemma":[0.9990242,0.00034326833,0.000025027259,0.00054250454,0.000015925287,0.000049032522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018270919,0.00012345842,0.000105772015,0.00016073353,0.000057188485,0.00015988102,0.0009104008,0.00005038154,0.000057983878],"category_scores_gemma":[0.000097671895,0.00007186205,0.000020950429,0.00041742652,0.000057560064,0.000107615226,0.00039489602,0.0001280746,0.00008466164],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065339445,0.00003143021,0.000917393,8.427158e-7,0.000013663639,0.00003106892,0.0009969765,0.00004796518,0.00003480695,0.28218096,0.103611365,0.612127],"study_design_scores_gemma":[0.0015796871,0.0029124098,0.12673126,0.00045340895,0.000027808765,0.00018103578,0.0012759512,0.17833012,0.026230652,0.21189654,0.4483039,0.0020772112],"about_ca_topic_score_codex":0.00003952124,"about_ca_topic_score_gemma":0.00011981406,"teacher_disagreement_score":0.6100498,"about_ca_system_score_codex":0.000017657923,"about_ca_system_score_gemma":0.0000040482428,"threshold_uncertainty_score":0.29304495},"labels":[],"label_agreement":null},{"id":"W2297822210","doi":"","title":"Web 2.0 Desktop","year":2008,"lang":"en","type":"article","venue":"EdMedia: World Conference on Educational Media and Technology","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":"Royal Military College Saint-Jean; University of Alberta","funders":"","keywords":"Computer science; World Wide Web; Web application; Computer graphics (images)","score_opus":0.039990293944164534,"score_gpt":0.2600638476476389,"score_spread":0.22007355370347437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297822210","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05275196,0.00042263267,0.0026730818,0.93534094,0.0022079498,0.00028937488,0.00000770104,0.0011405597,0.0051657767],"genre_scores_gemma":[0.9670623,0.00027183662,0.029610844,0.00095415703,0.00026402823,0.00025929074,0.000009781731,0.000013043899,0.0015547305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801713,0.000031093892,0.00029282816,0.0007221118,0.0003944566,0.0005423929],"domain_scores_gemma":[0.9980768,0.00047933936,0.000099340075,0.0008646691,0.0002615836,0.0002182627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001480843,0.00026558523,0.00030455954,0.0014403133,0.0002353766,0.000052821746,0.0015940423,0.0002220074,0.00011438947],"category_scores_gemma":[0.0007049026,0.0002535908,0.00003199698,0.0022348987,0.0006142677,0.00020418857,0.00047981102,0.000540261,0.00037903443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035364162,0.000102340084,0.00793845,0.000003851076,0.0000122487645,0.000023461984,0.00027654995,0.0000010857791,0.00051250914,0.95190406,0.024459377,0.014762533],"study_design_scores_gemma":[0.0002903497,0.00012729468,0.014450284,0.0000502949,0.000004964099,0.00014670365,0.000021250265,0.0005827259,0.0027271423,0.97461283,0.006612789,0.00037337228],"about_ca_topic_score_codex":0.0000068105774,"about_ca_topic_score_gemma":0.0001291196,"teacher_disagreement_score":0.9343868,"about_ca_system_score_codex":0.000073799034,"about_ca_system_score_gemma":0.0006936546,"threshold_uncertainty_score":0.99999166},"labels":[],"label_agreement":null},{"id":"W2311683113","doi":"","title":"Investigating and improving BitTorrent's piece and neighbor selection algorithms","year":2008,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"BitTorrent; Computer science; Selection (genetic algorithm); Algorithm; Artificial intelligence; World Wide Web; The Internet","score_opus":0.011497062355442214,"score_gpt":0.20956153381002884,"score_spread":0.19806447145458664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311683113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674356,0.00068933883,0.026848704,0.00034324662,0.0008794544,0.0005171098,0.000014097487,0.0012624324,0.0020100041],"genre_scores_gemma":[0.8817725,0.0011061692,0.10233529,0.0002997755,0.0003250843,0.000010425841,0.00022793062,0.00011362084,0.013809174],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99805194,0.000058168745,0.00020121373,0.00094263745,0.00031515202,0.00043088672],"domain_scores_gemma":[0.9988909,0.000090479785,0.000232946,0.00038908265,0.00017519752,0.00022142401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000108275744,0.00038071172,0.00033637328,0.00095688726,0.00047741263,0.00020076653,0.00083491695,0.0004225725,0.0000022020681],"category_scores_gemma":[0.0001072017,0.00045999236,0.000055397733,0.001666527,0.00009869524,0.00080165983,0.00042642315,0.00056878175,0.000007514393],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050689225,0.000099137505,0.29434824,0.00039937347,0.00020549144,0.00033631708,0.00081214565,0.00022262492,0.00058292097,0.006371368,0.023362564,0.67320913],"study_design_scores_gemma":[0.008053402,0.0030239108,0.13419132,0.0030223008,0.0009655209,0.0000034000095,0.073731005,0.31260306,0.056041062,0.005931944,0.39003798,0.012395082],"about_ca_topic_score_codex":0.0004000729,"about_ca_topic_score_gemma":0.014810813,"teacher_disagreement_score":0.66081405,"about_ca_system_score_codex":0.00017770314,"about_ca_system_score_gemma":0.00016702371,"threshold_uncertainty_score":0.9997852},"labels":[],"label_agreement":null},{"id":"W2312170961","doi":"10.5555/2348196.2348211","title":"Managing traffic in peer-to-peer networks: the token-web protocol","year":2011,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Computer network; Flooding (psychology); PlanetLab; Protocol (science); Security token; Peer-to-peer; Distributed computing; World Wide Web; The Internet","score_opus":0.0760059497648742,"score_gpt":0.3052635886454518,"score_spread":0.2292576388805776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312170961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006986625,0.000007551038,0.9637208,0.007995954,0.0006731253,0.0183269,0.0000020151426,0.00091586716,0.001371194],"genre_scores_gemma":[0.90594786,7.5716144e-7,0.08333823,0.0020992078,0.00018273943,0.008084134,0.000003914746,0.000027606808,0.0003155727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964953,0.00021218762,0.0006618993,0.0009997278,0.0007802748,0.00085061084],"domain_scores_gemma":[0.99704695,0.00029882265,0.00017285196,0.0015759914,0.0007071045,0.00019826023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010681149,0.00042487256,0.00036973236,0.0005008159,0.00021020557,0.00051963434,0.0034296387,0.00017188054,0.0000435461],"category_scores_gemma":[0.00009913861,0.00034993247,0.00009462882,0.0019063056,0.00009235387,0.000708266,0.0014367121,0.0005133799,0.00020636454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027048105,0.000071061324,0.0016675683,0.000008953409,0.000014612308,0.000021219137,0.0021366165,0.7346466,0.000004410062,0.008315417,0.003355951,0.24973056],"study_design_scores_gemma":[0.0005270119,0.00015354734,0.010983488,0.00008800421,0.0000044526573,0.000003903075,0.000039981238,0.95770395,0.000041630756,0.002266113,0.027738675,0.00044924376],"about_ca_topic_score_codex":0.000057057776,"about_ca_topic_score_gemma":0.0002401007,"teacher_disagreement_score":0.8989612,"about_ca_system_score_codex":0.00010692629,"about_ca_system_score_gemma":0.000120400364,"threshold_uncertainty_score":0.9998953},"labels":[],"label_agreement":null},{"id":"W2317449157","doi":"10.7763/jacn.2014.v2.90","title":"A Statistical Network Traffic Model for First-Person Shooter Games","year":2014,"lang":"en","type":"article","venue":"Journal of Advances in Computer Networks","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":"Canadian Virtual University; University of Ottawa","funders":"","keywords":"Computer science; Traffic model; Simulation; Computer network","score_opus":0.01367633516929374,"score_gpt":0.2599453326853588,"score_spread":0.24626899751606507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317449157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016639995,0.0029460303,0.9906418,0.0021132738,0.002178257,0.00026920234,0.0000019543654,0.00014115847,0.00004433389],"genre_scores_gemma":[0.3359549,0.00024716367,0.6614949,0.00088099524,0.0013688428,0.000016891683,0.0000011542542,0.00002139388,0.000013739063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972829,0.00009888321,0.00082422583,0.00049732137,0.0004382603,0.0008584135],"domain_scores_gemma":[0.99733114,0.0012374376,0.00043380787,0.0005629881,0.0002211414,0.00021346175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001206199,0.0003285296,0.00069584,0.00027656014,0.00012513339,0.00021145273,0.002026862,0.0001867586,0.0000018646417],"category_scores_gemma":[0.00010997479,0.00028572654,0.00017953957,0.0006330599,0.000093830226,0.0009255745,0.00031253905,0.0006166736,0.0000027710407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043538526,0.000038010614,0.0001449309,0.0000117086565,0.000012570307,0.0000133921385,0.000111740505,0.62065375,1.3463273e-7,0.004152281,0.0162659,0.35855204],"study_design_scores_gemma":[0.00078934187,0.0006847706,0.00032477538,0.0002561075,0.000011767237,0.00007292559,0.00000470935,0.96251,0.0000016129641,0.015888674,0.019140394,0.000314938],"about_ca_topic_score_codex":4.234422e-7,"about_ca_topic_score_gemma":0.000047321213,"teacher_disagreement_score":0.3582371,"about_ca_system_score_codex":0.00012945078,"about_ca_system_score_gemma":0.000055895584,"threshold_uncertainty_score":0.99995947},"labels":[],"label_agreement":null},{"id":"W2321027716","doi":"10.1109/tmm.2016.2538721","title":"A Geometric Approach to Server Selection for Interactive Video Streaming","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Computer science; PlanetLab; Computer network; Scalability; Relay; Backup; Operating system","score_opus":0.022012313335899803,"score_gpt":0.2598254123809206,"score_spread":0.2378130990450208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321027716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018443955,0.0000062690633,0.9775041,0.0013414278,0.0008634362,0.0008316881,0.000028124292,0.0008394153,0.00014161212],"genre_scores_gemma":[0.69127923,0.000003706036,0.3072677,0.0001723078,0.000055302236,0.00052628625,7.394607e-7,0.000019706196,0.0006750454],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99820405,0.00004008501,0.00024995496,0.0007085298,0.00030836428,0.0004889934],"domain_scores_gemma":[0.99833995,0.0006743185,0.00006574872,0.0005378877,0.00019867772,0.00018342826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023055624,0.00023538333,0.00022164633,0.0011624888,0.00017734997,0.000091122856,0.00080016,0.00014065902,0.0000105775425],"category_scores_gemma":[0.00010806819,0.00018535373,0.00012301414,0.0022099013,0.00003108345,0.0006083194,0.000011047639,0.00019628377,0.00021095254],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007422557,0.00029816545,0.000034147397,0.000009692118,0.00006762862,8.092486e-7,0.0005716987,0.009128523,0.008600085,0.000068329835,0.0019261534,0.97922057],"study_design_scores_gemma":[0.0032469002,0.0017780177,0.0028209435,0.00024999006,0.000080478305,0.00004662919,0.00022279761,0.3880484,0.59076446,0.0007295417,0.010559528,0.0014522629],"about_ca_topic_score_codex":0.000054652468,"about_ca_topic_score_gemma":0.000078582234,"teacher_disagreement_score":0.9777683,"about_ca_system_score_codex":0.0003370486,"about_ca_system_score_gemma":0.000049052807,"threshold_uncertainty_score":0.75585055},"labels":[],"label_agreement":null},{"id":"W2338278990","doi":"","title":"Agents and P2P Combined For E-commerce","year":2003,"lang":"en","type":"article","venue":"reroDoc Digital Library","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Business; Computer science; Internet privacy","score_opus":0.017072943967003675,"score_gpt":0.22273145529575403,"score_spread":0.20565851132875035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338278990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41309658,0.0014844385,0.22460489,0.03960701,0.0012820996,0.0025382058,0.00034579795,0.0082288,0.30881217],"genre_scores_gemma":[0.92796016,0.00001857373,0.06393068,0.0023202098,0.000025849195,0.000046418776,0.000029772622,0.000033053788,0.005635288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889106,0.000018102419,0.00017733085,0.0004159714,0.00014197204,0.00035554825],"domain_scores_gemma":[0.99906486,0.00015470044,0.00004395166,0.0005825372,0.0000144433925,0.00013949112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000067088426,0.00016327346,0.00017616009,0.000109421,0.00007714723,0.00076892023,0.00084606156,0.00007005043,0.0000061770293],"category_scores_gemma":[0.00013229223,0.00015418575,0.00005144262,0.0004182878,0.000050484974,0.002536788,0.0005998437,0.000082579456,0.00006551129],"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.00002374799,0.00012890043,0.0119225625,0.000031756532,0.00003420039,0.000025315334,0.00007780591,0.00001149211,0.00002288356,0.46049333,0.3546302,0.17259778],"study_design_scores_gemma":[0.00054319616,0.00031881643,0.006641321,0.00003531983,0.0000033553629,0.000025771187,0.000017569999,0.0008502482,0.001812511,0.083462335,0.9059155,0.00037406548],"about_ca_topic_score_codex":2.5036414e-7,"about_ca_topic_score_gemma":8.5825434e-8,"teacher_disagreement_score":0.55128527,"about_ca_system_score_codex":0.00000941204,"about_ca_system_score_gemma":0.0000307328,"threshold_uncertainty_score":0.7414716},"labels":[],"label_agreement":null},{"id":"W2339442706","doi":"10.1145/2872518.2890584","title":"Distributed Wikis and Social Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Incentive; Focus (optics); Process (computing); Social network (sociolinguistics); Recommender system; Quality (philosophy); Network topology; World Wide Web; Peer-to-peer; Data science; Social media; Computer network","score_opus":0.010578254097337146,"score_gpt":0.2180164465519774,"score_spread":0.20743819245464026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339442706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012054433,0.000032406595,0.9543583,0.031698924,0.00013445147,0.00006744455,0.0000035524233,0.0009248013,0.0007257192],"genre_scores_gemma":[0.9765826,0.000009616593,0.022115013,0.0006121579,0.00007763154,0.000010261004,9.891589e-7,0.00000466795,0.00058705074],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917793,0.00001563128,0.00010169377,0.0002819088,0.00012046135,0.00030236298],"domain_scores_gemma":[0.99951416,0.000075769065,0.00002532982,0.0002977046,0.000036302918,0.000050743212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011767186,0.00009292316,0.00010562805,0.000044354605,0.000099558645,0.00008661962,0.0006590074,0.00008354954,0.000009586177],"category_scores_gemma":[0.000029109593,0.000058416936,0.000021601934,0.00028357963,0.00007273761,0.00021328116,0.0007130461,0.000055043558,0.000039455306],"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.0000038222097,0.000014463001,0.0020614802,0.000001409663,0.000013576909,0.00001009509,0.00006410609,0.000019175757,0.0003106069,0.20210539,0.13570313,0.65969276],"study_design_scores_gemma":[0.0025109905,0.0005243577,0.16191317,0.00008894623,0.000023802857,0.00008564372,0.00011118683,0.07998507,0.005525057,0.10279669,0.64429086,0.0021442247],"about_ca_topic_score_codex":0.000006762894,"about_ca_topic_score_gemma":0.00001581589,"teacher_disagreement_score":0.9645282,"about_ca_system_score_codex":0.000029252766,"about_ca_system_score_gemma":0.000010356224,"threshold_uncertainty_score":0.23821734},"labels":[],"label_agreement":null},{"id":"W2346303019","doi":"","title":"An Analysis of a New P2P Trust Control Model","year":2016,"lang":"en","type":"article","venue":"Canadian social science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bottleneck; Computer science; Value (mathematics); Trust anchor; Control (management); Simple (philosophy); Social trust; Point (geometry); Relation (database); Computational trust; Computer security; Arithmetic; Mathematics; Reputation; Law; Data mining; Political science; Social capital; Artificial intelligence; Epistemology","score_opus":0.015631534820622975,"score_gpt":0.2565744760927253,"score_spread":0.24094294127210236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346303019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12815826,0.000018459848,0.8526012,0.010381521,0.00016055461,0.00017379154,0.00006352981,0.00021360643,0.008229127],"genre_scores_gemma":[0.9893954,9.894221e-7,0.009328874,0.0009597492,0.000040656396,0.0000055432315,2.8251898e-7,0.0000037687323,0.0002647671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981942,0.000019388552,0.00017260337,0.00049348833,0.00045320136,0.00066708867],"domain_scores_gemma":[0.99832416,0.000029404942,0.00007262741,0.00064462103,0.0001752964,0.0007538818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005201905,0.00010503807,0.00023484172,0.00092710095,0.0002868019,0.00012469865,0.0033259888,0.0000767736,0.000013915553],"category_scores_gemma":[0.00016936424,0.000084479616,0.00007772477,0.005294023,0.0004958665,0.00067110424,0.000107447086,0.000054712084,0.000014409245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005217724,0.00002336007,0.029334463,0.0000014341842,0.00009036223,0.000015824036,0.0029279422,0.0024865498,0.01593098,0.49009824,0.006903001,0.45218262],"study_design_scores_gemma":[0.00069018145,0.00016408532,0.08497958,0.000018167106,0.0001551115,0.0000018821513,0.00036889297,0.8850808,0.0021675928,0.01854826,0.0069974004,0.0008280395],"about_ca_topic_score_codex":0.011874118,"about_ca_topic_score_gemma":0.050113034,"teacher_disagreement_score":0.8825942,"about_ca_system_score_codex":0.00051918725,"about_ca_system_score_gemma":0.0018207895,"threshold_uncertainty_score":0.9947059},"labels":[],"label_agreement":null},{"id":"W2348651467","doi":"","title":"File Server Technique Based on P2P","year":2005,"lang":"en","type":"article","venue":"Microcomputer Development","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Computer science; BitTorrent; Internet Authentication Service; File Transfer Protocol; AppleShare; Operating system; Server farm; Computer network; The Internet; Windows Server; File server; Protocol (science); Client–server model; Application server; Server","score_opus":0.009712543128879944,"score_gpt":0.21249696320071573,"score_spread":0.20278442007183578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348651467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029034459,0.000025308647,0.9870562,0.006151955,0.00014958448,0.0006339298,0.0000060406283,0.0016721904,0.0014013483],"genre_scores_gemma":[0.035346728,7.2453304e-7,0.9563827,0.0069473404,0.000094562725,0.00037468775,0.000020022973,0.000022628301,0.0008106128],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779385,0.000036533682,0.00037551884,0.0007720801,0.00040381952,0.0006181858],"domain_scores_gemma":[0.9986479,0.00008298367,0.00007891438,0.000954865,0.000091297065,0.00014398496],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031292,0.00032906135,0.00024047753,0.00040859697,0.00016509664,0.00020117291,0.0022396964,0.00014676938,0.00014911305],"category_scores_gemma":[0.000007757941,0.00031265468,0.000066596076,0.000716728,0.000026381587,0.00022184422,0.0010874664,0.0002509032,0.0014188181],"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.0000063343823,0.00018864656,0.00010614742,0.000014098651,0.000019053014,0.000035345325,0.00040115594,0.003839775,0.0017182297,0.0007559815,0.3674685,0.62544674],"study_design_scores_gemma":[0.00021990998,0.00006295619,0.003154148,0.00010457785,0.0000010287625,0.000013910706,0.0000013259435,0.008989352,0.13074417,0.000097970646,0.8561742,0.00043644584],"about_ca_topic_score_codex":0.0000034698946,"about_ca_topic_score_gemma":0.0000128311685,"teacher_disagreement_score":0.6250103,"about_ca_system_score_codex":0.0003621493,"about_ca_system_score_gemma":0.0002499362,"threshold_uncertainty_score":0.9999325},"labels":[],"label_agreement":null},{"id":"W2350013284","doi":"","title":"A novel DHT-based multiple keywords information search model in P2P networks","year":2008,"lang":"en","type":"article","venue":"Journal of Circuits and Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Computer science; Node (physics); Matching (statistics); Resource (disambiguation); Routing (electronic design automation); Search engine; Search algorithm; Peer-to-peer; Search problem; Information retrieval; Theoretical computer science; Distributed computing; Computer network; Algorithm; Mathematics","score_opus":0.043628415008749116,"score_gpt":0.23974007785590648,"score_spread":0.19611166284715736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350013284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17682457,0.0003337302,0.8217126,0.00042972423,0.0003087222,0.00015340876,0.0000017222611,0.000041355466,0.0001941744],"genre_scores_gemma":[0.99484247,0.00003744924,0.0048253317,0.00018220594,0.00007362338,0.0000058500345,5.728392e-7,0.000005372988,0.000027125321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983836,0.000041940122,0.0006439629,0.00012031504,0.0005102131,0.00030001308],"domain_scores_gemma":[0.9989506,0.00011439214,0.0002616874,0.00026691522,0.0002822216,0.0001241715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009837226,0.00012168317,0.0003059434,0.00049602345,0.00009325007,0.00017505413,0.0006550064,0.00012077165,2.5320264e-7],"category_scores_gemma":[0.00010005803,0.000100301826,0.000052045,0.0005789714,0.00003675135,0.0009728937,0.000099315526,0.00033554155,0.0000025417312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008048693,0.00003923517,0.0061821537,0.000022921837,0.000010219147,0.000027497808,0.00087164517,0.9740709,0.00025784143,0.0012470777,0.0012251945,0.016037265],"study_design_scores_gemma":[0.0007810324,0.00012073491,0.0063777347,0.00014408374,0.0000018084112,0.00035475905,0.00007483299,0.99118745,0.00003709055,0.000037941205,0.0007657517,0.00011675315],"about_ca_topic_score_codex":0.0000583205,"about_ca_topic_score_gemma":0.000013600054,"teacher_disagreement_score":0.8180179,"about_ca_system_score_codex":0.00009567056,"about_ca_system_score_gemma":0.0001765004,"threshold_uncertainty_score":0.40901896},"labels":[],"label_agreement":null},{"id":"W2350313551","doi":"","title":"A P2P Distributed Video Retrieval System","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Video retrieval; Peer-to-peer; Information retrieval; Image retrieval; Precision and recall; Multimedia; Distributed computing; Artificial intelligence; Database; Image (mathematics)","score_opus":0.005642972951293862,"score_gpt":0.22296388410761386,"score_spread":0.21732091115632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350313551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009343711,0.000033116467,0.9821193,0.00400219,0.00014315182,0.0009152775,0.000042767133,0.0028865319,0.0005139162],"genre_scores_gemma":[0.2999075,0.000001179864,0.69896084,0.000367058,0.00025717897,0.0003606876,0.000033263717,0.000018333689,0.00009391358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981088,0.000023579303,0.00035867037,0.00077261205,0.00024808545,0.00048826935],"domain_scores_gemma":[0.9977246,0.00010152594,0.00010989367,0.0016674465,0.00020252042,0.00019402518],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024555376,0.00023413166,0.00023245369,0.00020867663,0.00029062745,0.0003493377,0.0031239595,0.00018111325,0.0000039897873],"category_scores_gemma":[0.0000042415127,0.00023560313,0.00009082417,0.0016417331,0.000077356715,0.00022495343,0.0011971843,0.00043731453,0.0007953055],"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.000008904101,0.00025695204,0.00040662763,0.00006358323,0.0000657516,0.00001954562,0.0003037152,0.00025704326,0.15805508,0.43793485,0.084578834,0.31804913],"study_design_scores_gemma":[0.00024542012,0.000034812056,0.001845243,0.00001959025,0.000009862587,0.00016056007,0.000014152618,0.012518649,0.020520326,0.0024108486,0.9618127,0.00040788707],"about_ca_topic_score_codex":0.000012695245,"about_ca_topic_score_gemma":0.000013423672,"teacher_disagreement_score":0.8772338,"about_ca_system_score_codex":0.000095531264,"about_ca_system_score_gemma":0.00006915935,"threshold_uncertainty_score":0.9999827},"labels":[],"label_agreement":null},{"id":"W2350505462","doi":"","title":"Monitoring BitTorrent Protocol Based on Netfilter Connection Tracking","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"BitTorrent; Computer science; Computer network; Protocol (science); BitTorrent tracker; Bandwidth (computing); Operating system; Peer-to-peer; Eye tracking","score_opus":0.035286117717113014,"score_gpt":0.28824711707558404,"score_spread":0.25296099935847105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350505462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015591886,0.0000075919015,0.96999544,0.0015758461,0.000076229255,0.025054298,0.0000018484335,0.0013884795,0.00034105973],"genre_scores_gemma":[0.11751449,0.0000015054898,0.7050256,0.00086514186,0.00046052824,0.1760182,0.00000449207,0.000028203685,0.000081797705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831015,0.000037343947,0.00030723165,0.00069052837,0.00026559332,0.00038913023],"domain_scores_gemma":[0.99863255,0.00009337763,0.00010258403,0.0009356957,0.00013342683,0.0001023909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013673307,0.00023200744,0.00017646847,0.0003107799,0.00041169894,0.00015031797,0.0013067381,0.00009742572,0.000002970085],"category_scores_gemma":[0.0000020641742,0.00023185929,0.000083189276,0.00097014423,0.000046830908,0.00022343897,0.00029500265,0.0002416201,0.00026936657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012686267,0.00047909917,0.0032990605,0.000033899825,0.000018625347,0.000013098368,0.00030892636,0.012861997,0.010928893,0.0023526356,0.020712845,0.94897825],"study_design_scores_gemma":[0.0006614809,0.00018200018,0.012167028,0.00009750167,0.000004506311,0.000053178857,0.0000058343094,0.053997256,0.08676373,0.0006071853,0.8449272,0.00053313177],"about_ca_topic_score_codex":0.000009032251,"about_ca_topic_score_gemma":0.0000011922823,"teacher_disagreement_score":0.9484451,"about_ca_system_score_codex":0.00014972386,"about_ca_system_score_gemma":0.000051646763,"threshold_uncertainty_score":0.9454948},"labels":[],"label_agreement":null},{"id":"W2352610816","doi":"","title":"Process and Implementation of Continuous Query Based on DHT","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Chord (peer-to-peer); Scalability; Distributed hash table; Backup; Pastry; Hash function; Distributed computing; Computer network; Process (computing); Database; Computer security; Operating system","score_opus":0.008353922048822562,"score_gpt":0.26702845967075683,"score_spread":0.25867453762193426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2352610816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100451894,0.00003516394,0.8964248,0.0019130936,0.00001028563,0.00068588863,0.00000855835,0.00030249206,0.00016785986],"genre_scores_gemma":[0.6723515,0.0000049260952,0.32659885,0.0006293994,0.000026150094,0.00035825768,0.000007233636,0.0000072474977,0.000016487176],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903494,0.000015076076,0.00022989424,0.0003790698,0.00015076582,0.00019024152],"domain_scores_gemma":[0.9992142,0.000062070685,0.00009728261,0.00045587582,0.00011557275,0.000055019507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008482225,0.00012047604,0.00015154002,0.00019060561,0.00012899224,0.00003095377,0.00066225685,0.000047175403,0.0000022897423],"category_scores_gemma":[7.447283e-7,0.00012216462,0.000029282883,0.00054909004,0.000065886714,0.00011348896,0.00017006834,0.00007882013,0.000018001787],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008212059,0.00031493598,0.013948167,0.00007218826,0.000029882567,0.0000068297054,0.0016414851,0.0016549903,0.01151234,0.01810176,0.013564988,0.9391442],"study_design_scores_gemma":[0.003492062,0.0010886458,0.2315819,0.00014589311,0.00004166772,0.00022362683,0.00036934155,0.061640065,0.38476852,0.0121752685,0.30267295,0.001800082],"about_ca_topic_score_codex":0.000019689318,"about_ca_topic_score_gemma":0.000007629872,"teacher_disagreement_score":0.93734413,"about_ca_system_score_codex":0.000024694678,"about_ca_system_score_gemma":0.00005908038,"threshold_uncertainty_score":0.49817288},"labels":[],"label_agreement":null},{"id":"W2355831889","doi":"","title":"Application of Application-level Multicast in Streaming Media Over Internet","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Scalability; Source-specific multicast; Computer network; Node (physics); IP multicast; Tree (set theory); The Internet; Protocol Independent Multicast; Distributed computing; Reliable multicast; Xcast; Pragmatic General Multicast; Operating system","score_opus":0.010031075548272076,"score_gpt":0.23893127938873265,"score_spread":0.2289002038404606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2355831889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019306185,0.000082456834,0.97784907,0.00070661714,0.000019119223,0.0012043477,0.000028200317,0.00041643734,0.00038755476],"genre_scores_gemma":[0.55530816,0.000002106086,0.44340616,0.00010145104,0.000073880066,0.001011661,0.000047834284,0.000014390587,0.000034352117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978709,0.00002724762,0.0006626947,0.00079044217,0.00026007922,0.0003886311],"domain_scores_gemma":[0.99820143,0.00020026552,0.00022379731,0.0011516724,0.00014876736,0.00007408005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002057561,0.00024396225,0.00029042803,0.0004839663,0.000058479454,0.00007892907,0.0020552406,0.00014564795,0.0000025514828],"category_scores_gemma":[0.0000029793944,0.00026853714,0.00007094922,0.0016392925,0.00009480699,0.00023055769,0.00072828954,0.00019754843,0.00012735273],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047523345,0.0005674923,0.013100419,0.000037146987,0.000017540697,0.0000015677501,0.00048435834,0.0031858848,0.04956098,0.15352525,0.004916922,0.7745977],"study_design_scores_gemma":[0.0012636863,0.000052822867,0.3221469,0.00007750808,0.000021022925,0.000027592318,0.00004922487,0.34187192,0.054001432,0.03298395,0.24643858,0.0010653506],"about_ca_topic_score_codex":0.00073802733,"about_ca_topic_score_gemma":0.0005447788,"teacher_disagreement_score":0.77353233,"about_ca_system_score_codex":0.00014055052,"about_ca_system_score_gemma":0.000040090363,"threshold_uncertainty_score":0.9999767},"labels":[],"label_agreement":null},{"id":"W2356290187","doi":"","title":"Multi-layer Resource Locating Model of P2P Network Based on Chord","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chord (peer-to-peer); Computer science; Categorization; Resource (disambiguation); Distributed computing; Data mining; Computer network; Artificial intelligence","score_opus":0.042494673293264965,"score_gpt":0.25591596553114965,"score_spread":0.2134212922378847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2356290187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039834976,0.0000621931,0.99217784,0.0016766698,0.000016715958,0.0007424666,0.000007153403,0.00076384976,0.0005695845],"genre_scores_gemma":[0.18783858,0.0000032313555,0.80985284,0.0016740214,0.000096871896,0.00035488023,0.0000069280036,0.000021788672,0.00015084745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980667,0.000037038295,0.00042718797,0.00071310956,0.00027422456,0.00048168877],"domain_scores_gemma":[0.9979319,0.00015293024,0.00016942609,0.0014798103,0.0001484716,0.00011748927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021433456,0.0002451244,0.00027333753,0.00022039795,0.00032581482,0.000048597765,0.0022537373,0.00012656968,0.0000015264409],"category_scores_gemma":[0.0000033664098,0.00025415953,0.00010061571,0.001270914,0.00010610782,0.000109774825,0.00065846206,0.00025942494,0.00008857271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043472796,0.00020944484,0.00027164674,0.000012038277,0.00001268448,0.0000017836682,0.0002336229,0.87955344,0.0056389766,0.003247432,0.023077862,0.08773674],"study_design_scores_gemma":[0.0002758331,0.000043976743,0.00089083996,0.000035283574,0.0000043626706,0.000007869398,0.0000034794723,0.9403892,0.0037953975,0.0005466684,0.05375077,0.00025632343],"about_ca_topic_score_codex":0.00001014487,"about_ca_topic_score_gemma":0.000004442831,"teacher_disagreement_score":0.18385509,"about_ca_system_score_codex":0.00007278404,"about_ca_system_score_gemma":0.00009114831,"threshold_uncertainty_score":0.99999106},"labels":[],"label_agreement":null},{"id":"W2366043656","doi":"","title":"K-means Clustering Based User Online Behavior Analysis in P2P Network","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cluster analysis; Node (physics); Cluster (spacecraft); Reliability (semiconductor); Categorization; Data mining; Computer network; Artificial intelligence","score_opus":0.012015487730694514,"score_gpt":0.26482451195106743,"score_spread":0.25280902422037294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366043656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107144965,0.000070018556,0.9828938,0.004534613,0.000024472556,0.0008168077,0.000012309801,0.0008401781,0.00009329062],"genre_scores_gemma":[0.16504483,0.000003851213,0.83179724,0.0025336852,0.0001319126,0.00035308773,0.000052615957,0.000011858825,0.00007091334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979055,0.000039692623,0.00045979625,0.0008010079,0.00020703791,0.0005869866],"domain_scores_gemma":[0.998316,0.00007150267,0.0001019417,0.0012986688,0.00008746927,0.00012444936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020532936,0.0002540998,0.0003461783,0.00067875715,0.00014982704,0.00020542831,0.0022021285,0.00013067998,0.000005989473],"category_scores_gemma":[0.0000011057564,0.0002758911,0.00015567109,0.005283937,0.000031882693,0.00019811546,0.0004748229,0.00026682098,0.000058746966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040965065,0.0006696434,0.014678876,0.000005598492,0.000060030892,0.000019308714,0.00015053345,0.442354,0.0012790463,0.0034012853,0.0055135945,0.531864],"study_design_scores_gemma":[0.00044342838,0.00007861336,0.2986376,0.000028789036,0.00010709411,0.000009573663,0.000008039233,0.5530423,0.000350614,0.0011147837,0.1455508,0.00062834617],"about_ca_topic_score_codex":0.000031310145,"about_ca_topic_score_gemma":0.0007570002,"teacher_disagreement_score":0.53123564,"about_ca_system_score_codex":0.00013144962,"about_ca_system_score_gemma":0.000043263888,"threshold_uncertainty_score":0.9999693},"labels":[],"label_agreement":null},{"id":"W2368025536","doi":"","title":"Improvement on the Search Strategy of Network Resources during P2P File Transfering","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Key (lock); Table (database); Resource (disambiguation); Peer-to-peer; Distributed computing; Routing (electronic design automation); Computer network; Distributed hash table; File sharing; Database; World Wide Web; Operating system; The Internet","score_opus":0.019450750182892267,"score_gpt":0.22166043354895296,"score_spread":0.20220968336606068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2368025536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2772637,0.00007696832,0.7180006,0.0022636487,0.000019254785,0.001024528,0.00003009491,0.00045454098,0.0008666432],"genre_scores_gemma":[0.8266072,0.00002419413,0.17176859,0.00034728638,0.0002002771,0.0007734229,0.000007914839,0.000019382971,0.0002517297],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852484,0.000031710668,0.0003002401,0.00046204566,0.0002561549,0.00042500044],"domain_scores_gemma":[0.9986687,0.00017601116,0.000055587974,0.0009560177,0.00007694337,0.00006677009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016335974,0.00016896032,0.00017041255,0.0001110703,0.00045277004,0.00007154512,0.0020200496,0.00006247361,0.000025354482],"category_scores_gemma":[8.390803e-7,0.0001361279,0.00007658548,0.00091030257,0.00010503214,0.00008518159,0.0005258831,0.00023831202,0.00006540392],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025003843,0.0004766574,0.00034497606,0.000089854366,0.0001627639,0.000018599725,0.0047619017,0.13251977,0.10799366,0.043162074,0.07520787,0.63523686],"study_design_scores_gemma":[0.0011340637,0.00084229105,0.0700048,0.0002977021,0.000023682207,0.00015651835,0.0003353257,0.033416644,0.38788396,0.0060634334,0.49825975,0.0015818374],"about_ca_topic_score_codex":0.000022817074,"about_ca_topic_score_gemma":0.000007152356,"teacher_disagreement_score":0.633655,"about_ca_system_score_codex":0.00004846369,"about_ca_system_score_gemma":0.00003612914,"threshold_uncertainty_score":0.5551135},"labels":[],"label_agreement":null},{"id":"W2372809782","doi":"","title":"FreeChord:An Implementation Framework Design of Chord Supported Expanding Copabilities","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Chord (peer-to-peer); Distributed hash table; Hash table; Pastry; Hash function; Distributed computing; IPv6; Peer-to-peer; Parallel computing; Computer network; Theoretical computer science; Operating system; Programming language; The Internet","score_opus":0.022050959448913762,"score_gpt":0.32465126509937176,"score_spread":0.302600305650458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2372809782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014562314,0.00006281483,0.9816679,0.0015769544,0.000028340484,0.0012449546,0.000011165467,0.0007880603,0.000057517846],"genre_scores_gemma":[0.28885138,0.000008221314,0.7102977,0.0004502469,0.00006808918,0.00028426087,0.00001902027,0.000009234379,0.000011857213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823254,0.00006794105,0.00048054708,0.00058954436,0.00023195814,0.00039747095],"domain_scores_gemma":[0.99832237,0.00015339679,0.00016658644,0.0010783944,0.00016552226,0.0001137141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033559182,0.00020935263,0.00024513376,0.0002976392,0.00018034938,0.00016321565,0.0018008378,0.000116980045,0.00001522941],"category_scores_gemma":[0.0000032008622,0.00022493229,0.00005958145,0.0010457456,0.000057701982,0.00043577165,0.0002609073,0.00017522473,0.000032456952],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005440555,0.00020164452,0.0004823472,0.000011115618,0.000021938813,0.0000012843882,0.0015547604,0.0014556433,0.046936285,0.08335649,0.00491646,0.86105657],"study_design_scores_gemma":[0.0010709414,0.0015268796,0.025350599,0.00013872824,0.00005551718,0.000056997622,0.0008472952,0.019303944,0.34840256,0.5317473,0.06987795,0.001621275],"about_ca_topic_score_codex":0.000020091178,"about_ca_topic_score_gemma":0.0000050577037,"teacher_disagreement_score":0.8594353,"about_ca_system_score_codex":0.00008717248,"about_ca_system_score_gemma":0.00006650505,"threshold_uncertainty_score":0.91724724},"labels":[],"label_agreement":null},{"id":"W2376324127","doi":"","title":"Research and Implementation of a Dynamic Authorization Management System for IPTV","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; IPTV; Scalability; Computer network; Scheme (mathematics); Router; Authorization; Protocol (science); Internet Protocol; The Internet; Operating system","score_opus":0.027675877796358182,"score_gpt":0.34069906725488946,"score_spread":0.3130231894585313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376324127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012320283,0.00006155808,0.98423135,0.000876893,0.000018650619,0.0020788528,0.000013114135,0.00028798386,0.00011133988],"genre_scores_gemma":[0.39752686,0.000015789486,0.60094845,0.0000194256,0.00001745697,0.0013753457,0.00001583815,0.00000718814,0.00007361996],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988287,0.000023834053,0.00026663198,0.0004312754,0.00019481315,0.00025471134],"domain_scores_gemma":[0.9991102,0.000069747766,0.00007382499,0.00045455436,0.00024184267,0.000049836985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003120245,0.000093857554,0.00012363536,0.0003889017,0.0003017412,0.00005203089,0.0007008391,0.000047292815,3.992486e-7],"category_scores_gemma":[3.4006166e-7,0.00010091372,0.000025265017,0.0009838995,0.00006526288,0.00012975528,0.0005267966,0.00006479422,0.000011283055],"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.0000031421005,0.00006179198,0.00022087239,0.00017711433,0.00003263349,0.0000013141049,0.00065807736,0.00007279813,0.004912027,0.3935796,0.0033052424,0.5969754],"study_design_scores_gemma":[0.0043531307,0.0013471227,0.099410795,0.0003292148,0.00007722869,0.00033775825,0.0037519585,0.13502392,0.0760848,0.051726982,0.6258838,0.0016732347],"about_ca_topic_score_codex":0.000016873384,"about_ca_topic_score_gemma":0.000009482874,"teacher_disagreement_score":0.6225786,"about_ca_system_score_codex":0.00011182395,"about_ca_system_score_gemma":0.000026745782,"threshold_uncertainty_score":0.4115142},"labels":[],"label_agreement":null},{"id":"W2376826337","doi":"","title":"Research on Overlay Network Topology-Matching","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Overlay network; Overlay; Distributed computing; Computer network; Routing (electronic design automation); Virtual network; Network topology; Process (computing); Matching (statistics); Routing table; Routing protocol; The Internet","score_opus":0.05449974789364031,"score_gpt":0.337338855459965,"score_spread":0.2828391075663247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376826337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011821313,0.00013895342,0.972856,0.008487404,0.00007804212,0.0007834782,0.000002889808,0.0011691584,0.0046627806],"genre_scores_gemma":[0.199484,0.000030388188,0.7959828,0.002418899,0.0005803528,0.0007687768,0.0000068075733,0.000023587902,0.0007044099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754393,0.00010660756,0.0002926808,0.0008421465,0.00039043798,0.0008241887],"domain_scores_gemma":[0.9977771,0.0004004745,0.00005922895,0.0014346587,0.0001767477,0.00015177215],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005359948,0.00020082545,0.00021959694,0.0003617612,0.0009844583,0.000131215,0.0029352398,0.00015197294,0.000007338821],"category_scores_gemma":[0.0000021058336,0.00020194716,0.000073570845,0.0021413988,0.0001846321,0.00017312585,0.0014715068,0.0006074103,0.0014238157],"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.0000053453523,0.00019294873,0.00028854792,0.000007210549,0.000029566143,0.000027891687,0.00071987225,0.014083839,0.0012994804,0.40231308,0.40051556,0.18051665],"study_design_scores_gemma":[0.00016675158,0.0001097451,0.004086819,0.000023332923,0.0000018468844,0.000116841526,0.00001989792,0.0018962761,0.0013815074,0.044612408,0.9472754,0.0003091515],"about_ca_topic_score_codex":0.000033871012,"about_ca_topic_score_gemma":0.000012871623,"teacher_disagreement_score":0.54675984,"about_ca_system_score_codex":0.00013560832,"about_ca_system_score_gemma":0.00008245542,"threshold_uncertainty_score":0.9993537},"labels":[],"label_agreement":null},{"id":"W2377234835","doi":"","title":"Eliminating R_TTL circle:a solution to reduce redundant messages in Gnutella network","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Protocol (science); Redundancy (engineering); Distributed computing; Operating system","score_opus":0.012150470402798893,"score_gpt":0.26034774194188637,"score_spread":0.24819727153908747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2377234835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013171334,0.00019376192,0.9621451,0.021636225,0.00008876074,0.0013414953,0.000003776618,0.00095862837,0.0004609053],"genre_scores_gemma":[0.24948333,0.000013773884,0.7480698,0.0012037442,0.00026831724,0.00083805545,0.000008454899,0.000023110133,0.00009137159],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973537,0.000043338285,0.0005154936,0.0010085073,0.00026635942,0.0008126163],"domain_scores_gemma":[0.99835795,0.00007605071,0.00012222973,0.0011360453,0.00012703163,0.0001807047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044149073,0.00026672208,0.00028428453,0.0003874241,0.0003192368,0.00026924527,0.0023295835,0.00014530786,0.0000017849609],"category_scores_gemma":[0.0000064525457,0.0003219717,0.00007324035,0.0027742703,0.000059052258,0.00027055404,0.0013825136,0.00031435187,0.0003051486],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041547373,0.00017043215,0.00009882375,0.000017230199,0.000015266045,0.000010925326,0.00076756894,0.07796263,0.022128906,0.027472414,0.014764824,0.8565868],"study_design_scores_gemma":[0.0024534615,0.00047665113,0.0504077,0.00093382323,0.000039518287,0.00033480377,0.00014795085,0.022722777,0.10178531,0.17018107,0.64722794,0.0032890216],"about_ca_topic_score_codex":0.00007002974,"about_ca_topic_score_gemma":0.000088820285,"teacher_disagreement_score":0.8532978,"about_ca_system_score_codex":0.00034988215,"about_ca_system_score_gemma":0.000105958716,"threshold_uncertainty_score":0.9999232},"labels":[],"label_agreement":null},{"id":"W2378041025","doi":"","title":"A Study on the Incentive Mechanism of Private BitTorrent","year":2011,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"BitTorrent; Computer science; Incentive; Mechanism (biology); Computer network; BitTorrent tracker; Free riding; File sharing; Computer security; Peer-to-peer; World Wide Web; Microeconomics; The Internet; Artificial intelligence","score_opus":0.04387557623908501,"score_gpt":0.251918550204755,"score_spread":0.20804297396567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2378041025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06321541,0.000011789824,0.9331722,0.0008286191,0.000036713365,0.001749483,0.000003955597,0.0003416861,0.0006401002],"genre_scores_gemma":[0.7479602,0.0000015423825,0.25074774,0.00034247423,0.000025842877,0.0008846598,7.55346e-7,0.000008865235,0.000027913931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987979,0.000050956343,0.00026199172,0.00045261142,0.00019980795,0.00023675941],"domain_scores_gemma":[0.9984374,0.000079029465,0.00012457976,0.0012142085,0.00009593482,0.000048833346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021616144,0.00015687497,0.00015715763,0.00015780366,0.00014368723,0.000046123383,0.0026543725,0.0000426441,0.000003921168],"category_scores_gemma":[0.0000014532314,0.000114244525,0.000055786535,0.0008508042,0.000053043776,0.00007977539,0.0012265007,0.00015281851,0.00016811077],"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.0000037487875,0.0010023187,0.00048931723,0.0000037463906,0.00006111962,0.0000026588086,0.0056039835,0.000012637539,0.0032887645,0.91499317,0.002104095,0.072434455],"study_design_scores_gemma":[0.0014424712,0.0022503478,0.076389275,0.00013564956,0.00008400927,0.000028474025,0.0015320804,0.00408048,0.43933624,0.31161818,0.16152295,0.0015798494],"about_ca_topic_score_codex":0.000013669076,"about_ca_topic_score_gemma":0.0000042473225,"teacher_disagreement_score":0.6847448,"about_ca_system_score_codex":0.000040084593,"about_ca_system_score_gemma":0.00002126136,"threshold_uncertainty_score":0.49325284},"labels":[],"label_agreement":null},{"id":"W2380008175","doi":"","title":"Design of P2P Information Management System Based on DHH","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Distributed hash table; Chord (peer-to-peer); Hash table; Scheme (mathematics); Distributed computing; Protocol (science); Hash function; Computer network; Peer-to-peer; Computer security","score_opus":0.013500100940811928,"score_gpt":0.2077125117125379,"score_spread":0.194212410771726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2380008175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019060126,0.000011331908,0.9956978,0.0006367239,0.00002578636,0.0012527847,0.00000447908,0.0007962132,0.0013842545],"genre_scores_gemma":[0.1044338,0.0000033247,0.8942722,0.0005449663,0.000020490395,0.00067550933,0.000009475075,0.0000064574588,0.000033754382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887913,0.000028684242,0.0003404013,0.00027622987,0.00025003668,0.00022548543],"domain_scores_gemma":[0.9987092,0.00006549039,0.00013184325,0.00092330686,0.00011344805,0.000056710727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016244661,0.0001459814,0.00015614466,0.0004018388,0.00016032098,0.000052296135,0.001450421,0.0000614283,0.0000010119774],"category_scores_gemma":[4.87716e-7,0.0001464169,0.00004550649,0.0009384546,0.00003964898,0.0002477727,0.00032427738,0.0000841636,0.00032184372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013670976,0.00023786255,0.000089474415,0.00018141778,0.000048064514,0.000008531174,0.0005541794,0.21184723,0.0009005733,0.10289838,0.040721316,0.64249927],"study_design_scores_gemma":[0.000706333,0.0001765422,0.0023051111,0.000118194286,0.00001412573,0.000044070646,0.000035609377,0.6271983,0.011588509,0.00075202715,0.3565938,0.00046742137],"about_ca_topic_score_codex":0.000004020401,"about_ca_topic_score_gemma":1.479784e-7,"teacher_disagreement_score":0.64203185,"about_ca_system_score_codex":0.0001060525,"about_ca_system_score_gemma":0.000032901582,"threshold_uncertainty_score":0.5970708},"labels":[],"label_agreement":null},{"id":"W2383916074","doi":"","title":"Data Receiving Quality based Adaptive Pull Push Scheduling Algorithm for P2P Streaming System","year":2011,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Push and pull; Real-time computing; Distributed computing; Push pull; Peer-to-peer; Data quality; Algorithm; Computer network; Database; Mathematical optimization","score_opus":0.10273062852465657,"score_gpt":0.3066224523509411,"score_spread":0.2038918238262845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383916074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003873994,0.00010455153,0.99498284,0.0004418403,0.00008304082,0.0017267492,0.00026511573,0.0017350424,0.00027342813],"genre_scores_gemma":[0.033723302,0.000001644186,0.964506,0.00025544342,0.0001846733,0.0011564929,0.00011156672,0.000031019154,0.000029868621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971974,0.00007398898,0.0005744783,0.0013325667,0.00023331842,0.00058827625],"domain_scores_gemma":[0.9962086,0.0003135668,0.0002609639,0.0027774838,0.0002862954,0.00015306854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085235323,0.00029765654,0.00034347153,0.00024905393,0.0004149972,0.00023069928,0.0051483633,0.00015130562,0.0000017233397],"category_scores_gemma":[0.000007841446,0.00031971475,0.00008927083,0.0009010435,0.000064222986,0.00052630674,0.0020079406,0.00022580479,0.00007181363],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034426935,0.000120448305,0.00008047932,0.000047464557,0.000045356737,0.0000018386095,0.00025225026,0.0002514479,0.0008307477,0.018324006,0.0013142001,0.9787283],"study_design_scores_gemma":[0.00043147357,0.00006964703,0.0010413241,0.00013347328,0.000028468543,0.000018031391,0.00019318674,0.93607485,0.0052992473,0.0015912517,0.054504827,0.0006141949],"about_ca_topic_score_codex":0.00010317256,"about_ca_topic_score_gemma":0.000039213977,"teacher_disagreement_score":0.9781141,"about_ca_system_score_codex":0.0001817121,"about_ca_system_score_gemma":0.00012414671,"threshold_uncertainty_score":0.9999255},"labels":[],"label_agreement":null},{"id":"W2387154953","doi":"","title":"Optimization Method in Content Addressable Network","year":2006,"lang":"en","type":"article","venue":"Journal of Chinese Computer Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Computer science; Distributed hash table; Overlay network; Network delay; Distributed computing; Simple (philosophy); Computer network; Table (database); Hash table; Hash function; Peer-to-peer; Data mining; The Internet","score_opus":0.019279421334858018,"score_gpt":0.25853441303013025,"score_spread":0.23925499169527223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2387154953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009146622,0.0011229565,0.9829777,0.0011316019,0.004856075,0.00025453613,7.1743017e-7,0.0001354829,0.000374314],"genre_scores_gemma":[0.24874875,0.000010466917,0.7485004,0.00017264155,0.002396588,0.000009182366,0.0000011632665,0.000016360993,0.00014442965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974198,0.0002652781,0.0010868653,0.00028193442,0.0005376811,0.00040846018],"domain_scores_gemma":[0.99810874,0.00023832706,0.00063775235,0.00051900826,0.00039905257,0.00009712155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016181571,0.0002323184,0.00063531526,0.00046185,0.00006086958,0.00036906794,0.0016294732,0.00012056576,0.0000013730482],"category_scores_gemma":[0.00004560832,0.00017320142,0.0001274317,0.0013909561,0.000017031743,0.0006603188,0.0004097837,0.00030919068,0.000006827219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010700814,0.00005403601,0.008775698,0.000015059007,0.000020746047,0.000108143446,0.000071926,0.9629448,0.000028162916,0.003750916,0.021762516,0.0024573186],"study_design_scores_gemma":[0.0006552811,0.0001779829,0.0090043675,0.0002406743,0.0000042822617,0.0004860263,0.000005292841,0.9828129,0.000015029129,0.001592417,0.00479971,0.00020606612],"about_ca_topic_score_codex":0.00010473984,"about_ca_topic_score_gemma":0.000026376794,"teacher_disagreement_score":0.23960213,"about_ca_system_score_codex":0.00014622473,"about_ca_system_score_gemma":0.00006467002,"threshold_uncertainty_score":0.7062949},"labels":[],"label_agreement":null},{"id":"W2388188318","doi":"","title":"Design and Implementation of Content-based Event Notification Service for Digital Library","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Asynchronous communication; Computer science; Event (particle physics); Distributed computing; Service (business); Architecture; Complex event processing; Digital content; Modal; Service-oriented architecture; World Wide Web; Computer network; Web service; Operating system; Process (computing)","score_opus":0.04229774908985059,"score_gpt":0.2699099970030981,"score_spread":0.2276122479132475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388188318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06169789,0.000018360619,0.9255928,0.011896101,0.00003225537,0.00048998336,0.000009649999,0.0002479591,0.000015042862],"genre_scores_gemma":[0.6189417,6.484849e-7,0.3805701,0.00040943222,0.0000040372543,0.000043855656,0.000012786568,0.000003434092,0.0000139846325],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944186,0.0000064309284,0.00015921402,0.00018321288,0.00009483904,0.0001144567],"domain_scores_gemma":[0.99955493,0.00006965208,0.00006115073,0.00022327725,0.00006132453,0.000029660705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007800087,0.00006273527,0.00007049242,0.00007392062,0.00002931294,0.00010303351,0.00032575714,0.00002654094,0.0000020889347],"category_scores_gemma":[0.000009997196,0.00005643742,0.000015815987,0.00025196662,0.000011955404,0.0006220954,0.00009772551,0.000018285788,0.0000044192607],"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.000086663254,0.00023774168,0.003709679,0.00013787953,0.000049567192,0.0000022039183,0.0008764044,0.016521005,0.028324727,0.16660191,0.0035407161,0.7799115],"study_design_scores_gemma":[0.001655556,0.00048754038,0.0074055265,0.00003559874,0.0000076162,0.0000024743827,0.00037934456,0.046314992,0.92418015,0.01855356,0.00074381416,0.0002338418],"about_ca_topic_score_codex":0.00001498521,"about_ca_topic_score_gemma":0.000006957476,"teacher_disagreement_score":0.8958554,"about_ca_system_score_codex":0.000017128,"about_ca_system_score_gemma":0.000059646845,"threshold_uncertainty_score":0.23014511},"labels":[],"label_agreement":null},{"id":"W2388743202","doi":"","title":"Discussion of the Design Idea of Peer-to-peer Platform Communication Module","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Peer-to-peer; Key (lock); Software; Shared resource; Resource (disambiguation); Software development; Operating system; Computer network; Software engineering; Distributed computing","score_opus":0.021564954820896265,"score_gpt":0.2693711469080106,"score_spread":0.24780619208711435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388743202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006423458,0.000047336427,0.9777491,0.013727799,0.000036005422,0.0013460075,0.000010881463,0.00023221769,0.0004271596],"genre_scores_gemma":[0.33457676,0.0000024397439,0.6645239,0.0003093775,0.00002537601,0.00013890723,0.000006247681,0.0000122772335,0.00040473306],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980815,0.000043051306,0.0005757562,0.0004055641,0.0005527284,0.00034141538],"domain_scores_gemma":[0.9965963,0.00021374488,0.00025859175,0.0022473673,0.0005860013,0.00009800386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011650254,0.00018696455,0.0002424253,0.00026086814,0.00021891882,0.00005753177,0.0043038265,0.000120674405,0.0000021997294],"category_scores_gemma":[0.000015254547,0.00012413446,0.00010597928,0.0017452913,0.00012379161,0.00020294293,0.0019721414,0.00021653851,0.000042259657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016667593,0.00035564628,0.0007799686,0.000032293232,0.000044829067,4.4881565e-7,0.0025416103,0.008414102,0.073592395,0.07711019,0.044642143,0.7924697],"study_design_scores_gemma":[0.0005188873,0.00014760498,0.03262395,0.00015459768,0.000027845887,0.00002253235,0.00015180642,0.014728728,0.45824128,0.038559217,0.4542434,0.0005801782],"about_ca_topic_score_codex":0.000033476907,"about_ca_topic_score_gemma":0.000026522095,"teacher_disagreement_score":0.79188955,"about_ca_system_score_codex":0.00008909823,"about_ca_system_score_gemma":0.000057030018,"threshold_uncertainty_score":0.7997652},"labels":[],"label_agreement":null},{"id":"W2389496590","doi":"","title":"A Schema Of NAT And Firewall Traversal Based On P2P-SIP System","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; NAT traversal; Computer network; Firewall (physics); Traverse; Nat; Tree traversal; Stateful firewall; Internet Control Message Protocol; Application layer; The Internet; Network address; Internet Protocol; Operating system; Network packet; Network address translation; Software","score_opus":0.00964363510064438,"score_gpt":0.20188888071753486,"score_spread":0.1922452456168905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2389496590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045113683,0.00006412029,0.95167327,0.0013409592,0.0000210998,0.0006390662,0.000010264864,0.00064467796,0.00049286033],"genre_scores_gemma":[0.6147422,0.0000026331318,0.38466585,0.00031781336,0.000033775603,0.00018351692,0.0000033329402,0.000009028505,0.000041835483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987242,0.00002312948,0.00026594018,0.0005237523,0.00020622552,0.0002567152],"domain_scores_gemma":[0.9987757,0.00011451905,0.00009355219,0.0008145119,0.00010549934,0.00009620989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011100069,0.00017503178,0.0002258615,0.00023779858,0.00016892146,0.000046216483,0.0011069642,0.00009805762,0.0000010197984],"category_scores_gemma":[0.000001258086,0.0001746438,0.000059181137,0.00068861205,0.00010347095,0.00010244259,0.00033688504,0.00013424802,0.000058934493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005648459,0.0013783193,0.0048589916,0.0006350905,0.00018358158,0.00009443393,0.0054675275,0.0055211815,0.050565794,0.20854922,0.070456795,0.6522326],"study_design_scores_gemma":[0.002187588,0.00056066475,0.018232936,0.00035787877,0.00003479278,0.00048812537,0.00008765862,0.621192,0.09513238,0.0015671018,0.25882706,0.0013318579],"about_ca_topic_score_codex":0.000017019172,"about_ca_topic_score_gemma":0.0000026426876,"teacher_disagreement_score":0.6509007,"about_ca_system_score_codex":0.000067730456,"about_ca_system_score_gemma":0.00005664239,"threshold_uncertainty_score":0.7121768},"labels":[],"label_agreement":null},{"id":"W2393132598","doi":"","title":"Research of Dual User Online Cooperation System Based on Virtools","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Dual (grammatical number); Function (biology); Human–computer interaction; Scheme (mathematics); Virtual reality; Dual function; Multimedia; Computer graphics (images)","score_opus":0.03410511776608805,"score_gpt":0.32809881433877414,"score_spread":0.2939936965726861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393132598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010192254,0.00002585742,0.9813625,0.0060550277,0.000022683053,0.0010653866,0.00002739267,0.00065111165,0.0005977947],"genre_scores_gemma":[0.49592227,0.0000013201725,0.50300443,0.0006743363,0.00010608205,0.00016412896,0.00003214198,0.00000866599,0.00008666362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981843,0.00009499259,0.00037058903,0.000577185,0.00041219246,0.00036073345],"domain_scores_gemma":[0.9979811,0.00018116958,0.0000784803,0.0012109177,0.0004582675,0.0000901055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048986974,0.00015858246,0.00020798438,0.00050551805,0.00021207336,0.00015658405,0.0015013815,0.000114730276,0.0000017599716],"category_scores_gemma":[0.000003660447,0.00015390528,0.00005407244,0.0019194932,0.000058334044,0.00015472148,0.00026944923,0.00028371302,0.00015373615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001788902,0.00097299815,0.0000617892,0.00003873561,0.000018290877,0.000008004528,0.00018762836,0.032058354,0.053107623,0.36227834,0.04230953,0.5089408],"study_design_scores_gemma":[0.0011553413,0.0012404098,0.010558882,0.00031024858,0.000014022258,0.000037492777,0.000071187416,0.48116514,0.091764025,0.0020906762,0.41079786,0.00079470937],"about_ca_topic_score_codex":0.000010662306,"about_ca_topic_score_gemma":0.0000063507614,"teacher_disagreement_score":0.5081461,"about_ca_system_score_codex":0.00014267919,"about_ca_system_score_gemma":0.00009685112,"threshold_uncertainty_score":0.6276075},"labels":[],"label_agreement":null},{"id":"W2394122558","doi":"","title":"Tree-Based Load Balancing Method in DHT Networks","year":2006,"lang":"en","type":"article","venue":"Journal of Chinese Computer Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Computer science; Load balancing (electrical power); Scalability; Distributed computing; Tree (set theory); Metric (unit); Tree network; Network Load Balancing Services; Computer network; Algorithm; Server; Time complexity; Database","score_opus":0.006557398697715129,"score_gpt":0.24592896329699984,"score_spread":0.23937156459928471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394122558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448154,0.0013485276,0.9472123,0.0013085165,0.004923329,0.00021013625,6.0254115e-7,0.00019714839,0.00031793004],"genre_scores_gemma":[0.707546,0.0000028987424,0.29021677,0.00023313235,0.0019352203,0.000006249411,5.575446e-7,0.000017759708,0.000041446874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966829,0.00032735855,0.0012503905,0.0003858868,0.00081918715,0.00053427136],"domain_scores_gemma":[0.9975313,0.00047125752,0.0006961517,0.0007252372,0.00043581444,0.00014021667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00236948,0.00033412987,0.0008328033,0.0007016946,0.0000648684,0.00045761533,0.0022649718,0.00017880696,9.096991e-7],"category_scores_gemma":[0.000067096094,0.0002512655,0.00021405848,0.0017120636,0.000024001753,0.00056214817,0.00037299865,0.0005554077,0.000008320091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002102544,0.000099168356,0.03152865,0.000032056363,0.0000268558,0.000632611,0.00011139674,0.92721355,0.00014501884,0.00086411304,0.014930409,0.024395173],"study_design_scores_gemma":[0.0009312514,0.00019935967,0.032007527,0.0003242763,0.0000051723628,0.00051926274,0.0000042074435,0.9617224,0.000035445475,0.0007609264,0.00321642,0.00027378066],"about_ca_topic_score_codex":0.0001612505,"about_ca_topic_score_gemma":0.00012572834,"teacher_disagreement_score":0.6630644,"about_ca_system_score_codex":0.00030526886,"about_ca_system_score_gemma":0.00019308168,"threshold_uncertainty_score":0.999994},"labels":[],"label_agreement":null},{"id":"W2403354906","doi":"","title":"A Fault Tolerant Data Structure for Peer-to-Peer Range Query Processing","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Range query (database); Hash table; Hash function; Distributed hash table; Redundancy (engineering); Data structure; Fault tolerance; Query optimization; Theoretical computer science; Peer-to-peer; Distributed computing; Data mining; Web search query; Search engine; Sargable; Information retrieval","score_opus":0.11166072722308411,"score_gpt":0.3223953343659361,"score_spread":0.21073460714285197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403354906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025076287,0.000113390684,0.8858823,0.0836099,0.0010199201,0.00097252685,0.0015237166,0.00044683414,0.0013550831],"genre_scores_gemma":[0.7823908,3.0467666e-7,0.21049912,0.005616173,0.0001960024,0.00004829697,0.00046309936,0.000025248413,0.0007610002],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964159,0.000043973258,0.0003694176,0.0011133637,0.0012298218,0.0008275057],"domain_scores_gemma":[0.9949212,0.00019722218,0.0001131066,0.0011776376,0.0024043527,0.0011864702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007157303,0.00034241143,0.00035788323,0.0011714952,0.00026477125,0.00078007474,0.0037044415,0.00020470437,0.000022384234],"category_scores_gemma":[0.0012169284,0.0003496305,0.0000453654,0.0018039097,0.00007509974,0.0005963068,0.0005311723,0.0003353289,0.00012462944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000528202,0.00005099495,0.0007643246,0.000052486215,0.00005939103,0.000088664005,0.0012537058,0.13859387,0.000026125776,0.07755492,0.42709592,0.3544068],"study_design_scores_gemma":[0.00083031406,0.00028946673,0.0034881984,0.00013484835,0.000013505496,0.000052443665,0.00027454062,0.79033315,0.000048085774,0.03407631,0.1696159,0.0008432722],"about_ca_topic_score_codex":0.0027070022,"about_ca_topic_score_gemma":0.016407384,"teacher_disagreement_score":0.75731444,"about_ca_system_score_codex":0.00044261065,"about_ca_system_score_gemma":0.0035358607,"threshold_uncertainty_score":0.9998956},"labels":[],"label_agreement":null},{"id":"W241339743","doi":"10.1109/tst.2012.6151903","title":"Rise and fall of the peer-to-peer empire","year":2012,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Popularity; Peer-to-peer; Computer science; The Internet; Argument (complex analysis); World Wide Web; Peer review; Computer security; Political science; Law","score_opus":0.017039256828064307,"score_gpt":0.27643318289038693,"score_spread":0.25939392606232264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W241339743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87876636,0.0003824819,0.035511043,0.081087194,0.000926677,0.00041974423,0.000003435484,0.0010973192,0.0018057332],"genre_scores_gemma":[0.9320539,0.0000043738623,0.06657133,0.00056330604,0.0000349109,0.000029426083,9.156619e-8,0.000012061998,0.0007305705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964615,0.00003347382,0.00034725512,0.0007478171,0.0012070964,0.0012028264],"domain_scores_gemma":[0.9968169,0.00006691316,0.000165026,0.0021910525,0.00053101947,0.00022913552],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0020087508,0.00025283892,0.00031379884,0.00142833,0.00048372103,0.00013799217,0.006250773,0.00024754702,0.0000029141727],"category_scores_gemma":[0.0019858326,0.0001877716,0.000052332914,0.008931127,0.0027127701,0.00076560886,0.005221286,0.00042527012,0.00007923268],"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.000011048333,0.00024431816,0.15893805,0.000021864198,0.000021123184,0.000009991939,0.0057010446,0.00020765964,0.116877615,0.3360117,0.013035611,0.36891997],"study_design_scores_gemma":[0.00064516836,0.00070226315,0.11958123,0.0001989128,0.000036894326,0.00049434626,0.001514655,0.0044778725,0.3961727,0.043221053,0.4315108,0.0014441054],"about_ca_topic_score_codex":0.000049481987,"about_ca_topic_score_gemma":0.000033515797,"teacher_disagreement_score":0.41847518,"about_ca_system_score_codex":0.00015290611,"about_ca_system_score_gemma":0.00020123484,"threshold_uncertainty_score":0.99953145},"labels":[],"label_agreement":null},{"id":"W2427008665","doi":"10.1145/2933267.2933297","title":"Evolving pub/sub subscriptions for multiplayer online games","year":2016,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Workload; Class (philosophy); Stock (firearms); Live streaming; Multimedia; World Wide Web; Artificial intelligence; Operating system","score_opus":0.029758624108802163,"score_gpt":0.26462762537189854,"score_spread":0.23486900126309637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2427008665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038047343,0.00009193921,0.9364663,0.02251735,0.00047189347,0.0002998934,0.000017763781,0.0016016931,0.00048587023],"genre_scores_gemma":[0.5608566,0.000012992018,0.43499708,0.00057651044,0.00008700616,0.00007873092,0.0000015810687,0.000010681237,0.0033788362],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870026,0.000013654205,0.00020269709,0.00044635715,0.00018205745,0.00045495946],"domain_scores_gemma":[0.9986076,0.00026779663,0.00004494833,0.0008074881,0.0001786758,0.0000935211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017814476,0.00014425334,0.00014695081,0.00018621206,0.00010745045,0.00011760639,0.001280291,0.00008582933,0.00002016064],"category_scores_gemma":[0.0004672686,0.00009335899,0.00007477131,0.0003700412,0.00004571164,0.00060283963,0.0005041631,0.00006247091,0.00013625756],"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.000007062784,0.00013993392,0.0026620927,0.0000080218915,0.00003302782,0.0000054198345,0.00014095262,0.00005702382,0.07864183,0.077268764,0.23024808,0.6107878],"study_design_scores_gemma":[0.0030276885,0.00067431456,0.059957687,0.00029049517,0.000030702355,0.000054542874,0.0002229385,0.18212344,0.16324396,0.06430192,0.524108,0.001964343],"about_ca_topic_score_codex":0.00001139032,"about_ca_topic_score_gemma":0.00018194046,"teacher_disagreement_score":0.6088235,"about_ca_system_score_codex":0.00007049306,"about_ca_system_score_gemma":0.000035926263,"threshold_uncertainty_score":0.3807069},"labels":[],"label_agreement":null},{"id":"W2440706344","doi":"10.1109/syscon.2016.7490578","title":"Game servers deployment automation case study","year":2016,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Computer science; Software deployment; Scalability; Service (business); Application server; Interface (matter); World Wide Web; Client; Operating system","score_opus":0.02322116708182224,"score_gpt":0.2691889117054007,"score_spread":0.24596774462357848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2440706344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61112,0.000005520197,0.38343683,0.0030811515,0.00013651085,0.00023285166,2.429871e-7,0.0017550911,0.00023183487],"genre_scores_gemma":[0.961308,0.0000013140059,0.03779014,0.00022460414,0.000015363212,0.00004294493,7.1190755e-8,0.0000056201093,0.00061194453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989941,0.000036715763,0.00015511578,0.00033391282,0.00024243574,0.00023768228],"domain_scores_gemma":[0.9990142,0.0000623782,0.00003600833,0.00076846016,0.00005100184,0.000067977395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024302966,0.0001015072,0.000092770926,0.00012488432,0.000050690913,0.000104123166,0.0007251458,0.000035481975,0.000014201047],"category_scores_gemma":[0.00003405366,0.000063622676,0.00002366353,0.00038261674,0.000016088286,0.000517648,0.0005708416,0.00003667579,0.00031326734],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034786867,0.00031473528,0.015576087,0.0000043999858,0.0000480475,0.0022680731,0.0015832463,0.00018009348,0.0012440322,0.009411361,0.011154097,0.9582124],"study_design_scores_gemma":[0.023202287,0.016966036,0.22439396,0.001082373,0.00023082097,0.020523876,0.025997244,0.34236333,0.1540959,0.062168535,0.11881066,0.010164965],"about_ca_topic_score_codex":0.00016185548,"about_ca_topic_score_gemma":0.00034160525,"teacher_disagreement_score":0.9480474,"about_ca_system_score_codex":0.000101684054,"about_ca_system_score_gemma":0.000021382104,"threshold_uncertainty_score":0.40265223},"labels":[],"label_agreement":null},{"id":"W2467591515","doi":"10.1145/2851613.2851639","title":"Planning the transformation of overlays","year":2016,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Robustness (evolution); Overlay; Suite; Topology (electrical circuits); Distributed computing; Network topology; Overlay network; Mathematical optimization; Mathematics; Computer network","score_opus":0.0205988013379382,"score_gpt":0.24860608707837106,"score_spread":0.22800728574043286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467591515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036742147,0.000018648143,0.9346473,0.013494565,0.00007588763,0.00006818297,5.3138285e-7,0.00026203657,0.014690667],"genre_scores_gemma":[0.9822573,0.0000026627272,0.017239694,0.00020692608,0.00000880595,0.000005156961,5.6114207e-8,0.0000014801711,0.00027792345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99956566,0.000009425881,0.00010082253,0.000081233506,0.00013166468,0.00011122162],"domain_scores_gemma":[0.99952763,0.00008875578,0.000025370917,0.000320741,0.00002403646,0.000013489464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016009598,0.000040493644,0.000049314407,0.00004492827,0.000030388715,0.000016986114,0.00072615984,0.000024067514,0.000006101262],"category_scores_gemma":[0.00002518113,0.000017880511,0.000018961184,0.00020618363,0.000025095804,0.00026328836,0.000090759175,0.00002604863,0.000031533902],"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.0000033409272,0.000009067163,0.00064213853,0.0000033789815,0.00000815463,9.731588e-7,0.001477423,0.0002485678,0.009924042,0.50865376,0.013388261,0.46564087],"study_design_scores_gemma":[0.0012002729,0.0005550056,0.05348199,0.00030230742,0.000011476059,0.000041592397,0.0006187583,0.043893028,0.5947203,0.12789926,0.17657796,0.00069807796],"about_ca_topic_score_codex":0.000004870938,"about_ca_topic_score_gemma":0.0000024954275,"teacher_disagreement_score":0.94551516,"about_ca_system_score_codex":0.000010767134,"about_ca_system_score_gemma":0.00000918131,"threshold_uncertainty_score":0.13493977},"labels":[],"label_agreement":null},{"id":"W2468217693","doi":"","title":"Flexible distributed business process management","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Overlay; Business process; Workload; Software deployment; Overhead (engineering); Process (computing); Distributed management; Service (business); Operating system; Work in process; Engineering","score_opus":0.016308128217589292,"score_gpt":0.26323076216315383,"score_spread":0.24692263394556455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468217693","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00403242,0.00017186004,0.7992473,0.0006058577,0.001934834,0.0009580513,0.00001576933,0.005053105,0.18798079],"genre_scores_gemma":[0.23074085,0.00029873085,0.31348452,0.0009621735,0.0002903394,0.0020604094,0.0039319447,0.00021347315,0.44801757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789447,0.000011453627,0.0003225831,0.0008169785,0.00046152092,0.0004929834],"domain_scores_gemma":[0.9981188,0.000013007842,0.00016072746,0.0012154223,0.00040539968,0.000086614964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012281603,0.0003675939,0.000329774,0.0004095962,0.00010913842,0.00022378407,0.0034618333,0.000284865,0.00004623661],"category_scores_gemma":[0.000029183608,0.00033234738,0.000056822002,0.0023073808,0.000018794579,0.00031930878,0.00040592128,0.00022110234,0.0004003957],"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.00006430652,0.0003266947,0.00016369975,0.0011831679,0.0002573401,0.00018315301,0.000828092,0.0004053343,0.000037789603,0.30225784,0.113111205,0.5811814],"study_design_scores_gemma":[0.002087028,0.00051302864,0.15299916,0.0030368373,0.00041182563,0.000056189645,0.003309927,0.0058076777,0.07214979,0.44841978,0.30225343,0.008955308],"about_ca_topic_score_codex":0.000043637494,"about_ca_topic_score_gemma":0.000106036285,"teacher_disagreement_score":0.57222605,"about_ca_system_score_codex":0.00006126706,"about_ca_system_score_gemma":0.00007629435,"threshold_uncertainty_score":0.99991286},"labels":[],"label_agreement":null},{"id":"W2469121178","doi":"10.1371/journal.pone.0158516","title":"Secret Forwarding of Events over Distributed Publish/Subscribe Overlay Network","year":2016,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Hongik University","keywords":"Computer science; Publication; Asynchronous communication; Replication (statistics); Computer network; Distributed computing; Overlay network; Reliability (semiconductor); Computer security; World Wide Web; The Internet","score_opus":0.03303134255322911,"score_gpt":0.2194086281095356,"score_spread":0.1863772855563065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469121178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50456357,0.00017967011,0.48410782,0.007997905,0.00038083436,0.0004832025,0.00010282428,0.0012275147,0.00095668173],"genre_scores_gemma":[0.95015746,0.000026830952,0.048967324,0.00020978421,0.00016417215,0.000041659176,0.000010711977,0.000019784966,0.0004022449],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99763614,0.000054062144,0.0003697074,0.00050614664,0.00075873354,0.0006752173],"domain_scores_gemma":[0.99805635,0.00021910426,0.0001922257,0.0011921572,0.00019438913,0.00014576127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042664126,0.00020465162,0.0003999742,0.00013603078,0.00008126661,0.000083136256,0.0018621554,0.00014684831,0.000037730064],"category_scores_gemma":[0.00054059096,0.00015743496,0.00009155907,0.0011086285,0.000056638404,0.00088530435,0.0012546047,0.00014688176,0.00006231955],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015461809,0.002652644,0.34507948,0.00022848915,0.0019940855,0.00007092614,0.00047095938,0.00060402224,0.08075852,0.113719456,0.38246492,0.07180189],"study_design_scores_gemma":[0.006928793,0.0019587337,0.4010956,0.0068433,0.00045174998,0.000024383964,0.00006486642,0.03706377,0.27167717,0.22791974,0.041778155,0.004193744],"about_ca_topic_score_codex":0.0000124625385,"about_ca_topic_score_gemma":0.000010447409,"teacher_disagreement_score":0.44559392,"about_ca_system_score_codex":0.00012672432,"about_ca_system_score_gemma":0.000048277354,"threshold_uncertainty_score":0.64200115},"labels":[],"label_agreement":null},{"id":"W2472175290","doi":"10.1109/mcom.2016.7509392","title":"Approaches to end-user applications portability in the cloud: A survey","year":2016,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Software portability; Cloud computing; Telecommunications; Operating system","score_opus":0.1461001225608615,"score_gpt":0.30029269876665277,"score_spread":0.15419257620579127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472175290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017469106,0.00024267226,0.81764483,0.15584952,0.00016491965,0.00178856,0.00006695755,0.0006438115,0.006129626],"genre_scores_gemma":[0.8975415,0.000052965115,0.099358514,0.0008165697,0.000039937764,0.0017426249,0.000013555563,0.000012358947,0.00042192265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794376,0.0005227221,0.00042012797,0.0004693804,0.00027593307,0.0003680858],"domain_scores_gemma":[0.98917216,0.0014111989,0.00009364394,0.009105514,0.0001289989,0.000088490975],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0023681924,0.00017534348,0.00019822367,0.000227882,0.00021413183,0.00011321525,0.009996756,0.000082464685,0.0000072819407],"category_scores_gemma":[0.00038310752,0.00011459317,0.000049747683,0.0023837716,0.0002279505,0.00024889736,0.0016118034,0.00024661637,0.0006463947],"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.000020582967,0.0014430757,0.05998145,0.000014235292,0.000043058288,0.0000027851609,0.0021531836,0.00028431165,0.0016838897,0.40822077,0.08947969,0.43667296],"study_design_scores_gemma":[0.0002860701,0.000069103895,0.43354547,0.00002904963,0.0000065592044,0.000011615814,0.00005430113,0.0008113395,0.0002994524,0.014574191,0.5499246,0.00038825787],"about_ca_topic_score_codex":0.00011122716,"about_ca_topic_score_gemma":0.0053159385,"teacher_disagreement_score":0.8800724,"about_ca_system_score_codex":0.00011489862,"about_ca_system_score_gemma":0.00008084754,"threshold_uncertainty_score":0.99535966},"labels":[],"label_agreement":null},{"id":"W2478442305","doi":"10.4018/978-1-59904-002-8.ch127","title":"Pen-Based Mobile Computing","year":2007,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Center (category theory); Wireless; Telecommunications; World Wide Web; Library science; Human–computer interaction","score_opus":0.025885859001706982,"score_gpt":0.27051830798257814,"score_spread":0.24463244898087116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478442305","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008794715,0.00028284072,0.2120659,0.00013550141,0.00083706004,0.0005655915,0.000027221251,0.0022145635,0.7837834],"genre_scores_gemma":[0.46657774,0.000003166629,0.41248783,0.009150885,0.0012555777,0.000072350624,0.0000138932555,0.00022336903,0.11021518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99657315,0.00001659529,0.00056951924,0.0011353282,0.0008342447,0.00087115285],"domain_scores_gemma":[0.99719375,0.0001280365,0.00030040063,0.0019035147,0.0002118625,0.0002624278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036987537,0.0006612979,0.00063097157,0.00026533747,0.00017766266,0.00028043828,0.0033233026,0.00071715686,0.000011541562],"category_scores_gemma":[0.00003149692,0.00069709256,0.00026784686,0.00011158988,0.0001624721,0.00006199406,0.0015020145,0.00061741046,0.00072744786],"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.0000066661482,0.000008474479,0.00001045621,0.000015544372,0.000030232999,0.00023289517,0.00002230359,0.00047863772,0.000006928912,0.8557524,0.007357056,0.1360784],"study_design_scores_gemma":[0.0007437472,0.0006410945,0.00006878936,0.0007534537,0.00005677099,0.00014268635,0.000009452459,0.011277208,0.0006134507,0.4533648,0.5299835,0.0023450316],"about_ca_topic_score_codex":0.00004259323,"about_ca_topic_score_gemma":0.00007298675,"teacher_disagreement_score":0.6735682,"about_ca_system_score_codex":0.00052318996,"about_ca_system_score_gemma":0.00029356533,"threshold_uncertainty_score":0.999548},"labels":[],"label_agreement":null},{"id":"W2483703040","doi":"10.4018/978-1-61520-655-1.ch044","title":"Spatial Subscriptions in Distributed Event-Based Systems","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overlay; Event (particle physics); Spatial relation; Filter (signal processing); Relation (database); Distributed computing; Spatial analysis; Data mining; Theoretical computer science; Geography; Artificial intelligence; Programming language; Remote sensing; Computer vision","score_opus":0.021338331075255623,"score_gpt":0.24080817593621895,"score_spread":0.21946984486096333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483703040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017507312,0.0013103058,0.6737906,0.00060800684,0.0031669375,0.0012155848,0.0008031392,0.0017728305,0.31715757],"genre_scores_gemma":[0.98786646,0.0000022608854,0.0030299157,0.0002521673,0.00031474113,0.00012561881,0.000040892035,0.00004107262,0.008326888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710375,0.00004310303,0.0006233221,0.0007712752,0.000653962,0.0008046161],"domain_scores_gemma":[0.9977199,0.000049591035,0.00026541288,0.0015629028,0.00015024355,0.00025194907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025855,0.00056005584,0.00061773416,0.00025326433,0.000098002165,0.0002531842,0.0021161814,0.0006895025,0.000006685677],"category_scores_gemma":[0.00004093447,0.00058392267,0.00019124673,0.0001261025,0.00010574093,0.000117694115,0.0007108279,0.0005107287,0.0004117712],"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.000009597679,0.00002121039,0.00016291626,0.000024090103,0.0000292585,0.00009425221,0.000015685082,0.00054625596,0.000016229993,0.9850835,0.0050431127,0.008953881],"study_design_scores_gemma":[0.0025052368,0.0006359072,0.0032089385,0.0026564077,0.0001931979,0.0002273668,0.000028507277,0.032560132,0.00033650006,0.36820868,0.58457774,0.0048613953],"about_ca_topic_score_codex":0.00060842006,"about_ca_topic_score_gemma":0.0010162407,"teacher_disagreement_score":0.98769134,"about_ca_system_score_codex":0.00093121245,"about_ca_system_score_gemma":0.0002962655,"threshold_uncertainty_score":0.9996612},"labels":[],"label_agreement":null},{"id":"W2484460155","doi":"10.4018/978-1-61520-727-5.ch011","title":"Content-Based XML Data Dissemination","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; XPath; PlanetLab; Computer network; Policy-based routing; Routing table; Distributed computing; Static routing; Streaming XML; Link-state routing protocol; XML; Scalability; Database; Routing protocol; XML database; Routing (electronic design automation); World Wide Web","score_opus":0.052302012131938365,"score_gpt":0.2836969070093187,"score_spread":0.23139489487738035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484460155","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006967234,0.00017745969,0.17492168,0.0017926297,0.0015738851,0.00060814957,0.00050267973,0.0017333477,0.8186205],"genre_scores_gemma":[0.22628973,0.000008284037,0.44518203,0.00538491,0.0012085594,0.00013675312,0.00038059958,0.00022360959,0.32118553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99714494,0.000013670342,0.0004147684,0.001220485,0.0007170779,0.0004890402],"domain_scores_gemma":[0.9947558,0.000098864635,0.00027520678,0.004458991,0.00022108607,0.00019001939],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00027589904,0.0005024105,0.00045212457,0.00015633112,0.00012730072,0.00034167038,0.006653973,0.0007461019,0.000010964998],"category_scores_gemma":[0.00012814559,0.000494536,0.000113163325,0.00005875904,0.00016968613,0.00018750082,0.002797667,0.00063097174,0.00038798034],"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.000006352032,0.00000803324,0.000007326764,0.000010106758,0.000026167927,0.000067055145,0.000008616921,0.0000012006118,0.0002707762,0.86847275,0.012896768,0.118224815],"study_design_scores_gemma":[0.00057570013,0.00026538907,0.0001305273,0.000733437,0.000100530466,0.00008326064,0.000009316133,0.0045888596,0.0032481458,0.45449197,0.533841,0.0019318394],"about_ca_topic_score_codex":0.000041436462,"about_ca_topic_score_gemma":0.00028199406,"teacher_disagreement_score":0.52094424,"about_ca_system_score_codex":0.00019147764,"about_ca_system_score_gemma":0.00022282187,"threshold_uncertainty_score":0.9997506},"labels":[],"label_agreement":null},{"id":"W2496581472","doi":"10.4018/978-1-60566-715-7.ch004","title":"Mobility Support in a P2P System for Publish/Subscribe Applications","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Testbed; Publication; Context (archaeology); Server; Middleware (distributed applications); Overhead (engineering); Event (particle physics); Distributed computing; Handover; Peer-to-peer; Computer network; Mobile computing; Operating system","score_opus":0.030914409963573298,"score_gpt":0.24909208551019307,"score_spread":0.21817767554661976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2496581472","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014428137,0.00011036793,0.20257941,0.00023642885,0.0004855104,0.002589203,0.00026684176,0.0015356938,0.7921821],"genre_scores_gemma":[0.63523513,0.000007736863,0.18519138,0.0019724614,0.0009342818,0.0123592615,0.0000817498,0.00026610817,0.16395189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671364,0.000017768327,0.00074571243,0.0013469547,0.0004510404,0.0007248689],"domain_scores_gemma":[0.9964299,0.0000668559,0.00030834414,0.0026412616,0.00032867675,0.000224913],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051610667,0.00053732883,0.00069531036,0.00026181986,0.00010765424,0.00028795312,0.0037969048,0.00074423355,0.000005438874],"category_scores_gemma":[0.000041625794,0.0005612192,0.0002559077,0.00013390402,0.00013685577,0.00020585036,0.0013266216,0.00038805528,0.00023138832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010430383,0.000019811601,0.000026559746,0.00009072497,0.000029473938,0.000018829878,0.00004535599,0.0000031952109,0.0000024150563,0.96324015,0.009412901,0.027100144],"study_design_scores_gemma":[0.00030075375,0.00015104613,0.00007624314,0.00015237714,0.000028886758,0.00005730586,0.000013728419,0.00013860181,0.00006644249,0.7104361,0.2879155,0.000662995],"about_ca_topic_score_codex":0.000121670666,"about_ca_topic_score_gemma":0.00048776178,"teacher_disagreement_score":0.6352207,"about_ca_system_score_codex":0.000707895,"about_ca_system_score_gemma":0.00042642406,"threshold_uncertainty_score":0.9996839},"labels":[],"label_agreement":null},{"id":"W2499679609","doi":"10.1007/978-3-319-03807-0","title":"Collaborative Web Hosting","year":2014,"lang":"en","type":"book","venue":"SpringerBriefs in computer science","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 Waterloo","funders":"","keywords":"World Wide Web; Computer science","score_opus":0.008392533007996004,"score_gpt":0.23710409116446995,"score_spread":0.22871155815647395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499679609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056894874,0.00022485135,0.87363946,0.0015525782,0.0038781732,0.00078411464,0.000006475644,0.001556853,0.11778856],"genre_scores_gemma":[0.018364782,0.000040577455,0.94348603,0.002722314,0.0011721015,0.000098990684,0.0000036026058,0.00008863446,0.034022987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931811,0.00008544919,0.000808161,0.0026833809,0.0017361301,0.0015057698],"domain_scores_gemma":[0.9949863,0.00044648137,0.00045120504,0.0031257526,0.0006291123,0.0003611262],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002703686,0.0007357601,0.0008760679,0.0019284128,0.0004008094,0.0012864211,0.011880488,0.00040341617,0.00000676385],"category_scores_gemma":[0.00035911135,0.0007760059,0.00011466331,0.0047023175,0.0010567382,0.0010201688,0.00874498,0.0011519414,0.00037055265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008698465,0.000090591966,0.00045209643,0.00012787529,0.000035403486,0.00042424188,0.0018610134,0.01211801,0.00037147067,0.3392155,0.061346866,0.58394825],"study_design_scores_gemma":[0.0006353687,0.0005483434,0.0017742977,0.0016576295,0.000011550483,0.000079311976,0.0000059029926,0.5055827,0.0011176562,0.02973364,0.456099,0.0027546016],"about_ca_topic_score_codex":0.000012406482,"about_ca_topic_score_gemma":0.00009006035,"teacher_disagreement_score":0.5811936,"about_ca_system_score_codex":0.0013181454,"about_ca_system_score_gemma":0.0033579615,"threshold_uncertainty_score":0.9997503},"labels":[],"label_agreement":null},{"id":"W2503813814","doi":"10.4018/978-1-61520-973-6.ch009","title":"Peer-to-Peer Platforms for High-Quality Web Services","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in web technologies and engineering book series","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Distributed hash table; Computer science; Scalability; Peer-to-peer; Load balancing (electrical power); Distributed computing; Overlay; Quality of service; Computer network; Service (business); Overlay network; Context (archaeology); Resource (disambiguation); World Wide Web; The Internet; Database; Operating system; Grid","score_opus":0.00829806124474307,"score_gpt":0.2349276214889119,"score_spread":0.2266295602441688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503813814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07630823,0.17319772,0.22208123,0.20814976,0.027108643,0.02238796,0.003501068,0.14665587,0.12060952],"genre_scores_gemma":[0.0525527,0.019384325,0.7472888,0.000723486,0.0003448438,0.0014912181,0.00010963477,0.0003681359,0.17773683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961468,0.0000030132899,0.00078328256,0.0013416973,0.0007213202,0.001003908],"domain_scores_gemma":[0.9971871,0.0002738276,0.00025180043,0.0017985554,0.0003657822,0.00012296374],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00057464035,0.00095455314,0.001076104,0.0010570491,0.00020232286,0.0003171386,0.0031099985,0.0013249596,0.0000068721097],"category_scores_gemma":[0.00043831466,0.0008959003,0.00012942214,0.0003481502,0.00030691712,0.0020713238,0.0024675257,0.0012791482,0.000024443692],"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.000040222636,0.000012883984,0.000033729175,0.0005034787,0.000050620594,0.000029601688,0.00013479311,0.0015251163,0.0025164261,0.8963788,0.00084901566,0.09792531],"study_design_scores_gemma":[0.00028120397,0.00030776515,0.000033366752,0.00042475376,0.000012917866,0.000024514431,0.00012378435,0.0006671995,0.0036812937,0.117419355,0.87591255,0.0011113142],"about_ca_topic_score_codex":0.0000092565215,"about_ca_topic_score_gemma":0.0005985023,"teacher_disagreement_score":0.87506354,"about_ca_system_score_codex":0.00014909828,"about_ca_system_score_gemma":0.00006793313,"threshold_uncertainty_score":0.9999715},"labels":[],"label_agreement":null},{"id":"W2506272472","doi":"10.4018/978-1-59140-384-5.ch010","title":"Object-Oriented Publish/Subscribe for Modeling and Processing Imperfect Information","year":2005,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Dissemination; Imperfect; World Wide Web; Object (grammar); Perfect information; Set (abstract data type); Artificial intelligence; Business; Telecommunications","score_opus":0.016413368557002025,"score_gpt":0.2396314020294836,"score_spread":0.2232180334724816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506272472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021214978,0.0004364312,0.56055456,0.00042327752,0.000369698,0.00085574994,0.000055989032,0.0012128116,0.43587932],"genre_scores_gemma":[0.5618664,0.00003085133,0.4142402,0.0044224714,0.0010747222,0.00047262057,0.00006759977,0.00013816239,0.017686928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776006,0.000007585088,0.00055439316,0.0006101999,0.00048728182,0.0005804689],"domain_scores_gemma":[0.99838024,0.000029356499,0.00026808484,0.0006960448,0.00045798733,0.00016826547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027952704,0.00048588158,0.00044242846,0.00027893472,0.00023198688,0.001002148,0.0011016852,0.0005288559,8.9955995e-7],"category_scores_gemma":[0.00010124522,0.000486229,0.00012345839,0.000091372836,0.00006436791,0.0013373478,0.0008194449,0.00032920853,0.000023407803],"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.000015054892,0.0000026455205,0.000002204242,0.000050958406,0.000022514032,0.0000023481005,0.00017344322,0.0004449706,0.0000035963333,0.7003699,0.0024431369,0.29646924],"study_design_scores_gemma":[0.00091194955,0.00032107858,0.000006936446,0.0006238331,0.00007317596,0.00012432826,0.000046036417,0.43230015,0.000090075366,0.3996827,0.16440754,0.0014121786],"about_ca_topic_score_codex":0.000020980668,"about_ca_topic_score_gemma":0.000047041114,"teacher_disagreement_score":0.56165427,"about_ca_system_score_codex":0.00034438548,"about_ca_system_score_gemma":0.00028468182,"threshold_uncertainty_score":0.99975896},"labels":[],"label_agreement":null},{"id":"W2519444691","doi":"10.1007/978-3-319-46140-3_3","title":"Fault Tolerant P2P RIA Crawling","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Crawling; Computer science; Fault tolerance; Redundancy (engineering); Distributed computing; The Internet; Extensibility; Web crawler; Single point of failure; World Wide Web; Operating system","score_opus":0.016291097503407626,"score_gpt":0.24415604772643748,"score_spread":0.22786495022302986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519444691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018583373,0.0004471622,0.9828732,0.005659648,0.0035600532,0.0005064579,0.000009146894,0.0010393055,0.0057191798],"genre_scores_gemma":[0.14601338,0.000052218984,0.8464524,0.0039681275,0.0011258511,0.00003017706,0.0000021090812,0.00007900512,0.0022767342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99387413,0.00003251571,0.00071456534,0.0025254202,0.0015115428,0.0013418274],"domain_scores_gemma":[0.99538016,0.0006421845,0.00031569175,0.0030114646,0.00036001223,0.00029046152],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010408993,0.00081581855,0.0007918781,0.0014517088,0.00034857172,0.00081350195,0.009193089,0.00059969706,0.000023406195],"category_scores_gemma":[0.00025434606,0.00064873043,0.0001851194,0.0010255212,0.0008433008,0.0007284199,0.004700736,0.0010615534,0.00036552493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005200514,0.000015100538,0.000024164488,0.000016539667,0.000012558533,0.00019274467,0.00032866353,0.010813064,0.00080249354,0.026258633,0.00016707799,0.96136373],"study_design_scores_gemma":[0.00061647844,0.00045375645,0.00014856555,0.0019289076,0.000014952182,0.00026056624,3.0247685e-7,0.32080486,0.012922558,0.6300144,0.030225769,0.002608891],"about_ca_topic_score_codex":0.000015896378,"about_ca_topic_score_gemma":0.000069306145,"teacher_disagreement_score":0.9587549,"about_ca_system_score_codex":0.00051786663,"about_ca_system_score_gemma":0.00052732456,"threshold_uncertainty_score":0.9995964},"labels":[],"label_agreement":null},{"id":"W2530170959","doi":"","title":"Databases, Information Systems, and Peer-to-Peer Computing: Second International Workshop, DBISP2P 2004, Toronto, Canada, August 29-30, 2004, Revised ... ed Papers (Lecture Notes in Computer Science)","year":2005,"lang":"en","type":"book","venue":"Springer eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Library science; Peer review; World Wide Web; Political science","score_opus":0.011192428693337992,"score_gpt":0.23569551794750704,"score_spread":0.22450308925416904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2530170959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014901047,0.0038591821,0.72512573,0.006539466,0.011703229,0.005003108,0.0006548749,0.0018616345,0.24376269],"genre_scores_gemma":[0.28454682,0.00010125489,0.3533636,0.018828928,0.007165046,0.00039118188,0.0012932435,0.0004573286,0.33385262],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933848,0.000068850764,0.0012170085,0.0014554487,0.0026414397,0.0012324811],"domain_scores_gemma":[0.99580586,0.00029147425,0.000562699,0.0018026702,0.0010228468,0.0005144241],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016612998,0.0008862365,0.0008961893,0.0009171031,0.00034002156,0.0013975834,0.0038612904,0.00043745319,0.000111152585],"category_scores_gemma":[0.00041937013,0.0009177442,0.00009624836,0.0003417477,0.0002773528,0.0010908971,0.0030460765,0.0011118053,0.00006024216],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039184717,0.00003519165,0.00028219246,0.00028117883,0.00016521713,0.000116497584,0.0013843887,0.028057234,0.000068042194,0.0063661034,0.40554842,0.55765635],"study_design_scores_gemma":[0.00060936384,0.000052732285,0.00092440436,0.0010967501,0.00002242117,0.00005329139,0.000027871778,0.026218837,0.00009865204,0.00007059197,0.9696117,0.0012133897],"about_ca_topic_score_codex":0.0270647,"about_ca_topic_score_gemma":0.20706575,"teacher_disagreement_score":0.56406325,"about_ca_system_score_codex":0.0041680243,"about_ca_system_score_gemma":0.0031368912,"threshold_uncertainty_score":0.99965477},"labels":[],"label_agreement":null},{"id":"W253059052","doi":"10.1007/bf03219896","title":"BALLS: A structured peer-to-peer system with integrated load balancing","year":2006,"lang":"en","type":"article","venue":"Annals of Telecommunications","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Computer science; Overlay; Load balancing (electrical power); Distributed computing; Overlay network; Peer-to-peer; Computer network; Routing algorithm; Routing (electronic design automation); Routing protocol; The Internet; Grid; Operating system","score_opus":0.026111272283334198,"score_gpt":0.28133673953333577,"score_spread":0.25522546725000156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W253059052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13004987,0.0009506067,0.6949941,0.14697897,0.00025602826,0.0013208193,0.00011532262,0.003028705,0.022305563],"genre_scores_gemma":[0.7255789,0.000008081257,0.27310395,0.00042814628,0.000020487038,0.000076297445,0.000026107182,0.000017434171,0.0007406016],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766016,0.0001226193,0.00052693806,0.00041717768,0.00077472854,0.0004983762],"domain_scores_gemma":[0.99385107,0.00019921134,0.00023616651,0.0032520716,0.0023362413,0.00012527194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077124115,0.00025460258,0.0003753642,0.00036505988,0.00024528542,0.0001801691,0.004422982,0.00012598949,0.000005911893],"category_scores_gemma":[0.0003552481,0.00021800729,0.00008254919,0.0022493722,0.00009788436,0.00032045107,0.000943096,0.00034281745,0.000063313964],"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.000081081824,0.0005610842,0.0073504504,0.00012145059,0.0003786389,0.000028316352,0.002709335,0.04278639,0.008683284,0.32942396,0.52774405,0.08013193],"study_design_scores_gemma":[0.0017007259,0.0014796627,0.12449678,0.001752698,0.00009637844,0.00027697842,0.0027908075,0.07705861,0.0767717,0.009893499,0.70073134,0.0029508376],"about_ca_topic_score_codex":0.0013749696,"about_ca_topic_score_gemma":0.0021956635,"teacher_disagreement_score":0.595529,"about_ca_system_score_codex":0.00012559038,"about_ca_system_score_gemma":0.0002340781,"threshold_uncertainty_score":0.8890079},"labels":[],"label_agreement":null},{"id":"W2532646564","doi":"10.1109/socialcom.2013.133","title":"Minimizing Social Data Overload through Interest-Based Stream Filtering in a P2P Social Network","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Filter (signal processing); Data stream; Social network (sociolinguistics); Construct (python library); Scheme (mathematics); Distributed computing; Mechanism (biology); Data stream mining; Computer network; World Wide Web; Social media; Data mining; Telecommunications","score_opus":0.10101039937975498,"score_gpt":0.3081211861390911,"score_spread":0.20711078675933614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532646564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122348644,0.00017612027,0.82589936,0.039823987,0.0010798614,0.00089328183,0.000024284802,0.0026281476,0.0071263174],"genre_scores_gemma":[0.67766935,0.0000041394833,0.3164072,0.0051557617,0.0004941016,0.00007661474,0.000024167251,0.000024728493,0.00014395588],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975498,0.00007781452,0.0004078745,0.0008117872,0.0002974861,0.0008552835],"domain_scores_gemma":[0.99848527,0.00016499539,0.00011306533,0.0011245917,0.000054970875,0.000057122696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029251218,0.00026920743,0.00033908684,0.0001224547,0.00022953874,0.00046219837,0.004135235,0.00019243086,0.00007148761],"category_scores_gemma":[0.00008288825,0.00026372328,0.000063830164,0.0009936373,0.0000937297,0.0012921176,0.00386805,0.00034451362,0.00015535978],"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.0000146543025,0.00012257075,0.00085400953,0.000021063333,0.00003525307,0.00003769038,0.0010500395,0.0008276967,0.00048902445,0.012475441,0.82919925,0.15487328],"study_design_scores_gemma":[0.003829809,0.00048694163,0.039014306,0.00045211462,0.00003601955,0.000017220906,0.001534009,0.76707685,0.0038452824,0.05337674,0.12687264,0.0034580575],"about_ca_topic_score_codex":0.00043367705,"about_ca_topic_score_gemma":0.0005144483,"teacher_disagreement_score":0.7662492,"about_ca_system_score_codex":0.00012372776,"about_ca_system_score_gemma":0.000083973515,"threshold_uncertainty_score":0.9999815},"labels":[],"label_agreement":null},{"id":"W2535671654","doi":"10.1109/icics.2005.1689197","title":"Modeling Virus Propagation in Peer-to-Peer Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Peer-to-peer; Computer network; Distributed computing","score_opus":0.02045219294108815,"score_gpt":0.2605068246098288,"score_spread":0.24005463166874066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535671654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0507416,0.000050233302,0.90688473,0.03733261,0.0002413676,0.00040528984,6.085043e-7,0.0011800866,0.0031634846],"genre_scores_gemma":[0.72874457,0.0000042650277,0.2670143,0.0019205187,0.00014917718,0.00006375317,0.0000024055162,0.000014115271,0.002086867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752194,0.000037644237,0.00039713428,0.00065115356,0.0007349802,0.00065713294],"domain_scores_gemma":[0.998591,0.00004106413,0.00003762229,0.00087574986,0.00030800988,0.00014657351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089592877,0.0002193765,0.00021703063,0.00041937063,0.00008627708,0.0002474644,0.0016080742,0.00016690706,0.000014746716],"category_scores_gemma":[0.0002253035,0.00020450313,0.000045699977,0.0015498005,0.000018262654,0.0006846122,0.00078567595,0.00032454278,0.00029507483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004567155,0.00003289372,0.00011659575,0.0000011777812,0.0000029839107,0.0000054407005,0.00023196373,0.8422467,0.00019067847,0.009163462,0.0080822855,0.13992123],"study_design_scores_gemma":[0.0001649613,0.00005260878,0.00022333884,0.000021244603,0.0000015651341,0.000005834716,0.000025761597,0.98609835,0.0012569741,0.0012666555,0.010598366,0.00028436008],"about_ca_topic_score_codex":0.00016595834,"about_ca_topic_score_gemma":0.0013651464,"teacher_disagreement_score":0.678003,"about_ca_system_score_codex":0.00023214007,"about_ca_system_score_gemma":0.000047316455,"threshold_uncertainty_score":0.83393955},"labels":[],"label_agreement":null},{"id":"W2545870575","doi":"10.1109/icspc.2007.4728555","title":"State Management in Large Scale Group Communication","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Bottleneck; Scalability; Computer science; Distributed computing; Position (finance); Position paper; Protocol (science); Computer network; Operating system; Embedded system; World Wide Web","score_opus":0.01124620530537502,"score_gpt":0.2583320502922454,"score_spread":0.24708584498687036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545870575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067616366,0.00006286123,0.89693046,0.0022292405,0.000062097075,0.00020193952,3.6891603e-7,0.0005979625,0.032298706],"genre_scores_gemma":[0.61354613,0.00003176706,0.3849515,0.00055365014,0.0000027598392,0.000010736223,0.000001347603,0.000003309383,0.0008987722],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990781,0.00002045752,0.00017570614,0.0002147118,0.0001712461,0.00033978833],"domain_scores_gemma":[0.99888635,0.000037926544,0.00002757841,0.0009915539,0.000018157143,0.000038455506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095117046,0.00007179716,0.00007470961,0.00022572585,0.000048899034,0.000059225025,0.0014852467,0.00003140138,0.000005317463],"category_scores_gemma":[0.0000058071564,0.00006861187,0.000015255611,0.00078399136,0.000018613551,0.00022704081,0.0013078074,0.00010337857,0.00011666652],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007871123,0.00021430964,0.010152251,0.000008479612,0.000012043786,0.000042743977,0.0010250545,0.00022942593,0.000103231934,0.35429022,0.009858284,0.6240561],"study_design_scores_gemma":[0.0015603123,0.00015839694,0.6347953,0.000086224136,0.000004698917,0.000009489167,0.0011173919,0.057236016,0.0037985432,0.11003699,0.19038993,0.0008067179],"about_ca_topic_score_codex":0.000037911435,"about_ca_topic_score_gemma":0.0019407452,"teacher_disagreement_score":0.624643,"about_ca_system_score_codex":0.00007034884,"about_ca_system_score_gemma":0.00000259825,"threshold_uncertainty_score":0.2797911},"labels":[],"label_agreement":null},{"id":"W2548293999","doi":"10.1002/9781118640708.ch05","title":"Data Distribution Management","year":2013,"lang":"en","type":"other","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Overlay network; Layer (electronics); Data management; Search engine indexing; Grid; Distributed management; Architecture; Distributed database; Overlay; Peer-to-peer; Data mining; The Internet; Information retrieval; World Wide Web","score_opus":0.02904265199384891,"score_gpt":0.26069936377137876,"score_spread":0.23165671177752983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548293999","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.67674e-8,0.00009335687,0.52727175,0.0012514339,0.00027987926,0.00021596461,0.000072977324,0.0018851926,0.46892938],"genre_scores_gemma":[0.000017151759,0.000077321965,0.21019746,0.00021038829,0.00007430769,0.000031473308,0.00038054909,0.000054515862,0.7889568],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866724,0.000011064774,0.000113311755,0.0006747426,0.00025790487,0.00027575367],"domain_scores_gemma":[0.9958768,0.000008618601,0.00006205302,0.0039901473,0.000011496395,0.00005086819],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009915169,0.00017829586,0.00015015718,0.00013751596,0.000022135324,0.00016606861,0.006212973,0.0001567141,0.0004199905],"category_scores_gemma":[0.000010288538,0.00014964478,0.00001759938,0.00036156652,0.000024759653,0.00013641374,0.0064129024,0.00010447559,0.004464736],"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":[5.7207284e-8,0.000007208983,0.0000017751518,0.000007861198,0.000018987008,0.00000587293,5.8201755e-7,7.0032223e-7,1.4054893e-7,0.119415045,0.77734435,0.1031974],"study_design_scores_gemma":[0.00003979894,0.000008737855,0.000045680128,0.000042274645,0.000005354095,0.0000015122214,0.0000023501482,0.0032319464,0.0000040332447,0.00086284743,0.99556136,0.0001941169],"about_ca_topic_score_codex":0.00008526594,"about_ca_topic_score_gemma":0.000055136672,"teacher_disagreement_score":0.32002744,"about_ca_system_score_codex":0.000039681247,"about_ca_system_score_gemma":0.000008337167,"threshold_uncertainty_score":0.99916387},"labels":[],"label_agreement":null},{"id":"W2548544249","doi":"10.1002/9780470579398.ch4","title":"Mobility in Publish/Subscribe Systems","year":2010,"lang":"en","type":"other","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Computer network; World Wide Web; Business; Advertising","score_opus":0.013614973403134759,"score_gpt":0.2342411841046172,"score_spread":0.22062621070148244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548544249","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043195392,0.0004942768,0.086688235,0.0015000534,0.0032226762,0.0007641426,0.0000088828165,0.0045363335,0.9027422],"genre_scores_gemma":[0.003677951,0.000019274112,0.06047762,0.00029461132,0.0002607814,0.00022047217,0.0000066336543,0.00018305785,0.9348596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977731,0.000050021627,0.00031148075,0.00091269356,0.00041689636,0.0005357908],"domain_scores_gemma":[0.99699825,0.000054040986,0.0001250537,0.0026598081,0.000051843967,0.00011101517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054402155,0.0003172332,0.00045578455,0.0008044632,0.000020025851,0.00049337675,0.0042177704,0.00087156234,0.00022301756],"category_scores_gemma":[0.0001638997,0.00027163085,0.00005823321,0.0010933013,0.00007284233,0.00023461186,0.0013188967,0.0007543362,0.0004934078],"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":[3.9370786e-7,0.000045186807,0.00024650272,0.000027858903,0.000007686085,0.00001648789,0.00001820697,0.000010735587,0.000010117083,0.03539614,0.95277375,0.011446945],"study_design_scores_gemma":[0.00009682571,0.000022163804,0.00026945543,0.00008719466,0.0000015606705,0.000007674822,0.0000129891205,0.0019760404,0.000022935697,0.0009140006,0.99622744,0.00036174295],"about_ca_topic_score_codex":0.0026329737,"about_ca_topic_score_gemma":0.0061375904,"teacher_disagreement_score":0.04345368,"about_ca_system_score_codex":0.00008802449,"about_ca_system_score_gemma":0.000094078445,"threshold_uncertainty_score":0.9999736},"labels":[],"label_agreement":null},{"id":"W2548649919","doi":"10.82308/9197","title":"Resource addressable network","year":2009,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Overlay network; Resource (disambiguation); Overlay; Node (physics); Range query (database); Distributed computing; Data science; World Wide Web; Computer network; The Internet; Search engine; Web search query","score_opus":0.017839219891839866,"score_gpt":0.22767931771660188,"score_spread":0.209840097824762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548649919","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4525017,0.0012063315,0.0012550625,0.007165752,0.0023974336,0.002207999,0.00019605132,0.01421755,0.5188521],"genre_scores_gemma":[0.91380054,0.000035973135,0.076527424,0.006364226,0.00013617983,0.00006148081,0.000011510146,0.000065436274,0.0029972158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99455166,0.000291305,0.00073256076,0.0015634033,0.0010359727,0.001825101],"domain_scores_gemma":[0.99587065,0.00029233383,0.00026083476,0.0027867223,0.00022933219,0.00056013867],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001539935,0.00063762156,0.00062289607,0.00036806596,0.0013579134,0.00034101174,0.0047134487,0.00046650835,0.000046344],"category_scores_gemma":[0.00069302844,0.00066257623,0.0002388175,0.0029022247,0.000094185496,0.0014748327,0.0015577009,0.0012446486,0.0010716614],"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.00002689052,0.00010839928,0.000038804348,0.000007596832,0.000034410747,0.00013884743,0.000003255302,0.0035845274,0.0028607857,0.54588854,0.0022718667,0.44503608],"study_design_scores_gemma":[0.0005457505,0.0004254217,0.0013666569,0.00013508707,0.00002105706,0.00009070127,0.000013989845,0.0010834513,0.015004276,0.20789883,0.772396,0.0010187546],"about_ca_topic_score_codex":0.000034078443,"about_ca_topic_score_gemma":0.0000573924,"teacher_disagreement_score":0.77012414,"about_ca_system_score_codex":0.00045829144,"about_ca_system_score_gemma":0.000032279273,"threshold_uncertainty_score":0.9999422},"labels":[],"label_agreement":null},{"id":"W2551030080","doi":"10.22215/etd/2008-08462","title":"Facilitating Web service discovery in distributed Web service registries","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"Ontario Centres of Excellence; Canarie","keywords":"World Wide Web; Service (business); Computer science; Web service; Library science; Business","score_opus":0.01862795968800857,"score_gpt":0.25425895025851586,"score_spread":0.2356309905705073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551030080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382318,0.0008194991,0.026333615,0.016152572,0.001845481,0.0013056366,0.0006282441,0.0039625643,0.010720574],"genre_scores_gemma":[0.8646695,0.00045086702,0.087133795,0.0044040172,0.00025231045,0.0006921938,0.00812258,0.00017641878,0.034098342],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99581397,0.00010327072,0.00089027814,0.00140101,0.0008626511,0.0009288125],"domain_scores_gemma":[0.99661773,0.0004772186,0.0003763485,0.0018610081,0.00052865106,0.00013901504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032048137,0.0007212575,0.0007768814,0.00060460943,0.00023482814,0.0005483657,0.003977762,0.00068750675,0.00001153332],"category_scores_gemma":[0.0005099757,0.00071834255,0.00012522096,0.0050475798,0.000040043124,0.0013929589,0.0007978632,0.00090820726,0.0002459798],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010041696,0.0017029295,0.015972307,0.007573796,0.0009444473,0.0026551392,0.06287409,0.03212994,0.019493155,0.07524595,0.6354096,0.14499447],"study_design_scores_gemma":[0.0065662963,0.00088895473,0.05611598,0.0074336855,0.00018855942,0.00033353205,0.073817655,0.44537452,0.019366533,0.016379546,0.35868362,0.014851118],"about_ca_topic_score_codex":0.0014065565,"about_ca_topic_score_gemma":0.046085086,"teacher_disagreement_score":0.41324458,"about_ca_system_score_codex":0.00033229263,"about_ca_system_score_gemma":0.0007959895,"threshold_uncertainty_score":0.99952674},"labels":[],"label_agreement":null},{"id":"W2551798946","doi":"10.1007/978-3-319-47509-7_12","title":"An Incentive Mechanism for P2P Network Using Accumulated-Payoff Based Snowdrift Game Model","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Peer-to-Peer Network Technologies","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 British Columbia","funders":"","keywords":"Selfishness; Incentive; Stochastic game; Computer science; Game theory; Stability (learning theory); Mechanism (biology); Microeconomics; Economics; Psychology","score_opus":0.039212328011542126,"score_gpt":0.2731790886590626,"score_spread":0.23396676064752048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551798946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019049303,0.0000881892,0.9964086,0.0011210887,0.0005871938,0.0010193092,0.00011027463,0.00023686781,0.00023797508],"genre_scores_gemma":[0.032394707,0.000021173983,0.9668373,0.0004594295,0.00016712531,0.000048121005,0.000020839278,0.000028066705,0.00002327694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982621,0.000012189324,0.0006645473,0.00029170892,0.0003063139,0.000463146],"domain_scores_gemma":[0.997522,0.00036161076,0.000524054,0.0011264636,0.0003839161,0.000081945305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048393494,0.00039472853,0.00047524855,0.00029005235,0.000961356,0.00031647703,0.0040751128,0.00035723776,2.6676602e-7],"category_scores_gemma":[0.00007488911,0.00030936944,0.00022467715,0.00032780698,0.00031565712,0.0006371066,0.0011916447,0.0003431769,3.710836e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018850665,0.0000069081193,5.512463e-7,0.000040602077,0.000036136982,3.6851308e-8,0.0002943734,0.7687354,0.000025567493,0.22054796,0.00003162197,0.010278937],"study_design_scores_gemma":[0.00022084851,0.00009433181,0.0000020593611,0.00030463006,0.000039520477,0.0000026116563,0.0000011134886,0.9652455,0.00024459313,0.030247461,0.0032127413,0.00038460005],"about_ca_topic_score_codex":0.000009474013,"about_ca_topic_score_gemma":0.000041917512,"teacher_disagreement_score":0.19651006,"about_ca_system_score_codex":0.00013838886,"about_ca_system_score_gemma":0.00031185668,"threshold_uncertainty_score":0.99993587},"labels":[],"label_agreement":null},{"id":"W2557853356","doi":"","title":"Publisher Relocation Algorithms for Minimizing Average Delivery Delay and System Load","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"PlanetLab; Computer science; Testbed; Exploit; Computer network; Relocation; Scheduling (production processes); Distributed computing; Queuing delay; Load balancing (electrical power); Queueing theory; Real-time computing; Algorithm; Scalability; Mathematical optimization; Operating system; Grid; Computer security","score_opus":0.01889584997518255,"score_gpt":0.23779947800693696,"score_spread":0.21890362803175442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557853356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009755087,0.00024713285,0.97914475,0.004756266,0.00040798038,0.0003581695,7.3081236e-7,0.0012378419,0.0040920465],"genre_scores_gemma":[0.5578401,0.0000069949165,0.44063222,0.0006167071,0.000044705852,0.000029050401,0.0000014938207,0.000005506974,0.0008232083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878305,0.000016957307,0.00020998566,0.00044259083,0.00023570044,0.000311706],"domain_scores_gemma":[0.99905133,0.00008781722,0.000056712688,0.0005065389,0.00021870583,0.00007887672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039713577,0.00013309141,0.00015162797,0.00013872785,0.000120925026,0.00043323194,0.0006986443,0.00010885791,6.441594e-7],"category_scores_gemma":[0.00008325987,0.00011904259,0.00003343631,0.0004091641,0.000017419006,0.00088162936,0.00019420889,0.00007897706,0.000012300278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011824519,0.000034417666,0.00011546662,0.00003034747,0.000018722236,0.00001726537,0.00042506363,0.00066272286,0.00033602392,0.06434685,0.10458317,0.8294181],"study_design_scores_gemma":[0.0010376993,0.00054734736,0.0032969823,0.00014505169,0.000017517508,0.00014508303,0.00033236344,0.9518497,0.001986012,0.009762134,0.03010946,0.00077067845],"about_ca_topic_score_codex":0.000034010325,"about_ca_topic_score_gemma":0.000014280805,"teacher_disagreement_score":0.95118695,"about_ca_system_score_codex":0.00015010026,"about_ca_system_score_gemma":0.00004993916,"threshold_uncertainty_score":0.4854416},"labels":[],"label_agreement":null},{"id":"W2577578480","doi":"10.1145/3040230.3040241","title":"Pricing for a Hybrid Delivery Model of Video Streaming","year":2017,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Institut National de la Recherche Scientifique","funders":"","keywords":"Incentive; Service provider; Relay; Video on demand; Computer science; Video streaming; Business; Service (business); Peer-to-peer; Computer network; Microeconomics; Marketing; Economics","score_opus":0.1252966982425459,"score_gpt":0.3569840132799013,"score_spread":0.2316873150373554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577578480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2075791,0.032781083,0.7526785,0.0027152733,0.00043445267,0.0028876646,0.000011000054,0.00024301223,0.00066990167],"genre_scores_gemma":[0.6974547,0.03943572,0.26215994,0.0005220691,0.000037262023,0.00032458152,0.00000712271,0.000014448272,0.000044187396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976116,0.000042797114,0.00059902854,0.00047187816,0.00093226216,0.0003424452],"domain_scores_gemma":[0.99492306,0.0004455257,0.0007414455,0.0029418208,0.00088131684,0.00006681625],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0044899136,0.0001930966,0.00043664113,0.00045526755,0.00038915515,0.00013811361,0.0037342573,0.000055609853,0.000004864584],"category_scores_gemma":[0.01471126,0.00017900365,0.00012226407,0.000907441,0.000046374607,0.0012039117,0.0011304006,0.00013089624,0.000020684587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002389499,0.000019339815,0.0006171435,0.00066754955,0.00001382627,1.9500004e-7,0.000027274156,0.00689488,0.00012214846,0.0003878513,0.0018825418,0.98936486],"study_design_scores_gemma":[0.0002955626,0.00012586296,0.0016284867,0.0015956127,0.00007926721,0.0000027137785,0.000002277438,0.98900896,0.0033367914,0.0013990261,0.0023015281,0.00022388654],"about_ca_topic_score_codex":0.00000583317,"about_ca_topic_score_gemma":0.000001600875,"teacher_disagreement_score":0.989141,"about_ca_system_score_codex":0.00015192159,"about_ca_system_score_gemma":0.00023852356,"threshold_uncertainty_score":0.99358827},"labels":[],"label_agreement":null},{"id":"W2594546957","doi":"","title":"MothPad: monitoring pub/sub activity in cyber-physical systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dissemination; Computer science; Publication; Context (archaeology); Visualization; Cyber-physical system; Data visualization; Event (particle physics); World Wide Web; Telecommunications; Data mining; Operating system","score_opus":0.02009187165324433,"score_gpt":0.25387773921658274,"score_spread":0.2337858675633384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594546957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7525045,0.00002028304,0.24144152,0.0025508937,0.0006571606,0.00016643583,7.5822743e-7,0.00095098984,0.0017074541],"genre_scores_gemma":[0.9936411,0.000006044172,0.0054291994,0.000017500255,0.000184008,0.000059232232,3.392462e-8,0.000009621963,0.0006532729],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984974,0.000049899747,0.00014511168,0.00049183803,0.0003279773,0.00048773614],"domain_scores_gemma":[0.99873245,0.00021443803,0.00004521825,0.0008726248,0.000042235624,0.00009301406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023802719,0.00015949365,0.00022288,0.00018833565,0.000043209744,0.00013929704,0.0012868947,0.00008875904,7.50177e-7],"category_scores_gemma":[0.00009142178,0.00010660641,0.000042781317,0.00064560614,0.000038390473,0.00071618933,0.0007744832,0.00014022582,0.00021710372],"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.000010775728,0.00022347519,0.02779149,0.000016225793,0.000024769586,0.00007541291,0.0003029456,0.00053724565,0.17906787,0.06258556,0.0031676816,0.7261965],"study_design_scores_gemma":[0.0012752184,0.00037369467,0.18342733,0.0005185433,0.0000075444345,0.000037783204,0.000112329646,0.057366814,0.7358639,0.012412924,0.0070884936,0.0015153759],"about_ca_topic_score_codex":0.00013263641,"about_ca_topic_score_gemma":0.00001931266,"teacher_disagreement_score":0.7246812,"about_ca_system_score_codex":0.00019195826,"about_ca_system_score_gemma":0.000029375313,"threshold_uncertainty_score":0.4347283},"labels":[],"label_agreement":null},{"id":"W2599893809","doi":"10.1109/iccnc.2017.7876220","title":"Modeling of free riders in P2P live streaming systems","year":2017,"lang":"en","type":"article","venue":"2017 International Conference on Computing, Networking and Communications (ICNC)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Live streaming; Computer science; Free rider problem; The Internet; Peer-to-peer; Domain (mathematical analysis); Free riding; Computer network; World Wide Web; Mathematics; Microeconomics","score_opus":0.12291732893678378,"score_gpt":0.3365380170672215,"score_spread":0.2136206881304377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599893809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22126001,0.0022099912,0.6320157,0.019938301,0.0040079625,0.0010085305,0.000031278505,0.00078400056,0.118744195],"genre_scores_gemma":[0.9769975,0.00047902938,0.022219047,0.000066785506,0.00011074778,0.000021155633,0.000008298324,0.000011471229,0.000085957756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823767,0.000113898386,0.0005128002,0.00045143257,0.00036334898,0.00032083664],"domain_scores_gemma":[0.99519813,0.00025378927,0.00046829373,0.0036652302,0.00033945954,0.000075120086],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007257457,0.00021265692,0.00030659858,0.00031823444,0.00062409963,0.00073686027,0.008815647,0.00011435367,0.000002140087],"category_scores_gemma":[0.00024999407,0.00022644516,0.000053502747,0.00014154751,0.0002120426,0.00032077008,0.004495382,0.00045603557,0.000010004999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017577351,0.00014497875,0.009262105,0.000017803042,0.00009191217,0.000008818618,0.0018008722,0.11401893,0.00004946679,0.77875125,0.00070477684,0.09513151],"study_design_scores_gemma":[0.0002998069,0.000052173542,0.0025435577,0.000860514,0.000004900411,0.000009652848,0.00030747935,0.9833613,0.000007438682,0.011762779,0.00057687133,0.00021352975],"about_ca_topic_score_codex":0.001314274,"about_ca_topic_score_gemma":0.0005649714,"teacher_disagreement_score":0.8693424,"about_ca_system_score_codex":0.000090385016,"about_ca_system_score_gemma":0.00008079887,"threshold_uncertainty_score":0.99654716},"labels":[],"label_agreement":null},{"id":"W2610976550","doi":"","title":"General Flow Characteristics of P2P Streaming Considering Impact to Network Load.","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Network packet; The Internet; Flow (mathematics); Weibull distribution; Exponential distribution; Pareto distribution; Volume (thermodynamics); Heavy-tailed distribution; Distribution (mathematics); Pareto principle; Computer network; Real-time computing; Probability distribution; Statistics; Mathematics; World Wide Web","score_opus":0.009708730002021038,"score_gpt":0.24898847630579235,"score_spread":0.2392797463037713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610976550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43066347,0.0000032094736,0.5678548,0.00026045847,0.00067200203,0.00010600993,0.0000038807666,0.000117385316,0.00031876695],"genre_scores_gemma":[0.61775017,0.0000029067273,0.3815809,0.00057105423,0.00008566005,0.0000032473095,0.0000011989122,0.0000016912036,0.0000031990505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985637,0.000007888504,0.00036741028,0.00021644188,0.00045221258,0.00039231154],"domain_scores_gemma":[0.99868214,0.000057472822,0.00013338152,0.00053619937,0.0003869539,0.00020383965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007498301,0.00013226423,0.00018116782,0.0002889404,0.00020884023,0.0005564055,0.0011425704,0.00004858601,0.000003567321],"category_scores_gemma":[0.00014832967,0.00011470656,0.000029039451,0.0012815255,0.00017929962,0.004004172,0.001195485,0.00015455711,0.000028816543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046527684,0.000009541362,0.0046470747,0.000013130123,0.0000055214905,0.0000015220281,0.0021461954,0.017925693,0.0032999855,0.014368608,0.0025563363,0.95502174],"study_design_scores_gemma":[0.000117640746,0.00013189578,0.13611133,0.000031868374,0.0000014770742,0.00003761583,0.000009205425,0.8535835,0.0015166504,0.0003590549,0.00789168,0.00020807795],"about_ca_topic_score_codex":0.000012610234,"about_ca_topic_score_gemma":0.0000033272088,"teacher_disagreement_score":0.95481366,"about_ca_system_score_codex":0.000043965494,"about_ca_system_score_gemma":0.00020865303,"threshold_uncertainty_score":0.5365431},"labels":[],"label_agreement":null},{"id":"W26293774","doi":"10.1016/j.jacc.2015.06.1085","title":"Towards autonomic marketing","year":2012,"lang":"en","type":"article","venue":"International Conference on Autonomic and Autonomous Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Marketing management; Computer science; Marketing research; Digital marketing; Business marketing; Marketing strategy; Marketing; Return on marketing investment; Merge (version control); Knowledge management; Business","score_opus":0.036774065141358815,"score_gpt":0.2727157472125983,"score_spread":0.23594168207123947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26293774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47098133,0.00093801535,0.19852273,0.020754041,0.015322876,0.0013717004,0.00008047451,0.0032804902,0.28874835],"genre_scores_gemma":[0.9894126,0.000035598077,0.0062908074,0.0004325469,0.00036059838,0.00010879883,0.0000074237532,0.000022189757,0.0033294298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978353,0.00010827032,0.00053118094,0.0006115588,0.0002854752,0.000628266],"domain_scores_gemma":[0.99866575,0.00012756363,0.00024003873,0.0006011551,0.0001109482,0.00025453616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001076268,0.0003249466,0.00035331535,0.0003631823,0.00015084368,0.00065202784,0.0016569061,0.00015321087,0.000053540898],"category_scores_gemma":[0.00010439335,0.0003144788,0.00007410853,0.00014643934,0.0000798772,0.0006883082,0.0007223594,0.00026620922,0.00052309706],"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.00001923309,0.00006844124,0.0024358481,0.000010667585,0.0000786621,0.0000063986386,0.0005428499,0.0007700121,0.00080321915,0.87462974,0.001885286,0.11874964],"study_design_scores_gemma":[0.00091771956,0.0002259071,0.06335427,0.00038488398,0.000019584202,0.00025647416,0.00063057966,0.6664647,0.0009858458,0.0029442795,0.26231235,0.0015034092],"about_ca_topic_score_codex":0.00013911023,"about_ca_topic_score_gemma":0.0000047269036,"teacher_disagreement_score":0.87168545,"about_ca_system_score_codex":0.0005342814,"about_ca_system_score_gemma":0.0002332549,"threshold_uncertainty_score":0.99993074},"labels":[],"label_agreement":null},{"id":"W2646126075","doi":"10.1145/3085585.3085589","title":"Fambit","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Revenue; Computer science; Payment; World Wide Web; The Internet; Service (business); Plug-in; Advertising; Business; Marketing","score_opus":0.024077038000057595,"score_gpt":0.28190576606678824,"score_spread":0.25782872806673063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2646126075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019125775,0.0000175219,0.75462294,0.03573187,0.000492664,0.000085561885,2.8352503e-7,0.0014272932,0.18849607],"genre_scores_gemma":[0.80000716,0.0000018574212,0.19200288,0.00068384333,0.000030456715,0.0000065524605,5.995208e-8,0.000002659731,0.0072645447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994036,0.0000037391897,0.00005976559,0.00021280436,0.00012532537,0.0001947525],"domain_scores_gemma":[0.99809915,0.000013473164,0.000030906253,0.0017834891,0.000026963877,0.00004601879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102095866,0.000057502104,0.00006494165,0.000042379837,0.00022063573,0.00042334548,0.0033487359,0.000037112375,0.000011870507],"category_scores_gemma":[0.000104367246,0.000047565863,0.000020709302,0.00006151768,0.000036825597,0.00035412225,0.0014309532,0.000058629084,0.00074160966],"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":[6.1199586e-7,0.000012849726,0.0027362457,0.0000011459468,0.000005436162,0.000024334566,0.00005388531,0.00001542321,0.00046535782,0.44171837,0.1316777,0.42328864],"study_design_scores_gemma":[0.00039582097,0.00017179648,0.16206379,0.00002483825,0.0000032653177,0.000029443092,0.000023983926,0.026748518,0.03317262,0.12972474,0.64695776,0.0006834237],"about_ca_topic_score_codex":0.00004633934,"about_ca_topic_score_gemma":0.00004036586,"teacher_disagreement_score":0.78088135,"about_ca_system_score_codex":0.00001157986,"about_ca_system_score_gemma":0.000011497771,"threshold_uncertainty_score":0.9532139},"labels":[],"label_agreement":null},{"id":"W26889595","doi":"10.1016/j.ijcard.2016.02.018","title":"Peer-to-Peer content search supported by a distributed index in a publication/search model","year":2006,"lang":"en","type":"article","venue":"Journal of Digital Information Management","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Search engine indexing; Peer-to-peer; Node (physics); Information retrieval; Index (typography); Set (abstract data type); Search engine; Hierarchy; Server; Distributed computing; Data mining; Theoretical computer science; Computer network; World Wide Web","score_opus":0.030279114673415274,"score_gpt":0.26438799017650916,"score_spread":0.2341088755030939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26889595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032123256,0.000008297523,0.8982702,0.06191368,0.00008072481,0.00051316194,0.000080387086,0.00012058081,0.006889735],"genre_scores_gemma":[0.9790194,0.0000037321352,0.016843906,0.00084852794,0.000019721141,0.000030077783,0.0001784502,0.0000074620943,0.003048711],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611187,0.000020001416,0.0011241306,0.00016893222,0.0020918953,0.00048316314],"domain_scores_gemma":[0.9969697,0.000033201315,0.00028360295,0.0004568071,0.0020719306,0.00018476059],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001247711,0.00017742913,0.00023816184,0.0014072821,0.00006441496,0.0017760658,0.0015973045,0.00009406132,0.0000058726196],"category_scores_gemma":[0.00019401626,0.00016214456,0.00008268606,0.0018879949,0.000033561355,0.006441328,0.0008022005,0.00036565922,0.00012384845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006224336,0.00030508035,0.0032959718,0.000036645095,0.00006793013,0.000023513601,0.0006069523,0.22112192,0.00003913301,0.030904464,0.65247977,0.091056384],"study_design_scores_gemma":[0.002504254,0.00036366645,0.044158593,0.00010384148,0.00001290986,0.000053819036,0.0013671414,0.6949542,0.00067334814,0.0052984473,0.24987906,0.0006306689],"about_ca_topic_score_codex":0.000024296152,"about_ca_topic_score_gemma":0.0000054946354,"teacher_disagreement_score":0.94689614,"about_ca_system_score_codex":0.0004456902,"about_ca_system_score_gemma":0.000088486086,"threshold_uncertainty_score":0.9992602},"labels":[],"label_agreement":null},{"id":"W2700566289","doi":"10.1007/978-0-387-39940-9_1209","title":"Type-based Publish/Subscribe","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","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 Toronto","funders":"","keywords":"Publication; Computer science; Business; Advertising","score_opus":0.020821404266507942,"score_gpt":0.23408438196282758,"score_spread":0.21326297769631963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2700566289","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020574937,0.004295964,0.054496318,0.0011333701,0.0051214388,0.0013159018,0.0007161185,0.0015142951,0.931386],"genre_scores_gemma":[0.0026887204,0.0014822974,0.0978239,0.000877827,0.002015167,0.00013033557,0.0017735718,0.00026011042,0.8929481],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563897,0.00006043802,0.0010710084,0.0012710434,0.0012852768,0.0006732669],"domain_scores_gemma":[0.99397516,0.00022589858,0.0007065581,0.004271463,0.0005233512,0.0002975825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076356274,0.00072531187,0.001064378,0.00094169663,0.00009039025,0.00024181366,0.004367876,0.0005807397,0.000049213275],"category_scores_gemma":[0.00032211872,0.00070656446,0.00019948918,0.0004899656,0.000120521,0.0007699114,0.0010300331,0.0007347461,0.0006113731],"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.00001814709,0.00006304256,0.0000290046,0.00028604106,0.000087887536,0.00024447305,0.00006539329,0.0002565052,0.00004046012,0.32829702,0.6297417,0.040870328],"study_design_scores_gemma":[0.00025182383,0.00022876952,0.000018627867,0.00090888224,0.000040558873,0.000023217,0.0000068335403,0.0010761739,0.0000539834,0.0014580329,0.99517065,0.00076243724],"about_ca_topic_score_codex":0.00011258127,"about_ca_topic_score_gemma":0.00004163578,"teacher_disagreement_score":0.36542895,"about_ca_system_score_codex":0.00016912835,"about_ca_system_score_gemma":0.0005667774,"threshold_uncertainty_score":0.99953854},"labels":[],"label_agreement":null},{"id":"W2735521671","doi":"10.1109/icdcs.2017.203","title":"MultiPub: Latency and Cost-Aware Global-Scale Cloud Publish/Subscribe","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cloud computing; Latency (audio); Publication; Scale (ratio); Distributed computing; Computer network; Operating system; Telecommunications; Business","score_opus":0.023429922595281476,"score_gpt":0.2784903053281928,"score_spread":0.2550603827329113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735521671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16175267,0.0003402175,0.6612218,0.0783067,0.00354675,0.0011046751,0.000038843802,0.004564941,0.08912337],"genre_scores_gemma":[0.9177375,0.000030117122,0.07883896,0.0009057755,0.000104347186,0.00003796183,0.0000022033985,0.0000099082645,0.0023332655],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982103,0.00002247671,0.00021079123,0.000673627,0.00031440274,0.0005683817],"domain_scores_gemma":[0.9972842,0.00003771441,0.000110794084,0.0021855682,0.00015861851,0.0002231456],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028521477,0.00021461092,0.00023071044,0.00006908377,0.000499589,0.001757241,0.0036668582,0.00017460543,0.00001577721],"category_scores_gemma":[0.0002458189,0.0001841058,0.000048321297,0.00025052836,0.0001845589,0.0015889073,0.0029650123,0.00017979648,0.0001453875],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078737985,0.00007375547,0.102409706,0.000013353317,0.000028746317,0.00006811555,0.00020054697,0.000026097854,0.000074821575,0.055647556,0.24779236,0.5936571],"study_design_scores_gemma":[0.0019904012,0.0002941596,0.6552496,0.00010077245,0.000023407685,0.00017196726,0.00022772947,0.053542413,0.003066634,0.062293883,0.22136012,0.0016789046],"about_ca_topic_score_codex":0.00037781248,"about_ca_topic_score_gemma":0.00074008456,"teacher_disagreement_score":0.7559848,"about_ca_system_score_codex":0.00006832052,"about_ca_system_score_gemma":0.000045198634,"threshold_uncertainty_score":0.999279},"labels":[],"label_agreement":null},{"id":"W2748475863","doi":"10.22215/etd/2012-09785","title":"Message processing on XML-based publish/subscribe systems","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"XML; Computer science; World Wide Web","score_opus":0.021928721000234172,"score_gpt":0.26393009586148397,"score_spread":0.24200137486124979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748475863","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0214998,0.005316452,0.3430393,0.0048974403,0.016109215,0.0031085028,0.000024336694,0.01559554,0.5904094],"genre_scores_gemma":[0.9262292,0.0000052362375,0.021794574,0.00062884303,0.00035010886,0.0004507632,0.00030743887,0.000091739654,0.050142117],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99664176,0.00006774829,0.000490027,0.00094606157,0.0010235173,0.0008309178],"domain_scores_gemma":[0.9974829,0.00010341987,0.00035136688,0.0014915463,0.0003680028,0.0002027795],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000571684,0.0005336828,0.0005225017,0.0007437635,0.0002085077,0.0016171059,0.0033457356,0.00066165143,0.00002513289],"category_scores_gemma":[0.0001721888,0.0004588907,0.00011548003,0.0012264331,0.000025963334,0.00080787414,0.00017487032,0.00064173917,0.00034311935],"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.000079773075,0.00054167624,0.00037986357,0.0017092469,0.000107682,0.00008956839,0.0015320104,0.0023444255,0.0010732531,0.14555025,0.38492802,0.46166423],"study_design_scores_gemma":[0.0029415584,0.0015999489,0.01997459,0.01079667,0.0003549196,0.00006442853,0.0043592765,0.25568402,0.047884665,0.0057055904,0.638643,0.011991329],"about_ca_topic_score_codex":0.000091577866,"about_ca_topic_score_gemma":0.000153142,"teacher_disagreement_score":0.90472937,"about_ca_system_score_codex":0.00020313759,"about_ca_system_score_gemma":0.00030341683,"threshold_uncertainty_score":0.99978626},"labels":[],"label_agreement":null},{"id":"W2750131292","doi":"","title":"Scalable and reliable searching in unstructured peer-to-peer systems","year":2009,"lang":"en","type":"dissertation","venue":"TSpace","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Computer science; Distributed computing; Peer-to-peer; File sharing; The Internet; Network topology; Population; Process (computing); Computer network; World Wide Web; Database","score_opus":0.014506123354573408,"score_gpt":0.3090631992548352,"score_spread":0.2945570759002618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750131292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8774458,0.0038255204,0.023709195,0.030063557,0.004995337,0.0034524438,0.000015967487,0.003127805,0.053364385],"genre_scores_gemma":[0.584578,0.00009301633,0.1303255,0.00054675306,0.00028694345,0.00019456854,0.00016778891,0.00012354631,0.28368393],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964292,0.0000721046,0.0003879932,0.0010631498,0.0011981551,0.0008493635],"domain_scores_gemma":[0.99796367,0.0000917918,0.0001523823,0.0011629438,0.0003919753,0.00023723044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094187475,0.000448294,0.0006114155,0.0009066012,0.0001576047,0.00072700606,0.0017711691,0.00049753825,0.0000042781603],"category_scores_gemma":[0.00045842436,0.00045273895,0.00005126501,0.0016902068,0.000025427193,0.0002798343,0.00034765337,0.0008768826,0.00008786021],"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.00026918907,0.00018832444,0.0022474425,0.0011922512,0.00015796612,0.0006312381,0.050901994,0.05682315,0.008774387,0.05108691,0.55436677,0.2733604],"study_design_scores_gemma":[0.0035151462,0.0018050964,0.09461686,0.008449117,0.00012655051,0.00032808134,0.022061119,0.14680728,0.018433118,0.028876256,0.66678244,0.008198933],"about_ca_topic_score_codex":0.0017288118,"about_ca_topic_score_gemma":0.0011206246,"teacher_disagreement_score":0.2928678,"about_ca_system_score_codex":0.00023586511,"about_ca_system_score_gemma":0.00018096637,"threshold_uncertainty_score":0.99979246},"labels":[],"label_agreement":null},{"id":"W2761567824","doi":"10.1007/978-3-319-68066-8_9","title":"Pooling Supply and Demand: Collaboration for Community Broadcasts","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Wilfrid Laurier University; Institut National de la Recherche Scientifique","funders":"","keywords":"Pooling; Computer science; Payment; Video on demand; Key (lock); Supply and demand; Service (business); On demand; Telecommunications; Computer network; Computer security; World Wide Web; Microeconomics; Business; Marketing; Multimedia","score_opus":0.023642370706166434,"score_gpt":0.27812709588254025,"score_spread":0.2544847251763738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761567824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009901054,0.0004988389,0.9923654,0.0031509814,0.0012220859,0.0008391665,0.000018523519,0.00032084872,0.00059402594],"genre_scores_gemma":[0.2928356,0.000053680185,0.7053972,0.0011009317,0.00027296037,0.0000352939,0.00000850521,0.000030629784,0.00026525365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972132,0.0000474015,0.0003961503,0.0010788321,0.0005828118,0.0006816433],"domain_scores_gemma":[0.99592745,0.000825085,0.00032774013,0.0023172318,0.00043810936,0.00016439095],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017080075,0.00047228753,0.00054229074,0.00075113657,0.001169127,0.0015317108,0.00511397,0.0004060733,0.0000012278251],"category_scores_gemma":[0.0005307832,0.00045933775,0.00006681441,0.00031658742,0.00075014425,0.0008242067,0.0031032318,0.0009056973,0.000008329142],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011808067,0.000018736895,0.000094369454,0.000056235385,0.000012411869,0.000020054335,0.0020688693,0.010867046,0.00024488574,0.014047748,0.00023739178,0.97232044],"study_design_scores_gemma":[0.0006696957,0.00070283166,0.00066305726,0.0009256117,0.000019326808,0.00010960836,0.0000020016998,0.43905038,0.0037460548,0.54006433,0.01271716,0.0013299446],"about_ca_topic_score_codex":0.000046954483,"about_ca_topic_score_gemma":0.00071640685,"teacher_disagreement_score":0.9709905,"about_ca_system_score_codex":0.00023400925,"about_ca_system_score_gemma":0.00040598665,"threshold_uncertainty_score":0.99978584},"labels":[],"label_agreement":null},{"id":"W2762228355","doi":"10.1109/fas-w.2017.184","title":"Pando: A Volunteer Computing Platform for the Web","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Testbed; JavaScript; Scripting language; The Internet; Operating system; Tree (set theory); Compiler; Web application; Server; Overlay; Physical computing; World Wide Web; Distributed computing; Human–computer interaction","score_opus":0.043585797613486736,"score_gpt":0.2967018562349952,"score_spread":0.25311605862150843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762228355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016040957,0.000058577396,0.9538222,0.021105023,0.00072569924,0.0004120992,0.0000018559186,0.000771032,0.0070625716],"genre_scores_gemma":[0.86212254,0.0000047474164,0.13480112,0.0007623872,0.0001207611,0.000027389657,2.6062187e-7,0.00000704862,0.0021537389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990007,0.0000038089624,0.00014073554,0.0002927845,0.00018129293,0.00038064487],"domain_scores_gemma":[0.997812,0.0003255748,0.000092325,0.0016457508,0.0000803194,0.000044067652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004400647,0.000116484065,0.00013019145,0.00004548584,0.0009090776,0.00072550576,0.0040649837,0.00006003797,0.0000042774013],"category_scores_gemma":[0.00030126775,0.00007038969,0.00006897149,0.000091834525,0.00008118456,0.00033816154,0.001621148,0.000114996765,0.00006589546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008581687,0.000019793188,0.0022627092,0.000006704143,0.00004056122,0.0000046855585,0.00035645175,0.0002871882,0.0001931442,0.19398984,0.14426759,0.6585627],"study_design_scores_gemma":[0.00042954274,0.000071772345,0.007130443,0.00001864251,0.0000057346283,0.000011170653,0.0000553936,0.8014714,0.0009810323,0.00907044,0.18055251,0.00020191788],"about_ca_topic_score_codex":0.000045892994,"about_ca_topic_score_gemma":0.00014492607,"teacher_disagreement_score":0.8460816,"about_ca_system_score_codex":0.000025843272,"about_ca_system_score_gemma":0.000034347162,"threshold_uncertainty_score":0.7553819},"labels":[],"label_agreement":null},{"id":"W2764080815","doi":"10.1145/3135932.3135939","title":"SmartJS: dynamic and self-adaptable runtime middleware for next-generation IoT systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Middleware (distributed applications); Debugging; JavaScript; Internet of Things; Distributed computing; Fuzz testing; Scheduling (production processes); Java; Embedded system; Software engineering; Operating system; World Wide Web; Software","score_opus":0.05595524891180741,"score_gpt":0.2673357647394561,"score_spread":0.21138051582764866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764080815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1796427,0.0007519891,0.8087012,0.0051139183,0.0013932606,0.0010725987,0.000009056057,0.0016802311,0.0016350149],"genre_scores_gemma":[0.7984832,0.000015590134,0.19799332,0.00011716589,0.000091121176,0.00011527325,0.0000029820073,0.000012066046,0.0031692886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876773,0.000016793776,0.00019016191,0.00048940006,0.00017861745,0.00035729897],"domain_scores_gemma":[0.9983971,0.000048052883,0.00011454391,0.0012412673,0.000120223536,0.00007881687],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000317485,0.00016101595,0.00020088574,0.000098563534,0.0006194749,0.0015221426,0.0013483411,0.00011729298,0.0000015846709],"category_scores_gemma":[0.000088545225,0.00014249682,0.000033970602,0.00009571971,0.000035985737,0.00047327185,0.00061771565,0.00006985923,0.000031488176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032345364,0.00047556922,0.005316796,0.0004979016,0.0003786898,0.00005005636,0.0016283958,0.010716267,0.04128797,0.43261352,0.15301767,0.3539848],"study_design_scores_gemma":[0.000243,0.00011180336,0.0009490481,0.000024710575,0.000008374089,0.000012796974,0.000036289817,0.9808686,0.0009242253,0.0008571268,0.01573906,0.00022497983],"about_ca_topic_score_codex":0.0001496473,"about_ca_topic_score_gemma":0.0002728266,"teacher_disagreement_score":0.9701523,"about_ca_system_score_codex":0.00006678032,"about_ca_system_score_gemma":0.000041188738,"threshold_uncertainty_score":0.9995144},"labels":[],"label_agreement":null},{"id":"W2770230939","doi":"10.1109/tnet.2017.2765246","title":"Toward Cloud-Based Distributed Interactive Applications: Measurement, Modeling, and Analysis","year":2017,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of Minnesota; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Mississippi","keywords":"Computer science; Cloud computing; Bottleneck; Software deployment; The Internet; Latency (audio); Distributed computing; Virtual machine; Computer network; Operating system; Embedded system; Telecommunications","score_opus":0.07414595958929883,"score_gpt":0.29384931291472166,"score_spread":0.21970335332542285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770230939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016722352,0.00015593255,0.99315053,0.0030518644,0.00066765974,0.00046182267,0.000027702752,0.00067110383,0.0001411492],"genre_scores_gemma":[0.9481429,0.000060208306,0.05103605,0.00022064548,0.00016024472,0.0003385295,0.000007333006,0.000019041585,0.000015045554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770826,0.000068061636,0.00036400047,0.00084096426,0.000527177,0.00049155334],"domain_scores_gemma":[0.9966477,0.00013936347,0.00023189685,0.0025507917,0.00026416912,0.00016608441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052754616,0.00030137916,0.00037326335,0.00044576693,0.0011393575,0.0007320803,0.0023787592,0.00014979808,0.000004171789],"category_scores_gemma":[0.00005078087,0.00031223838,0.00019800846,0.0010440382,0.00009931134,0.000442082,0.000069326146,0.000445272,0.000016504477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040483268,0.00013322839,0.00044554716,0.000011835086,0.00054730516,0.000007952409,0.00016391308,0.7042667,0.00009488076,0.00028102112,0.00019296272,0.29381415],"study_design_scores_gemma":[0.00036866695,0.000071417555,0.00041772594,0.000093877774,0.00026345256,0.0000035916685,0.00003179545,0.9901581,0.00086744316,0.0034612517,0.0038707848,0.00039190584],"about_ca_topic_score_codex":0.000101008285,"about_ca_topic_score_gemma":0.00026096887,"teacher_disagreement_score":0.9464707,"about_ca_system_score_codex":0.00024883717,"about_ca_system_score_gemma":0.00006426708,"threshold_uncertainty_score":0.99993294},"labels":[],"label_agreement":null},{"id":"W2773178888","doi":"10.1109/iemcon.2017.8117159","title":"Evaluating chord over a hierarchical MANET","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Overlay network; Chord (peer-to-peer); Bottleneck; Scalability; Distributed computing; Flooding (psychology); Overlay; Routing protocol; Latency (audio); Wireless ad hoc network; Optimized Link State Routing Protocol; Pastry; Routing (electronic design automation); Network packet; Wireless; The Internet; Embedded system","score_opus":0.07909728729509258,"score_gpt":0.38846004954334173,"score_spread":0.30936276224824916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773178888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51249766,0.000037968355,0.40754396,0.025598403,0.00071332394,0.00032585056,0.000001336108,0.0017593054,0.051522188],"genre_scores_gemma":[0.61580265,0.0000016502864,0.3810453,0.00070563174,0.00008027507,0.000018440174,3.4181076e-7,0.0000059485374,0.0023397335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986363,0.000026501482,0.00014436657,0.0004263688,0.00039439843,0.00037203828],"domain_scores_gemma":[0.9977285,0.00007451396,0.00006807149,0.0019961935,0.00004084658,0.0000918495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047613386,0.000116124575,0.00013188325,0.00008099557,0.0003555201,0.00073254475,0.0033788846,0.0000763112,0.000049495822],"category_scores_gemma":[0.000452895,0.00009668588,0.00003955871,0.00010940999,0.00008064077,0.0004004573,0.002260298,0.00019762178,0.00028267803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006113376,0.00003278473,0.003846513,0.000004746763,0.00001624018,0.000041549796,0.00013443541,0.0001186937,0.0017065007,0.25625962,0.024562625,0.7132702],"study_design_scores_gemma":[0.0009809071,0.00055798964,0.2383123,0.00007092189,0.000010387256,0.00005492102,0.00001210541,0.5285346,0.0048386757,0.13695396,0.08878765,0.0008855574],"about_ca_topic_score_codex":0.00006185651,"about_ca_topic_score_gemma":0.00003547785,"teacher_disagreement_score":0.71238464,"about_ca_system_score_codex":0.000029717507,"about_ca_system_score_gemma":0.000035354056,"threshold_uncertainty_score":0.7063946},"labels":[],"label_agreement":null},{"id":"W2783098627","doi":"10.1109/access.2018.2794258","title":"A Cloud-Based Architecture for Multimedia Conferencing Service Provisioning","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Waterloo; Concordia University","funders":"Canada Research Chairs","keywords":"Provisioning; Computer science; Cloud computing; Multimedia; Scalability; Service (business); Service layer; Computer network; Videoconferencing; Quality of service; Operating system","score_opus":0.04376203110187445,"score_gpt":0.3224889984637149,"score_spread":0.2787269673618405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783098627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15185201,0.0000151748945,0.83964485,0.0056006256,0.0011587931,0.0005823729,0.0000062906233,0.00093048514,0.00020939742],"genre_scores_gemma":[0.76154524,2.577276e-7,0.23473221,0.0030594352,0.00047859183,0.00013380627,0.000002189261,0.000017165781,0.000031094503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983511,0.00003095443,0.00022411298,0.00058991817,0.00027982646,0.00052411377],"domain_scores_gemma":[0.9981457,0.0003144137,0.00011120416,0.0008973802,0.00041634732,0.00011495008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002832833,0.00020540405,0.0002132399,0.00022277163,0.00022917544,0.00048264232,0.0034676536,0.00012865153,0.000005513747],"category_scores_gemma":[0.00022143532,0.00017944354,0.000051951487,0.00092308305,0.0000623399,0.00037802936,0.00054282305,0.0001896983,0.00005596073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020969404,0.00016359048,0.0021735053,0.0002487998,0.00007889657,0.000031620988,0.004960357,0.01597374,0.018369777,0.0033078215,0.038858328,0.91562384],"study_design_scores_gemma":[0.0010490362,0.00043538422,0.0012968841,0.00022699953,0.000013940916,0.00000819251,0.000034829744,0.7520826,0.21692991,0.009242887,0.018076302,0.00060302543],"about_ca_topic_score_codex":0.00010202171,"about_ca_topic_score_gemma":0.00059961865,"teacher_disagreement_score":0.9150208,"about_ca_system_score_codex":0.000049061215,"about_ca_system_score_gemma":0.0001681024,"threshold_uncertainty_score":0.7317495},"labels":[],"label_agreement":null},{"id":"W2785408970","doi":"","title":"Pando: An Easy-to-Deploy P2P Volunteer Computing Platform for the Web","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","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":"McGill University","funders":"","keywords":"Computer science; Web application; World Wide Web; Operating system","score_opus":0.03128449417493142,"score_gpt":0.26732618882078296,"score_spread":0.23604169464585154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785408970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027117612,0.0005548683,0.92165947,0.041000675,0.0010458707,0.0016917469,0.000057284593,0.0022665954,0.004605875],"genre_scores_gemma":[0.6256,0.0001325407,0.3692111,0.0005312813,0.00010212332,0.0002818618,0.00006363162,0.00009228414,0.003985226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951685,0.0010517559,0.0006575328,0.0015314977,0.0007265135,0.00086420414],"domain_scores_gemma":[0.98497707,0.0027117094,0.00070051476,0.008763136,0.0025139423,0.0003336587],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0087152915,0.0005483552,0.0005742695,0.00033371785,0.0015392691,0.0025680137,0.013221895,0.00041948294,0.000009288708],"category_scores_gemma":[0.0036600023,0.00047771094,0.00029730937,0.0004942444,0.00027766754,0.0004216862,0.010788751,0.000985769,0.00009885316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031749805,0.00046393432,0.001874897,0.00014314403,0.00021240339,0.0000096399945,0.014001802,0.0029287054,0.0011165867,0.1874391,0.024976084,0.76680195],"study_design_scores_gemma":[0.0007751768,0.0000035278958,0.0050930837,0.001693707,0.000058431804,0.00002013258,0.00012625779,0.77044374,0.009736201,0.019768192,0.19115482,0.001126747],"about_ca_topic_score_codex":0.0007077102,"about_ca_topic_score_gemma":0.0029994966,"teacher_disagreement_score":0.767515,"about_ca_system_score_codex":0.00020677104,"about_ca_system_score_gemma":0.00043635652,"threshold_uncertainty_score":0.9997675},"labels":[],"label_agreement":null},{"id":"W2785685025","doi":"10.1109/ithings-greencom-cpscom-smartdata.2017.37","title":"Efficient Routing in Mobile Ad-Hoc Social Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Routing protocol; Joins; Wireless ad hoc network; Routing (electronic design automation); Telecommunications; Network packet","score_opus":0.01799442007886968,"score_gpt":0.2753683336193386,"score_spread":0.2573739135404689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785685025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44448876,0.00032167236,0.5357279,0.004706701,0.0009539417,0.00044662243,6.6531703e-7,0.0013278405,0.012025877],"genre_scores_gemma":[0.97298366,0.000009146211,0.026197646,0.00024175941,0.000092420385,0.000048946615,2.932706e-7,0.000008704362,0.0004174362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985308,0.000024522426,0.00021183267,0.0004440525,0.00023127609,0.00055749074],"domain_scores_gemma":[0.9987281,0.00005318247,0.0001066284,0.0010151688,0.00004147235,0.000055464458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047988893,0.00014036987,0.00018763111,0.000103637685,0.0004854164,0.00044073278,0.0027354248,0.0001297068,0.000007645914],"category_scores_gemma":[0.00009108808,0.00012953342,0.000052321924,0.00026734927,0.00008000586,0.00013674478,0.0020082826,0.00024385541,0.000075408985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006356556,0.00008130558,0.002947848,0.0000028757245,0.000008081806,0.000047816666,0.0008888355,0.055390615,0.000072434785,0.032154635,0.00609784,0.9023014],"study_design_scores_gemma":[0.00033826014,0.00007711499,0.03225992,0.000026760816,0.0000017678843,0.000003995833,0.00010971866,0.95811176,0.00018844791,0.00093501946,0.007622731,0.00032447802],"about_ca_topic_score_codex":0.000022968024,"about_ca_topic_score_gemma":0.00015158825,"teacher_disagreement_score":0.90272117,"about_ca_system_score_codex":0.00009184089,"about_ca_system_score_gemma":0.000028926042,"threshold_uncertainty_score":0.52822196},"labels":[],"label_agreement":null},{"id":"W2787679999","doi":"10.1109/nsyss2.2017.8267785","title":"Availability in P2P based online social networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Replication (statistics); Protocol (science); Overhead (engineering); Cloud computing; Distributed computing; Computer network; Exploit; Duration (music); Computer security; Operating system","score_opus":0.03490923364069245,"score_gpt":0.29767653536819627,"score_spread":0.26276730172750384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787679999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18622997,0.000029063027,0.75787437,0.045838065,0.0006373547,0.00032360305,0.000004172233,0.0012362188,0.007827193],"genre_scores_gemma":[0.906897,0.0000013753755,0.09153574,0.0010391757,0.000111155336,0.000013419761,0.0000019238407,0.0000060157945,0.00039416458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863803,0.000039366227,0.00021724652,0.00047129835,0.00020978486,0.00042429628],"domain_scores_gemma":[0.9981559,0.00007640511,0.000086163935,0.0015623607,0.000059507336,0.000059662427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004971055,0.00013636163,0.00019804516,0.0000923287,0.00028248952,0.00028580142,0.003167791,0.00014944216,0.000027782824],"category_scores_gemma":[0.00027117095,0.000124388,0.000053292228,0.00024750564,0.00013082851,0.00033530686,0.0011793106,0.00026139326,0.000052240674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032048025,0.00058052095,0.14042197,0.000014591414,0.000015916712,0.00008619557,0.00021333159,0.0066456185,0.00013077646,0.039922517,0.07418839,0.73774815],"study_design_scores_gemma":[0.00039895362,0.000049554583,0.4291826,0.000012134976,0.0000014973291,8.806402e-7,0.000010559475,0.5588751,0.00019184555,0.0043309075,0.006689381,0.00025662748],"about_ca_topic_score_codex":0.0001852861,"about_ca_topic_score_gemma":0.0018311944,"teacher_disagreement_score":0.7374915,"about_ca_system_score_codex":0.000083589875,"about_ca_system_score_gemma":0.000060513783,"threshold_uncertainty_score":0.58865964},"labels":[],"label_agreement":null},{"id":"W2795655069","doi":"10.1145/3310273.3322819","title":"Personal volunteer computing","year":2019,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Laptop; Leverage (statistics); Rendering (computer graphics); Personal computer; Personal information manager; Animation","score_opus":0.008060177019453095,"score_gpt":0.2233593359717596,"score_spread":0.2152991589523065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795655069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32245263,0.00003663434,0.63323694,0.0056848307,0.0006064342,0.00015115985,3.6150368e-7,0.001524754,0.036306217],"genre_scores_gemma":[0.83675456,3.7835122e-7,0.155527,0.0012790957,0.00003934345,0.0000014191563,3.231979e-7,0.000005080284,0.0063928324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896336,0.0000115684015,0.00010930188,0.00034783105,0.00024597102,0.00032199651],"domain_scores_gemma":[0.9993416,0.000059519134,0.000025241317,0.00046756733,0.00005123367,0.000054841672],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017249917,0.00009811178,0.00011367726,0.000097138436,0.000046487246,0.00011429562,0.0011508508,0.00005246359,0.0000763392],"category_scores_gemma":[0.000023845101,0.0000848022,0.00004010163,0.00042751787,0.000017547525,0.0001947481,0.0008416644,0.00012471543,0.0025446576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059666027,0.00008216915,0.06270745,0.00002059373,0.000047327532,0.000033862445,0.0028196746,0.0012939046,0.003474411,0.3084045,0.20663014,0.41448],"study_design_scores_gemma":[0.0003225074,0.00016819738,0.026096784,0.000032587835,0.0000021344758,0.000041731066,0.00018218579,0.8729263,0.002178943,0.0025142988,0.09504295,0.00049137854],"about_ca_topic_score_codex":0.000019761173,"about_ca_topic_score_gemma":0.0000049571045,"teacher_disagreement_score":0.8716324,"about_ca_system_score_codex":0.00003474796,"about_ca_system_score_gemma":0.000022811231,"threshold_uncertainty_score":0.99823195},"labels":[],"label_agreement":null},{"id":"W2798214842","doi":"10.1145/3175684.3175726","title":"Handling Large-Scale Data using Two-Tier Hierarchical Super-Peer P2P Network","year":2017,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ivey Foundation","funders":"","keywords":"Cluster analysis; Computer science; Scalability; Distributed computing; Node (physics); Hierarchical clustering; Data mining; Distributed database; Peer-to-peer; Computer network; Database; Artificial intelligence; Engineering","score_opus":0.08199958649755658,"score_gpt":0.3445624484471979,"score_spread":0.26256286194964135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798214842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044347234,0.00015741613,0.9353215,0.011429302,0.0014811872,0.00024448143,0.000019056668,0.0010196577,0.0059801643],"genre_scores_gemma":[0.37564048,0.000007781656,0.6208572,0.00092088187,0.0007016887,0.000007359004,0.000016165637,0.000025880543,0.0018225731],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646103,0.00006452127,0.00035829688,0.001182199,0.00073359587,0.0012003422],"domain_scores_gemma":[0.9921657,0.00013115769,0.000121018085,0.0071827983,0.0001591156,0.00024020197],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0015656787,0.0002973463,0.00037754042,0.00012236711,0.0013348926,0.0014666573,0.010632641,0.00018418032,0.000042219355],"category_scores_gemma":[0.0004676317,0.000261582,0.00007284073,0.00035846123,0.00019258507,0.0016617607,0.013170364,0.00051775714,0.00015265957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006669464,0.00041791194,0.08384289,0.000039611343,0.00026462413,0.00043640024,0.0016266248,0.029811095,0.0017561368,0.14734875,0.45749545,0.2768938],"study_design_scores_gemma":[0.0005252888,0.000041025505,0.0027290264,0.00006228391,0.000015508649,0.00003436909,0.000027063508,0.8591687,0.00043280947,0.009282247,0.12717718,0.0005044839],"about_ca_topic_score_codex":0.00015756459,"about_ca_topic_score_gemma":0.0005233933,"teacher_disagreement_score":0.8293576,"about_ca_system_score_codex":0.000059467708,"about_ca_system_score_gemma":0.00011416509,"threshold_uncertainty_score":0.99998367},"labels":[],"label_agreement":null},{"id":"W2804525671","doi":"","title":"Friendships that Last: Peer Lifespan and its Role in P2P Protocols.","year":2003,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Computer science; Protocol (science); Peer-to-peer; TRACE (psycholinguistics); Distributed computing; Key (lock); Computer security","score_opus":0.03363539154351594,"score_gpt":0.2736808110874723,"score_spread":0.24004541954395633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804525671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5717002,0.0007003987,0.1264043,0.04304555,0.0006924217,0.03744131,0.0000075154408,0.0058648167,0.21414346],"genre_scores_gemma":[0.95073414,0.000002644598,0.042970546,0.0005372845,0.00001688454,0.0030980413,3.7052087e-7,0.000012031079,0.0026280652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984184,0.00006484914,0.00017196655,0.00049868156,0.0003823917,0.00046372687],"domain_scores_gemma":[0.9991257,0.00006868489,0.00004047127,0.00057834905,0.00007154289,0.000115218965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005666144,0.00016998318,0.00018213695,0.00021694315,0.00006436815,0.0002001664,0.00090761855,0.000121098,0.000020981646],"category_scores_gemma":[0.00030880445,0.00014632303,0.000023158227,0.00074161054,0.000029593411,0.0004441797,0.00049432484,0.0002232124,0.00010786402],"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.000015902824,0.0002426343,0.111918435,0.00003838588,0.000019711219,0.00010060521,0.0022331108,0.0002605116,0.001170568,0.80508775,0.021977361,0.05693505],"study_design_scores_gemma":[0.0019745382,0.000607085,0.06868211,0.00017973944,0.000005365032,0.00013901391,0.0007942631,0.0217422,0.10651444,0.06610683,0.7317568,0.0014976177],"about_ca_topic_score_codex":0.00001014564,"about_ca_topic_score_gemma":0.00019716455,"teacher_disagreement_score":0.7389809,"about_ca_system_score_codex":0.000037090824,"about_ca_system_score_gemma":0.00004844515,"threshold_uncertainty_score":0.596688},"labels":[],"label_agreement":null},{"id":"W280787175","doi":"10.1007/978-3-319-03807-0_4","title":"Collaborative Web Search","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","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":"The Internet; World Wide Web; Globe; Business; Internet privacy; Computer science; Biology","score_opus":0.016464717134484736,"score_gpt":0.2504473968834876,"score_spread":0.23398267974900286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W280787175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011547072,0.00046926597,0.70004195,0.004506202,0.0036562001,0.001692619,0.000014184011,0.0016943193,0.28677058],"genre_scores_gemma":[0.036817845,0.00022548782,0.90543437,0.0019980585,0.0006625643,0.000113215254,0.0000027464234,0.00010660696,0.054639127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99329066,0.00004077858,0.0007197529,0.0025480445,0.0019761669,0.0014246141],"domain_scores_gemma":[0.9951063,0.00022105162,0.00023583898,0.0031573814,0.0008489599,0.0004305168],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.001611491,0.0007251138,0.00075924,0.0020277225,0.00033470636,0.0014312187,0.010672297,0.00041026337,0.000083351224],"category_scores_gemma":[0.00008345177,0.0007371368,0.00011633827,0.0024192848,0.0013277072,0.0013486949,0.00909123,0.0012172585,0.0018856107],"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.0000032730916,0.000030113373,0.000049970393,0.000025499465,0.000017243958,0.00018634973,0.00056543766,0.0023352345,0.00022323991,0.69030297,0.005618672,0.30064198],"study_design_scores_gemma":[0.0009376583,0.0009445443,0.0021619946,0.0015192446,0.000014377313,0.0001321598,0.000014221756,0.48138595,0.0035689082,0.10293349,0.40202162,0.004365862],"about_ca_topic_score_codex":0.00003911557,"about_ca_topic_score_gemma":0.000060703813,"teacher_disagreement_score":0.5873695,"about_ca_system_score_codex":0.0007664319,"about_ca_system_score_gemma":0.0016364175,"threshold_uncertainty_score":0.9996054},"labels":[],"label_agreement":null},{"id":"W2808102956","doi":"10.1109/tpds.2018.2846242","title":"Tsumiki: A Meta-Platform for Building Your Own Testbed","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Testbed; Computer science; Android (operating system); Interface (matter); Distributed computing; Embedded system; Set (abstract data type); Software; User interface; Computer architecture; Operating system; Computer network","score_opus":0.07174632797770371,"score_gpt":0.2940575395024576,"score_spread":0.22231121152475392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808102956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068684355,0.0002477687,0.98871875,0.0010108134,0.0010109126,0.0007927871,0.00038445526,0.0008686889,0.0000974197],"genre_scores_gemma":[0.9656254,0.000015043747,0.03307572,0.00011667328,0.00009727763,0.0006362889,0.000010741096,0.000017320888,0.00040552183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806625,0.000034479555,0.00042299065,0.00063140853,0.00028715108,0.000557714],"domain_scores_gemma":[0.9985175,0.00021242847,0.00011934753,0.0007283817,0.0002200777,0.00020222632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003639156,0.00031069812,0.00049165153,0.00022253928,0.0005120869,0.00034010227,0.0007542133,0.0001915913,0.000005347624],"category_scores_gemma":[0.00002478897,0.00025063608,0.00018133837,0.0007003673,0.000105323285,0.00039386706,0.0000113813485,0.00018139878,0.00004379007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009386478,0.0016643384,0.00014515407,0.0006266426,0.007188435,0.00010059911,0.0024363522,0.6528215,0.016594438,0.096335754,0.09613133,0.12501684],"study_design_scores_gemma":[0.0033781796,0.0024593824,0.00021502574,0.00019564296,0.0009690396,0.0003326187,0.00058389094,0.82288384,0.009020963,0.006321722,0.15173665,0.0019030262],"about_ca_topic_score_codex":0.00011715501,"about_ca_topic_score_gemma":0.00004588873,"teacher_disagreement_score":0.958757,"about_ca_system_score_codex":0.000082059545,"about_ca_system_score_gemma":0.000046026766,"threshold_uncertainty_score":0.9999946},"labels":[],"label_agreement":null},{"id":"W2809590475","doi":"10.1145/3210284.3210290","title":"Secret Sharing in Pub/Sub Using Trusted Execution Environments","year":2018,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer security; Guard (computer science); Dissemination; Confidentiality; Software; Cryptography; Computer network; Publication; Operating system; Telecommunications","score_opus":0.03001375751853424,"score_gpt":0.2602420621796149,"score_spread":0.23022830466108063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809590475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57938355,0.000009937779,0.41814342,0.00032154328,0.00016362652,0.00011060858,2.6509497e-7,0.00027829595,0.0015887667],"genre_scores_gemma":[0.9156998,0.0000026103244,0.083668284,0.00026181803,0.000046431524,0.000007930542,8.739056e-7,0.000007223918,0.0003050671],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987585,0.000017917393,0.00018590601,0.00045248674,0.00021546871,0.00036974138],"domain_scores_gemma":[0.9992268,0.000015117467,0.00004310412,0.00064862025,0.000011620242,0.000054722757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024457826,0.0001161374,0.000113993956,0.00022508886,0.000073767544,0.000106066116,0.0010401555,0.00009240847,0.000018052971],"category_scores_gemma":[0.000036605907,0.000114592855,0.00002053236,0.000649199,0.000057858295,0.00047877798,0.0010805521,0.00010937933,0.00014020932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048377256,0.00034953127,0.10705253,0.000024186686,0.00006821422,0.00015298811,0.0031872473,0.006691539,0.418742,0.11181359,0.006506824,0.345363],"study_design_scores_gemma":[0.0005000254,0.00016032801,0.045143053,0.00006810363,0.0000044762087,0.000026609227,0.000086925014,0.8058913,0.13107677,0.009955019,0.0065698405,0.0005175987],"about_ca_topic_score_codex":0.00007392173,"about_ca_topic_score_gemma":0.00007216741,"teacher_disagreement_score":0.7991997,"about_ca_system_score_codex":0.00018308708,"about_ca_system_score_gemma":0.000013177862,"threshold_uncertainty_score":0.4672961},"labels":[],"label_agreement":null},{"id":"W2818306811","doi":"10.1109/infcomw.2018.8406822","title":"“What's the score?”: A first look at sports live data feed services","year":2018,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Computer science","score_opus":0.029416203645277233,"score_gpt":0.2531102773428958,"score_spread":0.2236940736976186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2818306811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7481647,0.0016328068,0.074356094,0.13620585,0.007723247,0.0018219367,0.000019354522,0.0066804546,0.023395546],"genre_scores_gemma":[0.947888,0.0001325021,0.03975211,0.0062143942,0.0003563117,0.000026828578,0.000015798136,0.00001954552,0.005594498],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800104,0.000022095579,0.00021396144,0.000803582,0.0004847797,0.0004745408],"domain_scores_gemma":[0.9950285,0.00011933781,0.00009432822,0.0045499373,0.00011769103,0.00009018595],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.00045786033,0.00019696495,0.0001664653,0.00008283561,0.00039520397,0.00070158445,0.0082509825,0.00009181888,0.00011810584],"category_scores_gemma":[0.00003349676,0.0001246108,0.000031273903,0.00066296983,0.0002143219,0.0017642673,0.01049366,0.00012762456,0.0013430483],"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.000048473838,0.00017774088,0.026299238,0.000068777495,0.00013498156,0.00020058299,0.010263889,0.0001056421,0.0001868286,0.02194524,0.75762093,0.18294768],"study_design_scores_gemma":[0.00059435563,0.00047257243,0.06468016,0.0004892744,0.000046107056,0.00022065127,0.0025474257,0.1465526,0.0037371824,0.017397575,0.7619101,0.00135204],"about_ca_topic_score_codex":0.000239578,"about_ca_topic_score_gemma":0.006129604,"teacher_disagreement_score":0.1997233,"about_ca_system_score_codex":0.000049351816,"about_ca_system_score_gemma":0.000038624472,"threshold_uncertainty_score":0.99943453},"labels":[],"label_agreement":null},{"id":"W2884411660","doi":"10.1049/iet-com.2018.5069","title":"Content pollution propagation in the overlay network of peer‐to‐peer live streaming systems: modelling and analysis","year":2018,"lang":"en","type":"article","venue":"IET Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Overlay; Peer-to-peer; Live streaming; Overlay network; Computer network; Pollution; Distributed computing; Environmental economics; The Internet; World Wide Web","score_opus":0.07574646474468663,"score_gpt":0.29117587941017714,"score_spread":0.2154294146654905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884411660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0875052,0.00055206125,0.8883759,0.022206822,0.00007792001,0.00057764316,0.000011993291,0.00013121332,0.00056127395],"genre_scores_gemma":[0.917577,0.0000393522,0.08200993,0.000166967,0.000029355013,0.00009038754,0.00001321127,0.0000047403782,0.000069048845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856097,0.00024857477,0.0003564826,0.0002317926,0.00038581612,0.00021635681],"domain_scores_gemma":[0.9966274,0.00026958235,0.000161705,0.0022399612,0.0006628919,0.000038484937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013901998,0.000105757084,0.00020203479,0.00023342523,0.00026643116,0.00014325569,0.0020868925,0.00006667492,5.54703e-7],"category_scores_gemma":[0.00020240352,0.00008615958,0.000044120792,0.0022999982,0.0001401625,0.00022425037,0.0007860657,0.00017060344,0.000008040323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014054829,0.00017997886,0.009966477,0.000017270802,0.0002681984,0.0000010798288,0.022269594,0.75722307,0.00039565467,0.19111396,0.00401318,0.014537486],"study_design_scores_gemma":[0.00008624898,0.00008621386,0.016034687,0.00008001422,0.000058130645,0.0000024274614,0.0013050034,0.9788353,0.00004826526,0.0013105948,0.002034694,0.00011845917],"about_ca_topic_score_codex":0.0010732526,"about_ca_topic_score_gemma":0.0011351019,"teacher_disagreement_score":0.8300718,"about_ca_system_score_codex":0.000081579485,"about_ca_system_score_gemma":0.000034727647,"threshold_uncertainty_score":0.38780004},"labels":[],"label_agreement":null},{"id":"W2885294254","doi":"","title":"A Case for Packing and Indexing in Cloud File Systems.","year":2018,"lang":"en","type":"article","venue":"USENIX conference on Hot Topics in Cloud Ccomputing","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":"Vector Institute","funders":"","keywords":"Computer science; Search engine indexing; Cloud computing; Database; Operating system; Distributed computing; World Wide Web","score_opus":0.0742160593850324,"score_gpt":0.30899722350816006,"score_spread":0.23478116412312766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885294254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7987629,0.000078537676,0.19540393,0.0012285872,0.0020363359,0.00077332504,0.000017223581,0.00042940906,0.001269741],"genre_scores_gemma":[0.957277,0.000005509592,0.041590262,0.00024191162,0.0007343414,0.000051829633,0.000002525708,0.000017908953,0.00007869821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975353,0.000101703314,0.0005508505,0.0008330284,0.0002417042,0.0007374257],"domain_scores_gemma":[0.9981979,0.0006588582,0.00017459347,0.00070764445,0.00016182203,0.00009917864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008752619,0.0002809744,0.00040896342,0.0004112948,0.00021653937,0.00043656936,0.00091766793,0.00022792564,0.0000059909835],"category_scores_gemma":[0.00057273,0.00029482192,0.0000399525,0.00074633054,0.00010968946,0.00016160497,0.0008429779,0.00044479116,0.000009676764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053574302,0.000153089,0.012343371,0.00022933274,0.000032327906,0.0017405865,0.010952556,0.0042673596,0.00018286843,0.6162829,0.0040662833,0.34969577],"study_design_scores_gemma":[0.0010565511,0.00044612723,0.001376005,0.001257749,0.000004989553,0.00055878406,0.000915341,0.97017956,0.000606761,0.016028484,0.006807028,0.00076265185],"about_ca_topic_score_codex":0.00027641185,"about_ca_topic_score_gemma":0.00066004565,"teacher_disagreement_score":0.96591216,"about_ca_system_score_codex":0.00016035729,"about_ca_system_score_gemma":0.00009952121,"threshold_uncertainty_score":0.9999504},"labels":[],"label_agreement":null},{"id":"W2889948981","doi":"10.1109/trustcom/bigdatase.2018.00072","title":"A Composite Malicious Peer Eviction Mechanism for Super-P2P Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overlay; Overhead (engineering); Computer network; Computer security; Peer-to-peer; Mechanism (biology); Distributed computing; Network topology; Overlay network; The Internet; World Wide Web; Operating system","score_opus":0.022088337672491982,"score_gpt":0.2641119045649973,"score_spread":0.2420235668925053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889948981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02495236,0.00003399117,0.95912194,0.007885506,0.0017968607,0.0006617788,0.0000056416097,0.0020664416,0.0034754558],"genre_scores_gemma":[0.8410186,0.0000021436776,0.15220171,0.0010633937,0.00029885452,0.00016802501,0.000003460485,0.000017119422,0.0052266936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836975,0.00002894468,0.00024199572,0.0005010061,0.00040086466,0.00045743224],"domain_scores_gemma":[0.9982722,0.00006852274,0.000053227854,0.0008547998,0.0006589534,0.00009230572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040214555,0.0001765269,0.00020749918,0.00019173071,0.00024913377,0.00031545412,0.0012816356,0.00013809635,0.0000061855008],"category_scores_gemma":[0.000067427674,0.00015284015,0.00006406866,0.0004712613,0.00004340528,0.00030919872,0.0004404411,0.00008601713,0.0003315461],"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.000011140427,0.00003724708,0.0000777363,0.000018682673,0.000030452034,0.0000044572457,0.00040461827,0.000087999615,0.012680233,0.9119747,0.06664464,0.008028057],"study_design_scores_gemma":[0.0008367203,0.0015274084,0.00032049022,0.000092187714,0.0000279394,0.00017439536,0.0002479533,0.7520146,0.07749207,0.042597476,0.12380934,0.000859419],"about_ca_topic_score_codex":0.00016133755,"about_ca_topic_score_gemma":0.000074528856,"teacher_disagreement_score":0.86937726,"about_ca_system_score_codex":0.00008959963,"about_ca_system_score_gemma":0.000024904966,"threshold_uncertainty_score":0.6232641},"labels":[],"label_agreement":null},{"id":"W28927243","doi":"","title":"Frontier sets in large terrains","year":2010,"lang":"en","type":"article","venue":"Graphics Interface","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bottleneck; Computer science; Frontier; Synchronization (alternating current); Distributed computing; Latency (audio); Server; Architecture; Space (punctuation); Terrain; Low latency (capital markets); Computer network; Operating system; Telecommunications","score_opus":0.012295954775602738,"score_gpt":0.2747716914586365,"score_spread":0.26247573668303376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28927243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5404031,0.0000997873,0.44782498,0.006723419,0.0017524216,0.00020276103,0.000008435356,0.0006995874,0.002285508],"genre_scores_gemma":[0.94998837,0.0000083822715,0.048964933,0.00070093793,0.000025388841,0.00002289444,0.000001032202,0.000012908692,0.00027513146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984478,0.000030716332,0.00023302324,0.0004981408,0.00024664073,0.0005437122],"domain_scores_gemma":[0.998599,0.00005046881,0.000053414664,0.0011466142,0.00005952475,0.00009097971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049917813,0.00017988995,0.00018644969,0.00046497138,0.00006792563,0.00013396924,0.0022649125,0.00020355843,0.000016595985],"category_scores_gemma":[0.00015166981,0.00017485753,0.000058682526,0.0010690718,0.00008685833,0.00030759734,0.0010540714,0.00087293936,0.0001273502],"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.000028468965,0.00055131206,0.08768949,0.000030953954,0.00007728418,0.00016716926,0.007558005,0.0002806649,0.018191878,0.6649161,0.14415146,0.07635722],"study_design_scores_gemma":[0.0017805829,0.00043190602,0.120735474,0.00018137817,0.000011333928,0.000103854225,0.0003897754,0.11796305,0.03424517,0.18744273,0.5347496,0.0019650855],"about_ca_topic_score_codex":0.000034311317,"about_ca_topic_score_gemma":0.0019267694,"teacher_disagreement_score":0.47747335,"about_ca_system_score_codex":0.000024330388,"about_ca_system_score_gemma":0.000028454191,"threshold_uncertainty_score":0.71304834},"labels":[],"label_agreement":null},{"id":"W2903799792","doi":"10.1109/sec.2018.00037","title":"Poster: Towards a Distributed and Self-Adaptable Cloud-Edge Middleware","year":2018,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cloud computing; JavaScript; Computer science; Middleware (distributed applications); Enhanced Data Rates for GSM Evolution; Edge computing; Internet of Things; Distributed computing; Rich Internet application; Code (set theory); The Internet; World Wide Web; Operating system; Programming language; Artificial intelligence","score_opus":0.016166277377462616,"score_gpt":0.23499936041911837,"score_spread":0.21883308304165575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903799792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22417217,0.0003543187,0.73790985,0.014501501,0.0012574034,0.0004961152,0.00003681758,0.005967348,0.015304442],"genre_scores_gemma":[0.87481475,0.000013693712,0.12319514,0.0008639945,0.000168401,0.000019209714,0.000004702206,0.0000115218,0.000908564],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984581,0.000027325805,0.00019260067,0.00054997683,0.00025060787,0.0005214135],"domain_scores_gemma":[0.9986751,0.00003840805,0.00004444421,0.0009033489,0.00017916992,0.00015954247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021373859,0.000195305,0.00020378252,0.00011062109,0.0001685494,0.0002734635,0.0013022723,0.00012362484,0.000021537133],"category_scores_gemma":[0.00006908469,0.00016488745,0.00003441447,0.0008058653,0.000098081444,0.0003594686,0.0016524453,0.000120517245,0.0001940265],"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.000050112965,0.0005180768,0.009159352,0.00007513752,0.00020628124,0.00015433814,0.0036700023,0.000017258488,0.0015079763,0.13275278,0.50666875,0.34521994],"study_design_scores_gemma":[0.0014532488,0.002164541,0.041202437,0.00011454306,0.00004088003,0.00032374248,0.00026576285,0.055132017,0.04596468,0.02191019,0.8296268,0.001801128],"about_ca_topic_score_codex":0.000095729374,"about_ca_topic_score_gemma":0.00009465093,"teacher_disagreement_score":0.6506426,"about_ca_system_score_codex":0.0000667604,"about_ca_system_score_gemma":0.000065267806,"threshold_uncertainty_score":0.6723915},"labels":[],"label_agreement":null},{"id":"W2906888200","doi":"10.1109/ncg.2018.8593177","title":"Novel Sybil Defense Scheme for Peer–to–peer Applications","year":2018,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Sybil attack; Computer science; Computer network; Scalability; Server; Overlay network; Robustness (evolution); Peer-to-peer; Scheme (mathematics); Computer security; Network address; Distributed computing; Wireless sensor network; The Internet; World Wide Web; Operating system","score_opus":0.036128089347591104,"score_gpt":0.298855991968483,"score_spread":0.2627279026208919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906888200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014365192,0.000010934728,0.9437121,0.043205183,0.000218751,0.00085613,0.000014302771,0.0014885737,0.009057478],"genre_scores_gemma":[0.07859784,4.4204884e-7,0.9018038,0.0032667427,0.00023792706,0.0007632207,0.0000046057266,0.000017119195,0.015308306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981566,0.000005622865,0.00022356395,0.0006412238,0.00046070255,0.000512254],"domain_scores_gemma":[0.99720645,0.00012402027,0.000046659006,0.00143254,0.0010207534,0.00016956538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046277433,0.00017246635,0.00016468223,0.0002016381,0.00021575348,0.00019008256,0.00211661,0.00011437994,0.00001678096],"category_scores_gemma":[0.00037138176,0.00015628959,0.00006608162,0.0010885956,0.00008649396,0.00020927019,0.00090394804,0.000098945406,0.0011456878],"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.000006853567,0.00009551857,0.00009519296,0.0000064919996,0.000020374433,5.37968e-7,0.00022145273,0.00005197539,0.009301283,0.48336223,0.45141706,0.055421036],"study_design_scores_gemma":[0.00024719562,0.00018221975,0.00030413698,0.000007696528,0.000004946616,0.000012101175,0.00003773064,0.01777451,0.015866132,0.009412273,0.95583206,0.0003189978],"about_ca_topic_score_codex":0.000022530583,"about_ca_topic_score_gemma":0.000079098965,"teacher_disagreement_score":0.50441504,"about_ca_system_score_codex":0.000063296175,"about_ca_system_score_gemma":0.0000639843,"threshold_uncertainty_score":0.99963206},"labels":[],"label_agreement":null},{"id":"W2914794313","doi":"","title":"Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Session (web analytics); World Wide Web; Variety (cybernetics); Peer-to-peer; Peer review; Process (computing); Information retrieval; Data science; Political science","score_opus":0.014813660755210076,"score_gpt":0.2492679537877823,"score_spread":0.23445429303257223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914794313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44281778,0.000052096093,0.099235445,0.41138688,0.0010844171,0.0019666115,0.0000046143427,0.001507628,0.04194452],"genre_scores_gemma":[0.91083527,0.000009074118,0.07799402,0.0053317146,0.00015485648,0.00002943389,0.0000016444327,0.000012656239,0.005631357],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99740326,0.000012406957,0.00052469445,0.00033219537,0.0011233441,0.0006041031],"domain_scores_gemma":[0.99818987,0.00013391463,0.00016020719,0.0009123591,0.00049293804,0.000110703135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011737334,0.00021966071,0.0002325384,0.00041367442,0.00008189744,0.00023558734,0.0037347476,0.00022412943,0.000016360655],"category_scores_gemma":[0.0018146371,0.0001590082,0.00007071724,0.0027074618,0.00005350797,0.0012975729,0.001711829,0.0004861949,0.0001392114],"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.00009679547,0.000109573215,0.002704039,0.000011524905,0.000016418668,8.58987e-7,0.0020805234,0.08490522,0.00018218443,0.05201113,0.6327696,0.22511217],"study_design_scores_gemma":[0.0012551066,0.00032793495,0.058939707,0.0004353059,0.000012256963,0.000020061661,0.00075842184,0.31960794,0.016204754,0.0042549325,0.5971055,0.0010780558],"about_ca_topic_score_codex":0.000011085052,"about_ca_topic_score_gemma":0.00007808205,"teacher_disagreement_score":0.46801746,"about_ca_system_score_codex":0.00021448622,"about_ca_system_score_gemma":0.000050914565,"threshold_uncertainty_score":0.6940152},"labels":[],"label_agreement":null},{"id":"W2917204809","doi":"","title":"“Iceberg”: un modèle de diffusion restreinte pour un réseau de confiance entre pairs","year":2006,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Francophone University Association","funders":"","keywords":"Iceberg; Humanities; Physics; Philosophy","score_opus":0.019995439822694996,"score_gpt":0.22347345404562172,"score_spread":0.20347801422292672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917204809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11080928,0.0022723512,0.7314968,0.11929453,0.0006069679,0.0008360563,0.0000953354,0.001385732,0.033202954],"genre_scores_gemma":[0.5305017,0.0009748697,0.434855,0.0005231861,0.000093041075,0.00017379518,0.00019245446,0.00009952677,0.032586377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.984981,0.008243524,0.001287098,0.0024228392,0.0011185859,0.0019469293],"domain_scores_gemma":[0.98618287,0.002695198,0.0010905062,0.0063986117,0.0029069472,0.00072586385],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.007992665,0.0010599629,0.0009402361,0.00048181292,0.0010286865,0.001412319,0.0079575535,0.0010815121,0.00023530614],"category_scores_gemma":[0.0031648807,0.0012451117,0.0005293247,0.0017138598,0.00078182155,0.00043270146,0.007831529,0.0020358695,0.00037552387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037967387,0.0017314403,0.011352341,0.00021562823,0.00019435993,0.00019435337,0.0100568,0.0076609207,0.011800308,0.5572404,0.020849202,0.37866628],"study_design_scores_gemma":[0.0015906177,0.000004438966,0.03892858,0.005890586,0.00015926152,0.00021919956,0.00029227923,0.5563536,0.16419953,0.1005541,0.12956175,0.002246008],"about_ca_topic_score_codex":0.01013685,"about_ca_topic_score_gemma":0.005948045,"teacher_disagreement_score":0.5486927,"about_ca_system_score_codex":0.0013332353,"about_ca_system_score_gemma":0.0015566179,"threshold_uncertainty_score":0.9996243},"labels":[],"label_agreement":null},{"id":"W2919360836","doi":"10.1007/978-3-319-77525-8_184","title":"Transactions in Massively Multiplayer Online Games","year":2019,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Big Data Technologies","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":"Université du Québec à Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Massively parallel; Multimedia; Parallel computing","score_opus":0.06164298396041781,"score_gpt":0.26356483907392086,"score_spread":0.20192185511350305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919360836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078805315,0.012728512,0.5040333,0.027680844,0.007058027,0.00474923,0.010149168,0.018244678,0.4145682],"genre_scores_gemma":[0.02394741,0.044993583,0.57256866,0.00027838247,0.0002930426,0.00016112791,0.0011656799,0.00030320167,0.3562889],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958638,0.00001905418,0.0009808573,0.001759327,0.00068910624,0.0006878737],"domain_scores_gemma":[0.9918901,0.000363573,0.0005210275,0.0070271203,0.00014204145,0.000056160326],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00030314617,0.0007370764,0.0010905424,0.0019958168,0.000060111088,0.00007062802,0.012085738,0.0014143622,0.00002481694],"category_scores_gemma":[0.00047599862,0.0007080826,0.00013866316,0.0006482271,0.00043521656,0.00069074816,0.0042700614,0.0015574418,0.00019221418],"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.000010775282,0.000092707975,0.000104230334,0.00007690634,0.00008020723,0.00009066122,0.00007710339,0.00012641943,0.000042165175,0.022135898,0.0114629185,0.96570003],"study_design_scores_gemma":[0.00045659285,0.00022531034,0.0003499541,0.0006456007,0.000046537654,0.000025005784,0.00019816398,0.0013668071,0.0003986858,0.023392214,0.97177416,0.0011209719],"about_ca_topic_score_codex":0.000064239386,"about_ca_topic_score_gemma":0.00075062976,"teacher_disagreement_score":0.96457905,"about_ca_system_score_codex":0.00014666402,"about_ca_system_score_gemma":0.00039163016,"threshold_uncertainty_score":0.999882},"labels":[],"label_agreement":null},{"id":"W2921058353","doi":"10.1145/3361525.3361539","title":"Pando","year":2019,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"PlanetLab; Rendering (computer graphics); Grid; Private network; Leverage (statistics); Testbed","score_opus":0.005171175364419993,"score_gpt":0.20342833093335064,"score_spread":0.19825715556893064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921058353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1435667,0.00003880425,0.69415927,0.010168799,0.0005858503,0.00018606838,1.3720454e-7,0.0022769968,0.1490174],"genre_scores_gemma":[0.82520497,0.0000015985431,0.16255744,0.0011483832,0.000013641054,0.0000051811517,1.3190105e-7,0.0000028457457,0.011065796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994292,0.000005658447,0.000061190774,0.00020191801,0.00012349169,0.0001784884],"domain_scores_gemma":[0.99927455,0.000029640825,0.0000111187255,0.0006380989,0.000013506513,0.000033058033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000084156934,0.00005287546,0.00006732133,0.00005849934,0.000015753676,0.000062596155,0.0010261949,0.000032303582,0.000041692856],"category_scores_gemma":[0.000015861762,0.000041490166,0.000019121006,0.0003133694,0.000007383755,0.00015638529,0.00047597912,0.0000525262,0.003889925],"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.0000019777865,0.000022701332,0.010428571,0.0000029375296,0.000009491997,0.0000090103285,0.00012320961,0.00012144121,0.0023460782,0.5266835,0.10893413,0.35131696],"study_design_scores_gemma":[0.00064404117,0.00032998243,0.027110683,0.000022674627,0.0000023079613,0.000030081603,0.000048635524,0.05993149,0.02929688,0.05283625,0.82907593,0.00067101425],"about_ca_topic_score_codex":0.000008375202,"about_ca_topic_score_gemma":0.000003267239,"teacher_disagreement_score":0.7201418,"about_ca_system_score_codex":0.000012664755,"about_ca_system_score_gemma":0.000010879355,"threshold_uncertainty_score":0.99688566},"labels":[],"label_agreement":null},{"id":"W2941390003","doi":"10.1109/saso.2019.00023","title":"Genet: A Quickly Scalable Fat-Tree Overlay for Personal Volunteer Computing using WebRTC","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"WebRTC; Computer science; Scalability; Overlay; Tree (set theory); Computer network; World Wide Web; Multimedia; Operating system; Mathematics","score_opus":0.0396786047270992,"score_gpt":0.2882987408469064,"score_spread":0.24862013611980718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941390003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08603892,0.0004991928,0.90329677,0.002040626,0.0029959353,0.0014371745,0.000036550955,0.0016175576,0.0020372623],"genre_scores_gemma":[0.37827307,0.0000070560473,0.616914,0.0009496431,0.0005750123,0.00004711888,0.00001792836,0.000066662,0.0031495618],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952626,0.000062465355,0.00064419664,0.0019648669,0.0007882609,0.0012776051],"domain_scores_gemma":[0.9969708,0.00029596465,0.00037583933,0.0017518841,0.00042001696,0.00018554412],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007094927,0.000701725,0.0008588225,0.0004971973,0.000266684,0.00082994666,0.0039302274,0.0007210545,0.000025623314],"category_scores_gemma":[0.00014476443,0.00069111283,0.00040274506,0.0005813084,0.00009722424,0.0002898826,0.0094460165,0.0008555279,0.00016391087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010046649,0.0004281795,0.013969453,0.0013638316,0.0009591203,0.00007117936,0.0057277423,0.2573639,0.005903025,0.018356804,0.40250698,0.29324934],"study_design_scores_gemma":[0.00037200717,0.000098297525,0.00080184557,0.00028954586,0.000028697366,0.000022287157,0.00007065109,0.97907764,0.0009966603,0.002284399,0.01507161,0.0008863536],"about_ca_topic_score_codex":0.00042353384,"about_ca_topic_score_gemma":0.00013019367,"teacher_disagreement_score":0.7217138,"about_ca_system_score_codex":0.0005207507,"about_ca_system_score_gemma":0.0004693596,"threshold_uncertainty_score":0.999554},"labels":[],"label_agreement":null},{"id":"W2947691160","doi":"","title":"Productive and Profitable Cluster Hire.","year":2019,"lang":"en","type":"article","venue":"The Florida AI Research Society","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":"Toronto Metropolitan University; University of Windsor","funders":"","keywords":"Cluster (spacecraft); Business; Computer science; Industrial organization; Computer network","score_opus":0.03312188254979023,"score_gpt":0.3313306282493884,"score_spread":0.2982087456995982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947691160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71434474,0.00077671715,0.017696772,0.25809675,0.0010091425,0.003261953,0.000005750427,0.00090305577,0.0039051168],"genre_scores_gemma":[0.9436692,0.00014519111,0.029314164,0.0023143222,0.00059563405,0.00037652857,0.0000019628421,0.0000359428,0.023547044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99716187,0.00019103082,0.00014391003,0.0006786383,0.0009454328,0.00087910634],"domain_scores_gemma":[0.9975895,0.00035663965,0.000029159964,0.0015278725,0.00039183162,0.00010495015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036108992,0.00014880323,0.00017508444,0.00006749029,0.0004322369,0.00037526796,0.0021768706,0.0001048442,0.000010003141],"category_scores_gemma":[0.00022705039,0.00009780956,0.00007034031,0.001408915,0.00034528345,0.00057954394,0.0033913304,0.0009224934,0.00045111412],"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.000039134815,0.00005885748,0.0036967802,0.000094550065,0.00011726724,0.0000051934485,0.012182445,0.00031048298,0.004816931,0.048800804,0.90075177,0.029125754],"study_design_scores_gemma":[0.0021464815,0.0015887043,0.027621182,0.00023967253,0.000019568848,0.00009161869,0.0057570105,0.17091827,0.04233821,0.15356529,0.59418416,0.0015298295],"about_ca_topic_score_codex":0.000054320855,"about_ca_topic_score_gemma":0.000005146309,"teacher_disagreement_score":0.30656764,"about_ca_system_score_codex":0.00014867568,"about_ca_system_score_gemma":0.00015151012,"threshold_uncertainty_score":0.57983094},"labels":[],"label_agreement":null},{"id":"W2948896993","doi":"10.1007/978-3-642-01187-0_27","title":"A Reference Model for Semantic Peer-to-Peer Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Peer-to-Peer Network Technologies","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":"Carleton University","funders":"","keywords":"Computer science; Peer-to-peer; World Wide Web","score_opus":0.027081212987370287,"score_gpt":0.261518126719457,"score_spread":0.23443691373208672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948896993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014303792,0.00026158884,0.97031,0.015464569,0.00034683116,0.0011692394,0.00001965119,0.00095358235,0.01146026],"genre_scores_gemma":[0.21654572,0.00006985278,0.7573315,0.013729558,0.00040561426,0.0003330298,0.00049352326,0.00012514726,0.010966084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617064,0.000009927424,0.001113883,0.0007081909,0.0011616502,0.0008357278],"domain_scores_gemma":[0.9949225,0.00016885981,0.00064548006,0.00104677,0.003076684,0.00013971122],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007061682,0.00077726203,0.00075265835,0.0014139633,0.00029591133,0.0011551771,0.002283535,0.0010911175,0.000004818028],"category_scores_gemma":[0.0013264685,0.0007499517,0.00009666873,0.0011908918,0.00006932622,0.002541446,0.0006122529,0.0009283009,0.000052102238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019960324,0.0000059993486,0.0000018054927,0.00015227564,0.000005749488,0.0000019598158,0.000540059,0.48464584,0.000001762685,0.009546739,0.0008510459,0.5042268],"study_design_scores_gemma":[0.0002856626,0.000044892946,0.000043518372,0.001169552,0.000020183024,0.000016465123,0.0000028115521,0.86819464,0.000037293514,0.07454813,0.054778915,0.00085792085],"about_ca_topic_score_codex":0.000007610315,"about_ca_topic_score_gemma":0.000079584745,"teacher_disagreement_score":0.50336885,"about_ca_system_score_codex":0.00035242666,"about_ca_system_score_gemma":0.0004577711,"threshold_uncertainty_score":0.99988174},"labels":[],"label_agreement":null},{"id":"W2949161188","doi":"10.82308/48666","title":"Monitoring distributed virtual worlds","year":2013,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Metaverse; Computer science; Architecture; Video game; Virtual reality; Multimedia; Human–computer interaction; Art; Visual arts","score_opus":0.01668461101876788,"score_gpt":0.22608315002187193,"score_spread":0.20939853900310404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949161188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98323256,0.00011607163,0.0010170918,0.0008696882,0.0019894156,0.0007522957,0.00015431258,0.0039060249,0.0079625575],"genre_scores_gemma":[0.96597,0.000028050074,0.032111976,0.00037155996,0.00008146379,0.00025998862,0.000011032248,0.0000668898,0.0010990888],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99543697,0.00019092907,0.0006895612,0.0013191539,0.0009630781,0.0014003068],"domain_scores_gemma":[0.9963918,0.00031612118,0.00021643017,0.0020923004,0.00040088897,0.000582466],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006864642,0.0006033685,0.0005174529,0.00045455486,0.0009872441,0.0004972719,0.0039633396,0.00037660458,0.0000625482],"category_scores_gemma":[0.000856211,0.0006142114,0.00020038507,0.002372421,0.000112644084,0.002681015,0.0025829235,0.0011284972,0.002803715],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009678848,0.00013518965,0.00073718856,0.000012480778,0.00007641954,0.00007816033,0.000005730478,0.00049042405,0.03125839,0.19515677,0.00018646201,0.7718531],"study_design_scores_gemma":[0.0021043867,0.0009935928,0.041044977,0.00055673684,0.00006982045,0.00018418532,0.00023752807,0.004179356,0.48762214,0.18099113,0.27781546,0.0042006974],"about_ca_topic_score_codex":0.00019594745,"about_ca_topic_score_gemma":0.000035746347,"teacher_disagreement_score":0.7676524,"about_ca_system_score_codex":0.0006877437,"about_ca_system_score_gemma":0.000028238408,"threshold_uncertainty_score":0.9996309},"labels":[],"label_agreement":null},{"id":"W2949844345","doi":"10.48550/arxiv.0808.1744","title":"Our Brothers' Keepers: Secure Routing with High Performance","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Computer science; Computer network; Chord (peer-to-peer); Overlay network; Network packet; Spoofing attack; Distributed hash table; Overlay; Distributed computing; Routing table; Peer-to-peer; Routing (electronic design automation); Identifier; Routing protocol; Computer security; The Internet; World Wide Web","score_opus":0.03371143745435305,"score_gpt":0.24348821523470282,"score_spread":0.20977677778034975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949844345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9388067,0.00016920948,0.05037486,0.006041313,0.00087045325,0.0005218167,0.0000059750146,0.0021236697,0.0010860009],"genre_scores_gemma":[0.95035934,0.00018072578,0.04723595,0.00073277834,0.00034256378,0.0001156939,0.000008299002,0.000060635943,0.00096401497],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9967087,0.000056929945,0.00039603445,0.0013640343,0.00060254644,0.0008717794],"domain_scores_gemma":[0.99681324,0.00004239256,0.000308849,0.0024914425,0.00019348001,0.00015061816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027903393,0.00059306616,0.000559227,0.0002703976,0.00027367205,0.00019691788,0.0040258598,0.00050388876,0.000004033471],"category_scores_gemma":[0.00006796498,0.00051867147,0.00010873448,0.00072458043,0.00008983662,0.00039188308,0.0036472091,0.0014655429,0.00033678417],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006576383,0.00019903932,0.8721388,0.00027215554,0.0004033475,0.00052201125,0.0059566633,0.05569818,0.00038259535,0.0019522245,0.019638935,0.042770285],"study_design_scores_gemma":[0.0025731353,0.0016104355,0.8469539,0.0042327,0.00014403564,0.00066624535,0.0012508591,0.081550136,0.023748754,0.0017745013,0.028524918,0.006970361],"about_ca_topic_score_codex":0.00016219195,"about_ca_topic_score_gemma":0.000032974636,"teacher_disagreement_score":0.035799924,"about_ca_system_score_codex":0.0002238675,"about_ca_system_score_gemma":0.00025481367,"threshold_uncertainty_score":0.9997265},"labels":[],"label_agreement":null},{"id":"W2949931668","doi":"","title":"Optimal Distributed Broadcasting with Per-neighbor Queues in Acyclic Overlay Networks with Arbitrary Underlay Capacity Constraints","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Underlay; Computer science; Broadcasting (networking); Overlay; Distributed computing; Queue; Overlay network; Computer network; Convergence (economics); The Internet; Telecommunications; Signal-to-noise ratio (imaging)","score_opus":0.03317148566267457,"score_gpt":0.16245129042492273,"score_spread":0.12927980476224815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949931668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5454851,0.000011088837,0.45282525,0.00026275642,0.00003999084,0.00027250085,0.000005290089,0.00044586134,0.0006521511],"genre_scores_gemma":[0.97420675,0.000008657146,0.02542147,0.00020051376,0.000029772888,0.0000048901034,0.0000083498335,0.000021595137,0.000097980184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764216,0.00010505011,0.00022024717,0.0010110106,0.00016035963,0.0008611455],"domain_scores_gemma":[0.9983276,0.00022225235,0.0001607602,0.000879129,0.00015884002,0.0002513838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017571134,0.0003821886,0.00037243892,0.00029220054,0.00019712231,0.00020877212,0.001500624,0.00019170775,0.000033441305],"category_scores_gemma":[0.000039965907,0.00034402419,0.00005995131,0.0020192813,0.0005499648,0.0012506939,0.0005040905,0.0005956079,0.00005404276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008762531,0.00018088744,0.08148752,0.000017224378,0.00010676994,0.00077578786,0.0003175752,0.869517,0.00012630454,0.0439566,0.0006354095,0.00279124],"study_design_scores_gemma":[0.00153648,0.0004984664,0.07580219,0.00021264366,0.000031832038,0.00010798796,0.000630224,0.91780674,0.00028745388,0.0019679451,0.0001616453,0.00095640775],"about_ca_topic_score_codex":0.00048610737,"about_ca_topic_score_gemma":0.00039787585,"teacher_disagreement_score":0.42872167,"about_ca_system_score_codex":0.00026160685,"about_ca_system_score_gemma":0.0001226863,"threshold_uncertainty_score":0.9999012},"labels":[],"label_agreement":null},{"id":"W2951520541","doi":"10.48550/arxiv.cs/0311041","title":"S-ToPSS: Semantic Toronto Publish/Subscribe System","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Publication; Middleware (distributed applications); Semantic matching; World Wide Web; Matching (statistics); Architecture; The Internet; Dissemination; Semantic Web; Distributed computing; Telecommunications","score_opus":0.03675624897610677,"score_gpt":0.2532902924259721,"score_spread":0.21653404344986535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951520541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6475704,0.0066275313,0.26065716,0.009436258,0.018278852,0.0023228563,0.00003374552,0.012063994,0.043009244],"genre_scores_gemma":[0.96784693,0.00008750546,0.027943747,0.00084117404,0.00038045994,0.00031065705,0.000018806426,0.000074463824,0.002496257],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99495786,0.00019798308,0.0008104748,0.0020163942,0.0008358233,0.0011814794],"domain_scores_gemma":[0.99374527,0.000109203254,0.0004115715,0.005046264,0.00037123234,0.00031645538],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00089753896,0.00076007156,0.0009044391,0.00024602725,0.00021243976,0.0009353476,0.0070961392,0.00086679234,0.00002917224],"category_scores_gemma":[0.00033413857,0.00075642415,0.00029291917,0.0006816269,0.000099553625,0.0009908844,0.0067325314,0.0010633873,0.00079460436],"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.00003318122,0.0006171629,0.27257967,0.002680067,0.001108604,0.0015020338,0.003913944,0.00354352,0.0009985131,0.16474669,0.50114274,0.04713388],"study_design_scores_gemma":[0.0031244776,0.0010289329,0.43439823,0.007763948,0.0006088647,0.0009730412,0.0035829782,0.042327948,0.008915021,0.017663892,0.46514344,0.014469206],"about_ca_topic_score_codex":0.00091854506,"about_ca_topic_score_gemma":0.0005859783,"teacher_disagreement_score":0.32027656,"about_ca_system_score_codex":0.0011433098,"about_ca_system_score_gemma":0.0003144696,"threshold_uncertainty_score":0.9999834},"labels":[],"label_agreement":null},{"id":"W2951957905","doi":"10.1080/15427951.2015.1051674","title":"The Analysis of Kademlia for Random IDs","year":2015,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Node (physics); Mathematical proof; Computer science; Random graph; Mathematics; Peer-to-peer; The Internet; Constant (computer programming); Theoretical computer science; Algorithm; Distributed computing; Graph; World Wide Web","score_opus":0.047859743194741615,"score_gpt":0.3008502656100821,"score_spread":0.2529905224153405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951957905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022233648,0.00011220098,0.97470784,0.0013855358,0.00017951237,0.00024938668,0.0000040041687,0.00018026905,0.00094759394],"genre_scores_gemma":[0.6617534,0.0000052025066,0.33601797,0.00009862547,0.000024905416,0.00007427795,0.0000018431076,0.000009960734,0.0020138274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989576,0.000019940011,0.00036397597,0.00017150858,0.0002754094,0.00021158285],"domain_scores_gemma":[0.99814224,0.00062306854,0.00016586769,0.00080994575,0.00019952387,0.000059362697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008820571,0.00010541118,0.00031038918,0.00017574258,0.00002444981,0.00010586598,0.0019301171,0.000057180296,0.0000017352535],"category_scores_gemma":[0.0007863361,0.000067476474,0.00015191591,0.0008123965,0.0000650804,0.00008014687,0.00044334153,0.00006540506,0.000022866065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006594756,0.00026551404,0.00039068205,0.00006600094,0.0021387136,0.0000049177575,0.011174196,0.003480968,0.00017912258,0.68458,0.25373155,0.043922342],"study_design_scores_gemma":[0.0005234817,0.0001545615,0.00006417747,0.000028373941,0.00021648662,0.0000036532856,0.00026059605,0.8771107,0.0033609697,0.091405556,0.026719593,0.00015183998],"about_ca_topic_score_codex":0.000009317472,"about_ca_topic_score_gemma":0.000039845956,"teacher_disagreement_score":0.87362975,"about_ca_system_score_codex":0.00003491645,"about_ca_system_score_gemma":0.00002500179,"threshold_uncertainty_score":0.358667},"labels":[],"label_agreement":null},{"id":"W2969956560","doi":"10.1109/iwmn.2019.8804987","title":"QNetwork: AI-Assisted Networking for Hybrid Cloud Gaming","year":2019,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Cloud computing; Computer science; Server; Distributed computing; Quality of service; Architecture; Computer network; Cloud testing; Multimedia; Cloud computing security; Operating system","score_opus":0.017607916382184986,"score_gpt":0.2568038585984343,"score_spread":0.23919594221624932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969956560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023545524,0.0002410256,0.9570339,0.004757473,0.005113258,0.0007906254,0.0000016852041,0.002240096,0.0062764557],"genre_scores_gemma":[0.8080056,0.000009663121,0.18398248,0.0031951335,0.0009982984,0.000082379534,0.000005773424,0.00003229757,0.0036884127],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99759537,0.000033850534,0.00035150241,0.0007647177,0.00031341994,0.00094115874],"domain_scores_gemma":[0.9980612,0.00031413708,0.000108165776,0.0012678584,0.00012565727,0.00012297336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005633085,0.0002599274,0.00033281182,0.00017294346,0.00016088712,0.00031095647,0.002074615,0.00010856469,0.000015212997],"category_scores_gemma":[0.00004791356,0.00024151555,0.00013365957,0.0008158171,0.000031555242,0.00036746336,0.0010294594,0.0002294765,0.00026718667],"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.000026355523,0.000056537632,0.0038662886,0.00003281034,0.00006990597,0.000020872347,0.000105952815,0.0074743065,0.0006796876,0.06973842,0.30742115,0.6105077],"study_design_scores_gemma":[0.00075005216,0.00028347148,0.0018291514,0.00013250344,0.000013538952,0.00005487304,0.0000330834,0.4767612,0.0025359413,0.013932459,0.5028637,0.0008100459],"about_ca_topic_score_codex":0.00001315387,"about_ca_topic_score_gemma":0.000015232931,"teacher_disagreement_score":0.78446,"about_ca_system_score_codex":0.000099213335,"about_ca_system_score_gemma":0.00005203985,"threshold_uncertainty_score":0.9848718},"labels":[],"label_agreement":null},{"id":"W2971519680","doi":"10.1109/ipdps.2019.00087","title":"An Efficient Collaborative Communication Mechanism for MPI Neighborhood Collectives","year":2019,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Kernel (algebra); Matching (statistics); Distributed computing; Network topology; Process (computing); Message Passing Interface; Mechanism (biology); Pattern matching; Message passing; Theoretical computer science; Computer network; Artificial intelligence; Operating system; Mathematics","score_opus":0.008317405511827558,"score_gpt":0.259226048574023,"score_spread":0.2509086430621954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971519680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043720957,0.000047059533,0.9396988,0.0041708704,0.00023402013,0.0015075101,0.000010128765,0.0009737483,0.009636864],"genre_scores_gemma":[0.69824755,0.0000044432277,0.30057597,0.00045547888,0.000009101844,0.00016501198,0.0000038674484,0.000008893073,0.0005296362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875784,0.00007784826,0.00018260747,0.00045534814,0.00022062846,0.00030575244],"domain_scores_gemma":[0.997635,0.00023016751,0.00008394367,0.0014780627,0.0004976352,0.00007521173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031321868,0.00015184512,0.0001926021,0.0001741653,0.00019119406,0.0002109785,0.0019403783,0.000096595235,0.000011137215],"category_scores_gemma":[0.00009003342,0.00013590744,0.000036660993,0.0012300684,0.00003217304,0.00029500586,0.0004315771,0.000096476375,0.00008764662],"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.000012682005,0.00009887583,0.000069305235,0.0000033702495,0.000015049851,2.4513344e-7,0.0009975844,0.0022398832,0.0027394847,0.98836136,0.001974786,0.0034873632],"study_design_scores_gemma":[0.0008272215,0.0011689755,0.00067650824,0.00002375233,0.0000068634977,0.0000026495313,0.0013456937,0.81842035,0.048552424,0.1263692,0.002180805,0.00042557385],"about_ca_topic_score_codex":0.000011803569,"about_ca_topic_score_gemma":0.00003935005,"teacher_disagreement_score":0.8619922,"about_ca_system_score_codex":0.00010919718,"about_ca_system_score_gemma":0.000113425136,"threshold_uncertainty_score":0.5542144},"labels":[],"label_agreement":null},{"id":"W2976391822","doi":"10.18280/isi.240309","title":"Content Delivery Through Hybrid Architecture in Video on Demand System","year":2019,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Proxy server; Architecture; Proxy (statistics); Content delivery; Video on demand; Download; Node (physics); On demand; Peer-to-peer","score_opus":0.016425440064556377,"score_gpt":0.21135817561546377,"score_spread":0.1949327355509074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976391822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66376936,0.00009211772,0.32420537,0.00032273823,0.00058538094,0.0007141717,0.0000084518715,0.00077416946,0.009528264],"genre_scores_gemma":[0.984718,0.000008579946,0.01434876,0.0007501335,0.000027560829,0.00008063704,0.000013655285,0.000009009718,0.0000436492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982073,0.000066212975,0.0005953788,0.0002643299,0.00041849967,0.0004482845],"domain_scores_gemma":[0.99870497,0.00011872509,0.00022694451,0.000739263,0.00015024639,0.000059877653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043383232,0.00023579036,0.00030660475,0.00043458617,0.00010286759,0.0003303069,0.0009699376,0.00011357312,0.0000033353656],"category_scores_gemma":[0.00013069135,0.00020992049,0.00006633527,0.0006645649,0.00005024107,0.0025950223,0.00034669111,0.00025335568,0.0006590642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024100464,0.000089450295,0.011030136,0.0014481947,0.000108633845,0.000082228165,0.021483269,0.13197127,0.00084034004,0.20914504,0.005196093,0.61836433],"study_design_scores_gemma":[0.010103269,0.004785605,0.12640491,0.014043707,0.000063990374,0.0014675575,0.013648722,0.5704444,0.06947704,0.064172745,0.11924244,0.0061456123],"about_ca_topic_score_codex":0.00011398514,"about_ca_topic_score_gemma":0.000019398947,"teacher_disagreement_score":0.61221874,"about_ca_system_score_codex":0.0005874863,"about_ca_system_score_gemma":0.000059236838,"threshold_uncertainty_score":0.8560309},"labels":[],"label_agreement":null},{"id":"W2990589730","doi":"","title":"Received Support, Perceived Support, and Social Support Observation and Provision in Virtual Communities.","year":2019,"lang":"en","type":"article","venue":"Journal of the Association for Information Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Social support; Computer science; Psychology; Knowledge management; Social psychology","score_opus":0.017302564161980487,"score_gpt":0.23681385686224213,"score_spread":0.21951129270026165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990589730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98402834,0.000010280171,0.005524364,0.0061678938,0.0017166233,0.0012583219,0.000037339294,0.00007886166,0.0011779707],"genre_scores_gemma":[0.99784184,0.0000140742395,0.00066116964,0.0005379799,0.000054157106,0.000017827857,0.000019865836,0.0000059971226,0.0008471214],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980122,0.00014581654,0.00093847344,0.00007664359,0.0006060503,0.00022083393],"domain_scores_gemma":[0.9972513,0.00024817867,0.0016585524,0.0002079142,0.00059312966,0.000040981682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027374784,0.00012441754,0.0003136738,0.00033087027,0.00018375563,0.00044543814,0.0006142761,0.0001764778,0.0000019984484],"category_scores_gemma":[0.0002316048,0.000098118224,0.000072862254,0.0003224903,0.000020154088,0.0031222412,0.0002270986,0.00025959278,0.0000126594],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038944843,0.00017762426,0.5225672,0.00062262063,0.00036564204,0.0000026056828,0.2167338,0.00907456,0.0016306874,0.063614614,0.11458084,0.07024034],"study_design_scores_gemma":[0.0057780803,0.0016938326,0.63738173,0.0002739295,0.00005164978,0.00013124125,0.024798172,0.052577686,0.00017984108,0.00089340383,0.27561736,0.0006230602],"about_ca_topic_score_codex":0.000027407505,"about_ca_topic_score_gemma":0.000020202076,"teacher_disagreement_score":0.19193563,"about_ca_system_score_codex":0.0004594181,"about_ca_system_score_gemma":0.00014006591,"threshold_uncertainty_score":0.42953703},"labels":[],"label_agreement":null},{"id":"W2997094414","doi":"10.1145/1837853.1693496","title":"Towards scalable and transparent parallelization of multiplayer games using transactional memory support","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software transactional memory; Transactional memory; Scalability; Quake (natural phenomenon); Lock (firearm); Parallel computing; Distributed computing; Programming language; Operating system","score_opus":0.03942464060239884,"score_gpt":0.2844581110907729,"score_spread":0.24503347048837407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997094414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79243743,0.00006563415,0.20509496,0.0013251095,0.00043049362,0.00016720762,0.000014258385,0.00020457902,0.0002603191],"genre_scores_gemma":[0.8107203,0.00001074943,0.18909085,0.00008965472,0.000035563487,0.000006797178,0.0000048661504,0.0000074288832,0.000033788245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998827,0.00002255419,0.00024768576,0.00034012896,0.00031596737,0.00024668398],"domain_scores_gemma":[0.9990755,0.00013635488,0.000094301904,0.00052869844,0.00008294623,0.000082218234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023203717,0.00014497942,0.00020123352,0.00015215614,0.000081839804,0.00007343464,0.00088662206,0.00011866527,0.000041610885],"category_scores_gemma":[0.00010566331,0.00013333121,0.000036143803,0.00026402518,0.00009760457,0.00047299298,0.00011530991,0.0001678901,0.0000058880023],"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.00018149942,0.00054498063,0.047770787,0.00040077476,0.00026116698,0.00007337094,0.009411314,0.098359615,0.31971645,0.009518132,0.0025846802,0.51117724],"study_design_scores_gemma":[0.0022128187,0.00061151414,0.15538637,0.00016539652,0.00015348439,0.00015448034,0.00047135146,0.48750043,0.33701035,0.0064202514,0.008472507,0.0014410283],"about_ca_topic_score_codex":0.00011675828,"about_ca_topic_score_gemma":0.00022454478,"teacher_disagreement_score":0.50973624,"about_ca_system_score_codex":0.000012155285,"about_ca_system_score_gemma":0.00006576881,"threshold_uncertainty_score":0.54370886},"labels":[],"label_agreement":null},{"id":"W3004466188","doi":"10.1145/1384529.1375476","title":"On the design of hybrid peer-to-peer systems","year":2008,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scalability; Peer-to-peer; Computer science; Distributed computing; Bounded function; Computer network; Database","score_opus":0.15061426071323158,"score_gpt":0.3276585735565172,"score_spread":0.1770443128432856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004466188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10227153,0.0542256,0.7810193,0.048259065,0.0020991825,0.00948548,0.000013902272,0.0007258825,0.0019000947],"genre_scores_gemma":[0.9247252,0.023061804,0.045464907,0.0047893226,0.00008942396,0.0009865303,0.000010942438,0.000032473854,0.0008394358],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938033,0.00045963228,0.00082833774,0.0005814225,0.0038725906,0.00045471964],"domain_scores_gemma":[0.99212855,0.0016238156,0.0004161847,0.0030457824,0.00266345,0.0001222352],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01236202,0.00029399604,0.0005436057,0.0007572042,0.0002829929,0.00007959649,0.004126025,0.00006224174,0.000040548304],"category_scores_gemma":[0.026107794,0.00020364321,0.000107274165,0.006905721,0.0000681147,0.00040042461,0.0007136089,0.00030245786,0.00080116105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011457549,0.00010973274,0.00052701053,0.00051229616,0.00005313,0.0000075092344,0.00020281959,0.09340629,0.0000623031,0.005890406,0.5559283,0.34328875],"study_design_scores_gemma":[0.000758016,0.0019029946,0.0061027287,0.0053498843,0.00018469758,0.00021295407,0.000026859989,0.80703837,0.005017449,0.0015560956,0.17057024,0.0012797171],"about_ca_topic_score_codex":0.00000530186,"about_ca_topic_score_gemma":1.3731422e-7,"teacher_disagreement_score":0.8224536,"about_ca_system_score_codex":0.00023058176,"about_ca_system_score_gemma":0.00028275567,"threshold_uncertainty_score":0.9999768},"labels":[],"label_agreement":null},{"id":"W3009196551","doi":"10.4018/ijssci.2020010104","title":"An Incentive Compatible Mechanism for Replica Placement in Peer-Assisted Content Distribution","year":2020,"lang":"en","type":"article","venue":"International Journal of Software Science and Computational Intelligence","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Replica; Computer science; Content delivery; Incentive; Distributed computing; Content distribution; Latency (audio); Key (lock); Incentive compatibility; The Internet; Peer-to-peer; Content delivery network; Computer network; World Wide Web; Computer security; Telecommunications; Server","score_opus":0.06765365080020397,"score_gpt":0.3309161150700873,"score_spread":0.2632624642698833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009196551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06400156,0.000028254903,0.92124856,0.013952604,0.00043606767,0.00022585504,0.000037323174,0.000059832084,0.000009941165],"genre_scores_gemma":[0.79757714,0.0000098032315,0.20071788,0.0016003632,0.000060803206,0.000013335934,0.000012133755,0.0000040184855,0.000004488676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698144,0.000032427684,0.0006230153,0.0004458506,0.0016643096,0.00025293537],"domain_scores_gemma":[0.9934745,0.00026439512,0.00035360674,0.00014819759,0.005526998,0.00023230341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010880947,0.00014345843,0.00020670285,0.000310562,0.0001378563,0.00039652095,0.002271428,0.000043688684,0.0000036452561],"category_scores_gemma":[0.0018105434,0.00013367712,0.000053488387,0.0008949998,0.00020944333,0.0012420814,0.00036646557,0.00018220773,0.0000046341474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041044652,0.0005206454,0.0037849282,0.00002077398,0.000084515406,0.0000958632,0.0034776384,0.2018462,0.0042991345,0.50184983,0.0016642206,0.28194582],"study_design_scores_gemma":[0.00077616103,0.0018988162,0.014745168,0.00019965779,0.000010620146,0.00016681274,0.0012887944,0.822155,0.022510543,0.13469599,0.0011142949,0.00043811838],"about_ca_topic_score_codex":0.000017947848,"about_ca_topic_score_gemma":0.000007758978,"teacher_disagreement_score":0.7335756,"about_ca_system_score_codex":0.0003330616,"about_ca_system_score_gemma":0.00041849355,"threshold_uncertainty_score":0.54511946},"labels":[],"label_agreement":null},{"id":"W3009424282","doi":"10.1145/1384529.1375492","title":"Analysis of bittorrent-like protocols for on-demand stored media streaming","year":2008,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"","keywords":"BitTorrent; Computer science; Upload; Download; Bandwidth (computing); Peer-to-peer; On demand; Computer network; Distributed computing; Multimedia; World Wide Web","score_opus":0.14579309185419642,"score_gpt":0.3786104444600324,"score_spread":0.23281735260583597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009424282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42660537,0.066054925,0.40458956,0.004098501,0.0016605027,0.09502677,0.000097520446,0.001244782,0.00062206114],"genre_scores_gemma":[0.7319461,0.039320324,0.18585587,0.0019474138,0.00016528298,0.040399987,0.00019045029,0.0000527082,0.00012183881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964587,0.00013522022,0.0008378104,0.00058866316,0.001615511,0.0003640795],"domain_scores_gemma":[0.9952043,0.0010018714,0.000583824,0.002019307,0.0010913817,0.000099285295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039162417,0.00024711248,0.00077404693,0.0019386932,0.00018087125,0.00003489498,0.0021813374,0.00009604186,0.00002515379],"category_scores_gemma":[0.0076400675,0.00021296632,0.00024698465,0.013230756,0.000058191166,0.00044015012,0.0003767116,0.00014974458,0.000027554803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129472155,0.00013948427,0.01602679,0.0007354708,0.00025940593,9.0254485e-7,0.00024224364,0.0069028577,0.000032113716,0.0003339849,0.010292575,0.96502125],"study_design_scores_gemma":[0.0015405215,0.0012414699,0.14824948,0.0033402208,0.0015321112,0.000006749307,0.000016899021,0.7988219,0.0017880478,0.00026555217,0.042265642,0.000931364],"about_ca_topic_score_codex":0.0000025138145,"about_ca_topic_score_gemma":0.0000032722016,"teacher_disagreement_score":0.9640899,"about_ca_system_score_codex":0.00019585218,"about_ca_system_score_gemma":0.00022970971,"threshold_uncertainty_score":0.91464263},"labels":[],"label_agreement":null},{"id":"W3013547980","doi":"10.5383/juspn.07.01.004","title":"Content-based Filter Publish Subscribe Model for Real-time WSN applications","year":2016,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals","keywords":"Computer science; Computer network; Quality of service; Publication; Distributed computing; Wireless sensor network; Middleware (distributed applications); Network packet; Energy consumption; Porting; Efficient energy use; Decoupling (probability); Throughput; Real-time computing; Wireless; Telecommunications; Operating system; Engineering","score_opus":0.039103999484897456,"score_gpt":0.24683318232309143,"score_spread":0.20772918283819397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013547980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006374945,0.0010698279,0.9857053,0.005127089,0.0006177714,0.00078991026,0.00003731491,0.00014602367,0.0001317802],"genre_scores_gemma":[0.93204546,0.00041239292,0.062396035,0.0007537278,0.001697841,0.00037107436,0.0000044047038,0.000051715517,0.0022673793],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997848,0.000079309844,0.00077061635,0.00038700862,0.0003742477,0.00054082496],"domain_scores_gemma":[0.9966692,0.00061395107,0.0006402963,0.00063472684,0.0011604222,0.00028142493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009875515,0.00025304305,0.00055451086,0.00025015813,0.00019462612,0.0004329725,0.0012781799,0.00023617741,0.0000030127628],"category_scores_gemma":[0.00012236921,0.00016592487,0.00019593579,0.00032003172,0.00008160381,0.0006765928,0.00019584408,0.00019197984,0.0000053909653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042805483,0.0003791009,0.0030444078,0.0002887161,0.0006166052,0.000096776304,0.0008382532,0.20322715,0.022993611,0.05109483,0.5045138,0.21247867],"study_design_scores_gemma":[0.0017853872,0.0007080939,0.00044865228,0.00063726655,0.00006865971,0.00024707025,0.00011572975,0.97265345,0.00032194055,0.001452688,0.021047726,0.0005133666],"about_ca_topic_score_codex":0.00002179148,"about_ca_topic_score_gemma":0.00002006934,"teacher_disagreement_score":0.9256705,"about_ca_system_score_codex":0.00012223814,"about_ca_system_score_gemma":0.00016498289,"threshold_uncertainty_score":0.676622},"labels":[],"label_agreement":null},{"id":"W3049410002","doi":"10.4236/cn.2020.123006","title":"A P2P Approach to Routing in Hierarchical MANETs","year":2020,"lang":"en","type":"article","venue":"Communications and Network","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Army Research Laboratory; Research, Development and Engineering Command","keywords":"Computer science; Distributed hash table; Computer network; Flooding (psychology); Distributed computing; Scalability; Overlay network; Policy-based routing; Routing protocol; Hierarchical routing; Routing (electronic design automation); Static routing; Routing table; Peer-to-peer; Database; The Internet","score_opus":0.051576802727024806,"score_gpt":0.27038946814747805,"score_spread":0.21881266542045325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049410002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015802594,0.0021784857,0.84763706,0.11343862,0.00007887873,0.0006449803,0.0000021414025,0.00078188395,0.01943535],"genre_scores_gemma":[0.6226559,0.00010901461,0.3748678,0.002251749,0.000040060673,0.000051282383,0.0000029283137,0.0000053147905,0.000015947793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895436,0.00010229682,0.0002115063,0.0003146626,0.000103840895,0.00031334301],"domain_scores_gemma":[0.99808484,0.00017905052,0.00003320613,0.0015191097,0.000022866576,0.00016095217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002973142,0.00010568402,0.00016963508,0.00006635337,0.00019988963,0.00011902486,0.002777831,0.00006307012,6.7212255e-7],"category_scores_gemma":[0.00007499733,0.000106620544,0.000021279258,0.0014098731,0.00006522174,0.00009918197,0.0038459457,0.0003463455,0.000022417375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012202161,0.0001253493,0.007379346,0.0000113283695,0.000017903249,0.000004760763,0.004759664,0.0066010836,0.00005249586,0.4958961,0.023317387,0.4618224],"study_design_scores_gemma":[0.00024742034,0.00013263893,0.015707161,0.00007157157,0.000004315546,0.000011352584,0.00011933089,0.8657926,0.000008652314,0.008721088,0.1088316,0.00035230574],"about_ca_topic_score_codex":0.000014844168,"about_ca_topic_score_gemma":0.000031581374,"teacher_disagreement_score":0.8591915,"about_ca_system_score_codex":0.000021259671,"about_ca_system_score_gemma":0.00002081314,"threshold_uncertainty_score":0.51619476},"labels":[],"label_agreement":null},{"id":"W3050880870","doi":"10.1109/icbc48266.2020.9169394","title":"Optimizing All-to-All Data Transmission in WANs","year":2020,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Multicast; Distributed computing; Data transmission; Throughput; Transmission (telecommunications); Latency (audio); Overlay network; Commit; Reliable multicast; Cloud computing; Source-specific multicast; Wireless","score_opus":0.10834171741691355,"score_gpt":0.3054057458985819,"score_spread":0.19706402848166832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3050880870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018057077,0.00007392321,0.8533792,0.14108424,0.000058895526,0.00019731703,0.0000029262928,0.0009582039,0.0024396144],"genre_scores_gemma":[0.12732776,0.000021525904,0.8584804,0.013991332,0.000030351774,0.000008207563,0.000008214087,0.000010767316,0.00012146951],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983288,0.000026818263,0.0002235887,0.00074377714,0.0002719133,0.00040511473],"domain_scores_gemma":[0.9984944,0.000052903113,0.00002112521,0.0011885072,0.000018561457,0.00022448874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023833933,0.00014331368,0.00017570992,0.00012642992,0.00002952999,0.00013003153,0.004690601,0.000077597855,0.000021547627],"category_scores_gemma":[0.00006145174,0.00012558502,0.000022140963,0.000933343,0.000013508228,0.0005000859,0.002223245,0.00020342568,0.00017302058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002413809,0.000083634426,0.00021522304,0.000024226447,0.00003063053,0.00018822268,0.0060817925,0.02386465,0.013717701,0.008806279,0.23488583,0.7120777],"study_design_scores_gemma":[0.00024692225,0.00012768459,0.0001796002,0.000034432556,0.000004095757,0.0000041349085,0.000088992936,0.6139048,0.0043667885,0.00045766903,0.3802831,0.00030182578],"about_ca_topic_score_codex":0.00004716503,"about_ca_topic_score_gemma":0.000043412965,"teacher_disagreement_score":0.71177584,"about_ca_system_score_codex":0.000029871544,"about_ca_system_score_gemma":0.000036362053,"threshold_uncertainty_score":0.8716382},"labels":[],"label_agreement":null},{"id":"W3098508067","doi":"10.82308/18894","title":"Personal volunteer computing","year":2020,"lang":"en","type":"preprint","venue":"Open MIND","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Laptop; Computer science; Rendering (computer graphics); Leverage (statistics); Personal computer; Multimedia; Animation; Human–computer interaction; Computer graphics (images); Artificial intelligence; Operating system","score_opus":0.08317285843251387,"score_gpt":0.3271063974275519,"score_spread":0.243933538995038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098508067","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08539527,0.0002718203,0.8288297,0.043408155,0.0024345662,0.001612317,0.000055592966,0.00019627005,0.03779632],"genre_scores_gemma":[0.4326828,0.0000025455406,0.5652542,0.0005327494,0.00021806586,0.000018115228,0.000015686594,0.000019319647,0.0012565257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972889,0.000058334892,0.00033648335,0.0013947554,0.00044900665,0.00047254818],"domain_scores_gemma":[0.9982721,0.00008244933,0.0001921464,0.0011686838,0.00010929852,0.00017528186],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.00043872613,0.00034263957,0.00047590575,0.00012945611,0.00013053656,0.0016415794,0.009187853,0.00029529334,0.00015985806],"category_scores_gemma":[0.00014207432,0.00035362656,0.00011518828,0.0004469546,0.000060739887,0.00021755083,0.035108168,0.0009867622,0.002001818],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008237495,0.00004189044,0.00027000607,0.000019449462,0.00007919799,0.00017683081,0.00502922,0.001648122,0.00016873861,0.0005575872,0.037428856,0.95457184],"study_design_scores_gemma":[0.00041314703,0.00019362484,0.0015365846,0.00050306413,0.000034143795,0.000050526356,0.00024774636,0.6205395,0.0030013944,0.006210324,0.36578843,0.0014815413],"about_ca_topic_score_codex":0.000064688575,"about_ca_topic_score_gemma":0.000028290484,"teacher_disagreement_score":0.9530903,"about_ca_system_score_codex":0.0001210615,"about_ca_system_score_gemma":0.00030206295,"threshold_uncertainty_score":0.9998916},"labels":[],"label_agreement":null},{"id":"W3105587841","doi":"10.82308/2999","title":"A probabilistic analysis of Kademlia networks","year":2013,"lang":"en","type":"book-chapter","venue":"Open MIND","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Computer science; Probabilistic logic; Vertex (graph theory); Constant (computer programming); Theoretical computer science; Random graph; Peer-to-peer; Node (physics); Graph; Algorithm; Distributed computing; Artificial intelligence","score_opus":0.04232631571710486,"score_gpt":0.2756317232513508,"score_spread":0.23330540753424597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105587841","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046620518,0.0004889051,0.09989728,0.001031998,0.00038939732,0.0019092634,0.000048851234,0.000049294427,0.8957188],"genre_scores_gemma":[0.0137595795,0.000047451656,0.28825444,0.00014875633,0.000079828766,0.00009534596,0.000064232314,0.00005219358,0.6974982],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997591,0.000021650163,0.00060421455,0.0009850966,0.00040938935,0.0003886079],"domain_scores_gemma":[0.99678874,0.0001563413,0.00046361051,0.0022361507,0.00022380044,0.0001313496],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039845082,0.00038718982,0.001013426,0.0006493237,0.000058172925,0.0003955085,0.0060179,0.00050068303,0.0017719502],"category_scores_gemma":[0.00006956564,0.0003560716,0.00025095505,0.00072244514,0.00014460493,0.00027269128,0.003636543,0.00041716013,0.0008812822],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009976008,0.00004566167,0.00004281812,0.000013536304,0.0020782552,0.000047817604,0.00024922186,0.026233695,0.000008374611,0.10325067,0.024389705,0.84363025],"study_design_scores_gemma":[0.00024683255,0.0002847195,0.00048851396,0.00036056657,0.0017166681,0.000009146146,0.000009275826,0.29174048,0.000048994178,0.026977288,0.6767861,0.0013313964],"about_ca_topic_score_codex":0.00004840449,"about_ca_topic_score_gemma":0.00018320444,"teacher_disagreement_score":0.84229887,"about_ca_system_score_codex":0.00009331555,"about_ca_system_score_gemma":0.00011282318,"threshold_uncertainty_score":0.99989665},"labels":[],"label_agreement":null},{"id":"W3130725567","doi":"","title":"Evolution of Development Priorities in Key-value Stores Serving Large-scale Applications: The {RocksDB} Experience","year":2021,"lang":"en","type":"article","venue":"File and Storage Technologies","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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 Toronto","funders":"","keywords":"Key (lock); Computer science; Scale (ratio); Value (mathematics); Computer security; Geography","score_opus":0.009179598936615914,"score_gpt":0.22927775025322267,"score_spread":0.22009815131660676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130725567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6241665,0.009112125,0.36161512,0.0022838674,0.0001228296,0.0005307514,0.000037934667,0.0018520105,0.0002788846],"genre_scores_gemma":[0.86747366,0.00019465969,0.13152203,0.000044002718,0.000009226418,0.00058915064,0.000004454787,0.000006653248,0.00015618483],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986915,0.00003169701,0.0002814143,0.000427001,0.00024307193,0.0003253388],"domain_scores_gemma":[0.99877936,0.00014169862,0.00009236132,0.0008697923,0.00010130959,0.000015492144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020780387,0.00015015977,0.00020791392,0.00021530324,0.00022289422,0.00007450636,0.0012607094,0.00015275078,0.0000067444266],"category_scores_gemma":[0.0002567077,0.00012297972,0.000026046573,0.0012213476,0.00016355653,0.00026617086,0.0017892922,0.00022034762,0.000005385083],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020626974,0.00043579363,0.032209966,0.00031867952,0.00006759208,0.000116295545,0.049628373,0.0033278698,0.008066791,0.27918196,0.012911431,0.61371464],"study_design_scores_gemma":[0.0008722612,0.00025085144,0.13359772,0.0008676505,0.000017168159,0.0001252978,0.17794497,0.037932515,0.1474532,0.079085335,0.42014936,0.0017036787],"about_ca_topic_score_codex":0.000023262746,"about_ca_topic_score_gemma":0.00028475607,"teacher_disagreement_score":0.61201096,"about_ca_system_score_codex":0.00013320365,"about_ca_system_score_gemma":0.0001312136,"threshold_uncertainty_score":0.50149673},"labels":[],"label_agreement":null},{"id":"W3136256922","doi":"10.1109/netgames.2011.6080988","title":"Cheat detection and prevention in P2P MOGs","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Cheating; Computer science; Collusion; Computer security; Server; Peer-to-peer; Internet privacy; Computer network; Business; Database","score_opus":0.030879514388415324,"score_gpt":0.23420008838436904,"score_spread":0.2033205739959537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136256922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39673936,0.000037109414,0.5964425,0.00029202545,0.0001038835,0.00011805152,4.3405763e-8,0.00042285808,0.00584416],"genre_scores_gemma":[0.9152508,0.000007378417,0.084219255,0.00005502215,0.0000065572203,0.000015351881,5.7114352e-8,0.000002196988,0.0004433747],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99950004,0.00001376386,0.000085832144,0.00019905568,0.00006882218,0.00013250229],"domain_scores_gemma":[0.9996983,0.000008967076,0.0000152568045,0.00023852418,0.000013785371,0.000025195444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014556521,0.000053280368,0.00005687494,0.00015342167,0.000021953472,0.000026391515,0.00026438193,0.000051543713,0.000006725045],"category_scores_gemma":[0.000019991561,0.00004833609,0.000010388323,0.0003936873,0.000014680903,0.00026717063,0.00022962684,0.000062067535,0.0000246219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053240597,0.000034168857,0.0040249196,0.000004894862,0.0000034920704,0.000005609023,0.0005863281,0.000008930732,0.0035346558,0.013482248,0.0002597355,0.9780497],"study_design_scores_gemma":[0.0007112104,0.0006990139,0.49372488,0.00005906677,0.0000052267196,0.000052417534,0.00015068441,0.04932498,0.21539381,0.23688683,0.0024743846,0.0005174987],"about_ca_topic_score_codex":0.00011042291,"about_ca_topic_score_gemma":0.000492143,"teacher_disagreement_score":0.9775322,"about_ca_system_score_codex":0.000023111159,"about_ca_system_score_gemma":0.000005604523,"threshold_uncertainty_score":0.19710885},"labels":[],"label_agreement":null},{"id":"W3139111285","doi":"10.1109/ds-rt.2007.36","title":"A Visibility-Driven Approach to Managing Interest in Distributed Simulations with Dynamic Load Balancing","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Scalability; Server; Visibility; Load balancing (electrical power); Architecture; Granularity; Computer network; Operating system","score_opus":0.020337018939109098,"score_gpt":0.2655321715842468,"score_spread":0.2451951526451377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139111285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30901736,0.00000594515,0.6876297,0.0011859055,0.000036875954,0.00029624745,0.0000032003948,0.000550913,0.0012738681],"genre_scores_gemma":[0.7598324,2.4972118e-7,0.23987833,0.0002046452,0.0000067035407,0.000009627227,0.0000068821832,0.0000076328415,0.000053560685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982974,0.000022905066,0.00028738723,0.0006238865,0.00023212808,0.00053627224],"domain_scores_gemma":[0.9987297,0.00013408119,0.0000433575,0.00087951403,0.00009329665,0.0001200527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004576483,0.00017284091,0.00019503082,0.00036242296,0.0000732215,0.00014181287,0.0011463416,0.000065742315,0.0000018387584],"category_scores_gemma":[0.00011196004,0.0001481032,0.000025164813,0.0021916511,0.000035810066,0.00030067944,0.0007634568,0.00021853895,0.000022562339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006386643,0.00041701907,0.07508356,0.00005472332,0.00004389873,0.00010796711,0.00224041,0.80446327,0.00094333215,0.040429745,0.00052086374,0.075631335],"study_design_scores_gemma":[0.0002717913,0.00008614255,0.059731074,0.00006206132,0.0000026965859,0.000010415853,0.00024305309,0.9370122,0.00020354065,0.0017998205,0.00030280196,0.0002744065],"about_ca_topic_score_codex":0.00012732472,"about_ca_topic_score_gemma":0.0048613185,"teacher_disagreement_score":0.450815,"about_ca_system_score_codex":0.00052208966,"about_ca_system_score_gemma":0.00004656314,"threshold_uncertainty_score":0.6039473},"labels":[],"label_agreement":null},{"id":"W3139986518","doi":"10.1109/netgames.2011.6080980","title":"Triangle-based obstacle-aware load balancing for massively multiplayer games","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Load balancing (electrical power); Server; Distributed computing; Obstacle; Load management; Load distribution; Heavy load; Semantics (computer science); Computer network","score_opus":0.05464179765576098,"score_gpt":0.25036559669540953,"score_spread":0.19572379903964854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139986518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011520222,0.00006617036,0.9811751,0.0020276736,0.0004905677,0.00062111416,0.0000102141,0.0018211985,0.002267717],"genre_scores_gemma":[0.57622373,7.938727e-7,0.4217838,0.00090998673,0.00003641905,0.00013349319,0.0000016173256,0.000015272635,0.0008948933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812335,0.000028603137,0.00029943173,0.00061562564,0.00032239832,0.00061057997],"domain_scores_gemma":[0.9982868,0.0002952512,0.000105845684,0.000928654,0.000249253,0.00013419526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035064842,0.00023704479,0.00029066432,0.0001875572,0.000117613716,0.00011269951,0.001691017,0.00014800187,0.000038501035],"category_scores_gemma":[0.00035244483,0.00020103947,0.00013691674,0.00050473196,0.000046626723,0.0003394371,0.0003534423,0.00012928355,0.00012491542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003394627,0.0005006492,0.012130227,0.000116022195,0.00016443945,0.00016619862,0.0030317095,0.00120292,0.005890648,0.054364573,0.15818238,0.7639108],"study_design_scores_gemma":[0.007234103,0.0013522728,0.018796371,0.00022070322,0.000046221747,0.000028808989,0.0005844515,0.5859521,0.28743,0.013567971,0.0825699,0.0022171154],"about_ca_topic_score_codex":0.00007998413,"about_ca_topic_score_gemma":0.0000900255,"teacher_disagreement_score":0.76169366,"about_ca_system_score_codex":0.000138045,"about_ca_system_score_gemma":0.00016771196,"threshold_uncertainty_score":0.81981516},"labels":[],"label_agreement":null},{"id":"W3140362340","doi":"10.18280/isi.260103","title":"ZRR-P2P: Zone-Based Mechanism for Data Replication and Research Optimization in Unstructured P2P Systems","year":2021,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Latency (audio); Replication (statistics); Distributed computing; Popularity; Peer-to-peer; Data sharing; Computer network; Process (computing); Operating system","score_opus":0.05932853051243653,"score_gpt":0.3103052794488706,"score_spread":0.25097674893643407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140362340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012584919,0.0001441325,0.9842325,0.0010766305,0.00031072763,0.0009939752,0.000045813715,0.00035905078,0.00025228434],"genre_scores_gemma":[0.6838679,0.000031179505,0.31496543,0.0001669559,0.000035865476,0.00029835867,0.0005913567,0.000011291667,0.000031683194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785155,0.00014564508,0.0006218567,0.00049717573,0.00047764851,0.00040610335],"domain_scores_gemma":[0.99645907,0.00022456981,0.00021492995,0.0019883555,0.0010381881,0.000074869706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020430242,0.00015756165,0.00022144472,0.0006308877,0.000281018,0.0009378801,0.001174053,0.00020207994,0.0000012917386],"category_scores_gemma":[0.0021383604,0.00016634232,0.00002019458,0.0017303961,0.00006648323,0.0034314839,0.00072600704,0.00018780945,0.000007423917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007609127,0.000053705127,0.000517215,0.0010619909,0.000041277315,0.00001035925,0.0037633807,0.21556593,0.0016339753,0.41626295,0.0043836124,0.3566295],"study_design_scores_gemma":[0.00044812812,0.00006968811,0.00030589677,0.0001905108,0.000004090722,0.000029271014,0.00042208662,0.9818304,0.0042476,0.010021665,0.0022421323,0.00018850599],"about_ca_topic_score_codex":0.000111399415,"about_ca_topic_score_gemma":0.000050251598,"teacher_disagreement_score":0.7662645,"about_ca_system_score_codex":0.00034376152,"about_ca_system_score_gemma":0.00026140775,"threshold_uncertainty_score":0.90439993},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W3141216681","doi":"10.1109/netgames.2010.5680187","title":"A protocol for distributed collision detection","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Lock (firearm); Collision; Protocol (science); Distributed computing; Server; Consistency (knowledge bases); Collision detection; Latency (audio); Real-time computing; Low latency (capital markets); Computer network; Artificial intelligence; Operating system; Computer security; Engineering","score_opus":0.022441006419015544,"score_gpt":0.3098257070414322,"score_spread":0.28738470062241667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141216681","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023042806,6.8953796e-8,0.90063953,0.0016156076,0.00018776565,0.093764246,0.000003169629,0.0011687832,0.0003165601],"genre_scores_gemma":[0.10741366,1.5466037e-8,0.36831525,0.00014616403,0.00006541194,0.5237512,0.0000016283535,0.0000072211847,0.00029943898],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992107,0.000007161041,0.00012795634,0.00028465994,0.00014028161,0.0002292385],"domain_scores_gemma":[0.9991757,0.00006452724,0.000039812585,0.0005425377,0.00012030584,0.000057093665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001976548,0.00008819095,0.00008171135,0.00007987195,0.000113869864,0.0001322618,0.0007791805,0.00010283045,0.0000063815137],"category_scores_gemma":[0.00021105612,0.00006974289,0.000035012887,0.000513348,0.000020396878,0.00020889056,0.00027653924,0.00012496051,0.00003515119],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009101732,0.00020767328,0.00030702644,0.000035641082,0.000013383411,0.000004678376,0.00007562728,0.0003224176,0.15201703,0.08708166,0.08970065,0.6701432],"study_design_scores_gemma":[0.0006749642,0.00035642437,0.0011143386,0.000008215941,0.0000012801244,0.00001019856,0.0000056124118,0.10983752,0.37251812,0.013234414,0.50203425,0.00020465093],"about_ca_topic_score_codex":0.000012604923,"about_ca_topic_score_gemma":0.0001729571,"teacher_disagreement_score":0.66993856,"about_ca_system_score_codex":0.000024486304,"about_ca_system_score_gemma":0.000025688969,"threshold_uncertainty_score":0.28440326},"labels":[],"label_agreement":null},{"id":"W3143349204","doi":"10.1109/netgames.2009.5446232","title":"FizzX: Multiplayer time manipulation in networked games","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multimedia; Human–computer interaction; Computer graphics (images)","score_opus":0.012215192592573814,"score_gpt":0.23762749689881818,"score_spread":0.22541230430624437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143349204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2221355,0.00014705607,0.72904557,0.019830722,0.00032615534,0.00058050174,4.922515e-7,0.0031531597,0.024780866],"genre_scores_gemma":[0.86213666,0.0000034376635,0.13454144,0.0011528268,0.000043536853,0.000007437645,0.0000017118582,0.0000045018514,0.002108458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988498,0.000026606855,0.0002089739,0.0003604254,0.00019593356,0.0003582267],"domain_scores_gemma":[0.9992494,0.00005789195,0.000037333113,0.00057205296,0.00003137669,0.000051969964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020304367,0.00012967148,0.00014771946,0.00020432522,0.00003602639,0.00009776029,0.00088108756,0.00009885902,0.000028037994],"category_scores_gemma":[0.000046588535,0.00011722734,0.0000314682,0.00082351844,0.000012516046,0.00036188186,0.00019713031,0.00012320856,0.00044255596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017333246,0.00013078953,0.0047091623,0.000002336253,0.000008651812,0.000059535952,0.00036400417,0.06951677,0.002374972,0.041314237,0.07307259,0.8084296],"study_design_scores_gemma":[0.00030666453,0.00010731758,0.112095445,0.000023539857,0.0000012872964,0.000007452755,0.000006968158,0.8662718,0.0010787809,0.012411412,0.0074129063,0.00027644643],"about_ca_topic_score_codex":0.00001931437,"about_ca_topic_score_gemma":0.000038566242,"teacher_disagreement_score":0.80815315,"about_ca_system_score_codex":0.000057213136,"about_ca_system_score_gemma":0.000012835652,"threshold_uncertainty_score":0.5688309},"labels":[],"label_agreement":null},{"id":"W3145352456","doi":"10.1109/iwqos.2011.5931242","title":"On long-term social relationships in peer-to-peer systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"BitTorrent; PlanetLab; Computer science; Upload; Software deployment; Peer-to-peer; Term (time); File sharing; The Internet; Social network (sociolinguistics); Set (abstract data type); World Wide Web; Internet privacy; Social media","score_opus":0.08871505342169277,"score_gpt":0.2798284344872455,"score_spread":0.1911133810655527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145352456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4984858,0.000034257864,0.40583986,0.017208556,0.0015918048,0.0009394481,0.0000052343416,0.0023084779,0.07358657],"genre_scores_gemma":[0.9703024,5.0933846e-7,0.019451685,0.00042618395,0.00007974516,0.00008784822,0.0000026237424,0.000016445329,0.00963254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976664,0.00011109523,0.0003541674,0.00057817553,0.0007611824,0.000528948],"domain_scores_gemma":[0.9986162,0.00014902714,0.00006816407,0.0008094184,0.00023051957,0.00012662963],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010262394,0.00020915724,0.00024127802,0.00052988384,0.00017359815,0.00017621845,0.0017741668,0.00021835238,0.000025370184],"category_scores_gemma":[0.00044462935,0.00019255183,0.000054067717,0.0012653602,0.000041689855,0.00032854476,0.0005789757,0.00043307155,0.0012929636],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002461072,0.00019423285,0.07200059,0.000015753587,0.000021831705,0.000114576455,0.0052664718,0.0004664389,0.000053646745,0.8115885,0.09685757,0.013395766],"study_design_scores_gemma":[0.0006108384,0.00038224706,0.96963066,0.00011905266,0.000008316407,0.000028155517,0.00030775822,0.005304089,0.0007169855,0.01774171,0.004232197,0.00091798196],"about_ca_topic_score_codex":0.00012991387,"about_ca_topic_score_gemma":0.0003549758,"teacher_disagreement_score":0.8976301,"about_ca_system_score_codex":0.00017488858,"about_ca_system_score_gemma":0.000046914236,"threshold_uncertainty_score":0.99948466},"labels":[],"label_agreement":null},{"id":"W3146793828","doi":"10.1109/tnsm.2021.3071025","title":"Optimizing All-to-All Data Transmission in WANs","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Multicast; Distributed computing; Data transmission; Throughput; Transmission (telecommunications); Overlay network; Latency (audio); Wireless; The Internet","score_opus":0.041715607435522745,"score_gpt":0.27082771030052577,"score_spread":0.22911210286500303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146793828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014472023,0.00020948154,0.96213305,0.03323243,0.00041251964,0.00041791456,0.0000069202583,0.00038184205,0.0017586445],"genre_scores_gemma":[0.18983223,0.0023806137,0.778986,0.027802562,0.00008357025,0.0001481589,0.000026279049,0.000045466273,0.000695138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976805,0.00007660427,0.00031991513,0.0009854694,0.00033798954,0.0005995142],"domain_scores_gemma":[0.99808055,0.000069396585,0.000033379783,0.0015829939,0.00004414065,0.00018955629],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038067636,0.0002516454,0.00024929346,0.00024785454,0.00016945186,0.00021849472,0.0016250076,0.0000968335,0.00001735396],"category_scores_gemma":[7.9381323e-7,0.00026226137,0.000039199353,0.0018770227,0.0000117232175,0.0003418707,0.0001256874,0.00029020867,0.000046443918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002205111,0.00012754298,0.0000034438035,0.000053657623,0.00008658313,0.00014589672,0.0006945741,0.55718184,0.00006989143,0.0006356836,0.0033357607,0.43764308],"study_design_scores_gemma":[0.0009760015,0.00015183887,0.00033867758,0.0004526537,0.00011272577,0.000022338703,0.00048416175,0.59495646,0.00069241674,0.0010014047,0.4000723,0.00073904323],"about_ca_topic_score_codex":0.000054844364,"about_ca_topic_score_gemma":0.001008155,"teacher_disagreement_score":0.43690404,"about_ca_system_score_codex":0.00006604598,"about_ca_system_score_gemma":0.000024757881,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W3147854311","doi":"10.22215/etd/2015-10987","title":"Decentralized Social Data Sharing","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Viewpoints; Data sharing; Distributed computing; Architecture; Class (philosophy); Systems architecture; Data science; Artificial intelligence","score_opus":0.12335755491383162,"score_gpt":0.3769888168122446,"score_spread":0.253631261898413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147854311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06787293,0.0037437696,0.4824172,0.024779506,0.021522602,0.0034456474,0.00024894,0.026153246,0.36981618],"genre_scores_gemma":[0.08113184,0.00019143266,0.81147546,0.0017239378,0.0011823551,0.00017143539,0.010621253,0.00020540826,0.09329688],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976294,0.00001689871,0.00027654564,0.0010629451,0.0005581859,0.0004560031],"domain_scores_gemma":[0.99722034,0.000023412527,0.00012478558,0.0023626375,0.000167769,0.00010108654],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00041343883,0.000251916,0.00031476782,0.00019424227,0.0001141784,0.00042784194,0.011378533,0.00034269676,0.000028452621],"category_scores_gemma":[0.00018996742,0.0002427456,0.000043250115,0.0006116683,0.000014161091,0.0004940986,0.002651021,0.00030704925,0.00027815864],"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.000013841539,0.000028513057,0.00005426515,0.00002568126,0.00005082536,0.000021045737,0.0008486878,0.0000075587127,0.00008645796,0.044830836,0.71765476,0.2363775],"study_design_scores_gemma":[0.0014186151,0.00012363715,0.0049307863,0.0002507158,0.00011827493,0.000017724722,0.0013162608,0.05627686,0.0022406585,0.17014965,0.76009536,0.0030614245],"about_ca_topic_score_codex":0.00008647426,"about_ca_topic_score_gemma":0.00077882665,"teacher_disagreement_score":0.3290583,"about_ca_system_score_codex":0.00010050423,"about_ca_system_score_gemma":0.00020128525,"threshold_uncertainty_score":0.9939704},"labels":[],"label_agreement":null},{"id":"W3147931924","doi":"10.1109/netgames.2011.6080977","title":"AntReckoning: Dead reckoning using interest modeling by pheromones","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dead reckoning; Computer science; Motion (physics); Inertia; Quake (natural phenomenon); Artificial intelligence; Simulation; Telecommunications; Global Positioning System","score_opus":0.17279109879679933,"score_gpt":0.27807542272553776,"score_spread":0.10528432392873843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147931924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25937125,0.00024367709,0.73489517,0.00025163774,0.00025806966,0.00008632238,5.85173e-7,0.0011886103,0.0037046995],"genre_scores_gemma":[0.58228785,0.000005722139,0.4173512,0.00015939116,0.00002064489,0.00000490117,4.982696e-7,0.000013165844,0.00015664053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831545,0.000035597564,0.0003051861,0.00058488146,0.0001913037,0.00056760036],"domain_scores_gemma":[0.99889,0.00003846241,0.000073046656,0.0007905852,0.00008763607,0.000120298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027716593,0.00022568913,0.00022183354,0.00018240557,0.00016194352,0.0001736214,0.0017599316,0.00012226429,0.000024471941],"category_scores_gemma":[0.00008027549,0.00020825912,0.000055495417,0.00062644074,0.000041779705,0.0006736206,0.0010743052,0.00021680824,0.00007213812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090254274,0.0005529119,0.009048515,0.000051773804,0.00026622764,0.00027374263,0.012599306,0.0147875585,0.087891124,0.15389554,0.019946877,0.70059615],"study_design_scores_gemma":[0.000119854296,0.00007512952,0.000025384701,0.000078397185,0.0000059407607,0.000031816908,0.0002075135,0.96226484,0.03177301,0.0046262206,0.00042271893,0.00036917016],"about_ca_topic_score_codex":0.0004035866,"about_ca_topic_score_gemma":0.00007040789,"teacher_disagreement_score":0.9474773,"about_ca_system_score_codex":0.00007119295,"about_ca_system_score_gemma":0.000032740074,"threshold_uncertainty_score":0.8492561},"labels":[],"label_agreement":null},{"id":"W3150637988","doi":"10.1109/netgames.2011.6080990","title":"What &amp;#x002B; when &amp;#x003D; how: The timelines approach to consistency in networked games","year":2011,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Timeline; Computer science; Consistency (knowledge bases); Artificial intelligence; Mathematics","score_opus":0.0909444583951994,"score_gpt":0.25391418634652096,"score_spread":0.16296972795132156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150637988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020770015,0.0017246208,0.8940574,0.036989488,0.0019217094,0.0015065941,0.0000022499214,0.0021276642,0.04090029],"genre_scores_gemma":[0.14654389,0.00014266833,0.81829196,0.0054396233,0.00019937847,0.0003147376,0.0000058570176,0.000040897965,0.029021002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969063,0.00016974326,0.00046816404,0.0010021382,0.00050551345,0.0009481665],"domain_scores_gemma":[0.9966916,0.0002023728,0.0001119055,0.0026012363,0.00019182585,0.00020107997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009966993,0.000410397,0.00045178705,0.00035917462,0.00016813794,0.0007348013,0.004225854,0.00021062716,0.0000552982],"category_scores_gemma":[0.00029384106,0.00027734556,0.000118618125,0.001664896,0.00019851606,0.001058576,0.0019137361,0.0003847237,0.0005360414],"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.000055789857,0.0004973037,0.0051101423,0.00003049514,0.00010970187,0.000011430739,0.02029444,0.0014280861,0.00020404857,0.08965278,0.684335,0.19827078],"study_design_scores_gemma":[0.0007063952,0.00020562903,0.008346721,0.0002101945,0.00003070798,0.00010131472,0.0024829325,0.013205645,0.00047892952,0.05021692,0.92232937,0.0016852448],"about_ca_topic_score_codex":0.00021991158,"about_ca_topic_score_gemma":0.0013817848,"teacher_disagreement_score":0.23799436,"about_ca_system_score_codex":0.00007122748,"about_ca_system_score_gemma":0.000080221,"threshold_uncertainty_score":0.9999679},"labels":[],"label_agreement":null},{"id":"W3151243716","doi":"10.1109/netgames.2010.5680282","title":"Scaling online games with adaptive interest management in the cloud","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cloud computing; Scalability; Server; Testbed; Host (biology); Distributed computing; Computer network; Operating system","score_opus":0.027585710633245143,"score_gpt":0.2586255758810509,"score_spread":0.23103986524780576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151243716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722515,0.00001895821,0.40028104,0.016657857,0.00033533038,0.0003781621,0.0000010455302,0.000546426,0.009529644],"genre_scores_gemma":[0.728938,0.0000029874939,0.2698406,0.00092602195,0.00003917206,0.000018512046,4.823125e-7,0.0000039946353,0.00023022946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991006,0.000022926666,0.00012566845,0.00030201292,0.00019224927,0.00025653193],"domain_scores_gemma":[0.99905676,0.00008809315,0.000030618445,0.00076725846,0.000028743725,0.000028530236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002806808,0.00011263373,0.00009445757,0.0001333457,0.00004126097,0.00012214488,0.0020099133,0.000040784133,0.000005337187],"category_scores_gemma":[0.000020430865,0.00006311946,0.000018168417,0.0006283648,0.00006644048,0.0001454285,0.00066773366,0.0003203702,0.00003190514],"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.000015535341,0.00014836079,0.000676641,0.000003922679,0.000025529172,0.00012368809,0.00091737666,0.0003771297,0.00009426356,0.6066814,0.004586076,0.3863501],"study_design_scores_gemma":[0.0036679762,0.0022406112,0.17330758,0.0005751229,0.00006379967,0.0003711886,0.022249324,0.38689244,0.007993497,0.13040532,0.26925293,0.0029802106],"about_ca_topic_score_codex":0.000040837236,"about_ca_topic_score_gemma":0.0024453443,"teacher_disagreement_score":0.47627607,"about_ca_system_score_codex":0.000015980533,"about_ca_system_score_gemma":0.000009376418,"threshold_uncertainty_score":0.37349528},"labels":[],"label_agreement":null},{"id":"W3157791361","doi":"10.1109/jiot.2021.3074823","title":"Centipede: Leveraging the Distributed Camera Crowd for Cooperative Video Data Storage","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Centipede; Distributed data store; Distributed database; Computer graphics (images); Multimedia; Database","score_opus":0.04931258291752986,"score_gpt":0.29473405934944963,"score_spread":0.24542147643191978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157791361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052375074,0.00045797418,0.931615,0.013198853,0.0019451082,0.00015732147,0.00005860667,0.00011358891,0.00007847832],"genre_scores_gemma":[0.92870325,0.000035559635,0.06872544,0.0014072692,0.00021999315,0.000008657936,0.000020093019,0.000017880424,0.0008618636],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802756,0.00011820536,0.000504508,0.0004670017,0.000453968,0.000428736],"domain_scores_gemma":[0.99734795,0.00034681032,0.00034770338,0.0012103715,0.0006418678,0.00010527474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011140552,0.00019831803,0.0003039692,0.000101135265,0.00021897281,0.00083197677,0.005099275,0.00007942745,0.000021158588],"category_scores_gemma":[0.0009019991,0.00014684554,0.00011295788,0.00045446257,0.00010450817,0.0012362135,0.0016525047,0.0006537905,0.000008984058],"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.00009162227,0.00021491597,0.0004819546,0.000053948974,0.000629661,0.00050697406,0.01092309,0.0070236996,0.01973487,0.005815317,0.8892854,0.065238535],"study_design_scores_gemma":[0.0015831874,0.00039754336,0.00059897883,0.0007625562,0.00008752814,0.0024118004,0.0014968992,0.5498274,0.19091241,0.007307357,0.24380188,0.00081243715],"about_ca_topic_score_codex":0.0000434948,"about_ca_topic_score_gemma":0.000016722775,"teacher_disagreement_score":0.8763282,"about_ca_system_score_codex":0.00012524334,"about_ca_system_score_gemma":0.00020831838,"threshold_uncertainty_score":0.94758064},"labels":[],"label_agreement":null},{"id":"W3171122199","doi":"10.1080/13658816.2021.1931236","title":"Decentralized geoprivacy: leveraging social trust on the distributed web","year":2021,"lang":"en","type":"article","venue":"International Journal of Geographical Information Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"World Wide Web; Computer science; Internet privacy; Data science; Social web; Web 2.0; Business; Social media; Web service; Knowledge management","score_opus":0.020240897758175933,"score_gpt":0.26013055623256337,"score_spread":0.23988965847438742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171122199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29466256,0.00017630192,0.58607286,0.11131965,0.005751358,0.00026752267,0.00007685938,0.00024730558,0.0014255879],"genre_scores_gemma":[0.9967815,0.000046572153,0.0011704975,0.0017353358,0.00022213142,0.000009020678,0.00001814434,0.0000039718334,0.000012803758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727696,0.00012582824,0.00087684806,0.00011206664,0.0013657914,0.00024252397],"domain_scores_gemma":[0.99721384,0.0002316516,0.00057678,0.00026430082,0.0016186144,0.00009481292],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008389561,0.00013913217,0.00022313054,0.0004285243,0.00016334154,0.0010376052,0.002019866,0.00010265676,0.000015470372],"category_scores_gemma":[0.00055782875,0.00009867722,0.00021200486,0.00089960214,0.000055729783,0.0011718917,0.00035997733,0.00040724457,0.000046447094],"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.00018627608,0.00022518456,0.012219103,0.000024961852,0.0010205974,0.00021082908,0.0023352331,0.011452619,0.00042838082,0.8293145,0.09459916,0.047983184],"study_design_scores_gemma":[0.0025859976,0.0001838282,0.044570472,0.00040296058,0.00003158468,0.001407218,0.0017167495,0.0756362,0.0012128978,0.0070407996,0.86464864,0.0005626541],"about_ca_topic_score_codex":0.000009893733,"about_ca_topic_score_gemma":0.0000015123509,"teacher_disagreement_score":0.8222737,"about_ca_system_score_codex":0.00012952168,"about_ca_system_score_gemma":0.00014849448,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W3182678540","doi":"10.11575/prism/37168","title":"Closed Loop Cryptocurrency Mining in Alberta","year":2019,"lang":"en","type":"article","venue":"Open MIND","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cryptocurrency; Loop (graph theory); Computer science; Business; Geology; Computer security; Mathematics","score_opus":0.031026233044525352,"score_gpt":0.2950331718660707,"score_spread":0.26400693882154536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182678540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93427116,0.000036792728,0.0024847605,0.0030100462,0.00040578403,0.00058302545,0.0000011532545,0.000013659055,0.0591936],"genre_scores_gemma":[0.8103029,0.0000018429985,0.18134122,0.00013526288,0.000018460705,0.000026456248,0.0000021895144,0.00000850524,0.008163153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986206,0.000031443564,0.00022619039,0.0005566208,0.00018525976,0.00037985368],"domain_scores_gemma":[0.9987518,0.00014147136,0.00006428843,0.00095139496,0.00002888234,0.00006212509],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030385327,0.0001359218,0.00021109273,0.00016527741,0.000031963627,0.00033230352,0.003542476,0.00008793356,0.0003292794],"category_scores_gemma":[0.000106892505,0.00013210073,0.000026369135,0.0007971594,0.000020248139,0.0005706375,0.001968607,0.00015121339,0.0037211026],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087374965,0.00006483305,0.022972217,0.0000032285825,0.000007923988,0.000026221893,0.0016227042,0.00019596053,0.00068574847,0.0020532305,0.0037482446,0.96861094],"study_design_scores_gemma":[0.0045402283,0.0010335488,0.07673855,0.0007991884,0.00001568274,0.00004516142,0.00082834094,0.08270499,0.028718254,0.008185255,0.7937614,0.0026294263],"about_ca_topic_score_codex":0.00023039254,"about_ca_topic_score_gemma":0.00084176275,"teacher_disagreement_score":0.96598154,"about_ca_system_score_codex":0.000046089674,"about_ca_system_score_gemma":0.000085166765,"threshold_uncertainty_score":0.99705464},"labels":[],"label_agreement":null},{"id":"W3206675275","doi":"10.1145/3463676.3485612","title":"Do You Feel a Chill?","year":2021,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Node (physics); Overhead (engineering); Computer network; Hash function; Distributed hash table; Encryption; Bandwidth (computing); Hash table; Private information retrieval; Server; Peer-to-peer; Distributed computing; Computer security; Operating system","score_opus":0.015943828570085222,"score_gpt":0.2442595254471804,"score_spread":0.2283156968770952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206675275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031465553,0.00040431102,0.7807276,0.06141827,0.00071529835,0.00012521331,0.0000014629464,0.0027309542,0.122411326],"genre_scores_gemma":[0.51428074,0.000014712514,0.46604303,0.003288136,0.000075105,0.000017756223,0.0000011519801,0.000008608345,0.016270796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989883,0.000015644955,0.00009698954,0.0004037006,0.00021438886,0.0002809813],"domain_scores_gemma":[0.9987888,0.00003281417,0.000018617027,0.0010162921,0.00007546784,0.00006801247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010948914,0.00009279866,0.00010953907,0.0000707118,0.000059522125,0.00020595774,0.0011044155,0.00006005506,0.000056720306],"category_scores_gemma":[0.000101897924,0.0000766387,0.00004286075,0.00085916,0.00002048182,0.00017585687,0.0011616625,0.00010771732,0.0004836277],"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.0000010763093,0.000059420334,0.0010918058,0.0000041476446,0.000020594915,0.00019260799,0.000262746,0.00011462948,0.0011025657,0.43017998,0.1645131,0.40245733],"study_design_scores_gemma":[0.0005280266,0.00014487945,0.013848951,0.00004686674,0.0000076630795,0.00028238478,0.00026524856,0.016595788,0.05955705,0.053086042,0.85475045,0.00088663975],"about_ca_topic_score_codex":0.000007262976,"about_ca_topic_score_gemma":0.000020838064,"teacher_disagreement_score":0.69023734,"about_ca_system_score_codex":0.000025957806,"about_ca_system_score_gemma":0.00005309091,"threshold_uncertainty_score":0.6216217},"labels":[],"label_agreement":null},{"id":"W32663231","doi":"10.4018/978-1-60566-697-6.ch008","title":"The PADRES Publish/Subscribe System","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in systems analysis, software engineering, and high performance computing book series","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Publication; Distributed computing; Redundancy (engineering); Provisioning; Locality; Robustness (evolution); Computer network; Database; Operating system","score_opus":0.003824299307387374,"score_gpt":0.18664912065554468,"score_spread":0.1828248213481573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32663231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00659587,0.21605474,0.74542516,0.0005162515,0.0122107575,0.0021561915,0.00007750614,0.008346514,0.008616992],"genre_scores_gemma":[0.77540785,0.037737172,0.10161962,0.00016836688,0.0022258759,0.0003562832,0.00013987802,0.00039545092,0.081949495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959405,0.000030877716,0.0011931282,0.0011588727,0.0007558987,0.0009207225],"domain_scores_gemma":[0.9966201,0.0004867782,0.0006279363,0.0017694168,0.00031347564,0.00018230225],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093941716,0.0008772543,0.0013792629,0.0010853284,0.0007550909,0.0013122642,0.0024571142,0.00054714637,0.0000020972332],"category_scores_gemma":[0.00014194557,0.0007130253,0.00021568788,0.0007696936,0.00028008412,0.0022130886,0.0011817367,0.0012534776,0.000015728125],"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.000025338872,0.000015866524,0.004073822,0.0017836875,0.001112212,0.000100504236,0.000760737,0.3622957,0.0000104058445,0.5888419,0.0006314141,0.040348392],"study_design_scores_gemma":[0.00020015806,0.00014628914,0.0015268694,0.0014203847,0.00019500007,0.00010948056,0.00007862738,0.10040058,0.00003336767,0.00018073588,0.8944084,0.0013000864],"about_ca_topic_score_codex":0.00006645156,"about_ca_topic_score_gemma":0.00022778209,"teacher_disagreement_score":0.893777,"about_ca_system_score_codex":0.00025216103,"about_ca_system_score_gemma":0.00008378155,"threshold_uncertainty_score":0.99972445},"labels":[],"label_agreement":null},{"id":"W32820099","doi":"10.1126/science.369.6506.890","title":"CanLit(e): Fi for Export?","year":2000,"lang":"en","type":"article","venue":"Essays on Canadian writing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Art","score_opus":0.0163042337129063,"score_gpt":0.24087049189970194,"score_spread":0.22456625818679565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32820099","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32443643,0.000529248,0.049188636,0.12643723,0.0015851839,0.0024651538,0.00033649616,0.0038415794,0.49118003],"genre_scores_gemma":[0.9517826,0.000004848479,0.040005762,0.005582461,0.00021607683,0.00011639052,0.000008251854,0.000024405628,0.002259212],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982011,0.000018933224,0.00023089779,0.0004951404,0.00019915777,0.00085479685],"domain_scores_gemma":[0.9986511,0.00013036252,0.000036581976,0.0006866921,0.000061252154,0.00043403014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034475664,0.00016722338,0.00016745397,0.00027965163,0.0003200914,0.00021607056,0.0012114416,0.00010735821,0.0000963814],"category_scores_gemma":[0.00012150171,0.00019035746,0.000059053775,0.0005173447,0.000030217769,0.00019835841,0.00005193671,0.00017397109,0.00019034446],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028825596,0.000009534997,0.00046376645,0.000008229371,0.000009246236,0.000105630665,0.00021712155,0.0004843626,0.000023664279,0.07057638,0.07377121,0.854328],"study_design_scores_gemma":[0.0005881148,0.00030321148,0.004515647,0.00021477656,0.0000076007077,0.00006036435,0.00023711179,0.024258383,0.0012848031,0.016564963,0.9509312,0.0010338058],"about_ca_topic_score_codex":0.019592933,"about_ca_topic_score_gemma":0.101783335,"teacher_disagreement_score":0.87716,"about_ca_system_score_codex":0.00029427742,"about_ca_system_score_gemma":0.00030991243,"threshold_uncertainty_score":0.9869357},"labels":[],"label_agreement":null},{"id":"W34149404","doi":"10.3389/fphar.2021.625785","title":"A Distributed Management Framework for H.323-Based VoIP System.","year":2003,"lang":"en","type":"article","venue":"Communications in Computing","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Voice over IP; Computer science; Telecommunications; Business; Computer security; Operating system; The Internet","score_opus":0.05072240476573581,"score_gpt":0.3301386135403086,"score_spread":0.2794162087745728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34149404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011007193,0.0003544242,0.9905959,0.0033698727,0.00024449668,0.0007442489,0.000008164897,0.0009585801,0.0026236305],"genre_scores_gemma":[0.4940751,0.000003769826,0.5056488,0.00014014599,0.0000063898588,0.000101747835,0.0000103467,0.000007740963,0.0000059772747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836326,0.00019573836,0.00043351343,0.00039666385,0.00017391561,0.00043688712],"domain_scores_gemma":[0.9943445,0.0012336603,0.00014322778,0.0041096383,0.00011475026,0.000054275315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010294617,0.00016711223,0.00022105205,0.0002887523,0.00041951842,0.00017827064,0.004745751,0.00010636346,4.1590005e-7],"category_scores_gemma":[0.00046059326,0.00018801668,0.000066790686,0.0017638779,0.0000741037,0.00009204065,0.0014859965,0.0003084195,0.000025524754],"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.000001501951,0.00008365622,0.0006635868,0.00004845511,0.000014066767,0.0000029552614,0.00012894423,0.014409252,0.0000035877276,0.9582354,0.0006813886,0.025727209],"study_design_scores_gemma":[0.00046725888,0.000042175663,0.0011809769,0.0006832861,0.000010462535,0.000008377176,0.00039680983,0.9401628,0.00015372677,0.03020002,0.026340282,0.00035387336],"about_ca_topic_score_codex":0.000007499401,"about_ca_topic_score_gemma":0.000009904825,"teacher_disagreement_score":0.9280354,"about_ca_system_score_codex":0.0002989272,"about_ca_system_score_gemma":0.000046159446,"threshold_uncertainty_score":0.88188654},"labels":[],"label_agreement":null},{"id":"W34978445","doi":"10.1021/acs.est.1c05475","title":"On the convergent detection of crashed regions in overlay networks","year":2009,"lang":"en","type":"article","venue":"Environmental Science & Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"State Administration of Foreign Experts Affairs; Ministry of Science and Technology of the People's Republic of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Overlay; Correctness; Computer science; Service (business); Overlay network; Neighbourhood (mathematics); Computer network; Distributed computing; Mathematics; Algorithm; Operating system; Economy; Economics; The Internet","score_opus":0.006333292309367589,"score_gpt":0.2057217488389894,"score_spread":0.1993884565296218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34978445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86071783,0.00008670011,0.122476555,0.01531529,0.00023781628,0.00036745833,7.5520774e-7,0.00033868814,0.00045892474],"genre_scores_gemma":[0.99754816,0.00004127107,0.0017390185,0.00059103436,0.000008036575,0.000029609906,2.0208063e-7,0.000004125993,0.000038542086],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981954,0.000028656927,0.00025409175,0.0005752523,0.00041475188,0.0005318185],"domain_scores_gemma":[0.99866223,0.00006712117,0.00011248685,0.0010953706,0.000007003882,0.000055776545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051114516,0.00015610534,0.00016560032,0.0007466654,0.00021570809,0.000029569585,0.002604349,0.00015536878,0.000009551975],"category_scores_gemma":[0.0001236907,0.00012022293,0.000038919785,0.003247707,0.0011185341,0.0002288445,0.00062815996,0.0003546574,0.000041275343],"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.000019801482,0.0006308698,0.003284503,9.993358e-7,0.000006949553,0.000031591077,0.00027723325,0.014285918,0.41544542,0.34055603,0.0006127346,0.22484794],"study_design_scores_gemma":[0.0008747048,0.002383114,0.15453759,0.00007107046,0.0000071253035,0.00008262691,0.00048811178,0.09417532,0.6016322,0.14049429,0.004518356,0.00073548395],"about_ca_topic_score_codex":0.000008655044,"about_ca_topic_score_gemma":0.000017038281,"teacher_disagreement_score":0.22411247,"about_ca_system_score_codex":0.00034620063,"about_ca_system_score_gemma":0.000022311586,"threshold_uncertainty_score":0.4902549},"labels":[],"label_agreement":null},{"id":"W365329668","doi":"","title":"Latency reduction in online multiplayer games using detour routing","year":2010,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Latency (audio); Reduction (mathematics); Computer science; Advertising; Routing (electronic design automation); Computer network; Telecommunications; Business; Mathematics","score_opus":0.01825145478000775,"score_gpt":0.24341282406707473,"score_spread":0.22516136928706698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W365329668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99038476,0.000074978656,0.0054587196,0.0002325868,0.0017688762,0.00036005548,0.000014450613,0.00064727385,0.0010583224],"genre_scores_gemma":[0.9443082,0.00006280957,0.049344726,0.0000351145,0.00016618462,0.0000014707857,0.000200264,0.000046675235,0.0058345296],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976463,0.000078121535,0.00033599633,0.00096866285,0.00037691003,0.0005940171],"domain_scores_gemma":[0.9984008,0.000057154906,0.0003111962,0.0008726115,0.00022808986,0.00013014858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018585344,0.0004233689,0.00043007816,0.0018826902,0.00020874558,0.0001218919,0.0020172514,0.0008384944,0.00001307282],"category_scores_gemma":[0.0001226325,0.0005191616,0.00013902887,0.002520231,0.00004487345,0.00079221744,0.00039918523,0.0012935004,0.00003080448],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006906126,0.0016683043,0.50533986,0.00045346125,0.0004773197,0.0039280984,0.0029090554,0.028690865,0.011134376,0.010521141,0.014852406,0.41933453],"study_design_scores_gemma":[0.0092319865,0.00091854,0.08264656,0.005630595,0.0007499824,0.0000014358122,0.26214796,0.32672042,0.09884976,0.0068782712,0.1934958,0.012728693],"about_ca_topic_score_codex":0.00086923526,"about_ca_topic_score_gemma":0.12896425,"teacher_disagreement_score":0.42269325,"about_ca_system_score_codex":0.00039583867,"about_ca_system_score_gemma":0.00023235856,"threshold_uncertainty_score":0.999726},"labels":[],"label_agreement":null},{"id":"W37591264","doi":"10.1007/978-1-4020-6270-4_50","title":"Internet Topology Based Identifier Assignment for Tree-based DHTs","year":2007,"lang":"en","type":"book-chapter","venue":"New Technologies, Mobility and Security","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 British Columbia","funders":"","keywords":"Computer science; Computer network; Routing table; Identifier; IP forwarding; Distributed computing; Node (physics); Overlay network; Routing (electronic design automation); Routing protocol; Internet topology; Static routing; Network topology; The Internet; Topology (electrical circuits); Engineering","score_opus":0.04509156991136092,"score_gpt":0.2689393569985968,"score_spread":0.22384778708723585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37591264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010807549,0.0024469052,0.9538723,0.013293718,0.0012155673,0.0032882283,0.00014698066,0.007803776,0.016851755],"genre_scores_gemma":[0.5560591,0.00039594,0.34779716,0.005150029,0.00043472592,0.0011537473,0.0003104805,0.0002843165,0.08841445],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995275,0.000038469818,0.00089976063,0.002185824,0.0005938663,0.0010070573],"domain_scores_gemma":[0.99541837,0.0007031803,0.00041562854,0.0030344026,0.00022478211,0.0002036288],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012171201,0.00087722234,0.001089402,0.0008828555,0.00018774993,0.00023910661,0.0035491055,0.0026271916,0.000050208608],"category_scores_gemma":[0.00058598723,0.0008607368,0.00034138223,0.00028670437,0.00093846343,0.0002149982,0.001877233,0.0013746493,0.000035821005],"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.00016377741,0.00021596847,0.00017965895,0.00023084933,0.000116211595,0.00007912992,0.000105471765,0.000029280089,0.000058610218,0.46840864,0.043087114,0.48732528],"study_design_scores_gemma":[0.0010053632,0.0009521085,0.00009470698,0.00018646415,0.000058124064,0.000009988547,0.000031305844,0.0070468797,0.007479249,0.5296211,0.4525002,0.0010145009],"about_ca_topic_score_codex":0.00014372503,"about_ca_topic_score_gemma":0.0015388264,"teacher_disagreement_score":0.60607517,"about_ca_system_score_codex":0.0005524819,"about_ca_system_score_gemma":0.00037565478,"threshold_uncertainty_score":0.99938434},"labels":[],"label_agreement":null},{"id":"W4085598","doi":"10.1007/978-3-540-79232-1_1","title":"The Flattening Internet Topology: Natural Evolution, Unsightly Barnacles or Contrived Collapse?","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":145,"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":"Internet topology; The Internet; Internet service provider; traceroute; Service provider; Computer science; Network topology; Provisioning; Computer network; Computer security; World Wide Web; Topology (electrical circuits); Internet privacy; Service (business); Engineering; Business","score_opus":0.014140061480717002,"score_gpt":0.23681750338603821,"score_spread":0.2226774419053212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4085598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041096477,0.0029588398,0.98083276,0.008198198,0.0051776827,0.0006771964,0.0000039127867,0.00073692517,0.001003513],"genre_scores_gemma":[0.6279723,0.00029335072,0.36090022,0.004046764,0.0008748794,0.00004745261,0.0000047871067,0.000070198956,0.0057900576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947272,0.000082357976,0.0007761546,0.0019137659,0.0012041696,0.0012963716],"domain_scores_gemma":[0.9948393,0.0018577365,0.000404222,0.0021186315,0.00057850115,0.00020161938],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00092148804,0.00075847335,0.0007482146,0.0009542384,0.00089556683,0.00082626974,0.00911589,0.0005362134,0.000008764919],"category_scores_gemma":[0.00070571294,0.00050581887,0.00017174102,0.0014362539,0.002434082,0.00054563157,0.0042821434,0.0015908086,0.000092451904],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001002721,0.000033609595,0.00021817687,0.00002113468,0.00010189685,0.0010624168,0.0022890484,0.01566518,0.00025563032,0.08653336,0.012187658,0.8815316],"study_design_scores_gemma":[0.0011408483,0.0009465642,0.0012427679,0.00093546504,0.00002897994,0.0019271976,0.0000032642668,0.7000927,0.0026987693,0.16955274,0.118834905,0.0025958205],"about_ca_topic_score_codex":0.000059885584,"about_ca_topic_score_gemma":0.0009966627,"teacher_disagreement_score":0.8789358,"about_ca_system_score_codex":0.000873018,"about_ca_system_score_gemma":0.00093986996,"threshold_uncertainty_score":0.99973935},"labels":[],"label_agreement":null},{"id":"W4205220712","doi":"10.32920/ryerson.14657298","title":"Peer-To-Peer Multimedia And Information Sharing In Social Networking Web Sites","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Network topology; Overlay network; Peer-to-peer; World Wide Web; Multimedia; Overlay; Social network (sociolinguistics); Information sharing; Computer network; Social media; The Internet","score_opus":0.028339151216880375,"score_gpt":0.2732190970398182,"score_spread":0.24487994582293784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205220712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5268553,0.00044170962,0.3718603,0.07495319,0.004138728,0.0019329855,0.000024589226,0.0038073536,0.015985856],"genre_scores_gemma":[0.7300527,0.000035738758,0.2667131,0.0016364417,0.00048131862,0.00014770307,0.000098485245,0.000022433422,0.0008120668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669105,0.000046468966,0.0006456548,0.0008915703,0.001016227,0.0007090233],"domain_scores_gemma":[0.998074,0.0001351566,0.00018649043,0.00090498786,0.0005457027,0.00015368513],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011880345,0.00042238025,0.0005277555,0.0008293078,0.00016628012,0.0017939111,0.0022468586,0.00057938736,0.000013485665],"category_scores_gemma":[0.000551105,0.00045398925,0.00009032937,0.0012175931,0.000047567453,0.0013523697,0.013535143,0.0010684466,0.000058976642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022155178,0.0000898274,0.037230365,0.0002537607,0.00012392136,0.00010163855,0.027980145,0.02468495,0.0004386358,0.010397903,0.08033103,0.81834567],"study_design_scores_gemma":[0.0004944131,0.00003902724,0.026619261,0.00035084144,0.000014245793,0.000013762872,0.0006665889,0.9236655,0.00031823042,0.003898266,0.042708777,0.001211076],"about_ca_topic_score_codex":0.00014075737,"about_ca_topic_score_gemma":0.0005582511,"teacher_disagreement_score":0.89898056,"about_ca_system_score_codex":0.00023861333,"about_ca_system_score_gemma":0.00016170675,"threshold_uncertainty_score":0.9997912},"labels":[],"label_agreement":null},{"id":"W4206253804","doi":"10.1007/3-540-45111-0","title":"Distributed Communities on the Web","year":2000,"lang":"en","type":"book","venue":"Lecture notes in computer science","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":"Université Laval; Université de Montréal","funders":"","keywords":"World Wide Web; Computer science","score_opus":0.018966275390775365,"score_gpt":0.23660146955550326,"score_spread":0.2176351941647279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206253804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048710333,0.0002086887,0.97759396,0.013591421,0.0012574709,0.00058723846,0.000038261584,0.00088501774,0.0053508193],"genre_scores_gemma":[0.59697336,0.00026179547,0.3626483,0.034851737,0.0014278499,0.00022892622,0.000090436006,0.00014336983,0.0033742392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958245,0.00015441113,0.0004750216,0.001108004,0.0013560739,0.0010819504],"domain_scores_gemma":[0.993369,0.0020532624,0.0001867417,0.0040709013,0.00017598315,0.00014411697],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011769383,0.00065373624,0.00055849145,0.00091331126,0.0006521597,0.001142228,0.015111904,0.00039898013,0.00002762908],"category_scores_gemma":[0.00017207213,0.00046346392,0.00013416864,0.002800148,0.0014515285,0.0003487148,0.0035387943,0.0019262551,0.00023064537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013200406,0.00008955773,0.000053474196,0.000023283059,0.000025141147,0.000115958734,0.0017920425,0.15767547,0.000023377701,0.02400756,0.031478524,0.7847024],"study_design_scores_gemma":[0.00028125994,0.0005514986,0.00025981752,0.0010203038,0.000009692334,0.00009004595,0.0000021135347,0.65142727,0.0008968234,0.23360072,0.11039303,0.0014674531],"about_ca_topic_score_codex":0.000031334002,"about_ca_topic_score_gemma":0.00016617615,"teacher_disagreement_score":0.78323495,"about_ca_system_score_codex":0.000654913,"about_ca_system_score_gemma":0.0010628946,"threshold_uncertainty_score":0.9998947},"labels":[],"label_agreement":null},{"id":"W4210301429","doi":"10.1109/rasse53195.2021.9686848","title":"Network Latency Classification for Computer Games","year":2021,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital; Okanagan College; Langara College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Traffic classification; Classifier (UML); Heuristics; Server; Machine learning; Latency (audio); Network routing; Artificial intelligence; Computer network; Quality of service; Routing (electronic design automation); Operating system","score_opus":0.0382569858948512,"score_gpt":0.2637913086929748,"score_spread":0.22553432279812358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210301429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015046727,0.00013321114,0.97308725,0.020731667,0.0007173026,0.0001896129,9.970165e-7,0.0009846255,0.0026506495],"genre_scores_gemma":[0.094239876,0.000011123839,0.9004588,0.0027859963,0.0002844795,0.00006574155,0.000007270822,0.000008718876,0.0021379788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988195,0.000023958848,0.00018891762,0.00046102735,0.00014951345,0.00035709754],"domain_scores_gemma":[0.9987931,0.00013832559,0.000044567314,0.00077210396,0.00019268031,0.000059218757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001813892,0.00011077806,0.00014225925,0.000049850965,0.00009841168,0.00018119886,0.0008322787,0.000085483254,0.000011006293],"category_scores_gemma":[0.000043180517,0.000101650665,0.00005607519,0.00068024144,0.000021555448,0.00020134487,0.00045571104,0.00007832878,0.000090797046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019937265,0.00003058219,0.0006731404,0.000006283013,0.000012964833,0.000006896796,0.00005793131,0.0022516993,0.00027181543,0.42649972,0.3030593,0.26712766],"study_design_scores_gemma":[0.00032569893,0.00014660727,0.020428767,0.00003499729,0.000007918098,0.000025394158,0.000026813326,0.59714276,0.0024818738,0.10164907,0.2772999,0.0004301617],"about_ca_topic_score_codex":0.0000021834962,"about_ca_topic_score_gemma":0.000014861201,"teacher_disagreement_score":0.5948911,"about_ca_system_score_codex":0.000032001753,"about_ca_system_score_gemma":0.000055965273,"threshold_uncertainty_score":0.41451937},"labels":[],"label_agreement":null},{"id":"W4210691036","doi":"10.7287/peerj-cs.538v0.2/reviews/1","title":"Peer Review #1 of \"Low-diameter topic-based pub/sub overlay network construction with minimum–maximum node degree (v0.2)\"","year":2021,"lang":"en","type":"peer-review","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Degree (music); Overlay; Node (physics); Overlay network; Computer network; Computer science; Engineering; World Wide Web; Physics; Operating system; Structural engineering; The Internet","score_opus":0.03660214047147078,"score_gpt":0.27436712105347405,"score_spread":0.23776498058200327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210691036","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014286426,0.22404388,0.34724143,0.3942398,0.0061484417,0.0025357828,0.00013478342,0.0012290644,0.024412518],"genre_scores_gemma":[0.000041964722,0.04306259,0.77231133,0.06284525,0.0010777314,0.0006536052,0.00086705945,0.00016424613,0.118976206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9915697,0.0003511935,0.0016717722,0.0020014434,0.0031896788,0.0012162183],"domain_scores_gemma":[0.989272,0.00052242994,0.0011441055,0.004566657,0.0042030346,0.00029175906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020270627,0.0011405107,0.002741967,0.00035951496,0.00013940751,0.0002400868,0.003891093,0.00073187303,0.0004890937],"category_scores_gemma":[0.0016441038,0.00091239106,0.0006950051,0.003153394,0.00034472748,0.0003706151,0.0014422028,0.001245127,0.00009642475],"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.0000071891636,0.0000536655,0.000053028143,0.014110311,0.00014786042,0.00007179718,0.0000066395487,0.000092428236,0.000005719966,0.00060578994,0.8694043,0.11544124],"study_design_scores_gemma":[0.00038560046,0.00022543514,0.000060689716,0.08508403,0.00026654784,0.00013317209,0.0000049201944,0.00050543225,0.00042053877,0.0003556465,0.9114625,0.0010954897],"about_ca_topic_score_codex":0.000068479385,"about_ca_topic_score_gemma":0.00023908238,"teacher_disagreement_score":0.42506993,"about_ca_system_score_codex":0.0002669401,"about_ca_system_score_gemma":0.0011757486,"threshold_uncertainty_score":0.99933267},"labels":[],"label_agreement":null},{"id":"W4211053346","doi":"10.2200/s00338ed1v01y201104dtm015","title":"Peer-to-Peer Data Management","year":2011,"lang":"en","type":"article","venue":"Synthesis lectures on data management","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 Waterloo","funders":"","keywords":"Computer science; Information retrieval; Peer-to-peer; Data management; Schema (genetic algorithms); Data retrieval; Overlay; Data science; World Wide Web; Data mining","score_opus":0.11587906955672425,"score_gpt":0.2975658530360445,"score_spread":0.18168678347932024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211053346","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004286205,0.00016947293,0.7742486,0.051992755,0.0016525354,0.0025823372,0.00064168964,0.0028451637,0.16543886],"genre_scores_gemma":[0.17850055,0.00013591979,0.79935473,0.008310047,0.00019555453,0.0004587846,0.00041587753,0.00010950519,0.012519036],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928831,0.00014068704,0.00054733554,0.0030318326,0.002243382,0.0011537008],"domain_scores_gemma":[0.9792694,0.00018289231,0.0001480227,0.019970234,0.00013474481,0.00029472949],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0024193092,0.000611312,0.00046121256,0.0009930824,0.00028270634,0.0006072684,0.031228248,0.00013382995,0.00016995436],"category_scores_gemma":[0.0006843821,0.0005477368,0.00006731095,0.001524088,0.000080056285,0.0010540684,0.034218844,0.00031348006,0.0023222475],"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.000030578474,0.00016822654,0.000024988529,0.000041525345,0.0002904403,0.00022096267,0.00012860088,0.00012622024,0.000006009625,0.032554284,0.5495816,0.41682655],"study_design_scores_gemma":[0.0002148009,0.00012755956,0.004279101,0.00014473102,0.0001493139,0.000007459874,0.00014884255,0.0033206737,0.0012513656,0.0047192783,0.98477805,0.0008588039],"about_ca_topic_score_codex":0.00008963123,"about_ca_topic_score_gemma":0.00012362121,"teacher_disagreement_score":0.43519646,"about_ca_system_score_codex":0.00015433172,"about_ca_system_score_gemma":0.000020093601,"threshold_uncertainty_score":0.9996974},"labels":[],"label_agreement":null},{"id":"W4211087622","doi":"10.1145/1012888.1005751","title":"Multicast protocols for scalable on-demand download","year":2004,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Multicast; Download; Computer science; Computer network; Scalability; On demand; Reliable multicast; IP multicast; Protocol Independent Multicast; World Wide Web; Operating system; Multimedia","score_opus":0.10702927383341124,"score_gpt":0.38562578842152606,"score_spread":0.27859651458811485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211087622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020853482,0.041845478,0.69246143,0.047188174,0.0013527122,0.19095539,0.00006092746,0.0023204528,0.0029619406],"genre_scores_gemma":[0.12906039,0.02004947,0.7018014,0.012926123,0.0002563716,0.13554712,0.00006309434,0.000059528305,0.0002364937],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967556,0.0000805115,0.00064456946,0.00070074014,0.0012814825,0.00053710083],"domain_scores_gemma":[0.99614394,0.00039061307,0.00027785022,0.002155194,0.0008984824,0.00013389651],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004891434,0.0002828509,0.00045630027,0.0005746258,0.00025608295,0.00016871662,0.0025261857,0.00011464563,0.00003385527],"category_scores_gemma":[0.008509869,0.00023835489,0.00012237034,0.004557632,0.000042553394,0.0006787057,0.00050271465,0.0002167028,0.0008309319],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009344364,0.00012456249,0.00024297503,0.00089971395,0.000016450142,7.731511e-7,0.000039162587,0.00714174,0.000044263856,0.002269674,0.014107662,0.9751037],"study_design_scores_gemma":[0.010755862,0.006629002,0.014932515,0.024657298,0.00036719715,0.00006348948,0.000018046754,0.27680463,0.021922803,0.01870734,0.62181044,0.0033314151],"about_ca_topic_score_codex":0.0000015050466,"about_ca_topic_score_gemma":9.3968083e-7,"teacher_disagreement_score":0.97177225,"about_ca_system_score_codex":0.00036060036,"about_ca_system_score_gemma":0.0002859553,"threshold_uncertainty_score":0.999947},"labels":[],"label_agreement":null},{"id":"W4220893811","doi":"10.5281/zenodo.6205097","title":"Layers of Unpredictability: Developing the Aesthetic and Identity of a Network-Based Live Coding Ensemble","year":2022,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Coding (social sciences); Identity (music); Aesthetics; Sociology; Art","score_opus":0.03744013991581272,"score_gpt":0.2629930963960434,"score_spread":0.2255529564802307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220893811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02112594,0.0021944444,0.899612,0.008016942,0.0012821802,0.0027202184,0.000502475,0.0017168655,0.06282894],"genre_scores_gemma":[0.9685091,0.0011635432,0.023390783,0.0007202089,0.00020270681,0.0000011932935,0.00093294284,0.0019144258,0.0031651105],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972944,0.0005871277,0.00043750723,0.0005753953,0.00068708695,0.00041845578],"domain_scores_gemma":[0.9978327,0.00012008717,0.00035958042,0.001046005,0.0005581541,0.000083471954],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016991106,0.00020635947,0.0003452445,0.00031040004,0.0013540614,0.0004538585,0.0038677913,0.000109850036,0.0016887285],"category_scores_gemma":[0.0005011249,0.00019432387,0.00006909447,0.0016111161,0.0003526135,0.00023017704,0.006804439,0.0005184367,0.00080792105],"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.00006826929,0.0001065825,0.000014998755,0.0005183732,0.00011674194,0.000015164135,0.0029891944,0.013681478,0.00053335214,0.029189948,0.8135582,0.13920769],"study_design_scores_gemma":[0.00030349463,0.000381757,0.00016844973,0.00024122666,0.000023594099,0.00005739052,0.00028924563,0.0059701325,0.00040744315,0.0010385578,0.99081343,0.0003052703],"about_ca_topic_score_codex":0.000043160646,"about_ca_topic_score_gemma":0.000001832594,"teacher_disagreement_score":0.94738317,"about_ca_system_score_codex":0.00021582932,"about_ca_system_score_gemma":0.000035941182,"threshold_uncertainty_score":0.9999701},"labels":[],"label_agreement":null},{"id":"W4229577914","doi":"10.1002/cpe.1578","title":"A scheduling and load balancing scheme for dynamic P2P‐based system","year":2010,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Load balancing (electrical power); Scheduling (production processes); Dynamic priority scheduling; Round-robin scheduling; Fair-share scheduling; Peer-to-peer; Computer network; Quality of service; Engineering","score_opus":0.014057672959052782,"score_gpt":0.31389667397781656,"score_spread":0.29983900101876376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229577914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36487788,0.0006320067,0.6321662,0.0014751072,0.00035596677,0.00020954495,0.0000016014855,0.00020222095,0.000079492944],"genre_scores_gemma":[0.7458274,0.000020696365,0.2537517,0.00029668317,0.000020364241,0.00007242053,0.0000014670258,0.00000461588,0.000004677342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880886,0.00003204729,0.00022209367,0.0005094488,0.00018515305,0.00024241288],"domain_scores_gemma":[0.99869305,0.0005977979,0.0001477981,0.00021292179,0.00023426583,0.000114164046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004148624,0.00015231401,0.00016471601,0.000084386396,0.00033070322,0.00037116755,0.00025307765,0.00008546908,4.6191636e-7],"category_scores_gemma":[0.00069188,0.0001507496,0.000016769443,0.0002661372,0.00011638131,0.0010961032,0.00018778822,0.0002061695,0.0000024126516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009263829,0.000102449194,0.002026216,0.00042728378,0.000034535242,0.00003047868,0.01658688,0.0007785709,0.02007206,0.12563874,0.00017589272,0.83403426],"study_design_scores_gemma":[0.000509233,0.00013654263,0.0005618337,0.00009719137,0.00001014433,0.00010781778,0.0025357474,0.99128,0.00057570054,0.00061912765,0.0033115859,0.0002550274],"about_ca_topic_score_codex":0.0000143178395,"about_ca_topic_score_gemma":0.000006729581,"teacher_disagreement_score":0.99050146,"about_ca_system_score_codex":0.000023148992,"about_ca_system_score_gemma":0.000098434735,"threshold_uncertainty_score":0.61473906},"labels":[],"label_agreement":null},{"id":"W4229585521","doi":"10.1109/wi.2004.10170","title":"Trust-Based Community Formation in Peer-to-Peer File Sharing Networks","year":2005,"lang":"en","type":"article","venue":"IEEE/WIC/ACM International Conference on Web Intelligence (WI'04)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reputation; Computer science; Peer-to-peer; Mechanism (biology); File sharing; Quality (philosophy); Shared resource; Information sharing; Internet privacy; World Wide Web; Computer network; The Internet","score_opus":0.08620145764011532,"score_gpt":0.32827483681798436,"score_spread":0.24207337917786903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229585521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09533911,0.0000305684,0.8339026,0.04708562,0.0024985357,0.0010568668,0.00028352404,0.0012892641,0.018513933],"genre_scores_gemma":[0.9506219,0.0000312159,0.042365182,0.0037872049,0.00031080094,0.00031879343,0.00021854667,0.000042637028,0.0023036927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994507,0.00023651171,0.0011858878,0.001047255,0.0019367271,0.0010865822],"domain_scores_gemma":[0.99445593,0.0007536827,0.0003771586,0.0024363438,0.0016241106,0.00035278482],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018909676,0.0006461074,0.00053544046,0.00129296,0.00036000554,0.000952866,0.010139492,0.0003944932,0.0011649162],"category_scores_gemma":[0.0022682247,0.00068373635,0.00018579888,0.0016029635,0.00018089375,0.001535333,0.001658614,0.0018428421,0.0015539462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025274372,0.00090944185,0.001750719,0.000040048257,0.00009097322,0.00008011537,0.0032754955,0.45231625,0.0013795231,0.13136928,0.09482388,0.31371152],"study_design_scores_gemma":[0.00031519256,0.00034273195,0.0012991034,0.000556212,0.0000062507866,0.000025324094,0.00045927314,0.9418887,0.014347799,0.009128258,0.030804662,0.000826522],"about_ca_topic_score_codex":0.00037793626,"about_ca_topic_score_gemma":0.002007949,"teacher_disagreement_score":0.8552828,"about_ca_system_score_codex":0.0010244435,"about_ca_system_score_gemma":0.0002522365,"threshold_uncertainty_score":0.9997482},"labels":[],"label_agreement":null},{"id":"W4230208307","doi":"10.32920/ryerson.14649483.v1","title":"A peer-to-peer delivery system for internet short video sharing","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Compute Canada","funders":"","keywords":"Computer science; BitTorrent; Scalability; Upload; Peer-to-peer; Download; The Internet; Computer network; File sharing; Overlay network; Overlay; Workload; Scheme (mathematics); Multimedia; World Wide Web; Operating system","score_opus":0.039979865653588076,"score_gpt":0.2781277133913707,"score_spread":0.23814784773778264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230208307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038109396,0.00022731077,0.93525845,0.010978346,0.004194438,0.0017878446,0.00003645812,0.0043169735,0.005090798],"genre_scores_gemma":[0.6170123,0.0000043414625,0.3633878,0.0007990043,0.00027671378,0.0010190356,0.000061785904,0.000064681975,0.017374339],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934948,0.00005284993,0.00091973017,0.0028717066,0.0015379216,0.001122977],"domain_scores_gemma":[0.9933783,0.00023198094,0.00015881521,0.0037564475,0.002097339,0.00037711285],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016366793,0.00077719515,0.0010421363,0.00073674635,0.000119993565,0.002161105,0.008968198,0.00075269496,0.000018979297],"category_scores_gemma":[0.00069594017,0.00077911577,0.00047114774,0.0008270883,0.00004376463,0.00038544822,0.026739595,0.00096175825,0.00016615997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080131496,0.00022470445,0.002365733,0.0018269798,0.0010474578,0.00063813094,0.0045566503,0.027851513,0.0010608062,0.10662464,0.6163477,0.23737562],"study_design_scores_gemma":[0.0006390995,0.00047075178,0.0014484206,0.0043881554,0.0001891389,0.00026428344,0.0019914631,0.7862197,0.032195095,0.0033689628,0.16442217,0.0044027264],"about_ca_topic_score_codex":0.00046037053,"about_ca_topic_score_gemma":0.00040010255,"teacher_disagreement_score":0.7583682,"about_ca_system_score_codex":0.00083575264,"about_ca_system_score_gemma":0.00027750325,"threshold_uncertainty_score":0.999466},"labels":[],"label_agreement":null},{"id":"W4230603342","doi":"10.1109/p2p.2007.4343470","title":"An Efficient Eigenvalue-based P2P XML Routing Framework","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Computer network; Dynamic Source Routing; Static routing; Policy-based routing; XML; Routing (electronic design automation); Routing protocol; World Wide Web","score_opus":0.01506827979690054,"score_gpt":0.2862163882874132,"score_spread":0.27114810849051263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230603342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493502,0.00003284737,0.84244114,0.0016663069,0.00043400403,0.00018144237,5.245693e-7,0.0024575226,0.0034360136],"genre_scores_gemma":[0.56302613,2.0910153e-7,0.43551803,0.0013248837,0.00006311427,0.0000044658727,6.0475213e-7,0.00000911597,0.000053430413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976495,0.000037200138,0.00031356962,0.000653547,0.00053151965,0.0008146974],"domain_scores_gemma":[0.9977282,0.0003022242,0.00007469035,0.0015800467,0.00009880213,0.00021598538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013508695,0.00020768325,0.00018343856,0.0002668368,0.00020314725,0.00023180929,0.002303266,0.00019950494,0.000022407534],"category_scores_gemma":[0.00025473433,0.0001852116,0.000066396235,0.0014051152,0.00006221459,0.0001423941,0.00042614414,0.00032101315,0.00023285465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018568655,0.00033998044,0.0062469286,0.000008651404,0.000017760849,0.000120297,0.00083167583,0.13107851,0.0019069087,0.57253206,0.002132271,0.2847664],"study_design_scores_gemma":[0.00027342813,0.00035182602,0.0143349655,0.000074397365,0.0000063687544,0.0000106122025,0.00018379706,0.9248371,0.047150612,0.008350037,0.0037239767,0.00070289755],"about_ca_topic_score_codex":0.000040433286,"about_ca_topic_score_gemma":0.00002563068,"teacher_disagreement_score":0.7937586,"about_ca_system_score_codex":0.000117142896,"about_ca_system_score_gemma":0.000065608205,"threshold_uncertainty_score":0.75527096},"labels":[],"label_agreement":null},{"id":"W4230636836","doi":"10.1002/rsa.20234","title":"Multiple choice tries and distributed hash tables","year":2008,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"String (physics); Mathematics; Constant (computer programming); Hash function; Combinatorics; Bounded function; Perfect hash function; Binary logarithm; Hash table; Reduction (mathematics); Discrete mathematics; Trie; Simple (philosophy); Computation; Randomized algorithm; Online algorithm; Asymptotically optimal algorithm; Data structure; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.01424389141719585,"score_gpt":0.22836968136473534,"score_spread":0.2141257899475395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230636836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62562245,0.0035947377,0.3671245,0.0020467166,0.00038613912,0.0004215347,0.000116451265,0.00063343573,0.00005405624],"genre_scores_gemma":[0.9327889,0.00042976145,0.06631724,0.00018191572,0.00012741846,0.00002202793,0.000017149574,0.000010709022,0.0001048986],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9986851,0.000035299774,0.00020718198,0.00047145164,0.00022660756,0.00037436583],"domain_scores_gemma":[0.99891955,0.0004439027,0.000065480344,0.00037615385,0.000057664056,0.00013726928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011472626,0.00022478623,0.0003549182,0.00009857699,0.00042230933,0.00018986868,0.0004846038,0.00010824449,0.0000039650113],"category_scores_gemma":[0.00035489697,0.00017435857,0.000037475675,0.00035324346,0.00023111484,0.0002772691,0.0004480485,0.00016322787,0.0000013574953],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042464954,0.00010894944,0.082063965,0.00012659498,0.00033995303,0.00038760432,0.0031648807,0.002248601,0.0035614052,0.016152652,0.043838065,0.8475827],"study_design_scores_gemma":[0.027095221,0.0005530655,0.5729445,0.000102103804,0.00006369803,0.0014197307,0.00025871524,0.15780981,0.010165065,0.043129712,0.18436402,0.0020943584],"about_ca_topic_score_codex":0.0001485567,"about_ca_topic_score_gemma":0.00004000821,"teacher_disagreement_score":0.8454883,"about_ca_system_score_codex":0.000014284278,"about_ca_system_score_gemma":0.000023996163,"threshold_uncertainty_score":0.7110136},"labels":[],"label_agreement":null},{"id":"W4230770583","doi":"10.22215/etd/2013-08578","title":"Collaborative streaming system design as an underlay to cellular networks","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Underlay; Computer science; Telecommunications","score_opus":0.012871454780692276,"score_gpt":0.25297972201535807,"score_spread":0.2401082672346658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230770583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04953799,0.00027806824,0.9346997,0.00023653214,0.0016395,0.002143465,0.0000038413586,0.0029758876,0.008485001],"genre_scores_gemma":[0.6856157,0.0000151220975,0.28654727,0.00023659389,0.00027004487,0.0007203542,0.00016880193,0.00010123483,0.026324864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965544,0.00022083988,0.0005150406,0.0013000236,0.0006306677,0.0007790606],"domain_scores_gemma":[0.99685353,0.00016435188,0.00026423807,0.0016781925,0.0006851692,0.00035450284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035761992,0.0006131456,0.0006185521,0.00054101046,0.00029260365,0.000917582,0.0030686911,0.0007065976,0.000021960412],"category_scores_gemma":[0.00007592403,0.0005716411,0.00007205212,0.0023021924,0.000021384536,0.0005991384,0.0003188534,0.00043134624,0.0006026669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024590045,0.00035614078,0.00006202076,0.00051923067,0.00068279466,0.000718853,0.01571156,0.26738825,0.015378142,0.4209493,0.117486745,0.16050105],"study_design_scores_gemma":[0.0011014626,0.0035117592,0.0014718323,0.0024711273,0.0001913903,0.000052844,0.057178516,0.76367,0.15444595,0.0046846718,0.0046463865,0.0065740333],"about_ca_topic_score_codex":0.00025971993,"about_ca_topic_score_gemma":0.00039766447,"teacher_disagreement_score":0.6481525,"about_ca_system_score_codex":0.00041822548,"about_ca_system_score_gemma":0.000319211,"threshold_uncertainty_score":0.9996735},"labels":[],"label_agreement":null},{"id":"W4230868717","doi":"10.4018/978-1-60566-054-7.ch082","title":"Pen-Based Mobile Computing","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Center (category theory); Wireless; Telecommunications; World Wide Web; Library science","score_opus":0.016075519791240302,"score_gpt":0.24825614204346627,"score_spread":0.23218062225222597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230868717","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008145831,0.00035379172,0.08036726,0.00039684883,0.00064231385,0.000662285,0.000029491508,0.0027521676,0.9147144],"genre_scores_gemma":[0.5369546,0.0000042691045,0.30294493,0.011426668,0.0010667896,0.00007343875,0.000013999614,0.00016798114,0.14734736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682844,0.000020532092,0.0005154089,0.0011371776,0.0007357457,0.0007626833],"domain_scores_gemma":[0.9972896,0.0000802797,0.00028643606,0.00193226,0.00017794169,0.00023349297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021740732,0.00066413917,0.00065918866,0.00019917132,0.0001748837,0.00033140992,0.0034051663,0.0006216388,0.00000833325],"category_scores_gemma":[0.000026722166,0.0006956312,0.0002709736,0.00009406995,0.00011845036,0.00006726501,0.0010536759,0.00055673346,0.000591241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004592983,0.000008668515,0.000003816788,0.000009241177,0.000021024558,0.0001505962,0.000017244889,0.00068650994,0.0000075280464,0.7412328,0.009647554,0.24821042],"study_design_scores_gemma":[0.00051931804,0.0006623185,0.000058353908,0.00056770653,0.00004176105,0.0000905844,0.0000039585307,0.009100851,0.00030614669,0.6235565,0.363449,0.0016434721],"about_ca_topic_score_codex":0.000025122345,"about_ca_topic_score_gemma":0.000032271182,"teacher_disagreement_score":0.767367,"about_ca_system_score_codex":0.00045233226,"about_ca_system_score_gemma":0.00030151772,"threshold_uncertainty_score":0.9995495},"labels":[],"label_agreement":null},{"id":"W4230937246","doi":"10.1145/957117.957119","title":"Design of a multi-sender 3D videoconferencing application over an end system multicast protocol","year":2003,"lang":"en","type":"article","venue":"Proceedings of the eleventh ACM international conference on Multimedia - MULTIMEDIA '03","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; IP multicast; Computer network; Xcast; Videoconferencing; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; Multimedia; Distributed computing","score_opus":0.0679423735951189,"score_gpt":0.32235154366928576,"score_spread":0.25440917007416686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230937246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061859295,0.000030670337,0.80452716,0.0030599036,0.0034032739,0.1169382,0.0001831434,0.0021422796,0.007856058],"genre_scores_gemma":[0.6091013,0.0000025258407,0.3775886,0.000067560584,0.00007104545,0.013038567,0.000005289979,0.000036913087,0.000088201465],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514246,0.00012047629,0.0011978525,0.0011891812,0.0016451097,0.0007049214],"domain_scores_gemma":[0.9949398,0.00049010135,0.0012508441,0.0011831543,0.001839877,0.00029623567],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013246116,0.0006112101,0.0006545108,0.0006070244,0.00016877348,0.00019934516,0.0060444996,0.00033681892,0.000072181174],"category_scores_gemma":[0.0032729995,0.0004953374,0.00018465226,0.0007808847,0.0003292392,0.0009498762,0.0010452509,0.0006050883,0.00008600536],"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.0006530197,0.0031073517,0.015412131,0.000667041,0.00056531787,0.000009183933,0.008328629,0.0033725929,0.72465914,0.0904664,0.000987153,0.151772],"study_design_scores_gemma":[0.0022122958,0.00025822897,0.003176725,0.00048060127,0.00002858866,0.000017223669,0.0004820155,0.8000005,0.19134302,0.001125616,0.00035492075,0.0005202542],"about_ca_topic_score_codex":0.00009141937,"about_ca_topic_score_gemma":0.000014457451,"teacher_disagreement_score":0.79662794,"about_ca_system_score_codex":0.00037710601,"about_ca_system_score_gemma":0.00033172942,"threshold_uncertainty_score":0.99974984},"labels":[],"label_agreement":null},{"id":"W4231180551","doi":"10.1007/11925071_8","title":"Dynamic Load Balancing in Distributed Content-Based Publish/Subscribe","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Load balancing (electrical power); Scalability; Distributed computing; Publication; Context (archaeology); Overhead (engineering); Load management; Network Load Balancing Services; Computer network; Server; Operating system","score_opus":0.015817985556279925,"score_gpt":0.22562995923080448,"score_spread":0.20981197367452456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231180551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076887687,0.0004891764,0.9889803,0.0052109435,0.0019280209,0.00070871157,0.00003974434,0.0008785591,0.0009956991],"genre_scores_gemma":[0.47619534,0.000009694798,0.5203226,0.0027989806,0.00015601824,0.000046786696,0.0000647573,0.00006619796,0.00033958585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930449,0.00005009912,0.000959445,0.0025440564,0.0018465905,0.0015548787],"domain_scores_gemma":[0.9957245,0.0005690957,0.00038686403,0.002547074,0.00054081535,0.00023162583],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014444,0.0008790765,0.0009426626,0.0019084484,0.00020927165,0.0013031523,0.0077880863,0.00067038473,0.0000074545596],"category_scores_gemma":[0.00047952047,0.0008572548,0.00017812056,0.002673603,0.0007618879,0.0009709388,0.002545017,0.0015846437,0.000050375795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021652198,0.0001251235,0.0015130296,0.00007638192,0.000017550845,0.00085737265,0.00023545894,0.4124996,0.0006866978,0.008151554,0.001216688,0.57459885],"study_design_scores_gemma":[0.0007274179,0.00019694211,0.0026018193,0.00088380236,0.000007286056,0.000047420188,4.332197e-7,0.9544705,0.0010983801,0.035696104,0.0029118396,0.0013580292],"about_ca_topic_score_codex":0.00026467213,"about_ca_topic_score_gemma":0.0023455392,"teacher_disagreement_score":0.5732408,"about_ca_system_score_codex":0.0023639228,"about_ca_system_score_gemma":0.0012597885,"threshold_uncertainty_score":0.99973357},"labels":[],"label_agreement":null},{"id":"W4231658064","doi":"10.1007/3-540-44884-5_10","title":"To Play or to Control: A Game-Based Control-Theoretic Approach to Peer-to-Peer Incentive Engineering","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Stochastic game; Incentive; Peer-to-peer; Cournot competition; Shared resource; Game theory; Distributed computing; Valuation (finance); Sequential game; Control (management); Operations research; Microeconomics; Computer security; Artificial intelligence; Economics","score_opus":0.011532303471379199,"score_gpt":0.2250983422451517,"score_spread":0.2135660387737725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231658064","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030761334,0.00007341141,0.96959305,0.022072837,0.0021960319,0.0035541933,0.000060083832,0.00097183575,0.001170918],"genre_scores_gemma":[0.30309924,9.857274e-7,0.66153216,0.033913836,0.0003280821,0.00029567187,0.000004178535,0.00010513944,0.00072072184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896036,0.00009541258,0.0010104792,0.0037995952,0.0031700383,0.0023208773],"domain_scores_gemma":[0.99246687,0.0014060943,0.000234653,0.00323309,0.0013503344,0.0013089718],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0025228206,0.0014303791,0.0015813889,0.0033236996,0.00027719958,0.0013509175,0.0092761805,0.00063259254,0.000015547621],"category_scores_gemma":[0.0030656806,0.001266552,0.00024349305,0.0041163857,0.00036552385,0.00039051694,0.0020678148,0.0013732732,0.00030140742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001263941,0.00007107408,0.000024844216,0.00003581342,0.000037978396,0.00012668488,0.0014818257,0.9100286,0.00043054495,0.017484419,0.002037129,0.068114705],"study_design_scores_gemma":[0.00212515,0.002666573,0.0002975115,0.0015781607,0.00005870343,0.00011553276,0.0000027911851,0.89968216,0.0045512263,0.011467697,0.07322575,0.004228755],"about_ca_topic_score_codex":0.000026475873,"about_ca_topic_score_gemma":0.000060403338,"teacher_disagreement_score":0.30806094,"about_ca_system_score_codex":0.0011685293,"about_ca_system_score_gemma":0.000674069,"threshold_uncertainty_score":0.9998446},"labels":[],"label_agreement":null},{"id":"W4231851217","doi":"10.22215/etd/2008-08989","title":"Large deviations for re-sequencing buffer size","year":2008,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.028302164524591184,"score_gpt":0.28728334414389883,"score_spread":0.25898117961930767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231851217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013204895,0.00044323583,0.9533871,0.0018841116,0.0016357295,0.0010969639,0.00003009548,0.002416491,0.025901413],"genre_scores_gemma":[0.32965437,0.00029944145,0.51038057,0.002302996,0.000381839,0.0011734607,0.0005195337,0.00010891437,0.1551789],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980805,0.000017886916,0.00035606022,0.00066136976,0.00034528656,0.00053891767],"domain_scores_gemma":[0.9981427,0.00036138832,0.00015523634,0.0009466937,0.00031392396,0.0000800334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020371345,0.00028960372,0.00032471865,0.00024312748,0.0003007802,0.00014140556,0.0016733477,0.0003924437,0.000029968098],"category_scores_gemma":[0.0007525698,0.0002783561,0.0001493864,0.000576782,0.000011619698,0.00028036576,0.00016397677,0.0002535626,0.00012248101],"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.000018384946,0.00008032453,0.000102688806,0.00013498729,0.0001111093,0.000029690009,0.004406506,0.00016083385,0.0013959554,0.41447774,0.5652677,0.013814088],"study_design_scores_gemma":[0.0018577505,0.0006485847,0.008066628,0.00069320877,0.00013982902,0.000049727314,0.004099185,0.039278384,0.045329146,0.1649517,0.7304213,0.004464575],"about_ca_topic_score_codex":0.000032601565,"about_ca_topic_score_gemma":0.0009789318,"teacher_disagreement_score":0.44300652,"about_ca_system_score_codex":0.0002165967,"about_ca_system_score_gemma":0.0002958122,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W4232092750","doi":"10.32920/ryerson.14649483","title":"A peer-to-peer delivery system for internet short video sharing","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Compute Canada","funders":"","keywords":"Computer science; BitTorrent; Scalability; Upload; Peer-to-peer; Download; The Internet; Computer network; File sharing; Overlay network; Overlay; Workload; Scheme (mathematics); Multimedia; World Wide Web; Operating system","score_opus":0.039979865653588076,"score_gpt":0.2781277133913707,"score_spread":0.23814784773778264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232092750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038109396,0.00022731077,0.93525845,0.010978346,0.004194438,0.0017878446,0.00003645812,0.0043169735,0.005090798],"genre_scores_gemma":[0.6170123,0.0000043414625,0.3633878,0.0007990043,0.00027671378,0.0010190356,0.000061785904,0.000064681975,0.017374339],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934948,0.00005284993,0.00091973017,0.0028717066,0.0015379216,0.001122977],"domain_scores_gemma":[0.9933783,0.00023198094,0.00015881521,0.0037564475,0.002097339,0.00037711285],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016366793,0.00077719515,0.0010421363,0.00073674635,0.000119993565,0.002161105,0.008968198,0.00075269496,0.000018979297],"category_scores_gemma":[0.00069594017,0.00077911577,0.00047114774,0.0008270883,0.00004376463,0.00038544822,0.026739595,0.00096175825,0.00016615997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080131496,0.00022470445,0.002365733,0.0018269798,0.0010474578,0.00063813094,0.0045566503,0.027851513,0.0010608062,0.10662464,0.6163477,0.23737562],"study_design_scores_gemma":[0.0006390995,0.00047075178,0.0014484206,0.0043881554,0.0001891389,0.00026428344,0.0019914631,0.7862197,0.032195095,0.0033689628,0.16442217,0.0044027264],"about_ca_topic_score_codex":0.00046037053,"about_ca_topic_score_gemma":0.00040010255,"teacher_disagreement_score":0.7583682,"about_ca_system_score_codex":0.00083575264,"about_ca_system_score_gemma":0.00027750325,"threshold_uncertainty_score":0.999466},"labels":[],"label_agreement":null},{"id":"W4233239436","doi":"10.1007/978-1-4939-7131-2_101472","title":"Web-Like Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","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 Calgary","funders":"","keywords":"Computer science; World Wide Web","score_opus":0.01739934822846248,"score_gpt":0.222131869120261,"score_spread":0.20473252089179853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233239436","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002588182,0.0003152837,0.3484132,0.0014952074,0.001601943,0.00022435178,0.0000025890288,0.0024842466,0.6454606],"genre_scores_gemma":[0.00050803495,0.00013103087,0.09649307,0.0027174987,0.0006644525,0.00001726433,0.0000069199887,0.00005854131,0.89940315],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974937,0.000009354547,0.00036818243,0.0010275521,0.00048574188,0.00061550166],"domain_scores_gemma":[0.9969196,0.00008552053,0.00015517091,0.0024845784,0.00017974178,0.00017538616],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023799301,0.0005126862,0.00046340513,0.00034007966,0.000110893845,0.00025910974,0.0041010273,0.0007903954,0.00073016033],"category_scores_gemma":[0.000018062741,0.00046011462,0.0001683746,0.00016179409,0.00017567849,0.00019491697,0.002819872,0.0005859946,0.00449822],"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.0000014373892,0.000003376454,0.0000019162906,0.0000025958211,0.000029305469,0.000031633346,0.00001404101,0.00005463432,0.00000114924,0.35686132,0.6022977,0.04070088],"study_design_scores_gemma":[0.000081439764,0.00012326828,0.0000065406466,0.00007700022,0.000010070914,0.000024360115,0.0000010924368,0.016188942,0.000010002623,0.06200309,0.9209068,0.000567419],"about_ca_topic_score_codex":0.0000059905256,"about_ca_topic_score_gemma":0.00008677042,"teacher_disagreement_score":0.31860906,"about_ca_system_score_codex":0.000105927036,"about_ca_system_score_gemma":0.00009646799,"threshold_uncertainty_score":0.99978507},"labels":[],"label_agreement":null},{"id":"W4233753335","doi":"10.22215/etd/2009-09277","title":"Collaborative knowledge construction in a peer-to-peer file sharing network","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; World Wide Web; Library science","score_opus":0.010163652518873762,"score_gpt":0.27962400175385865,"score_spread":0.2694603492349849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233753335","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06104262,0.0021457912,0.11715551,0.01862106,0.016774166,0.007921881,0.00038805528,0.0099510895,0.76599985],"genre_scores_gemma":[0.033606853,0.00004450182,0.75883037,0.0009654939,0.00093640754,0.0010137099,0.0018811757,0.00012241644,0.20259905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959062,0.0000732644,0.00071469793,0.0014850219,0.00086612994,0.0009547043],"domain_scores_gemma":[0.9965742,0.00019344677,0.0002518828,0.001236067,0.0015293647,0.00021500622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006815453,0.0006165179,0.0007379493,0.0010035442,0.00020030662,0.0005579686,0.00269136,0.0007112964,0.00019693033],"category_scores_gemma":[0.000589407,0.0006472081,0.00010660977,0.0060691996,0.0000385092,0.00047704417,0.00052413455,0.000825716,0.00060904474],"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.00004714258,0.0000799358,0.00025858055,0.000030651005,0.000040855048,0.000039694536,0.0029908635,0.0034914594,0.000041548446,0.04073077,0.73821306,0.21403545],"study_design_scores_gemma":[0.0018306769,0.0013264362,0.061776757,0.0034155468,0.00008392571,0.000070402646,0.007057138,0.046855338,0.004037168,0.115121014,0.75241995,0.006005665],"about_ca_topic_score_codex":0.000089651796,"about_ca_topic_score_gemma":0.008670982,"teacher_disagreement_score":0.6416749,"about_ca_system_score_codex":0.00044092085,"about_ca_system_score_gemma":0.00044124818,"threshold_uncertainty_score":0.9995979},"labels":[],"label_agreement":null},{"id":"W4234424928","doi":"10.22215/etd/2005-06617","title":"Pylon-lite: an architectural model for cross-domain QoS","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Computer science; Domain (mathematical analysis); Telecommunications; Humanities; Mathematics; Art; Mathematical analysis","score_opus":0.024349064981631318,"score_gpt":0.3337663711864892,"score_spread":0.3094173062048579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234424928","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15862584,0.00015523353,0.8310165,0.0010498324,0.0010245864,0.0010362862,0.000037086244,0.002223158,0.004831495],"genre_scores_gemma":[0.10191584,0.0000050019207,0.8472997,0.00063929637,0.00044750734,0.00048464202,0.00047833045,0.000069809816,0.04865987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970995,0.000023634011,0.00046978606,0.0011327317,0.00048588714,0.0007884231],"domain_scores_gemma":[0.99777913,0.00009439841,0.0001730516,0.0015337532,0.00024061168,0.00017907562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030635158,0.00049218343,0.00043167645,0.0004262954,0.00022435677,0.0006112811,0.0035881568,0.0005088401,0.000010152259],"category_scores_gemma":[0.00008779371,0.00044945657,0.0001994838,0.00045535451,0.000050696774,0.0005122526,0.00025447705,0.00041716566,0.000050048642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017320664,0.00015613179,0.0000649619,0.00013512252,0.00007653982,0.000012545922,0.0050496403,0.08462375,0.0010715193,0.14961888,0.014859235,0.74415845],"study_design_scores_gemma":[0.00042212283,0.000212007,0.0008495095,0.000052742456,0.000011748201,0.000018398903,0.00012618584,0.93308914,0.001972062,0.056596287,0.0057319514,0.00091782265],"about_ca_topic_score_codex":0.000023634611,"about_ca_topic_score_gemma":0.0015414449,"teacher_disagreement_score":0.8484654,"about_ca_system_score_codex":0.00012506376,"about_ca_system_score_gemma":0.00018937906,"threshold_uncertainty_score":0.99979573},"labels":[],"label_agreement":null},{"id":"W4235222258","doi":"10.32920/ryerson.14657418.v1","title":"DistVid : an examination of a distributed video streaming system","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Popularity; Protocol (science); Overlay; Bandwidth (computing); Frame (networking); Video on demand; Server; Computer network; Multimedia; Operating system","score_opus":0.01977448108051695,"score_gpt":0.2490853768762434,"score_spread":0.22931089579572644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235222258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22306375,0.00009363803,0.773318,0.00029951835,0.00047325395,0.00031372978,0.000047291625,0.0014613303,0.00092949864],"genre_scores_gemma":[0.8833794,0.0000052527807,0.11617565,0.000015345418,0.000041248397,0.00007621635,0.00021809022,0.000013636666,0.000075128504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740523,0.0001693759,0.0005393489,0.000996078,0.00055103906,0.00033892985],"domain_scores_gemma":[0.9966553,0.00011635603,0.0003153697,0.002398329,0.00040520268,0.000109428045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057919737,0.00030828617,0.00052052806,0.00026880388,0.00006312018,0.00037754697,0.0027438104,0.00035694917,0.0000044903727],"category_scores_gemma":[0.00018813628,0.00030164138,0.00011058756,0.0007820951,0.000047807447,0.00034480618,0.0049036155,0.00037451353,0.0000052537594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088921815,0.00046235754,0.0013224301,0.0017912143,0.00025194735,0.00025568277,0.0029048624,0.020156834,0.0029430857,0.13339213,0.0012240733,0.8352865],"study_design_scores_gemma":[0.00047413318,0.0003480042,0.12323912,0.0029143747,0.00009274005,0.0000675207,0.0045304643,0.8252635,0.039017413,0.0016858919,0.00058746693,0.001779338],"about_ca_topic_score_codex":0.00019045552,"about_ca_topic_score_gemma":0.00014797812,"teacher_disagreement_score":0.8335072,"about_ca_system_score_codex":0.0003280725,"about_ca_system_score_gemma":0.00015009401,"threshold_uncertainty_score":0.99994355},"labels":[],"label_agreement":null},{"id":"W4235476009","doi":"10.1109/netgames.2010.5679654","title":"Unsynchronized multiplayer networked games: Feasibility with time rewind","year":2010,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Game engine; Computer science; Latency (audio); Human–computer interaction; Multimedia; Telecommunications","score_opus":0.01010805125805784,"score_gpt":0.2328878945718129,"score_spread":0.22277984331375505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235476009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5883905,0.000032274373,0.3909202,0.0050474405,0.0005172957,0.00083629397,0.0000024670185,0.0035299517,0.01072358],"genre_scores_gemma":[0.6419502,0.0000010769758,0.3547497,0.000476965,0.00008635497,0.000028483586,0.0000018918195,0.000015687068,0.0026896338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770755,0.00005033876,0.00027157326,0.0008741684,0.0004173207,0.0006790539],"domain_scores_gemma":[0.9970948,0.00019698798,0.00008487858,0.0022502914,0.00016542972,0.00020761722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005677201,0.00028518922,0.00031680067,0.0001306412,0.00013792075,0.00023463713,0.0021894325,0.00020676323,0.00018615839],"category_scores_gemma":[0.00016901176,0.00020474744,0.00006244797,0.0009998851,0.00016899439,0.00045601127,0.000769461,0.0005256124,0.0007504873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056839606,0.0012595683,0.06454528,0.000055240573,0.00036573992,0.0003780282,0.001718748,0.007973788,0.07589392,0.04322317,0.30849525,0.4955229],"study_design_scores_gemma":[0.0062735323,0.0014262762,0.06298622,0.00012319357,0.00004771416,0.00029126558,0.00007935601,0.74569696,0.0268356,0.010645266,0.14257564,0.0030190116],"about_ca_topic_score_codex":0.000042387714,"about_ca_topic_score_gemma":0.00032009077,"teacher_disagreement_score":0.7377232,"about_ca_system_score_codex":0.00006425964,"about_ca_system_score_gemma":0.00012076324,"threshold_uncertainty_score":0.96462464},"labels":[],"label_agreement":null},{"id":"W4236870075","doi":"10.1007/978-0-387-39940-9_4003","title":"Web Macros","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","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":"Computer science; Macro; World Wide Web; Programming language","score_opus":0.01486943632597166,"score_gpt":0.23444026845267868,"score_spread":0.21957083212670703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236870075","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030478734,0.004445116,0.024253545,0.0005155183,0.0031061522,0.0011715274,0.0011967471,0.0012190398,0.96406186],"genre_scores_gemma":[0.001707301,0.0035660795,0.045915015,0.00024232658,0.0012780518,0.000095485106,0.00040966843,0.00013245709,0.9466536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99612314,0.000042189506,0.0010100452,0.0011530176,0.0010587415,0.00061289244],"domain_scores_gemma":[0.99493194,0.00016494162,0.0006268241,0.0038111946,0.00022238061,0.00024271663],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005696893,0.0006636912,0.0010092501,0.000641887,0.00008563007,0.00012021302,0.0038683536,0.0004862192,0.000034625573],"category_scores_gemma":[0.00011901857,0.0006460827,0.00019472955,0.00025241636,0.000112117355,0.00045326134,0.0015543496,0.0006360394,0.000865365],"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.000008997155,0.00004260561,0.000024276338,0.00028905668,0.00010204228,0.00036723376,0.00011102444,0.00008507559,0.00013164718,0.47515714,0.44813758,0.075543314],"study_design_scores_gemma":[0.00020189579,0.00013667216,0.00001219631,0.00092107145,0.000030117757,0.00006263161,0.000007490867,0.0007261031,0.000041421816,0.001786127,0.995391,0.0006832795],"about_ca_topic_score_codex":0.00006338776,"about_ca_topic_score_gemma":0.000041321535,"teacher_disagreement_score":0.54725343,"about_ca_system_score_codex":0.00013018322,"about_ca_system_score_gemma":0.0003059492,"threshold_uncertainty_score":0.99991256},"labels":[],"label_agreement":null},{"id":"W4237478802","doi":"10.22215/etd/2018-13249","title":"P2PSIP over MANETs: Approaches to a Secure Implementation","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Army Research Laboratory; Research, Development and Engineering Command","keywords":"Computer science; Public key infrastructure; Distributed hash table; Redundancy (engineering); Computer network; Hash function; Computer security; Mobile ad hoc network; Hash table; Flooding (psychology); Distributed computing; Public-key cryptography; Peer-to-peer; Encryption; Operating system","score_opus":0.06733819456268755,"score_gpt":0.30530179753615433,"score_spread":0.23796360297346678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237478802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31795722,0.00032907978,0.5608049,0.009690937,0.0056603593,0.004992874,0.00007562306,0.006428995,0.094060004],"genre_scores_gemma":[0.18378408,0.000019142519,0.7685399,0.0028647236,0.00070374866,0.0009840407,0.0014848778,0.000121493555,0.041498017],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975584,0.000029403183,0.00036813354,0.00094862236,0.0005709391,0.0005244767],"domain_scores_gemma":[0.9984791,0.000030902556,0.00015433252,0.0010972689,0.0001037643,0.00013460552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023633057,0.0003801009,0.00030206403,0.0004936338,0.00012053839,0.0003543298,0.0021031674,0.00033393945,0.00018669937],"category_scores_gemma":[0.000030162077,0.0003559949,0.00008490486,0.000958583,0.000015466168,0.00033198943,0.00041559982,0.00022741176,0.0006013732],"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.000028674822,0.000054152053,0.00020252955,0.00008778723,0.0000968473,0.00001281177,0.0058194133,0.000038057216,0.0002315114,0.09811651,0.5671887,0.328123],"study_design_scores_gemma":[0.0015733617,0.002144317,0.04960743,0.00050574896,0.00016336636,0.000036480888,0.01256765,0.011332469,0.05419165,0.06798734,0.79448026,0.0054099276],"about_ca_topic_score_codex":0.00014219095,"about_ca_topic_score_gemma":0.0036564374,"teacher_disagreement_score":0.32271308,"about_ca_system_score_codex":0.0001395877,"about_ca_system_score_gemma":0.00010384652,"threshold_uncertainty_score":0.9998892},"labels":[],"label_agreement":null},{"id":"W4238292571","doi":"10.22215/etd/2011-08645","title":"Hierarchical notification dissemination for IMS presence using network coordinates","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Telecommunications","score_opus":0.031440364348210854,"score_gpt":0.31127501702996124,"score_spread":0.2798346526817504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238292571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01819116,0.00024965362,0.9730579,0.00053945574,0.0022694531,0.0014543807,0.00000997535,0.0011145816,0.0031134118],"genre_scores_gemma":[0.29963675,0.000033678592,0.677185,0.00009056679,0.0004355977,0.0006447031,0.0006846636,0.00007814611,0.021210894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974824,0.000048405844,0.0004904256,0.0009724445,0.00039089544,0.0006153901],"domain_scores_gemma":[0.9975931,0.00045623674,0.00032203522,0.0010498322,0.00046640652,0.00011241202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047224655,0.00037378416,0.00037229375,0.0003222984,0.00029363137,0.00028573294,0.0022435188,0.00051304017,0.000012536329],"category_scores_gemma":[0.00044993413,0.00036100426,0.00013009066,0.00096081453,0.000046551493,0.00048470107,0.00023670544,0.00033583053,0.000028251887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014250039,0.0001775279,0.00031862027,0.00027079307,0.00010384936,0.000006560444,0.0020134652,0.0025991367,0.0059513124,0.40088108,0.06225512,0.52528],"study_design_scores_gemma":[0.0003963215,0.00047460652,0.009547771,0.0012299264,0.00013943751,0.00001682389,0.00036937237,0.7061826,0.048657596,0.2175997,0.012971705,0.0024141239],"about_ca_topic_score_codex":0.000049661445,"about_ca_topic_score_gemma":0.00014836602,"teacher_disagreement_score":0.7035835,"about_ca_system_score_codex":0.00009852746,"about_ca_system_score_gemma":0.0001148742,"threshold_uncertainty_score":0.9998842},"labels":[],"label_agreement":null},{"id":"W4239054663","doi":"10.1007/978-3-319-03807-0_5","title":"Availability","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","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":"Backup; Computer science; Overlay; Overlay network; Service (business); Resource (disambiguation); File sharing; Shared resource; Enhanced Data Rates for GSM Evolution; Peer-to-peer; Computer network; Distributed computing; World Wide Web; The Internet; Operating system; Telecommunications; Business","score_opus":0.01946660548552594,"score_gpt":0.23336138399913492,"score_spread":0.21389477851360897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239054663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007488399,0.00021159931,0.7842048,0.0023296513,0.0033225263,0.0009701793,0.000003692923,0.0015526621,0.20665605],"genre_scores_gemma":[0.026658243,0.000072565985,0.9150691,0.0023107964,0.0005667748,0.00008702362,0.0000016755795,0.000083955565,0.055149864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99347806,0.000025394138,0.0008356348,0.0028018996,0.0015690831,0.0012899112],"domain_scores_gemma":[0.99424386,0.00018849495,0.00029316684,0.004458421,0.00041488686,0.00040119488],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017844967,0.00070788997,0.00073674385,0.0013569638,0.0002546173,0.0010364562,0.011442485,0.00040701238,0.00013858419],"category_scores_gemma":[0.00013727877,0.0007214443,0.00015896936,0.001154,0.0012393598,0.0012903399,0.009377838,0.0010742312,0.0027200594],"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.0000017388267,0.000031344167,0.00011488395,0.000028404691,0.000008940117,0.00008433417,0.00018936537,0.0007383122,0.00006961293,0.52033216,0.004063748,0.47433713],"study_design_scores_gemma":[0.00057911675,0.00059353886,0.007995866,0.001033039,0.000013286406,0.00013324845,0.0000020871453,0.19228522,0.0016196659,0.38391364,0.40780982,0.0040214667],"about_ca_topic_score_codex":0.00006476296,"about_ca_topic_score_gemma":0.000046083613,"teacher_disagreement_score":0.47031567,"about_ca_system_score_codex":0.0007614834,"about_ca_system_score_gemma":0.00060409494,"threshold_uncertainty_score":0.99952364},"labels":[],"label_agreement":null},{"id":"W4239495461","doi":"10.22215/etd/2018-13291","title":"A DHT-Based Routing Solution for Hierarchical MANETs","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Research, Development and Engineering Command","keywords":"Flooding (psychology); Computer network; Computer science; Default gateway; Routing (electronic design automation); Distributed computing; Routing protocol; Interconnection; Backbone network; Overlay network; Node (physics); Hierarchical routing; Static routing; Engineering; World Wide Web; The Internet","score_opus":0.02019206615558448,"score_gpt":0.2877693705861627,"score_spread":0.2675773044305782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239495461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061122933,0.000039576847,0.98130697,0.0022555424,0.0014511567,0.00073577766,0.0000070547785,0.0017346854,0.0063569634],"genre_scores_gemma":[0.123651825,0.0000018368191,0.86463803,0.0006835264,0.0003335135,0.00033012882,0.0004176147,0.00004248694,0.009901031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978299,0.000027904214,0.00034677162,0.00080519094,0.00038994206,0.0006002696],"domain_scores_gemma":[0.99849427,0.00016745891,0.00016457133,0.00084612705,0.00023247485,0.00009510627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037325826,0.0003028476,0.00030263604,0.00035437415,0.00022629093,0.00021830373,0.0017931085,0.00047859145,0.0000136148765],"category_scores_gemma":[0.0002714093,0.0002880251,0.0001416375,0.00047332337,0.000035570574,0.00014804729,0.00017178826,0.00028638338,0.00012167913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013261726,0.00011381784,0.000043068958,0.00018349967,0.000062382096,0.000013074378,0.0006139509,0.00011420983,0.0016553495,0.09982133,0.14694746,0.7502992],"study_design_scores_gemma":[0.0007818473,0.0009238883,0.0016297381,0.00040923184,0.000042837724,0.0000069785456,0.00008170764,0.8947641,0.01779104,0.028032817,0.054242797,0.0012929924],"about_ca_topic_score_codex":0.000035133977,"about_ca_topic_score_gemma":0.00046346226,"teacher_disagreement_score":0.8946499,"about_ca_system_score_codex":0.000114941744,"about_ca_system_score_gemma":0.00020853395,"threshold_uncertainty_score":0.9999572},"labels":[],"label_agreement":null},{"id":"W4239615058","doi":"10.32920/ryerson.14654274.v1","title":"Improving Streaming Capacity In Tree &amp; Meshed Based P2P Live Streaming Systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Live streaming; Computer science; Upload; Computer network; Channel (broadcasting); Shared resource; Bandwidth (computing); Channel capacity; Overlay; Tree (set theory); Channel allocation schemes; Distributed computing; Telecommunications; Wireless; Mathematics; World Wide Web","score_opus":0.045669989915190314,"score_gpt":0.24722969185495297,"score_spread":0.20155970193976266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239615058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35701597,0.00040150693,0.6363169,0.00057669677,0.001479738,0.0008448601,0.000017191192,0.0018734152,0.0014737233],"genre_scores_gemma":[0.70655334,0.000009624969,0.29258707,0.000107515254,0.0001033937,0.00021809593,0.000036601486,0.00003907214,0.00034527108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944148,0.00031113054,0.0009997163,0.0022729868,0.0008805231,0.001120862],"domain_scores_gemma":[0.9947768,0.00053326087,0.00047818848,0.0036652137,0.00032569616,0.00022087948],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011355099,0.00079815416,0.0011219657,0.00095188664,0.00014564197,0.0014949455,0.0041903066,0.0008599316,0.000017784954],"category_scores_gemma":[0.00078112807,0.00081327104,0.0002503115,0.0011740322,0.0000875147,0.00046590925,0.006941574,0.0016982486,0.000040068782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035250414,0.00094065524,0.023903595,0.0030745128,0.00047741662,0.0012969442,0.009308364,0.36252573,0.015106743,0.0095687555,0.0028244667,0.5709376],"study_design_scores_gemma":[0.00059423933,0.00007928919,0.0049346737,0.0022251836,0.00003757215,0.000026659902,0.001481275,0.98394716,0.0040017096,0.00056819886,0.0003507296,0.0017533135],"about_ca_topic_score_codex":0.015214679,"about_ca_topic_score_gemma":0.018504461,"teacher_disagreement_score":0.62142146,"about_ca_system_score_codex":0.0009765366,"about_ca_system_score_gemma":0.0006683806,"threshold_uncertainty_score":0.9995416},"labels":[],"label_agreement":null},{"id":"W4239615557","doi":"10.4018/9781605662503.ch006","title":"Local Algorithms for Topology Control in Ad-Hoc Networks","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Computer science; Vertex (graph theory); Wireless ad hoc network; Topology control; Routing (electronic design automation); Topology (electrical circuits); Control (management); Enhanced Data Rates for GSM Evolution; Graph traversal; Distributed computing; Subject (documents); Computer network; Theoretical computer science; Algorithm; Mathematics; Graph; Combinatorics; World Wide Web; Artificial intelligence; Telecommunications","score_opus":0.02257086033933519,"score_gpt":0.250358859341501,"score_spread":0.2277879990021658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239615557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032990165,0.001808613,0.67925566,0.00046437178,0.0012370927,0.000907962,0.000054647277,0.0006426869,0.31562567],"genre_scores_gemma":[0.45284605,0.00022339133,0.34890416,0.023651646,0.002172889,0.0019031592,0.000033315835,0.0005005814,0.1697648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967138,0.0000308542,0.0006580954,0.0011972968,0.00032103722,0.0010788979],"domain_scores_gemma":[0.99776334,0.000150539,0.00026122655,0.0014291415,0.00017581355,0.0002199245],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00032080538,0.0006689002,0.000957611,0.00022414053,0.00009079917,0.000099419885,0.0028802392,0.0013283836,0.0000093705185],"category_scores_gemma":[0.000032503343,0.0006812014,0.0002791044,0.00007293371,0.00033911332,0.000085633634,0.0009330077,0.0006336959,0.00011196459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005098661,0.000008763934,0.0000043583987,0.000006724464,0.000049656916,0.00010657175,0.000025258034,0.00017776286,4.409898e-7,0.71156776,0.006320252,0.28168148],"study_design_scores_gemma":[0.0010786712,0.0005911351,0.000025211475,0.00013032112,0.000033848253,0.000077710894,0.0000048945662,0.015755996,0.000008889581,0.77171415,0.20980127,0.0007779143],"about_ca_topic_score_codex":0.000054115695,"about_ca_topic_score_gemma":0.0006761845,"teacher_disagreement_score":0.45284274,"about_ca_system_score_codex":0.00046772172,"about_ca_system_score_gemma":0.0002066469,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W4239781250","doi":"10.1007/978-3-319-03807-0_6","title":"Conclusion","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","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":"World Wide Web; Computer science; File sharing; Multimedia; Peer-to-peer; The Internet","score_opus":0.015789552756426035,"score_gpt":0.232994940584916,"score_spread":0.21720538782848994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239781250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000393175,0.00024179557,0.8130633,0.0024496303,0.0033264756,0.00076770235,0.0000023953662,0.001252693,0.1785028],"genre_scores_gemma":[0.02875215,0.00013489585,0.90867645,0.0034260126,0.00070797745,0.00006736726,0.0000022736024,0.00009677156,0.05813609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942415,0.000019313435,0.0007093311,0.0022875152,0.0015742836,0.0011680999],"domain_scores_gemma":[0.99565357,0.00015228828,0.000290265,0.003184298,0.0003555358,0.000364036],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012034652,0.0006574542,0.0006672427,0.001545753,0.00031792707,0.0009406687,0.010335312,0.0003963911,0.000084298656],"category_scores_gemma":[0.000077182056,0.000662343,0.0001341628,0.0010392277,0.0009002342,0.0011661892,0.012978327,0.000936039,0.0017739438],"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.0000013344641,0.000015804355,0.000022770479,0.000015356292,0.000006109397,0.00011468902,0.00019241897,0.0008160753,0.00013763663,0.55039805,0.0034609642,0.44481876],"study_design_scores_gemma":[0.0006365459,0.0005762743,0.0019776467,0.0014350897,0.000011169349,0.00017055635,0.0000022081642,0.2711644,0.0020645487,0.25734347,0.4612577,0.0033604093],"about_ca_topic_score_codex":0.000052300285,"about_ca_topic_score_gemma":0.000029061619,"teacher_disagreement_score":0.45779672,"about_ca_system_score_codex":0.0006281194,"about_ca_system_score_gemma":0.00050551986,"threshold_uncertainty_score":0.99958277},"labels":[],"label_agreement":null},{"id":"W4241303765","doi":"10.1109/wetice.2007.4407138","title":"A Dominating Set Based Peer-to-Peer Protocol for Real-Time Multi-source Collaboration","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Videoconferencing; Computer science; Integrated Services Digital Network; Multimedia; Teleconference; WebRTC; Peer-to-peer; The Internet; Variety (cybernetics); Protocol (science); Voice over IP; Set (abstract data type); Collaborative software; Computer network; World Wide Web","score_opus":0.03552573415768297,"score_gpt":0.3558637745260935,"score_spread":0.32033804036841057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241303765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001744699,3.2654447e-7,0.8840246,0.0128585715,0.00009436799,0.09762484,0.0000114612085,0.0019094319,0.0017317057],"genre_scores_gemma":[0.0068508885,1.772668e-8,0.86382276,0.0011312268,0.000094530944,0.11407932,0.000011259253,0.000034229655,0.013975748],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968921,0.000053272113,0.000536331,0.0008064625,0.00090264814,0.00080921187],"domain_scores_gemma":[0.99649495,0.0005190353,0.00017798005,0.0010249199,0.0015499524,0.00023314648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002915982,0.00030606776,0.00029969835,0.00046726764,0.00026385652,0.00042279437,0.0015227676,0.0002075381,0.000023036968],"category_scores_gemma":[0.0017375526,0.00028183818,0.000078064586,0.0021075292,0.000042048217,0.00042740125,0.00046340004,0.00015317509,0.00018962183],"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.00050681253,0.0005728237,0.0010464799,0.00015533454,0.000052876414,0.00004401317,0.0047372137,0.015730217,0.08307823,0.009912992,0.6218826,0.26228037],"study_design_scores_gemma":[0.0031279193,0.0007227105,0.00095644535,0.00010360718,0.00000736883,0.0000065773706,0.00036996795,0.6331012,0.095475115,0.00036023022,0.26500738,0.0007614366],"about_ca_topic_score_codex":0.00006349837,"about_ca_topic_score_gemma":0.00021737661,"teacher_disagreement_score":0.617371,"about_ca_system_score_codex":0.00024367568,"about_ca_system_score_gemma":0.00018125784,"threshold_uncertainty_score":0.9999634},"labels":[],"label_agreement":null},{"id":"W4241886463","doi":"10.1007/978-1-4939-7131-2_100733","title":"Network Games","year":2018,"lang":"en","type":"book-chapter","venue":"","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.02298006758335179,"score_gpt":0.22732270350809522,"score_spread":0.20434263592474344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241886463","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001949929,0.00043701637,0.227372,0.002742535,0.0010636466,0.00020490258,0.0000019904303,0.0023154072,0.76586056],"genre_scores_gemma":[0.00011682291,0.00004754052,0.19632998,0.0025857075,0.0009201351,0.000012108439,0.0000032839496,0.000038703998,0.7999457],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978136,0.000007784163,0.00030937823,0.0008585152,0.00043638717,0.00057432527],"domain_scores_gemma":[0.99739224,0.00008667654,0.00013610502,0.0021126908,0.00014403167,0.00012826285],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022635852,0.00042152384,0.00041768487,0.00019864652,0.00009641953,0.00021427167,0.0034482353,0.0005149263,0.00067331083],"category_scores_gemma":[0.000025652047,0.00037177373,0.00012475807,0.00013945074,0.00014756511,0.00015720377,0.0024018376,0.00037608328,0.00627564],"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":[7.4413305e-7,0.0000013806076,0.0000015389954,0.0000020133577,0.000015633388,0.000015032652,0.000015259857,0.000017943146,3.906612e-7,0.4617238,0.5074995,0.030706754],"study_design_scores_gemma":[0.000030227666,0.00008184954,0.000007721628,0.00006607429,0.0000054218362,0.000011320047,6.685066e-7,0.00035538414,0.000013762037,0.35185,0.6472513,0.00032626948],"about_ca_topic_score_codex":0.0000043077926,"about_ca_topic_score_gemma":0.00003661204,"teacher_disagreement_score":0.13975178,"about_ca_system_score_codex":0.00007401827,"about_ca_system_score_gemma":0.000070987706,"threshold_uncertainty_score":0.9998734},"labels":[],"label_agreement":null},{"id":"W4242592732","doi":"10.4018/9781591403845.ch010","title":"Object-Oriented Publish/Subscribe for Modeling and Processing Imperfect Information","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Dissemination; Object (grammar); World Wide Web; Imperfect; Set (abstract data type); Perfect information; Matching (statistics); Artificial intelligence","score_opus":0.022568708442687522,"score_gpt":0.23502875961278344,"score_spread":0.21246005117009592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242592732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015672467,0.00027147811,0.5437578,0.00011839222,0.00039549178,0.00071645493,0.00004280835,0.00097315083,0.4535677],"genre_scores_gemma":[0.71916384,0.000024395997,0.26363719,0.0026847038,0.0005205764,0.0004867376,0.000052041043,0.00013188785,0.013298652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790263,0.000008015651,0.0005241508,0.0006007182,0.00040781463,0.0005566618],"domain_scores_gemma":[0.998289,0.000023899285,0.000282194,0.000738276,0.0004983065,0.00016831588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002814107,0.00047650293,0.00043811364,0.00027029513,0.00021825061,0.0007516059,0.0011732705,0.0005334443,0.000001058884],"category_scores_gemma":[0.0000994243,0.00046753316,0.00012036995,0.00008215095,0.0000726093,0.0012277587,0.00092482596,0.00031033022,0.000024775178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018981258,0.0000026545565,0.0000033079286,0.00006298212,0.000025333555,0.0000028605243,0.0002908471,0.000057719622,0.0000031390064,0.81495947,0.0018772925,0.18269542],"study_design_scores_gemma":[0.00061425194,0.0003313571,0.0000073980714,0.0005081191,0.00006397788,0.00008695314,0.000033157492,0.10108185,0.000101454294,0.8422465,0.053827535,0.0010974873],"about_ca_topic_score_codex":0.000045925124,"about_ca_topic_score_gemma":0.000037212303,"teacher_disagreement_score":0.7190071,"about_ca_system_score_codex":0.00022598558,"about_ca_system_score_gemma":0.00026754773,"threshold_uncertainty_score":0.9997776},"labels":[],"label_agreement":null},{"id":"W4244036065","doi":"10.1007/s12083-010-0071-5","title":"Editorial: Peer-to-peer networking and applications, volume 3, issue 2","year":2010,"lang":"en","type":"editorial","venue":"Peer-to-Peer Networking and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Volume (thermodynamics); Peer-to-peer; Peer review; Computer science; World Wide Web; Political science; Physics","score_opus":0.00851742400309461,"score_gpt":0.26893828925758206,"score_spread":0.26042086525448743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244036065","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028206618,0.0010895731,0.33396652,0.049718186,0.6043362,0.0054651103,0.00046156038,0.0029393688,0.0019952462],"genre_scores_gemma":[0.0007284589,0.00028975972,0.07507596,0.0015284125,0.87743026,0.010603228,0.001071105,0.0004147044,0.03285814],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98271203,0.00023213832,0.0020838173,0.0052773785,0.006520404,0.0031742586],"domain_scores_gemma":[0.9829831,0.0020055233,0.000892899,0.0056971945,0.005961148,0.002460122],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.00523116,0.002187275,0.0021599864,0.0015982756,0.0023620527,0.0037294978,0.0075082798,0.003361657,0.000023828425],"category_scores_gemma":[0.0016647731,0.0024458594,0.00035673298,0.005810584,0.00040763358,0.0005632686,0.005804501,0.0049113915,0.001403098],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002950339,0.00011952414,0.00010452626,0.00007028217,0.00011622422,0.000005346157,0.00048230615,0.0012465251,0.00006968739,0.0012507604,0.82391185,0.17259349],"study_design_scores_gemma":[0.0005683972,0.00025506644,0.000097009615,0.0003290232,0.00021473337,0.000022545284,0.00008421009,0.0018284061,0.000029868788,0.0035167534,0.9904023,0.0026517275],"about_ca_topic_score_codex":0.00045059217,"about_ca_topic_score_gemma":0.0003915268,"teacher_disagreement_score":0.27309403,"about_ca_system_score_codex":0.0005296157,"about_ca_system_score_gemma":0.0006293162,"threshold_uncertainty_score":0.99937445},"labels":[],"label_agreement":null},{"id":"W4244289585","doi":"10.1109/icpp.2004.1327908","title":"Mitigating information asymmetries to achieve efficient peer-to-peer queries","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Peer-to-peer; Flooding (psychology); Distributed computing; Context (archaeology); Mechanism design; Theoretical computer science","score_opus":0.009452564992604506,"score_gpt":0.2411021021295381,"score_spread":0.2316495371369336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244289585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12423259,0.000011134213,0.76275605,0.099897355,0.00052569,0.0005280364,0.000007953073,0.0017597611,0.01028145],"genre_scores_gemma":[0.5696692,5.3541766e-7,0.4251504,0.004224172,0.000045889203,0.00007035546,0.000006082966,0.00001012989,0.0008232503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99695635,0.00002455477,0.000506038,0.00045632524,0.0013281303,0.0007285859],"domain_scores_gemma":[0.99776065,0.00011453147,0.00009801323,0.0009756132,0.00074715103,0.00030406236],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00081678753,0.0002946142,0.00027051553,0.00077400345,0.00029369196,0.0007957301,0.0018156668,0.00013139503,0.00000801651],"category_scores_gemma":[0.0019605716,0.0002664679,0.000072965406,0.0030950587,0.000065056476,0.0010620368,0.0015616387,0.00023907886,0.0014635068],"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.00003167555,0.0000813657,0.00031123814,0.000025528438,0.000032234886,0.000012625699,0.012639646,0.23578842,0.0007610994,0.5176773,0.044829167,0.18780968],"study_design_scores_gemma":[0.0021746422,0.003445135,0.0172111,0.00047583986,0.000029358162,0.00011851063,0.0092776865,0.026709506,0.2524683,0.033574753,0.65073097,0.003784196],"about_ca_topic_score_codex":0.00020948648,"about_ca_topic_score_gemma":0.00010998459,"teacher_disagreement_score":0.60590184,"about_ca_system_score_codex":0.00027981796,"about_ca_system_score_gemma":0.00013014549,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W4244365690","doi":"10.1007/978-3-540-76778-7_19","title":"A Policy Management Framework for Content-Based Publish/Subscribe Middleware","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":15,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Publication; Middleware (distributed applications); Distributed computing; Business; Advertising","score_opus":0.059728723721645664,"score_gpt":0.29173745792197736,"score_spread":0.2320087342003317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244365690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001741345,0.00030142374,0.9804094,0.011322988,0.0024627845,0.0017242538,0.000023279936,0.0010480478,0.00269043],"genre_scores_gemma":[0.009178254,0.000016308517,0.97615904,0.013002102,0.0007103038,0.00010999969,0.000012476659,0.00007030782,0.00074121816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930924,0.000024165814,0.0008154394,0.0026421305,0.001639747,0.0017860846],"domain_scores_gemma":[0.99431336,0.001029876,0.00039602566,0.0032715339,0.0006122423,0.00037694772],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015271062,0.00091149594,0.00082053675,0.0037303898,0.0003796415,0.001467486,0.009895663,0.0008265032,0.000007767299],"category_scores_gemma":[0.0006276783,0.0008724757,0.00029835178,0.0026384364,0.000787444,0.00066469243,0.00324855,0.0011716584,0.00005030994],"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.000014315291,0.00003238357,0.00002128469,0.00006888918,0.00002123175,0.00009285797,0.0001421904,0.006770579,0.0000089698215,0.37716466,0.00020534827,0.6154573],"study_design_scores_gemma":[0.00069493585,0.00050149835,0.00014494207,0.0015302058,0.000022030546,0.000035161625,0.0000014421386,0.12134148,0.0016734729,0.8537555,0.018631356,0.0016680245],"about_ca_topic_score_codex":0.000034620505,"about_ca_topic_score_gemma":0.00012210433,"teacher_disagreement_score":0.61378926,"about_ca_system_score_codex":0.00094896974,"about_ca_system_score_gemma":0.0006412454,"threshold_uncertainty_score":0.99956906},"labels":[],"label_agreement":null},{"id":"W4244609217","doi":"10.32920/ryerson.14657418","title":"DistVid : an examination of a distributed video streaming system","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Popularity; Protocol (science); Overlay; Bandwidth (computing); Frame (networking); Video on demand; Server; File sharing; Computer network; Multimedia; World Wide Web; The Internet; Operating system","score_opus":0.01977448108051695,"score_gpt":0.2490853768762434,"score_spread":0.22931089579572644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244609217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22306375,0.00009363803,0.773318,0.00029951835,0.00047325395,0.00031372978,0.000047291625,0.0014613303,0.00092949864],"genre_scores_gemma":[0.8833794,0.0000052527807,0.11617565,0.000015345418,0.000041248397,0.00007621635,0.00021809022,0.000013636666,0.000075128504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740523,0.0001693759,0.0005393489,0.000996078,0.00055103906,0.00033892985],"domain_scores_gemma":[0.9966553,0.00011635603,0.0003153697,0.002398329,0.00040520268,0.000109428045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057919737,0.00030828617,0.00052052806,0.00026880388,0.00006312018,0.00037754697,0.0027438104,0.00035694917,0.0000044903727],"category_scores_gemma":[0.00018813628,0.00030164138,0.00011058756,0.0007820951,0.000047807447,0.00034480618,0.0049036155,0.00037451353,0.0000052537594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088921815,0.00046235754,0.0013224301,0.0017912143,0.00025194735,0.00025568277,0.0029048624,0.020156834,0.0029430857,0.13339213,0.0012240733,0.8352865],"study_design_scores_gemma":[0.00047413318,0.0003480042,0.12323912,0.0029143747,0.00009274005,0.0000675207,0.0045304643,0.8252635,0.039017413,0.0016858919,0.00058746693,0.001779338],"about_ca_topic_score_codex":0.00019045552,"about_ca_topic_score_gemma":0.00014797812,"teacher_disagreement_score":0.8335072,"about_ca_system_score_codex":0.0003280725,"about_ca_system_score_gemma":0.00015009401,"threshold_uncertainty_score":0.99994355},"labels":[],"label_agreement":null},{"id":"W4244773943","doi":"10.1109/netgames.2015.7382988","title":"DynFilter: Limiting bandwidth of online games using adaptive pub/sub message filtering","year":2015,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bandwidth (computing); Computer science; Provisioning; Limiting; Computer network; Server; Distributed computing; Engineering","score_opus":0.07891009928098863,"score_gpt":0.2812554735949167,"score_spread":0.20234537431392807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244773943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36978185,0.00013029171,0.62595034,0.00074275635,0.00023272596,0.0001387879,0.000006500572,0.0006316141,0.002385136],"genre_scores_gemma":[0.60374784,0.000004221858,0.3959413,0.0001339825,0.00004962661,0.0000041706035,0.0000013929167,0.000011195549,0.0001062796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819005,0.000055407185,0.00037795704,0.00047225037,0.00042493627,0.00047942696],"domain_scores_gemma":[0.99854517,0.0001168724,0.000165119,0.00079410855,0.00022116415,0.0001575534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004557728,0.00021664529,0.0003320884,0.00027030316,0.000057725694,0.00010855328,0.0014125457,0.00009696706,0.000005249053],"category_scores_gemma":[0.00024499648,0.00019570465,0.00006905853,0.0007756518,0.00007721713,0.00061762286,0.0015821762,0.00018338971,0.000011998495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011229018,0.00074577425,0.008708489,0.0001060459,0.00030408028,0.00032672143,0.005189383,0.051088598,0.11984071,0.056217324,0.011979016,0.74538153],"study_design_scores_gemma":[0.00077504385,0.0006233987,0.002189004,0.00032313284,0.000022663873,0.00009509771,0.0011044861,0.7959349,0.19020073,0.005996319,0.0019335287,0.000801684],"about_ca_topic_score_codex":0.00008305925,"about_ca_topic_score_gemma":0.000058521222,"teacher_disagreement_score":0.7448463,"about_ca_system_score_codex":0.00011380727,"about_ca_system_score_gemma":0.000106865955,"threshold_uncertainty_score":0.7980604},"labels":[],"label_agreement":null},{"id":"W4245021091","doi":"10.1109/simsym.2004.1299488","title":"Scalability and performance evaluation of an aggregation/disaggregation scheme for data distribution management in large-scale distributed interactive systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scalability; Computer science; Interoperability; Distributed computing; High-level architecture; Consistency (knowledge bases); Reuse; Scheme (mathematics); Implementation; Distributed Interactive Simulation; Scale (ratio); Data aggregator; Database; Software engineering; Computer network; Operating system; Artificial intelligence","score_opus":0.03602926113987373,"score_gpt":0.31099590547512806,"score_spread":0.2749666443352543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245021091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49882725,0.00003068351,0.49964833,0.0003021923,0.00007614435,0.00087942556,0.00013001547,0.000084937434,0.000021019132],"genre_scores_gemma":[0.9306624,0.000010174152,0.06791222,0.000009780308,0.000012061749,0.00019116678,0.0011936977,0.0000042744755,0.0000042386537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998287,0.00007345837,0.00037798093,0.0005813818,0.00044664572,0.00023348318],"domain_scores_gemma":[0.9983076,0.00005195833,0.00016501086,0.0010640678,0.00036317855,0.00004818859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165854,0.00012617129,0.00017062931,0.00011420074,0.00008280513,0.00009789348,0.0007871836,0.00007176732,8.8743207e-7],"category_scores_gemma":[0.00021496874,0.000120250406,0.000015007966,0.0006736529,0.000046855348,0.0017704896,0.00058769475,0.000077597215,0.0000017092767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022942369,0.0012049621,0.034134027,0.00038090217,0.0000990394,0.0000016846292,0.0011004538,0.06618913,0.0002775128,0.053936414,0.0003503869,0.8420961],"study_design_scores_gemma":[0.0011197475,0.0001244819,0.0887119,0.00012615074,0.000015484431,0.0000021351498,0.00029565507,0.90485,0.0017193578,0.0028128757,0.000094109935,0.00012808123],"about_ca_topic_score_codex":0.000062142644,"about_ca_topic_score_gemma":0.00021941002,"teacher_disagreement_score":0.841968,"about_ca_system_score_codex":0.00041877225,"about_ca_system_score_gemma":0.000051117855,"threshold_uncertainty_score":0.49036694},"labels":[],"label_agreement":null},{"id":"W4245836516","doi":"10.1002/9780470512494.index","title":"Index","year":2007,"lang":"en","type":"paratext","venue":"","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":"Carleton University","funders":"","keywords":"Index (typography); Humanities; Art; Library science; Computer science","score_opus":0.01858494846637018,"score_gpt":0.27918490505302057,"score_spread":0.2605999565866504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245836516","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011544517,0.00030117226,0.5438321,0.0014274374,0.002259153,0.00012951864,0.000002375077,0.0006683594,0.45136833],"genre_scores_gemma":[0.0027427918,0.0000746724,0.14453615,0.003145935,0.0004019848,0.000027647808,0.000012485926,0.000028388884,0.84902996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978325,0.000016896412,0.00028287587,0.00074092194,0.00048880524,0.00063802913],"domain_scores_gemma":[0.9978653,0.00008497627,0.00009407105,0.001721687,0.00010615555,0.00012777596],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027017723,0.0003221291,0.00034682674,0.0006161923,0.00006389543,0.00023873824,0.004511481,0.00063680153,0.00064515823],"category_scores_gemma":[0.000036743524,0.0002833801,0.00008704798,0.0011919336,0.000050678205,0.00015743915,0.0020415655,0.00060151785,0.056663103],"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":[8.2997803e-7,0.000009521583,0.000006832235,0.0000060518487,0.000012025433,0.000016854086,0.000015924961,0.00013728348,0.000004555035,0.0065194964,0.91103566,0.082234986],"study_design_scores_gemma":[0.00005939608,0.00004426794,0.00007607886,0.00003210766,0.0000016251446,0.00001245695,0.000004120651,0.0012436905,0.0005031561,0.0010022427,0.9966299,0.00039094765],"about_ca_topic_score_codex":0.00006402397,"about_ca_topic_score_gemma":0.00004255454,"teacher_disagreement_score":0.39929596,"about_ca_system_score_codex":0.00011145804,"about_ca_system_score_gemma":0.00012453723,"threshold_uncertainty_score":0.99996185},"labels":[],"label_agreement":null},{"id":"W4247455945","doi":"10.32920/ryerson.14657298.v1","title":"Peer-To-Peer Multimedia And Information Sharing In Social Networking Web Sites","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Network topology; Overlay network; Peer-to-peer; World Wide Web; Multimedia; Social network (sociolinguistics); Information sharing; Overlay; Computer network; Social media; The Internet","score_opus":0.028339151216880375,"score_gpt":0.2732190970398182,"score_spread":0.24487994582293784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247455945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5268553,0.00044170962,0.3718603,0.07495319,0.004138728,0.0019329855,0.000024589226,0.0038073536,0.015985856],"genre_scores_gemma":[0.7300527,0.000035738758,0.2667131,0.0016364417,0.00048131862,0.00014770307,0.000098485245,0.000022433422,0.0008120668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669105,0.000046468966,0.0006456548,0.0008915703,0.001016227,0.0007090233],"domain_scores_gemma":[0.998074,0.0001351566,0.00018649043,0.00090498786,0.0005457027,0.00015368513],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011880345,0.00042238025,0.0005277555,0.0008293078,0.00016628012,0.0017939111,0.0022468586,0.00057938736,0.000013485665],"category_scores_gemma":[0.000551105,0.00045398925,0.00009032937,0.0012175931,0.000047567453,0.0013523697,0.013535143,0.0010684466,0.000058976642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022155178,0.0000898274,0.037230365,0.0002537607,0.00012392136,0.00010163855,0.027980145,0.02468495,0.0004386358,0.010397903,0.08033103,0.81834567],"study_design_scores_gemma":[0.0004944131,0.00003902724,0.026619261,0.00035084144,0.000014245793,0.000013762872,0.0006665889,0.9236655,0.00031823042,0.003898266,0.042708777,0.001211076],"about_ca_topic_score_codex":0.00014075737,"about_ca_topic_score_gemma":0.0005582511,"teacher_disagreement_score":0.89898056,"about_ca_system_score_codex":0.00023861333,"about_ca_system_score_gemma":0.00016170675,"threshold_uncertainty_score":0.9997912},"labels":[],"label_agreement":null},{"id":"W4248508814","doi":"10.1109/netgames.2013.6820604","title":"Lamoth: A message dissemination middleware for MMOGs in the cloud","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cloud computing; Server; Middleware (distributed applications); Distributed computing; Computer network; Operating system","score_opus":0.01484914606003725,"score_gpt":0.261226741623769,"score_spread":0.24637759556373176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248508814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09601214,0.00007525789,0.8417782,0.053275947,0.0002893167,0.0012722621,0.0000023094449,0.0006592731,0.006635258],"genre_scores_gemma":[0.93265253,0.000002892556,0.06402759,0.0009235368,0.000042225165,0.00043509345,0.0000023858802,0.000005772247,0.0019079598],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991203,0.0000280781,0.00014378718,0.00025229546,0.00018729143,0.00026823246],"domain_scores_gemma":[0.99895656,0.00033431183,0.000032571563,0.0005882054,0.00006347811,0.000024893714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035457397,0.00009454751,0.000092794464,0.000101226266,0.00006188859,0.00020130222,0.0016062229,0.00006350629,0.000013937916],"category_scores_gemma":[0.000173507,0.00006044032,0.000034458324,0.00055809045,0.00002389473,0.0003384358,0.00023988064,0.00008581923,0.000085264044],"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.0000029646892,0.0001093598,0.0012204733,0.000020005828,0.0000067005226,0.0000054654956,0.0035621885,0.000071806986,0.0010213723,0.3106215,0.37592998,0.30742818],"study_design_scores_gemma":[0.0013410245,0.0007347402,0.10606492,0.00026082358,0.000015845982,0.000042097883,0.0047211875,0.28631756,0.02149135,0.4218543,0.15563363,0.001522512],"about_ca_topic_score_codex":0.00004664972,"about_ca_topic_score_gemma":0.00011450253,"teacher_disagreement_score":0.8366404,"about_ca_system_score_codex":0.00003012354,"about_ca_system_score_gemma":0.000010667656,"threshold_uncertainty_score":0.29847884},"labels":[],"label_agreement":null},{"id":"W4248627736","doi":"10.1007/978-3-540-30229-2_8","title":"iOverlay: A Lightweight Middleware Infrastructure for Overlay Application Implementations","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","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 Toronto","funders":"","keywords":"PlanetLab; Computer science; Testbed; Overlay; Overlay network; Implementation; Middleware (distributed applications); Distributed computing; Set (abstract data type); Computer network; Operating system; Software engineering; The Internet; Programming language","score_opus":0.012777402824378765,"score_gpt":0.2607294191314862,"score_spread":0.24795201630710742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248627736","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000793093,0.00022306704,0.9907913,0.0043874662,0.0012705087,0.0017544281,0.00006998958,0.00064224616,0.000781682],"genre_scores_gemma":[0.08499984,0.000022702412,0.9111803,0.0027274038,0.00053732755,0.00022572263,0.00004803034,0.00005994984,0.00019873101],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951957,0.000014831632,0.00067671534,0.0021197598,0.0010160949,0.0009769013],"domain_scores_gemma":[0.99638003,0.00040077942,0.000389005,0.002180817,0.00042908755,0.00022025421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005034293,0.0006990633,0.0006007443,0.0012184591,0.00043510925,0.00061561656,0.005251536,0.0005038908,0.000017468938],"category_scores_gemma":[0.00012073585,0.00066401943,0.00018842095,0.0012918656,0.00039295075,0.0006391117,0.0018484797,0.0007004114,0.0000407501],"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.0000074444692,0.000023284672,0.000087933826,0.00005405092,0.000023626895,0.00001616885,0.0007225613,0.07025979,0.00027092517,0.20569187,0.00071498466,0.7221274],"study_design_scores_gemma":[0.0005547399,0.00031805164,0.00040248182,0.000303395,0.000019091476,0.00004904434,7.6859214e-7,0.09998512,0.0025515384,0.8588907,0.03581973,0.0011053437],"about_ca_topic_score_codex":0.00003570399,"about_ca_topic_score_gemma":0.00019430334,"teacher_disagreement_score":0.721022,"about_ca_system_score_codex":0.0010882398,"about_ca_system_score_gemma":0.0009408118,"threshold_uncertainty_score":0.9995811},"labels":[],"label_agreement":null},{"id":"W4248724742","doi":"10.1007/978-3-030-62124-7_16","title":"Internet Multimedia Content Distribution","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","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":"Simon Fraser University","funders":"","keywords":"Computer science; Multimedia; Multicast; The Internet; Scalability; Interactivity; Download; World Wide Web; Peer-to-peer; Computer network; Operating system","score_opus":0.048562784072017535,"score_gpt":0.25358855949375686,"score_spread":0.20502577542173933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248724742","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042847227,0.00047011385,0.9828965,0.001686858,0.0033380531,0.00047051112,0.0000223161,0.00074877235,0.009938401],"genre_scores_gemma":[0.09863352,0.00014013337,0.784496,0.00242285,0.0007437359,0.00007848799,0.00009621398,0.00008134979,0.11330769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952489,0.000028297864,0.00065922405,0.0019425648,0.0012469434,0.0008740635],"domain_scores_gemma":[0.9967089,0.00018103686,0.00025301048,0.0021512278,0.00043455177,0.0002712371],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00097603287,0.00053091877,0.00060171296,0.00064341177,0.00012396972,0.00071756187,0.0066908924,0.0003212884,0.000031194555],"category_scores_gemma":[0.00013590358,0.00052780454,0.00013487983,0.0008557313,0.0007661029,0.00067164254,0.006660098,0.00078998436,0.00037583843],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030573844,0.000044102897,0.00006143703,0.000014935199,0.000012816311,0.00034867617,0.00029724723,0.0003906724,0.00006087114,0.26338136,0.009632712,0.7257521],"study_design_scores_gemma":[0.00095224695,0.0005899629,0.004778732,0.0023331095,0.000019162158,0.00032122128,0.0000069274442,0.72655255,0.0030304715,0.043806467,0.21472494,0.0028842296],"about_ca_topic_score_codex":0.000031915104,"about_ca_topic_score_gemma":0.00006865148,"teacher_disagreement_score":0.72616184,"about_ca_system_score_codex":0.00073986844,"about_ca_system_score_gemma":0.00044489405,"threshold_uncertainty_score":0.99971735},"labels":[],"label_agreement":null},{"id":"W4248800235","doi":"10.22215/etd/2005-07530","title":"A scalable &amp; extensible peer-to-peer network simulator","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Scalability; Computer science; Extensibility; Peer-to-peer; Operating system; World Wide Web","score_opus":0.019822683568717577,"score_gpt":0.2897824253680015,"score_spread":0.2699597417992839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248800235","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06110001,0.0022718506,0.55030024,0.0609635,0.016757783,0.0053390623,0.000058533875,0.018323567,0.28488544],"genre_scores_gemma":[0.026377551,0.000021380167,0.41291603,0.00339303,0.0011011534,0.00020100399,0.00029500833,0.00012653902,0.55556834],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99291444,0.000068795554,0.0008782189,0.0019942033,0.0023302129,0.0018141514],"domain_scores_gemma":[0.9935365,0.00024735354,0.00027959124,0.0034952576,0.0018683189,0.0005729975],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010700109,0.00094571937,0.0010117405,0.0007846226,0.00037737578,0.0009643605,0.0050678574,0.0010119657,0.000296631],"category_scores_gemma":[0.00089763204,0.0009211644,0.00029567964,0.0033922389,0.00003958482,0.00057487685,0.001024754,0.0009696286,0.0066949236],"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.000034701494,0.000074939744,0.000111241985,0.000030041314,0.00007043937,0.000022327178,0.00040901767,0.06309285,0.000115179995,0.01303183,0.8738868,0.049120575],"study_design_scores_gemma":[0.00029405282,0.00013993791,0.0017111348,0.00024245835,0.000041377167,0.0000142027175,0.000107410364,0.015062996,0.0007897097,0.005037839,0.97507674,0.0014821455],"about_ca_topic_score_codex":0.0001326776,"about_ca_topic_score_gemma":0.0033732457,"teacher_disagreement_score":0.27068287,"about_ca_system_score_codex":0.00030654093,"about_ca_system_score_gemma":0.00037165097,"threshold_uncertainty_score":0.9993239},"labels":[],"label_agreement":null},{"id":"W4248841025","doi":"10.4018/9781591403845.ch010.ch000","title":"Object-Oriented Publish/Subscribe for Modeling and Processing Imperfect Information","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Publication; Computer science; Dissemination; Imperfect; Object (grammar); World Wide Web; Set (abstract data type); Perfect information; Matching (statistics); Information retrieval; Artificial intelligence; Telecommunications","score_opus":0.022568708442687522,"score_gpt":0.23502875961278344,"score_spread":0.21246005117009592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248841025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015672467,0.00027147811,0.5437578,0.00011839222,0.00039549178,0.00071645493,0.00004280835,0.00097315083,0.4535677],"genre_scores_gemma":[0.71916384,0.000024395997,0.26363719,0.0026847038,0.0005205764,0.0004867376,0.000052041043,0.00013188785,0.013298652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790263,0.000008015651,0.0005241508,0.0006007182,0.00040781463,0.0005566618],"domain_scores_gemma":[0.998289,0.000023899285,0.000282194,0.000738276,0.0004983065,0.00016831588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002814107,0.00047650293,0.00043811364,0.00027029513,0.00021825061,0.0007516059,0.0011732705,0.0005334443,0.000001058884],"category_scores_gemma":[0.0000994243,0.00046753316,0.00012036995,0.00008215095,0.0000726093,0.0012277587,0.00092482596,0.00031033022,0.000024775178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018981258,0.0000026545565,0.0000033079286,0.00006298212,0.000025333555,0.0000028605243,0.0002908471,0.000057719622,0.0000031390064,0.81495947,0.0018772925,0.18269542],"study_design_scores_gemma":[0.00061425194,0.0003313571,0.0000073980714,0.0005081191,0.00006397788,0.00008695314,0.000033157492,0.10108185,0.000101454294,0.8422465,0.053827535,0.0010974873],"about_ca_topic_score_codex":0.000045925124,"about_ca_topic_score_gemma":0.000037212303,"teacher_disagreement_score":0.7190071,"about_ca_system_score_codex":0.00022598558,"about_ca_system_score_gemma":0.00026754773,"threshold_uncertainty_score":0.9997776},"labels":[],"label_agreement":null},{"id":"W4249962824","doi":"10.1007/978-1-4614-6170-8_110090","title":"Network Games","year":2014,"lang":"en","type":"book-chapter","venue":"","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 Calgary","funders":"","keywords":"Computer science","score_opus":0.018082920975283884,"score_gpt":0.2146842805292605,"score_spread":0.19660135955397662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249962824","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.113127e-7,0.00030314102,0.42517167,0.0030878712,0.0006317549,0.00014168311,8.4515756e-7,0.0017311516,0.56893146],"genre_scores_gemma":[0.00039619664,0.0000456907,0.16389982,0.0037080133,0.0006260427,0.000014093627,0.000003631584,0.00004160035,0.8312649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978599,0.000010561358,0.00032015954,0.00082057033,0.0004341606,0.0005546633],"domain_scores_gemma":[0.9973847,0.0001346053,0.00014421767,0.0021082757,0.00009549101,0.00013265459],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002698691,0.00042713826,0.00048195745,0.00019514037,0.000084128245,0.00020052861,0.0033293576,0.0005048905,0.00015103538],"category_scores_gemma":[0.000029859806,0.00037800786,0.00013648978,0.00011188987,0.000082615705,0.00008812587,0.001975872,0.00045653415,0.0030446353],"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":[4.881314e-7,8.161437e-7,0.0000018958701,0.0000026661974,0.000011805005,0.000009358319,0.0000051384627,0.00012802832,3.236764e-7,0.5614809,0.3475798,0.09077877],"study_design_scores_gemma":[0.000036287627,0.000059111047,0.000010254701,0.000067270834,0.0000058179253,0.000010455647,2.6168226e-7,0.00094300177,0.000007547618,0.28770196,0.710798,0.00036001945],"about_ca_topic_score_codex":0.000005158294,"about_ca_topic_score_gemma":0.000027599584,"teacher_disagreement_score":0.36321822,"about_ca_system_score_codex":0.00006292732,"about_ca_system_score_gemma":0.000050921004,"threshold_uncertainty_score":0.9998672},"labels":[],"label_agreement":null},{"id":"W4250307312","doi":"10.1007/978-3-319-03807-0_1","title":"Introduction","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","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":"Entertainment; The Internet; Computer science; Multimedia; Set (abstract data type); Consumption (sociology); Telecommunications; World Wide Web; Engineering; Internet privacy; Art","score_opus":0.013167138892069425,"score_gpt":0.2206428175156424,"score_spread":0.207475678623573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250307312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023136899,0.00015944416,0.8981112,0.008780605,0.005842311,0.00066658104,0.0000015149751,0.0013035905,0.084903374],"genre_scores_gemma":[0.007886551,0.00009648188,0.9085617,0.0016370508,0.0031074057,0.00007089457,0.000002536033,0.00008093732,0.07855644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99461204,0.000017384957,0.00064509106,0.00240055,0.0012976109,0.0010273155],"domain_scores_gemma":[0.9958056,0.00007934492,0.00026408554,0.0032241633,0.0003519455,0.00027485768],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001174999,0.00057970517,0.0005645161,0.0016740038,0.00022944545,0.0009649469,0.0076565035,0.00032581986,0.000118793796],"category_scores_gemma":[0.00008911777,0.00060257927,0.00011205864,0.0011528158,0.0007523028,0.0013903071,0.0057604853,0.00091245363,0.002226299],"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.0000011787395,0.000014576263,0.000010975107,0.000012629586,0.0000064356577,0.000039882158,0.00011298385,0.0014189606,0.00010375291,0.5643075,0.012835167,0.42113593],"study_design_scores_gemma":[0.00027994072,0.00033968702,0.0012167485,0.00035176033,0.000007902848,0.00013781677,0.0000013482118,0.108161226,0.001507976,0.14532354,0.7407123,0.0019597441],"about_ca_topic_score_codex":0.000033101063,"about_ca_topic_score_gemma":0.000021041522,"teacher_disagreement_score":0.72787714,"about_ca_system_score_codex":0.0006326374,"about_ca_system_score_gemma":0.00036048857,"threshold_uncertainty_score":0.99964255},"labels":[],"label_agreement":null},{"id":"W4250640589","doi":"10.1007/978-3-540-89856-6_1","title":"Adaptive Content-Based Routing in General Overlay Topologies","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":36,"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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network topology; PlanetLab; Computer network; Overlay; Overlay network; Distributed computing; Software deployment; Publication; Routing (electronic design automation); The Internet; World Wide Web; Operating system","score_opus":0.043332359430174903,"score_gpt":0.25036198966899237,"score_spread":0.20702963023881746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250640589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012710077,0.0004592065,0.9904765,0.0033421698,0.0016416874,0.0005943539,0.0000065763,0.0007009891,0.0015075384],"genre_scores_gemma":[0.3103954,0.000040692277,0.68590075,0.002971315,0.0002604641,0.000027058972,0.0000030964904,0.000036974907,0.0003642756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994581,0.000057482204,0.0007411883,0.0021657017,0.0011604935,0.0012941393],"domain_scores_gemma":[0.9966547,0.00071491423,0.00033380825,0.0018665885,0.00026449328,0.00016551191],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008003274,0.0007627185,0.0008642003,0.0016993126,0.0002601418,0.00036919175,0.0060168765,0.00057302247,0.0000062682498],"category_scores_gemma":[0.00035606002,0.00071157014,0.00016863293,0.0013912757,0.0012044428,0.00055879506,0.00289422,0.0013430301,0.000041580188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002634245,0.000057429566,0.0007290538,0.000015942127,0.000016983713,0.00092764315,0.0010131971,0.23431864,0.00030648318,0.032559786,0.00032098847,0.7297075],"study_design_scores_gemma":[0.0007093043,0.0005216809,0.0017283468,0.00072157633,0.0000058023616,0.00011718272,0.0000018344012,0.9544859,0.0057672877,0.032769855,0.00150323,0.0016680037],"about_ca_topic_score_codex":0.00016719392,"about_ca_topic_score_gemma":0.00054684613,"teacher_disagreement_score":0.7280395,"about_ca_system_score_codex":0.0008584195,"about_ca_system_score_gemma":0.0007377223,"threshold_uncertainty_score":0.99953353},"labels":[],"label_agreement":null},{"id":"W4250963083","doi":"10.1145/376284.375677","title":"Filtering algorithms and implementation for very fast publish/subscribe systems","year":2001,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Publication; Scalability; Implementation; Event (particle physics); Workload; Polling; Database; Distributed computing; Computer network; Programming language; Operating system","score_opus":0.03398909794582906,"score_gpt":0.2917580653035587,"score_spread":0.25776896735772964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250963083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14715038,0.00020929448,0.8455192,0.0036352854,0.0018118388,0.00072674366,0.0000139290305,0.0007234408,0.00020990024],"genre_scores_gemma":[0.6148847,0.00012934206,0.38278422,0.00039371557,0.00045942422,0.0005747664,0.000028572586,0.000036552596,0.0007087306],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850315,0.000025704712,0.0002809683,0.00051828177,0.00020427584,0.00046764573],"domain_scores_gemma":[0.99867314,0.00017810595,0.000100310164,0.00084680243,0.000106416024,0.00009524114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034006312,0.00017109718,0.00020383758,0.00021101808,0.00015199058,0.00059488014,0.0013169236,0.00008761044,0.0000049199216],"category_scores_gemma":[0.00015570452,0.00016876291,0.000042573283,0.00047737488,0.000024954794,0.0010051659,0.0008751415,0.000101936035,0.000010780823],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008619817,0.000014454121,0.0026602186,0.000022325026,0.000023589299,0.000010775175,0.00023288719,0.00006863544,0.0009675348,0.0016742351,0.025790429,0.9685263],"study_design_scores_gemma":[0.0032842825,0.0019996027,0.016628029,0.00024859712,0.00005724057,0.00039349138,0.0024786545,0.2675327,0.0061405813,0.024881402,0.67423815,0.002117239],"about_ca_topic_score_codex":0.00018454882,"about_ca_topic_score_gemma":0.00010333724,"teacher_disagreement_score":0.9664091,"about_ca_system_score_codex":0.00007508441,"about_ca_system_score_gemma":0.000027712638,"threshold_uncertainty_score":0.68819517},"labels":[],"label_agreement":null},{"id":"W4251567699","doi":"10.22215/timreview701","title":"Peer-to-Peer Enclaves for Improving Network Defence","year":2013,"lang":"en","type":"article","venue":"Technology Innovation Management Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Information sharing; Computer science; Peer-to-peer; Work (physics); Scale (ratio); Computer security; Business; Risk analysis (engineering); Computer network; World Wide Web; Engineering; Geography","score_opus":0.021851828244747823,"score_gpt":0.28712783287443366,"score_spread":0.2652760046296858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251567699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000815437,0.0030625933,0.7678183,0.21882978,0.00040214468,0.0042774165,0.0000018146433,0.0026814737,0.0021110629],"genre_scores_gemma":[0.027010212,0.00088914274,0.9348611,0.023287967,0.00010553862,0.0058383844,0.000025258772,0.000042428514,0.007939972],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965427,0.00002873724,0.0009051973,0.0009738679,0.0006591298,0.00089036184],"domain_scores_gemma":[0.99577767,0.00006546485,0.00035706258,0.0019714518,0.0017676676,0.000060662278],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018531376,0.0003653859,0.0005030567,0.0012851263,0.00025307245,0.00020181494,0.0034663505,0.000216235,0.000034511595],"category_scores_gemma":[0.0011242802,0.00034780262,0.000072716546,0.011698923,0.000090175534,0.00056277745,0.0021719176,0.00030383051,0.00081600767],"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":[4.977577e-7,0.000011891239,0.000091065034,0.00029727624,0.000018560058,0.0000018445255,0.0000061111177,0.000040533796,0.000097194505,0.38650334,0.19568382,0.41724786],"study_design_scores_gemma":[0.0002100602,0.00019009651,0.00051938137,0.0009566039,0.000040254447,0.000009901622,0.000034126326,0.0014978724,0.00048214753,0.12460652,0.8708697,0.0005833518],"about_ca_topic_score_codex":0.000007355601,"about_ca_topic_score_gemma":0.0000037908028,"teacher_disagreement_score":0.67518586,"about_ca_system_score_codex":0.00013625713,"about_ca_system_score_gemma":0.000029516976,"threshold_uncertainty_score":0.999962},"labels":[],"label_agreement":null},{"id":"W4252635693","doi":"10.22215/etd/2012-06773","title":"Play patterns for path prediction in multiplayer online games","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dead reckoning; Computer science; Path (computing); Focus (optics); Position (finance); Set (abstract data type); Scheme (mathematics); Data mining; Computer network; Telecommunications; Mathematics","score_opus":0.020035412762190404,"score_gpt":0.2805592411067114,"score_spread":0.260523828344521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252635693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5979763,0.00034271355,0.39141947,0.0007509206,0.004290792,0.001871472,0.00038200401,0.0019398363,0.0010264957],"genre_scores_gemma":[0.86174464,0.000044151642,0.120093025,0.00024885076,0.00041663524,0.00066112773,0.002360696,0.00005766746,0.0143731935],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981188,0.000022012193,0.00041606004,0.00061269314,0.0003110828,0.00051935524],"domain_scores_gemma":[0.9988192,0.00013025814,0.00015340638,0.0006981936,0.000117561736,0.000081424194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002215279,0.00031439,0.00032614224,0.00047067326,0.000049835406,0.00008605328,0.0011927866,0.00047956276,0.000021390457],"category_scores_gemma":[0.00011047672,0.00028465,0.00009289788,0.00035909007,0.000008113488,0.00037663078,0.0001533767,0.0003298062,0.00003688477],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015415133,0.001098382,0.070325665,0.00049026136,0.00014394877,0.0000242487,0.0066893836,0.0011759449,0.002665126,0.008509876,0.110695854,0.79802716],"study_design_scores_gemma":[0.0013933064,0.0004373705,0.878279,0.0007164161,0.000041508654,0.000009037781,0.0011182079,0.079474315,0.0066292444,0.0017188351,0.028880026,0.001302781],"about_ca_topic_score_codex":0.00013106666,"about_ca_topic_score_gemma":0.004198439,"teacher_disagreement_score":0.8079533,"about_ca_system_score_codex":0.000112978014,"about_ca_system_score_gemma":0.000058537506,"threshold_uncertainty_score":0.99996054},"labels":[],"label_agreement":null},{"id":"W4252699942","doi":"10.22215/etd/2012-06799","title":"A multibit Trie structure designed for peer-to-peer (P2P) live video streaming","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Trie; Data structure; Operating system","score_opus":0.019114061911991664,"score_gpt":0.2846459716380869,"score_spread":0.26553190972609525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252699942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096750215,0.00068873627,0.87392116,0.0063699256,0.005705054,0.006578758,0.00035001815,0.0045998585,0.005036252],"genre_scores_gemma":[0.35935098,0.000004238593,0.56249994,0.000731111,0.0004966331,0.000539355,0.0008105047,0.00013636843,0.075430885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947284,0.000069985996,0.00075057655,0.0015776536,0.0014696367,0.0014037694],"domain_scores_gemma":[0.9948787,0.0006070748,0.0003940823,0.0018558956,0.0017237257,0.00054049667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068288046,0.0009411538,0.00093226106,0.0008723874,0.00033531687,0.00057292485,0.003788766,0.0011274487,0.00013622885],"category_scores_gemma":[0.0022895583,0.00085479364,0.00031224606,0.00117963,0.00003456694,0.00068601005,0.0005040177,0.0006528805,0.00023145306],"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.000372717,0.00023074672,0.00022943788,0.00038484624,0.00049428636,0.000037586455,0.014377153,0.00084531656,0.02341946,0.02097194,0.2640152,0.67462134],"study_design_scores_gemma":[0.0072521716,0.0042399853,0.029345604,0.0020000525,0.0011834627,0.000104110775,0.012884393,0.033756193,0.4183183,0.03661536,0.4398558,0.014444563],"about_ca_topic_score_codex":0.00022464564,"about_ca_topic_score_gemma":0.002141989,"teacher_disagreement_score":0.66017675,"about_ca_system_score_codex":0.00031232895,"about_ca_system_score_gemma":0.0003465145,"threshold_uncertainty_score":0.9993903},"labels":[],"label_agreement":null},{"id":"W4253830652","doi":"10.1145/1597849.1384311","title":"Spamulator","year":2008,"lang":"en","type":"article","venue":"ACM SIGCSE Bulletin","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Implementation; The Internet; Class (philosophy); Software; World Wide Web; Resource (disambiguation); Multimedia; Software engineering; Operating system; Computer network","score_opus":0.026466240438279012,"score_gpt":0.23041406469254327,"score_spread":0.20394782425426428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253830652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6845596,0.0004990642,0.14071573,0.15713967,0.0011440424,0.00057571544,0.000004001925,0.0051041963,0.010257999],"genre_scores_gemma":[0.75010026,0.00002407916,0.2437089,0.0028937703,0.00010949333,0.00003081782,8.9583074e-7,0.000015786523,0.003116008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847203,0.000032075866,0.00020158879,0.0004940406,0.0003365894,0.0004636699],"domain_scores_gemma":[0.9975883,0.00017759217,0.000054158932,0.001979235,0.00006741301,0.00013335263],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017738304,0.00017537478,0.00018766455,0.00013525387,0.00017265177,0.000054814125,0.003283868,0.000106222185,0.00011694846],"category_scores_gemma":[0.0006949518,0.0001663602,0.00006410783,0.00051002513,0.000079545105,0.000075509546,0.0018341052,0.00019486313,0.0050334577],"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.000007682364,0.00006892352,0.002152172,0.0000042172524,0.000016469228,0.0003684479,0.00038628813,0.00026068927,0.0006587104,0.008965092,0.9553836,0.0317277],"study_design_scores_gemma":[0.0002556899,0.00011024853,0.0066393176,0.000014259619,0.0000023785742,0.00014583935,0.000010849334,0.0004033238,0.0067788693,0.0028447818,0.9824505,0.00034396554],"about_ca_topic_score_codex":0.00003240381,"about_ca_topic_score_gemma":0.0000025973352,"teacher_disagreement_score":0.1542459,"about_ca_system_score_codex":0.000044266606,"about_ca_system_score_gemma":0.000039204777,"threshold_uncertainty_score":0.99574125},"labels":[],"label_agreement":null},{"id":"W4254146093","doi":"10.1007/978-1-4939-7131-2_101471","title":"Web-Based Social Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","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 Calgary","funders":"","keywords":"Computer science; World Wide Web","score_opus":0.0208066196934519,"score_gpt":0.2347073100692253,"score_spread":0.2139006903757734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254146093","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038665253,0.00008460332,0.4396485,0.0033987747,0.0008192109,0.00021023482,0.0000043347277,0.002421514,0.5534089],"genre_scores_gemma":[0.0035559966,0.000018201887,0.11098419,0.005492101,0.0018689841,0.000035108227,0.000019198776,0.0000962058,0.87793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976362,0.000013826583,0.00034564937,0.0008912725,0.0005204264,0.0005926474],"domain_scores_gemma":[0.9981177,0.00008965553,0.00017574843,0.0013039764,0.00019421132,0.00011870745],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002580263,0.00048408948,0.0004671883,0.0003224638,0.00019930839,0.0002457704,0.0032767341,0.0009026153,0.000626875],"category_scores_gemma":[0.000018700799,0.00045524383,0.00021811375,0.00016473407,0.00022740911,0.00012467419,0.0013112363,0.0005677969,0.0018120483],"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.000003273639,0.0000059230674,0.000001912548,0.000003999732,0.000025943305,0.000024766898,0.00001649226,0.00009194058,0.0000017421855,0.36101523,0.5911435,0.04766528],"study_design_scores_gemma":[0.00020564899,0.00012465088,0.000013828973,0.00005378786,0.000014075784,0.000004290301,0.0000010705903,0.042636164,0.000026036298,0.04610415,0.9101618,0.00065451185],"about_ca_topic_score_codex":0.0000042490515,"about_ca_topic_score_gemma":0.0000634458,"teacher_disagreement_score":0.32866433,"about_ca_system_score_codex":0.0001389546,"about_ca_system_score_gemma":0.00018415983,"threshold_uncertainty_score":0.99978995},"labels":[],"label_agreement":null},{"id":"W4254849639","doi":"10.1145/974044.974088","title":"Performance of publish/subscribe middleware in mobile wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Middleware (distributed applications); Scalability; Message oriented middleware; Publication; Computer network; Distributed computing; Mobile computing; Domain (mathematical analysis); Asynchronous communication; Wireless network; Handover; Wireless; Software architecture; Software; Telecommunications; Operating system","score_opus":0.011121371391965479,"score_gpt":0.21440302181063045,"score_spread":0.20328165041866497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254849639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87254626,0.00022740265,0.122867994,0.00081979507,0.00028702323,0.00028190142,7.6550197e-7,0.00057040935,0.0023984395],"genre_scores_gemma":[0.96375644,0.00006896635,0.035618544,0.0002508569,0.0000281335,0.000074495685,0.000001739728,0.000009794048,0.00019100745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984168,0.000016772761,0.00034396604,0.00042133738,0.0002990215,0.00050214684],"domain_scores_gemma":[0.99878544,0.000037925234,0.00007755571,0.0009113278,0.00010954114,0.00007820559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029405623,0.0001667569,0.00025575078,0.00028753473,0.00004358385,0.00009714322,0.0020951405,0.00014455817,0.0000090028525],"category_scores_gemma":[0.000025532168,0.00015123913,0.00004634192,0.0018641292,0.000074378855,0.0008690545,0.0007732018,0.00024222846,0.000025105843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022060285,0.00031614356,0.04712569,0.00005281579,0.000019864166,0.000040558658,0.000980548,0.5393504,0.0004253878,0.036492586,0.004222767,0.37095118],"study_design_scores_gemma":[0.0025522085,0.0015474415,0.07448509,0.0006142146,0.000009177991,0.00006501297,0.00052814675,0.87136906,0.034659587,0.005549836,0.007030053,0.0015901508],"about_ca_topic_score_codex":0.00009756092,"about_ca_topic_score_gemma":0.00021612368,"teacher_disagreement_score":0.36936104,"about_ca_system_score_codex":0.00011392406,"about_ca_system_score_gemma":0.00007416635,"threshold_uncertainty_score":0.6167353},"labels":[],"label_agreement":null},{"id":"W4255543629","doi":"10.1145/964723.383067","title":"Scalable on-demand media streaming with packet loss recovery","year":2001,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Scalability; Computer science; Simple (philosophy); Network packet; Set (abstract data type); Distributed computing; On demand; Computer network; Real Time Streaming Protocol; The Internet; Multimedia; World Wide Web; Database","score_opus":0.028610807353852456,"score_gpt":0.2683623417161863,"score_spread":0.23975153436233382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255543629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009609833,0.08559052,0.76654583,0.1281661,0.0005817335,0.002092258,0.000008204564,0.0027744772,0.004631069],"genre_scores_gemma":[0.06013227,0.14169116,0.77854776,0.018960502,0.000120163284,0.00023206756,0.00006445428,0.000055676082,0.00019595404],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717844,0.00048570725,0.00061857374,0.000653819,0.0005360906,0.00052740326],"domain_scores_gemma":[0.98929405,0.0015022173,0.0003237483,0.0084413625,0.00025262087,0.00018600863],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010633501,0.0003934471,0.00065551844,0.0002190446,0.0003124592,0.00027989896,0.008633596,0.000114063805,0.000027400185],"category_scores_gemma":[0.00030808945,0.00032426615,0.00011729912,0.001702639,0.00013073257,0.0006645673,0.0038362204,0.0005295808,0.0003867188],"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.000013841552,0.00019346623,0.0016115715,0.00020419051,0.000072586874,0.00004157658,0.00017278167,0.0005668356,0.0000037589973,0.009231756,0.11775135,0.87013626],"study_design_scores_gemma":[0.0010736014,0.0008425442,0.0089555755,0.0164983,0.00008574692,0.00042167286,0.000021434029,0.011373426,0.00011720908,0.012447667,0.94658214,0.0015807096],"about_ca_topic_score_codex":0.000024925894,"about_ca_topic_score_gemma":0.000052450447,"teacher_disagreement_score":0.86855555,"about_ca_system_score_codex":0.00012345429,"about_ca_system_score_gemma":0.00006763953,"threshold_uncertainty_score":0.99992096},"labels":[],"label_agreement":null},{"id":"W4256702873","doi":"10.32920/ryerson.14654274","title":"Improving Streaming Capacity In Tree &amp; Meshed Based P2P Live Streaming Systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Live streaming; Computer science; Upload; Computer network; Channel (broadcasting); Shared resource; Bandwidth (computing); Channel capacity; Overlay; Tree (set theory); Channel allocation schemes; Distributed computing; Telecommunications; Wireless; World Wide Web; Mathematics","score_opus":0.045669989915190314,"score_gpt":0.24722969185495297,"score_spread":0.20155970193976266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256702873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35701597,0.00040150693,0.6363169,0.00057669677,0.001479738,0.0008448601,0.000017191192,0.0018734152,0.0014737233],"genre_scores_gemma":[0.70655334,0.000009624969,0.29258707,0.000107515254,0.0001033937,0.00021809593,0.000036601486,0.00003907214,0.00034527108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944148,0.00031113054,0.0009997163,0.0022729868,0.0008805231,0.001120862],"domain_scores_gemma":[0.9947768,0.00053326087,0.00047818848,0.0036652137,0.00032569616,0.00022087948],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011355099,0.00079815416,0.0011219657,0.00095188664,0.00014564197,0.0014949455,0.0041903066,0.0008599316,0.000017784954],"category_scores_gemma":[0.00078112807,0.00081327104,0.0002503115,0.0011740322,0.0000875147,0.00046590925,0.006941574,0.0016982486,0.000040068782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035250414,0.00094065524,0.023903595,0.0030745128,0.00047741662,0.0012969442,0.009308364,0.36252573,0.015106743,0.0095687555,0.0028244667,0.5709376],"study_design_scores_gemma":[0.00059423933,0.00007928919,0.0049346737,0.0022251836,0.00003757215,0.000026659902,0.001481275,0.98394716,0.0040017096,0.00056819886,0.0003507296,0.0017533135],"about_ca_topic_score_codex":0.015214679,"about_ca_topic_score_gemma":0.018504461,"teacher_disagreement_score":0.62142146,"about_ca_system_score_codex":0.0009765366,"about_ca_system_score_gemma":0.0006683806,"threshold_uncertainty_score":0.9995416},"labels":[],"label_agreement":null},{"id":"W4280553380","doi":"10.1109/syscon53536.2022.9773804","title":"A Container-Based Architecture to Build and Deploy Applications within a Social Network","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Systems Conference (SysCon)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Software deployment; Container (type theory); Architecture; Web service; Reusability; Service-oriented architecture; Context (archaeology); Isolation (microbiology); World Wide Web; Distributed computing; Software engineering; Operating system; Engineering","score_opus":0.02155271447603968,"score_gpt":0.2651198039534525,"score_spread":0.24356708947741285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280553380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036026478,0.000119774595,0.9354612,0.022802051,0.002270253,0.0014705467,0.00011048838,0.0010396321,0.0006995312],"genre_scores_gemma":[0.98318344,0.0000013963383,0.010078915,0.002415718,0.000510047,0.0031449802,0.000017961442,0.00003210048,0.0006154256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713033,0.00019341026,0.0005010604,0.00082195894,0.00089387747,0.0004593439],"domain_scores_gemma":[0.99856955,0.00018581645,0.0002540219,0.0005677382,0.00024999675,0.00017289328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000667262,0.00027798626,0.00034910472,0.0003565337,0.0005521438,0.00047228142,0.0025672847,0.000086670836,0.000029846025],"category_scores_gemma":[0.000060515275,0.00029645432,0.00007677068,0.0009192523,0.00007230717,0.00015828996,0.0010311089,0.00050932326,0.000045240322],"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.000131983,0.00018302024,0.003777518,0.000055315708,0.00026995805,0.00008609176,0.002829893,0.259705,0.003889967,0.64542896,0.051118948,0.03252334],"study_design_scores_gemma":[0.0017382011,0.00071815547,0.0020066549,0.00018752391,0.000040844287,0.0002925664,0.0014834008,0.34302634,0.00055408495,0.01625553,0.63202846,0.001668228],"about_ca_topic_score_codex":0.00027511604,"about_ca_topic_score_gemma":0.00022860723,"teacher_disagreement_score":0.94715697,"about_ca_system_score_codex":0.0003133779,"about_ca_system_score_gemma":0.00019208905,"threshold_uncertainty_score":0.99994874},"labels":[],"label_agreement":null},{"id":"W4295178679","doi":"10.1234/kenoyt","title":"#VOIR ~Jujutsu Kaisen 0 Film complet [1080p] et Streaming-vf","year":2022,"lang":"fr","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Art; Art history; Computer graphics (images); Computer science","score_opus":0.05941649879408755,"score_gpt":0.2669220090454894,"score_spread":0.20750551025140185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295178679","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033094764,0.0035233335,0.2275236,0.2166841,0.0046761045,0.0038464463,0.005155617,0.016248269,0.48924777],"genre_scores_gemma":[0.9225259,0.00032587902,0.016509775,0.005239101,0.0006405998,0.0000011494996,0.003274888,0.0043681366,0.047114614],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943987,0.0014221307,0.0005301505,0.0012099425,0.0012548846,0.0011841558],"domain_scores_gemma":[0.9967783,0.00012362444,0.00024062363,0.001754842,0.00069954304,0.00040308098],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.001984727,0.00038367088,0.00036568975,0.00062068243,0.0053467546,0.0024377615,0.0064738933,0.00012260524,0.02133034],"category_scores_gemma":[0.001030986,0.00048819208,0.00012880727,0.0029554712,0.00042401566,0.0007289785,0.019987091,0.0012487238,0.014947617],"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.00003344421,0.00029056822,0.000006437062,0.00004740866,0.0000601808,0.00015145176,0.0030858587,0.005287561,0.0005986313,0.07828268,0.72923267,0.18292312],"study_design_scores_gemma":[0.0005125711,0.00085675356,0.00069899217,0.000052589996,0.000018527242,0.0005333725,0.00077679846,0.017525466,0.00016836838,0.00173985,0.9766192,0.0004975087],"about_ca_topic_score_codex":0.00013709322,"about_ca_topic_score_gemma":0.0000037391171,"teacher_disagreement_score":0.8894311,"about_ca_system_score_codex":0.00071281305,"about_ca_system_score_gemma":0.00002939242,"threshold_uncertainty_score":0.999757},"labels":[],"label_agreement":null},{"id":"W4302511402","doi":"10.1007/978-0-387-78414-4_55","title":"Networking for Massively Multiuser Online Gaming","year":2008,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Multimedia","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","score_opus":0.028375979848032026,"score_gpt":0.2539618383798545,"score_spread":0.22558585853182245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302511402","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000743691,0.014303103,0.39096048,0.00471912,0.030593455,0.008246555,0.001037218,0.0052872878,0.5441091],"genre_scores_gemma":[0.00041422917,0.006589238,0.76716304,0.00036587147,0.004776672,0.00014801101,0.00019019104,0.00021945218,0.22013329],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960026,0.000022680508,0.0010483429,0.0012440326,0.00079538167,0.00088696164],"domain_scores_gemma":[0.9959059,0.001051202,0.0007840757,0.001576797,0.0004124293,0.00026961399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028438348,0.00081100763,0.0011074354,0.00065435655,0.00015573677,0.000043202595,0.0030030776,0.0008660186,0.00001716997],"category_scores_gemma":[0.00039566393,0.0008312341,0.00041084213,0.00022030206,0.00023958691,0.00027684413,0.001273644,0.0007779574,0.000103442224],"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.00003894234,0.000107205255,0.00015109876,0.00011143836,0.0002064633,0.00015410353,0.0014232746,0.0005373673,0.000050655653,0.0021288246,0.20856948,0.78652114],"study_design_scores_gemma":[0.00071092433,0.00018876848,0.00033005682,0.00047995112,0.000051380815,0.000020331065,0.000011471018,0.014024418,0.00008103595,0.0019584128,0.98118335,0.00095992384],"about_ca_topic_score_codex":0.000018988214,"about_ca_topic_score_gemma":0.00006751406,"teacher_disagreement_score":0.7855612,"about_ca_system_score_codex":0.00015931645,"about_ca_system_score_gemma":0.00025112453,"threshold_uncertainty_score":0.99941385},"labels":[],"label_agreement":null},{"id":"W4315630011","doi":"10.1109/globecom48099.2022.10001081","title":"On block delivery time in Ethereum network","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Exponential distribution; Block (permutation group theory); Node (physics); Computer science; Exponential function; Distribution (mathematics); Phase-type distribution; Probability distribution; Gossip; Queueing theory; Computer network; Mathematics; Statistics; Engineering; Combinatorics","score_opus":0.02678827295741041,"score_gpt":0.2675001353246644,"score_spread":0.24071186236725398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315630011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4847226,0.011741979,0.06201819,0.16506758,0.008352586,0.0071315407,0.0021743216,0.009616938,0.24917425],"genre_scores_gemma":[0.9701699,0.0002726308,0.024499949,0.0032735954,0.00004162263,0.00069953967,0.00007519559,0.000024555751,0.00094302767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956209,0.0010030508,0.0006568111,0.00092069694,0.0008579367,0.00094058673],"domain_scores_gemma":[0.9927188,0.00049612694,0.00024916086,0.0061883484,0.0001630859,0.00018447562],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0011485001,0.0004031942,0.00046888232,0.00026355896,0.0010743011,0.0002598604,0.013763787,0.00013443345,0.00039586565],"category_scores_gemma":[0.00014464802,0.0004897471,0.00013789014,0.00451085,0.00019668245,0.00030191403,0.010262862,0.0013377754,0.0006769525],"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.000089138455,0.00089252845,0.0025780075,0.000009587032,0.000104170205,0.000082779756,0.0005171293,0.09249183,0.00034822448,0.4578529,0.3888758,0.056157894],"study_design_scores_gemma":[0.0016133927,0.0012412209,0.008033431,0.00015606199,0.000041823445,0.00018964267,0.0006158909,0.46209136,0.000094151976,0.1796073,0.3440369,0.0022788213],"about_ca_topic_score_codex":0.0004881253,"about_ca_topic_score_gemma":0.001114973,"teacher_disagreement_score":0.4854473,"about_ca_system_score_codex":0.0011589867,"about_ca_system_score_gemma":0.00043786992,"threshold_uncertainty_score":0.99975544},"labels":[],"label_agreement":null},{"id":"W4320909166","doi":"10.1007/978-1-4899-7993-3_1207-2","title":"Channel-Based Publish/Subscribe","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Publication; Computer science; Channel (broadcasting); Computer network; Business; Advertising","score_opus":0.019214883669072678,"score_gpt":0.22582092642351165,"score_spread":0.20660604275443897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320909166","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006628697,0.0026161268,0.28362387,0.0015379611,0.006175631,0.0012753229,0.0019786616,0.0013285467,0.70145726],"genre_scores_gemma":[0.004265896,0.0012607526,0.024026504,0.00049994304,0.0029750715,0.000481059,0.00080171664,0.00034872832,0.9653403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99502784,0.00007052628,0.0011840112,0.0015142167,0.001368598,0.000834817],"domain_scores_gemma":[0.9930391,0.0003803563,0.00088702614,0.004837103,0.0004883876,0.00036803],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093506934,0.00083360635,0.0011762785,0.0011116359,0.00010786274,0.0002102331,0.005156311,0.0006336313,0.000061029492],"category_scores_gemma":[0.00033802315,0.0006970356,0.00026203893,0.00031924626,0.00020082123,0.0010175136,0.001927542,0.0005820149,0.00091247715],"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.000017221635,0.000052735504,0.000017699153,0.00050735316,0.00014208666,0.00023713501,0.00009290748,0.00009937903,0.000044565946,0.47814023,0.5058206,0.014828138],"study_design_scores_gemma":[0.00039279435,0.00014997854,0.000006682456,0.0020113743,0.000037738777,0.000024570452,0.000008622087,0.0008456377,0.00010439266,0.0026924366,0.9927808,0.0009449417],"about_ca_topic_score_codex":0.000064552405,"about_ca_topic_score_gemma":0.000033772816,"teacher_disagreement_score":0.48696026,"about_ca_system_score_codex":0.0001984924,"about_ca_system_score_gemma":0.00051053776,"threshold_uncertainty_score":0.9998654},"labels":[],"label_agreement":null},{"id":"W4324267472","doi":"10.1109/fmec57183.2022.10062858","title":"EdgePub: A Self-Adaptable Distributed MQTT Broker Overlay for the Far-Edge","year":2022,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"MQTT; Computer science; Computer network; Edge device; Cloud computing; Software deployment; Edge computing; Overlay network; Middleware (distributed applications); Enhanced Data Rates for GSM Evolution; Distributed computing; Load balancing (electrical power); Internet of Things; The Internet; Operating system; Computer security; Telecommunications","score_opus":0.015668146234603005,"score_gpt":0.23108018871066108,"score_spread":0.21541204247605808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324267472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016383422,0.00040560565,0.96738946,0.024200287,0.0010884025,0.00084127235,0.0000782734,0.0024425695,0.0019157723],"genre_scores_gemma":[0.7592598,0.000029004148,0.21873507,0.0062684678,0.00024340687,0.002375272,0.000038903327,0.000051472955,0.012998553],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99812853,0.00004741189,0.00022676513,0.00053533516,0.00042834142,0.0006336114],"domain_scores_gemma":[0.9979483,0.00048784347,0.000071769,0.0013175164,0.000096768104,0.00007783538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005589299,0.00018961797,0.00019081282,0.0000911486,0.0007741305,0.0002459624,0.0033076063,0.000054788125,0.00008430824],"category_scores_gemma":[0.00012771349,0.00013828391,0.000115706,0.001261234,0.000037609552,0.0002481214,0.0028387147,0.00026644114,0.000049403043],"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.000013118715,0.00011782193,0.00022546024,0.0000057986995,0.000068550675,0.00000777059,0.0002979995,0.0032807123,0.0001965253,0.15804498,0.80225664,0.035484605],"study_design_scores_gemma":[0.00026883942,0.00014428263,0.00096569944,0.0000015551743,0.00001111497,0.000016861228,0.00019119753,0.13604936,0.0006360199,0.0036269852,0.85786945,0.00021863256],"about_ca_topic_score_codex":0.00006112409,"about_ca_topic_score_gemma":0.000040823437,"teacher_disagreement_score":0.7576215,"about_ca_system_score_codex":0.00020479244,"about_ca_system_score_gemma":0.00011430711,"threshold_uncertainty_score":0.6146411},"labels":[],"label_agreement":null},{"id":"W4379930405","doi":"10.32604/cmc.2023.033332","title":"Generation of Low-Delay and High-Stability Multicast Tree","year":2023,"lang":"en","type":"article","venue":"Computers, materials & continua/Computers, materials & continua (Print)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Hainan University; National Natural Science Foundation of China","keywords":"Multicast; Computer science; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Source-specific multicast; Xcast; Computer network; Tree (set theory); Pragmatic General Multicast; Stability (learning theory); Transmission delay; Distributed computing; Mathematics","score_opus":0.033366238891843696,"score_gpt":0.2483250191703,"score_spread":0.2149587802784563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379930405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8489741,0.00009481636,0.13203058,0.0020927764,0.011490761,0.002082858,0.0002747931,0.0029051355,0.000054156233],"genre_scores_gemma":[0.90558255,0.00008835606,0.091604106,0.0005400733,0.0014429118,0.00022310141,0.00022444218,0.00014393684,0.00015051707],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9900964,0.0008451281,0.0030422248,0.0029175957,0.0010962798,0.0020023722],"domain_scores_gemma":[0.9932131,0.00080294383,0.0013291383,0.0033712212,0.0007911266,0.00049244397],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0033843936,0.0014386361,0.002790006,0.0010695142,0.0004034688,0.0023346348,0.00418608,0.0006947878,0.00015512097],"category_scores_gemma":[0.00043410642,0.0014651145,0.00027839234,0.0014439954,0.0005994667,0.0014469012,0.006360339,0.0003411457,0.00056707516],"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.00016296541,0.00021824634,0.00033311115,0.00036796837,0.00021547833,0.00016422664,0.0014296359,0.00015608179,0.94385546,0.006629737,0.017364686,0.029102374],"study_design_scores_gemma":[0.0031585793,0.00062182685,0.026620805,0.00076110166,0.00009511443,0.00011326468,0.00008627264,0.009184123,0.95160383,0.0015452079,0.0041742567,0.002035592],"about_ca_topic_score_codex":0.0004925629,"about_ca_topic_score_gemma":0.00011144762,"teacher_disagreement_score":0.05660843,"about_ca_system_score_codex":0.00024090728,"about_ca_system_score_gemma":0.00016493544,"threshold_uncertainty_score":0.9998363},"labels":[],"label_agreement":null},{"id":"W4381734451","doi":"10.1109/noms56928.2023.10154411","title":"A Deep Reinforcement Learning Framework for Optimizing Congestion Control in Data Centers","year":2023,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Reinforcement learning; Network congestion; Computer science; Delegate; Leverage (statistics); Distributed computing; Data center; Latency (audio); Network traffic control; Throughput; Computer network; Artificial intelligence; Network packet","score_opus":0.04674521707238224,"score_gpt":0.30241399251979617,"score_spread":0.25566877544741395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381734451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076364394,0.000024840423,0.9866567,0.010216994,0.0002892906,0.00049638987,8.9978494e-7,0.001342911,0.00020830004],"genre_scores_gemma":[0.5758945,0.000019657133,0.42298043,0.0007233808,0.000030193658,0.00010124588,0.000026785354,0.000009793729,0.00021401455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985589,0.000030306064,0.00024093284,0.0004873753,0.00020628455,0.0004762032],"domain_scores_gemma":[0.9984811,0.00045414717,0.000063844804,0.0009030539,0.00004170738,0.00005618007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007021651,0.00012105743,0.00016727588,0.00027760316,0.00009247035,0.00015486212,0.0017763325,0.00009753736,0.0000042318293],"category_scores_gemma":[0.00080879603,0.00011815256,0.000026052829,0.0008678739,0.000021751115,0.00041793444,0.0011280003,0.00022648326,0.000057668192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018357416,0.000008638415,0.0007656598,0.000009458879,0.00001615212,0.000010304844,0.00024870696,0.8961538,0.000082566374,0.05988124,0.0038006585,0.03900442],"study_design_scores_gemma":[0.00044696502,0.00007611821,0.00037454354,0.000063337444,0.000003067297,0.0000013045565,0.00015899035,0.99128973,0.00006238654,0.0032912283,0.0040891906,0.0001431208],"about_ca_topic_score_codex":0.000024456998,"about_ca_topic_score_gemma":0.000042801825,"teacher_disagreement_score":0.5751309,"about_ca_system_score_codex":0.00007361259,"about_ca_system_score_gemma":0.000022647326,"threshold_uncertainty_score":0.48181215},"labels":[],"label_agreement":null},{"id":"W4385219460","doi":"10.5465/amproc.2023.18068symposium","title":"Overlooked Ties: An Examination of Neglected, Rare, or Special Relationships in Org Networks","year":2023,"lang":"en","type":"article","venue":"Academy of Management Proceedings","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Strong ties; Psychology; Interpersonal ties; Social psychology","score_opus":0.052116450600703745,"score_gpt":0.28072330676938084,"score_spread":0.2286068561686771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385219460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9794307,0.000036533347,0.006259079,0.0024899545,0.00017152948,0.0009083062,0.0000013634177,0.000886076,0.009816509],"genre_scores_gemma":[0.9870649,0.00017949432,0.010929554,0.00013031923,0.00016004586,0.000070275986,0.000004092065,0.000016473206,0.0014448549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9980686,0.000029601688,0.0005201288,0.00047926168,0.0005185945,0.00038384815],"domain_scores_gemma":[0.9993386,0.00010535954,0.00025730376,0.00016828139,0.00007367887,0.000056726367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096591783,0.00016990298,0.0002531955,0.0011051102,0.0000771719,0.000051616775,0.0015023869,0.000217439,0.000010255661],"category_scores_gemma":[0.00020901287,0.00016867061,0.000034093595,0.0047474415,0.000072581155,0.0011439716,0.0008723155,0.00038435453,0.000019691337],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001458843,0.0002263974,0.022669708,0.00047232077,0.000113912254,0.000019963156,0.0060658893,0.007255262,0.0005661102,0.5581877,0.060884703,0.34339213],"study_design_scores_gemma":[0.00068011496,0.00022281794,0.9163191,0.0002686769,0.000020882746,0.0000022692861,0.0013345096,0.06175282,0.0010175243,0.010327443,0.0077300523,0.00032382167],"about_ca_topic_score_codex":0.000003985878,"about_ca_topic_score_gemma":0.000004694497,"teacher_disagreement_score":0.89364934,"about_ca_system_score_codex":0.00008032758,"about_ca_system_score_gemma":0.000009955503,"threshold_uncertainty_score":0.68781877},"labels":[],"label_agreement":null},{"id":"W4386321977","doi":"10.1109/tnse.2023.3310811","title":"Block and Transaction Delivery in Ethereum Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Block (permutation group theory); Node (physics); Database transaction; Computer network; Eclipse; Hash function; Computer security; Database; Engineering; Mathematics","score_opus":0.012077493174440347,"score_gpt":0.21203694930377123,"score_spread":0.1999594561293309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386321977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3027054,0.00016457643,0.6935577,0.0011114492,0.0011441068,0.00021405154,0.0000011418792,0.0010252999,0.00007626922],"genre_scores_gemma":[0.98645437,0.00041660768,0.012762962,0.00018117258,0.00007508147,0.000048337803,1.1199706e-7,0.000014324969,0.000047010664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804294,0.000016073958,0.00021030166,0.00056709547,0.00037330875,0.0007902556],"domain_scores_gemma":[0.99925065,0.0001534103,0.000023425091,0.00036109803,0.000047711044,0.00016367844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009590766,0.00019540793,0.00018665523,0.00052939396,0.00033900028,0.00019344993,0.0005456629,0.000102097,0.0000011654467],"category_scores_gemma":[0.000010055122,0.0002034083,0.000028849738,0.005347388,0.00011572827,0.0006189717,0.000015657157,0.0003519382,0.000015561029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045445777,0.0000076675,0.000037177993,0.00000648774,0.000004890991,0.000012143663,0.0001748273,0.93538296,0.0008407554,0.00031964068,0.00026471808,0.06294421],"study_design_scores_gemma":[0.00020125159,0.000111121204,0.0035442656,0.0001297483,0.0000058182527,0.000034272813,0.000033416556,0.9925077,0.0009638592,0.00032484418,0.0018219199,0.00032178726],"about_ca_topic_score_codex":0.000024376961,"about_ca_topic_score_gemma":0.00007164214,"teacher_disagreement_score":0.68374896,"about_ca_system_score_codex":0.00008545185,"about_ca_system_score_gemma":0.000060191196,"threshold_uncertainty_score":0.829475},"labels":[],"label_agreement":null},{"id":"W4386391300","doi":"10.1007/978-981-99-4590-0_5","title":"Implementation of Dew-Inspired Matrix-Mesh Communication Protocol","year":2023,"lang":"en","type":"book-chapter","venue":"Internet of things","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 Prince Edward Island","funders":"","keywords":"Computer science; Mesh networking; Protocol (science); Bluetooth; Wireless mesh network; Android (operating system); Architecture; Matrix (chemical analysis); Computer network; Cloud computing; Distributed computing; Dew; Embedded system; Operating system; Wireless; Wireless network","score_opus":0.03010848084199125,"score_gpt":0.32585677917142586,"score_spread":0.2957482983294346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386391300","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018174783,0.00026029284,0.36904654,0.01767734,0.0021479446,0.24406385,0.00017637285,0.009440289,0.3553699],"genre_scores_gemma":[0.09107657,0.00007861614,0.35353896,0.00096111675,0.00014917787,0.049007244,0.0001755143,0.00037128633,0.50464153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980101,0.000026817002,0.0008169232,0.0004019736,0.00052832783,0.00021588634],"domain_scores_gemma":[0.99714845,0.000112445385,0.0009666339,0.0014550656,0.0002744565,0.000042914948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047203785,0.00026784587,0.0004403672,0.0004615748,0.000025746665,0.000068234796,0.003514267,0.00026373405,0.000046763038],"category_scores_gemma":[0.000043067637,0.00027599742,0.00015616213,0.00014407838,0.00010955708,0.00034689458,0.0022796341,0.0003328425,0.000107680644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000337096,0.00002907482,0.000118637414,0.00035231368,0.00019314817,0.0000103428665,0.0031121036,0.000015362157,0.0005988354,0.80380887,0.054673024,0.13705459],"study_design_scores_gemma":[0.002111012,0.0019226088,0.0010377404,0.0051094806,0.0001285278,0.000037031095,0.00026430652,0.007965396,0.053412877,0.524165,0.4020371,0.001808949],"about_ca_topic_score_codex":0.0005531581,"about_ca_topic_score_gemma":0.00012623741,"teacher_disagreement_score":0.34736407,"about_ca_system_score_codex":0.00011572919,"about_ca_system_score_gemma":0.000073915304,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null},{"id":"W4390044434","doi":"10.5311/josis.2023.27.220","title":"Distributed spatial data sharing: a new model for data ownership and access control","year":2023,"lang":"en","type":"article","venue":"Journal of Spatial Information Science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Global Water Futures","keywords":"Geospatial analysis; Computer science; Data sharing; Spatial data infrastructure; The Internet; Data science; Data discovery; World Wide Web; Spatial analysis; Metadata; Geography","score_opus":0.20956805442412918,"score_gpt":0.3778157943723835,"score_spread":0.16824773994825432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390044434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039246045,0.000010174148,0.9826685,0.01229828,0.000441355,0.00027234832,0.00022405201,0.0001331824,0.000027471599],"genre_scores_gemma":[0.9411939,0.00002274915,0.057853326,0.00068343047,0.00013725259,0.0000040115083,0.00008702274,0.000004113508,0.000014221702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975909,0.000009787527,0.00070442056,0.00033856623,0.00095402077,0.00040231226],"domain_scores_gemma":[0.99674857,0.0001525281,0.00063579273,0.00165924,0.0005361757,0.00026770993],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0035741287,0.00012951836,0.00022855352,0.0006727954,0.00025703752,0.0018664607,0.013660817,0.000059127975,0.0000013078935],"category_scores_gemma":[0.0029810343,0.00010291356,0.00002411918,0.0016496641,0.00015068466,0.022650162,0.006072297,0.00018637923,0.000010722005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014900557,0.000028565166,0.0024984784,0.000042254618,0.000034593257,0.000006684393,0.0014068679,0.12046051,0.00041924842,0.005526889,0.06950066,0.7999262],"study_design_scores_gemma":[0.00068010326,0.000080819606,0.004075492,0.0000312411,0.000009702553,0.000021736929,0.0000312566,0.98784095,0.0001416133,0.0029287247,0.004029518,0.00012885986],"about_ca_topic_score_codex":0.0002302133,"about_ca_topic_score_gemma":0.00011461204,"teacher_disagreement_score":0.9372693,"about_ca_system_score_codex":0.00006851375,"about_ca_system_score_gemma":0.0007827184,"threshold_uncertainty_score":0.9991697},"labels":[],"label_agreement":null},{"id":"W4396813434","doi":"10.1145/3659463.3660021","title":"A Game Theoretic Analysis of Validator Strategies in Ethereum 2.0","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Validator; Computer science; World Wide Web","score_opus":0.019304521701532486,"score_gpt":0.29505563847045285,"score_spread":0.2757511167689204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396813434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42374653,0.0010238998,0.54306704,0.004567393,0.0007674433,0.00056618394,0.000041522195,0.0019539483,0.02426602],"genre_scores_gemma":[0.95505667,0.00004330102,0.04437348,0.00008806843,0.000018281358,0.00007408806,0.000008105426,0.000016177752,0.00032183735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974929,0.00010949511,0.00057275157,0.0009866345,0.00045546124,0.00038271974],"domain_scores_gemma":[0.99723566,0.00019312602,0.00014838918,0.0022649816,0.0000986269,0.000059242047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073299115,0.00033211577,0.0008102704,0.0021709555,0.000010351656,0.00044720137,0.0036614668,0.0004028579,0.000050276343],"category_scores_gemma":[0.00007121005,0.0002749407,0.00031907903,0.0040434836,0.00014122785,0.00009459115,0.0077849813,0.00082878984,0.0000601819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037173982,0.00004686899,0.0005065614,0.00018691715,0.00082011585,0.000048263708,0.0015610607,0.06769922,0.00009327432,0.9190855,0.00058953685,0.009358993],"study_design_scores_gemma":[0.000050604594,0.00004385578,0.0015542014,0.00023040874,0.00027622763,0.0000016783854,0.00033883363,0.22814125,0.0012785627,0.76750636,0.00018655513,0.0003914612],"about_ca_topic_score_codex":0.0003849841,"about_ca_topic_score_gemma":0.0005460882,"teacher_disagreement_score":0.53131014,"about_ca_system_score_codex":0.000106192245,"about_ca_system_score_gemma":0.00029954544,"threshold_uncertainty_score":0.99997026},"labels":[],"label_agreement":null},{"id":"W4399370179","doi":"10.3138/ctr.197.021","title":"Space, Time, and Reactivity: Designing Software for Online Theatre","year":2024,"lang":"en","type":"article","venue":"Canadian Theatre Review","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Space (punctuation); Reactivity (psychology); Software; Art; Visual arts; Computer science; Aesthetics; Programming language; Operating system","score_opus":0.021866584737112074,"score_gpt":0.26102605316540306,"score_spread":0.239159468428291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399370179","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033217107,0.7640619,0.11023528,0.11654902,0.0005198769,0.0024688074,0.00031659208,0.0019346651,0.003581632],"genre_scores_gemma":[0.013479282,0.0902438,0.87319064,0.017911041,0.0007040622,0.0005657371,0.00014899392,0.00022941986,0.0035270373],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850875,0.000052116535,0.00019841523,0.0005746572,0.00013399644,0.0005320772],"domain_scores_gemma":[0.9984893,0.00032153336,0.00003148984,0.00071814866,0.00005807521,0.00038142136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048353075,0.00023167729,0.00039094282,0.0002678572,0.00012972306,0.00020334196,0.00070398644,0.000096802934,0.000012008073],"category_scores_gemma":[0.00014005166,0.0001974109,0.00009106257,0.0010323459,0.000043309465,0.0002680249,0.00014699063,0.00019770685,0.00010033128],"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":[4.114761e-7,0.0000033670883,0.000012946012,0.00060321344,0.000020274243,0.000050846047,0.000023396811,0.0000031789873,0.000036600726,0.0014833793,0.06193588,0.9358265],"study_design_scores_gemma":[0.000042880394,0.000060262562,0.000025524363,0.0048189275,0.00004942953,0.00009904216,0.0000038344383,0.0018747305,0.000068684916,0.0021682812,0.990523,0.000265419],"about_ca_topic_score_codex":0.0018747582,"about_ca_topic_score_gemma":0.012669328,"teacher_disagreement_score":0.93556106,"about_ca_system_score_codex":0.00019886048,"about_ca_system_score_gemma":0.00054832426,"threshold_uncertainty_score":0.8050183},"labels":[],"label_agreement":null},{"id":"W4400490088","doi":"10.1109/netsoft60951.2024.10588903","title":"Demo: An Open-Source and Standards-Based Network-as-a-Service Platform for Cloud VR Gaming","year":2024,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Cloud computing; Computer science; Open source; Service (business); Open platform; World Wide Web; Multimedia; Operating system; Software","score_opus":0.030285792051453955,"score_gpt":0.30937500202038215,"score_spread":0.2790892099689282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400490088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025053909,0.0005887225,0.95777565,0.007632933,0.0006996018,0.00084063417,0.000018643072,0.0026439973,0.004745917],"genre_scores_gemma":[0.5189626,0.000017274706,0.4712528,0.007893277,0.00040753404,0.00017474344,0.000011578597,0.000065168824,0.0012149974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976596,0.000021547923,0.00028335565,0.0008500277,0.00050759345,0.0006778789],"domain_scores_gemma":[0.9982043,0.0004008666,0.000045670364,0.0008952935,0.00025179397,0.00020209448],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015370304,0.00026253366,0.00027842532,0.00014574917,0.00029382468,0.0018175549,0.0025625366,0.00015963643,0.000017194592],"category_scores_gemma":[0.00011848344,0.0002286738,0.0000403162,0.0010720331,0.000046279656,0.00107092,0.0016684633,0.00022135972,0.00002603467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076713004,0.000041037038,0.00006856345,0.00012310712,0.00005031277,0.000045977602,0.0006155376,0.010237307,0.00024651096,0.22728509,0.07896241,0.68224746],"study_design_scores_gemma":[0.00034092864,0.00043118547,0.000042399213,0.00013698866,0.000011464416,0.000026284799,0.000099358724,0.54570156,0.0007730715,0.022428459,0.4296626,0.00034567894],"about_ca_topic_score_codex":0.0001503412,"about_ca_topic_score_gemma":0.0006804691,"teacher_disagreement_score":0.68190175,"about_ca_system_score_codex":0.00017210886,"about_ca_system_score_gemma":0.00033415388,"threshold_uncertainty_score":0.99921864},"labels":[],"label_agreement":null},{"id":"W4401024776","doi":"10.24963/ijcai.2024/480","title":"Featured Argumentation Framework: Semantics and Complexity","year":2024,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Grantová Agentura České Republiky","keywords":"Computer science; Perfect information; Imperfect; Mathematical economics; Economics","score_opus":0.03543502550921187,"score_gpt":0.298022083100025,"score_spread":0.26258705759081313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401024776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016996687,0.00035974808,0.9501621,0.028573025,0.00047988392,0.00012304042,0.0000015660247,0.0017504989,0.0015534613],"genre_scores_gemma":[0.5449853,0.000017928374,0.45391056,0.000580085,0.000029335768,0.000005307002,0.0000012230048,0.000004132399,0.0004661034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921906,0.000013510828,0.000094027266,0.00031503488,0.00016768296,0.00019066369],"domain_scores_gemma":[0.99947965,0.00009485011,0.0000114667155,0.0003402361,0.000023905657,0.000049887014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012704136,0.000092214104,0.00008739378,0.00011381194,0.000062206214,0.0004507811,0.00041671764,0.00008157003,0.000010579294],"category_scores_gemma":[0.000039693892,0.00007804997,0.000019293067,0.00053691067,0.000052186104,0.0002558233,0.00042639335,0.0001745809,0.000078781355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.5504914e-7,0.000007391251,0.00022388961,0.000015261307,0.000011735021,0.000016657428,0.00033080255,0.000018374818,0.00021219121,0.9165299,0.018620973,0.06401205],"study_design_scores_gemma":[0.00008818314,0.00009509634,0.011061143,0.00011770491,0.000010001185,0.000048104834,0.00009033955,0.21102932,0.004386282,0.74221003,0.030532671,0.000331144],"about_ca_topic_score_codex":0.000010711317,"about_ca_topic_score_gemma":0.000016153448,"teacher_disagreement_score":0.5279886,"about_ca_system_score_codex":0.00002669242,"about_ca_system_score_gemma":0.000014143547,"threshold_uncertainty_score":0.43468928},"labels":[],"label_agreement":null},{"id":"W4401979865","doi":"10.1016/j.procs.2024.08.004","title":"Randomized protocols for resilient peer-to-peer networks","year":2024,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"University of Ontario Institute of Technology","keywords":"Computer science; Peer-to-peer; Randomized controlled trial; Peer review; Computer network; Medicine","score_opus":0.024325032003986734,"score_gpt":0.3186379231953854,"score_spread":0.2943128911913987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401979865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007560262,0.00012582986,0.9424668,0.02852795,0.002778352,0.022204109,0.000005032783,0.00273719,0.00039870373],"genre_scores_gemma":[0.09496437,0.000003500739,0.86820525,0.0028397508,0.0009208131,0.03163012,0.0000031203463,0.000045198,0.0013879045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933017,0.00007096576,0.0007177244,0.0022313392,0.002144282,0.0015340268],"domain_scores_gemma":[0.9953192,0.0008491839,0.00011218513,0.0015776312,0.0015765796,0.0005652304],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0071216226,0.0004762998,0.0007030543,0.0010360929,0.00047674635,0.003131359,0.006849211,0.00015167896,0.0000034448797],"category_scores_gemma":[0.001698859,0.00038818177,0.00024118557,0.005793484,0.0005512342,0.0013693363,0.003139356,0.0003964628,0.00018444241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015822928,0.00014268975,0.000054676075,0.00021847546,0.000056378565,0.000055643144,0.0031595132,0.049811106,0.00042969728,0.21731047,0.22472346,0.5024556],"study_design_scores_gemma":[0.0059599713,0.0003013063,0.00005806663,0.0002747008,0.000009566556,0.000038861766,0.000005306379,0.8897092,0.0017766433,0.011051971,0.09027157,0.0005428865],"about_ca_topic_score_codex":0.0000067040996,"about_ca_topic_score_gemma":0.000005188963,"teacher_disagreement_score":0.83989805,"about_ca_system_score_codex":0.00025023194,"about_ca_system_score_gemma":0.00070682244,"threshold_uncertainty_score":0.999857},"labels":[],"label_agreement":null},{"id":"W4402896969","doi":"10.1109/iwqos61813.2024.10682884","title":"MobiShare: Efficient Decentralized Data Sharing for Mobile Devices","year":2024,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Data sharing; Distributed computing","score_opus":0.06843813200334906,"score_gpt":0.3419167259452305,"score_spread":0.27347859394188145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402896969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015034641,0.002492738,0.9724694,0.0030452637,0.0009778114,0.0008981623,0.00006638743,0.0040466636,0.0009689144],"genre_scores_gemma":[0.5823695,0.0000359421,0.41550946,0.0006379209,0.00009419349,0.00037775762,0.00006200456,0.000028674616,0.00088453817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997872,0.000008611066,0.00023412115,0.001122402,0.00025510305,0.00050778297],"domain_scores_gemma":[0.9974739,0.0001891988,0.000024310144,0.002163594,0.000053168227,0.00009581315],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004971482,0.00016384413,0.00016474722,0.00016300759,0.0000965329,0.0009232427,0.005925653,0.00007032702,0.000035810044],"category_scores_gemma":[0.000096264324,0.00013538967,0.000050610768,0.000851785,0.00002381534,0.000454674,0.004147547,0.00010741712,0.00018711142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011870844,0.0001209007,0.00019265554,0.00023377068,0.00011829521,0.000054163986,0.0006054961,0.014285897,0.00096989796,0.17810772,0.26220867,0.54309064],"study_design_scores_gemma":[0.000097211276,0.000042494343,0.00006585869,0.00006220293,0.000007541325,0.0000071036084,0.00002782091,0.72590023,0.001668776,0.0010590344,0.2708841,0.00017760845],"about_ca_topic_score_codex":0.000017113294,"about_ca_topic_score_gemma":0.00003882156,"teacher_disagreement_score":0.7116144,"about_ca_system_score_codex":0.000062370644,"about_ca_system_score_gemma":0.000052980387,"threshold_uncertainty_score":0.99945277},"labels":[],"label_agreement":null},{"id":"W4404396572","doi":"10.48550/arxiv.2411.04159","title":"Cooperation and Personalization on a Seesaw: Choice-based FL for Safe Cooperation in Wireless Networks","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Seesaw molecular geometry; Personalization; Computer science; Wireless; Computer network; World Wide Web; Telecommunications; Physics","score_opus":0.053974011627200384,"score_gpt":0.20259015554240575,"score_spread":0.14861614391520536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404396572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1973784,0.00008020149,0.7995483,0.0010472527,0.00047565234,0.000881669,0.00001795374,0.00041265626,0.0001578605],"genre_scores_gemma":[0.99641013,0.00007043431,0.002317021,0.00039520056,0.00010420184,0.000021239171,0.00011471543,0.000026097066,0.0005409393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980081,0.000099344536,0.00022481619,0.0012427536,0.00009018711,0.00033482423],"domain_scores_gemma":[0.9987273,0.00020820547,0.00011033046,0.0006494986,0.0002142202,0.00009040879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032397365,0.00032907625,0.00030653013,0.000557019,0.00015329526,0.0003430231,0.00078356883,0.00044090528,0.0000031976597],"category_scores_gemma":[0.00008081752,0.0003795261,0.00007642574,0.0011498855,0.000066120534,0.00022158606,0.00083542295,0.00053502613,0.0000152512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047922735,0.000045762765,0.00053778506,0.00009613612,0.000021516642,0.00003084457,0.00011165161,0.8384149,0.00005030414,0.15661497,0.0010239745,0.0030042205],"study_design_scores_gemma":[0.0005361465,0.00015202786,0.00039818653,0.0003425582,0.000029185796,9.99067e-7,0.000016587555,0.99323285,0.00016363159,0.0042064623,0.0005316885,0.00038967634],"about_ca_topic_score_codex":0.00008357103,"about_ca_topic_score_gemma":0.00062074995,"teacher_disagreement_score":0.79903173,"about_ca_system_score_codex":0.0003953536,"about_ca_system_score_gemma":0.00021078407,"threshold_uncertainty_score":0.99986565},"labels":[],"label_agreement":null},{"id":"W4404788249","doi":"10.1145/3652892.3700777","title":"Ripple: Large-Scale Service and Configuration Management in the Cloud","year":2024,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cloud computing; Computer science; Scale (ratio); Service (business); Business; Operating system; Physics","score_opus":0.011956808541150584,"score_gpt":0.25071159369701657,"score_spread":0.23875478515586598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031385332,0.000482813,0.79296017,0.12643227,0.00054650113,0.00053832633,0.0000021675178,0.0011165233,0.046535913],"genre_scores_gemma":[0.9439617,0.000054923785,0.046256885,0.008190693,0.000057513655,0.000077233955,0.0000027889425,0.0000060721686,0.001392183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992788,0.000024870293,0.00009981726,0.0002586833,0.00016107825,0.00017678361],"domain_scores_gemma":[0.99953556,0.000048536072,0.00000812981,0.00037603828,0.000014614823,0.000017121214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003841493,0.00007055816,0.000054813023,0.000093129485,0.000044292243,0.00031988038,0.0006666846,0.000033564393,0.000009912781],"category_scores_gemma":[0.000003726965,0.000047058904,0.000009906038,0.00086270296,0.000010154249,0.00019280617,0.00034203415,0.00009483348,0.0001054354],"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.0000014381765,0.000023423121,0.00008571681,0.000040498504,0.000011707408,0.00005907668,0.0026987323,0.00009772846,0.000084847714,0.83484495,0.059514817,0.10253706],"study_design_scores_gemma":[0.00021425688,0.000050233717,0.006095479,0.000058082882,0.000008238531,0.00002634994,0.0016920506,0.3280047,0.00066694117,0.03804227,0.6249126,0.00022877713],"about_ca_topic_score_codex":0.00002650046,"about_ca_topic_score_gemma":0.0004122562,"teacher_disagreement_score":0.9125764,"about_ca_system_score_codex":0.00001713628,"about_ca_system_score_gemma":0.000006322243,"threshold_uncertainty_score":0.30846137},"labels":[],"label_agreement":null},{"id":"W4405936777","doi":"10.1109/itnac62915.2024.10815539","title":"Data Compliance in P2P Energy Sharing: A Blockchain-Based Platform for PIPEDA","year":2024,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Carleton University","funders":"","keywords":"Blockchain; Compliance (psychology); Computer science; Data sharing; Computer security; Energy (signal processing); Sharing economy; World Wide Web; Medicine","score_opus":0.14172743813254896,"score_gpt":0.33434316203526726,"score_spread":0.1926157239027183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405936777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034382204,0.00040584937,0.981647,0.0099293385,0.00044472932,0.00024395577,0.00004725729,0.0019038924,0.0019397229],"genre_scores_gemma":[0.7627674,0.00000335135,0.2337878,0.0015214881,0.00007547484,0.0001305608,0.000027995871,0.000020815769,0.0016651493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980309,0.0000051839506,0.00026357317,0.00097387336,0.00022551794,0.00050097617],"domain_scores_gemma":[0.99755615,0.00025002885,0.000026366648,0.002055349,0.00003785258,0.00007425903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037401821,0.00018133824,0.00019528318,0.00031621958,0.00005738474,0.00031027469,0.0048536346,0.00009323276,0.000009464994],"category_scores_gemma":[0.0000839614,0.0001633859,0.000039700244,0.0011086261,0.000037317168,0.00017893389,0.0019761072,0.00014287628,0.000038696184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017298347,0.000083096966,0.00017861112,0.00010528316,0.000026477195,0.00010355737,0.000102292935,0.009178533,0.00032681436,0.59710324,0.08192254,0.31085226],"study_design_scores_gemma":[0.00016519407,0.00005342167,0.000038662114,0.000107915745,0.0000020394202,0.0000049557575,0.000008494764,0.85194397,0.0011084985,0.017209832,0.12915932,0.00019773033],"about_ca_topic_score_codex":0.00014813365,"about_ca_topic_score_gemma":0.0011330984,"teacher_disagreement_score":0.8427654,"about_ca_system_score_codex":0.00009295006,"about_ca_system_score_gemma":0.00011203564,"threshold_uncertainty_score":0.90193415},"labels":[],"label_agreement":null},{"id":"W4406321270","doi":"10.1109/mwc.006.2400120","title":"Cooperation and Personalization on a Seesaw: Choice-based FL for Safe Cooperation in Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Ottawa","funders":"","keywords":"Computer science; Personalization; Wireless; Computer network; Wireless network; Seesaw molecular geometry; Telecommunications; World Wide Web","score_opus":0.026114690176032372,"score_gpt":0.3010904216465767,"score_spread":0.2749757314705443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406321270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054328337,0.00025165043,0.9267415,0.016544936,0.00024647632,0.0011121827,0.000013197888,0.00036623882,0.00039548625],"genre_scores_gemma":[0.97488904,0.00018493051,0.0217955,0.0018885138,0.000032414457,0.00085731316,0.00012285782,0.000017116843,0.00021234096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984401,0.00020546575,0.00041247025,0.00047413557,0.00015632034,0.0003115128],"domain_scores_gemma":[0.99687624,0.0008293255,0.000107386564,0.0018045555,0.0003224105,0.000060068214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044723513,0.00021851479,0.00026068144,0.00043505247,0.0005624394,0.0003097911,0.0016721161,0.0001989738,0.000001123419],"category_scores_gemma":[0.00014685356,0.00023818146,0.000042939326,0.0015903948,0.00013364987,0.00036023918,0.00028454466,0.00029716975,0.000005407415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007113419,0.0005447515,0.003841423,0.00007848513,0.00004785998,0.0000011874522,0.0007496644,0.16908163,0.004473594,0.646,0.0073203263,0.16778994],"study_design_scores_gemma":[0.00077557424,0.00009197878,0.0024319033,0.00023468629,0.000010197606,7.469634e-7,0.00002964757,0.9894061,0.0013698767,0.0003911465,0.0050224853,0.00023563081],"about_ca_topic_score_codex":0.00008139732,"about_ca_topic_score_gemma":0.0017747493,"teacher_disagreement_score":0.92056066,"about_ca_system_score_codex":0.00020758781,"about_ca_system_score_gemma":0.00018355768,"threshold_uncertainty_score":0.9712758},"labels":[],"label_agreement":null},{"id":"W4408667864","doi":"10.1145/3715675.3715839","title":"IMAC: Intelligent Multi-Agent Content Steering for DASH","year":2025,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dash; Computer science; Content (measure theory); Human–computer interaction; Operating system; Mathematics","score_opus":0.0880641289002302,"score_gpt":0.3160454139834149,"score_spread":0.22798128508318471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408667864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004510174,0.00020301747,0.9853647,0.005881385,0.00093730615,0.0006353049,0.0000021825265,0.0011031257,0.0013628126],"genre_scores_gemma":[0.35664526,0.000019537383,0.63036406,0.0018280814,0.000023641594,0.00023065641,0.000001414611,0.000009004884,0.01087835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871564,0.000011809186,0.00026712677,0.0004579469,0.00014929801,0.00039820326],"domain_scores_gemma":[0.99890834,0.00011418041,0.000036250476,0.0007460729,0.00012763795,0.00006750119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025002647,0.00015489956,0.0001841435,0.00020259398,0.00009091442,0.00015683111,0.0015363531,0.00006566368,0.000005380688],"category_scores_gemma":[0.0001452222,0.00013399865,0.00008723839,0.00045252056,0.000028878423,0.00013793379,0.0011696895,0.00009625608,0.000056072044],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012070583,0.00014878444,0.0010544873,0.00004592419,0.000090755755,0.00000912177,0.00029337656,0.0021065262,0.0050055366,0.31402603,0.03563522,0.6415722],"study_design_scores_gemma":[0.00097210146,0.00023704521,0.003906395,0.000150952,0.00001890495,0.0000053453955,0.00041717023,0.48404115,0.19150953,0.0054736394,0.31262758,0.0006401529],"about_ca_topic_score_codex":0.0000370774,"about_ca_topic_score_gemma":0.00007083888,"teacher_disagreement_score":0.640932,"about_ca_system_score_codex":0.00013397302,"about_ca_system_score_gemma":0.000041271902,"threshold_uncertainty_score":0.54643065},"labels":[],"label_agreement":null},{"id":"W4409744558","doi":"10.1016/j.ins.2025.122238","title":"Reward shaping in DRL: A novel framework for adaptive resource management in dynamic environments","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dynamic capabilities; Adaptive management; Resource (disambiguation); Process management; Knowledge management; Business; Environmental resource management; Computer network","score_opus":0.034461723783076166,"score_gpt":0.3075118458420571,"score_spread":0.27305012205898094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409744558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008387826,0.000027095368,0.98085064,0.0047015008,0.00015074843,0.0005600033,0.0000023531286,0.000116436095,0.005203403],"genre_scores_gemma":[0.5338382,0.000009264571,0.4642928,0.0015899015,0.0000029108337,0.000170727,0.0000013070763,0.0000014784528,0.000093406816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.0000139163285,0.00038023334,0.00025383616,0.00035398777,0.000335196],"domain_scores_gemma":[0.9993873,0.00016103726,0.00010634131,0.0003071033,0.000013357873,0.000024834553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985206,0.00010348197,0.00011920862,0.0010108467,0.00012654747,0.00022946327,0.0015335571,0.000071352166,7.9618434e-7],"category_scores_gemma":[0.000152519,0.000099765246,0.00002443098,0.0022463128,0.00010751936,0.0016051038,0.00062989903,0.00012324766,0.000021315029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001735588,0.000039672246,0.0008379368,0.000023716131,0.000008602601,0.0000012863007,0.0032291613,0.063359745,0.000023606017,0.5442049,0.00065420085,0.38759986],"study_design_scores_gemma":[0.00055404514,0.00010324529,0.026926404,0.00040650927,0.0000023515975,0.0000011663046,0.0033862535,0.8274851,0.00017075824,0.091020934,0.049666222,0.000277012],"about_ca_topic_score_codex":0.000015292295,"about_ca_topic_score_gemma":0.000037342183,"teacher_disagreement_score":0.76412535,"about_ca_system_score_codex":0.00021589806,"about_ca_system_score_gemma":0.00003719707,"threshold_uncertainty_score":0.40683088},"labels":[],"label_agreement":null},{"id":"W4411549699","doi":"10.1145/3701716.3715573","title":"Decentralized and Policy-Aware Serverless Orchestration for the Federated Web","year":2025,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Orchestration; Computer science; World Wide Web; Distributed computing","score_opus":0.017182729811694834,"score_gpt":0.29576333835619667,"score_spread":0.27858060854450184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411549699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019476151,0.00013216259,0.8942258,0.08412352,0.00014301806,0.00050475093,0.0000027790018,0.0006283744,0.00076346437],"genre_scores_gemma":[0.9687756,0.00005125608,0.027347328,0.0022365018,0.000020699044,0.00008939248,0.0000021727867,0.0000040027467,0.0014730651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999282,0.00002140007,0.00012544268,0.0002448294,0.000090753725,0.0002355859],"domain_scores_gemma":[0.99930584,0.00021655648,0.000025023193,0.00032647705,0.00009395198,0.00003215115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017643938,0.0000950238,0.00009740378,0.00009218687,0.00024009394,0.0003968742,0.0006287242,0.00006787475,0.0000017105551],"category_scores_gemma":[0.00011453653,0.00006378227,0.00002391493,0.0007366388,0.000035646353,0.00016085745,0.000276049,0.00006317288,0.0000031137656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023819495,0.000028957671,0.0009978336,0.000026156486,0.000052642372,0.0000016431708,0.0001485631,0.0003593075,0.0011988918,0.7340779,0.052609984,0.21047434],"study_design_scores_gemma":[0.0012863235,0.00010115357,0.011630211,0.000050312567,0.000018236899,0.000007433764,0.00024432904,0.85169697,0.016511656,0.044617776,0.07351627,0.00031934012],"about_ca_topic_score_codex":0.00009383337,"about_ca_topic_score_gemma":0.00047994687,"teacher_disagreement_score":0.94929945,"about_ca_system_score_codex":0.000042527216,"about_ca_system_score_gemma":0.00016439662,"threshold_uncertainty_score":0.3827067},"labels":[],"label_agreement":null},{"id":"W4413311641","doi":"10.1145/3748355.3748365","title":"Toward eBPF-Accelerated Pub-Sub Systems","year":2025,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.035609092344541626,"score_gpt":0.2620570519764227,"score_spread":0.22644795963188108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413311641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018793875,0.00041707745,0.9008842,0.012884332,0.0017980214,0.0003865612,0.0000013292306,0.0040279836,0.060806617],"genre_scores_gemma":[0.96698576,0.00001505605,0.023829067,0.001144356,0.000035922076,0.00007519551,0.0000013198297,0.0000068813993,0.007906463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986025,0.000033661294,0.00025011908,0.00047466715,0.00022677184,0.00041224228],"domain_scores_gemma":[0.9987519,0.00006426672,0.00003840193,0.00093740516,0.00013901827,0.000069036505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022916726,0.00015946821,0.0002132634,0.00027952265,0.00008386985,0.0004859616,0.0020474857,0.00012171645,0.000008905732],"category_scores_gemma":[0.00008245318,0.00013652985,0.000040982446,0.001799187,0.000031654443,0.0002936848,0.0009755545,0.00015215475,0.00029669557],"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.0000045095708,0.00004727551,0.0006381476,0.000037443486,0.0000529765,0.000044451128,0.0001148178,0.0011984129,0.0034187513,0.59831345,0.29624182,0.09988793],"study_design_scores_gemma":[0.0010333301,0.00028232904,0.0073870844,0.00031100278,0.000023551484,0.000057599136,0.00037138336,0.34940675,0.10226852,0.020877797,0.51651716,0.0014634912],"about_ca_topic_score_codex":0.000094674906,"about_ca_topic_score_gemma":0.00001532936,"teacher_disagreement_score":0.9481919,"about_ca_system_score_codex":0.00008984091,"about_ca_system_score_gemma":0.00008986372,"threshold_uncertainty_score":0.55675256},"labels":[],"label_agreement":null},{"id":"W4413812270","doi":"10.14778/3725688.3725720","title":"A Flexible Framework for Query-Oriented Interactive Community Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Query optimization; Information retrieval; Web search query; Query expansion; Query language; Theoretical computer science; Search engine","score_opus":0.024246797064614276,"score_gpt":0.3154671397279443,"score_spread":0.29122034266333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413812270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17620778,0.00019209296,0.774045,0.029771173,0.0012856405,0.0028430058,0.00001927964,0.0010149968,0.014621022],"genre_scores_gemma":[0.82056886,0.000011332061,0.17767426,0.0006566937,0.00002341079,0.00031557915,4.932602e-7,0.000008896404,0.0007404519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99869245,0.000020763811,0.00027649087,0.00029624143,0.00032097942,0.00039307415],"domain_scores_gemma":[0.9984057,0.0004060927,0.00013586841,0.000519724,0.0004830636,0.000049582985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007289858,0.00016999285,0.0002396642,0.00019447121,0.0003183674,0.00012294426,0.0030892012,0.000095448195,0.0000012824088],"category_scores_gemma":[0.00084102195,0.00012810694,0.000121702906,0.00113553,0.00010722805,0.00026237647,0.0030400997,0.00059159694,0.00000350229],"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.00008789669,0.0002610106,0.0010868914,0.00013710874,0.00011256474,1.311628e-7,0.0030975281,0.000070949005,0.006119574,0.9509746,0.016273962,0.021777818],"study_design_scores_gemma":[0.00043699384,0.0002883421,0.0012521937,0.0005915318,0.0000211642,0.0000026732246,0.0016449369,0.0025229498,0.7313072,0.24519365,0.016542636,0.00019572291],"about_ca_topic_score_codex":0.00017057748,"about_ca_topic_score_gemma":0.0000062644817,"teacher_disagreement_score":0.72518766,"about_ca_system_score_codex":0.00022964846,"about_ca_system_score_gemma":0.000055493896,"threshold_uncertainty_score":0.57405555},"labels":[],"label_agreement":null},{"id":"W48467249","doi":"10.1007/978-3-642-41527-2_14","title":"Gossip Protocols for Renaming and Sorting","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Gossip; Computer science; Sorting; Node (physics); Protocol (science); Computer network; Theoretical computer science; Binary logarithm; Sorting network; Logarithm; Communication complexity; Combinatorics; Discrete mathematics; Sorting algorithm; Mathematics; Algorithm","score_opus":0.027720896227428602,"score_gpt":0.28024312672515317,"score_spread":0.25252223049772454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48467249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008335716,0.00014170253,0.98639613,0.0020294767,0.00049896183,0.009084277,0.0000028011711,0.00051597203,0.0012473055],"genre_scores_gemma":[0.0117580155,0.000005137756,0.98394716,0.0011745138,0.0003466868,0.0021546832,0.000001475455,0.000041023264,0.00057131815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597824,0.000015629472,0.0005746571,0.0018239599,0.0006769751,0.0009305427],"domain_scores_gemma":[0.9970615,0.00061467156,0.0003407973,0.0015150716,0.00028323926,0.00018471935],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010193854,0.0005377258,0.00057804724,0.0008044617,0.0003538042,0.0011429178,0.0039815293,0.00038659485,0.0000033827362],"category_scores_gemma":[0.00038790712,0.0004819794,0.000088208544,0.00058435363,0.0005617619,0.00065928255,0.0029561687,0.00063813553,0.000025184274],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026147409,0.000007515091,0.00003279025,0.00005897826,0.0000056332065,0.000013160615,0.00030383957,0.0031949133,0.00023824263,0.023220574,0.00014873366,0.972773],"study_design_scores_gemma":[0.00031009497,0.00040338904,0.00012227129,0.0011606995,0.0000054116,0.000064300475,2.6155223e-7,0.5318111,0.0027593852,0.45215034,0.0102226,0.0009901198],"about_ca_topic_score_codex":0.000011512424,"about_ca_topic_score_gemma":0.000034203487,"teacher_disagreement_score":0.97178286,"about_ca_system_score_codex":0.0002143563,"about_ca_system_score_gemma":0.0002756631,"threshold_uncertainty_score":0.99989396},"labels":[],"label_agreement":null},{"id":"W52853789","doi":"10.1137/1.9781611972764.40","title":"Collaborative Document Clustering","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Document clustering; Data mining; Process (computing); Information retrieval; Cluster (spacecraft); Fuzzy clustering; Judgement; Similarity (geometry); Artificial intelligence; Computer network","score_opus":0.00511737081750828,"score_gpt":0.22900948228116982,"score_spread":0.22389211146366153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52853789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008527536,0.000050223513,0.9306142,0.007987333,0.00022981154,0.00016562313,5.332871e-7,0.001205514,0.051219255],"genre_scores_gemma":[0.58334774,0.0000019435388,0.4124666,0.00044304304,0.000042558797,0.00002652521,5.063217e-7,0.0000041091594,0.003666975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991669,0.000013774782,0.0001278781,0.0002635137,0.00018201498,0.00024590592],"domain_scores_gemma":[0.99939865,0.00003052655,0.000027285985,0.00044504128,0.0000654278,0.000033058684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107417574,0.00009139067,0.00009053432,0.00009157431,0.000063049585,0.00018249384,0.00079356314,0.0000374009,0.000012346376],"category_scores_gemma":[0.000012655246,0.000078528254,0.000016905202,0.0007724581,0.000020553536,0.00026312695,0.0006482998,0.000054278302,0.00018155015],"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.0000049077057,0.00004980314,0.0008219305,0.0000054250577,0.0000155372,0.000052715994,0.00030458512,0.0131601365,0.001772762,0.67588925,0.21823876,0.08968422],"study_design_scores_gemma":[0.0010140429,0.0004839282,0.019225815,0.000060446782,0.000008226933,0.000041418687,0.00033154094,0.10539075,0.09143785,0.1688782,0.61168325,0.0014445344],"about_ca_topic_score_codex":0.00010030564,"about_ca_topic_score_gemma":0.00030179825,"teacher_disagreement_score":0.5748202,"about_ca_system_score_codex":0.00006477195,"about_ca_system_score_gemma":0.000024612005,"threshold_uncertainty_score":0.32022893},"labels":[],"label_agreement":null},{"id":"W56971960","doi":"10.22215/etd/2003-05586","title":"High performance middleware for mobile wireless publish/subscribe systems","year":2003,"lang":"en","type":"dissertation","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Middleware (distributed applications); Publication; Scalability; Mobile computing; Computer network; Context (archaeology); Domain (mathematical analysis); Wireless network; Distributed computing; Message oriented middleware; Asynchronous communication; Wireless; Telecommunications; Software architecture; Software; Operating system","score_opus":0.014620479305677883,"score_gpt":0.2362906589824621,"score_spread":0.2216701796767842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56971960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66642684,0.0030083936,0.26494655,0.00065781747,0.028784161,0.007983082,0.0001223953,0.007146154,0.020924568],"genre_scores_gemma":[0.66198057,0.00021046928,0.078712076,0.00042064252,0.0004006897,0.007917904,0.0013055602,0.00017765307,0.24887446],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967385,0.00003704799,0.00061032554,0.0011334165,0.00064161164,0.00083907665],"domain_scores_gemma":[0.99707377,0.00011205391,0.00031948992,0.0016384677,0.0007068185,0.00014941211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004027942,0.000553354,0.0006794833,0.0005116082,0.00025164997,0.001018022,0.003512551,0.0007081762,0.000012891555],"category_scores_gemma":[0.00007775225,0.0005106121,0.00014170443,0.0011262364,0.000027686081,0.00096185744,0.00018872804,0.00040949785,0.00010987158],"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.00007460168,0.0002522895,0.00026562467,0.0025878476,0.00024534573,0.000022042706,0.0011155261,0.006526108,0.00046828925,0.19931754,0.54321384,0.24591091],"study_design_scores_gemma":[0.003113744,0.0032627725,0.002044884,0.0033868493,0.00023690691,0.00011856034,0.0071971784,0.25230917,0.066576466,0.0044581085,0.64840114,0.0088941995],"about_ca_topic_score_codex":0.000099011144,"about_ca_topic_score_gemma":0.00012787853,"teacher_disagreement_score":0.24578305,"about_ca_system_score_codex":0.00019952946,"about_ca_system_score_gemma":0.00024058738,"threshold_uncertainty_score":0.9997345},"labels":[],"label_agreement":null},{"id":"W57126538","doi":"","title":"Bridging Virtual Communities: The Object-Subscription Protocol","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bridging (networking); Computer science; Protocol (science); Implementation; Object (grammar); Human–computer interaction; Computer security; Artificial intelligence; Software engineering","score_opus":0.021792242557283344,"score_gpt":0.27305692967728057,"score_spread":0.2512646871199972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57126538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066248267,0.0000041530425,0.9296596,0.018414667,0.00012814208,0.0248594,5.119284e-7,0.0024135686,0.017895106],"genre_scores_gemma":[0.94976354,7.1076107e-7,0.0267422,0.0061610774,0.00008640096,0.015916143,8.3634217e-7,0.000007044775,0.0013220535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891263,0.000078402154,0.00018704297,0.00018735112,0.00029513516,0.0003394305],"domain_scores_gemma":[0.9985811,0.00006512928,0.00005064683,0.0011934239,0.000066262284,0.000043438566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039744307,0.00013846064,0.00011295811,0.000111327114,0.00030743302,0.00034786583,0.0024330248,0.00005880798,0.000014186969],"category_scores_gemma":[0.000036533347,0.00009254102,0.000042940646,0.00060806674,0.00006213668,0.0004338182,0.00048990524,0.00026130737,0.00012397135],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010117613,0.00007341867,0.00017064778,0.0000031202499,0.000008494821,0.0000066392186,0.0026126967,0.0008249173,0.0008089646,0.22075045,0.06059457,0.71413594],"study_design_scores_gemma":[0.0017593193,0.0029914598,0.030153964,0.00028544542,0.000011186997,0.00018198889,0.00454753,0.59176725,0.022522824,0.05865634,0.28544444,0.0016782798],"about_ca_topic_score_codex":0.00008170875,"about_ca_topic_score_gemma":0.000073545714,"teacher_disagreement_score":0.9431387,"about_ca_system_score_codex":0.000057134694,"about_ca_system_score_gemma":0.000033614528,"threshold_uncertainty_score":0.4521206},"labels":[],"label_agreement":null},{"id":"W57379477","doi":"","title":"On the locality of BitTorrent-based video file swarming","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"BitTorrent; Locality; Computer science; Zipf's law; The Internet; Computer network; Distributed computing; Peer-to-peer; BitTorrent tracker; File sharing; Swarm behaviour; World Wide Web; Artificial intelligence","score_opus":0.01665385437846084,"score_gpt":0.2396815420729665,"score_spread":0.22302768769450565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57379477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03993003,0.000025858637,0.9215451,0.029302655,0.00018242832,0.00022554022,0.000009408689,0.0008871947,0.0078917835],"genre_scores_gemma":[0.95787066,4.2046318e-7,0.038055643,0.003841563,0.000014932548,0.000009021302,0.0000012644434,0.0000026908385,0.00020379323],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901575,0.00003755067,0.00017012081,0.00025610704,0.00028909245,0.0002313578],"domain_scores_gemma":[0.99843985,0.00044487108,0.000057133355,0.00096529914,0.00005299052,0.000039829214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029068507,0.00010195415,0.00012126421,0.00008372417,0.00006418345,0.000046224548,0.0014240184,0.000049127495,0.00013220138],"category_scores_gemma":[0.0002821155,0.00006398544,0.000053463278,0.0006313238,0.0000481675,0.00008044869,0.00016002069,0.00012099589,0.000082458064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101563855,0.00015780558,0.000121450576,0.000004914855,0.0000075118032,0.0000068896575,0.00008618403,0.0043665245,0.00094507314,0.24813005,0.45241207,0.29375136],"study_design_scores_gemma":[0.00060486636,0.0014156811,0.0160372,0.0002468087,0.0000101142605,0.0000049676914,0.00010626832,0.51323414,0.3198951,0.10100907,0.046641592,0.0007941962],"about_ca_topic_score_codex":0.000027807468,"about_ca_topic_score_gemma":0.000008749804,"teacher_disagreement_score":0.9179406,"about_ca_system_score_codex":0.00003147242,"about_ca_system_score_gemma":0.000037751226,"threshold_uncertainty_score":0.26462042},"labels":[],"label_agreement":null},{"id":"W620709258","doi":"10.1007/978-3-319-11701-0_7","title":"Bandwidth Sharing for User Cooperation","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","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","funders":"","keywords":"Goodput; Bandwidth (computing); Throughput; Computer network; Computer science; Extension (predicate logic); Telecommunications; Wireless","score_opus":0.022028307412183736,"score_gpt":0.25155597803056906,"score_spread":0.22952767061838533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W620709258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023693572,0.00007723808,0.9794791,0.0012434452,0.0023806272,0.00089420436,0.000003806888,0.0007592983,0.014925373],"genre_scores_gemma":[0.029602412,0.000037102916,0.93135774,0.0023854785,0.00095480285,0.00014090819,0.000006276567,0.00009504744,0.03542021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510366,0.000011857021,0.000674856,0.0023490058,0.00087183836,0.0009887862],"domain_scores_gemma":[0.9963752,0.00019288028,0.00025397367,0.002524102,0.0004235345,0.00023030605],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019806577,0.0005591037,0.0006143891,0.0011558783,0.00036083636,0.0011991952,0.0076172426,0.00032444077,0.000010209452],"category_scores_gemma":[0.00013750067,0.00058397115,0.00013519257,0.00069142896,0.0004212555,0.0007627991,0.0045125987,0.0005335529,0.00012431871],"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.0000042454167,0.0000102868935,0.000055634326,0.000031908443,0.000007738301,0.0000130545495,0.00012245605,0.0060739755,0.00008943765,0.80310607,0.0013682796,0.18911693],"study_design_scores_gemma":[0.0005635474,0.0004064529,0.00046146696,0.0006946192,0.000010505495,0.000032943288,5.3073074e-7,0.625986,0.0014428778,0.06223462,0.30661067,0.0015557862],"about_ca_topic_score_codex":0.000015028166,"about_ca_topic_score_gemma":0.000067014145,"teacher_disagreement_score":0.7408714,"about_ca_system_score_codex":0.00043996194,"about_ca_system_score_gemma":0.00031795772,"threshold_uncertainty_score":0.99983764},"labels":[],"label_agreement":null},{"id":"W63158830","doi":"","title":"M2etis: An adaptable Publish/Subscribe System for MMVEs based on Event Semantics.","year":2011,"lang":"en","type":"article","venue":"BTW Workshops","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Scalability; Semantics (computer science); Event (particle physics); Distributed computing; Publication; Metis; Programming language; World Wide Web; Database","score_opus":0.04868060382337466,"score_gpt":0.25041110995259513,"score_spread":0.20173050612922047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63158830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006899541,0.00016260635,0.98013186,0.0030458963,0.0016493953,0.00095454644,0.000014493482,0.002676382,0.0044652782],"genre_scores_gemma":[0.79683805,0.0000022784054,0.20167296,0.0005125967,0.00013043225,0.00028252264,0.000009594877,0.00003616964,0.00051541795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727124,0.000082172046,0.00040571584,0.00089265424,0.0004978247,0.00085040886],"domain_scores_gemma":[0.9971641,0.00016675187,0.00015646094,0.0020441716,0.00021706076,0.00025150014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081419543,0.00033213664,0.00036768068,0.00035821905,0.00023392566,0.0004468448,0.002830223,0.00024218546,0.000013640987],"category_scores_gemma":[0.0001960814,0.0003072435,0.00013569345,0.0009844945,0.000057697896,0.0008510595,0.00042145074,0.0002533752,0.00008735079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000337761,0.0014030349,0.0024341266,0.00034040626,0.00015669149,0.00021080591,0.0026726152,0.017740536,0.00033012466,0.4597749,0.20353903,0.31105995],"study_design_scores_gemma":[0.001805571,0.0017072969,0.007779317,0.0011288542,0.000070400776,0.00004168958,0.0014474748,0.908609,0.011836919,0.007884057,0.05584638,0.0018430768],"about_ca_topic_score_codex":0.00005018685,"about_ca_topic_score_gemma":0.000088398236,"teacher_disagreement_score":0.8908684,"about_ca_system_score_codex":0.00015588266,"about_ca_system_score_gemma":0.00010879906,"threshold_uncertainty_score":0.99993795},"labels":[],"label_agreement":null},{"id":"W656082047","doi":"10.1007/978-3-319-17957-5_13","title":"Testing Policy-Based e-Health Monitoring Processes Using TTCN-3","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","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 Ottawa","funders":"","keywords":"Computer science; Reliability engineering; Engineering","score_opus":0.07089854527508999,"score_gpt":0.3079224096594198,"score_spread":0.23702386438432982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W656082047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009151186,0.0020718188,0.98533016,0.003571548,0.000502419,0.00063833577,0.000012196824,0.001449917,0.0063320617],"genre_scores_gemma":[0.17281696,0.000039000515,0.8234752,0.002295424,0.0009254444,0.00007043283,0.00009314929,0.00013272432,0.00015167065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962078,0.000022254539,0.0012305902,0.00058938103,0.0010961468,0.0008538459],"domain_scores_gemma":[0.9946566,0.00025595748,0.0013739356,0.00080304855,0.0027308988,0.00017956605],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007214058,0.0007504842,0.0007468366,0.0024536783,0.00040825063,0.001103762,0.0017431322,0.00065582944,0.0000018799348],"category_scores_gemma":[0.0037762139,0.000748281,0.00004766698,0.003960511,0.0001142841,0.003451701,0.0006386854,0.00087158586,0.000026818941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009589879,0.000010445169,0.00022712482,0.0020575707,0.0000071240383,0.000006792687,0.00077637413,0.26883447,0.0000131176375,0.0009815299,0.00003383303,0.727042],"study_design_scores_gemma":[0.002552538,0.0003435013,0.0011822303,0.052669946,0.00007962486,0.00029797672,0.00008199794,0.677972,0.0031150274,0.17225741,0.08278382,0.0066639227],"about_ca_topic_score_codex":0.0001387135,"about_ca_topic_score_gemma":0.000034144046,"teacher_disagreement_score":0.7203781,"about_ca_system_score_codex":0.001444139,"about_ca_system_score_gemma":0.0069458256,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W6945201839","doi":"10.25316/ir-13181","title":"The Nanaimo Free Press [Tuesday, January 14, 1890]","year":2019,"lang":"en","type":"other","venue":"VIURRSpace (Vancouver Island University)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.008817856549893801,"score_gpt":0.19476591346354166,"score_spread":0.18594805691364785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945201839","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.214923e-7,0.0009995821,0.04527281,0.0020424402,0.004410986,0.0007370412,0.000092002665,0.0015391781,0.9449052],"genre_scores_gemma":[0.00008197287,0.00088559586,0.004951021,0.00014894568,0.00023390997,0.00000394447,4.1983105e-7,0.00016160554,0.9935326],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710876,0.0001295071,0.00016489661,0.0010635984,0.0006798086,0.0008534557],"domain_scores_gemma":[0.99551696,0.00021848231,0.00031132062,0.0036675178,0.00011617311,0.00016956199],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00018138935,0.0005819751,0.0005226144,0.0007261435,0.00031586282,0.00024764935,0.0074740197,0.0006171908,0.00002300972],"category_scores_gemma":[0.00008031457,0.00048049615,0.00020282748,0.0012039627,0.00018113262,0.00032202504,0.003609614,0.00067221466,0.00039363772],"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.000016086447,0.00002605948,0.0000015791724,0.000025254842,0.00012613954,0.00015450532,0.0001106282,0.00012671102,0.000002622039,0.011717624,0.9831997,0.0044930885],"study_design_scores_gemma":[0.0006576602,0.0001012922,0.0000032799267,0.00015817316,0.00004369771,0.0000041222806,0.00013845976,0.0004503846,0.000038361486,0.00042606605,0.9973328,0.00064571004],"about_ca_topic_score_codex":0.0006553289,"about_ca_topic_score_gemma":0.006816365,"teacher_disagreement_score":0.048627347,"about_ca_system_score_codex":0.00023385992,"about_ca_system_score_gemma":0.00020317617,"threshold_uncertainty_score":0.9997647},"labels":[],"label_agreement":null},{"id":"W6946479554","doi":"10.34943/06a59845-7fd6-4763-b2e3-e95e3b79a554","title":"Barkley Canyon Mid-West Video Camera Deployed 2009-09-11","year":2010,"lang":"en","type":"dataset","venue":"Ocean Networks Canada Society","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Canyon; Software deployment; Digital video; Mobile device; Sediment; Video camera","score_opus":0.006092950383876913,"score_gpt":0.20212859769647423,"score_spread":0.19603564731259732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6946479554","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000558257,0.0020244098,0.013621687,0.009655134,0.009850806,0.001289935,0.96138585,0.0015840239,0.000029914634],"genre_scores_gemma":[0.0022573527,0.0016874366,0.025010196,0.020240847,0.0036702335,0.0001273733,0.9457563,0.00028922042,0.0009610241],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99243695,0.00015505329,0.0009948116,0.0021897908,0.0017438604,0.002479555],"domain_scores_gemma":[0.9928788,0.00046397618,0.0006353544,0.0046774256,0.00035926604,0.0009851598],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0008048132,0.0013683165,0.0012666145,0.00015504136,0.00078110455,0.0006810502,0.008631495,0.0019869658,0.00004295473],"category_scores_gemma":[0.00018656843,0.0014213196,0.0005207826,0.0021117062,0.00033841422,0.00038543402,0.0025433216,0.0040159086,0.000013602362],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042643164,0.00003782605,0.0001067992,0.00005020141,0.00015580619,0.00018910789,0.000035807385,0.004700916,0.0000027082478,0.000038113005,0.9915985,0.003079945],"study_design_scores_gemma":[0.00033811372,0.00006120597,0.00021188457,0.0001505599,0.00009222318,0.000059452144,0.000046256966,0.009096731,0.000020817308,0.00005278806,0.98835677,0.001513206],"about_ca_topic_score_codex":0.71504116,"about_ca_topic_score_gemma":0.9674212,"teacher_disagreement_score":0.25237998,"about_ca_system_score_codex":0.0013706095,"about_ca_system_score_gemma":0.003811033,"threshold_uncertainty_score":0.9999068},"labels":[],"label_agreement":null},{"id":"W6947504773","doi":"10.3897/zookeys.179.2465.map7","title":"Map 7 from: Webster R, Sweeney J, DeMerchant I, Bouchard P, Bousquet Y (2012) New Coleoptera records from New Brunswick, Canada: Tenebrionidae and Zopheridae. ZooKeys 179: 257-277. https://doi.org/10.3897/zookeys.179.2465","year":2012,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Habitat; Holotype; Biogeography; Global biodiversity; Fauna","score_opus":0.02556373181822726,"score_gpt":0.21691024691134397,"score_spread":0.1913465150931167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947504773","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045911204,0.010382937,0.08262846,0.014842847,0.003792826,0.0032409497,0.00044106302,0.009066151,0.87101364],"genre_scores_gemma":[0.0027736658,0.000979338,0.022658834,0.0015802167,0.0026982916,5.857872e-7,0.0017211459,0.0051302854,0.96245766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939368,0.0004895391,0.00078635407,0.0019245946,0.0012865356,0.0015761891],"domain_scores_gemma":[0.995106,0.00010023422,0.0005444161,0.0025094994,0.0003935836,0.0013462692],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00054340845,0.0009337557,0.00091063004,0.0006446505,0.0010660071,0.001815426,0.0053761513,0.0006335368,0.16183358],"category_scores_gemma":[0.00036942892,0.000990415,0.00013988356,0.0009018072,0.00025955943,0.0006952608,0.0066541643,0.0012768565,0.08679441],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004920712,0.000058030888,0.00012154051,0.00004393078,0.00021906506,0.00007261441,0.00039057614,0.000009650424,0.00010982584,0.0009960671,0.9322079,0.065721616],"study_design_scores_gemma":[0.0009365323,0.00020859265,0.0035956777,0.00033139257,0.00007210271,0.000008621624,0.000054726523,0.00032849348,0.00022318914,0.00037910472,0.99281275,0.0010487853],"about_ca_topic_score_codex":0.45848393,"about_ca_topic_score_gemma":0.028023822,"teacher_disagreement_score":0.4304601,"about_ca_system_score_codex":0.00088434195,"about_ca_system_score_gemma":0.0005536235,"threshold_uncertainty_score":0.99925464},"labels":[],"label_agreement":null},{"id":"W6947691111","doi":"10.4224/20386352","title":"Numerical modelling of movement and behaviour of smoke produced from fires in the Ville-Marie and L.-H. Lafontaine tunnels: literature review","year":2003,"lang":"en","type":"report","venue":"NPARC","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Smoke; Fire safety; Research council; Event (particle physics); Fire detection; Current (fluid); Calibration; Movement (music)","score_opus":0.043474024331638356,"score_gpt":0.2775900818879539,"score_spread":0.23411605755631557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947691111","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09713088,0.8090424,0.06347641,0.01835872,0.00093674724,0.0051820823,0.0003241777,0.00031421575,0.005234368],"genre_scores_gemma":[0.7308475,0.18980768,0.07762061,0.0010622191,0.00011217601,0.0002390041,0.00007219717,0.0000430794,0.0001955818],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974149,0.00013852716,0.00067960925,0.0006852156,0.0008130847,0.00026867527],"domain_scores_gemma":[0.99795157,0.00020056118,0.00038522357,0.0011335271,0.00027900597,0.000050094644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012273977,0.00030579497,0.0008178638,0.00016137566,0.00003641984,0.00006681974,0.0009671038,0.00024078936,0.000005281468],"category_scores_gemma":[0.00040730185,0.00021457407,0.0000757888,0.00069685176,0.000081382175,0.00010815337,0.00043937672,0.0005421187,1.8238713e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012507019,0.0018521862,0.045714665,0.020676063,0.00090392906,0.0015003014,0.01163021,0.0061587095,0.001971467,0.011601058,0.13685523,0.7610111],"study_design_scores_gemma":[0.005488684,0.0050366665,0.04223963,0.25182378,0.0023251195,0.00087299605,0.000689021,0.15418752,0.020175898,0.2713326,0.23618637,0.009641719],"about_ca_topic_score_codex":0.00033663996,"about_ca_topic_score_gemma":0.000018200679,"teacher_disagreement_score":0.7513694,"about_ca_system_score_codex":0.000061303275,"about_ca_system_score_gemma":0.00017463836,"threshold_uncertainty_score":0.8750077},"labels":[],"label_agreement":null},{"id":"W6948606606","doi":"10.5281/zenodo.11510179","title":"Superficial White Matter","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Geodesic; Laplace operator; White matter; Laplace transform; Image warping; Diagonal; Surface (topology)","score_opus":0.02343489851392765,"score_gpt":0.23810543640406898,"score_spread":0.21467053789014132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948606606","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013267014,0.00027297248,0.048824985,0.0043568835,0.00056879217,0.0004376662,0.00017861612,0.008661887,0.9366849],"genre_scores_gemma":[0.0024110188,0.0000755976,0.0085041905,0.0009554372,0.00084258453,1.522797e-7,0.0005243277,0.014952467,0.9717342],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767715,0.00014236794,0.00022807928,0.0008973601,0.0005137831,0.00054124626],"domain_scores_gemma":[0.9982461,0.000007843156,0.00007714327,0.0013378387,0.00016816208,0.00016291859],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000365165,0.00028010068,0.0002393703,0.0008974926,0.00045213755,0.0020093506,0.00444545,0.00022783408,0.028287034],"category_scores_gemma":[0.00012911284,0.00028834655,0.00007298972,0.0012394626,0.000120367484,0.00015343609,0.0061511244,0.00052137475,0.28116733],"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.0000028914715,0.000024779882,0.0000010328423,0.00006022255,0.000035175257,0.00004056663,0.00027575679,0.0000054057045,0.000042856333,0.008427981,0.9575027,0.0335806],"study_design_scores_gemma":[0.000087770306,0.0000878996,0.000035067318,0.00012443053,0.0000097932225,0.00007884451,0.000027534183,0.00015027139,0.000025256302,0.00072297046,0.998335,0.0003151604],"about_ca_topic_score_codex":0.000015469912,"about_ca_topic_score_gemma":0.0000011904616,"teacher_disagreement_score":0.25288028,"about_ca_system_score_codex":0.0001381131,"about_ca_system_score_gemma":0.000004541669,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W6948790295","doi":"10.5061/dryad.70rxwdc10","title":"Data from: Interannual consistency of migration phenology is season- and breeding region-specific in North American Golden Eagles","year":2022,"lang":"en","type":"dataset","venue":"Open MIND","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Moncton","funders":"","keywords":"Population; Consistency (knowledge bases); Boreal; Schedule; Time lag","score_opus":0.09024994640125097,"score_gpt":0.3116340111734034,"score_spread":0.22138406477215242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948790295","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044015653,0.00054499815,0.00050337246,0.0025058023,0.00034452698,0.0005588478,0.9514539,0.000011381656,0.00006147258],"genre_scores_gemma":[0.005894144,0.0012134257,0.036516774,0.00025394533,0.00008618922,0.000068033165,0.95584834,0.00002026099,0.00009886837],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973604,0.00013911273,0.0005301953,0.001328965,0.0003199126,0.00032140838],"domain_scores_gemma":[0.9963637,0.00029017194,0.00050025264,0.0027101787,0.00006585678,0.00006983093],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0003133523,0.00029051496,0.0006747122,0.00040343747,0.00008743988,0.0003125257,0.0082683535,0.00012080452,0.00055823533],"category_scores_gemma":[0.00013167367,0.00030783177,0.000030163514,0.0011484511,0.00031700375,0.0006151336,0.012220361,0.00051283377,0.000040761224],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002205428,0.000044417226,0.0018812402,0.000005777348,0.00003691632,0.00007817657,0.0005137145,0.000003965119,0.0000052158043,0.000006146713,0.8650592,0.13234319],"study_design_scores_gemma":[0.0002296331,0.00021854251,0.0028499262,0.00006952292,0.000020108433,0.00002408616,0.0006442788,0.00042160178,0.000015536538,0.00003494536,0.99514824,0.00032359097],"about_ca_topic_score_codex":0.0037065852,"about_ca_topic_score_gemma":0.05807285,"teacher_disagreement_score":0.1320196,"about_ca_system_score_codex":0.00008720041,"about_ca_system_score_gemma":0.00014502878,"threshold_uncertainty_score":0.99993736},"labels":[],"label_agreement":null},{"id":"W6949037491","doi":"10.5281/zenodo.1249549","title":"Tribler/tribler v7.1.0-exp2","year":2018,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Association for Co-operative Education","funders":"","keywords":"BitTorrent; Information privacy; Relation (database); Selection (genetic algorithm); The Internet","score_opus":0.03459384910446153,"score_gpt":0.24871487539993417,"score_spread":0.21412102629547264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949037491","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017371538,0.00020205152,0.11522331,0.0017835319,0.00049489987,0.00068968325,0.00013284259,0.010004682,0.8714516],"genre_scores_gemma":[0.0017446297,0.0004217474,0.029724589,0.0008083604,0.0014241198,3.7132972e-7,0.0012484649,0.01567395,0.94895375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966493,0.0002742233,0.00034056045,0.0011343391,0.0007847906,0.00081673905],"domain_scores_gemma":[0.9967736,0.000026729505,0.00023412214,0.0021820865,0.00049214775,0.0002913053],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00075047323,0.000387797,0.00036780015,0.001268375,0.0010890642,0.0016454195,0.007247761,0.00035206045,0.025350204],"category_scores_gemma":[0.0006658706,0.0004035031,0.00009523795,0.0022497694,0.00026225625,0.0002546341,0.006901586,0.00046386823,0.11589024],"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.000007631175,0.000053511478,4.250382e-7,0.000031922977,0.000047845984,0.000021854848,0.00013144345,0.0000048322886,0.00011681413,0.007247506,0.8924981,0.09983816],"study_design_scores_gemma":[0.00030411308,0.00027363826,0.000021119387,0.00012208532,0.0000104157525,0.00006649519,0.000023809376,0.00028842,0.00020310224,0.0005014487,0.9977395,0.0004458353],"about_ca_topic_score_codex":0.000024389541,"about_ca_topic_score_gemma":0.0000015863341,"teacher_disagreement_score":0.10524146,"about_ca_system_score_codex":0.00021619776,"about_ca_system_score_gemma":0.000011103095,"threshold_uncertainty_score":0.9998417},"labels":[],"label_agreement":null},{"id":"W6986175136","doi":"","title":"Overlay Neighborhoods for Distributed Publish/Subscribe Systems","year":2012,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Exploit; Middleware (distributed applications); Overlay network; Flexibility (engineering); Overlay; Asynchronous communication; Multicast; Reliability (semiconductor)","score_opus":0.004822955646658305,"score_gpt":0.16106149104642214,"score_spread":0.15623853539976384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986175136","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048894923,0.01582074,0.13313663,0.04301673,0.028258454,0.007411335,0.014014863,0.0012404525,0.7082059],"genre_scores_gemma":[0.9698025,0.00007779507,0.006412218,0.00058747403,0.00023202068,0.00017707287,0.0005653887,0.000058350488,0.022087188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99618214,0.000048011945,0.0004936563,0.0005555,0.0020222955,0.00069838966],"domain_scores_gemma":[0.9981386,0.00035767272,0.00039598224,0.0006910865,0.0000034484963,0.00041318193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00002754663,0.00041180258,0.00054130354,0.000075145756,0.00021489267,0.00020936267,0.00156034,0.00013508096,0.0000048979036],"category_scores_gemma":[0.000020366055,0.00040761154,0.00006239837,0.0002836877,0.000032535314,0.0010565872,0.00033258167,0.00026355378,4.8045194e-9],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003407748,0.0000618622,0.0033903988,0.0010141081,0.00029897311,0.00004675101,0.00019364631,0.0002571426,0.0034372169,0.8604429,0.094970904,0.035545357],"study_design_scores_gemma":[0.001215201,0.00040790427,0.118853495,0.001145228,0.00016490735,0.000023838535,0.00526269,0.02402575,0.057062026,0.008247985,0.7809697,0.0026213082],"about_ca_topic_score_codex":0.0023478998,"about_ca_topic_score_gemma":0.025283484,"teacher_disagreement_score":0.92090756,"about_ca_system_score_codex":0.000026870135,"about_ca_system_score_gemma":0.002123453,"threshold_uncertainty_score":0.9998376},"labels":[],"label_agreement":null},{"id":"W7018622200","doi":"","title":"A distributed server architecture for massively multiplayer online games /","year":2006,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scalability; Architecture; Server; Client–server model; Popularity; Server farm; Application server","score_opus":0.015525666456572343,"score_gpt":0.2472945115570292,"score_spread":0.23176884510045687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018622200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95958924,0.0005764128,0.0021863065,0.00093524146,0.0036745023,0.0042307065,0.01991849,0.005071403,0.0038176654],"genre_scores_gemma":[0.75674105,0.000056908564,0.20890422,0.0011550558,0.0002598393,0.0014373672,0.015483594,0.0004878323,0.015474109],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99322724,0.0002062314,0.0012185305,0.0024707005,0.0012226127,0.0016546563],"domain_scores_gemma":[0.99493116,0.000563812,0.0008360545,0.002316984,0.0009331657,0.00041884108],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0005972805,0.0014107954,0.0012559707,0.0009160605,0.0010201033,0.00037448865,0.004668385,0.0015860102,0.000016578733],"category_scores_gemma":[0.0014335082,0.0014147928,0.00069847563,0.001857586,0.00007684638,0.00083714357,0.0008526993,0.0021717136,0.000121706165],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005146888,0.001033211,0.000078821795,0.0008177162,0.0006658877,0.0003226104,0.000027918657,0.005641851,0.027323022,0.11658402,0.0018403272,0.84514993],"study_design_scores_gemma":[0.0035963694,0.00086089276,0.010301515,0.0014074394,0.00035348788,0.00010221023,0.00017703735,0.0028669622,0.10563802,0.13666007,0.7328231,0.0052129147],"about_ca_topic_score_codex":0.00022789917,"about_ca_topic_score_gemma":0.0053500426,"teacher_disagreement_score":0.83993703,"about_ca_system_score_codex":0.0008000196,"about_ca_system_score_gemma":0.000114340466,"threshold_uncertainty_score":0.9998642},"labels":[],"label_agreement":null},{"id":"W7019982799","doi":"","title":"Interest management for massively multiplayer games","year":2007,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Massively parallel; Scalability; Popularity; State (computer science); Scale (ratio); Relevance (law)","score_opus":0.030385006602222535,"score_gpt":0.2849249996925689,"score_spread":0.25453999309034636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019982799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997058,0.00085426937,0.0032828879,0.0006297961,0.014352066,0.009079488,0.0016003994,0.007979543,0.16251576],"genre_scores_gemma":[0.7384559,0.000163307,0.22418886,0.0011533936,0.00011687771,0.0013492208,0.0005533911,0.0003197529,0.03369927],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9938808,0.000113078706,0.0011443704,0.002296476,0.0010002945,0.001564951],"domain_scores_gemma":[0.9956633,0.0004262272,0.0006777246,0.0022102518,0.00060777966,0.0004147061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012079674,0.0011432782,0.0009268889,0.0014940075,0.0008945924,0.00038418267,0.005104592,0.001102706,0.00002237888],"category_scores_gemma":[0.0006318108,0.0012079561,0.0005186846,0.001407859,0.00006421818,0.001036473,0.0012436496,0.0014204419,0.0005535928],"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.00012683305,0.00013783536,0.000005281635,0.00027699297,0.00026018717,0.00016339103,0.00000973502,0.000056808647,0.0033425102,0.3896776,0.0002677025,0.6056751],"study_design_scores_gemma":[0.0020752752,0.0006189174,0.002046038,0.001439905,0.00024996328,0.000044822547,0.000527774,0.0008617064,0.13281937,0.087543145,0.7684201,0.003352994],"about_ca_topic_score_codex":0.000042294745,"about_ca_topic_score_gemma":0.0009943396,"teacher_disagreement_score":0.76815236,"about_ca_system_score_codex":0.00093073986,"about_ca_system_score_gemma":0.00003717072,"threshold_uncertainty_score":0.999037},"labels":[],"label_agreement":null},{"id":"W7097341440","doi":"","title":"Strategies of Conflict in Coexisting Streaming Overlays,” http://iqua.ece.toronto.edu/papers/stratconflict.pdf","year":2006,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Upload; Overlay; Bandwidth (computing); Overlay network; Live streaming; Network topology; Peer-to-peer; Downstream (manufacturing)","score_opus":0.014352129973029095,"score_gpt":0.2567050936087933,"score_spread":0.2423529636357642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097341440","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4047513,0.0006049645,0.055396482,0.0019006839,0.00041576513,0.0006219892,0.000008987251,0.0016526245,0.5346472],"genre_scores_gemma":[0.9507321,0.000018752471,0.046342995,0.00017061066,0.000068619825,0.00002856176,0.0000059759755,0.00002004226,0.0026123542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997137,0.000059547612,0.0007695496,0.00073654467,0.0005190499,0.00077831896],"domain_scores_gemma":[0.9982836,0.00027206095,0.000240709,0.0009822476,0.00012910487,0.00009223141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043559482,0.00037526735,0.0005071758,0.0002113885,0.00009558025,0.00029987274,0.001712589,0.00022652591,0.00011052937],"category_scores_gemma":[0.00006878871,0.00036340905,0.00010362293,0.0007324045,0.00015624234,0.0010205378,0.00050447043,0.00027208703,0.00004530607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015177136,0.00018457577,0.0068772594,0.000053184503,0.000033882374,0.00008198685,0.0008807766,0.005251804,0.026880816,0.9331384,0.0035614872,0.023040708],"study_design_scores_gemma":[0.0069285985,0.0027098623,0.34975153,0.0009899904,0.00009012526,0.00024829886,0.0337706,0.2139326,0.13964456,0.03140119,0.2143722,0.006160442],"about_ca_topic_score_codex":0.009395954,"about_ca_topic_score_gemma":0.012614889,"teacher_disagreement_score":0.90173715,"about_ca_system_score_codex":0.0002224727,"about_ca_system_score_gemma":0.000173401,"threshold_uncertainty_score":0.9998818},"labels":[],"label_agreement":null},{"id":"W7100390296","doi":"","title":"Postina: A Publish/Subscribe Middleware Designed for Massively Multiplayer Games","year":2008,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Middleware (distributed applications); Interface (matter); Massively parallel; Multicast; State (computer science); Layer (electronics); Application layer","score_opus":0.046306146891464346,"score_gpt":0.24587193136442764,"score_spread":0.1995657844729633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100390296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038824044,0.0001353348,0.9427245,0.012192917,0.00037259544,0.00079908693,0.00001071079,0.0026106804,0.0023300848],"genre_scores_gemma":[0.41309384,0.0000063425414,0.5811318,0.0012581998,0.000045318542,0.00019636811,0.0000041773305,0.000018908178,0.0042450633],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775594,0.000033315584,0.00031223122,0.0007593753,0.0003805868,0.0007585603],"domain_scores_gemma":[0.99799246,0.00033387443,0.00009637642,0.0009949818,0.00039964844,0.00018264023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023744997,0.00027928708,0.0002954885,0.00030984957,0.0002895206,0.0002555099,0.0023879174,0.00017492927,0.000017449209],"category_scores_gemma":[0.0008042848,0.00024046024,0.0001281355,0.0009111015,0.000098363846,0.0009806465,0.0007375916,0.00015141613,0.00012495689],"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.000085324915,0.0002669255,0.00579226,0.00003621229,0.00009138937,0.0002390386,0.00170062,0.00049907394,0.007878744,0.050159775,0.85666144,0.076589204],"study_design_scores_gemma":[0.008428678,0.0035849942,0.086492404,0.00027306064,0.00007108331,0.0014020551,0.0011495249,0.22745694,0.20774586,0.035011988,0.42269853,0.0056848936],"about_ca_topic_score_codex":0.00004306824,"about_ca_topic_score_gemma":0.00003864282,"teacher_disagreement_score":0.4339629,"about_ca_system_score_codex":0.00008750744,"about_ca_system_score_gemma":0.00013090641,"threshold_uncertainty_score":0.9805684},"labels":[],"label_agreement":null},{"id":"W7100856643","doi":"","title":"Diagnosing Network-wide P2P Live Streaming Inefficiencies,” http://cairo.csl.toronto.edu/papers/diagnose.pdf","year":2009,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Live streaming; Real Time Streaming Protocol; Population; Bandwidth (computing); Terabyte; Quality (philosophy); Streaming data; Streaming algorithm","score_opus":0.009226190101033337,"score_gpt":0.22962717348714914,"score_spread":0.2204009833861158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100856643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29727086,0.0056021544,0.4709395,0.03787041,0.0041517243,0.0024300928,0.000008101564,0.012483678,0.16924348],"genre_scores_gemma":[0.87762046,0.00027551784,0.112057656,0.0074011767,0.0004422212,0.00005270625,0.000006447843,0.000034167057,0.002109658],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952234,0.00010300063,0.00068657764,0.0013586476,0.0008630736,0.0017652992],"domain_scores_gemma":[0.9963083,0.0010886057,0.00021995096,0.0018282377,0.0001767944,0.00037806632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000661157,0.0006241577,0.0006050645,0.00018870301,0.0005467771,0.00066697586,0.0034792917,0.00030464077,0.00021321705],"category_scores_gemma":[0.00070007873,0.0005792319,0.00020007625,0.0013666752,0.00014896817,0.0012465247,0.0012114127,0.0004771246,0.0006125493],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018972783,0.00053024455,0.010173801,0.000015223469,0.00007062385,0.00039946346,0.0022485766,0.030774608,0.0008280716,0.09191499,0.14082348,0.72220194],"study_design_scores_gemma":[0.003212932,0.005566994,0.3008668,0.0012699268,0.00016124427,0.00033811285,0.004026343,0.29062656,0.01013929,0.0153715415,0.36073506,0.0076851943],"about_ca_topic_score_codex":0.00052451686,"about_ca_topic_score_gemma":0.0016595159,"teacher_disagreement_score":0.71451676,"about_ca_system_score_codex":0.0005860448,"about_ca_system_score_gemma":0.00015574838,"threshold_uncertainty_score":0.9996659},"labels":[],"label_agreement":null},{"id":"W7124164311","doi":"10.65109/etbf8642","title":"Social distance games","year":2011,"lang":"","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closeness; Context (archaeology); Social distance; Measure (data warehouse); Stability (learning theory); Graph; Welfare","score_opus":0.05356203370962737,"score_gpt":0.2635601401702703,"score_spread":0.20999810646064293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124164311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066148536,0.00043775918,0.8343995,0.008806353,0.0012233001,0.00031196847,0.0000045815646,0.0015719411,0.14662972],"genre_scores_gemma":[0.87459934,0.000033055952,0.11225331,0.0010597042,0.00020909462,0.000029421642,3.837239e-7,0.00002027974,0.011795425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99686706,0.00006230822,0.0004600919,0.0010111242,0.0005350148,0.0010644052],"domain_scores_gemma":[0.9982145,0.000046452322,0.00014545844,0.0012368591,0.0001713372,0.00018543734],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003405148,0.00038366555,0.00039119483,0.00018639975,0.00036129417,0.00027596173,0.0039186585,0.00027361655,0.00040084217],"category_scores_gemma":[0.00008860491,0.00037119785,0.00015670095,0.001502401,0.00041111928,0.00061032246,0.0021292411,0.000365448,0.0014831489],"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.0000164427,0.00012625176,0.0010438996,0.00001121933,0.000032481657,0.0000485639,0.005085268,0.0000024956475,0.000038686303,0.5170627,0.09097227,0.3855597],"study_design_scores_gemma":[0.0012587124,0.0013414692,0.09154701,0.0001945614,0.00008498395,0.000059829534,0.001342609,0.035274424,0.02200141,0.30211464,0.5407071,0.004073239],"about_ca_topic_score_codex":0.000082413295,"about_ca_topic_score_gemma":0.00012106244,"teacher_disagreement_score":0.8679845,"about_ca_system_score_codex":0.000109194814,"about_ca_system_score_gemma":0.00011152398,"threshold_uncertainty_score":0.999874},"labels":[],"label_agreement":null},{"id":"W7132878144","doi":"","title":"Large scale distributed storage and search for a Video on Demand streaming system","year":2007,"lang":"","type":"dissertation","venue":"TSpace","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Scalability; Exploit; Video on demand; Service provider; Quality of service; Video streaming; Service (business)","score_opus":0.02088070719118323,"score_gpt":0.3360901722175113,"score_spread":0.3152094650263281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132878144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46602762,0.0007884105,0.5290497,0.00043659046,0.00076155236,0.0017234504,0.00019561376,0.00059913,0.00041795886],"genre_scores_gemma":[0.97750694,0.000034300312,0.017991101,0.000094251125,0.0002330858,0.00023368519,0.00042703393,0.00009205996,0.0033875466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945097,0.00014925603,0.0006802774,0.0018807508,0.0010470229,0.0017330188],"domain_scores_gemma":[0.99623185,0.00086003257,0.000406612,0.0014917469,0.00057329773,0.0004364588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020473774,0.0008360482,0.0009794196,0.00079627475,0.0009125986,0.0006919576,0.0016794798,0.0007736948,0.0000074900686],"category_scores_gemma":[0.0002541353,0.00088196306,0.0001907578,0.0016376612,0.00010980344,0.00026495385,0.0006292909,0.0008772545,0.00005266654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007742992,0.0035318236,0.00844201,0.030582938,0.0023919283,0.0024914674,0.30632445,0.030483663,0.016254995,0.14344561,0.042978488,0.4053296],"study_design_scores_gemma":[0.0051814457,0.0038497802,0.014821497,0.01014481,0.0004086237,0.00014641296,0.14102258,0.7513272,0.047203142,0.00022722366,0.021442119,0.004225129],"about_ca_topic_score_codex":0.00012350772,"about_ca_topic_score_gemma":0.00048555067,"teacher_disagreement_score":0.72084355,"about_ca_system_score_codex":0.0006389063,"about_ca_system_score_gemma":0.00023650861,"threshold_uncertainty_score":0.9993631},"labels":[],"label_agreement":null},{"id":"W7162456164","doi":"10.32628/cseit25113497","title":"Developing Resilient Multiplayer Matching Engines Using Predictive Algorithms for Load Balancing and Retry Optimization","year":2024,"lang":"","type":"article","venue":"International Journal of Scientific Research in Computer Science Engineering and Information Technology","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"JDA Software (Canada)","funders":"","keywords":"Load balancing (electrical power); Leverage (statistics); Matching (statistics); Fault tolerance; Key (lock); Resource allocation; Queue; Shared resource; Throughput","score_opus":0.03515074970834574,"score_gpt":0.33673215483392566,"score_spread":0.3015814051255799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162456164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13440263,0.0007507036,0.8514346,0.005976213,0.006924025,0.00037120862,0.00001095774,0.0001259845,0.000003698527],"genre_scores_gemma":[0.4996394,0.0001811679,0.49997738,0.00002155211,0.00015669987,0.000010822387,0.0000012490374,0.000007752066,0.000004010539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953488,0.000038212103,0.0011256327,0.00061261724,0.0021034153,0.00077128183],"domain_scores_gemma":[0.99516493,0.00042354278,0.00024083647,0.00032035453,0.0036708985,0.00017941522],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009797331,0.00024356833,0.00030293994,0.010938422,0.00044809704,0.004501029,0.002294999,0.00021971432,8.202187e-7],"category_scores_gemma":[0.0012386476,0.0002359755,0.00005090039,0.0058421637,0.00082891673,0.008378972,0.0019878126,0.0009215054,0.000002184342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017365403,0.0000128848615,0.00010849279,0.00010098541,0.000032762473,0.0000265185,0.0017107266,0.7485076,0.0009830007,0.0111774625,0.0000610879,0.23726107],"study_design_scores_gemma":[0.0003362716,0.00021602784,0.0001930382,0.0021374603,0.0000041599633,0.0004873306,0.00023439445,0.9897258,0.0022743852,0.002265909,0.0019052057,0.00021998816],"about_ca_topic_score_codex":0.000010374193,"about_ca_topic_score_gemma":0.000001357914,"teacher_disagreement_score":0.36523676,"about_ca_system_score_codex":0.0015162878,"about_ca_system_score_gemma":0.001447097,"threshold_uncertainty_score":0.9965324},"labels":[],"label_agreement":null},{"id":"W75044610","doi":"10.1007/978-3-642-35170-9_13","title":"Opportunistic Multipath Forwarding in Content-Based Publish/Subscribe Overlays","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"University of Toronto","funders":"","keywords":"Computer science; PlanetLab; Computer network; Overlay network; Overlay; Distributed computing; Bandwidth (computing); Publication; Overhead (engineering); Testbed; Baseline (sea); The Internet; Operating system","score_opus":0.05884706481855442,"score_gpt":0.2548629123556807,"score_spread":0.19601584753712628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75044610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003182447,0.00054295175,0.9906382,0.0025279354,0.0027796712,0.0007997113,0.000017904445,0.0006823027,0.0016930831],"genre_scores_gemma":[0.45145702,0.000023133472,0.5445048,0.003286945,0.00035770715,0.000051678668,0.000015702228,0.00006540498,0.00023756013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934773,0.00005561756,0.0009191713,0.0022036158,0.0015680538,0.001776274],"domain_scores_gemma":[0.99529946,0.0008281048,0.0004235511,0.0026353695,0.0003662031,0.00044732034],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020319207,0.0008811311,0.0009844711,0.0026154306,0.00023517797,0.0010835114,0.007405971,0.0006540128,0.000018370469],"category_scores_gemma":[0.00070875644,0.0008465304,0.0002040817,0.0017058514,0.00072614016,0.001483988,0.0032130287,0.0015180589,0.000072112794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012370465,0.00007890635,0.0012884014,0.00005250287,0.000013794057,0.00034002354,0.0004577842,0.021219432,0.00047855524,0.03541169,0.00018838295,0.9404582],"study_design_scores_gemma":[0.0013055049,0.00043554636,0.001846373,0.0016710194,0.000024644438,0.00011777979,0.0000021138671,0.92045605,0.0028372786,0.059031148,0.009435656,0.0028368856],"about_ca_topic_score_codex":0.00008615418,"about_ca_topic_score_gemma":0.00028784247,"teacher_disagreement_score":0.9376213,"about_ca_system_score_codex":0.00096324924,"about_ca_system_score_gemma":0.00080955564,"threshold_uncertainty_score":0.99995345},"labels":[],"label_agreement":null},{"id":"W75293394","doi":"10.1007/978-3-642-28509-7_20","title":"Selective Propagation of Social Data in Decentralized Online Social Network","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","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":"University of Saskatchewan","funders":"","keywords":"Scalability; Computer science; Convergence (economics); Distributed computing; Order (exchange); Filter (signal processing); Social network (sociolinguistics); Architecture; Construct (python library); Decentralised system; Control (management); Social media; World Wide Web; Computer network; Artificial intelligence; Database; Business","score_opus":0.0335435268894795,"score_gpt":0.28806701288321307,"score_spread":0.2545234859937336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75293394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006760069,0.00043444207,0.99413395,0.0024184014,0.0010427181,0.00070337584,0.00003517331,0.00024738847,0.0003085674],"genre_scores_gemma":[0.4342967,0.000042392945,0.5633625,0.0007757348,0.0013326167,0.000014748945,0.00008047553,0.00004508632,0.000049768143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99535954,0.00008349404,0.0007565467,0.0015402193,0.001148588,0.0011115872],"domain_scores_gemma":[0.9973239,0.00031519064,0.0005290548,0.001429696,0.00030380662,0.00009837254],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014993639,0.00050702237,0.000796812,0.0008017353,0.00024261238,0.00018491047,0.0072139543,0.0005515922,0.0000064711726],"category_scores_gemma":[0.00020603136,0.00049986306,0.00008566166,0.0021589317,0.00071114016,0.0008351469,0.00492757,0.0010673413,0.000010594721],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027514021,0.000106275285,0.0005343475,0.000044156663,0.00002331381,0.00001897422,0.0020831751,0.010814557,0.00014529366,0.027218776,0.0004289502,0.9585547],"study_design_scores_gemma":[0.0015763824,0.000427343,0.02384556,0.0008868308,0.000049509108,0.000047494508,0.0000021508577,0.60733634,0.0015485844,0.35277146,0.008867256,0.0026410592],"about_ca_topic_score_codex":0.000036879646,"about_ca_topic_score_gemma":0.00081888575,"teacher_disagreement_score":0.9559136,"about_ca_system_score_codex":0.00050708966,"about_ca_system_score_gemma":0.00064235064,"threshold_uncertainty_score":0.9997453},"labels":[],"label_agreement":null},{"id":"W75423781","doi":"","title":"Broadcasting in Hierarchical Tree Cluster Network.","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques 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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Cluster (spacecraft); Tree (set theory); Computer network; Mathematics","score_opus":0.011236856114837518,"score_gpt":0.26429368911717793,"score_spread":0.2530568330023404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75423781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068602017,0.00034491598,0.98519325,0.005221012,0.000012005658,0.0004013275,0.0000086326,0.00089034636,0.0010682801],"genre_scores_gemma":[0.56757045,0.000051408086,0.43151644,0.00018415468,0.00008692225,0.0005402233,0.000017791466,0.000007073547,0.00002556566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988755,0.000014684288,0.00023163343,0.00044128185,0.00010167629,0.00033522496],"domain_scores_gemma":[0.99937564,0.000068629735,0.00006633264,0.0003282539,0.000048771813,0.000112382535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025120887,0.00014927721,0.00016294396,0.00009141461,0.00026201596,0.0002467787,0.00048301052,0.00014371648,7.5243554e-7],"category_scores_gemma":[0.00002767584,0.0001360637,0.000017116714,0.00068400084,0.00013046413,0.00019998985,0.00049525464,0.00038781267,0.0000015544152],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006346316,0.000045814108,0.0027177737,0.000023226512,0.0000021352485,0.0000032668884,0.0000571429,0.00008289614,0.00031790507,0.052286558,0.0012256437,0.9432313],"study_design_scores_gemma":[0.00073459005,0.00014194769,0.015944814,0.0002039323,0.000017415354,0.00030649581,0.00005072795,0.18266909,0.0007476742,0.40143055,0.39670846,0.0010443161],"about_ca_topic_score_codex":0.0000148053105,"about_ca_topic_score_gemma":0.000051941624,"teacher_disagreement_score":0.94218695,"about_ca_system_score_codex":0.000011171286,"about_ca_system_score_gemma":0.000029982948,"threshold_uncertainty_score":0.55485165},"labels":[],"label_agreement":null},{"id":"W75725614","doi":"","title":"TR-2007-18:Optimizing Acquaintance Selection in a PDMS","year":2007,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Selection (genetic algorithm); Scheme (mathematics); Information retrieval; Quality (philosophy); Peer-to-peer; World Wide Web; Artificial intelligence","score_opus":0.01862127707728078,"score_gpt":0.27091646730289054,"score_spread":0.25229519022560976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75725614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04294531,0.000059129492,0.9332029,0.0016794418,0.0002722002,0.0001674925,1.1556247e-7,0.0012520079,0.020421376],"genre_scores_gemma":[0.5531387,0.000006506076,0.44505957,0.00070121954,0.000056019573,0.000010619632,1.9380961e-7,0.000007255503,0.0010199064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984521,0.000019725572,0.00026207906,0.0004448092,0.00024673284,0.00057455304],"domain_scores_gemma":[0.9993625,0.00010320253,0.000049603266,0.00035503553,0.000056095905,0.000073550975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078746764,0.00013976468,0.00015072088,0.00038213524,0.000065748674,0.000098759054,0.000954153,0.00011476144,0.000029176643],"category_scores_gemma":[0.00009402832,0.00013575736,0.000033763998,0.0018720013,0.00002747951,0.00041359736,0.0002987456,0.00022221553,0.00012600826],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006451397,0.0002743814,0.018850273,0.000020401641,0.00003035735,0.00022679596,0.0018779783,0.019757235,0.016329825,0.18319999,0.06173642,0.69763184],"study_design_scores_gemma":[0.0023379647,0.00095925905,0.109527655,0.00027069586,0.000010849025,0.0003227877,0.00081704685,0.5974922,0.14370432,0.047159705,0.094785005,0.0026124732],"about_ca_topic_score_codex":0.00009187799,"about_ca_topic_score_gemma":0.0006603919,"teacher_disagreement_score":0.69501936,"about_ca_system_score_codex":0.00021627182,"about_ca_system_score_gemma":0.000033167704,"threshold_uncertainty_score":0.55360246},"labels":[],"label_agreement":null},{"id":"W79646937","doi":"10.1007/978-3-540-24629-9_11","title":"Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":102,"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 Toronto","funders":"","keywords":"Computer science; Distributed hash table; Scalability; Hash table; Distributed computing; Hash function; Peer-to-peer; Publication; Computer network; Pastry; Database; Computer security","score_opus":0.02582257333802171,"score_gpt":0.22736494624039938,"score_spread":0.20154237290237767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W79646937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002459324,0.0006789394,0.9902969,0.0037873075,0.00219953,0.0010293118,0.000059123005,0.0013253737,0.00037757648],"genre_scores_gemma":[0.2808291,0.000007911458,0.7172641,0.0013100641,0.00030190585,0.000063181455,0.00003156682,0.00007055852,0.00012160453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929035,0.000042618107,0.0007946534,0.0026668885,0.00202675,0.0015656269],"domain_scores_gemma":[0.9949068,0.00049804687,0.00051425636,0.0028729194,0.00082507863,0.00038292524],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011023523,0.0010149758,0.0010512123,0.0016403155,0.00043717743,0.0032002763,0.008631871,0.0006017196,0.0000071360237],"category_scores_gemma":[0.00028394657,0.0008427739,0.00014330636,0.0024141278,0.001168978,0.0012962759,0.0022662173,0.0013109522,0.000027539849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021462105,0.00006286162,0.00021232935,0.00011108701,0.00004245673,0.00048165204,0.00013403015,0.7251605,0.00032937923,0.13827999,0.00026452247,0.13489977],"study_design_scores_gemma":[0.0022209517,0.0013874074,0.0003329563,0.006706687,0.000054947435,0.00039583197,0.0000022849563,0.8580972,0.008540236,0.106521994,0.011572246,0.0041672327],"about_ca_topic_score_codex":0.00022196006,"about_ca_topic_score_gemma":0.00021622893,"teacher_disagreement_score":0.28058317,"about_ca_system_score_codex":0.0012910314,"about_ca_system_score_gemma":0.0015003381,"threshold_uncertainty_score":0.9994023},"labels":[],"label_agreement":null},{"id":"W82584247","doi":"10.1007/978-3-319-00615-4_19","title":"Publish/Subscribe System Based on Event Calculus to Support Real-Time Multi-Agent Evacuation Simulation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in geoinformation and cartography","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 Calgary","funders":"","keywords":"Computer science; Event calculus; Event (particle physics); Middleware (distributed applications); Publication; Service (business); Process (computing); Variety (cybernetics); Distributed computing; Wireless sensor network; Complex event processing; Real-time computing; Computer network; Artificial intelligence","score_opus":0.0139498210988291,"score_gpt":0.23911974195535715,"score_spread":0.22516992085652804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82584247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000541365,0.00003469964,0.97173077,0.0014453983,0.00047887853,0.0019073285,0.000034787805,0.00089708477,0.022929711],"genre_scores_gemma":[0.94001377,0.000024323823,0.053732775,0.0032110824,0.00014286653,0.00023934053,0.0006164788,0.0000709561,0.0019483826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729335,0.000043763484,0.000795694,0.0005894946,0.00082824245,0.00044944105],"domain_scores_gemma":[0.99791,0.00019395028,0.00035758884,0.0009502826,0.0003705184,0.00021761806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053743727,0.00052237185,0.000467654,0.0020544669,0.00014361639,0.0005021275,0.00065078266,0.00057996553,0.000054054657],"category_scores_gemma":[0.00013263564,0.0004853624,0.00019131645,0.0006345235,0.00003909508,0.0007185451,0.00022840592,0.00040606357,0.00039240048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003185671,0.000031813972,0.00011718632,0.00017448672,0.000039508694,0.0000072202993,0.0014413805,0.71392524,0.000027431539,0.010462555,0.0028959902,0.2708453],"study_design_scores_gemma":[0.0005099699,0.0003295905,0.0008070635,0.00036397175,0.00002319791,0.000003896963,0.000012032727,0.97665477,0.00012579864,0.00065067294,0.019898098,0.00062093313],"about_ca_topic_score_codex":0.000053096584,"about_ca_topic_score_gemma":0.00008751799,"teacher_disagreement_score":0.93947244,"about_ca_system_score_codex":0.0002768897,"about_ca_system_score_gemma":0.000080605634,"threshold_uncertainty_score":0.9997598},"labels":[],"label_agreement":null},{"id":"W93250494","doi":"10.1002/9781118256107.ch9","title":"Peer‐to‐Peer Network Architecture","year":2007,"lang":"en","type":"other","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Architecture; Peer-to-peer; Computer science; Computer architecture; Computer network; Geography","score_opus":0.01269283117157541,"score_gpt":0.2560809915930828,"score_spread":0.24338816042150738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W93250494","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.83694e-7,0.00022026933,0.48532438,0.017693795,0.001227322,0.00037852515,0.0000057094444,0.0039303973,0.4912187],"genre_scores_gemma":[0.000028077646,0.000005034636,0.4002625,0.0042165774,0.0010781855,0.000027879034,0.000007929398,0.00022028368,0.5941535],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99547094,0.000040199477,0.0003329921,0.0012345492,0.0016127479,0.001308553],"domain_scores_gemma":[0.99654317,0.00011004819,0.00013628088,0.0026445189,0.00020971573,0.00035625522],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008046232,0.00063351105,0.0005862123,0.0012312839,0.00008141446,0.00027132645,0.0051003117,0.0008465508,0.0007766805],"category_scores_gemma":[0.00023910879,0.0005376462,0.00015367586,0.0025293257,0.00007338565,0.000052142706,0.0022998308,0.00081734324,0.0039418433],"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.0000022887325,0.000012227246,0.000021221127,0.0000074596433,0.0000372473,0.000054371783,0.00005971806,0.0010572752,0.0000019821662,0.0204988,0.85534084,0.12290654],"study_design_scores_gemma":[0.00009416252,0.00008576905,0.000052526317,0.000120044344,0.000007684758,0.000024876246,0.0000053696263,0.00023457738,0.000035641566,0.0041581644,0.9944787,0.0007024627],"about_ca_topic_score_codex":0.00012885674,"about_ca_topic_score_gemma":0.00072485197,"teacher_disagreement_score":0.13913785,"about_ca_system_score_codex":0.00009012648,"about_ca_system_score_gemma":0.00007983643,"threshold_uncertainty_score":0.9997075},"labels":[],"label_agreement":null},{"id":"W95507361","doi":"","title":"Taxonomy-Based Routing Indices for Peer-to-Peer Networks.","year":2004,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Robustness (evolution); File sharing; Peer-to-peer; Limiting; Web query classification; Information retrieval; Taxonomy (biology); Key (lock); Web search query; Data mining; Computer network; World Wide Web; The Internet; Search engine; Computer security","score_opus":0.03397383491556725,"score_gpt":0.263387912553525,"score_spread":0.22941407763795776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W95507361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007079141,0.00003118466,0.94032776,0.04636249,0.00064144994,0.0011973823,0.0000053545514,0.0020629168,0.0022923383],"genre_scores_gemma":[0.49852845,3.4197365e-7,0.4961344,0.0038534382,0.00015517323,0.0003867433,0.000006216267,0.000018877548,0.000916368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969869,0.00002215303,0.000410693,0.00087508146,0.0006837725,0.0010213662],"domain_scores_gemma":[0.9977893,0.00023907694,0.0001302136,0.001131753,0.00044400516,0.00026560266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010104475,0.0003284343,0.0003328246,0.0003700698,0.00028670463,0.0004921001,0.0027373654,0.00020285093,0.000010297554],"category_scores_gemma":[0.0005294863,0.00030396497,0.00013723875,0.0014279126,0.000056286466,0.00042777657,0.00073990424,0.00024911712,0.00015702599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032943997,0.00015303715,0.0018182679,0.000019020574,0.000054259403,0.000026638341,0.0003610308,0.6175695,0.0001426898,0.1268296,0.08927941,0.16371362],"study_design_scores_gemma":[0.002637457,0.0010797791,0.0026897648,0.00017000697,0.00003082666,0.00001837621,0.00024088754,0.358284,0.015445144,0.010490102,0.6070506,0.0018630255],"about_ca_topic_score_codex":0.000109557026,"about_ca_topic_score_gemma":0.00019315741,"teacher_disagreement_score":0.5177712,"about_ca_system_score_codex":0.00021259076,"about_ca_system_score_gemma":0.00018256725,"threshold_uncertainty_score":0.99994123},"labels":[],"label_agreement":null},{"id":"W982694149","doi":"10.1007/978-1-4020-6270-4_47","title":"P2PNet: A Simulation Architecture for Large-scale P2P systems","year":2007,"lang":"en","type":"book-chapter","venue":"New Technologies, Mobility and Security","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 British Columbia","funders":"","keywords":"Computer science; Speedup; Overhead (engineering); Implementation; Parallel computing; Distributed computing; Scale (ratio); Event (particle physics); Architecture; Discrete event simulation; Simulation; Operating system","score_opus":0.026809069105846607,"score_gpt":0.2654568351356986,"score_spread":0.23864776602985202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W982694149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072990905,0.00756,0.9607229,0.0030889148,0.000782544,0.0040965304,0.00032115408,0.009746954,0.0129510565],"genre_scores_gemma":[0.6068138,0.0018103995,0.31782976,0.0015016061,0.0012674344,0.0010430239,0.00038500052,0.00043704646,0.06891198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957946,0.000025217421,0.0007825621,0.0018466337,0.00058453775,0.0009664429],"domain_scores_gemma":[0.9958209,0.00059437164,0.00038006465,0.0027703303,0.00026122137,0.00017315634],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010891397,0.0007847451,0.0010113079,0.0006936108,0.000314393,0.00027789414,0.0025229964,0.0026296116,0.0000056677927],"category_scores_gemma":[0.00050560926,0.0007516153,0.0002473425,0.00035550792,0.0003056915,0.00024159068,0.0021114713,0.0015162571,0.000016391128],"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.00010298274,0.00012971775,0.00007640916,0.0005348584,0.000114034265,0.0000289042,0.0007406363,0.0025258607,0.00001978361,0.6213643,0.009997231,0.3643653],"study_design_scores_gemma":[0.0003886145,0.00032894703,0.000027802349,0.00016968264,0.000028696242,0.000018241088,0.00007767224,0.027441839,0.00009080644,0.39259565,0.57817715,0.0006548853],"about_ca_topic_score_codex":0.000077622986,"about_ca_topic_score_gemma":0.00088176166,"teacher_disagreement_score":0.6428932,"about_ca_system_score_codex":0.00029211445,"about_ca_system_score_gemma":0.00016473944,"threshold_uncertainty_score":0.9994935},"labels":[],"label_agreement":null}]}